{"meta":{"query_hash":"04a5b40e35b7","filters":{"topic":"Numerical Methods and Algorithms"},"cohort_total":452,"direct_labels_cover":0,"predictions_cover":452,"exported":452,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/04a5b40e35b7","api":"https://metacan.xera.ac/api/v1/cohort?topic=Numerical+Methods+and+Algorithms"},"results":[{"id":"W1041293701","doi":"10.1049/iet-cdt.2014.0188","title":"Accuracy‐aware processor customisation for fixed‐point arithmetic","year":2015,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Latency (audio); Benchmark (surveying); Word (group theory); FLOPS; Microarchitecture; Fixed-point arithmetic; Fixed point; Parallel computing; Computer hardware; Floating point; Computer engineering; Arithmetic; Algorithm; Mathematics","score_opus":0.039268405653066156,"score_gpt":0.3119840696708274,"score_spread":0.27271566401776126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1041293701","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026475312,0.00006523377,0.99426746,0.0017665991,0.00040607303,0.00079561846,0.00001809591,0.001457773,0.0009584003],"genre_scores_gemma":[0.08291347,0.0000060908524,0.9158237,0.0006492037,0.0002365208,0.0002246117,0.000016964052,0.000026596555,0.00010281496],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982666,0.000045118373,0.00037367037,0.00057088054,0.00034795984,0.0003957674],"domain_scores_gemma":[0.99831635,0.00036745184,0.00019511688,0.00051227317,0.00035607157,0.00025273976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004214755,0.00026011802,0.00031209397,0.00014208056,0.00008818424,0.0008948247,0.0010555517,0.0000994845,8.365109e-7],"category_scores_gemma":[0.0002921074,0.00022537854,0.00014412079,0.0004312175,0.00007225659,0.00182854,0.0003898803,0.0001413359,0.000015162996],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012017341,0.000110986664,0.000029129995,0.00003286549,0.000013012736,0.0000070159595,0.00022257303,0.000012095269,0.00007578283,0.004608532,0.011801296,0.98307467],"study_design_scores_gemma":[0.0011951199,0.0022425868,0.00010189792,0.00028690603,0.00002260926,0.00016922146,0.000116545256,0.33330092,0.053804938,0.35718295,0.25005674,0.0015195907],"about_ca_topic_score_codex":0.000008441904,"about_ca_topic_score_gemma":2.397927e-7,"teacher_disagreement_score":0.9815551,"about_ca_system_score_codex":0.000103861064,"about_ca_system_score_gemma":0.00012058678,"threshold_uncertainty_score":0.91906697},"labels":[],"label_agreement":null},{"id":"W104575591","doi":"","title":"Can we work around numerical methods? an insight","year":2006,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Van der Pol oscillator; Oscillation (cell signaling); Resistor; Stability (learning theory); Physics; Relaxation oscillator; Work (physics); Hill differential equation; Mathematics; Differential equation; Computer science; Nonlinear system; Ordinary differential equation; Quantum mechanics; Voltage; Exact differential equation","score_opus":0.1645280250281555,"score_gpt":0.40720624538023387,"score_spread":0.24267822035207837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W104575591","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004290864,0.00005300741,0.981323,0.0079019,0.0006482713,0.0001576332,0.0000070892233,0.00018141857,0.009298583],"genre_scores_gemma":[0.47714195,0.000010700451,0.521624,0.0006288928,0.0003572415,0.000028221359,0.000007463487,0.000011354904,0.00019017752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968005,0.0005306596,0.00057194073,0.0007748796,0.00088949996,0.00043252826],"domain_scores_gemma":[0.9979671,0.000657766,0.00017409286,0.00042174544,0.0005688253,0.00021045131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009330149,0.0002697423,0.00029122183,0.00021370033,0.00027239663,0.0005312213,0.0011398557,0.00012815253,0.00017087585],"category_scores_gemma":[0.00032801589,0.00024073347,0.00009955155,0.0012738098,0.00015463778,0.0004579942,0.00013286762,0.00039036738,0.00025521294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009380983,0.00015476739,0.00001111232,0.0000011924504,0.0000034284024,0.000004576804,0.00008549039,0.00066585006,0.00062664587,0.5650364,0.000032976634,0.43336815],"study_design_scores_gemma":[0.000019000525,0.00014303674,0.00029970214,0.00001873241,0.0000026888551,0.000004636401,0.000050984665,0.22095859,0.015723359,0.7596275,0.0028592602,0.00029251617],"about_ca_topic_score_codex":0.00016665914,"about_ca_topic_score_gemma":0.000024931986,"teacher_disagreement_score":0.47671285,"about_ca_system_score_codex":0.0001294493,"about_ca_system_score_gemma":0.00027594742,"threshold_uncertainty_score":0.98168254},"labels":[],"label_agreement":null},{"id":"W121426693","doi":"","title":"Closest Approximations to Real Numbers.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Approximations of π; Applied mathematics","score_opus":0.016039097992457063,"score_gpt":0.28864665079401153,"score_spread":0.27260755280155446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121426693","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11354506,0.000064903135,0.7630694,0.026520995,0.005033095,0.0005926694,0.0000051682914,0.00093909394,0.0902296],"genre_scores_gemma":[0.28850338,0.000008023013,0.71008265,0.0007179935,0.00003834301,0.000028711114,0.0000010172724,0.000010034668,0.0006098456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892664,0.00006917845,0.00018578827,0.00030957177,0.00022969558,0.00027911764],"domain_scores_gemma":[0.9990714,0.00010516757,0.000044194643,0.0005079026,0.00006356076,0.00020777198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024361686,0.0001113862,0.00014473185,0.00005888751,0.00012526088,0.00011822044,0.00068097364,0.000042856518,0.000019500836],"category_scores_gemma":[0.00006359929,0.00010481002,0.00005270701,0.00057987485,0.000020989639,0.00034196154,0.00021072464,0.000114012386,0.0005098808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.447422e-7,0.0000888898,0.00014570454,0.0000016728358,0.0000046555265,0.0000027995457,0.00022722779,0.000013829154,0.00016055841,0.890331,0.0030611153,0.10596175],"study_design_scores_gemma":[0.0005181606,0.00015641078,0.0033635267,0.0000139035,0.0000059141394,0.00001169182,0.000024129551,0.01862214,0.0017467615,0.89541036,0.079745024,0.0003819831],"about_ca_topic_score_codex":0.000065670574,"about_ca_topic_score_gemma":0.0000031248312,"teacher_disagreement_score":0.17495833,"about_ca_system_score_codex":0.00005614534,"about_ca_system_score_gemma":0.000034043278,"threshold_uncertainty_score":0.6553656},"labels":[],"label_agreement":null},{"id":"W126608498","doi":"","title":"Concurrent programming and composite Newton methods","year":2008,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Newton's method; Convergence (economics); A priori and a posteriori; Local convergence; Computer science; Steffensen's method; Newton's method in optimization; Mathematical optimization; Nonlinear system; Newton fractal; Algebraic equation; Mathematics; Applied mathematics; Algorithm; Iterative method","score_opus":0.05110804598128221,"score_gpt":0.36767481350249875,"score_spread":0.31656676752121654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W126608498","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001854232,0.0003529494,0.9956208,0.00076495204,0.0002489212,0.00008247747,1.1563526e-7,0.00014825913,0.00092731416],"genre_scores_gemma":[0.0047889543,0.000036143047,0.9945378,0.00024853775,0.000036123045,0.0000064381984,1.9969183e-7,0.0000035413052,0.00034226474],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919194,0.00014392486,0.00012462078,0.00024820335,0.00010472681,0.00018655957],"domain_scores_gemma":[0.9994859,0.00015477563,0.00003211878,0.00017230389,0.000028798495,0.00012612261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026925982,0.00008438486,0.00013784536,0.000030819134,0.00012617464,0.000063506974,0.00022833874,0.00002277897,0.0000064498827],"category_scores_gemma":[0.000016798367,0.000062372164,0.000031945332,0.00020719945,0.00007037654,0.00017015479,0.0001966152,0.000081230064,0.0000064141254],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.0493883e-7,0.000021097116,0.00033553655,0.0000026935425,0.000003655517,0.0000074962577,0.00012905519,5.5403507e-7,0.00090779155,0.0144608505,0.000075695185,0.98405534],"study_design_scores_gemma":[0.0011684129,0.00060381845,0.018960638,0.000034934943,0.00001514868,0.0007121164,0.00005546651,0.33685708,0.03813621,0.009687824,0.5928217,0.0009466171],"about_ca_topic_score_codex":0.000027213991,"about_ca_topic_score_gemma":1.4093337e-7,"teacher_disagreement_score":0.98310876,"about_ca_system_score_codex":0.0000072562448,"about_ca_system_score_gemma":0.000012272669,"threshold_uncertainty_score":0.2543463},"labels":[],"label_agreement":null},{"id":"W132978406","doi":"","title":"A computational approach to custom data representation for hardware accelerators","year":2010,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Robustness (evolution); Scalability; Satisfiability modulo theories; Floating point; Double-precision floating-point format; Computation; Computer engineering; Algorithm; Theoretical computer science; Parallel computing; Computational science","score_opus":0.11271036209771411,"score_gpt":0.3820106181041404,"score_spread":0.26930025600642626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W132978406","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006604106,0.0000018937874,0.9948185,0.0011897931,0.00044305093,0.00029787602,0.00002129996,0.00011314483,0.00245402],"genre_scores_gemma":[0.013521033,1.4828308e-7,0.9851617,0.00077051413,0.00016194105,0.000042555308,0.000058680776,0.0000061285227,0.00027725895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897444,0.00002890714,0.00014552815,0.00050105166,0.00019141931,0.00015864694],"domain_scores_gemma":[0.99882877,0.0001858342,0.000034947585,0.00071869005,0.00010680567,0.000124927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032304888,0.000076113385,0.00010252561,0.00005364956,0.00010072589,0.00021801071,0.0012069652,0.000032420718,0.00001306239],"category_scores_gemma":[0.00017365716,0.00006149087,0.00002800237,0.0003452585,0.00001530956,0.00051060895,0.00045478786,0.000089188965,0.000022793161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065948884,0.00016790828,0.00034071755,0.000010902364,0.000016403683,7.8218847e-7,0.00022452777,0.0012216693,0.0009538985,0.22698249,0.024597699,0.7454764],"study_design_scores_gemma":[0.00019058312,0.00002681949,0.0011658408,0.0000011413533,0.0000024218257,0.0000049068094,0.00002307169,0.95719427,0.0005173253,0.013957148,0.026789146,0.00012734185],"about_ca_topic_score_codex":0.000024259356,"about_ca_topic_score_gemma":0.0000012857363,"teacher_disagreement_score":0.9559726,"about_ca_system_score_codex":0.000005399149,"about_ca_system_score_gemma":0.000040717903,"threshold_uncertainty_score":0.25075248},"labels":[],"label_agreement":null},{"id":"W138020119","doi":"","title":"Taking architecture and compiler into account in formal proofs of numerical programs","year":2012,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Compiler; Computer science; Mathematical proof; Computation; Programming language; Parallel computing; Code (set theory); Architecture; Rounding; Optimizing compiler; Point (geometry); Floating point; Compiler correctness; Set (abstract data type); Mathematics; Operating system","score_opus":0.020483212949000337,"score_gpt":0.2664808879839192,"score_spread":0.24599767503491887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W138020119","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028160686,0.001114666,0.96311545,0.003162473,0.00020505374,0.00052391633,0.0000056088656,0.00012154861,0.0035905899],"genre_scores_gemma":[0.49038017,0.00005078868,0.5093545,0.00003737529,0.00001741989,0.00005634954,0.000022276276,0.000015242998,0.00006589844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99458915,0.0031694926,0.0006004498,0.00069838605,0.00044454267,0.0004980014],"domain_scores_gemma":[0.9962405,0.0008096315,0.0006614957,0.0014665491,0.0006205427,0.00020130085],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0050147497,0.0003152243,0.00052038545,0.00020151027,0.00014568029,0.00031974906,0.001661699,0.0002374985,0.000016651176],"category_scores_gemma":[0.0005657738,0.0002869708,0.00013864049,0.0005584255,0.0002404345,0.00030328298,0.0035000658,0.00085478474,0.0000034032273],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004397102,0.0004329166,0.0034260512,0.00020568393,0.000021099728,0.000002007149,0.009079269,0.000036675312,0.0005830737,0.043132972,0.0000070472015,0.9430688],"study_design_scores_gemma":[0.0028902544,0.000011247532,0.10854527,0.009816629,0.00010516316,0.000114938826,0.0002956086,0.6780823,0.045113068,0.13017079,0.0217018,0.003152935],"about_ca_topic_score_codex":0.0010945033,"about_ca_topic_score_gemma":0.00012747802,"teacher_disagreement_score":0.9399159,"about_ca_system_score_codex":0.00007060163,"about_ca_system_score_gemma":0.00014013947,"threshold_uncertainty_score":0.9999582},"labels":[],"label_agreement":null},{"id":"W1451216173","doi":"10.1016/j.csda.2015.07.015","title":"Fast and accurate computation for kernel estimators","year":2015,"lang":"en","type":"article","venue":"Computational Statistics & Data Analysis","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Humanities and Social Science Fund of Ministry of Education of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Estimator; Univariate; Computation; Algorithm; Kernel (algebra); Grid; Computational complexity theory; Kernel density estimation; Computer science; Multivariate statistics; Mathematics; Computational statistics; Polynomial; Mathematical optimization; Statistics","score_opus":0.1105769333221848,"score_gpt":0.394072255127822,"score_spread":0.2834953218056372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1451216173","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017460504,0.00007926762,0.99721116,0.0003575954,0.00013878828,0.00012849768,0.0018237894,0.000063301995,0.000023025941],"genre_scores_gemma":[0.023242094,0.000006287742,0.97324026,0.0001747997,0.00004080638,0.000009631741,0.0032515125,0.00000896938,0.00002566937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983396,0.00010653258,0.00035450724,0.00060348556,0.0003913957,0.00020449268],"domain_scores_gemma":[0.99775416,0.0009791163,0.00019434845,0.00040978845,0.00041789212,0.0002446918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064054003,0.00015336505,0.0003067436,0.00019803697,0.00015373332,0.00037751376,0.0006229804,0.0000336224,0.000003622624],"category_scores_gemma":[0.0004619315,0.00014553608,0.0000425171,0.0009378959,0.000075040785,0.00050737365,0.00047088624,0.00006832111,0.000011356608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011085341,0.00008106548,0.0016362256,0.000021991968,0.00057810126,0.000010607295,0.00019501288,0.46088699,0.0000015512669,0.11471822,0.008826198,0.41303295],"study_design_scores_gemma":[0.00028830828,0.000040536543,0.009145746,0.000002510318,0.00022629293,0.0000034565944,0.00001128674,0.8269182,6.4263753e-7,0.16256936,0.00064155285,0.00015212511],"about_ca_topic_score_codex":0.00010686033,"about_ca_topic_score_gemma":0.000012010836,"teacher_disagreement_score":0.41288084,"about_ca_system_score_codex":0.00003242569,"about_ca_system_score_gemma":0.00011715803,"threshold_uncertainty_score":0.59347886},"labels":[],"label_agreement":null},{"id":"W1480546160","doi":"10.1109/iscas.2004.1329390","title":"A programmable base 2D-LNS MAC with self-generated look-up tables","year":2004,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Dram; Computer science; Adder; Binary number; Accumulator (cryptography); Lookup table; Logarithm; Parallel computing; Binary data; Computer hardware; Reduction (mathematics); Computational science; Algorithm; Arithmetic; Mathematics; Latency (audio); Operating system","score_opus":0.015827535200085223,"score_gpt":0.25248664727104575,"score_spread":0.23665911207096052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480546160","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056578866,0.00007576952,0.990446,0.0011074807,0.0001879441,0.0002238618,0.0000020171399,0.0006120481,0.0016870028],"genre_scores_gemma":[0.014852551,0.000009964326,0.98292387,0.00058010954,0.00006421222,0.000039844504,0.0000028737868,0.000014110082,0.001512498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985922,0.00005779111,0.00016683686,0.00046174283,0.00026678797,0.00045466854],"domain_scores_gemma":[0.999137,0.00003285342,0.000053753738,0.000458169,0.00010456286,0.00021370215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023371508,0.00017760905,0.00019076548,0.00005634014,0.00014193542,0.00029715121,0.0004976562,0.00004496059,0.000057677316],"category_scores_gemma":[0.000013275386,0.000115139206,0.00004316552,0.0008806249,0.00004162552,0.0003738183,0.00013493697,0.00011660154,0.00006856742],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037609676,0.0012498382,0.00067642785,0.00006470866,0.00016635796,0.00041153282,0.0007347275,0.00259541,0.0060453145,0.3014067,0.0011352814,0.68547606],"study_design_scores_gemma":[0.009309187,0.0039657997,0.00074019906,0.00019701038,0.00011180314,0.0005021022,0.00030051408,0.40981823,0.36009932,0.05776186,0.1541951,0.0029988945],"about_ca_topic_score_codex":0.00061872,"about_ca_topic_score_gemma":0.000036794896,"teacher_disagreement_score":0.6824772,"about_ca_system_score_codex":0.000044276767,"about_ca_system_score_gemma":0.00015468075,"threshold_uncertainty_score":0.46952406},"labels":[],"label_agreement":null},{"id":"W1485745802","doi":"10.1049/iet-cds.2009.0329","title":"High-speed and low-power reconfigurable architectures of 2-digit two-dimensional logarithmic number system-based recursive multipliers","year":2010,"lang":"en","type":"article","venue":"IET Circuits Devices & Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"CMC Microsystems","keywords":"Computer science; Multiplication (music); Adder; Digital signal processing; Logarithm; Parallel computing; Matrix multiplication; Computer hardware; Mathematics","score_opus":0.009249921569249768,"score_gpt":0.24774499775730793,"score_spread":0.23849507618805815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485745802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94662493,0.0003388425,0.038500693,0.0002846589,0.00713576,0.0012491745,0.00010093423,0.0004091421,0.005355861],"genre_scores_gemma":[0.980726,7.5440516e-7,0.018720526,0.00015544698,0.000194867,0.00003580365,0.0000065487693,0.000033402655,0.00012662221],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968788,0.0003417675,0.0007386759,0.0008556832,0.00061794923,0.00056713127],"domain_scores_gemma":[0.997112,0.0008247092,0.0005529864,0.0008362577,0.00034027777,0.00033378552],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080398895,0.00038319224,0.00076684344,0.0001783718,0.00018367656,0.00028582982,0.00086822594,0.00020016407,0.000026431682],"category_scores_gemma":[0.00009061491,0.0003151592,0.00014252601,0.00050522195,0.00020896233,0.00024677435,0.00009124258,0.0004721705,0.000056485136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021583562,0.0017058029,0.026138576,0.007967766,0.00158532,0.00077648135,0.004882322,0.050914835,0.4297469,0.20211391,0.0025442187,0.27140802],"study_design_scores_gemma":[0.019669365,0.0020567863,0.028099526,0.009004109,0.00042004057,0.003666281,0.0021804217,0.71263504,0.18414675,0.011789302,0.01828841,0.0080439625],"about_ca_topic_score_codex":0.0008079134,"about_ca_topic_score_gemma":0.000035598776,"teacher_disagreement_score":0.6617202,"about_ca_system_score_codex":0.00005273745,"about_ca_system_score_gemma":0.0001530016,"threshold_uncertainty_score":0.99993},"labels":[],"label_agreement":null},{"id":"W1502108548","doi":"10.48550/arxiv.1307.4097","title":"Some notes on applying computational divided differencing in optimization","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; U.S. Air Force","keywords":"Computation; Automatic differentiation; Transformation (genetics); Floating point; Point (geometry); Computer science; Algorithm; Mathematics; Finite difference; Constant (computer programming); Computational complexity theory; Program transformation; Theoretical computer science; Geometry; Mathematical analysis; Programming language","score_opus":0.09345625186291007,"score_gpt":0.21820476796161686,"score_spread":0.1247485160987068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502108548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06951368,0.000020161307,0.9294017,0.00011457964,0.0003864311,0.00031093892,0.0000036514718,0.00012748825,0.00012139557],"genre_scores_gemma":[0.7760318,0.000034192522,0.22363171,0.00014429829,0.000076595665,0.0000039100987,0.000011856446,0.000011242829,0.000054374057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983198,0.0002085778,0.00020953095,0.00085934356,0.00012117672,0.00028154187],"domain_scores_gemma":[0.998612,0.00052808103,0.00019567311,0.0004697891,0.00008034639,0.00011413607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019469092,0.00025865232,0.00032184497,0.00032006105,0.000106657164,0.00016368754,0.0009223838,0.00017050454,0.000016537619],"category_scores_gemma":[0.00007710093,0.00026627816,0.00010926998,0.00046791648,0.000047250778,0.0003898806,0.0010517666,0.00049436203,0.0000390347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034357975,0.00006161645,0.00069959264,0.000019714718,0.000012912912,0.000033108816,0.000068176836,0.9072773,0.000007861334,0.08587738,0.0000049729806,0.005933949],"study_design_scores_gemma":[0.00024715147,0.000026554284,0.0024583105,0.00009293642,0.000006505218,5.4146426e-7,0.000009804192,0.8307298,0.000027911741,0.16614519,0.0000043243863,0.0002510049],"about_ca_topic_score_codex":0.0001788095,"about_ca_topic_score_gemma":0.000001964801,"teacher_disagreement_score":0.7065181,"about_ca_system_score_codex":0.00018980063,"about_ca_system_score_gemma":0.00007384582,"threshold_uncertainty_score":0.99997896},"labels":[],"label_agreement":null},{"id":"W1509016053","doi":"10.1007/11512622_17","title":"CORDIC-Augmented Sandbridge Processor for Channel Equalization","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"CORDIC; Computer science; Channel (broadcasting); Set (abstract data type); Equalization (audio); Orthogonal frequency-division multiplexing; Scheme (mathematics); Multiplexing; Parallel computing; Computer hardware; Instruction set; Rotation (mathematics); Arithmetic; Field-programmable gate array; Telecommunications; Mathematics; Programming language; Artificial intelligence","score_opus":0.032232120048418786,"score_gpt":0.3016480154376967,"score_spread":0.2694158953892779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509016053","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004531187,0.0005095652,0.9945333,0.001284273,0.0018058373,0.00077837973,0.000014725097,0.0001974114,0.0008719723],"genre_scores_gemma":[0.0042743874,0.00006015679,0.9911222,0.0024936364,0.0012009676,0.000052425115,0.000014301652,0.00004643335,0.0007354998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99633133,0.000035903344,0.0005660848,0.0015326345,0.00081217935,0.00072184816],"domain_scores_gemma":[0.99766296,0.00053930155,0.00036740926,0.00085371063,0.00037329385,0.00020333412],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010119292,0.0005038136,0.00057853403,0.0005555291,0.00028927234,0.00048016894,0.0024628122,0.0002656546,0.000011923181],"category_scores_gemma":[0.00018942794,0.00044002372,0.00015505255,0.0007011586,0.00034469485,0.0005855301,0.0007008222,0.00041036052,0.000017393808],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075414905,0.00003500583,0.000002238573,0.00005564497,0.000008427052,0.000008854259,0.00022471203,0.006826845,0.00009528784,0.015829125,0.00003499374,0.9768713],"study_design_scores_gemma":[0.0004131506,0.00027950984,0.00001666272,0.00026848074,0.000008824631,0.000022671531,9.65936e-8,0.8344172,0.0020882536,0.15399745,0.007877509,0.0006101585],"about_ca_topic_score_codex":0.000008221167,"about_ca_topic_score_gemma":0.000008155216,"teacher_disagreement_score":0.97626114,"about_ca_system_score_codex":0.00021492699,"about_ca_system_score_gemma":0.0003492627,"threshold_uncertainty_score":0.99980515},"labels":[],"label_agreement":null},{"id":"W1509427512","doi":"10.1007/978-3-540-30494-4_4","title":"A Methodology for the Formal Verification of FFT Algorithms in HOL","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Fast Fourier transform; Mathematical proof; Computer science; Algorithm; Automated theorem proving; Split-radix FFT algorithm; Fixed point; Proof assistant; Formal verification; Arithmetic; Mathematics; Theoretical computer science; Programming language; Fourier transform; Fourier analysis","score_opus":0.0689537982563607,"score_gpt":0.3314530027488482,"score_spread":0.26249920449248754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509427512","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013167863,0.0005084872,0.9958549,0.0012120517,0.0014980137,0.0006785834,0.000006491044,0.000037597572,0.00019066564],"genre_scores_gemma":[0.006210668,0.000054980814,0.99282485,0.00057208014,0.00024000058,0.000039325365,0.0000016927229,0.000017640907,0.000038775186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718285,0.00009322783,0.0006197711,0.0009830409,0.00053007435,0.00059106026],"domain_scores_gemma":[0.99559855,0.0026976417,0.0003652236,0.001057951,0.00020277283,0.00007785875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031751094,0.00033202232,0.00057351566,0.0004986042,0.000153974,0.00012403575,0.0030165666,0.00025895517,0.000005574741],"category_scores_gemma":[0.00032975955,0.00023515195,0.00016357085,0.0007124004,0.00070128817,0.00040954343,0.0006839633,0.0005605681,0.0000029215412],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007252801,0.000021019578,0.0000057718203,0.000027408056,0.000006319072,0.000005601102,0.00050256064,0.009796079,0.00026842472,0.0729924,0.0000010419733,0.9163661],"study_design_scores_gemma":[0.00030827822,0.00024437456,0.00020792316,0.00012743541,0.0000069084385,0.000020591218,4.0856756e-7,0.539142,0.002479405,0.45661265,0.0005770412,0.0002729692],"about_ca_topic_score_codex":0.00008274985,"about_ca_topic_score_gemma":0.000026779488,"teacher_disagreement_score":0.9160932,"about_ca_system_score_codex":0.00018302078,"about_ca_system_score_gemma":0.00046261796,"threshold_uncertainty_score":0.9589218},"labels":[],"label_agreement":null},{"id":"W1519061151","doi":"","title":"Oscillator verification with probability one","year":2012,"lang":"en","type":"article","venue":"Formal Methods in Computer-Aided Design","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Soundness; Generalization; Computer science; Differential (mechanical device); Formal verification; Ring oscillator; Runtime verification; Task (project management); Ring (chemistry); Control theory (sociology); Theoretical computer science; Algorithm; Electronic engineering; Mathematics; Engineering; Programming language; Artificial intelligence","score_opus":0.1107677508075074,"score_gpt":0.356863359922196,"score_spread":0.24609560911468858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519061151","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016573439,0.00011682788,0.9960882,0.00016560504,0.00083016744,0.0006672789,9.44557e-7,0.0002551969,0.0002184262],"genre_scores_gemma":[0.008825759,0.000006679068,0.990506,0.00023375615,0.00029225348,0.000100796045,9.944323e-7,0.00002059013,0.000013152192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953536,0.0021732727,0.00057089,0.00058951107,0.0003999342,0.0009128076],"domain_scores_gemma":[0.99711186,0.0012581117,0.00022137692,0.0009830992,0.00011717835,0.00030838026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072674183,0.00029451321,0.00047644085,0.0001843221,0.00015081913,0.00014916009,0.0009257155,0.00012940654,0.000012447171],"category_scores_gemma":[0.0001873039,0.00023684005,0.00008232517,0.0011444433,0.000098344535,0.0019252201,0.00034216527,0.00034870833,0.000027861053],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041356063,0.00034302787,0.0009496202,0.000031423504,0.000017532582,0.000002494029,0.00044048348,0.0010485211,0.0010558979,0.021646172,0.000023452127,0.97440004],"study_design_scores_gemma":[0.0016497823,0.0018020079,0.039951887,0.00014416815,0.000028217519,0.00008616716,0.000018845818,0.83671665,0.040266346,0.07375305,0.004310474,0.0012723968],"about_ca_topic_score_codex":0.000019432178,"about_ca_topic_score_gemma":2.9235613e-7,"teacher_disagreement_score":0.9731276,"about_ca_system_score_codex":0.00014538104,"about_ca_system_score_gemma":0.00009069856,"threshold_uncertainty_score":0.96580565},"labels":[],"label_agreement":null},{"id":"W1519484178","doi":"10.1109/acssc.1999.831901","title":"VLSI improvements in a binary multiplier based on analog digits","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; Nortel (Canada)","funders":"","keywords":"Adder; Multiplier (economics); Analog multiplier; Binary number; Computer science; CMOS; Very-large-scale integration; Electronic circuit; Arithmetic; Numerical digit; Electronic engineering; Integrated injection logic; Digital electronics; Computer hardware; Mathematics; Digital signal processing; Electrical engineering; Analog signal; Engineering; Pass transistor logic; Embedded system","score_opus":0.01807006003973717,"score_gpt":0.2774211084397337,"score_spread":0.25935104839999656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519484178","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008441158,0.000009516335,0.96593785,0.00032381804,0.0002370202,0.00014434445,7.437141e-7,0.0000720908,0.02483348],"genre_scores_gemma":[0.37820053,0.0000010511603,0.61909986,0.0020979838,0.000010056938,0.00001541125,4.1720884e-7,0.0000054436173,0.00056925527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990124,0.00009415483,0.00014908281,0.00032069656,0.0001758451,0.00024779042],"domain_scores_gemma":[0.9994128,0.00012148183,0.000028175056,0.0003330148,0.00001771977,0.00008681077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026648794,0.00010040997,0.00011661673,0.00010780057,0.000033059812,0.00005887386,0.00029232245,0.00003193618,0.000038151567],"category_scores_gemma":[0.00008367997,0.00007512323,0.00003910404,0.00051235367,0.000014388152,0.00015577517,0.0000514613,0.000091731854,0.000043974458],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008844363,0.00081189733,0.006925252,0.000009071935,0.0000067366823,0.00007948506,0.000056957182,0.00071911584,0.0038044816,0.029741695,0.00027793532,0.9575585],"study_design_scores_gemma":[0.0015868915,0.000566372,0.020384056,0.000025873522,0.000001468273,0.0000013319999,0.00001279282,0.9474719,0.010974637,0.008812043,0.009791025,0.00037157134],"about_ca_topic_score_codex":0.000025873444,"about_ca_topic_score_gemma":0.000001698468,"teacher_disagreement_score":0.95718694,"about_ca_system_score_codex":0.000028668346,"about_ca_system_score_gemma":0.000030381174,"threshold_uncertainty_score":0.30634364},"labels":[],"label_agreement":null},{"id":"W1519677650","doi":"10.1090/s0002-9939-04-07511-2","title":"A complete system of orthogonal step functions","year":2004,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Los Alamos National Laboratory; University of Alberta; University of Calgary","keywords":"Orthonormal basis; Almost everywhere; Fourier series; Function (biology); Walsh function; Mathematics; Orthogonal functions; Fourier transform; Series (stratigraphy); Interval (graph theory); Pure mathematics; Orthonormality; Mathematical analysis; Combinatorics; Physics","score_opus":0.018348357565856063,"score_gpt":0.2568266300334677,"score_spread":0.2384782724676116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519677650","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101677895,0.000015904721,0.8940713,0.0012745961,0.00007045565,0.00021134458,0.000010755609,0.000102063685,0.002565727],"genre_scores_gemma":[0.37468243,0.0000020333532,0.62512326,0.00011360885,0.000028506318,0.00001310861,9.098394e-8,0.000007875092,0.000029104778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862474,0.000011781051,0.00040526644,0.00023989775,0.00047484782,0.00024345596],"domain_scores_gemma":[0.9987899,0.00014191245,0.0005435662,0.00021570614,0.00021613915,0.00009276204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043551205,0.00013641348,0.00045069223,0.000018347562,0.00011719652,0.000034297558,0.00095059705,0.000027061884,0.000003901135],"category_scores_gemma":[0.00010897371,0.00008521344,0.00042499547,0.0009379493,0.0005659183,0.00013763022,0.00040700377,0.0001585004,0.000008586255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006736512,0.00027052307,0.00040222303,0.00053719315,0.00011045968,1.8285694e-7,0.0009046205,0.000020076763,0.021643052,0.96687144,0.00030238216,0.008931109],"study_design_scores_gemma":[0.0027562764,0.0018317618,0.017501852,0.0020731206,0.00038552782,0.00028890636,0.01730789,0.17809659,0.026441446,0.7496858,0.0020611333,0.0015696478],"about_ca_topic_score_codex":0.000019271745,"about_ca_topic_score_gemma":5.24863e-8,"teacher_disagreement_score":0.27300453,"about_ca_system_score_codex":0.00006226983,"about_ca_system_score_gemma":0.000041350657,"threshold_uncertainty_score":0.3474903},"labels":[],"label_agreement":null},{"id":"W1523308008","doi":"10.48550/arxiv.1308.3399","title":"A rapid and highly accurate approximation for the error function of complex argument","year":2013,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University","keywords":"Error function; Exponential function; Function (biology); Approximation error; Simple (philosophy); Decimal; Sigma; Representation (politics); Function approximation; Algorithm; Error analysis; Mathematics; Applied mathematics; Argument (complex analysis); Computer science; Mathematical analysis; Arithmetic; Artificial intelligence; Artificial neural network; Physics","score_opus":0.12545232923082095,"score_gpt":0.31987030420964885,"score_spread":0.1944179749788279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523308008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072739676,0.00039140513,0.92238945,0.0025631022,0.00088391075,0.0008994641,0.000009762876,0.00005837065,0.00006483765],"genre_scores_gemma":[0.5867794,0.00014965169,0.41177058,0.00042815463,0.00023560614,0.0004520154,0.000018238808,0.000017120274,0.00014922195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987104,0.00011767654,0.00034515272,0.00044923427,0.00018106349,0.00019646715],"domain_scores_gemma":[0.99844784,0.00035196275,0.0003759477,0.0006149627,0.00015008285,0.00005923563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051943754,0.00019043083,0.00029289126,0.0000524041,0.0001246525,0.00011054165,0.00056096754,0.00010003013,0.000016832064],"category_scores_gemma":[0.00007152828,0.00012351455,0.000108660046,0.00012502252,0.000076772696,0.0001715259,0.00065814157,0.00020091783,0.000010691356],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034417753,0.00014418479,0.0012829724,0.00039044934,0.00019150466,5.301013e-7,0.0005855602,0.00033296968,0.0050215493,0.013665914,0.0011724905,0.97717744],"study_design_scores_gemma":[0.0006886532,0.00036785795,0.17884164,0.000102088525,0.000098934215,0.0000026682405,0.00007897037,0.75995153,0.0025881834,0.03921447,0.017633194,0.000431792],"about_ca_topic_score_codex":0.000056809655,"about_ca_topic_score_gemma":6.909499e-7,"teacher_disagreement_score":0.97674567,"about_ca_system_score_codex":0.00002329166,"about_ca_system_score_gemma":0.0000343185,"threshold_uncertainty_score":0.5036777},"labels":[],"label_agreement":null},{"id":"W1527731312","doi":"10.1109/cicc.2003.1249404","title":"Low power direct digital frequency synthesizers in 0.18 μm CMOS","year":2004,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"dBc; CMOS; Direct digital synthesizer; Spurious-free dynamic range; 8-bit; Electronic engineering; Accumulator (cryptography); Frequency divider; Electrical engineering; Low-power electronics; Frequency synthesizer; Computer science; Physics; Power (physics); Phase noise; Phase-locked loop; Engineering; Power consumption","score_opus":0.012292665460283158,"score_gpt":0.25548893174215187,"score_spread":0.24319626628186872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527731312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0093432395,0.000051173254,0.8716559,0.0012050128,0.0003336174,0.00011083695,0.000002111239,0.00021085041,0.1170873],"genre_scores_gemma":[0.57728386,0.00000412267,0.4219501,0.00035889464,0.00002423392,0.0000073255173,2.2425921e-7,0.000007612263,0.0003635904],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888974,0.000035561443,0.00019224297,0.00036026968,0.00020315548,0.000318997],"domain_scores_gemma":[0.99930924,0.00015335192,0.000032947686,0.0003597573,0.000022512391,0.00012216889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018255891,0.00012781055,0.00017652808,0.00007278263,0.00003504835,0.0002030337,0.00056403806,0.00004739264,0.00009520244],"category_scores_gemma":[0.00017530633,0.0000973476,0.000070810485,0.0004919666,0.00004406158,0.00065079075,0.00011812572,0.00011435699,0.00016196536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054089114,0.00063828635,0.0018389552,0.000013017751,0.000023023884,0.00034724342,0.00057371525,0.00018535792,0.0026678382,0.09967422,0.00023086471,0.89380205],"study_design_scores_gemma":[0.0037727118,0.0013603903,0.02751882,0.00046407376,0.000011773595,0.00014141272,0.00033611356,0.010363909,0.10223541,0.84010845,0.010398492,0.0032884323],"about_ca_topic_score_codex":0.000108589986,"about_ca_topic_score_gemma":0.0000030224437,"teacher_disagreement_score":0.89051366,"about_ca_system_score_codex":0.000064156826,"about_ca_system_score_gemma":0.000052071722,"threshold_uncertainty_score":0.39697197},"labels":[],"label_agreement":null},{"id":"W1530378642","doi":"10.1002/3527600434.eap407","title":"Scientific Computing by Numerical Methods","year":2003,"lang":"en","type":"other","venue":"digital Encyclopedia of Applied Physics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Library science; Encyclopedia; Citation; Computer science; Media studies; Sociology","score_opus":0.01092870287517194,"score_gpt":0.2815704553938861,"score_spread":0.27064175251871414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530378642","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.1752137e-7,0.00014228566,0.5113225,0.000005315295,0.0006165779,0.00014676922,0.000045456647,0.00014911559,0.48757118],"genre_scores_gemma":[0.00006375353,0.000036958114,0.89606154,0.000087483604,0.0003193362,0.0000139350805,0.00007052791,0.00027306957,0.10307338],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974341,0.00006594124,0.00045622562,0.0009759656,0.00055167393,0.00051612407],"domain_scores_gemma":[0.9979998,0.0002588732,0.0005180645,0.00095482427,0.000057915895,0.00021050565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002788597,0.00047373888,0.0007912837,0.000106804255,0.00008125689,0.0004076067,0.001322538,0.00020388552,0.00004406986],"category_scores_gemma":[0.000042655698,0.0004401871,0.00020982162,0.0011218501,0.0002707168,0.00020004889,0.0004486896,0.00033829833,0.000111431415],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012634653,0.00018645839,0.0000024612705,0.000049612856,0.00004260575,0.0000014926167,0.00007591611,0.000016396536,0.00007920598,0.03860461,0.168093,0.792847],"study_design_scores_gemma":[0.00017618532,0.000033027107,0.0000010776841,0.00003676133,0.000014266151,0.0000011608171,0.000010045278,0.0029090613,0.0006079681,0.02333065,0.97233486,0.0005449412],"about_ca_topic_score_codex":0.000007198239,"about_ca_topic_score_gemma":3.309905e-8,"teacher_disagreement_score":0.80424184,"about_ca_system_score_codex":0.00002760563,"about_ca_system_score_gemma":0.000115460316,"threshold_uncertainty_score":0.999805},"labels":[],"label_agreement":null},{"id":"W1535381111","doi":"10.1109/iscas.2002.1010569","title":"An FPGA implementation of an on-line radix-4 CORDIC 2-D IDCT core","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"CORDIC; Field-programmable gate array; Computer science; Virtex; Arithmetic; Parallel computing; Computer hardware; Adder; Mathematics; Latency (audio)","score_opus":0.06419104697258005,"score_gpt":0.4020890741059348,"score_spread":0.33789802713335476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535381111","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07685283,0.000008505027,0.9214961,0.000108746804,0.00021167511,0.00010046037,0.0000026481994,0.00006039773,0.0011586564],"genre_scores_gemma":[0.42657658,0.0000027388594,0.5729739,0.000357587,0.000027985781,0.0000035139674,0.0000028936493,0.000004486009,0.00005029322],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990687,0.00013057844,0.0001961896,0.0002511974,0.00018932972,0.00016401305],"domain_scores_gemma":[0.999302,0.000058129746,0.00007139156,0.00040261683,0.00004708397,0.0001187525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036988585,0.00008448844,0.00013150822,0.000051879248,0.000048136586,0.000036305366,0.0003277583,0.000022287553,0.00017926784],"category_scores_gemma":[0.00001604175,0.0000652995,0.000032716387,0.0002883169,0.00002386132,0.00028834777,0.000020166432,0.00005374415,0.000009734469],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025578015,0.00013740665,0.00031559664,0.000002783204,0.0000049188584,0.0000037533346,0.00010267484,0.00007823919,0.0027166863,0.07412743,0.0000681928,0.92243975],"study_design_scores_gemma":[0.0029141556,0.010182242,0.017664399,0.000019495816,0.000020958778,0.000041447744,0.0009819991,0.29940906,0.56347114,0.09689796,0.0075771394,0.0008199931],"about_ca_topic_score_codex":0.00012326987,"about_ca_topic_score_gemma":0.000008840928,"teacher_disagreement_score":0.9216198,"about_ca_system_score_codex":0.000012357865,"about_ca_system_score_gemma":0.00003408319,"threshold_uncertainty_score":0.26628363},"labels":[],"label_agreement":null},{"id":"W1549231341","doi":"10.1109/ccece.1996.548100","title":"New algorithms for the exact computation of the sign of algebraic expressions","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Algorithm; Sign (mathematics); Floating point; Computation; Algebraic number; Mathematics; Algebraic operation; Upper and lower bounds; Computer science","score_opus":0.060792240446100924,"score_gpt":0.308761417173449,"score_spread":0.24796917672734808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549231341","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012378913,0.00019711023,0.99626255,0.002146548,0.00030683455,0.00024847037,0.0000019033073,0.000024148538,0.0006886659],"genre_scores_gemma":[0.12562895,0.00001093627,0.87329835,0.00018817502,0.000059668804,0.000009801318,1.1721896e-7,0.0000049911678,0.0007990156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992072,0.000085818436,0.00021925107,0.00015162458,0.00020844112,0.00012768866],"domain_scores_gemma":[0.99854153,0.00085958635,0.00013635262,0.0003535954,0.000064843916,0.00004406464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022045508,0.000073482304,0.00013051167,0.00002182315,0.00010019799,0.000023224798,0.00074466923,0.000027050397,0.00005225928],"category_scores_gemma":[0.000087847184,0.000033423945,0.000120346114,0.0003470928,0.000049548995,0.000109991604,0.00014491053,0.00005842617,0.0000024360725],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.363065e-7,0.000041947016,0.000012147326,0.000006039831,0.000012199793,9.321099e-8,0.0003189044,0.0004082458,0.0024913428,0.013988651,0.0029967448,0.97972274],"study_design_scores_gemma":[0.0003494288,0.00012569691,0.0014215158,0.000030376556,0.000012583387,0.0000032330438,0.00006019553,0.93663305,0.025360705,0.03369447,0.002214024,0.00009474431],"about_ca_topic_score_codex":0.000055791665,"about_ca_topic_score_gemma":4.509321e-7,"teacher_disagreement_score":0.979628,"about_ca_system_score_codex":0.0000052818564,"about_ca_system_score_gemma":0.00001885873,"threshold_uncertainty_score":0.1383793},"labels":[],"label_agreement":null},{"id":"W1551456964","doi":"10.1049/iet-cdt.2011.0089","title":"Decimal floating-point antilogarithmic converter based on selection by rounding: algorithm and architecture","year":2012,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rounding; Decimal; CORDIC; Computer science; Critical path method; Parallel computing; Algorithm; Floating point; Double-precision floating-point format; Standard cell; Field-programmable gate array; Latency (audio); Architecture; Arithmetic; Computer hardware; Mathematics; Integrated circuit; Engineering","score_opus":0.008669592829528056,"score_gpt":0.25062490886247935,"score_spread":0.24195531603295128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551456964","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008944098,0.000055211785,0.9962223,0.0006158672,0.0003621312,0.0002952989,0.00001592055,0.00094516587,0.0005936685],"genre_scores_gemma":[0.14103556,0.0000044363173,0.857444,0.0012162453,0.00021016136,0.00001758074,0.000010286266,0.00002481748,0.000036938476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819005,0.00010123834,0.00028352978,0.00053248,0.00033606554,0.00055662554],"domain_scores_gemma":[0.9989685,0.00028048267,0.00012149629,0.0003169222,0.000059464248,0.00025312713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033711718,0.00032529782,0.0003098042,0.00018834138,0.00015438447,0.0006934577,0.00047349193,0.00012321779,0.000003352826],"category_scores_gemma":[0.000035125304,0.00027962794,0.00010325765,0.00037886036,0.00010627568,0.0010745915,0.00024329568,0.0003291176,0.0000070803653],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067322926,0.00015907577,0.00040318514,0.000009347913,0.000012178457,0.000004227707,0.000080344704,0.0000037220138,0.00076303445,0.0007735061,0.0025025706,0.99528205],"study_design_scores_gemma":[0.0006803789,0.0020276678,0.00087193726,0.00021103928,0.000016249745,0.00030365033,0.000015535386,0.8758321,0.05573714,0.008352994,0.05468885,0.0012625054],"about_ca_topic_score_codex":0.000015283904,"about_ca_topic_score_gemma":7.8216e-8,"teacher_disagreement_score":0.99401957,"about_ca_system_score_codex":0.000077418896,"about_ca_system_score_gemma":0.000023920322,"threshold_uncertainty_score":0.9999656},"labels":[],"label_agreement":null},{"id":"W1559568018","doi":"10.1007/3-540-47884-1_11","title":"Formalization of Cadence SPW Fixed-Point Arithmetic in HOL","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Rounding; Computer science; HOL; Fixed-point arithmetic; Saturation arithmetic; Correctness; Arithmetic; Division (mathematics); Fixed point; Multiplication (music); Algorithm; Floating point; Arbitrary-precision arithmetic; Mathematics; Programming language","score_opus":0.02162370347798586,"score_gpt":0.26451962028958237,"score_spread":0.2428959168115965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559568018","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006415252,0.00039728577,0.99597394,0.00042541724,0.0010136843,0.00033317227,0.0000033448973,0.000060887312,0.0017280864],"genre_scores_gemma":[0.054092404,0.00010581373,0.9448105,0.00059912406,0.00017530001,0.000008586593,0.0000014852557,0.000023812903,0.0001829765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963786,0.00006798367,0.0007661948,0.0012073865,0.0009711053,0.0006087167],"domain_scores_gemma":[0.99768865,0.00049860025,0.0003898957,0.001082847,0.00019539705,0.00014459123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010944264,0.0004223137,0.00064425654,0.0009624466,0.0000925946,0.0002024268,0.0026853157,0.00027826297,0.000030498457],"category_scores_gemma":[0.00020016731,0.0003762246,0.00012148809,0.0012972024,0.00056365976,0.0007178035,0.0009904808,0.0007160661,0.000017567845],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002338094,0.000049388727,0.00011351278,0.000061102415,0.000003891116,0.000073672956,0.0006702073,0.019799491,0.00015409672,0.021599771,0.000005896122,0.9574666],"study_design_scores_gemma":[0.00019801321,0.0002060178,0.0002801296,0.00052135455,0.000004042434,0.000050846545,1.7346579e-7,0.8219631,0.0030984622,0.17281832,0.0003793865,0.00048020695],"about_ca_topic_score_codex":0.000055577668,"about_ca_topic_score_gemma":0.00001756159,"teacher_disagreement_score":0.9569864,"about_ca_system_score_codex":0.00020343911,"about_ca_system_score_gemma":0.00018698956,"threshold_uncertainty_score":0.999869},"labels":[],"label_agreement":null},{"id":"W1568449537","doi":"10.1109/iscas.2002.1010715","title":"Hardware optimized direct digital frequency synthesizer architecture with 60 dBc spectral purity","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Direct digital synthesizer; VHDL; Computer science; Field-programmable gate array; dBc; Sine; Electronic engineering; Frequency synthesizer; Nyquist frequency; Computer hardware; Lookup table; Sine wave; Bandwidth (computing); Phase noise; Engineering; Electrical engineering; Phase-locked loop; Telecommunications; Mathematics","score_opus":0.01049538702158869,"score_gpt":0.22954164213217132,"score_spread":0.21904625511058262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568449537","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013476829,0.00009247465,0.8903993,0.00084333477,0.0001660239,0.00017534947,0.000006824667,0.0003207677,0.10664829],"genre_scores_gemma":[0.062952206,0.000006146666,0.9351157,0.00023907775,0.00006124446,0.000016124044,9.322257e-7,0.000017058164,0.0015915062],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982183,0.00016196987,0.00020242232,0.000584671,0.00034076863,0.00049187016],"domain_scores_gemma":[0.9987684,0.0002798692,0.00006272987,0.000602482,0.0000532196,0.00023333376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022781656,0.00025451553,0.0003397804,0.000062951214,0.0001225232,0.0004536295,0.00062092044,0.000060117796,0.00019866871],"category_scores_gemma":[0.00022217653,0.00015884238,0.00012493113,0.00046001322,0.00009050132,0.00047526087,0.00007491616,0.00024094225,0.00004873008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101496145,0.0010600477,0.0021348991,0.000055338463,0.0003661454,0.0013322458,0.00090301636,0.001981794,0.0015843294,0.22421025,0.0011422957,0.76512814],"study_design_scores_gemma":[0.010081165,0.0037920868,0.011096408,0.000425821,0.00018666263,0.0022932058,0.0003178303,0.04467945,0.11174904,0.6796032,0.12732878,0.00844635],"about_ca_topic_score_codex":0.000026193766,"about_ca_topic_score_gemma":0.0000020871057,"teacher_disagreement_score":0.7566818,"about_ca_system_score_codex":0.00003186183,"about_ca_system_score_gemma":0.00007667019,"threshold_uncertainty_score":0.6477404},"labels":[],"label_agreement":null},{"id":"W1568950028","doi":"10.1109/mwscas.1991.252018","title":"High speed real-time design and implementation of Cauer-type Jaumann digital filters","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Digital signal processing; Integrator; Lossless compression; Multiplier (economics); Transfer function; Computer science; Digital filter; Digital delay line; Fixed-point arithmetic; Digital signal; Floating point; Computer hardware; Algorithm; Filter (signal processing); Bandwidth (computing); Data compression; Engineering; Electrical engineering; Telecommunications; Computer vision","score_opus":0.031178336389680164,"score_gpt":0.28827113702660045,"score_spread":0.2570928006369203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568950028","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046167694,0.000018268871,0.9515911,0.00045519427,0.00011811461,0.00015138484,0.0000028347063,0.00007327896,0.0014221551],"genre_scores_gemma":[0.13751025,0.000029813704,0.8614435,0.00005803233,0.000024343997,0.0000010465463,0.0000014421764,0.0000050660797,0.0009264766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993566,0.000042233427,0.00015524392,0.00018238672,0.00012834779,0.00013516149],"domain_scores_gemma":[0.99956554,0.000119796976,0.00005451004,0.0001614152,0.0000370325,0.00006167414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011458992,0.00007198927,0.00011705695,0.000040488874,0.00003095188,0.00008499184,0.00016344,0.000017625862,0.00023261367],"category_scores_gemma":[0.000011885759,0.00005752555,0.000020032488,0.0001999362,0.000028006823,0.000364632,0.000078091085,0.000025833207,0.00003483375],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004415618,0.00005396662,0.00032051306,0.000008078069,0.000022147862,0.000010297396,0.00045699975,0.000042803582,0.011205577,0.0068513053,0.003193266,0.97783065],"study_design_scores_gemma":[0.0034158563,0.004307549,0.020622103,0.000044204517,0.00004426729,0.00008971386,0.00046214717,0.77451193,0.15419295,0.03842059,0.0025234167,0.0013652882],"about_ca_topic_score_codex":0.000117295625,"about_ca_topic_score_gemma":2.4903582e-7,"teacher_disagreement_score":0.97646534,"about_ca_system_score_codex":0.000009689711,"about_ca_system_score_gemma":0.000005448541,"threshold_uncertainty_score":0.25469565},"labels":[],"label_agreement":null},{"id":"W1573955341","doi":"10.1109/acssc.2000.910637","title":"On efficient techniques for difficult operations in one and two-digit DBNS index calculus","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"CMC Microsystems","keywords":"Calculus (dental); Computer science; Index (typography); Numerical digit; Arithmetic; Algebra over a field; Mathematics; Programming language; Pure mathematics","score_opus":0.03415116263574998,"score_gpt":0.29459718241634325,"score_spread":0.2604460197805933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573955341","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007186372,0.000019719493,0.98871124,0.0014740174,0.000049103328,0.00029336577,0.0000025638521,0.000113298585,0.0021503053],"genre_scores_gemma":[0.451991,0.0000051034363,0.54685324,0.0005463254,0.00002315846,0.00007425947,5.274597e-7,0.000004812647,0.00050160516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925774,0.000031198124,0.00014558605,0.00026911285,0.00011577721,0.00018059071],"domain_scores_gemma":[0.9995474,0.00014016205,0.0000142207355,0.0001878404,0.00004110805,0.00006925747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012167243,0.00008417966,0.00012248689,0.0000770931,0.00007644576,0.00012560133,0.00018808017,0.000031699077,0.000015327589],"category_scores_gemma":[0.000074166215,0.00006290754,0.000023477472,0.00030365307,0.000027693924,0.000084059786,0.00008196828,0.0000737093,0.00000750814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029676737,0.0005035685,0.000037065372,0.0000055877667,0.000004315799,0.0000032221117,0.00020193194,0.0015152326,0.0009895564,0.19925582,0.0002988032,0.7971819],"study_design_scores_gemma":[0.00030710062,0.000229791,0.0003777343,0.0000146981365,0.0000011987528,0.0000025179727,0.000008752829,0.99028563,0.005829725,0.002002005,0.0008086028,0.00013225028],"about_ca_topic_score_codex":0.00006895097,"about_ca_topic_score_gemma":0.000024625735,"teacher_disagreement_score":0.98877037,"about_ca_system_score_codex":0.000024716961,"about_ca_system_score_gemma":0.000005755364,"threshold_uncertainty_score":0.25652948},"labels":[],"label_agreement":null},{"id":"W1581665782","doi":"10.1109/pacrim.2001.953579","title":"ROM size reduction with low processing cost for direct digital frequency synthesis","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Direct digital synthesizer; Computer science; Redundancy (engineering); Reduction (mathematics); Electronic engineering; Data compression; Frequency synthesizer; Computer hardware; Algorithm; Phase-locked loop; Engineering; Telecommunications; Mathematics; Jitter","score_opus":0.0205460935419386,"score_gpt":0.2508166757484431,"score_spread":0.23027058220650448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581665782","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086038245,0.000073349154,0.9799766,0.00095972855,0.00012413712,0.00021906928,0.0000037046784,0.0002196307,0.017563427],"genre_scores_gemma":[0.26840422,0.000004252718,0.73029095,0.00007167432,0.0000966948,0.00007386983,2.3010611e-7,0.000009691347,0.00104841],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991329,0.000020563664,0.00012884228,0.00033673114,0.00015358854,0.00022740568],"domain_scores_gemma":[0.9992954,0.00028308237,0.000058631053,0.00020838203,0.000071854745,0.00008265579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010063145,0.00011038458,0.00014534744,0.000027143114,0.00012886403,0.0003770957,0.00026558826,0.000029502013,0.00002903236],"category_scores_gemma":[0.0001913673,0.00007433565,0.00004354161,0.00031906544,0.00004058077,0.00088844384,0.000029375446,0.00004844613,0.000013772487],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021705132,0.00006719276,0.000020101392,0.000013258269,0.0000060322377,0.0000021182939,0.00005918914,0.0000070697815,0.0005747724,0.00046484655,0.00015536195,0.9986279],"study_design_scores_gemma":[0.0020300536,0.0018514046,0.0018919137,0.0007700222,0.00009770965,0.0003456831,0.00042968325,0.81561863,0.11038166,0.04078836,0.022729987,0.003064891],"about_ca_topic_score_codex":0.000006379865,"about_ca_topic_score_gemma":4.642896e-7,"teacher_disagreement_score":0.995563,"about_ca_system_score_codex":0.000027486902,"about_ca_system_score_gemma":0.000015224075,"threshold_uncertainty_score":0.3636343},"labels":[],"label_agreement":null},{"id":"W1583165772","doi":"10.1109/icm.2004.1434710","title":"VLSI implementation of a floating-point divider","year":2005,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Very-large-scale integration; Computer science; Adder; CMOS; Frequency divider; Transistor count; Computer hardware; Transistor; Electronic engineering; Arithmetic; Embedded system; Electrical engineering; Engineering; Mathematics","score_opus":0.01773693422228831,"score_gpt":0.33627961255800604,"score_spread":0.3185426783357177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583165772","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005458439,0.000016271526,0.99006766,0.0023612399,0.00006336215,0.000049927592,4.4219246e-7,0.00004352205,0.0019391541],"genre_scores_gemma":[0.1893255,0.0000017093627,0.81012034,0.0003986724,0.00004428031,0.0000018694533,1.9064476e-7,0.0000017649073,0.0001056769],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994576,0.000033184773,0.0001592912,0.00012070933,0.00012242259,0.000106775],"domain_scores_gemma":[0.9996727,0.000052429164,0.000049015856,0.00015829438,0.000031840056,0.000035725207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020266013,0.000042938813,0.00007150254,0.000025694877,0.000023684921,0.000024082143,0.00019814185,0.000010184764,0.00019995758],"category_scores_gemma":[0.000013015086,0.000032542084,0.000031807453,0.00014985654,0.000009982877,0.00023794259,0.00009643431,0.000027079655,0.000021393698],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.7335022e-7,0.000015446216,0.00023881854,0.000002091903,0.0000028988811,2.1899837e-7,0.00021461639,0.000010018652,0.0021186604,0.025969865,0.00030327897,0.97112393],"study_design_scores_gemma":[0.0015748204,0.0005360452,0.036403157,0.000023374563,0.000018297676,0.00001537672,0.00079466566,0.23420238,0.63150656,0.053931665,0.04038839,0.00060524786],"about_ca_topic_score_codex":0.000099965735,"about_ca_topic_score_gemma":0.000009313099,"teacher_disagreement_score":0.97051865,"about_ca_system_score_codex":0.000009744076,"about_ca_system_score_gemma":0.000012846291,"threshold_uncertainty_score":0.21893953},"labels":[],"label_agreement":null},{"id":"W1587360322","doi":"10.1023/a:1022236132192","title":"Fast Fourier Transforms Using the Complex Logarithmic Number System","year":2003,"lang":"en","type":"article","venue":"The Journal of VLSI Signal Processing Systems for Signal Image and Video Technology","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ryerson University","keywords":"Logarithm; Fast Fourier transform; Arithmetic; Computer science; Point (geometry); Algorithm; Adder; Multiplication (music); Mathematics; Geometry; Telecommunications; Combinatorics","score_opus":0.029849803841538305,"score_gpt":0.3035803363279219,"score_spread":0.2737305324863836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587360322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004817691,0.0029712787,0.9903384,0.0009411137,0.0002383414,0.0004411091,0.0000042499505,0.000082097315,0.00016574498],"genre_scores_gemma":[0.83756435,0.000030184954,0.16201851,0.000103343664,0.00019006376,0.000015896352,1.9767691e-7,0.000028236882,0.000049229453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741906,0.00047118397,0.0008991279,0.00026778967,0.00042088717,0.00052194565],"domain_scores_gemma":[0.997705,0.00047585877,0.00082478684,0.0003097605,0.0005745556,0.000110046196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036482955,0.00029455998,0.000618434,0.00020146147,0.00083546364,0.00039382983,0.0011832464,0.00017806614,0.0000050835292],"category_scores_gemma":[0.000067994544,0.00014971272,0.00016061512,0.00075912755,0.00046786983,0.0006526276,0.00008376161,0.0005671256,0.0000023921245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023045372,0.00028582208,0.00023883917,0.0016188251,0.00055805704,0.00019624675,0.0024306201,0.0015576304,0.24037533,0.06787271,0.0007945967,0.6838409],"study_design_scores_gemma":[0.002572853,0.0012297885,0.000023160366,0.0014051534,0.00044230564,0.02816281,0.008641158,0.8928662,0.024564624,0.028720608,0.01054215,0.0008292188],"about_ca_topic_score_codex":0.000022615264,"about_ca_topic_score_gemma":5.789144e-7,"teacher_disagreement_score":0.89130855,"about_ca_system_score_codex":0.000079528596,"about_ca_system_score_gemma":0.00018046008,"threshold_uncertainty_score":0.6425795},"labels":[],"label_agreement":null},{"id":"W1589823128","doi":"10.1007/978-1-4613-0171-4_5","title":"Monte Carlo Methods","year":2001,"lang":"en","type":"book-chapter","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley; Simon Fraser University","funders":"","keywords":"Computer science; Symbolic computation; Fortran; Computation; Algebra over a field; Cover (algebra); Theoretical computer science; Programming language; Computational science; Mathematics; Pure mathematics; Engineering","score_opus":0.04833335482953581,"score_gpt":0.3463114071006244,"score_spread":0.2979780522710886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589823128","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.9570574e-8,0.00039174207,0.5081783,0.0002874618,0.0004651522,0.00006128726,0.0000010061779,0.00015192393,0.4904631],"genre_scores_gemma":[2.9697088e-7,0.0001258632,0.5222388,0.00044830484,0.00015096407,0.0000028289605,1.8233634e-7,0.000017289902,0.4770155],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984074,0.00007388099,0.0003053696,0.00063781923,0.00028133826,0.0002941495],"domain_scores_gemma":[0.9984077,0.00025334992,0.00013095238,0.0009367061,0.00008150388,0.00018978358],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050375477,0.00032583319,0.00047454902,0.000114134105,0.00006476606,0.00012930876,0.0011343773,0.00024347969,0.0005798638],"category_scores_gemma":[0.000028277285,0.0002530152,0.00025049513,0.00006978464,0.000051286155,0.00014599277,0.00047593928,0.0003865248,0.00026313632],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.153392e-7,0.0000031633624,1.4162634e-7,0.0000026341254,0.000015943406,0.000029816254,0.000009111761,0.0000022106615,0.0000035203057,0.3804638,0.0013247868,0.6181445],"study_design_scores_gemma":[0.000054914493,0.0000478762,0.000001774813,0.000019457055,0.000009845732,0.000026431542,7.2486e-7,0.00972971,0.000036880054,0.17499948,0.81476057,0.0003123546],"about_ca_topic_score_codex":0.000045481982,"about_ca_topic_score_gemma":0.0000015401672,"teacher_disagreement_score":0.8134358,"about_ca_system_score_codex":0.00004092336,"about_ca_system_score_gemma":0.000045222918,"threshold_uncertainty_score":0.9999922},"labels":[],"label_agreement":null},{"id":"W1590205897","doi":"10.1109/iscas.1999.777829","title":"Power implications of precision limited arithmetic in floating point FIR filters","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Concordia University","funders":"","keywords":"Adder; Floating point; Finite impulse response; Single-precision floating-point format; Computer science; Reduction (mathematics); Power (physics); Arithmetic logic unit; Digital filter; Double-precision floating-point format; Floating-point unit; Filter (signal processing); Digital signal processing; Arithmetic; Algorithm; Computer hardware; Mathematics; Telecommunications","score_opus":0.02336336767547938,"score_gpt":0.2942392187956302,"score_spread":0.27087585112015083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590205897","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010673693,0.000029488217,0.97796535,0.0008360882,0.00010058844,0.000111192974,7.408147e-7,0.00003711065,0.010245723],"genre_scores_gemma":[0.28107473,0.0000033267925,0.71864605,0.0001845877,0.0000028237332,0.0000048329625,2.127397e-7,0.0000031323652,0.00008032196],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990742,0.00012909518,0.0002745776,0.00023390802,0.00011927409,0.00016889477],"domain_scores_gemma":[0.9990673,0.00036809823,0.00006585837,0.00038637535,0.000054102456,0.00005825656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044020137,0.000072349845,0.00013316466,0.00010751852,0.000031303178,0.000030279134,0.00031208328,0.00003094216,0.00006760591],"category_scores_gemma":[0.00039754983,0.000057727964,0.000045054472,0.000745996,0.000020530633,0.00016211404,0.00007962548,0.00007991516,0.00000894964],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004172062,0.00050824124,0.005522664,0.00001611312,0.000014530742,0.0000053433873,0.0009228737,0.00054383604,0.029203806,0.26318055,0.00056247023,0.6995154],"study_design_scores_gemma":[0.001966503,0.00086551043,0.24773729,0.00020847762,0.000010440075,0.000059306,0.000446665,0.2471957,0.1159781,0.37282747,0.011620819,0.0010837319],"about_ca_topic_score_codex":0.00002390674,"about_ca_topic_score_gemma":0.0000014293851,"teacher_disagreement_score":0.6984317,"about_ca_system_score_codex":0.000019750576,"about_ca_system_score_gemma":0.00002293109,"threshold_uncertainty_score":0.23540781},"labels":[],"label_agreement":null},{"id":"W1592608789","doi":"10.46298/dmtcs.450","title":"Diophantine Approximation, Ostrowski Numeration and the Double-Base Number System","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences","funders":"","keywords":"Mathematics; Diophantine equation; Correctness; Partition (number theory); Base (topology); Integer (computer science); Combinatorics; Order (exchange); Discrete mathematics; Algorithm; Mathematical analysis; Computer science","score_opus":0.011320149882883795,"score_gpt":0.2691241931922988,"score_spread":0.257804043309415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592608789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038176423,0.000029374723,0.9864708,0.0040201,0.00028735385,0.00046109565,0.0000012704534,0.00021487585,0.004697478],"genre_scores_gemma":[0.500637,0.0000024031708,0.49898484,0.00026646475,0.00008493597,0.000011693993,5.8148544e-7,0.0000051663583,0.000006904844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972706,0.00018453412,0.00052685017,0.0006545935,0.0008580327,0.00050541025],"domain_scores_gemma":[0.99797213,0.00044487967,0.00019060711,0.00092883187,0.00021685805,0.0002466628],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003122692,0.00026499023,0.00039331324,0.000076924305,0.00070614525,0.0013251326,0.0016225019,0.000052007545,0.000010740443],"category_scores_gemma":[0.00011331297,0.00015141495,0.00009869023,0.0010063682,0.0020332246,0.0007064358,0.000493268,0.00020901924,0.00003878947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014198631,0.000043920838,0.0000030277413,0.000026912847,0.0000045472316,0.0000042409833,0.00078782416,0.000024245817,0.00020516098,0.98149425,0.000009049923,0.017382601],"study_design_scores_gemma":[0.0007361939,0.000059043385,0.000043083448,0.00005659194,0.000011152742,0.00009064047,0.000039022558,0.6791541,0.00128611,0.3183485,0.00001108024,0.00016450293],"about_ca_topic_score_codex":0.0000021198505,"about_ca_topic_score_gemma":4.751289e-8,"teacher_disagreement_score":0.67912984,"about_ca_system_score_codex":0.000032514574,"about_ca_system_score_gemma":0.000050005823,"threshold_uncertainty_score":0.9997116},"labels":[],"label_agreement":null},{"id":"W1664525523","doi":"10.1109/ijcnn.2015.7280700","title":"A modular mixed-signal CVNS neural network architecture","year":2015,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Modular design; Artificial neural network; Network architecture; Synaptic weight; Flexibility (engineering); Chip; Electronic engineering; Computer hardware; Engineering; Artificial intelligence; Mathematics; Computer network","score_opus":0.03204978977503297,"score_gpt":0.26984599190567865,"score_spread":0.23779620213064567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1664525523","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021655231,0.00013676287,0.9917221,0.0019351547,0.0007216076,0.000070954025,4.1864564e-7,0.00020477182,0.0030427217],"genre_scores_gemma":[0.063187614,8.655233e-7,0.9344373,0.0013055743,0.0005083722,0.0000062449885,5.42138e-7,0.0000075751354,0.0005459241],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987644,0.00015981452,0.00013627419,0.00030764804,0.000266278,0.00036560986],"domain_scores_gemma":[0.9991793,0.00007784927,0.0000342045,0.00036761147,0.0000481846,0.0002928246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034919998,0.00012199717,0.00015473564,0.000029030229,0.0000601422,0.00011876657,0.00066686573,0.000040223174,0.000020985344],"category_scores_gemma":[0.000028979483,0.00008560287,0.00006929551,0.00040806376,0.00003349911,0.00014530061,0.00028303877,0.00017071517,0.000051377043],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045502024,0.000036995913,0.00015354478,0.0000022129143,0.000011078618,0.000044789205,0.00014181483,0.030973846,0.00017361602,0.035259925,0.005279489,0.92791814],"study_design_scores_gemma":[0.0002387485,0.00016564099,0.000831575,0.0000046693153,0.000003088081,0.00005007737,0.000011208407,0.82661384,0.00027033396,0.14075685,0.030836245,0.00021772196],"about_ca_topic_score_codex":0.000029779785,"about_ca_topic_score_gemma":0.0000022063332,"teacher_disagreement_score":0.9277004,"about_ca_system_score_codex":0.000013357613,"about_ca_system_score_gemma":0.000034736437,"threshold_uncertainty_score":0.3490784},"labels":[],"label_agreement":null},{"id":"W1668453805","doi":"10.48550/arxiv.1504.02914","title":"Representing numeric data in 32 bits while preserving 64-bit precision","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bit (key); Computer science; Arithmetic; Algorithm; Mathematics; Computer network","score_opus":0.265045774523063,"score_gpt":0.2673925908693965,"score_spread":0.0023468163463334912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1668453805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054129373,0.00029263608,0.938015,0.0001707347,0.0011606029,0.00042753562,0.000030852643,0.00027028596,0.0055029783],"genre_scores_gemma":[0.79836094,0.00028927118,0.19823013,0.000080881706,0.00028872312,0.0000023996356,0.000066396366,0.00004853709,0.0026327358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99565613,0.0006179776,0.00041205037,0.0024445334,0.00026649883,0.00060277735],"domain_scores_gemma":[0.99374765,0.00041672145,0.000410585,0.004911353,0.00021086504,0.00030279628],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0017695813,0.0003838202,0.0005676127,0.00039729037,0.00012852965,0.000301783,0.0075939693,0.00029685433,0.000035666104],"category_scores_gemma":[0.00062938523,0.00041509702,0.00012557383,0.0017277988,0.00007389726,0.0013388183,0.024174552,0.0009790532,0.000078779995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016611753,0.0021392263,0.09767257,0.0009386535,0.00045242245,0.005170818,0.0021975322,0.5850263,0.0004468144,0.043739762,0.014167726,0.24788202],"study_design_scores_gemma":[0.00039103362,0.00003281204,0.0024302474,0.000278882,0.000023747885,0.0000052889195,0.000045858596,0.93827015,0.000046697678,0.054399256,0.0035687042,0.00050732284],"about_ca_topic_score_codex":0.00086705387,"about_ca_topic_score_gemma":0.00004279477,"teacher_disagreement_score":0.7442315,"about_ca_system_score_codex":0.00019287811,"about_ca_system_score_gemma":0.00026268084,"threshold_uncertainty_score":0.99983007},"labels":[],"label_agreement":null},{"id":"W1678449713","doi":"10.1109/iscas.1999.777792","title":"A hybrid DBNS processor for DSP computation","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"CMC Microsystems","keywords":"Digital signal processing; Computer science; Computation; Parallel computing; Computer architecture; Computer hardware; Algorithm","score_opus":0.02921128949537192,"score_gpt":0.3155578837134625,"score_spread":0.28634659421809056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1678449713","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044617118,0.000022318487,0.9939872,0.00053108076,0.00021317744,0.00016747271,7.6422094e-7,0.00011056448,0.004521269],"genre_scores_gemma":[0.04341597,9.36256e-7,0.9554867,0.00049451087,0.000025630927,0.000030047824,5.694608e-7,0.000004130799,0.00054147467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994032,0.000035190045,0.000105617095,0.00020522291,0.00009303327,0.00015773138],"domain_scores_gemma":[0.99959946,0.00013162546,0.00003313585,0.000107880645,0.00007062535,0.000057274112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022267298,0.00006059783,0.00008497072,0.000026189136,0.00006688758,0.00007780578,0.00017801556,0.0000118411945,0.0000080331765],"category_scores_gemma":[0.00010668292,0.000046673344,0.000037454414,0.00014276711,0.000010922536,0.00016974588,0.0000206524,0.000029994944,0.00001661886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016633425,0.00007777065,0.000022850209,0.000019461153,0.000006621033,0.0000020763785,0.0000665398,0.00009915316,0.00034628107,0.34516793,0.0015880077,0.65260166],"study_design_scores_gemma":[0.00052257255,0.00020294906,0.00011064809,0.000006804902,0.0000038134242,0.00002159259,0.000014669845,0.5293919,0.023355082,0.3962756,0.049865995,0.00022838754],"about_ca_topic_score_codex":0.0000023842094,"about_ca_topic_score_gemma":1.4805804e-7,"teacher_disagreement_score":0.65237325,"about_ca_system_score_codex":0.000008943637,"about_ca_system_score_gemma":0.000030364516,"threshold_uncertainty_score":0.19032836},"labels":[],"label_agreement":null},{"id":"W1727481168","doi":"10.1109/icecs.2000.911589","title":"Behavioural synthesis of low power floating point CORDIC processors","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"CORDIC; Computer science; Verilog; Implementation; Computer architecture; Digital signal processing; Process (computing); Embedded system; Field-programmable gate array; Computer hardware; Parallel computing; Programming language","score_opus":0.026932365588497292,"score_gpt":0.2528731336186034,"score_spread":0.22594076803010613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1727481168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04831089,0.000073561634,0.9392653,0.00096868863,0.00022070842,0.00009841138,0.0000012555677,0.0001464094,0.010914788],"genre_scores_gemma":[0.5886788,0.0000023359516,0.41097113,0.000090298796,0.000008809075,0.0000033707092,3.0010018e-8,0.000003983364,0.00024126252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990871,0.000053471478,0.00022052953,0.00021883888,0.00021604008,0.00020402625],"domain_scores_gemma":[0.99933165,0.00017864961,0.00008658512,0.00026301364,0.0000623997,0.00007771688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020563128,0.00009093605,0.00017207554,0.00004930765,0.000048735892,0.000041475534,0.0004456879,0.000030287743,0.00049546116],"category_scores_gemma":[0.00017615948,0.00006789585,0.00006834645,0.00033384087,0.0000380156,0.00023772831,0.00011628183,0.00007218423,0.00004536254],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019453655,0.00031991643,0.00372614,0.00003885624,0.000015725138,0.0000199809,0.0007640364,0.000016221475,0.002385368,0.006368186,0.0004441991,0.98589945],"study_design_scores_gemma":[0.0006786591,0.0006728783,0.024089377,0.00029931203,0.000033553708,0.000079948404,0.00051462976,0.64545333,0.32025656,0.0063926503,0.00037306614,0.0011560004],"about_ca_topic_score_codex":0.000049409024,"about_ca_topic_score_gemma":5.026873e-7,"teacher_disagreement_score":0.9847434,"about_ca_system_score_codex":0.000010704801,"about_ca_system_score_gemma":0.0000065946333,"threshold_uncertainty_score":0.54249525},"labels":[],"label_agreement":null},{"id":"W1777520031","doi":"10.48550/arxiv.1508.03211","title":"Computing accurate Horner form approximations to special functions in finite precision arithmetic","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Univariate; Implementation; Heuristic; Arithmetic; Computer science; Inverse trigonometric functions; Machine epsilon; Arbitrary-precision arithmetic; Algorithm; Elementary function; Round-off error; Algebra over a field; Mathematics; Artificial intelligence; Programming language; Pure mathematics; Machine learning; Multivariate statistics","score_opus":0.12474530684167671,"score_gpt":0.2453228981624314,"score_spread":0.1205775913207547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1777520031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029210351,0.000011439799,0.9637365,0.00022936602,0.0015994317,0.00048300656,0.000021180289,0.0001549297,0.004553842],"genre_scores_gemma":[0.72105145,0.000016641034,0.27635568,0.00016180167,0.0007453475,0.0000038724047,0.000022796094,0.000026371925,0.0016160222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976414,0.00025178192,0.0003528538,0.0011371255,0.00016262215,0.0004542537],"domain_scores_gemma":[0.99782974,0.0003963275,0.00022036537,0.00096782256,0.00025813116,0.00032763428],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074758485,0.00031635817,0.0004267844,0.0005918988,0.00017944667,0.0002433208,0.0014764502,0.00022572084,0.000024408208],"category_scores_gemma":[0.00030021925,0.0003368766,0.00016715247,0.0018586005,0.000057464153,0.00043154397,0.002801282,0.0007213779,0.00021621062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003191441,0.00026769252,0.0005961863,0.000037936017,0.000039906306,0.000118205986,0.0009655175,0.87668514,0.000008420778,0.044763204,0.0011648046,0.07532108],"study_design_scores_gemma":[0.00036516885,0.000074213334,0.0014176653,0.00010049727,0.000020670546,0.0000021648727,0.00009834515,0.88116795,0.000010908474,0.11413336,0.0022011108,0.00040795616],"about_ca_topic_score_codex":0.00010665186,"about_ca_topic_score_gemma":0.000047907317,"teacher_disagreement_score":0.6918411,"about_ca_system_score_codex":0.00034837326,"about_ca_system_score_gemma":0.00023138637,"threshold_uncertainty_score":0.9999083},"labels":[],"label_agreement":null},{"id":"W181038668","doi":"10.1023/a:1014798618404","title":"An Effective High-Order Interval Method for Validating Existence and Uniqueness of the Solution of an IVP for an ODE","year":2001,"lang":"en","type":"article","venue":"Reliable Computing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McMaster University","funders":"Information Technology Research Centre","keywords":"A priori and a posteriori; Interval (graph theory); Uniqueness; Ordinary differential equation; Mathematics; Initial value problem; Enclosure; Computer science; Mathematical optimization; Applied mathematics; Differential equation; Algorithm; Mathematical analysis; Combinatorics","score_opus":0.030661094185814183,"score_gpt":0.35721351459385225,"score_spread":0.32655242040803806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W181038668","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21736535,0.000033943932,0.78181505,0.000045514404,0.0002259454,0.00045253802,0.0000033701945,0.000039039896,0.000019233477],"genre_scores_gemma":[0.30213034,0.0000014393316,0.6977314,0.00004288849,0.00006475591,0.000013831599,0.0000016939194,0.000009759338,0.0000039220877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984151,0.00043020074,0.00032919174,0.0004163456,0.00013925116,0.00026989047],"domain_scores_gemma":[0.99803793,0.00083272875,0.0003075511,0.00042941756,0.0003191438,0.00007323418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021781342,0.00013133296,0.0003084022,0.000047989877,0.00023310524,0.000061973034,0.00059324474,0.000059976184,3.140502e-7],"category_scores_gemma":[0.00024231712,0.00010007217,0.00006319507,0.00038369145,0.000055748547,0.00039903505,0.00020696569,0.00009332353,3.749867e-8],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002978991,0.00014035052,0.0003564081,0.00015769672,0.00001902214,3.5946775e-7,0.00085509475,0.008654424,0.04846746,0.013191249,0.000002081837,0.92812604],"study_design_scores_gemma":[0.00037284958,0.0008033318,0.0014531257,0.00013720417,0.000016349471,0.000007770965,0.000093569164,0.915466,0.062454138,0.019028876,0.00004312873,0.00012367283],"about_ca_topic_score_codex":0.00037444677,"about_ca_topic_score_gemma":0.0000056227063,"teacher_disagreement_score":0.9280024,"about_ca_system_score_codex":0.000026104655,"about_ca_system_score_gemma":0.000033245837,"threshold_uncertainty_score":0.40808246},"labels":[],"label_agreement":null},{"id":"W1814759949","doi":"10.1109/icassp.1977.1170347","title":"Hardware realization of digital signal processing elements using the residue number system.","year":2005,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Realization (probability); Arithmetic; Binary number; Computer science; Computer hardware; Digital filter; Signal processing; Saturation arithmetic; Digital signal processing; Residue number system; Fast Fourier transform; Arbitrary-precision arithmetic; Algorithm; Filter (signal processing); Mathematics","score_opus":0.03236534261837413,"score_gpt":0.31520123589677357,"score_spread":0.2828358932783994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1814759949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013647106,0.000022363993,0.9931472,0.0001449313,0.00003924061,0.00008525582,0.000001842346,0.00006266428,0.005131775],"genre_scores_gemma":[0.5897425,5.349509e-7,0.40993834,0.000051270497,0.000084192005,0.0000019759902,7.880185e-7,0.0000046496352,0.00017579236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913263,0.00005386361,0.00024919625,0.0001652339,0.000257011,0.00014203285],"domain_scores_gemma":[0.99952453,0.000037039197,0.00012591814,0.00017787461,0.000099570076,0.00003508716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023993842,0.00007048706,0.0001003133,0.000019529973,0.00010827416,0.00019107052,0.00033145418,0.000021718684,0.000015594012],"category_scores_gemma":[0.00001339591,0.000042839456,0.000031471223,0.0003096278,0.00002500115,0.00060645136,0.00011087817,0.00004210187,0.0000067161277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033322444,0.000054533983,0.0032991902,0.00006710807,0.000012459935,0.0000024566493,0.0003483766,0.0008729393,0.00067988207,0.034727555,0.00017576411,0.9597564],"study_design_scores_gemma":[0.00012905718,0.000017978069,0.0002285222,0.000080864884,0.0000061218598,0.000019564499,0.0001730955,0.99273986,0.003961208,0.0010824448,0.0014557823,0.00010548794],"about_ca_topic_score_codex":0.000023569432,"about_ca_topic_score_gemma":8.9681936e-7,"teacher_disagreement_score":0.99186695,"about_ca_system_score_codex":0.00003445801,"about_ca_system_score_gemma":0.000038936832,"threshold_uncertainty_score":0.18424974},"labels":[],"label_agreement":null},{"id":"W1848751006","doi":"10.1109/iscas.1997.621882","title":"A QR decomposition based algorithm for computing transfer functions from state equations","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"University of Hong Kong; University Grants Committee; City University of Hong Kong","keywords":"QR decomposition; Algorithm; Computer science; Decomposition; Transfer function; State (computer science); Inverse; Applied mathematics; Mathematics; Eigenvalues and eigenvectors","score_opus":0.04111798983804527,"score_gpt":0.29644097674276004,"score_spread":0.2553229869047148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1848751006","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017041629,0.000051145875,0.997023,0.0014290332,0.00041162374,0.00024229403,0.00005815504,0.00026777986,0.00034658797],"genre_scores_gemma":[0.015726205,0.0000022865145,0.9829719,0.0008211531,0.00010784038,0.000031300442,0.000020317259,0.000010089597,0.0003089297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889696,0.00008585546,0.00024074984,0.00035580387,0.00016339953,0.00025725164],"domain_scores_gemma":[0.99868,0.00083604775,0.000027410006,0.00025217936,0.00009015153,0.0001142265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017159339,0.00012199315,0.000148942,0.00007564795,0.00028676636,0.00016221704,0.00026365323,0.00003497253,0.0001746857],"category_scores_gemma":[0.000017234719,0.000108629654,0.00011866094,0.00034514538,0.000022472039,0.00026458385,0.000027712687,0.00008458518,0.00006521148],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.5861755e-7,0.000103542356,0.0000034722243,0.0000015301197,0.000012147267,9.971084e-7,0.00010027971,0.00047909698,0.00041902295,0.0014232796,0.00020102735,0.99725485],"study_design_scores_gemma":[0.00052977324,0.00010521356,0.000090818714,0.000008816411,0.000010137278,7.8777833e-7,0.000010798813,0.9903093,0.0012831055,0.0049530095,0.00253827,0.00015995087],"about_ca_topic_score_codex":0.00008055337,"about_ca_topic_score_gemma":0.0000049294645,"teacher_disagreement_score":0.99709487,"about_ca_system_score_codex":0.000029458304,"about_ca_system_score_gemma":0.000013797916,"threshold_uncertainty_score":0.44297886},"labels":[],"label_agreement":null},{"id":"W1849841112","doi":"10.1109/iscas.1999.780152","title":"Simple implementations of homotopy algorithms for finding DC solutions of nonlinear circuits","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Simple (philosophy); Nonlinear system; Electronic circuit; Implementation; Homotopy; Algorithm; Computer science; Homotopy perturbation method; Homotopy analysis method; Mathematics; Electrical engineering; Engineering; Physics; Pure mathematics","score_opus":0.09759831568290088,"score_gpt":0.37664937954521743,"score_spread":0.27905106386231654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1849841112","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012319547,0.000032698477,0.9970758,0.000122609,0.00016637261,0.00026370343,0.000066539076,0.00003264359,0.0010077104],"genre_scores_gemma":[0.053805918,0.000005282672,0.94594294,0.000057698177,0.000025339868,0.00003135078,0.000006067412,0.0000066888742,0.00011869399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989018,0.00006486442,0.00037491543,0.00021523761,0.00016257503,0.00028062717],"domain_scores_gemma":[0.998957,0.00037194736,0.00014020795,0.00029591675,0.00016365561,0.000071277565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048504808,0.000088749075,0.00020359564,0.00009667505,0.00013152711,0.000021104694,0.00032141627,0.000030873984,0.00006637982],"category_scores_gemma":[0.00016989397,0.000079243786,0.00012081597,0.0005056913,0.000043909455,0.00018225763,0.0000659249,0.000045441746,0.0000021463052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010664927,0.00034308012,0.00071100856,0.00005376106,0.00006129462,8.3111604e-7,0.00040365924,0.00010526637,0.020082941,0.6707276,0.00057889597,0.30693057],"study_design_scores_gemma":[0.0027539772,0.0011195579,0.0029099616,0.000039718,0.0000714395,0.00001950961,0.0009001979,0.34136587,0.38941634,0.22826765,0.032380827,0.0007549542],"about_ca_topic_score_codex":0.000047002457,"about_ca_topic_score_gemma":0.0000043810264,"teacher_disagreement_score":0.44245997,"about_ca_system_score_codex":0.000015931715,"about_ca_system_score_gemma":0.00008224844,"threshold_uncertainty_score":0.3231468},"labels":[],"label_agreement":null},{"id":"W1850700917","doi":"10.48550/arxiv.0810.4196","title":"Interval Semantics for Standard Floating-Point Arithmetic","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Arithmetic; Interval (graph theory); Semantics (computer science); Floating point; Point (geometry); Interval arithmetic; Mathematics; Computer science; Programming language; Combinatorics; Mathematical analysis; Geometry","score_opus":0.07228357587110007,"score_gpt":0.32828951599594663,"score_spread":0.25600594012484656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1850700917","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051726818,0.0002354729,0.9414832,0.0023381137,0.0030445291,0.00055078237,0.000041628067,0.00030003855,0.00027939648],"genre_scores_gemma":[0.068728685,0.0001961757,0.92933244,0.00062798074,0.000658944,0.00007297654,0.000012630044,0.000050357652,0.00031978718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971172,0.00017531044,0.0006413413,0.0010513191,0.00042366833,0.00059113454],"domain_scores_gemma":[0.99745494,0.00040352796,0.00035472386,0.0012645156,0.00030517977,0.0002171083],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073525205,0.0004374109,0.00075801404,0.0001340254,0.00020375749,0.00020583646,0.0017109716,0.00026655654,0.000011560093],"category_scores_gemma":[0.000519189,0.0003913431,0.00043902826,0.00024889203,0.00012555133,0.00017026933,0.0022469664,0.0007830475,0.000049161175],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013565135,0.0008204657,0.041964166,0.0017153653,0.0007455,0.00047388137,0.005079774,0.0018052515,0.0014703951,0.012581122,0.010929364,0.92227906],"study_design_scores_gemma":[0.0036249831,0.0026887446,0.024276216,0.0020000765,0.0002832595,0.00024704056,0.00022414261,0.63703877,0.03726732,0.16752285,0.11981176,0.0050148214],"about_ca_topic_score_codex":0.0000450326,"about_ca_topic_score_gemma":0.0000017228055,"teacher_disagreement_score":0.9172642,"about_ca_system_score_codex":0.00012274481,"about_ca_system_score_gemma":0.0002153691,"threshold_uncertainty_score":0.99985385},"labels":[],"label_agreement":null},{"id":"W185179213","doi":"10.1007/978-3-7643-7984-1_7","title":"New Algorithms for Exact and Approximate Polynomial Decomposition","year":2007,"lang":"en","type":"book-chapter","venue":"Birkhäuser Basel eBooks","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polynomial; Decomposition; Mathematics; Algorithm; Bivariate analysis; Computation; Exponential function; Square-free polynomial; Matrix polynomial; Discrete mathematics; Combinatorics; Applied mathematics; Mathematical analysis","score_opus":0.055096295448580426,"score_gpt":0.3217164365635686,"score_spread":0.26662014111498816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W185179213","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003042515,0.00031955412,0.86313665,0.00013407115,0.0007968767,0.00069941656,0.000048612685,0.00026452224,0.13459724],"genre_scores_gemma":[0.0000227555,0.00002826352,0.8198655,0.00064044667,0.0010645235,0.000028088321,0.000018693916,0.00009658971,0.17823511],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99742764,0.000035367368,0.00054880197,0.0010286664,0.00038166402,0.00057788106],"domain_scores_gemma":[0.998013,0.0003736395,0.00030727327,0.00071335613,0.00010707744,0.0004856079],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006026769,0.0005914582,0.00064088637,0.00030006163,0.00021704924,0.0003045838,0.0006994812,0.0004409701,0.00003480213],"category_scores_gemma":[0.00001811425,0.00055136805,0.00027963155,0.00003287536,0.0000945374,0.00017249233,0.00033850002,0.00037407622,0.000029123852],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036049456,0.000011557881,6.927744e-7,0.000052390966,0.00005775647,0.00003393724,0.00008046015,7.512529e-7,0.00016477233,0.10656209,0.0019963824,0.89100313],"study_design_scores_gemma":[0.0022913492,0.00076021906,0.000028504923,0.0003402995,0.00016217,0.00022192455,0.0000062886616,0.034198962,0.0040946426,0.17259645,0.78329974,0.001999413],"about_ca_topic_score_codex":0.000053255153,"about_ca_topic_score_gemma":0.0000045430943,"teacher_disagreement_score":0.88900375,"about_ca_system_score_codex":0.00008071526,"about_ca_system_score_gemma":0.00018149204,"threshold_uncertainty_score":0.9996938},"labels":[],"label_agreement":null},{"id":"W1860567208","doi":"10.1007/11751540_6","title":"Backward Error Analysis in Computational Geometry","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Context (archaeology); Computational geometry; Floating point; Algorithm; Computation; Point (geometry); Interval arithmetic; Theoretical computer science; Mathematics; Geometry","score_opus":0.019609992187504716,"score_gpt":0.28553203587516657,"score_spread":0.26592204368766187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1860567208","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010154568,0.0003001808,0.9955159,0.0008632062,0.00090274465,0.00022851047,0.000010489755,0.00010777258,0.0019696448],"genre_scores_gemma":[0.039242867,0.000007535016,0.95913917,0.0010031618,0.0002703448,0.0000063836915,0.000015298558,0.000023785635,0.00029147763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995181,0.00008330961,0.000785842,0.001858208,0.0013224243,0.0007691673],"domain_scores_gemma":[0.99727654,0.0009327089,0.00032095265,0.0010665357,0.00021378804,0.00018945869],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012779682,0.000549061,0.0009315367,0.0031563074,0.00015569992,0.00048618874,0.0030107894,0.00030982622,0.00004369454],"category_scores_gemma":[0.00008427485,0.00050302077,0.00031284624,0.004649461,0.0005564621,0.00048157945,0.001119882,0.0009153433,0.000043775683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018889336,0.00004146564,0.0005478259,0.000012152074,0.000028600885,0.00010599588,0.000074005016,0.54759,0.0000054896154,0.007609889,0.000017568043,0.4439651],"study_design_scores_gemma":[0.00018527186,0.00006496407,0.00413363,0.00007015995,0.000020438205,0.000014316082,5.627071e-8,0.7882169,0.000034435136,0.20619951,0.0005384465,0.00052185735],"about_ca_topic_score_codex":0.000115444935,"about_ca_topic_score_gemma":0.00008645163,"teacher_disagreement_score":0.44344324,"about_ca_system_score_codex":0.0003623601,"about_ca_system_score_gemma":0.00036780155,"threshold_uncertainty_score":0.99974215},"labels":[],"label_agreement":null},{"id":"W1872385342","doi":"10.5539/cis.v8n4p1","title":"Effects of Improved-Floor Function on the Accuracy of Bilinear Interpolation Algorithm","year":2015,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bilinear interpolation; Rounding; Multiplicative inverse; Modulo operation; Interpolation (computer graphics); Integer (computer science); Remainder; Multiplicative function; Inverse","score_opus":0.016077166721830193,"score_gpt":0.2682538363060319,"score_spread":0.2521766695842017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1872385342","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011093583,0.00001790035,0.98762006,0.0002030081,0.00061879394,0.00016685665,8.8559227e-7,0.000023015762,0.00025589037],"genre_scores_gemma":[0.401155,0.000012580281,0.5979126,0.0008388238,0.000067018824,0.000007259286,8.069375e-7,0.0000018726555,0.000004020005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991046,0.00004675618,0.0002781315,0.000117886135,0.00034009537,0.000112508926],"domain_scores_gemma":[0.99882764,0.0002910466,0.00022672338,0.00023048015,0.00034721484,0.0000768994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00100474,0.0000710788,0.000106079824,0.00016144747,0.00008037348,0.00012508838,0.00046991324,0.000020728445,9.006262e-7],"category_scores_gemma":[0.000326095,0.000042775395,0.000025508696,0.000778572,0.00019227798,0.0037358075,0.0002355797,0.00006766358,0.0000068469667],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004969569,0.0000172698,0.00001148059,0.000016721464,0.0000021694477,4.1262535e-8,0.0008305742,0.000044685214,0.0009573383,0.015254659,0.000053568718,0.9828065],"study_design_scores_gemma":[0.0002289628,0.0004489508,0.003251416,0.000024663612,0.000002088027,0.0000021895416,0.000033709264,0.9809365,0.012408417,0.0016876123,0.0009184758,0.000056973397],"about_ca_topic_score_codex":0.000011252252,"about_ca_topic_score_gemma":2.3212055e-8,"teacher_disagreement_score":0.9827495,"about_ca_system_score_codex":0.000012930215,"about_ca_system_score_gemma":0.000085628715,"threshold_uncertainty_score":0.270837},"labels":[],"label_agreement":null},{"id":"W1872673676","doi":"10.1109/arith.1989.72826","title":"Algorithm design for a 30-bit integrated logarithmic processor","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Logarithm; Computer science; Coding (social sciences); Table (database); Subtraction; Parallel computing; Lookup table; Data compression; Arithmetic; Key (lock); Nonlinear system; Computer hardware; Algorithm; Mathematics; Operating system; Statistics","score_opus":0.04189988152922689,"score_gpt":0.29715621104923706,"score_spread":0.25525632952001015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1872673676","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013500616,0.00008155736,0.99704295,0.00035691157,0.0003148303,0.0005248088,0.0000028549625,0.00026405457,0.0013985223],"genre_scores_gemma":[0.00034003585,0.0000059544864,0.9967218,0.00060736726,0.000040508326,0.00016564451,9.781373e-7,0.000014435613,0.0021032516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852604,0.00016407315,0.00023729046,0.00047787267,0.00017754831,0.0004171999],"domain_scores_gemma":[0.99893373,0.0003279675,0.00006613529,0.00032979943,0.00019567451,0.00014669026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007394223,0.0001817525,0.00022939894,0.000075642114,0.0001247576,0.00017228622,0.00058825215,0.00007490629,0.00009232007],"category_scores_gemma":[0.00030483954,0.00013137891,0.00008118657,0.0005809473,0.00003912899,0.0002714241,0.00004870402,0.00012133114,0.00006652194],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026490527,0.0001037816,0.0000031884426,0.000010033547,0.000016717364,0.0000065103836,0.000074873285,0.000026906835,0.0003838277,0.037837278,0.0010066123,0.9605276],"study_design_scores_gemma":[0.00089748163,0.00051341107,0.000014333468,0.000018635814,0.00001079008,0.00003868464,0.00005139269,0.70183545,0.036317986,0.1604993,0.0993329,0.0004696036],"about_ca_topic_score_codex":0.000012397228,"about_ca_topic_score_gemma":2.8836246e-7,"teacher_disagreement_score":0.96005803,"about_ca_system_score_codex":0.000035679284,"about_ca_system_score_gemma":0.00015154551,"threshold_uncertainty_score":0.53574765},"labels":[],"label_agreement":null},{"id":"W1898422521","doi":"10.1109/iscas.2002.1011427","title":"A comparison of automatic word length optimization procedures","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Department of National Defence; Polytechnique Montréal","funders":"","keywords":"Word (group theory); Word length; Testbed; Computer science; Point (geometry); Algorithm; Floating point; Exploit; Mathematics; Natural language processing","score_opus":0.03247539181759063,"score_gpt":0.3406031529151868,"score_spread":0.30812776109759615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1898422521","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013313133,0.00006422193,0.9932647,0.00012153502,0.00009458897,0.00007875196,8.643991e-8,0.00009889649,0.004945932],"genre_scores_gemma":[0.21694915,0.000002574965,0.7828726,0.000051422663,0.0000046737605,0.000004187186,1.1467472e-7,0.0000025314512,0.000112742724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993309,0.00007845453,0.0001966373,0.00014064889,0.00014078137,0.00011261216],"domain_scores_gemma":[0.9995628,0.00008563844,0.00007703659,0.00018818525,0.000043261014,0.00004308986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016706985,0.000060667197,0.00015011056,0.000040996976,0.0000325825,0.000032913787,0.0002237704,0.0000223114,0.00006198088],"category_scores_gemma":[0.0001830784,0.000045429817,0.000028293394,0.00036120848,0.00001882557,0.0001445413,0.000030496,0.00003976275,0.0000053625413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001591029,0.000548317,0.003152875,0.0001257204,0.000025673788,0.0000014371134,0.0009793922,0.034244157,0.0004887729,0.28063798,0.00079262233,0.67900145],"study_design_scores_gemma":[0.000100652884,0.000056306766,0.00034442783,0.000014207269,0.000002395604,0.000002102139,0.000046484958,0.99004835,0.0059370636,0.0030930252,0.0002800754,0.000074880016],"about_ca_topic_score_codex":0.000003657813,"about_ca_topic_score_gemma":4.2277364e-7,"teacher_disagreement_score":0.9558042,"about_ca_system_score_codex":0.000006985343,"about_ca_system_score_gemma":0.000039829974,"threshold_uncertainty_score":0.18525742},"labels":[],"label_agreement":null},{"id":"W1906421350","doi":"10.1090/mcom/3046","title":"Rigorous numerics for analytic solutions of differential equations: the radii polynomial approach","year":2015,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"National Science Foundation","keywords":"Mathematics; Homoclinic orbit; Nonlinear system; Polynomial; Ordinary differential equation; Bounding overwatch; Operator (biology); Interval arithmetic; Mathematical analysis; Applied mathematics; Differential equation; Partial differential equation","score_opus":0.11113804743670994,"score_gpt":0.32450365180085206,"score_spread":0.21336560436414212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1906421350","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00176306,0.00006342288,0.99716574,0.00020394528,0.00021053718,0.00033983414,0.000006890002,0.00002957945,0.00021700557],"genre_scores_gemma":[0.3733534,7.141954e-7,0.626553,0.000008966245,0.000039809354,0.000016954935,0.000005102578,0.000005104097,0.000016950324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989102,0.00008146318,0.00042769773,0.00013774565,0.00029914174,0.00014377983],"domain_scores_gemma":[0.9983257,0.0007383961,0.00036315687,0.00026024767,0.00026099005,0.000051509593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058968243,0.00009227206,0.00024571773,0.000078140256,0.00008180069,0.000043919645,0.00041757853,0.000034552377,7.679932e-7],"category_scores_gemma":[0.00034026537,0.00006536754,0.000103319864,0.00035171735,0.00008094425,0.0001277421,0.00009627517,0.000052677184,0.000001499668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003714091,0.0026509494,0.000027255996,0.00065535906,0.00031092347,5.444034e-7,0.015791375,0.12009978,0.0017633317,0.5868234,0.0036426298,0.26819733],"study_design_scores_gemma":[0.00034026027,0.00010879058,0.000035200213,0.000010952535,0.00003190614,0.0000023109624,0.00016248794,0.92520535,0.0002565973,0.073742144,0.000036154404,0.000067864625],"about_ca_topic_score_codex":0.000012406947,"about_ca_topic_score_gemma":2.7534344e-7,"teacher_disagreement_score":0.80510557,"about_ca_system_score_codex":0.000024301955,"about_ca_system_score_gemma":0.000075962445,"threshold_uncertainty_score":0.2665611},"labels":[],"label_agreement":null},{"id":"W1927976700","doi":"10.1109/mwscas.1997.662172","title":"Crossover and mutation in genetic algorithms employing canonical signed-digit number system","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Crossover; Mutation; Algorithm; Computer science; Genetic algorithm; Process (computing); Arithmetic; Mathematics; Artificial intelligence; Machine learning; Genetics","score_opus":0.02382034626873698,"score_gpt":0.272765932123383,"score_spread":0.24894558585464605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1927976700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050948344,0.00013520244,0.9420889,0.00024031992,0.00022312596,0.00014510132,0.0000010028018,0.00015775976,0.0060602124],"genre_scores_gemma":[0.5041285,0.000006335589,0.49518988,0.00015579852,0.00004925347,0.000012613232,1.6873885e-7,0.000007947061,0.00044948384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987185,0.00009536614,0.00027332868,0.00039774508,0.00021858573,0.00029647027],"domain_scores_gemma":[0.9993993,0.00016086582,0.000047390684,0.00023482984,0.000033049702,0.00012454987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015230564,0.0001242916,0.0001849258,0.00004668649,0.00007379818,0.0002645932,0.00024570563,0.00006155685,0.000056777517],"category_scores_gemma":[0.000030509907,0.000103819846,0.000033585206,0.00036183817,0.00004177005,0.0003247899,0.00013389453,0.00010380777,0.000090953035],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023592213,0.00008268329,0.004644258,0.000037588015,0.000010532574,0.00025660926,0.0005122441,0.00013375453,0.00015921271,0.0117344055,0.00015657808,0.98226976],"study_design_scores_gemma":[0.000888571,0.00009026172,0.014816661,0.0000489033,0.000004938821,0.0003008195,0.000074461655,0.9796307,0.0006081193,0.0021349192,0.0010243803,0.00037726274],"about_ca_topic_score_codex":0.00025950122,"about_ca_topic_score_gemma":0.000008878123,"teacher_disagreement_score":0.9818925,"about_ca_system_score_codex":0.00006092418,"about_ca_system_score_gemma":0.0000140227385,"threshold_uncertainty_score":0.42336506},"labels":[],"label_agreement":null},{"id":"W1957845436","doi":"10.1109/mwscas.1997.666113","title":"Overlap resolution: continuous valued digits for hybrid architectures","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Very-large-scale integration; Signal processing; Coding (social sciences); Computation; Digital signal processing; Analog signal processing; Simple (philosophy); Computer hardware; Algorithm; Computer engineering; Arithmetic; Mathematics; Embedded system","score_opus":0.031194517763628776,"score_gpt":0.2687727839514231,"score_spread":0.23757826618779435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1957845436","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012820136,0.00022569434,0.98149925,0.00077079626,0.00027910664,0.0001726815,0.0000039790643,0.00021440267,0.015552077],"genre_scores_gemma":[0.05759281,0.000004959153,0.93674994,0.0007431951,0.00016499346,0.000023891216,4.7947856e-7,0.000007776234,0.0047119483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990177,0.00005087397,0.00015408959,0.00030569886,0.00016119375,0.00031040664],"domain_scores_gemma":[0.99927604,0.00019462437,0.000040068448,0.00032397965,0.000055671073,0.00010958579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016653517,0.000104862374,0.00015366092,0.00004078623,0.00013824443,0.00013613877,0.00044349258,0.000020717382,0.00005058757],"category_scores_gemma":[0.00014580326,0.00007863721,0.00009866166,0.0001720752,0.000059493712,0.00011029903,0.00010811049,0.0000662394,0.00003565334],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034673994,0.000063211926,0.000033485056,0.000007669137,0.000010004986,0.000009317951,0.0000895612,0.000045758326,0.00014960807,0.04036787,0.0043907184,0.95482934],"study_design_scores_gemma":[0.0008161514,0.0004686136,0.0006426299,0.000017827888,0.000006609356,0.00011688096,0.000010273083,0.742517,0.004642288,0.15545797,0.094917834,0.00038595527],"about_ca_topic_score_codex":0.000010877923,"about_ca_topic_score_gemma":3.574708e-7,"teacher_disagreement_score":0.9544434,"about_ca_system_score_codex":0.000015384707,"about_ca_system_score_gemma":0.0000059492,"threshold_uncertainty_score":0.32067326},"labels":[],"label_agreement":null},{"id":"W1965811650","doi":"10.1007/s11265-013-0742-6","title":"Decimal Division Algorithms: The Issue of Partial Remainders","year":2013,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Division (mathematics); Division algorithm; Divisor (algebraic geometry); Arithmetic; Decimal; Numerical digit; Mathematics; Quotient; Algorithm; Remainder; Generalization; Set (abstract data type); Operand; Computer science; Discrete mathematics; Combinatorics","score_opus":0.022434748565534686,"score_gpt":0.28391382534675375,"score_spread":0.26147907678121907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965811650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060803914,0.002009351,0.9895921,0.0012924364,0.000692246,0.00014346786,4.0051629e-7,0.000016259566,0.00017339812],"genre_scores_gemma":[0.8886965,0.000010970593,0.110441856,0.000121416866,0.00062934717,0.000004835852,6.5428935e-8,0.000010802332,0.00008419825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975539,0.00030293516,0.00087887835,0.00017168756,0.000825095,0.00026750015],"domain_scores_gemma":[0.9976326,0.00029673174,0.0011010965,0.00020489002,0.0006221509,0.0001425201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017719192,0.0001445841,0.00039797582,0.00010583188,0.0001694482,0.00040519072,0.0010059155,0.000066164386,0.000016987937],"category_scores_gemma":[0.00009160649,0.00007838994,0.00013933635,0.0004396313,0.00010759475,0.000954113,0.000105814455,0.0002916903,0.000012884509],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001101347,0.000121785764,0.00030160698,0.00014528456,0.000051500592,0.000025487036,0.001095392,0.0014635404,0.00895302,0.00049646,0.0016614834,0.9856734],"study_design_scores_gemma":[0.00095929997,0.0011111252,0.0017703973,0.0011702897,0.000046940208,0.00059441425,0.0016911215,0.96976775,0.0074772886,0.0060451063,0.008962083,0.00040418806],"about_ca_topic_score_codex":0.00005315162,"about_ca_topic_score_gemma":5.554411e-8,"teacher_disagreement_score":0.98526925,"about_ca_system_score_codex":0.00003492129,"about_ca_system_score_gemma":0.00015307126,"threshold_uncertainty_score":0.39072633},"labels":[],"label_agreement":null},{"id":"W1966566700","doi":"10.1145/1394042.1394096","title":"Detecting polynomial perfect powers (abstract only)","year":2008,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lacunary function; Polynomial; Perfect power; Mathematics; Finite field; Integer (computer science); Power (physics); Field (mathematics); Discrete mathematics; Combinatorics; Computer science; Pure mathematics","score_opus":0.05866989292685982,"score_gpt":0.323229655634231,"score_spread":0.2645597627073712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966566700","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.139229,0.00070995523,0.85006887,0.0052076024,0.00078874454,0.00035405028,0.00000271875,0.00054621807,0.0030928669],"genre_scores_gemma":[0.3927939,0.00009527119,0.6065933,0.000367188,0.00008719784,0.000014521124,0.000002255073,0.000012270015,0.000034074954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980566,0.0003444529,0.0004827475,0.00045868583,0.00023788562,0.0004196502],"domain_scores_gemma":[0.99355286,0.0014880985,0.00014639132,0.004610766,0.00007344405,0.00012841797],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00060340157,0.00021619996,0.00029026234,0.00025037822,0.0005094864,0.00013163078,0.0064262873,0.000091931484,0.000026690454],"category_scores_gemma":[0.00021934797,0.00021820125,0.00013146472,0.0009446226,0.00020607797,0.0005569468,0.0034545378,0.00063133147,0.00014904655],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032524645,0.0002222443,0.0025327445,0.0000046428663,0.000020645464,0.000026070811,0.00090152473,0.00009312887,0.00014828349,0.0018613406,0.00054530404,0.99364084],"study_design_scores_gemma":[0.003065936,0.000699958,0.31726667,0.0002445272,0.00002392764,0.0014097731,0.000099074634,0.5768339,0.0015296686,0.018331423,0.07807842,0.002416726],"about_ca_topic_score_codex":0.00018819426,"about_ca_topic_score_gemma":0.000018002102,"teacher_disagreement_score":0.9912241,"about_ca_system_score_codex":0.000101678794,"about_ca_system_score_gemma":0.00014059062,"threshold_uncertainty_score":0.9989494},"labels":[],"label_agreement":null},{"id":"W1967444872","doi":"10.1007/s11265-013-0795-6","title":"Area Efficient Sequential Decimal Fixed-point Multiplier","year":2013,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"University of Saskatchewan","keywords":"Adder; Decimal; Arithmetic; Multiplier (economics); Operand; Computer science; Computation; Mathematics; Parallel computing; Algorithm; Latency (audio); Computer hardware; Telecommunications","score_opus":0.025841340555624412,"score_gpt":0.2712819439382788,"score_spread":0.2454406033826544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967444872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025694914,0.0011790456,0.971261,0.0003280831,0.0009946368,0.00016238133,6.46778e-7,0.000041857533,0.0003373936],"genre_scores_gemma":[0.8273774,0.0000027817716,0.1718626,0.00008107989,0.0005481354,0.000007538378,1.2007357e-7,0.00001318263,0.000107210726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753255,0.00018381483,0.0008744617,0.00025391442,0.0007768446,0.0003784046],"domain_scores_gemma":[0.9978248,0.00015927461,0.00084699097,0.00018915015,0.0007002244,0.00027954296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011426514,0.0001965946,0.0004338508,0.00018145746,0.00017859967,0.0008775091,0.0008238954,0.000081097314,0.00003116468],"category_scores_gemma":[0.00006853703,0.00013363521,0.00016844716,0.000392409,0.00006392082,0.0007888461,0.00012564033,0.00034592205,0.0000427771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004339306,0.00058376655,0.0005286738,0.0003606562,0.00013026204,0.0002960452,0.0017579846,0.039275505,0.10044237,0.0011169151,0.002584666,0.85287976],"study_design_scores_gemma":[0.0006663008,0.0003074289,0.00040327306,0.0005825042,0.000019236943,0.00090967683,0.0002510583,0.9915099,0.0029399593,0.0009157397,0.0012043932,0.00029049854],"about_ca_topic_score_codex":0.000029867831,"about_ca_topic_score_gemma":7.121337e-8,"teacher_disagreement_score":0.95223445,"about_ca_system_score_codex":0.00009845155,"about_ca_system_score_gemma":0.00019215807,"threshold_uncertainty_score":0.8461841},"labels":[],"label_agreement":null},{"id":"W1967476488","doi":"10.1145/2457443.2457444","title":"Self-Alignment Schemes for the Implementation of Addition-Related Floating-Point Operators","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Field-programmable gate array; Floating point; Realization (probability); Point (geometry); Operator (biology); Computer hardware; Computer engineering; Parallel computing; Algorithm","score_opus":0.013986248498565045,"score_gpt":0.2729182783595705,"score_spread":0.25893202986100544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967476488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01069637,0.00042846063,0.9822985,0.0045512007,0.00049790245,0.0011847434,0.00002114775,0.00022747082,0.00009422979],"genre_scores_gemma":[0.89719754,0.00012944562,0.10164602,0.000060990118,0.000011510243,0.0008101653,0.000002091033,0.000009025809,0.0001332372],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990243,0.00006368869,0.00037030622,0.00025543387,0.00009412555,0.000192149],"domain_scores_gemma":[0.99886227,0.00037305892,0.00013690942,0.00047586422,0.00011543617,0.00003646271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033398025,0.00011672015,0.00019690502,0.00018185053,0.00034576823,0.000066477,0.0004259546,0.00012268464,0.000096792326],"category_scores_gemma":[0.000022218552,0.00008040871,0.000053654854,0.00044533145,0.000065911925,0.00021449293,0.0000066083594,0.00014282815,0.000012265969],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025511104,0.00008284329,0.000048578047,0.00006671125,0.00021628478,3.945393e-7,0.00032089307,0.00010223372,0.0033206544,0.05594331,0.00020075687,0.93969476],"study_design_scores_gemma":[0.0046676216,0.0030034042,0.0007136375,0.0003605717,0.00025343712,0.00021281376,0.024457319,0.27135083,0.5308368,0.11497241,0.047910094,0.0012610764],"about_ca_topic_score_codex":0.00013009152,"about_ca_topic_score_gemma":0.000002655033,"teacher_disagreement_score":0.9384337,"about_ca_system_score_codex":0.000025613339,"about_ca_system_score_gemma":0.00002481069,"threshold_uncertainty_score":0.32789722},"labels":[],"label_agreement":null},{"id":"W1967747780","doi":"10.1007/s10703-005-2256-8","title":"Formalization of Fixed-Point Arithmetic in HOL","year":2005,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Saturation arithmetic; Arithmetic; Correctness; Fixed-point arithmetic; Fixed point; HOL; Quantization (signal processing); Subtraction; Multiplication (music); Computer science; Division (mathematics); Mathematics; Arbitrary-precision arithmetic; Algorithm; Floating point; Programming language","score_opus":0.04486791107813676,"score_gpt":0.3591851560632732,"score_spread":0.31431724498513647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967747780","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004891176,0.00021618103,0.99696857,0.00006305328,0.00036239962,0.0004866935,0.0000010903747,0.00008096074,0.0013319183],"genre_scores_gemma":[0.09722657,0.000008041798,0.90254486,0.00005046898,0.000054996373,0.00007361765,4.1088634e-7,0.00001206827,0.000028958337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99592274,0.0019628587,0.0009749354,0.0003522462,0.00029455163,0.00049268326],"domain_scores_gemma":[0.99835056,0.0007214469,0.00027606817,0.0004890119,0.000073833784,0.000089105095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008426699,0.00018881621,0.00050277176,0.00042635933,0.00004430897,0.00005159161,0.00071520876,0.000122604,0.0000065167865],"category_scores_gemma":[0.00027813122,0.00016288843,0.00008570903,0.0012843568,0.000036444628,0.0011758675,0.00019013374,0.00019253665,0.000011109047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002805687,0.000109673536,0.00031998684,0.00018038705,0.000007650705,0.000012906472,0.0012335487,0.010695229,0.0019274551,0.052908942,0.000015124748,0.93256104],"study_design_scores_gemma":[0.00057033304,0.0002505799,0.0008966511,0.00024295824,0.000004575538,0.00004609393,0.00019120862,0.9498758,0.043792166,0.003464214,0.0004225606,0.00024291208],"about_ca_topic_score_codex":0.000048071044,"about_ca_topic_score_gemma":0.0000024967414,"teacher_disagreement_score":0.9391805,"about_ca_system_score_codex":0.00017450235,"about_ca_system_score_gemma":0.00005957887,"threshold_uncertainty_score":0.66423976},"labels":[],"label_agreement":null},{"id":"W1969155620","doi":"10.1090/s0025-5718-07-01931-x","title":"Error bounds on complex floating-point multiplication","year":2007,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Arithmetic underflow; Double-precision floating-point format; Arithmetic; Base (topology); Floating point; Single-precision floating-point format; Multiplication (music); Product (mathematics); IEEE floating point; Value (mathematics); Approximation error; Discrete mathematics; Algorithm; Combinatorics; Mathematical analysis; Geometry; Computer science; Statistics","score_opus":0.06061191258833785,"score_gpt":0.35902135795128626,"score_spread":0.2984094453629484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969155620","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018746808,0.000005697044,0.9774457,0.00026976387,0.0001315768,0.00018422696,0.0000012015304,0.00010982439,0.0031051796],"genre_scores_gemma":[0.38795802,3.6438695e-7,0.6119159,0.00007677927,0.000026439977,0.000001690208,0.0000037112118,0.0000060943926,0.000010972105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987884,0.000042713873,0.00046045432,0.0001991409,0.00033846174,0.00017082403],"domain_scores_gemma":[0.9985422,0.0006575979,0.00031631178,0.00028885214,0.000131967,0.0000630879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000944614,0.000111295274,0.00019610279,0.00011941779,0.00007709946,0.00005250373,0.00032050602,0.000044753095,0.0000053504373],"category_scores_gemma":[0.000115689,0.00009934082,0.00005491738,0.00032375188,0.000039109145,0.00014195149,0.000070724265,0.00008582579,0.000031865628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010558946,0.0007302345,0.00004043276,0.00015830234,0.000024055857,0.0000032170617,0.0031777448,0.0049372795,0.016902294,0.2344099,0.00028522202,0.73932076],"study_design_scores_gemma":[0.0002526577,0.00016389486,0.0019627786,0.00004040242,0.0000042445226,0.000004792417,0.00008771358,0.8717772,0.00797499,0.11737975,0.00022498184,0.00012659747],"about_ca_topic_score_codex":0.000006696031,"about_ca_topic_score_gemma":6.677201e-7,"teacher_disagreement_score":0.86683995,"about_ca_system_score_codex":0.000033745793,"about_ca_system_score_gemma":0.000013875128,"threshold_uncertainty_score":0.40510008},"labels":[],"label_agreement":null},{"id":"W1970727540","doi":"10.1109/arith.2009.9","title":"A Decimal Floating-Point Adder with Decoded Operands and a Decimal Leading-Zero Anticipator","year":2009,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Decimal; Adder; Computer science; Arithmetic; Operand; Carry-save adder; Subtraction; Microprocessor; Floating point; Parallel computing; Computer hardware; Algorithm; Mathematics; Latency (audio); Telecommunications","score_opus":0.01647971254856314,"score_gpt":0.2883231375576311,"score_spread":0.271843425009068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970727540","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1142574,0.000086924694,0.88194215,0.001191812,0.00007197659,0.00013178046,7.574659e-7,0.0001556759,0.0021615226],"genre_scores_gemma":[0.42173016,0.0000051707707,0.5768524,0.0011879818,0.00003719751,0.0000036150432,2.4979283e-7,0.0000064297624,0.00017682224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841374,0.00007628173,0.00024792118,0.0005353791,0.00027049636,0.0004561996],"domain_scores_gemma":[0.9990761,0.00016761768,0.000058133894,0.00035721174,0.00008017027,0.00026071732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003644633,0.00021394406,0.00031892047,0.00008332758,0.00016467465,0.00031326505,0.000416642,0.000055057637,0.000040583294],"category_scores_gemma":[0.000089879046,0.00014132487,0.000049023853,0.00041871014,0.00006633403,0.0004884775,0.00012457011,0.00015121895,0.000019965279],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009145914,0.00027382057,0.002425865,0.000010994217,0.00004229836,0.00019815651,0.001071953,0.000056553854,0.005838097,0.037549928,0.00086868467,0.9515722],"study_design_scores_gemma":[0.008527865,0.007807215,0.056877892,0.00028736188,0.00009029757,0.0011789552,0.00022423218,0.8415805,0.033342887,0.041171856,0.0062054447,0.00270551],"about_ca_topic_score_codex":0.000023203584,"about_ca_topic_score_gemma":0.0000051183592,"teacher_disagreement_score":0.94886667,"about_ca_system_score_codex":0.000017093838,"about_ca_system_score_gemma":0.000051443996,"threshold_uncertainty_score":0.5763061},"labels":[],"label_agreement":null},{"id":"W1971185099","doi":"10.1109/iccd.2010.5647750","title":"Combined optimal and heuristic approaches for multiple constant multiplication","year":2010,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Heuristics; Pruning; Constant (computer programming); Computer science; Heuristic; Multiplication (music); Focus (optics); Mathematical optimization; Reuse; Bounded function; Algorithm; Adder; Mathematics","score_opus":0.04321531096769199,"score_gpt":0.27660089237686275,"score_spread":0.23338558140917076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971185099","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014705038,0.000009974912,0.98353153,0.00077248807,0.00017538249,0.00029063018,0.000003288143,0.000098768935,0.0004129215],"genre_scores_gemma":[0.37691316,9.4477537e-7,0.6228942,0.000057996414,0.000022521712,0.00004046559,0.0000012411505,0.0000031983186,0.00006623931],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993642,0.000019736992,0.0001223885,0.00027509822,0.000068003275,0.0001505929],"domain_scores_gemma":[0.9991037,0.00047149352,0.000039970313,0.000248924,0.000044405882,0.000091508635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023231085,0.000078895275,0.00010894655,0.000025164763,0.00009423316,0.000100253535,0.00022794184,0.00003904535,0.0000033120002],"category_scores_gemma":[0.00023195565,0.000060299797,0.000027192544,0.00008496002,0.000072756855,0.00013586036,0.0000957462,0.00008218604,0.0000031809436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013454617,0.00011548057,0.000902722,0.000014769173,0.000008293637,6.278691e-7,0.000110969624,0.000014436151,0.01153922,0.39761946,0.00009274074,0.58956784],"study_design_scores_gemma":[0.00059432874,0.00009027674,0.002045744,0.0000014455388,0.0000027731637,0.000004595698,0.000016647913,0.98192346,0.0034370688,0.0099930735,0.0017758062,0.000114799084],"about_ca_topic_score_codex":0.000009868785,"about_ca_topic_score_gemma":0.0000018605456,"teacher_disagreement_score":0.981909,"about_ca_system_score_codex":0.0000031980026,"about_ca_system_score_gemma":0.000013483808,"threshold_uncertainty_score":0.24589543},"labels":[],"label_agreement":null},{"id":"W1971221279","doi":"10.5555/2133429.2133586","title":"Analysis of precision for scaling the intermediate variables in fixed-point arithmetic circuits","year":2010,"lang":"en","type":"article","venue":"International Conference on Computer Aided Design","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Robustness (evolution); Polynomial; Scaling; Fixed-point arithmetic; Algorithm; Computation; Mathematics; Set (abstract data type); Electronic circuit; Fixed point; Computer science; Floating point; Arithmetic","score_opus":0.06669109764217149,"score_gpt":0.3337116421943614,"score_spread":0.26702054455218993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971221279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061730845,0.000005115175,0.9906385,0.000942797,0.001637323,0.00031059972,0.000012195009,0.000036569683,0.00024381225],"genre_scores_gemma":[0.5871006,0.0000052638798,0.41247743,0.0002480714,0.00009903925,0.000041364536,0.0000043613823,0.000005740199,0.000018109067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980829,0.00023280807,0.0005385556,0.0004899065,0.000424869,0.0002309955],"domain_scores_gemma":[0.996537,0.002284809,0.00023890409,0.00048582806,0.00038352323,0.00006993219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015921607,0.0001737257,0.0003495032,0.0005427835,0.000058491863,0.0002508958,0.0017651352,0.00007758642,0.000046158933],"category_scores_gemma":[0.0002624715,0.00012382581,0.00018082232,0.0007141329,0.000079036174,0.000252728,0.00023753174,0.00029510257,0.0000056877934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004095687,0.00022550025,0.00048919866,0.000008030721,0.00032606284,0.000007609862,0.0005899377,0.012880063,0.0057209,0.21088418,0.00008588341,0.76874167],"study_design_scores_gemma":[0.00035235065,0.00014657779,0.006822644,0.000054728,0.000031458836,0.000002878195,0.000009401052,0.9377948,0.0023696888,0.052191433,0.000085671185,0.00013836221],"about_ca_topic_score_codex":0.000035520738,"about_ca_topic_score_gemma":0.000008207823,"teacher_disagreement_score":0.9249147,"about_ca_system_score_codex":0.000032766708,"about_ca_system_score_gemma":0.000086494336,"threshold_uncertainty_score":0.504947},"labels":[],"label_agreement":null},{"id":"W1974678454","doi":"10.1145/1394042.1394060","title":"Computational complexity of numerical solutions of initial value problems for differential algebraic equations (abstract only)","year":2008,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Ordinary differential equation; Polynomial; Algebraic number; Ode; Differential equation; Differential (mechanical device); Applied mathematics; Class (philosophy); Exponential function; Differential algebraic equation; Value (mathematics); Mathematical optimization; Computer science; Mathematical analysis","score_opus":0.17770210566112915,"score_gpt":0.37951268894123513,"score_spread":0.20181058328010598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974678454","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008373936,0.0001466592,0.98780113,0.002501699,0.0002715468,0.00061144936,0.00009059189,0.00009816681,0.0001048001],"genre_scores_gemma":[0.49204674,0.000017326423,0.50768113,0.00007095675,0.00004023578,0.000055626828,0.00007517005,0.000010457614,0.000002365774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971628,0.00040706518,0.0011748883,0.00043329928,0.00042031417,0.00040158757],"domain_scores_gemma":[0.99298686,0.0035492799,0.0004784505,0.0024496168,0.00041814175,0.000117677075],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005162609,0.00024295683,0.0005733498,0.00034484192,0.00044482172,0.000040902924,0.004027535,0.00011150953,0.00001774962],"category_scores_gemma":[0.00032480469,0.00025224258,0.00026099212,0.0010394346,0.0009094477,0.00041941385,0.002110851,0.0003537717,0.0000059517183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000112284315,0.0020657675,0.00080410903,0.00006760038,0.00010283489,0.0000012753443,0.0012950095,0.008892643,0.00019133055,0.9155512,0.00022212086,0.07079489],"study_design_scores_gemma":[0.00081517705,0.0001850377,0.02679933,0.000059193957,0.000013751977,0.000021149033,0.000008516358,0.7101097,0.00008529162,0.2615446,0.00013584942,0.00022239401],"about_ca_topic_score_codex":0.00018239304,"about_ca_topic_score_gemma":0.000016041839,"teacher_disagreement_score":0.70121706,"about_ca_system_score_codex":0.00006903086,"about_ca_system_score_gemma":0.00033970122,"threshold_uncertainty_score":0.99999297},"labels":[],"label_agreement":null},{"id":"W1975570043","doi":"10.1109/tcad.2011.2170988","title":"Analytical Optimization of Bit-Widths in Fixed-Point LTI Systems","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Fixed-point arithmetic; Robustness (evolution); Electronic circuit; Algorithm; Computer science; Quantization (signal processing); Range (aeronautics); Fixed point; LTI system theory; Mathematics; Floating point; Mathematical optimization; Linear system","score_opus":0.046932495312888914,"score_gpt":0.27105628319333386,"score_spread":0.22412378788044496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975570043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018051895,0.00046613993,0.9948051,0.000030452358,0.0021120268,0.00059381744,0.000020557765,0.000084947074,0.000081790524],"genre_scores_gemma":[0.9134005,0.00007153553,0.0863263,0.000023695355,0.000071634575,0.000043542834,0.0000017322573,0.000020704845,0.000040366966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680084,0.0008368005,0.0010840421,0.00043723077,0.0004110909,0.0004300142],"domain_scores_gemma":[0.9979579,0.000707176,0.00032963516,0.00048284035,0.00029080518,0.00023163491],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013616107,0.00030503224,0.0007972928,0.00057606865,0.00008091767,0.00012576276,0.00043375354,0.00019682046,0.0000070112405],"category_scores_gemma":[0.000019645719,0.00024540114,0.00012257537,0.0011929375,0.00009775159,0.0005121674,0.000005545497,0.00031170304,0.0000039015304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020723584,0.0005814041,0.00009152278,0.00016662569,0.00010415404,0.0000074910845,0.00048058858,0.9224206,0.0014175675,0.0044040508,0.00005494265,0.07025028],"study_design_scores_gemma":[0.00056051154,0.0005348492,0.00006963533,0.00047351912,0.000026402282,0.000065568405,0.00015012332,0.99521285,0.0025811645,0.000040182444,0.000035076024,0.00025009367],"about_ca_topic_score_codex":0.00045745098,"about_ca_topic_score_gemma":8.6865356e-7,"teacher_disagreement_score":0.9115953,"about_ca_system_score_codex":0.0001013493,"about_ca_system_score_gemma":0.00009340009,"threshold_uncertainty_score":0.9999998},"labels":[],"label_agreement":null},{"id":"W1976872979","doi":"10.1587/nolta.3.287","title":"DC operating points of transistor circuits","year":2012,"lang":"en","type":"article","venue":"Nonlinear Theory and Its Applications IEICE","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Electronic circuit; Transistor; Nonlinear system; Electronic engineering; Bipolar junction transistor; Field (mathematics); Field-effect transistor; Computer science; Electrical engineering; Engineering; Mathematics; Physics; Voltage; Quantum mechanics; Pure mathematics","score_opus":0.02200192949743793,"score_gpt":0.298938791873764,"score_spread":0.27693686237632603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976872979","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0128802,0.00109898,0.98335004,0.00022764444,0.00006824822,0.0001988263,0.000012066589,0.00004808381,0.0021159365],"genre_scores_gemma":[0.45516676,0.00006639555,0.54375416,0.0003961385,0.00028291915,0.0000715512,0.0000033987255,0.00001182963,0.00024684254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991959,0.00015810656,0.00019046053,0.00018382673,0.000099923396,0.00017180323],"domain_scores_gemma":[0.999122,0.00036544472,0.000065466025,0.000270612,0.00006712912,0.00010932216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009596778,0.000085147476,0.00013174988,0.00003696811,0.0001363552,0.000022838798,0.00030138096,0.00004133218,0.000019227142],"category_scores_gemma":[0.00007588305,0.00007250629,0.000034102875,0.0002812861,0.000041961357,0.00029402753,0.00005922108,0.000093761046,0.000025295412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001512708,0.0001311946,0.000023198327,0.000022371976,0.0000091875945,1.215231e-7,0.0005430078,0.00000189352,0.016791478,0.63563895,0.0000047761287,0.34683228],"study_design_scores_gemma":[0.0023184957,0.00047586986,0.005925932,0.00017864234,0.00019158002,0.00021648344,0.0012117097,0.07178638,0.41303882,0.14054672,0.36198545,0.0021239168],"about_ca_topic_score_codex":0.00000128464,"about_ca_topic_score_gemma":6.334616e-8,"teacher_disagreement_score":0.49509224,"about_ca_system_score_codex":0.000006621062,"about_ca_system_score_gemma":0.000016980537,"threshold_uncertainty_score":0.2956721},"labels":[],"label_agreement":null},{"id":"W1976996892","doi":"10.1007/s10288-014-0269-0","title":"A reliable affine relaxation method for global optimization","year":2014,"lang":"en","type":"article","venue":"4OR","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Interval (graph theory); Affine transformation; Interval arithmetic; Relaxation (psychology); Constraint (computer-aided design); Computation; Operator (biology); Mathematics; Mathematical optimization; Branch and bound; Affine arithmetic; Upper and lower bounds; Global optimization; Algorithm; Local consistency; Linear inequality; Linear programming relaxation; Linear programming; Inequality; Constraint satisfaction; Statistics; Combinatorics","score_opus":0.015478581835785621,"score_gpt":0.3128095133241821,"score_spread":0.2973309314883965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976996892","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000108086715,0.000020153293,0.9952934,0.0015337733,0.00037459968,0.00013176475,0.0000013875023,0.00010973944,0.0025243792],"genre_scores_gemma":[0.00031699022,0.0000027885103,0.99860644,0.00042633986,0.00013764162,0.000027369782,0.0000030038054,0.0000043690675,0.00047503732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993455,0.00006543026,0.00012114432,0.00022301562,0.000099804354,0.0001451368],"domain_scores_gemma":[0.9994628,0.0001234255,0.00006995922,0.00022276175,0.00007056968,0.000050506467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005449524,0.000062390216,0.00009983478,0.000016835507,0.0000706423,0.00006716914,0.00023398995,0.000037880403,0.000009167503],"category_scores_gemma":[0.00030439332,0.000052432304,0.00004024309,0.0002720658,0.0000065146705,0.00018427317,0.000052809366,0.0000293587,0.000009667716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004912661,0.000025906282,0.000024544071,0.000008353161,0.0000037498985,1.6885267e-7,0.000020322304,0.025316138,0.000117474236,0.16278027,0.00088377047,0.8108144],"study_design_scores_gemma":[0.00022548833,0.000099102035,0.00010594022,0.000005199128,0.0000036039348,0.0000020310788,0.0000012432232,0.9220957,0.00039327817,0.03640828,0.04058841,0.00007173343],"about_ca_topic_score_codex":0.000014888372,"about_ca_topic_score_gemma":4.2663982e-7,"teacher_disagreement_score":0.89677954,"about_ca_system_score_codex":0.000027812897,"about_ca_system_score_gemma":0.000014627524,"threshold_uncertainty_score":0.21381274},"labels":[],"label_agreement":null},{"id":"W1977375620","doi":"10.1016/j.jsc.2008.11.003","title":"Symbolic–numeric sparse interpolation of multivariate polynomials","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Universiteit Antwerpen; Natural Sciences and Engineering Research Council of Canada; Mitacs; Fonds Wetenschappelijk Onderzoek; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Mathematics; Interpolation (computer graphics); Polynomial; Applied mathematics; Floating point; Eigenvalues and eigenvectors; Polynomial interpolation; Algorithm; Algebra over a field; Pure mathematics; Linear interpolation; Mathematical analysis; Computer science; Image (mathematics)","score_opus":0.03533795481161242,"score_gpt":0.3080761204314586,"score_spread":0.2727381656198462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977375620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24014297,0.0001287959,0.75854856,0.00024872387,0.00065554085,0.00007287024,7.8406794e-7,0.000019882855,0.00018189568],"genre_scores_gemma":[0.67130274,0.0000316036,0.32839143,0.000066447836,0.00018067268,7.42419e-7,4.985514e-7,0.000007003498,0.000018876988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980959,0.00023702538,0.00091109663,0.00016421008,0.00040941418,0.0001823491],"domain_scores_gemma":[0.99797076,0.00027895218,0.0011078281,0.00016663896,0.00034966477,0.00012618053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005756961,0.0001391081,0.0004742088,0.00032444843,0.00008048991,0.00003599863,0.00042487908,0.000056507546,0.000008482907],"category_scores_gemma":[0.00013625769,0.00011715694,0.00017875235,0.0005915618,0.000060580995,0.000584463,0.0000899682,0.00018217332,0.0000075703224],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009694182,0.0006030783,0.0041058813,0.00005350606,0.00018823022,0.00010459832,0.007996305,0.010946426,0.05622213,0.0079162195,0.0005078954,0.9112588],"study_design_scores_gemma":[0.0020270823,0.0009227308,0.18436173,0.00021176724,0.00004972271,0.0012642196,0.00011725996,0.7808497,0.008659959,0.020339644,0.0007756506,0.0004205619],"about_ca_topic_score_codex":0.000056854075,"about_ca_topic_score_gemma":2.8846802e-7,"teacher_disagreement_score":0.91083825,"about_ca_system_score_codex":0.000043112443,"about_ca_system_score_gemma":0.0001216041,"threshold_uncertainty_score":0.47775215},"labels":[],"label_agreement":null},{"id":"W1978606610","doi":"10.1109/cjece.2006.259201","title":"Arithmetic formats for implementing artificial neural networks on FPGAs","year":2006,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Artificial neural network; Computer science; Field-programmable gate array; Arithmetic; Computer architecture; Artificial intelligence; Parallel computing; Embedded system; Mathematics","score_opus":0.011188931007590863,"score_gpt":0.2157850787090465,"score_spread":0.20459614770145565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978606610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013149013,0.00029245418,0.98561996,0.00034316158,0.0004997949,0.00006519046,8.658066e-7,0.000015258176,0.00001431222],"genre_scores_gemma":[0.7533654,0.000002191873,0.24521184,0.00024914712,0.0011525356,0.0000026556102,6.5271394e-7,0.0000104673545,0.000005091857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989225,0.000018333161,0.00032337848,0.00013365508,0.00009647734,0.0005056396],"domain_scores_gemma":[0.9992426,0.00021012992,0.00008399356,0.00007875785,0.000066737986,0.00031778112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024588587,0.00012030449,0.00019869686,0.00022195333,0.00012267764,0.00022526753,0.00025967354,0.000039120972,0.0000010270234],"category_scores_gemma":[0.000024045175,0.00010331464,0.000090355235,0.00029272903,0.000009967488,0.00015814404,0.00002076053,0.00021157836,2.2293185e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049273485,0.0000172906,0.00013709531,0.000009957494,0.000020966034,0.000076256954,0.000026207648,0.105329014,0.000070172064,0.06336354,0.00048317297,0.8304614],"study_design_scores_gemma":[0.00016803076,0.00034860114,0.0011639241,0.000014316411,0.00000603464,0.00012536971,5.467722e-7,0.991722,0.00012650629,0.0027551034,0.0034445683,0.00012500364],"about_ca_topic_score_codex":0.00011077658,"about_ca_topic_score_gemma":0.000034361878,"teacher_disagreement_score":0.88639295,"about_ca_system_score_codex":0.000045257795,"about_ca_system_score_gemma":0.000055224045,"threshold_uncertainty_score":0.42130488},"labels":[],"label_agreement":null},{"id":"W1979413078","doi":"10.1117/12.619393","title":"Error analysis of data mapping using 2-dimensional logarithmic number systems","year":2005,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Logarithm; Computer science; Algorithm; Floating point; Round-off error; Representation (politics); Reduction (mathematics); Variance (accounting); Error analysis; Approximation error; Matching (statistics); Arithmetic; Mathematics; Statistics","score_opus":0.040864030863281484,"score_gpt":0.29457176718950745,"score_spread":0.25370773632622595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979413078","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9801732,0.00012419673,0.017300706,0.0011500184,0.00028261068,0.0003359117,0.00010746073,0.00007273959,0.0004531741],"genre_scores_gemma":[0.10449991,0.000020186471,0.89493656,0.000075375545,0.00032763387,0.000024742445,0.000015131283,0.000029227655,0.000071236675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969909,5.5890617e-8,0.0009858521,0.0006221989,0.0009817873,0.00041915796],"domain_scores_gemma":[0.99729604,0.00027430902,0.0006591055,0.00019049166,0.0014372934,0.00014276234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013528294,0.00030243085,0.00070343557,0.00021705776,0.0000898686,0.0001521127,0.0027174046,0.00017344143,0.000010621891],"category_scores_gemma":[0.00036919734,0.00024866586,0.00059746776,0.0012992121,0.00019211347,0.0013292469,0.000823033,0.00030152738,0.0000016910406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003063325,0.00027328945,0.00072686706,0.00039786374,0.0030029358,2.2869365e-7,0.00023857136,0.0069459444,0.3450077,0.6395564,0.0010550302,0.002764561],"study_design_scores_gemma":[0.00041299337,0.000059536964,0.0005228919,0.00016911632,0.00037543918,0.000017048273,0.00027766687,0.98880947,0.006468225,0.00042268165,0.0021913464,0.00027360843],"about_ca_topic_score_codex":0.00003939531,"about_ca_topic_score_gemma":1.2015786e-7,"teacher_disagreement_score":0.9818635,"about_ca_system_score_codex":0.00014449291,"about_ca_system_score_gemma":0.00005078261,"threshold_uncertainty_score":0.99999654},"labels":[],"label_agreement":null},{"id":"W1983773458","doi":"10.1109/ifsa-nafips.2013.6608407","title":"Interval-based analysis of BOCR (benefits, opportunities, costs and risks) models evaluated by multiple experts","year":2013,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Analytic hierarchy process; Analytic network process; Context (archaeology); Interval (graph theory); Interval arithmetic; Computer science; Multiplication (music); Operations research; Division (mathematics); Risk analysis (engineering); Mathematics; Arithmetic","score_opus":0.14719113117872992,"score_gpt":0.327590490150952,"score_spread":0.18039935897222206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983773458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058297016,0.00051003415,0.9396977,0.00058259076,0.000063681626,0.00018190248,0.000022056067,0.00008595893,0.00055908196],"genre_scores_gemma":[0.7130774,0.00008689188,0.28580692,0.0007317358,0.000006877868,0.000042625543,0.000015606787,0.000008883392,0.00022302473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985174,0.0001984915,0.00035077345,0.00037950455,0.00031014415,0.00024366542],"domain_scores_gemma":[0.9986134,0.00035232696,0.00012708623,0.00047842777,0.00021472083,0.00021399882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003609983,0.00016053738,0.00039860295,0.00021718926,0.000054903834,0.00011462635,0.00043254305,0.000056085846,0.00018054203],"category_scores_gemma":[0.00006018494,0.000121400815,0.000115146686,0.0006676958,0.0000689024,0.00047343533,0.00017946245,0.000057711895,0.0000027733088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055061846,0.00017405357,0.0011746369,0.000008663937,0.00027604715,0.000001786726,0.0001700348,0.004339995,0.0012373325,0.0024874466,0.0024037124,0.9877208],"study_design_scores_gemma":[0.00032202332,0.00008579708,0.0010446379,0.00001218599,0.00006506032,4.6696954e-7,0.00009315633,0.9948482,0.0024244061,0.0007016751,0.00023475158,0.00016765107],"about_ca_topic_score_codex":0.0035628,"about_ca_topic_score_gemma":0.000020759171,"teacher_disagreement_score":0.9905082,"about_ca_system_score_codex":0.000028638558,"about_ca_system_score_gemma":0.00003360933,"threshold_uncertainty_score":0.53859115},"labels":[],"label_agreement":null},{"id":"W1987780915","doi":"10.1145/1347375.1347379","title":"Compile-time and instruction-set methods for improving floating- to fixed-point conversion accuracy","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Algorithm; Scaling; Compile time; Floating point; Adder; Fixed point; Parallel computing; Subtraction; Parameterized complexity; Instruction set; Context (archaeology); Compiler; Arithmetic; Mathematics","score_opus":0.035407701208323566,"score_gpt":0.33431376450631906,"score_spread":0.2989060632979955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987780915","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018603442,0.00006843758,0.9777068,0.00039742712,0.0018914363,0.0008490884,0.000015786114,0.0004283024,0.000039285213],"genre_scores_gemma":[0.19300209,0.0000052874434,0.8064657,0.00023023179,0.00015519276,0.000029105046,0.000003314293,0.00002631434,0.00008277968],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731797,0.00048257134,0.0006229885,0.00082056806,0.00026588014,0.00049005065],"domain_scores_gemma":[0.9958168,0.00253526,0.00025497004,0.00089606864,0.00020875409,0.00028810292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011484977,0.00031336036,0.0005226178,0.00026361778,0.0010750843,0.00022069633,0.00083900394,0.00012405023,0.0000057673597],"category_scores_gemma":[0.00037385945,0.0002982899,0.00015602421,0.0006560962,0.00007120455,0.00038419414,0.000080855054,0.00029801085,0.000026566537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004761846,0.00010740422,0.000016865552,0.00016476228,0.00007717605,0.000006951474,0.0035670942,0.01860501,0.010817006,0.0006131171,0.00016064158,0.9658164],"study_design_scores_gemma":[0.0011237623,0.00049655896,0.000068602625,0.00010451595,0.00002375375,0.00029986814,0.00034713864,0.98502755,0.009877347,0.0004010548,0.0017708589,0.00045896368],"about_ca_topic_score_codex":0.0001598405,"about_ca_topic_score_gemma":4.1025498e-7,"teacher_disagreement_score":0.96642256,"about_ca_system_score_codex":0.00011015817,"about_ca_system_score_gemma":0.00006785993,"threshold_uncertainty_score":0.99994695},"labels":[],"label_agreement":null},{"id":"W1987899988","doi":"10.1109/eeei.2010.5661940","title":"Instruction set extensions for computation on complex floating point numbers","year":2010,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Subtraction; Parallel computing; Speedup; Instruction set; Arithmetic; Computation; Multiplier (economics); Floating point; Instructions per cycle; Multiplication (music); Set (abstract data type); Computer hardware; Algorithm; Programming language; Central processing unit; Mathematics","score_opus":0.05662785870432474,"score_gpt":0.35088049656431697,"score_spread":0.2942526378599922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987899988","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028348545,4.1467953e-7,0.96688974,0.0015331305,0.0011100005,0.00017231754,0.0000026627065,0.0001694719,0.0017737017],"genre_scores_gemma":[0.18668407,2.1296397e-7,0.81249124,0.00065530295,0.000109119734,0.000006065863,0.0000052281284,0.0000053832964,0.000043396714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922967,0.00003816239,0.00016631246,0.00026366298,0.00013516295,0.0001670181],"domain_scores_gemma":[0.9992958,0.00027021737,0.00006635333,0.00019231706,0.000094581,0.000080784484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025699416,0.00008585943,0.00010831156,0.000050645154,0.00020253882,0.00009138433,0.00018665365,0.00003914159,0.000022593998],"category_scores_gemma":[0.00012039429,0.00006979761,0.00005573289,0.0001927195,0.000027569387,0.00019886957,0.00005941431,0.0001327151,0.000022125685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004431959,0.000037126374,0.00003259806,0.0000051445995,0.0000050696362,8.519877e-7,0.00015559352,0.00031625165,0.01775613,0.13782117,0.0013853257,0.8424803],"study_design_scores_gemma":[0.0004389116,0.00013554523,0.002455677,0.000006278247,0.0000025120928,0.000019545692,0.00006841456,0.9363582,0.0028128605,0.05348336,0.0040662726,0.00015238686],"about_ca_topic_score_codex":0.000045947112,"about_ca_topic_score_gemma":0.0000070961705,"teacher_disagreement_score":0.936042,"about_ca_system_score_codex":0.000011865982,"about_ca_system_score_gemma":0.000014830387,"threshold_uncertainty_score":0.28462636},"labels":[],"label_agreement":null},{"id":"W1990081392","doi":"10.1147/rd.461.0097","title":"Fast pseudorandom-number generators with modulus 2 <sup>k</sup> or 2 <sup>k</sup> -1 using fused multiply-add","year":2002,"lang":"en","type":"article","venue":"IBM Journal of Research and Development","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Pseudorandom number generator; Computer science; Algorithm; Multiplicative function; Code (set theory); Random number generation; Discrete mathematics; Arithmetic; Mathematics; Programming language","score_opus":0.10497825331795745,"score_gpt":0.35053249780029183,"score_spread":0.24555424448233437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990081392","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4462506,0.0008223958,0.55174994,0.00048518798,0.000119596756,0.00032420433,0.0000032534547,0.00003779192,0.0002070249],"genre_scores_gemma":[0.1428606,0.00034468865,0.85567147,0.00014417824,0.00030723182,0.000011446283,6.537321e-7,0.000029564115,0.00063016237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99542177,0.00052309775,0.0007440879,0.0005042155,0.0018230089,0.0009838258],"domain_scores_gemma":[0.99727845,0.00040321602,0.0002188887,0.00035504604,0.00089072564,0.0008536696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002463725,0.00031287194,0.0005590663,0.0004327468,0.0006069859,0.00056650606,0.00086769776,0.00010486165,0.0002415717],"category_scores_gemma":[0.00024260939,0.00019531966,0.00007947458,0.0011686988,0.0002525982,0.0007151606,0.00040165638,0.00077527657,0.0000454807],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086436525,0.0009256524,0.012291086,0.00011904672,0.0005138279,0.002213956,0.008807877,0.012418,0.00046456707,0.00016601937,0.0057495707,0.95546603],"study_design_scores_gemma":[0.014793484,0.0023250014,0.0020247956,0.0006760665,0.00002718942,0.004980495,0.0015101368,0.93082845,0.008245295,0.00091325084,0.0323594,0.0013164056],"about_ca_topic_score_codex":0.000027573107,"about_ca_topic_score_gemma":0.0000023783182,"teacher_disagreement_score":0.9541496,"about_ca_system_score_codex":0.00019434016,"about_ca_system_score_gemma":0.00051599415,"threshold_uncertainty_score":0.7964905},"labels":[],"label_agreement":null},{"id":"W1990733120","doi":"10.1016/j.nahs.2010.05.010","title":"Computing reachable sets for uncertain nonlinear hybrid systems using interval constraint-propagation techniques","year":2010,"lang":"en","type":"article","venue":"Nonlinear Analysis Hybrid Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Intersection (aeronautics); Local consistency; Interval (graph theory); Nonlinear system; Interval arithmetic; Constraint satisfaction problem; Constraint satisfaction; Hybrid system; Mathematical optimization; Set (abstract data type); Constraint (computer-aided design); Consistency (knowledge bases); Computer science; Dynamical systems theory; Mathematics; Algorithm; Artificial intelligence","score_opus":0.03962665466784618,"score_gpt":0.3365361485269545,"score_spread":0.29690949385910836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990733120","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061160963,0.00014880988,0.9348297,0.00011532776,0.0018933094,0.00099396,0.00022270223,0.00048322623,0.00015196201],"genre_scores_gemma":[0.3355941,0.000004137019,0.6628633,0.00006662987,0.0011071096,0.00004610613,0.00012982388,0.0000441163,0.00014467248],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954524,0.00050532573,0.0013975854,0.001156156,0.0007081683,0.00078034133],"domain_scores_gemma":[0.99628425,0.0005245123,0.0008483111,0.0012216412,0.00080864725,0.00031263553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034909882,0.0004882198,0.0012892127,0.00063381967,0.00045006038,0.000965146,0.0012213595,0.00013588589,0.000006872162],"category_scores_gemma":[0.00031100877,0.00043217666,0.0006588736,0.0014109804,0.00015375165,0.0004997242,0.00027592387,0.000543437,0.000013979445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018977081,0.002336997,0.010245203,0.0034893928,0.010267833,0.00081107713,0.001216645,0.13091497,0.20146728,0.02021546,0.0022604675,0.6165849],"study_design_scores_gemma":[0.00028241015,0.000115838804,0.000010543901,0.00011662069,0.00029921776,0.00032025296,0.00012060703,0.98262066,0.007221222,0.00008877503,0.008291258,0.000512595],"about_ca_topic_score_codex":0.0013135509,"about_ca_topic_score_gemma":0.000015511574,"teacher_disagreement_score":0.8517057,"about_ca_system_score_codex":0.00014590925,"about_ca_system_score_gemma":0.0001963971,"threshold_uncertainty_score":0.999813},"labels":[],"label_agreement":null},{"id":"W1991852511","doi":"10.1145/2608628.2608671","title":"Sparse interpolation over finite fields via low-order roots of unity","year":2014,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; National Science Foundation","keywords":"Interpolation (computer graphics); A priori and a posteriori; Probabilistic logic; Finite field; Mathematics; Polynomial interpolation; Monte Carlo method; Algorithm; Polynomial; Applied mathematics; Probabilistic analysis of algorithms; Order (exchange); Discrete mathematics; Degree (music); Combinatorics; Computer science; Linear interpolation; Mathematical analysis; Statistics; Artificial intelligence","score_opus":0.01579895923004991,"score_gpt":0.27607005069484997,"score_spread":0.26027109146480004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991852511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008354815,0.000004389674,0.9853824,0.0003096383,0.00028735425,0.000039275932,3.0819763e-7,0.00004413664,0.0055777067],"genre_scores_gemma":[0.5598852,9.680425e-7,0.43937126,0.0004321389,0.00003795602,0.0000011015032,3.9649439e-7,0.0000024166268,0.00026859215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993342,0.00010353265,0.00016076994,0.00015632082,0.0001266988,0.00011844515],"domain_scores_gemma":[0.9992375,0.00026864465,0.00006171901,0.00031131125,0.00006604792,0.0000547864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027109054,0.000068430665,0.00011775551,0.00004322336,0.000027370686,0.000026642529,0.00029164072,0.000046133122,0.00014493248],"category_scores_gemma":[0.00014315036,0.000052662093,0.000038319373,0.00027352298,0.00002256042,0.00018792461,0.00014331783,0.00008659005,0.00002185223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006422599,0.0001259403,0.0020439264,0.000020964977,0.000012447998,0.0000011204012,0.00017219271,0.00033012734,0.002764542,0.050763704,0.00039780966,0.9433608],"study_design_scores_gemma":[0.0001506491,0.000101446254,0.013244117,0.000011516088,0.0000019619529,7.28947e-7,0.0000028246407,0.95550877,0.0024809765,0.02677264,0.0016298144,0.00009456529],"about_ca_topic_score_codex":0.00014223032,"about_ca_topic_score_gemma":0.000011043427,"teacher_disagreement_score":0.9551786,"about_ca_system_score_codex":0.000004727813,"about_ca_system_score_gemma":0.000011665539,"threshold_uncertainty_score":0.21474978},"labels":[],"label_agreement":null},{"id":"W1993610964","doi":"10.5539/jmr.v6n2p104","title":"Master-Slave Algorithm for Highly Accurate and Rapid Computation of the Voigt/Complex Error Function","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"York University","funders":"York University","keywords":"Computation; Mathematics; Rational function; Decimal; Function (biology); Exponential function; Algorithm; Error function; Fast Fourier transform; Applied mathematics; Arithmetic; Mathematical analysis","score_opus":0.20538737465742396,"score_gpt":0.41598623025586595,"score_spread":0.210598855598442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993610964","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00591693,0.00006534508,0.9919471,0.0014645662,0.00026437055,0.00021460661,0.0000021466376,0.0000058273854,0.000119107724],"genre_scores_gemma":[0.0911146,0.00001549739,0.9085879,0.00003891534,0.00015320824,0.000004575077,1.9424984e-7,0.000009423049,0.00007569946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979613,0.00041275058,0.00052023196,0.00012769013,0.00075763575,0.00022043115],"domain_scores_gemma":[0.99705625,0.0013893461,0.00045581497,0.00023088732,0.0007754098,0.00009228197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047629415,0.0000870812,0.0002729801,0.00017037174,0.00015588598,0.00013367145,0.00057570497,0.000043638312,0.0000043362643],"category_scores_gemma":[0.00051694055,0.00005141456,0.00010759042,0.00035967797,0.00011601254,0.00022681222,0.00021618232,0.00026199562,0.0000019161143],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012518683,0.00016813428,0.000010999074,0.00017050485,0.000043743403,0.0000010609053,0.00061010063,0.00009426525,0.0049604066,0.009073852,0.00064397,0.98421043],"study_design_scores_gemma":[0.000552263,0.0007501715,0.00078951777,0.000105064886,0.000011439004,0.000042001167,0.00017774968,0.85915244,0.0017545817,0.13525164,0.0013502624,0.00006289221],"about_ca_topic_score_codex":0.0000023778239,"about_ca_topic_score_gemma":2.965349e-7,"teacher_disagreement_score":0.98414755,"about_ca_system_score_codex":0.000025843516,"about_ca_system_score_gemma":0.00005929499,"threshold_uncertainty_score":0.2096625},"labels":[],"label_agreement":null},{"id":"W1998909571","doi":"10.1109/newcas.2014.6934008","title":"Enablingy the DC solutions characterization using a fuzzy approach","year":2014,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Offset (computer science); Ring oscillator; Electronic circuit; DC bias; Control theory (sociology); Fuzzy logic; Computer science; Voltage; Algorithm; Stability (learning theory); Mathematics; Engineering; Electrical engineering; Artificial intelligence","score_opus":0.05827735148414172,"score_gpt":0.2770267036821635,"score_spread":0.21874935219802177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998909571","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011400898,0.000006934674,0.99272233,0.0009289058,0.00022614861,0.00007208061,3.3619364e-7,0.000095008065,0.0048081647],"genre_scores_gemma":[0.07800553,0.0000029087373,0.9206467,0.0008126392,0.00025106553,0.000007330722,0.0000017003384,0.0000048781812,0.00026721173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992328,0.0001511567,0.00010974165,0.00018890284,0.00012324523,0.0001941124],"domain_scores_gemma":[0.99948084,0.00006930288,0.000045854304,0.00032187125,0.00003756942,0.000044580655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050405075,0.00006388446,0.000076534394,0.000031132768,0.00026453077,0.00015742604,0.0004073113,0.00002488907,0.0000054543893],"category_scores_gemma":[0.0000520045,0.00003756299,0.000036000187,0.00036621178,0.000030699382,0.0002283219,0.00016443123,0.00007108402,0.000013238185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.6909823e-7,0.00006113026,0.000033050652,0.000004309744,0.0000064879305,2.0259732e-7,0.00019481129,0.00022049471,0.039063916,0.521257,0.00003176478,0.43912628],"study_design_scores_gemma":[0.000053433665,0.000015567428,0.00055257307,0.0000021340693,0.0000026505409,0.0000060699895,0.000010102196,0.9831694,0.00058748334,0.008599093,0.0069255326,0.000076002805],"about_ca_topic_score_codex":0.000024041137,"about_ca_topic_score_gemma":1.632504e-7,"teacher_disagreement_score":0.98294884,"about_ca_system_score_codex":0.000010813893,"about_ca_system_score_gemma":0.000015670845,"threshold_uncertainty_score":0.20345835},"labels":[],"label_agreement":null},{"id":"W2000965014","doi":"10.3182/20090916-3-es-3003.00028","title":"Computing reachable sets for uncertain nonlinear hybrid systems using interval constraint propagation techniques","year":2009,"lang":"en","type":"article","venue":"IFAC Proceedings Volumes","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Local consistency; Intersection (aeronautics); Interval (graph theory); Nonlinear system; Constraint satisfaction problem; Interval arithmetic; Constraint satisfaction; Hybrid system; Mathematical optimization; Set (abstract data type); Mathematics; Constraint (computer-aided design); Consistency (knowledge bases); Computer science; Algorithm; Artificial intelligence; Engineering; Discrete mathematics","score_opus":0.039207515881425646,"score_gpt":0.32688308606519373,"score_spread":0.2876755701837681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000965014","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04165855,0.000108783555,0.9556547,0.00050717563,0.00029901715,0.0008051405,0.000008383743,0.00057713507,0.00038112293],"genre_scores_gemma":[0.27001628,0.000003289522,0.72951096,0.00015524021,0.00024125524,0.000016625801,0.0000029254522,0.000012750704,0.000040682386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822885,0.000024514593,0.0004506045,0.000550241,0.00027470704,0.0004711088],"domain_scores_gemma":[0.99895513,0.0000699356,0.0002935247,0.00014726091,0.0004142535,0.00011987333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009411243,0.00023104138,0.00035995847,0.00012689727,0.00025904735,0.0005422347,0.00053925987,0.00007304428,8.840134e-7],"category_scores_gemma":[0.00019896738,0.0002077968,0.00010205288,0.00031939856,0.00007031562,0.00065309077,0.000116618314,0.00017610933,0.0000022241145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013842738,0.00011219531,0.00029235342,0.00017800929,0.000022487886,0.0000071501254,0.00048239782,0.00008025914,0.025261149,0.01494386,0.00047563872,0.95813066],"study_design_scores_gemma":[0.00018133114,0.000385744,0.000033237528,0.00027844706,0.000010746269,0.00016763777,0.00014993317,0.9682236,0.022742895,0.005351083,0.0021828648,0.00029253587],"about_ca_topic_score_codex":0.000053830267,"about_ca_topic_score_gemma":9.939573e-8,"teacher_disagreement_score":0.9681433,"about_ca_system_score_codex":0.00012717038,"about_ca_system_score_gemma":0.00007390073,"threshold_uncertainty_score":0.84737074},"labels":[],"label_agreement":null},{"id":"W2001747039","doi":"10.1109/reconfig.2011.38","title":"Fixed-Point CORDIC-Based QR Decomposition by Givens Rotations on FPGA","year":2011,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"CORDIC; QR decomposition; Field-programmable gate array; Computer science; Systolic array; Matrix (chemical analysis); Matrix decomposition; Decomposition; Parallel computing; Path (computing); Singular value decomposition; Algorithm; Eigenvalues and eigenvectors; Computer hardware; Very-large-scale integration; Embedded system","score_opus":0.031198254057931737,"score_gpt":0.2929314508790531,"score_spread":0.26173319682112134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001747039","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012619004,0.000009156589,0.982067,0.0011641488,0.00025371043,0.000111982175,0.000004922564,0.00017557551,0.014951594],"genre_scores_gemma":[0.15319766,0.0000015187782,0.8444812,0.001980158,0.000025712268,0.00002233389,0.0000046056366,0.0000066807143,0.00028010856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912375,0.000099583056,0.00015352039,0.00027523114,0.0001577072,0.00019022901],"domain_scores_gemma":[0.999318,0.00014465352,0.000052693267,0.00031618954,0.00004973017,0.00011873417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015413716,0.00010148298,0.00010873848,0.00005531226,0.00011627039,0.000054007385,0.0003340117,0.00003338026,0.0003121682],"category_scores_gemma":[0.00002279492,0.00008163376,0.000062850726,0.00023321543,0.00003121352,0.00017118205,0.000046047266,0.00008968559,0.00023587077],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002699632,0.0010133543,0.00022672371,0.000010419442,0.000026910784,0.000027117656,0.00052860146,0.00011861685,0.008197264,0.0899644,0.016866656,0.8829929],"study_design_scores_gemma":[0.0018405371,0.0029329956,0.014076189,0.00008320365,0.000026335018,0.000017360664,0.00009982486,0.51464415,0.37915376,0.072069556,0.013906807,0.0011492743],"about_ca_topic_score_codex":0.00011501581,"about_ca_topic_score_gemma":0.0000022599195,"teacher_disagreement_score":0.8818437,"about_ca_system_score_codex":0.000024074367,"about_ca_system_score_gemma":0.000021039552,"threshold_uncertainty_score":0.3418023},"labels":[],"label_agreement":null},{"id":"W2002724831","doi":"10.1016/j.procs.2010.04.200","title":"Efficient generated libraries for asynchronous derivative computation","year":2010,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"U.S. Department of Energy","keywords":"Computer science; Automatic differentiation; Computation; Asynchronous communication; Loop unrolling; Intrinsics; Parallel computing; Generator (circuit theory); Transformation (genetics); Program transformation; Code generation; Code (set theory); Programming language; Theoretical computer science; Compiler; Key (lock); Operating system","score_opus":0.016611026128836432,"score_gpt":0.2786232879182579,"score_spread":0.2620122617894215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002724831","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047032114,0.000025043832,0.948748,0.0007179151,0.0026295104,0.00041644313,0.0000025492905,0.00032037823,0.00010803755],"genre_scores_gemma":[0.26723668,4.9414416e-7,0.732001,0.0003995139,0.0003021909,0.000045444285,0.0000012720848,0.000008006638,0.000005389951],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780136,0.00003229849,0.00028014102,0.0008570847,0.00046514886,0.0005639896],"domain_scores_gemma":[0.9983877,0.00031722695,0.00014624915,0.00037631523,0.00051795255,0.00025457612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007904745,0.00020217792,0.0002110268,0.0002018251,0.00058934215,0.0008976313,0.0016064506,0.000056011846,0.0000028735997],"category_scores_gemma":[0.00020757002,0.00016980157,0.000060404996,0.0016932038,0.0005123698,0.00066385895,0.0005605637,0.00020527211,0.00001655167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006267814,0.00016499337,0.00014894042,0.000027604181,0.000008048933,0.0000040118484,0.0013442979,0.007982676,0.039109517,0.12717906,0.00019049986,0.8238341],"study_design_scores_gemma":[0.0002506643,0.00016929075,0.0015401646,0.0000075918065,0.0000022319502,0.00001972675,0.0000041473913,0.95315987,0.03038553,0.013867447,0.00034866776,0.00024464438],"about_ca_topic_score_codex":0.000004024736,"about_ca_topic_score_gemma":5.783026e-7,"teacher_disagreement_score":0.9451772,"about_ca_system_score_codex":0.000031466305,"about_ca_system_score_gemma":0.00050675136,"threshold_uncertainty_score":0.86558795},"labels":[],"label_agreement":null},{"id":"W2004538207","doi":"10.1109/icecs.2005.4633436","title":"An efficient algorithm and architecture for natural logarithm using Maclaurin series","year":2005,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Logarithm; Natural logarithm; Computer science; Algorithm; Series (stratigraphy); Computation; Architecture; Function (biology); Parallel computing; Radix (gastropod); Arithmetic; Mathematics","score_opus":0.014506328368360324,"score_gpt":0.2959944869269043,"score_spread":0.281488158558544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004538207","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004561647,0.00020686066,0.99296683,0.001598086,0.00027000823,0.00018504464,0.0000052837086,0.00013875672,0.000067457964],"genre_scores_gemma":[0.0070974464,0.0000029327289,0.9919595,0.00048525602,0.0002557157,0.000007726382,0.00000125445,0.000009498575,0.0001806862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989338,0.000055855624,0.00014934885,0.00040134264,0.00014665718,0.00031299988],"domain_scores_gemma":[0.99943376,0.0000794857,0.000039168797,0.000270848,0.000040767736,0.0001359685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022150087,0.00014710396,0.00016337242,0.00006773408,0.00017243004,0.0001920186,0.0003280325,0.00004592663,0.0000065164554],"category_scores_gemma":[0.000015110299,0.00010861495,0.000048213577,0.00017287524,0.00006667112,0.00025953716,0.00013155508,0.00012171103,0.0000015211627],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037523266,0.00004102023,0.0000040081054,0.000005289166,0.0000054389902,0.0000025438162,0.00014750977,0.0017639223,0.00091605727,0.008468545,0.000013722255,0.9886282],"study_design_scores_gemma":[0.00026162923,0.00013502284,0.00011002654,0.000005627388,0.00000423339,0.0001045892,0.00002143519,0.9805868,0.0047237724,0.004014731,0.009836781,0.0001953379],"about_ca_topic_score_codex":0.000020138405,"about_ca_topic_score_gemma":0.0000040556256,"teacher_disagreement_score":0.9884328,"about_ca_system_score_codex":0.000022546817,"about_ca_system_score_gemma":0.00002188006,"threshold_uncertainty_score":0.44291893},"labels":[],"label_agreement":null},{"id":"W2005309768","doi":"10.1049/el.2013.2320","title":"Improved design of high‐frequency sequential decimal multipliers","year":2014,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decimal; Arithmetic; Computer science; Mathematics; Electronic engineering; Engineering","score_opus":0.012034930226980956,"score_gpt":0.2411856296634162,"score_spread":0.22915069943643523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005309768","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01778539,0.0000934754,0.9795039,0.0019658187,0.00036335966,0.00015193422,7.8399955e-7,0.000095630756,0.0000396941],"genre_scores_gemma":[0.34041077,0.000009665232,0.6583589,0.0010961368,0.00008975428,0.000011025685,9.96358e-7,0.0000126551495,0.000010147443],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982189,0.00027125268,0.00028146463,0.00040810122,0.00024271033,0.0005775496],"domain_scores_gemma":[0.9989558,0.00024282996,0.0001509085,0.000502424,0.00004634798,0.00010171657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006329479,0.00017309462,0.00025423968,0.00008601644,0.000080435435,0.000058418686,0.0008547224,0.00005947277,0.000007656719],"category_scores_gemma":[0.00010125864,0.0001581223,0.00009548449,0.00032785942,0.00007826378,0.0002233113,0.000104540144,0.00024402527,0.000009160677],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011930107,0.00003931987,0.000034591234,0.0000074543145,0.0000344852,0.000003218914,0.0000684072,0.00081266393,0.84412885,0.038179733,0.00012510274,0.116554275],"study_design_scores_gemma":[0.0018267733,0.0010508548,0.00052477035,0.000021083768,0.000035801106,0.000026768763,0.000004503608,0.6256473,0.32899985,0.039376676,0.001652343,0.0008332411],"about_ca_topic_score_codex":0.0000538687,"about_ca_topic_score_gemma":0.0000012226416,"teacher_disagreement_score":0.62483466,"about_ca_system_score_codex":0.000091387425,"about_ca_system_score_gemma":0.000081970924,"threshold_uncertainty_score":0.64480406},"labels":[],"label_agreement":null},{"id":"W2008635090","doi":"10.1007/s00034-013-9586-3","title":"Decimal SRT Square Root: Algorithm and Architecture","year":2013,"lang":"en","type":"article","venue":"Circuits Systems and Signal Processing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decimal; Square root; Arithmetic; Computer science; Algorithm; Root (linguistics); Mathematics","score_opus":0.015508222900126567,"score_gpt":0.24455262930570038,"score_spread":0.2290444064055738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008635090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00787314,0.006973654,0.9838219,0.00019643486,0.0001506535,0.00025720824,0.0000017479102,0.00011323881,0.000612023],"genre_scores_gemma":[0.8845678,0.000010593848,0.11473364,0.00012904264,0.00032707996,0.00004905324,9.03068e-7,0.000019189238,0.00016268097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844795,0.00010693109,0.0002818893,0.0005173522,0.0002718374,0.00037401426],"domain_scores_gemma":[0.99922657,0.00010767765,0.00011655939,0.00017187753,0.00012230943,0.00025500136],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00031368286,0.00020752188,0.00030760915,0.00008973415,0.00032997137,0.0011333468,0.00027625475,0.000092525166,0.0000070625615],"category_scores_gemma":[0.000017908122,0.00015758359,0.000034001678,0.00028081646,0.00008398464,0.00060219725,0.00013312476,0.00020772051,0.000008404481],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.5114824e-7,0.000013059907,0.00026130097,0.0001375693,0.000006170215,0.000009794212,0.00040574322,0.000023181527,0.0010186763,0.0006023872,0.000025617932,0.99749625],"study_design_scores_gemma":[0.00093815627,0.00039060198,0.011025498,0.00092951325,0.000026290609,0.0011234496,0.0006208678,0.95246124,0.00056877284,0.02256239,0.008184117,0.0011691003],"about_ca_topic_score_codex":0.00009574629,"about_ca_topic_score_gemma":4.3653918e-7,"teacher_disagreement_score":0.99632716,"about_ca_system_score_codex":0.000014976286,"about_ca_system_score_gemma":0.00004629722,"threshold_uncertainty_score":0.99990356},"labels":[],"label_agreement":null},{"id":"W2008935098","doi":"10.1145/1557626.1557654","title":"Radius selection algorithms for sphere decoding","year":2009,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Hypersphere; Decoding methods; Rounding; Selection (genetic algorithm); Algorithm; RADIUS; Computer science; Computation; List decoding; Selection algorithm; Mathematics; Artificial intelligence; Concatenated error correction code","score_opus":0.03654321661490212,"score_gpt":0.3298576156190115,"score_spread":0.2933143990041094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008935098","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000222271,0.00006135829,0.994858,0.001342695,0.00031187586,0.00013256521,3.2829004e-7,0.0002324571,0.0028384337],"genre_scores_gemma":[0.0072238543,0.0000074482864,0.990912,0.00085217325,0.00019243755,0.000008128702,3.6353507e-7,0.0000038981284,0.0007996768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923533,0.000026275738,0.0001288994,0.00026474622,0.000104009116,0.00024076515],"domain_scores_gemma":[0.9995936,0.00009432306,0.00003481685,0.00014510441,0.000049821956,0.00008234241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021142047,0.000085475935,0.00011303578,0.000031259075,0.000118236305,0.000118080585,0.00029208214,0.0000371249,0.000021696562],"category_scores_gemma":[0.000040911633,0.000068957066,0.00006654713,0.00031680267,0.0000069156295,0.00027316716,0.00002268651,0.000058383954,0.0000125806655],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013126892,0.000022889257,0.000013780964,0.0000014860454,0.000002634226,7.407877e-7,0.00001789012,0.000017028495,0.0010224647,0.033386245,0.0007730846,0.96474046],"study_design_scores_gemma":[0.00035646872,0.00040400907,0.00068923325,0.000005774338,0.0000037657892,0.00002200914,0.000010056238,0.87264234,0.013864782,0.07825994,0.033527967,0.0002136839],"about_ca_topic_score_codex":0.000008266017,"about_ca_topic_score_gemma":6.112941e-7,"teacher_disagreement_score":0.9645268,"about_ca_system_score_codex":0.0000259437,"about_ca_system_score_gemma":0.000020411757,"threshold_uncertainty_score":0.28119877},"labels":[],"label_agreement":null},{"id":"W2010355238","doi":"10.1023/b:jogo.0000042114.11969.bb","title":"Improving Interval Analysis Bounds by Translations","year":2004,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematics; Univariate; Interval (graph theory); Interval arithmetic; Simple (philosophy); Polynomial; Translation (biology); Multivariate statistics; Global optimization; Applied mathematics; Variable (mathematics); Branch and bound; Mathematical optimization; Statistics; Combinatorics; Mathematical analysis","score_opus":0.007847256506081365,"score_gpt":0.2730848919841986,"score_spread":0.26523763547811724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010355238","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009319535,0.0001843753,0.99672127,0.001670074,0.0002578011,0.000028609411,0.0000044836574,0.000018319397,0.0001831315],"genre_scores_gemma":[0.14193773,0.000016762475,0.85785705,0.00012880868,0.000048905535,3.5346162e-7,0.0000014533008,0.0000023052362,0.000006628974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908644,0.000053596283,0.00037019738,0.00011237107,0.0002550074,0.00012238894],"domain_scores_gemma":[0.9992636,0.000021289745,0.00030834498,0.000117424475,0.0001895311,0.00009985118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027895294,0.000075711956,0.00018953044,0.0000776293,0.00007100588,0.00017829376,0.0003406524,0.000038876577,0.000009576534],"category_scores_gemma":[0.0000569797,0.00006282721,0.0001926211,0.0014196517,0.000019397117,0.00073523796,0.000027082318,0.00008515556,0.0000010273575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005865827,0.00008168219,0.00035589017,0.0000018945387,0.000123786,0.0000061388237,0.00005911117,0.93596524,0.00012207105,0.0032239314,0.000050017996,0.06000435],"study_design_scores_gemma":[0.0006549509,0.00023937889,0.0007789405,0.000013806466,0.00019936785,0.000045554487,0.000018839837,0.99262667,0.00016434661,0.004858814,0.00026730428,0.00013205335],"about_ca_topic_score_codex":0.000032669668,"about_ca_topic_score_gemma":0.000002540634,"teacher_disagreement_score":0.14100578,"about_ca_system_score_codex":0.00014801924,"about_ca_system_score_gemma":0.00008016139,"threshold_uncertainty_score":0.25620192},"labels":[],"label_agreement":null},{"id":"W2011113670","doi":"10.1109/pacrim.2011.6032996","title":"Design rules for implementing CORDIC on FPGAs","year":2011,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"CORDIC; Field-programmable gate array; Computer science; Scalability; Computation; Set (abstract data type); Digital signal processing; Wireless; Signal processing; Parallel computing; Computer architecture; Computer hardware; Embedded system; Computer engineering; Algorithm; Telecommunications","score_opus":0.18061203494185699,"score_gpt":0.3371731719745797,"score_spread":0.1565611370327227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011113670","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029784653,0.000008049237,0.9916539,0.00012392762,0.00017641502,0.00015283037,5.7821813e-7,0.000101201156,0.0074852537],"genre_scores_gemma":[0.00799512,0.0000013047269,0.9911436,0.00045028553,0.00004155892,0.00002559714,2.4416786e-7,0.000004890796,0.0003373937],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930465,0.00004676839,0.00011313903,0.00020306317,0.000081898455,0.00025050016],"domain_scores_gemma":[0.9994878,0.00019077004,0.00003720774,0.00020348077,0.000026584354,0.00005415103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000462477,0.000067045825,0.000084283776,0.00003128179,0.00009440055,0.000042970136,0.0003610765,0.000015366548,0.00007076133],"category_scores_gemma":[0.000029797851,0.000048348724,0.000041611416,0.0000832502,0.000010656359,0.00010777097,0.00008956133,0.000032106393,0.000045280205],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041998974,0.000034512297,0.000019437022,0.0000024940803,0.00000606366,0.0000015359748,0.00015605209,0.0000012363905,0.00026844934,0.17312832,0.0006228775,0.8257548],"study_design_scores_gemma":[0.0009397271,0.001846058,0.0014368618,0.000023093064,0.000012663534,0.000008245077,0.00013260133,0.26841348,0.1182932,0.58388513,0.024439553,0.0005694084],"about_ca_topic_score_codex":0.00002653527,"about_ca_topic_score_gemma":2.6912764e-7,"teacher_disagreement_score":0.8251854,"about_ca_system_score_codex":0.000006456631,"about_ca_system_score_gemma":0.000011449285,"threshold_uncertainty_score":0.19716038},"labels":[],"label_agreement":null},{"id":"W2012516939","doi":"10.1145/1028664.1028742","title":"Advancements in multicode optimization","year":2004,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Java; Work (physics); Operating system; Engineering","score_opus":0.01393749326547812,"score_gpt":0.2884942719769256,"score_spread":0.2745567787114475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012516939","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032734443,0.000012233556,0.9972773,0.0005470123,0.000110127985,0.00004611285,6.909141e-8,0.000044269775,0.0016355038],"genre_scores_gemma":[0.019074772,0.000008650964,0.9804949,0.00033572337,0.000008423873,0.00000426903,2.088697e-7,0.000001696493,0.00007136214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996043,0.000013544497,0.000080879916,0.00012736078,0.00007282764,0.00010107597],"domain_scores_gemma":[0.99981475,0.000013247519,0.000013713038,0.00011864535,0.000010801038,0.000028823983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006972393,0.000035881505,0.00004682733,0.00003235011,0.0000151064205,0.000023623652,0.0001727228,0.000011379001,0.000013000393],"category_scores_gemma":[0.000019462606,0.000029172648,0.000009860726,0.00023080618,0.0000059333215,0.00024163557,0.000053090618,0.000029322739,0.000015825975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.4861633e-7,0.00010958078,0.00019958941,0.0000017132453,0.0000012024112,0.000007650111,0.00009523041,0.6094544,0.00022695576,0.05661545,0.0000031668685,0.33328414],"study_design_scores_gemma":[0.0007037663,0.000039470455,0.00072808884,0.000008958764,3.363131e-7,0.0000013298313,0.000008512776,0.975073,0.0023279605,0.020567497,0.0004441122,0.00009696832],"about_ca_topic_score_codex":0.00003335804,"about_ca_topic_score_gemma":0.0000018108251,"teacher_disagreement_score":0.36561862,"about_ca_system_score_codex":0.000025617062,"about_ca_system_score_gemma":0.000009594999,"threshold_uncertainty_score":0.11896261},"labels":[],"label_agreement":null},{"id":"W2014487386","doi":"10.5555/1756384.1756396","title":"Feedback-free circuits in the algebra of transients","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Binary number; SIGNAL (programming language); Computer science; Automaton; Electronic circuit; State (computer science); Algorithm; Logic gate; Finite-state machine; Theoretical computer science; Mathematics; Arithmetic; Engineering; Electrical engineering; Programming language","score_opus":0.03612889004025523,"score_gpt":0.2530820898465178,"score_spread":0.2169531998062626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014487386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010642188,0.00013251821,0.9520267,0.0037208667,0.00016701703,0.00011249997,9.419602e-7,0.000033529413,0.03316369],"genre_scores_gemma":[0.78660077,0.000019335776,0.2118318,0.0011775166,0.000027773747,0.000006272747,8.554226e-8,0.0000036979957,0.00033274907],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992224,0.00010147325,0.0001523752,0.00015185472,0.00021941452,0.00015251352],"domain_scores_gemma":[0.9993045,0.00013603605,0.00002631195,0.00048702472,0.000016738342,0.000029438603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027561074,0.000057514615,0.00010055123,0.00003929217,0.000021651873,0.000027536895,0.0012350141,0.000021750922,0.00008947797],"category_scores_gemma":[0.00004004405,0.00003385546,0.000042887317,0.0005216465,0.000030674768,0.00013647403,0.000058509708,0.00007484815,0.000022982334],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.7152564e-7,0.00017100557,0.00025786026,0.000005571048,0.0000035060862,0.00000866261,0.0015427441,0.000004489904,0.00037501706,0.059404876,0.0011957083,0.9370303],"study_design_scores_gemma":[0.0055680554,0.0011408296,0.17646988,0.00011947853,0.000021796192,0.00011213855,0.00072836806,0.3382304,0.01565296,0.431489,0.029178426,0.0012886912],"about_ca_topic_score_codex":0.000029555697,"about_ca_topic_score_gemma":0.0000026279424,"teacher_disagreement_score":0.9357416,"about_ca_system_score_codex":0.000004370562,"about_ca_system_score_gemma":0.0000032636046,"threshold_uncertainty_score":0.22949839},"labels":[],"label_agreement":null},{"id":"W2017750614","doi":"10.1145/990353.990359","title":"Approximate computation of pseudovarieties","year":2003,"lang":"en","type":"article","venue":"ACM SIGSAM Bulletin","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Citation; Library science; Media studies; Sociology; Computer science","score_opus":0.024985936368930442,"score_gpt":0.2747962690646332,"score_spread":0.2498103326957028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017750614","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018541077,0.00014991828,0.99281263,0.0017249389,0.00025619668,0.00008590755,0.0000010363044,0.0000818232,0.003033464],"genre_scores_gemma":[0.14797565,0.000008594605,0.8515779,0.00025356415,0.000018897455,0.000007409039,6.8917103e-7,0.000006663257,0.0001506273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989556,0.00017679002,0.0002250396,0.00024507352,0.00020750689,0.00018997552],"domain_scores_gemma":[0.99900645,0.00030070363,0.00010859748,0.00044773106,0.00007920355,0.000057297166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004702945,0.00010006637,0.00017539591,0.00004707018,0.000057596975,0.00004630448,0.0005527137,0.000042167587,0.00007864358],"category_scores_gemma":[0.00067220675,0.000087196866,0.000056936948,0.00026165188,0.000055673583,0.00005433802,0.00015344909,0.00008192017,0.00006511386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012920978,0.000365989,0.0005470815,0.00011819455,0.00005021524,0.000020412916,0.0009565201,0.00055645575,0.0063943174,0.5213825,0.012152509,0.4574429],"study_design_scores_gemma":[0.0019211118,0.0007755973,0.002594701,0.00012246889,0.00002952167,0.0000908244,0.00029960452,0.031395063,0.091845125,0.5493927,0.32035935,0.0011739468],"about_ca_topic_score_codex":0.000017073662,"about_ca_topic_score_gemma":6.5631376e-8,"teacher_disagreement_score":0.45626894,"about_ca_system_score_codex":0.000009056685,"about_ca_system_score_gemma":0.000021662665,"threshold_uncertainty_score":0.3555785},"labels":[],"label_agreement":null},{"id":"W2018509468","doi":"10.3166/jesa.37.1059-1074","title":"Méthodes ensemblistes pour l'étalonnage géométrique","year":2003,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Interval (graph theory); Mathematics; Measure (data warehouse); Dimension (graph theory); Calibration; Pessimism; Set (abstract data type); Algorithm; Computer science; Statistics; Philosophy; Combinatorics; Data mining; Epistemology","score_opus":0.055147246743053054,"score_gpt":0.312045663456103,"score_spread":0.25689841671304997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018509468","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061005545,0.035585962,0.92942035,0.0039481763,0.0067374236,0.00030461128,0.0000188014,0.00033289727,0.017551228],"genre_scores_gemma":[0.025495442,0.0022157314,0.9274814,0.0007895276,0.001163509,0.000012008641,9.01185e-7,0.00012473353,0.042716756],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98850566,0.006462634,0.0015779829,0.00083623757,0.0010421149,0.0015753685],"domain_scores_gemma":[0.9947595,0.0015298893,0.0010449855,0.00089017453,0.0007145077,0.0010609254],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0047814823,0.00077808986,0.0010669909,0.00042350593,0.0010526403,0.002968697,0.0015335269,0.00031968538,0.00078364083],"category_scores_gemma":[0.0035314413,0.0006888811,0.0006537614,0.0016870791,0.0005136606,0.0021704836,0.00033052082,0.0013475424,0.0010023892],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061312867,0.00031643343,0.00044296155,0.0002771213,0.00014777997,0.0021067886,0.0008741366,0.00017742274,0.0015932878,0.21400137,0.006425834,0.77363074],"study_design_scores_gemma":[0.0019452461,0.0011030708,0.05354785,0.0027397005,0.000225168,0.045638155,0.00037292953,0.1385666,0.004571377,0.55049336,0.19875485,0.0020416928],"about_ca_topic_score_codex":0.00008793556,"about_ca_topic_score_gemma":0.000006450114,"teacher_disagreement_score":0.77158904,"about_ca_system_score_codex":0.00046235192,"about_ca_system_score_gemma":0.0007246017,"threshold_uncertainty_score":0.99977547},"labels":[],"label_agreement":null},{"id":"W2021921500","doi":"10.1016/j.procs.2014.05.129","title":"Exploring Rounding Errors in Matlab Using Extended Precision","year":2014,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Rounding; Computer science; MATLAB; Floating point; Double-precision floating-point format; Decimal; Algorithm; Single-precision floating-point format; Computational science; Class (philosophy); Computation; Point (geometry); Arithmetic; Programming language; Artificial intelligence; Mathematics","score_opus":0.1226172758066115,"score_gpt":0.32507375397142,"score_spread":0.20245647816480852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021921500","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18152733,0.000020347166,0.81627107,0.00014605133,0.0016313066,0.00012794115,9.305977e-8,0.00014476024,0.0001310806],"genre_scores_gemma":[0.37557974,0.00000510349,0.6241117,0.000120111734,0.00016127073,0.000011883035,5.721535e-8,0.0000065840636,0.00000353662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971118,0.00010474566,0.00036167228,0.00096791674,0.00074530963,0.0007085518],"domain_scores_gemma":[0.9987057,0.00022656974,0.0001230827,0.0005804825,0.0001278568,0.00023634435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024812426,0.00019822233,0.00025511603,0.0004882846,0.000295971,0.00059261365,0.002101246,0.000032242835,0.0000016482198],"category_scores_gemma":[0.0002591694,0.00017307744,0.000048062215,0.0029225578,0.00017065524,0.0035181576,0.0010991154,0.00021130647,0.000017636277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023815264,0.00006125447,0.00082654395,0.00001553014,0.0000012116386,0.000008428255,0.0010209436,0.002238076,0.0052932,0.02256366,0.0000031116008,0.96796566],"study_design_scores_gemma":[0.0001870632,0.00008509146,0.008769526,0.00009396439,0.0000011221772,0.00003137662,0.000010995728,0.97572374,0.0043289717,0.010270555,0.00024141128,0.00025619924],"about_ca_topic_score_codex":0.000029421057,"about_ca_topic_score_gemma":0.0000011656508,"teacher_disagreement_score":0.97348565,"about_ca_system_score_codex":0.00014816932,"about_ca_system_score_gemma":0.00013864547,"threshold_uncertainty_score":0.7057893},"labels":[],"label_agreement":null},{"id":"W2022319690","doi":"10.1007/s10474-013-0357-1","title":"The Gauss–Wilson theorem for quarter-intervals","year":2013,"lang":"en","type":"article","venue":"Acta Mathematica Academiae Scientiarum Hungaricae","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Gauss; Multiplicative function; Product (mathematics); Quadratic Gauss sum; Prime power; Gauss sum; Discrete mathematics; Order (exchange); Prime (order theory); Factorial; Integer (computer science); Mathematical analysis; Geometry","score_opus":0.019275807364991765,"score_gpt":0.29055859146033813,"score_spread":0.27128278409534634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022319690","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017799861,0.00018400222,0.9448172,0.046391774,0.0011272623,0.0013081336,0.0000066148523,0.0003122683,0.004072761],"genre_scores_gemma":[0.1766932,0.00006519564,0.81451654,0.0019081555,0.00033257785,0.0009018668,0.0000031808686,0.000058801208,0.005520493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962609,0.00028098136,0.0007672629,0.00081774005,0.0007423853,0.0011307558],"domain_scores_gemma":[0.99513024,0.0025400468,0.0003813933,0.0013695868,0.00022411038,0.0003545985],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0031827234,0.00034676123,0.0004407477,0.00011901594,0.0010196767,0.0013694831,0.0038966155,0.00020946375,0.00009621281],"category_scores_gemma":[0.0011467973,0.0002039776,0.00033038878,0.000821107,0.00036329255,0.0011670429,0.00068431365,0.0005329403,0.00048049778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000654881,0.00019000053,0.000018824434,0.0000857846,0.00008940701,0.0000013728711,0.0012663812,0.0000012662389,0.012194377,0.62876064,0.1520899,0.20529553],"study_design_scores_gemma":[0.00040716195,0.0002025633,0.0003502403,0.00008174362,0.000033487755,0.000027409638,0.00027828984,0.16179375,0.006639869,0.7382256,0.091451146,0.00050876196],"about_ca_topic_score_codex":0.000006524942,"about_ca_topic_score_gemma":5.5950017e-7,"teacher_disagreement_score":0.20478676,"about_ca_system_score_codex":0.00005543668,"about_ca_system_score_gemma":0.00006205383,"threshold_uncertainty_score":0.99966717},"labels":[],"label_agreement":null},{"id":"W2022327507","doi":"10.1016/j.camwa.2007.11.036","title":"Maple code of gamma algorithm for global optimization of uncertain functions over compact robust sets","year":2008,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Ministerio de Ciencia y Tecnología; Comunidad de Madrid","keywords":"Mathematics; Maple; Code (set theory); Algorithm; Computer science; Set (abstract data type); Programming language","score_opus":0.039818188363054376,"score_gpt":0.29763876580609644,"score_spread":0.25782057744304204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022327507","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000177775,0.000041795724,0.9981573,0.00017349185,0.00007046462,0.00084929954,0.0001407746,0.00009789843,0.00029120324],"genre_scores_gemma":[0.002667311,0.000013287551,0.9970036,0.000044315715,0.000036544774,0.00013483311,0.000035396282,0.0000149205935,0.00004975758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865365,0.000034242894,0.00047764718,0.00032452008,0.00028435173,0.00022556543],"domain_scores_gemma":[0.99812084,0.000357497,0.00041475182,0.0006691925,0.00031980616,0.00011790945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001717361,0.00018193253,0.00038578364,0.00007595037,0.00017616907,0.00002830509,0.000611382,0.00005587549,0.0000055885644],"category_scores_gemma":[0.0000151166705,0.00015416025,0.00011049713,0.000830614,0.0001702193,0.00015600036,0.00008830259,0.00006541486,0.0000024655244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015979045,0.0020965626,0.00043797318,0.00041503977,0.00027960306,0.000003510215,0.0009299172,0.6178893,0.00011039134,0.12313059,0.003618778,0.25107235],"study_design_scores_gemma":[0.000505951,0.00015193612,0.0002651745,0.000046664863,0.000030890893,0.0000424524,0.000032764194,0.99048084,0.0001505905,0.007258582,0.0008668399,0.00016730462],"about_ca_topic_score_codex":0.000014122936,"about_ca_topic_score_gemma":0.0000011529696,"teacher_disagreement_score":0.37259153,"about_ca_system_score_codex":0.000054342585,"about_ca_system_score_gemma":0.00010943032,"threshold_uncertainty_score":0.62864727},"labels":[],"label_agreement":null},{"id":"W2022424129","doi":"10.1007/s10846-007-9172-7","title":"AI Optimization of a Billiard Player","year":2007,"lang":"en","type":"article","venue":"Journal of Intelligent & Robotic Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Dynamical billiards; Table (database); Computer science; Ball (mathematics); Context (archaeology); Artificial intelligence; Mathematics; Data mining; Geometry","score_opus":0.02885852018583881,"score_gpt":0.30823471746558967,"score_spread":0.2793761972797509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022424129","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031686193,0.00094115065,0.9949585,0.0003023593,0.0031460552,0.00011127278,2.6429214e-7,0.00001360814,0.00020991452],"genre_scores_gemma":[0.23173596,0.0001142939,0.76733637,0.00016288862,0.0004772591,8.982692e-7,1.8362728e-7,0.00001352876,0.00015859306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977716,0.00013849071,0.0011588838,0.00014064764,0.0005589428,0.00023139612],"domain_scores_gemma":[0.99783516,0.00032482142,0.0008437699,0.000258571,0.0005689814,0.00016869619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00221607,0.00012482512,0.00043403156,0.00026978285,0.00003494394,0.00008106266,0.0006264681,0.000069512294,0.000012284156],"category_scores_gemma":[0.00017556138,0.000086563494,0.00018168041,0.00051871955,0.00003188348,0.0002855219,0.00006462482,0.00018755528,0.000008127497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019759907,0.00014641849,0.00043774888,0.000052620493,0.000079869285,0.000058576265,0.00032686398,0.9597845,0.0005752767,0.006561314,0.00035878783,0.03159823],"study_design_scores_gemma":[0.00032750933,0.000803044,0.00032298284,0.0005424125,0.00003874511,0.0006988257,0.00035102677,0.9831997,0.010049802,0.00085055985,0.0025714166,0.00024397096],"about_ca_topic_score_codex":0.000026564143,"about_ca_topic_score_gemma":3.13161e-7,"teacher_disagreement_score":0.2314191,"about_ca_system_score_codex":0.00007837562,"about_ca_system_score_gemma":0.000068621,"threshold_uncertainty_score":0.3529957},"labels":[],"label_agreement":null},{"id":"W2024141463","doi":"10.1109/icsamos.2010.5642051","title":"CORDIC-based LMMSE equalizer for Software Defined Radio","year":2010,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Software-defined radio; Minimum mean square error; CORDIC; Adaptive equalizer; Equalization (audio); Real-time computing; Computer hardware; Algorithm; Decoding methods; Telecommunications; Mathematics","score_opus":0.025463356633466657,"score_gpt":0.3058052317798974,"score_spread":0.2803418751464307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024141463","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066087954,0.000013917436,0.99561274,0.0016093128,0.0010467678,0.00017977112,0.00000415312,0.00031805076,0.00055438094],"genre_scores_gemma":[0.0073989313,3.984727e-7,0.99005735,0.0014780286,0.00012005002,0.00004477957,0.0000019663782,0.000010890894,0.00088758994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903214,0.00003844392,0.00016549847,0.0003200735,0.00015848443,0.00028533174],"domain_scores_gemma":[0.99855363,0.0006725547,0.00004901109,0.0004916691,0.000083036255,0.00015009008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038449359,0.00011561467,0.00016529513,0.00004681152,0.000103507155,0.00011116454,0.00060600595,0.00006345412,0.00010992084],"category_scores_gemma":[0.0004057648,0.00008593132,0.00011064557,0.00022298947,0.000040709987,0.00014442328,0.000077363016,0.00012533809,0.000042493968],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000107631695,0.000093168645,0.00030691543,0.000015552183,0.000008861847,0.0000047933154,0.000030277206,0.000013896812,0.004884627,0.15964323,0.004272639,0.83071524],"study_design_scores_gemma":[0.002725788,0.0005823632,0.0013990669,0.000014497445,0.000017787217,0.00001613609,0.000009106739,0.48583078,0.03373612,0.13801222,0.33679074,0.0008653858],"about_ca_topic_score_codex":0.000032494245,"about_ca_topic_score_gemma":0.000004809654,"teacher_disagreement_score":0.8298499,"about_ca_system_score_codex":0.0000071860522,"about_ca_system_score_gemma":0.000065323635,"threshold_uncertainty_score":0.35041776},"labels":[],"label_agreement":null},{"id":"W2025002994","doi":"10.2478/bf02475663","title":"Error autocorrection in rational approximation and interval estimates. [A survey of results.]","year":2003,"lang":"en","type":"article","venue":"Open Mathematics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Fields Institute for Research in Mathematical Sciences","keywords":"Mathematics; Interval (graph theory); Padé approximant; Rational function; Approximation error; Function (biology); Applied mathematics; Approximation theory; Discretization error; Nonlinear system; Error function; Mathematical analysis; Discretization; Algorithm; Combinatorics","score_opus":0.09373096529857693,"score_gpt":0.36493501453191735,"score_spread":0.2712040492333404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025002994","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067297444,0.000009793551,0.98952717,0.00007052976,0.000110318346,0.00031755003,0.0000056032986,0.000012259181,0.0032170226],"genre_scores_gemma":[0.041537546,0.0000020286336,0.95831203,0.000015447622,0.0000028486074,0.00001888886,0.0000050301246,0.0000042681418,0.000101922094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990927,0.00017053391,0.0003554009,0.00016741478,0.00012441512,0.00008951363],"domain_scores_gemma":[0.99910593,0.0004436503,0.00016401376,0.00019647075,0.00005978804,0.000030132516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021646945,0.00007033072,0.0001855617,0.000049527884,0.000031050655,0.00011779921,0.00028745006,0.00003376394,0.000007989931],"category_scores_gemma":[0.0011133283,0.000059168364,0.000011318881,0.00027620106,0.00002649753,0.00034350512,0.0001276132,0.00006762739,0.000003822553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006849555,0.0018360022,0.0051276707,0.0003950656,0.0000505396,0.000008505869,0.0080403695,0.0011319427,0.0018815254,0.65144444,0.00085969694,0.32915577],"study_design_scores_gemma":[0.0005639272,0.000087978064,0.015689673,0.000075952616,0.0000027607152,0.00001513057,0.000072758456,0.90899265,0.0021381418,0.07211955,0.00011486096,0.00012659916],"about_ca_topic_score_codex":0.00012995469,"about_ca_topic_score_gemma":0.000027077533,"teacher_disagreement_score":0.90786076,"about_ca_system_score_codex":0.00001662885,"about_ca_system_score_gemma":0.000038005262,"threshold_uncertainty_score":0.24128158},"labels":[],"label_agreement":null},{"id":"W2025617638","doi":"10.1109/newcas.2012.6328944","title":"An improved BCD adder using 6-LUT FPGAs","year":2012,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Adder; Decimal; Computer science; Lookup table; Field-programmable gate array; Arithmetic; Carry-save adder; Parallel computing; Serial binary adder; Operand; Reduction (mathematics); Computer hardware; Critical path method; Virtex; Mathematics; Engineering; Telecommunications","score_opus":0.045471257534698134,"score_gpt":0.34663499322674163,"score_spread":0.30116373569204347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025617638","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076590995,0.000054890137,0.9900056,0.00017228554,0.00056593807,0.000052139523,3.2662638e-7,0.00013845715,0.0013512237],"genre_scores_gemma":[0.18933249,9.970629e-7,0.8094941,0.00073099165,0.0002498569,0.0000018407757,1.6888389e-7,0.000005726771,0.00018388114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991566,0.0000748646,0.000111085385,0.00019361172,0.00011254563,0.00035127354],"domain_scores_gemma":[0.99927,0.000048524133,0.000032503347,0.00039991376,0.000028950082,0.00022010149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031845228,0.00008598513,0.00010126508,0.000031975906,0.0000767343,0.00009270407,0.00040832756,0.00003519486,0.000094536634],"category_scores_gemma":[0.000021207143,0.00006315295,0.000037974783,0.00021154722,0.000019801222,0.0008929601,0.00012143734,0.000072015566,0.00004002483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016012891,0.00021162994,0.0007564408,0.0000050011254,0.000011462821,0.0000020257755,0.0003436892,0.000030364201,0.06731521,0.0332653,0.00013655346,0.8979207],"study_design_scores_gemma":[0.00014896369,0.00008226273,0.0022426534,0.00000315641,0.0000045772763,0.000011811916,0.00003104392,0.9749295,0.013715815,0.0026903374,0.005896914,0.00024297393],"about_ca_topic_score_codex":0.000102911734,"about_ca_topic_score_gemma":4.4162442e-7,"teacher_disagreement_score":0.9748991,"about_ca_system_score_codex":0.000016999877,"about_ca_system_score_gemma":0.0000203375,"threshold_uncertainty_score":0.25753024},"labels":[],"label_agreement":null},{"id":"W2029685795","doi":"10.1145/1073884.1073898","title":"Hybrid symbolic-numeric integration in multiple dimensions via tensor-product series","year":2005,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bilinear interpolation; Series (stratigraphy); Mathematics; Dimension (graph theory); Algorithm; Interpolation (computer graphics); Tensor product; Numerical integration; Symbolic computation; Tensor (intrinsic definition); Applied mathematics; Algebra over a field; Computer science; Pure mathematics; Mathematical analysis; Artificial intelligence","score_opus":0.021338331628177745,"score_gpt":0.2668219674510854,"score_spread":0.24548363582290764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029685795","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05764328,0.000117101365,0.9362859,0.004510267,0.0003209297,0.00016341393,0.0000010624008,0.00021375105,0.00074428983],"genre_scores_gemma":[0.47403985,0.000014401155,0.52489316,0.00040837078,0.000091407,0.000012533351,0.0000012079215,0.000005862177,0.000533216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987132,0.00011416493,0.00027104924,0.0004313214,0.00017721893,0.00029306344],"domain_scores_gemma":[0.99922836,0.0001078818,0.000051709398,0.00046242552,0.000055696848,0.0000939332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025364885,0.00014772564,0.00020911297,0.00011588667,0.00012290358,0.000114294504,0.00037753538,0.00002254092,0.000034281726],"category_scores_gemma":[0.00013920192,0.00011111754,0.000052593514,0.00048311916,0.000058331207,0.0007654175,0.0001572895,0.00015732454,0.00013660715],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041125904,0.00009297254,0.0008165782,0.0000019722727,0.0000034665136,0.000008668835,0.00021253542,0.0002233434,0.01311229,0.0071217543,0.000258019,0.9781443],"study_design_scores_gemma":[0.00054968096,0.00018226281,0.023744108,0.000032974644,0.0000057623106,0.00014333791,0.000079087746,0.79312164,0.14266309,0.019357257,0.019487627,0.0006331496],"about_ca_topic_score_codex":0.00021986845,"about_ca_topic_score_gemma":0.000045618366,"teacher_disagreement_score":0.97751117,"about_ca_system_score_codex":0.000040756207,"about_ca_system_score_gemma":0.000024937794,"threshold_uncertainty_score":0.45312417},"labels":[],"label_agreement":null},{"id":"W2031541154","doi":"10.3166/jesa.37.1129-1143","title":"Caractérisation garantie d'un dispositif de mesure de grandeurs thermiques","year":2003,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Physics","score_opus":0.02850556897188387,"score_gpt":0.2908557731197455,"score_spread":0.2623502041478616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031541154","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109053664,0.020875461,0.86163366,0.0018544272,0.0025270989,0.00022536298,0.000011871664,0.00021707587,0.0036013809],"genre_scores_gemma":[0.4025137,0.003157326,0.5900708,0.00063319475,0.00068648154,0.000009933971,0.0000010021696,0.000086672066,0.0028409134],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9906054,0.0059756944,0.000965461,0.00049913407,0.0006959162,0.0012583706],"domain_scores_gemma":[0.9970607,0.0006144436,0.0007216799,0.0005130002,0.00037360014,0.0007165504],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00468902,0.000508612,0.0006744627,0.00019725895,0.0008631121,0.0015515245,0.00088459504,0.00025899778,0.0002281152],"category_scores_gemma":[0.0009608894,0.00044680797,0.00044369025,0.0007874773,0.0003082129,0.001339765,0.00010701074,0.00096754084,0.000089941226],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012768154,0.00022002852,0.0059096306,0.00017110852,0.00017314358,0.0011239471,0.003647396,0.0003286318,0.0017964541,0.0217602,0.0011979005,0.9636588],"study_design_scores_gemma":[0.0010518306,0.0005789349,0.6582987,0.0012678696,0.0002405828,0.019428927,0.00020757502,0.12806766,0.0048862337,0.16643246,0.018662209,0.0008770352],"about_ca_topic_score_codex":0.00017573724,"about_ca_topic_score_gemma":0.000006165039,"teacher_disagreement_score":0.9627817,"about_ca_system_score_codex":0.0005653853,"about_ca_system_score_gemma":0.0006111172,"threshold_uncertainty_score":0.99979836},"labels":[],"label_agreement":null},{"id":"W2032195315","doi":"10.1145/1839480.1839486","title":"VFloat","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Division of Engineering Education and Centers","keywords":"Computer science; Floating point; Double-precision floating-point format; Variable (mathematics); Computer hardware; Point (geometry); Implementation; Range (aeronautics); Programming language","score_opus":0.016594330515281367,"score_gpt":0.2598416499404852,"score_spread":0.24324731942520383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032195315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012730156,0.00020911254,0.9769965,0.004318716,0.002065691,0.00018567765,0.0000039271954,0.00061980495,0.002870427],"genre_scores_gemma":[0.88681024,0.000064926164,0.11114371,0.00012136515,0.000035389497,0.00009721992,2.8463194e-7,0.0000104612445,0.0017163808],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902725,0.000044972294,0.00020352066,0.0003753753,0.00009259353,0.00025629043],"domain_scores_gemma":[0.9987208,0.00017090194,0.00005540531,0.00092249434,0.00004724673,0.00008314749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002919123,0.00013318117,0.00021414898,0.0003584174,0.00027750392,0.00009536556,0.0007349128,0.0002694483,0.000041934592],"category_scores_gemma":[0.000048250655,0.00011099684,0.00004142434,0.00064584427,0.00012395631,0.00018588708,0.000007112991,0.0006128765,0.00007694745],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027740148,0.000060165643,0.000068000205,0.0000132969335,0.000025747942,0.000009878489,0.00003286113,0.000018080378,0.01273841,0.105885416,0.000049532762,0.8810958],"study_design_scores_gemma":[0.0024344265,0.0015919672,0.0008775898,0.00021032024,0.000070937356,0.0028816422,0.00085509254,0.075504124,0.2121052,0.394401,0.30701238,0.002055284],"about_ca_topic_score_codex":0.00003146189,"about_ca_topic_score_gemma":0.00000574864,"teacher_disagreement_score":0.87904054,"about_ca_system_score_codex":0.000007693367,"about_ca_system_score_gemma":0.000021001213,"threshold_uncertainty_score":0.45263198},"labels":[],"label_agreement":null},{"id":"W2035899976","doi":"10.1145/1824801.1824806","title":"Unified Tables for Exponential and Logarithm Families","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Logarithm; SIMD; Computer science; Table (database); Exponential function; Parallel computing; Implementation; IBM; Arithmetic; Code (set theory); Algorithm; Mathematics; Programming language","score_opus":0.0228653889092917,"score_gpt":0.283043403121976,"score_spread":0.2601780142126843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035899976","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024083015,0.00001051181,0.99581075,0.00097490055,0.000304377,0.00022985971,0.000027953112,0.00020852698,0.000024800289],"genre_scores_gemma":[0.006380799,0.000009314732,0.9931008,0.00015166604,0.000040952214,0.00008918159,0.0000017758362,0.000013152552,0.00021230846],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990359,0.000029492758,0.00019862546,0.00031781037,0.00017084912,0.0002473481],"domain_scores_gemma":[0.99799335,0.0012235884,0.000035365083,0.0005503125,0.000054935863,0.00014247235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022007369,0.00014545469,0.00020897898,0.00006844023,0.000250872,0.00012946791,0.0004900673,0.000100192374,0.000111470465],"category_scores_gemma":[0.0003673411,0.00011491659,0.00008928344,0.00017143016,0.0001091872,0.00021008578,0.00002312387,0.00024038526,0.00002211516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007654014,0.00017605923,0.000003896909,0.000055550663,0.000017873443,0.000001807994,0.00015043806,0.0000095161295,0.0009216097,0.017629012,0.000011872489,0.9810147],"study_design_scores_gemma":[0.00044654173,0.00016326841,0.0000769178,0.000023970011,0.000023343093,0.000025842259,0.00005263569,0.006575899,0.004920575,0.98363286,0.0038304338,0.00022769137],"about_ca_topic_score_codex":0.0000074892887,"about_ca_topic_score_gemma":0.0000043757145,"teacher_disagreement_score":0.98078704,"about_ca_system_score_codex":0.000006647992,"about_ca_system_score_gemma":0.00001953396,"threshold_uncertainty_score":0.46861625},"labels":[],"label_agreement":null},{"id":"W2036246933","doi":"10.5555/1894483.1894505","title":"Reducing expression size using rule-based integration","year":2010,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Scope (computer science); Computer science; Expression (computer science); Process (computing); Transformation (genetics); Programming language","score_opus":0.027340931217327835,"score_gpt":0.31231600818373284,"score_spread":0.284975076966405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036246933","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066581085,0.0000031032673,0.9311114,0.00036375702,0.0007137051,0.00004551193,1.5549837e-7,0.00011893942,0.0010623523],"genre_scores_gemma":[0.23128338,1.4401604e-7,0.7683502,0.00019396705,0.000084893836,0.0000019158801,1.6220231e-7,0.0000034693742,0.00008190845],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993289,0.000051711264,0.00012111292,0.00022410364,0.00013737023,0.000136775],"domain_scores_gemma":[0.99933773,0.00019159155,0.000045776873,0.0003100881,0.000044093336,0.000070719616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027072523,0.00007182542,0.000078824654,0.000031656265,0.00009727558,0.00012425208,0.00028899536,0.000044073142,0.00007986267],"category_scores_gemma":[0.00020276985,0.000050205537,0.00003652976,0.00019851458,0.000019582632,0.00028558442,0.00006912592,0.00016444105,0.000009732914],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.5115923e-7,0.000015490246,0.000017750272,9.949184e-7,3.4377152e-7,9.668722e-7,0.000026369627,0.000037605274,0.7536393,0.0021473244,0.000022823484,0.2440903],"study_design_scores_gemma":[0.000078981095,0.000013215153,0.00019496008,0.000013369727,7.6309914e-7,0.0000022650215,0.0000055305354,0.49593914,0.49993291,0.0034971824,0.00024911793,0.0000725513],"about_ca_topic_score_codex":0.00006257472,"about_ca_topic_score_gemma":8.184912e-7,"teacher_disagreement_score":0.49590153,"about_ca_system_score_codex":0.000009855382,"about_ca_system_score_gemma":0.00003570582,"threshold_uncertainty_score":0.20473224},"labels":[],"label_agreement":null},{"id":"W2036317424","doi":"10.1002/pamm.200700154","title":"Analysis of the blunting anti‐wrapping strategy","year":2007,"lang":"en","type":"article","venue":"PAMM","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Toronto","funders":"","keywords":"Ode; Interval (graph theory); Interval arithmetic; Computer science; Dependency (UML); Convergence (economics); Algorithm; Applied mathematics; Mathematical optimization; Mathematics; Artificial intelligence; Mathematical analysis; Combinatorics","score_opus":0.025083209900294442,"score_gpt":0.3058342940222182,"score_spread":0.28075108412192373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036317424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123271525,0.000045184854,0.8739756,0.00014373404,0.00012209028,0.000024792496,3.6749515e-7,0.000020903906,0.0023958422],"genre_scores_gemma":[0.9083239,0.0000020187479,0.09147193,0.000119946926,0.000030937288,3.4931722e-7,1.07622036e-7,0.0000018734737,0.000048965696],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993435,0.00004670775,0.00016717699,0.0001203328,0.00015837663,0.00016391385],"domain_scores_gemma":[0.99938923,0.00014853086,0.00009335147,0.00030213082,0.000035605,0.000031132906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070089236,0.00004850206,0.00013470813,0.00008588675,0.000062555126,0.000031978805,0.00046498154,0.000019314635,0.0000072797006],"category_scores_gemma":[0.00004871173,0.00003059767,0.00011874436,0.0018580578,0.000027784898,0.00007386271,0.00012504356,0.00006585814,0.0000020385025],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.358251e-7,0.000024604387,0.016932439,0.00000446914,0.00013160298,0.000002601815,0.000246725,0.00064342265,0.00782763,0.012586494,0.000009876543,0.9615897],"study_design_scores_gemma":[0.000102369486,0.000024751866,0.7463627,0.00001240078,0.00011904823,0.000001872054,0.00013444763,0.22452122,0.023859248,0.003230664,0.001469074,0.00016219655],"about_ca_topic_score_codex":0.000051099814,"about_ca_topic_score_gemma":0.0000039365796,"teacher_disagreement_score":0.9614275,"about_ca_system_score_codex":0.0000060096736,"about_ca_system_score_gemma":0.000011162849,"threshold_uncertainty_score":0.12477367},"labels":[],"label_agreement":null},{"id":"W2038133488","doi":"10.1016/j.jsc.2007.11.005","title":"Approximate factorization of multivariate polynomials using singular value decomposition","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Mathematics; Singular value decomposition; Factorization; Multivariate statistics; Generalization; Applied mathematics; Set (abstract data type); Decomposition; Algorithm; Mathematical analysis; Statistics; Computer science","score_opus":0.02778806671875694,"score_gpt":0.35593004644580806,"score_spread":0.3281419797270511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038133488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20104094,0.000053195858,0.79811573,0.000048060494,0.00062083337,0.00007309741,5.7088727e-7,0.000014792975,0.000032772703],"genre_scores_gemma":[0.51935315,0.000002382887,0.48049858,0.000018882347,0.0001206351,7.535394e-8,7.229624e-7,0.000004759914,8.130036e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983611,0.00015972421,0.0008049896,0.00013282488,0.0003712908,0.0001700627],"domain_scores_gemma":[0.9981298,0.00023476638,0.0010590053,0.00010235562,0.00038028162,0.00009381756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014043172,0.00010817372,0.0003083966,0.0003184286,0.0000736314,0.000064737076,0.00023386511,0.000057976904,0.0000013559032],"category_scores_gemma":[0.00009330185,0.00009553659,0.00011072378,0.0005083942,0.000025150885,0.0005279593,0.000050498766,0.000101909536,4.5211112e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005898784,0.00029971695,0.0006495848,0.000048503472,0.00008290382,0.00002586626,0.0018745459,0.08903696,0.3942165,0.01497492,0.000006293909,0.4987252],"study_design_scores_gemma":[0.00077331444,0.00024410988,0.022745075,0.00013235098,0.000034224533,0.00012906568,0.00003508294,0.89867264,0.050158367,0.026874766,0.00003259283,0.00016841468],"about_ca_topic_score_codex":0.000032414344,"about_ca_topic_score_gemma":1.4901035e-7,"teacher_disagreement_score":0.8096357,"about_ca_system_score_codex":0.00009064927,"about_ca_system_score_gemma":0.00006497361,"threshold_uncertainty_score":0.3895869},"labels":[],"label_agreement":null},{"id":"W2039344137","doi":"10.1007/bf02985637","title":"A Very Mean Value Theorem","year":2003,"lang":"en","type":"article","venue":"The Mathematical Intelligencer","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Mean value theorem (divided differences); Mathematics; Mean value; Mathematical economics; Statistics; Mathematical analysis; Picard–Lindelöf theorem; Fixed-point theorem","score_opus":0.04306645498068984,"score_gpt":0.3171031996934598,"score_spread":0.27403674471276995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039344137","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068565254,0.00012592853,0.9555073,0.0007879199,0.0002527452,0.00014630881,3.4427336e-7,0.00010740343,0.042386398],"genre_scores_gemma":[0.19543198,0.00002918077,0.8015976,0.0013234296,0.000088722176,0.00003910947,1.09723246e-7,0.00001993776,0.0014699204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984285,0.0003449736,0.00028201778,0.00027162768,0.0003313362,0.00034151276],"domain_scores_gemma":[0.9979552,0.0010467541,0.000056217315,0.00077940035,0.000045134653,0.000117312135],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014210676,0.00015496525,0.0002048433,0.00003129859,0.00013878544,0.0001501852,0.0010988953,0.0000478288,0.00047189987],"category_scores_gemma":[0.0004836105,0.00008032198,0.00012508976,0.000416552,0.00019215893,0.00013374392,0.00016371194,0.00020798665,0.0009402086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011274218,0.000055522047,0.0000012320055,0.000007363484,0.000011719743,0.0000035162386,0.0008148871,0.000014676943,0.00010145332,0.9570071,0.00011931584,0.041862074],"study_design_scores_gemma":[0.000027269558,0.000046688023,0.0000032231417,0.000019977067,0.000007565272,0.000035243014,0.000117525415,0.037383754,0.013830367,0.94473,0.0036690715,0.00012931088],"about_ca_topic_score_codex":0.0000036004535,"about_ca_topic_score_gemma":1.4334024e-7,"teacher_disagreement_score":0.19474632,"about_ca_system_score_codex":0.000022119091,"about_ca_system_score_gemma":0.000029742836,"threshold_uncertainty_score":0.9998377},"labels":[],"label_agreement":null},{"id":"W2041704512","doi":"10.1117/12.680289","title":"Sublinear constant multiplication algorithms","year":2006,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Sublinear function; Multiplication (music); Constant (computer programming); Integer (computer science); Mathematics; Conjecture; Radix (gastropod); Multiplication algorithm; Arithmetic; Computer science; Discrete mathematics; Algorithm; Combinatorics; Binary number","score_opus":0.013678987667445096,"score_gpt":0.24871162010369466,"score_spread":0.23503263243624956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041704512","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9624556,0.00013250472,0.028687518,0.0046850597,0.0003933097,0.0005507121,0.000034417913,0.00019989182,0.0028610043],"genre_scores_gemma":[0.05272706,0.000043746564,0.94620186,0.0001190956,0.0005353401,0.000121822486,0.0000059200574,0.00003751876,0.00020762713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974997,1.9918048e-8,0.0007617495,0.00052465254,0.00077228935,0.00044158392],"domain_scores_gemma":[0.9972449,0.00022301039,0.00043891536,0.00010158585,0.0018662009,0.00012541401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080438517,0.00030291846,0.0004028198,0.00010758733,0.00010870639,0.00024954905,0.0016902735,0.00016278775,0.000005179638],"category_scores_gemma":[0.00040180012,0.00024346056,0.0005626623,0.00061428774,0.00023189737,0.0008419118,0.00028711074,0.00028490485,0.0000027857047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014274182,0.00013208264,0.00015573038,0.00009823239,0.0000928058,9.1574414e-8,0.0000466279,0.00005998912,0.27825496,0.71586215,0.0015134799,0.0037695752],"study_design_scores_gemma":[0.0018731192,0.000453089,0.0019588247,0.00023283347,0.000102120954,0.0000400668,0.00037425858,0.6651156,0.2808467,0.02979979,0.01841645,0.0007871815],"about_ca_topic_score_codex":0.000029309762,"about_ca_topic_score_gemma":7.523397e-8,"teacher_disagreement_score":0.9175143,"about_ca_system_score_codex":0.00012347293,"about_ca_system_score_gemma":0.000037953938,"threshold_uncertainty_score":0.99280334},"labels":[],"label_agreement":null},{"id":"W2042103381","doi":"10.1145/1723112.1723183","title":"Fine-grained vs. coarse-grained shift-and-add arithmetic in FPGAs (abstract only)","year":2010,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Field-programmable gate array; Computer science; Implementation; Latency (audio); Parallel computing; Block size; Block (permutation group theory); Computer architecture; Arithmetic; Embedded system; Mathematics; Programming language; Key (lock); Operating system; Telecommunications","score_opus":0.01227076361614016,"score_gpt":0.2707499696870888,"score_spread":0.25847920607094865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042103381","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1701784,0.000072515686,0.7992527,0.015993271,0.0016489144,0.0005173124,0.0000072319353,0.00055152865,0.0117781395],"genre_scores_gemma":[0.43403623,0.0000039432834,0.5644937,0.00068503065,0.0001065528,0.000014468709,0.0000015243428,0.000013921288,0.00064463855],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9980142,0.00008401866,0.00041445578,0.0006406778,0.00031091023,0.00053572777],"domain_scores_gemma":[0.998445,0.00048628065,0.00009179592,0.000648247,0.00004858079,0.00028012352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008343561,0.00025850814,0.0003728613,0.00020799208,0.00009344651,0.0002505894,0.0008269316,0.00014003516,0.00021409501],"category_scores_gemma":[0.00036485106,0.00020329715,0.000093744435,0.00071878784,0.00013295979,0.00037769112,0.00030375348,0.0005913559,0.00006818547],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016457858,0.0002797484,0.002290913,0.000021195017,0.000015810137,0.00011623021,0.00033664805,0.000009722487,0.003773468,0.12967165,0.0005999867,0.8628682],"study_design_scores_gemma":[0.0046585514,0.0009064036,0.35344917,0.00008676734,0.000027085887,0.00020612082,0.00006925103,0.2951906,0.0062674773,0.2802615,0.05672749,0.0021496092],"about_ca_topic_score_codex":0.00039522198,"about_ca_topic_score_gemma":0.0005832556,"teacher_disagreement_score":0.86071855,"about_ca_system_score_codex":0.000016593463,"about_ca_system_score_gemma":0.00009207198,"threshold_uncertainty_score":0.82902175},"labels":[],"label_agreement":null},{"id":"W2042105004","doi":"10.1016/j.jcta.2006.04.002","title":"The small octagon with longest perimeter","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Perimeter; Regular polygon; Mathematics; Trigonometry; Series (stratigraphy); Unit (ring theory); Interval (graph theory); Combinatorics; Arithmetic; Algorithm; Computer science; Mathematical analysis; Geometry; Mathematics education","score_opus":0.006864764530871105,"score_gpt":0.21850662028562967,"score_spread":0.21164185575475858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042105004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087537125,0.0019699675,0.8786085,0.0052345064,0.017387062,0.0002645935,0.0000016096732,0.00009652737,0.008900104],"genre_scores_gemma":[0.66725355,0.00011177196,0.32601658,0.00026459474,0.0042309924,0.000008667169,3.5355873e-7,0.000045236855,0.0020682283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985169,0.00038927322,0.0003695849,0.00012954263,0.00033988865,0.00025480997],"domain_scores_gemma":[0.99833864,0.0005984756,0.000380999,0.00032242047,0.00027237833,0.00008709668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015244572,0.00014489816,0.00025066704,0.000046894635,0.00026290878,0.00036674947,0.0009421055,0.00004603406,0.000007711199],"category_scores_gemma":[0.00011259584,0.000074077456,0.00011935674,0.0002756119,0.00018309329,0.00046431323,0.000113133116,0.00027347347,0.0000030689405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033217785,0.00007446732,0.00006425529,0.0000027935407,0.000030898587,0.000062686995,0.000080758524,0.000011505588,0.0003981811,0.96700424,0.00018808513,0.031749927],"study_design_scores_gemma":[0.000816515,0.0016283636,0.00057722203,0.000025139783,0.00001755324,0.0003324002,0.00008469661,0.00005214075,0.005739605,0.8994546,0.09110828,0.0001634833],"about_ca_topic_score_codex":0.0000070360024,"about_ca_topic_score_gemma":0.0000011972386,"teacher_disagreement_score":0.57971644,"about_ca_system_score_codex":0.0000322258,"about_ca_system_score_gemma":0.00009207699,"threshold_uncertainty_score":0.35365736},"labels":[],"label_agreement":null},{"id":"W2042528220","doi":"10.1109/tc.2012.35","title":"High-Speed Parallel Decimal Multiplication with Redundant Internal Encodings","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Arithmetic; Decimal; Multiplication (music); Multiplication algorithm; Adder; Multiplier (economics); Computer science; Critical path method; Reduction (mathematics); Mathematics; Numerical digit; Parallel computing; Algorithm; Binary number; Telecommunications","score_opus":0.02156385517594522,"score_gpt":0.2647108640006778,"score_spread":0.24314700882473256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042528220","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010701314,0.000017308768,0.9863118,0.00070998573,0.0017743566,0.00017111981,0.0000031393424,0.0002464369,0.00006453969],"genre_scores_gemma":[0.48124763,0.00000831974,0.51833177,0.0002617977,0.0000868995,0.00001184658,4.0921472e-7,0.000009673626,0.00004165203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985749,0.000092207476,0.00023785823,0.0003789641,0.00030487662,0.0004111957],"domain_scores_gemma":[0.99895376,0.00021008878,0.00009616046,0.00043082,0.00005902102,0.00025013194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021894202,0.00020506354,0.00020432874,0.0001375643,0.00019296905,0.00013007633,0.00058233563,0.000054938017,0.000013577761],"category_scores_gemma":[0.0000022131753,0.00016366097,0.00009694399,0.00037247708,0.000071489965,0.00064538576,0.000006138491,0.0002646919,0.000072907846],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009015227,0.0006007232,0.00008162421,0.0000089301275,0.00008957153,0.000009270411,0.0008903157,0.02851354,0.00275056,0.0030982748,0.0002080046,0.96365905],"study_design_scores_gemma":[0.0032537798,0.0013461873,0.004868554,0.00021075312,0.00006526672,0.00031786566,0.00007273668,0.92093986,0.062143,0.00086827145,0.0046391548,0.0012745728],"about_ca_topic_score_codex":0.000087867746,"about_ca_topic_score_gemma":0.0000019072662,"teacher_disagreement_score":0.96238446,"about_ca_system_score_codex":0.00008426711,"about_ca_system_score_gemma":0.000024590743,"threshold_uncertainty_score":0.66739005},"labels":[],"label_agreement":null},{"id":"W2042775942","doi":"10.1142/s0218126604001970","title":"NOVEL DESIGN AND FPGA IMPLEMENTATION OF DA-RNS FIR FILTERS","year":2004,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Field-programmable gate array; Finite impulse response; Residue number system; Modulo; Computer science; Chinese remainder theorem; Binary number; Digital signal processing; Modulo operation; Computer hardware; Digital filter; Power of two; Filter (signal processing); Embedded system; Arithmetic; Algorithm; Mathematics","score_opus":0.04245574951914673,"score_gpt":0.2995850500938043,"score_spread":0.2571293005746576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042775942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02534136,0.0005233334,0.9729517,0.0002863549,0.000749765,0.00012535608,0.000001820197,0.000008604509,0.000011687651],"genre_scores_gemma":[0.7420616,0.00005028529,0.2576807,0.000086021864,0.000111356494,0.0000013771032,1.4089304e-7,0.000005616609,0.000002849708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988256,0.00008666792,0.0005115218,0.00015315179,0.00026616428,0.00015691425],"domain_scores_gemma":[0.99896884,0.00014790938,0.000497734,0.00012429128,0.00012169356,0.00013952589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065952365,0.00011127786,0.0003180929,0.00013155444,0.000059194495,0.00016133592,0.00026791397,0.000033682238,6.106205e-7],"category_scores_gemma":[0.00000898113,0.00008771149,0.00005813651,0.00017869656,0.00004085255,0.00038704427,0.00006243307,0.0000935369,2.2033257e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000078971225,0.00012214927,0.00035200923,0.00017356404,0.00017704669,0.000049377224,0.0025914803,0.011016472,0.020815114,0.017239148,0.00020689127,0.9472489],"study_design_scores_gemma":[0.061249264,0.028933536,0.2728412,0.008966004,0.00074049644,0.03177267,0.013863373,0.42928138,0.06737115,0.06567409,0.013494733,0.0058121085],"about_ca_topic_score_codex":0.0000836344,"about_ca_topic_score_gemma":3.3789925e-7,"teacher_disagreement_score":0.94143677,"about_ca_system_score_codex":0.00003142243,"about_ca_system_score_gemma":0.000073924224,"threshold_uncertainty_score":0.35767704},"labels":[],"label_agreement":null},{"id":"W2045916343","doi":"10.1145/2684746.2689146","title":"Area Optimization of Arithmetic Units by Component Sharing for FPGAs (Abstract Only)","year":2015,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Floating point; Integer (computer science); Field-programmable gate array; Floating-point unit; Subtraction; Multiplication (music); Arithmetic; Component (thermodynamics); Computer science; Division (mathematics); Point (geometry); Reduction (mathematics); Saturation arithmetic; Parallel computing; Computer hardware; Arbitrary-precision arithmetic; Mathematics; Algorithm; Operating system","score_opus":0.09614450303270765,"score_gpt":0.3081711610447928,"score_spread":0.21202665801208515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045916343","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016223142,0.000049450635,0.99581933,0.0004023754,0.00019266336,0.00015641648,0.0000055044925,0.000065996755,0.0016859783],"genre_scores_gemma":[0.047244113,0.000004044158,0.95226765,0.000108134,0.00002181163,0.000008492937,0.0000085640295,0.0000069274633,0.00033024675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991633,0.000021054255,0.00022140754,0.00023982237,0.00018670764,0.00016766532],"domain_scores_gemma":[0.99914896,0.00013252876,0.00009313878,0.0002548275,0.00023589529,0.00013467278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039309534,0.00008860239,0.00016176933,0.00005013357,0.000033032797,0.0000614321,0.00045087823,0.000034127905,0.000010507267],"category_scores_gemma":[0.00013467464,0.000072050425,0.000032396034,0.00032675598,0.00002181458,0.0002171348,0.00013166801,0.000050154096,0.0000022433164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004059836,0.00084376615,0.00065671274,0.00011586879,0.00008741683,0.000007105467,0.00069633825,0.215874,0.0046137283,0.096020326,0.009133669,0.67191046],"study_design_scores_gemma":[0.00037674795,0.000113621856,0.00008460845,0.000016362063,0.0000044768267,0.00000341029,0.00002664848,0.9885538,0.0053156475,0.003886308,0.0015023563,0.00011600536],"about_ca_topic_score_codex":0.00006859799,"about_ca_topic_score_gemma":7.0122786e-7,"teacher_disagreement_score":0.7726798,"about_ca_system_score_codex":0.000023430632,"about_ca_system_score_gemma":0.000047518657,"threshold_uncertainty_score":0.2938131},"labels":[],"label_agreement":null},{"id":"W2049681033","doi":"10.1007/s00034-011-9365-y","title":"A Novel Decimal Logarithmic Converter Based on First-Order Polynomial Approximation","year":2011,"lang":"en","type":"article","venue":"Circuits Systems and Signal Processing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decimal; Logarithm; Binary number; Polynomial; Mathematics; Algorithm; Computer science; Arithmetic","score_opus":0.04721050248321819,"score_gpt":0.248157145433304,"score_spread":0.2009466429500858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049681033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012316635,0.00020856205,0.9956217,0.00006261142,0.00026007852,0.00023024347,0.0000023996304,0.00009877898,0.00228399],"genre_scores_gemma":[0.9273631,8.393169e-7,0.072182015,0.00022018753,0.0001507975,0.000027305918,0.0000010852508,0.000014522382,0.000040138097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985843,0.000063899526,0.00030314445,0.000473338,0.00027066882,0.00030469746],"domain_scores_gemma":[0.99929506,0.00008843844,0.00016030623,0.00019254572,0.0001247661,0.00013888083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004203954,0.00019066477,0.00025984936,0.00011849912,0.00031719837,0.0003363932,0.00030523632,0.00009795348,0.000010273929],"category_scores_gemma":[0.000025274428,0.00015477394,0.000041005525,0.00030362015,0.00006416357,0.0004532693,0.00004975906,0.00015111057,0.000009476984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021177008,0.00029365992,0.000496141,0.00042180173,0.000017953906,0.000021301852,0.0020220745,0.00019783995,0.0045353086,0.003442387,0.00005224602,0.9884781],"study_design_scores_gemma":[0.0006402456,0.00016792241,0.0010694262,0.00021868112,0.000007861812,0.000043208296,0.00006385147,0.99661976,0.00037857247,0.00018837728,0.0003494073,0.0002526993],"about_ca_topic_score_codex":0.00009492745,"about_ca_topic_score_gemma":9.2061686e-7,"teacher_disagreement_score":0.99642193,"about_ca_system_score_codex":0.00003280405,"about_ca_system_score_gemma":0.00008237562,"threshold_uncertainty_score":0.6311498},"labels":[],"label_agreement":null},{"id":"W2051963701","doi":"10.1145/345542.345581","title":"On accelerated methods to evaluate sums of products of rational numbers","year":2000,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Speedup; Multiplication (music); Computation; Decimal; Integer (computer science); Greatest common divisor; Binary number; Rational number; Representation (politics); Computer science; Mathematics; Algorithm; Arithmetic; Parallel computing; Discrete mathematics; Combinatorics","score_opus":0.06789637576108613,"score_gpt":0.4056871926815203,"score_spread":0.33779081692043417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051963701","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029582279,0.000011364904,0.9555248,0.0016955914,0.00017130365,0.00018853376,0.0000015537894,0.00003889833,0.012785701],"genre_scores_gemma":[0.018435307,0.0000022741333,0.9792573,0.00045202096,0.000023457123,0.0000068926597,6.802037e-7,0.0000041250028,0.0018179317],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987512,0.00029493886,0.00025666034,0.00027238397,0.00028851777,0.00013628343],"domain_scores_gemma":[0.9991159,0.00023167495,0.000054512253,0.0003379226,0.00019184953,0.00006817324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092945807,0.00008186444,0.00018759583,0.000055904795,0.00002418312,0.000018912391,0.00038275687,0.00002360284,0.00067247095],"category_scores_gemma":[0.00019848105,0.00006022304,0.00003726141,0.0008065464,0.000027281209,0.00012583905,0.00004809043,0.00005185094,0.00003854672],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020416064,0.00008450919,0.000011057397,0.0000073527517,0.000013632392,5.673828e-7,0.00013252533,0.0008936404,0.042640127,0.027088396,0.00088898686,0.9282188],"study_design_scores_gemma":[0.00036449192,0.00048241724,0.002075015,0.000020651718,0.000006143515,0.0000026877751,0.0000077111445,0.06508747,0.90598947,0.02087724,0.0048985127,0.00018820044],"about_ca_topic_score_codex":0.000040830484,"about_ca_topic_score_gemma":3.764848e-7,"teacher_disagreement_score":0.9280306,"about_ca_system_score_codex":0.000010894978,"about_ca_system_score_gemma":0.000063577216,"threshold_uncertainty_score":0.7363086},"labels":[],"label_agreement":null},{"id":"W2052784918","doi":"10.1016/j.jsc.2010.08.010","title":"High-precision numerical integration: Progress and challenges","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Lawrence Berkeley National Laboratory","keywords":"Realm; Field (mathematics); Mathematics; Relation (database); Numerical integration; Integer (computer science); Computer science; Programming language; Data mining; Pure mathematics; Mathematical analysis","score_opus":0.025112515337038656,"score_gpt":0.3043765023234904,"score_spread":0.2792639869864517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052784918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072226495,0.0007762958,0.9194981,0.0061364956,0.0012296638,0.00005673805,2.032614e-7,0.000024586176,0.00005143764],"genre_scores_gemma":[0.5043555,0.00012952322,0.49520692,0.00003746525,0.0002635839,9.2508367e-7,1.6128101e-7,0.0000034091106,0.000002501127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898016,0.000098957615,0.00034865417,0.00014968759,0.00030947628,0.000113066584],"domain_scores_gemma":[0.99899596,0.00021612493,0.00029581678,0.00011244657,0.00025530742,0.0001243239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058186153,0.00009379549,0.00021891268,0.0001298997,0.000064863474,0.00013697609,0.00027001294,0.000055133012,0.0000041425033],"category_scores_gemma":[0.000105160325,0.00006771559,0.000051017123,0.00020354193,0.000045267134,0.00047007672,0.00007877683,0.00030144825,0.0000032088785],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005659767,0.00005152784,0.000046297984,0.0000053213994,0.0000072457187,0.000009382822,0.00038631677,0.000036269335,0.0005732533,0.019257994,0.00003026921,0.9795905],"study_design_scores_gemma":[0.0020425704,0.0019584303,0.16344514,0.00021039396,0.00004141723,0.0019019142,0.00026430408,0.49599177,0.0038793685,0.3220931,0.0075774156,0.00059417787],"about_ca_topic_score_codex":0.0000026340576,"about_ca_topic_score_gemma":4.1216896e-7,"teacher_disagreement_score":0.9789963,"about_ca_system_score_codex":0.00001079063,"about_ca_system_score_gemma":0.000033739787,"threshold_uncertainty_score":0.27613616},"labels":[],"label_agreement":null},{"id":"W2056994687","doi":"10.1007/s00454-013-9489-x","title":"The Small Octagons of Maximal Width","year":2013,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics","score_opus":0.014528169664538388,"score_gpt":0.2586883984759491,"score_spread":0.24416022881141072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056994687","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026170589,0.00020279954,0.96985304,0.001813125,0.0003033278,0.00015029286,0.0000068392183,0.000056032168,0.0014439428],"genre_scores_gemma":[0.40037206,0.000006370814,0.59904295,0.0002679933,0.000063735315,0.00001888928,0.0000059910285,0.00000772598,0.00021428974],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867797,0.00010256986,0.00031099268,0.0002653894,0.0003673801,0.00027572847],"domain_scores_gemma":[0.9983601,0.0008713988,0.00014281351,0.0003121709,0.00020295432,0.00011058113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030693205,0.00012579178,0.0001643105,0.000093032075,0.00020045412,0.00017895015,0.0008528903,0.000035473222,0.000044586344],"category_scores_gemma":[0.00011485806,0.000082956234,0.00011451674,0.0007397811,0.00014238118,0.00023072686,0.0002903227,0.00013342955,0.0000963048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004824829,0.00006688078,0.0015023162,0.000013685007,0.000057472353,0.000003226956,0.00012188376,0.0052063465,0.00017588121,0.29739055,0.0006317918,0.6948252],"study_design_scores_gemma":[0.00028439908,0.00013899688,0.13124777,0.000015185084,0.0000064975197,0.000014301318,0.000058448175,0.42289963,0.00021889078,0.44180134,0.0030759997,0.00023854476],"about_ca_topic_score_codex":0.00006134373,"about_ca_topic_score_gemma":5.496839e-7,"teacher_disagreement_score":0.69458663,"about_ca_system_score_codex":0.000015361471,"about_ca_system_score_gemma":0.00005512638,"threshold_uncertainty_score":0.33828568},"labels":[],"label_agreement":null},{"id":"W2057565823","doi":"10.1007/s10589-014-9687-3","title":"CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization","year":2014,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":339,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Thread (computing); Modular design; Fortran; MATLAB; Computer science; Parallel computing; Programming language; Algorithm; Computational science","score_opus":0.017438595689403612,"score_gpt":0.24961380206272565,"score_spread":0.23217520637332204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057565823","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024747063,0.000022023049,0.997069,0.0013423259,0.000010413147,0.0006106826,0.000011336011,0.00009477358,0.0008147079],"genre_scores_gemma":[0.012339828,0.0000071416475,0.9869112,0.00030772306,0.00004826835,0.0002890716,0.000055532302,0.000012080251,0.000029160181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990316,0.000042397864,0.00025065662,0.00037429715,0.0001535695,0.00014748477],"domain_scores_gemma":[0.9985637,0.0008856084,0.00012958418,0.00015036612,0.00013695224,0.00013380434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022783152,0.00014223509,0.0001657081,0.00006739121,0.0002976016,0.00015661228,0.00012472994,0.00004314507,0.00001264515],"category_scores_gemma":[0.00007735191,0.00012273835,0.000019257435,0.0002538067,0.00017862247,0.00018525103,0.00005519024,0.000053397634,0.0000020435489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019731153,0.000039876482,0.000033523334,0.000014203498,0.0000074908376,8.165313e-8,0.000025588835,0.71375537,0.000006847935,0.23778374,0.000004803316,0.048326496],"study_design_scores_gemma":[0.0005838379,0.00010523064,0.00008136865,0.00001527076,0.000015594766,0.00003335117,0.000014489701,0.94775116,0.000007793799,0.050859846,0.00037715808,0.00015491838],"about_ca_topic_score_codex":6.4674873e-7,"about_ca_topic_score_gemma":5.6341822e-8,"teacher_disagreement_score":0.23399578,"about_ca_system_score_codex":0.000014939445,"about_ca_system_score_gemma":0.000041627212,"threshold_uncertainty_score":0.5005125},"labels":[],"label_agreement":null},{"id":"W2059261580","doi":"10.1016/s0168-9274(01)00155-6","title":"Some recent advances in validated methods for IVPs for ODEs","year":2002,"lang":"en","type":"article","venue":"Applied Numerical Mathematics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Toronto","funders":"","keywords":"Ode; Ordinary differential equation; Initial value problem; Interval (graph theory); Mathematics; Applied mathematics; Scheme (mathematics); Differential equation; Mathematical analysis","score_opus":0.060865229531314506,"score_gpt":0.37347211835876865,"score_spread":0.31260688882745413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059261580","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019558625,0.0015539833,0.99528354,0.0010046471,0.00026269016,0.0009697766,0.000005790493,0.000166242,0.00073376944],"genre_scores_gemma":[0.00037176316,0.0007019261,0.9974329,0.0005230937,0.0001247547,0.0007375383,0.0000026744467,0.00003219316,0.0000731569],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981294,0.00007673447,0.00057136576,0.00050107256,0.00018544133,0.0005359823],"domain_scores_gemma":[0.9968032,0.002304953,0.00019663764,0.00048499694,0.00006691333,0.00014328661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083461346,0.00024590956,0.00056399126,0.0000938843,0.00010331741,0.00009460271,0.00073800597,0.000095028874,0.00002292313],"category_scores_gemma":[0.00043947878,0.00019995421,0.00012166999,0.0006538354,0.00005256634,0.00027751608,0.0001370915,0.0001376574,0.000023166853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056285867,0.00028543334,6.2364234e-7,0.000093906514,0.000009026033,4.47225e-7,0.00024176876,0.00004910584,0.0009876867,0.27805042,0.00017187878,0.72010404],"study_design_scores_gemma":[0.00050075096,0.00010784128,0.0000019456431,0.000015388456,0.000009804447,0.0000024683009,0.000038845257,0.35209504,0.0057406723,0.5579568,0.083283104,0.00024731585],"about_ca_topic_score_codex":5.917255e-7,"about_ca_topic_score_gemma":7.185757e-8,"teacher_disagreement_score":0.71985674,"about_ca_system_score_codex":0.00005026078,"about_ca_system_score_gemma":0.0000113268015,"threshold_uncertainty_score":0.8153896},"labels":[],"label_agreement":null},{"id":"W2059686924","doi":"10.1016/j.mejo.2013.10.012","title":"Design and verification of a frequency domain equalizer","year":2013,"lang":"en","type":"article","venue":"Microelectronics Journal","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Frequency domain; Algorithm; Equalizer; Domain (mathematical analysis); Adaptive equalizer; Generator (circuit theory); Floating point; Mathematics; Power (physics); Telecommunications; Decoding methods","score_opus":0.0142688880469125,"score_gpt":0.2513518802033457,"score_spread":0.2370829921564332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059686924","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02412632,0.0016578063,0.97317183,0.0007707395,0.000075812284,0.000096685915,1.4360215e-7,0.000013606891,0.00008704921],"genre_scores_gemma":[0.060489334,0.00023724622,0.93910146,0.000108113905,0.00003245514,0.000005075912,1.2793961e-7,0.000005761911,0.000020405041],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989841,0.00022743807,0.00024409345,0.00014477434,0.0001332942,0.00026632036],"domain_scores_gemma":[0.99938107,0.00008534353,0.00015823911,0.0001713992,0.00011204508,0.00009193236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006624187,0.00008194086,0.0001339757,0.00006629868,0.00009334543,0.00014726633,0.00035370383,0.000037400714,0.000031481035],"category_scores_gemma":[0.000024936422,0.00006557511,0.000036508933,0.00019422817,0.000037542315,0.00033031194,0.000043233464,0.00021679072,0.000010510626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027216872,0.0000424688,0.000041617295,0.0000051959673,0.000020781583,0.0000029462294,0.0003828227,0.000009083955,0.72201407,0.052593358,0.00025968102,0.22462524],"study_design_scores_gemma":[0.00051575404,0.00054866454,0.0004980862,0.00002052999,0.0000075214184,0.00050704007,0.000033689506,0.01421681,0.05472946,0.92733705,0.0013773603,0.00020803408],"about_ca_topic_score_codex":0.000012731733,"about_ca_topic_score_gemma":1.16756596e-7,"teacher_disagreement_score":0.8747437,"about_ca_system_score_codex":0.00004327121,"about_ca_system_score_gemma":0.00009981117,"threshold_uncertainty_score":0.2674075},"labels":[],"label_agreement":null},{"id":"W2062703889","doi":"10.1145/860854.860886","title":"Exploiting fast hardware floating point in high precision computation","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computation; Floating point; Computer science; Double-precision floating-point format; Reduction (mathematics); Iterative method; Point (geometry); Algorithm; Software; Single-precision floating-point format; IEEE floating point; Computational science; Parallel computing; Mathematics","score_opus":0.02638337230332419,"score_gpt":0.28914833203101586,"score_spread":0.26276495972769165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062703889","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01987809,0.000016672378,0.97548044,0.00023131701,0.00028012626,0.000091933965,2.3106129e-7,0.00010515039,0.00391607],"genre_scores_gemma":[0.29196933,0.0000013936223,0.707801,0.0001351135,0.000020078034,0.000003222443,4.952687e-7,0.000004399718,0.000064957785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882156,0.0002079121,0.00025622078,0.00030136498,0.00019657532,0.00021635255],"domain_scores_gemma":[0.9994068,0.0002643794,0.00006315145,0.00015754801,0.00004738423,0.000060747003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006188749,0.00009030186,0.00013448711,0.000080422535,0.000073457566,0.00011990059,0.00020494338,0.000030137999,0.000024001969],"category_scores_gemma":[0.00026272144,0.00007580374,0.000031145086,0.00045908956,0.000009308233,0.00042268648,0.00008952935,0.00010764368,0.000027341994],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.6238575e-7,0.00003843299,0.0005343616,0.0000049973496,0.0000015033456,0.000009680051,0.00036672957,0.0018312759,0.00083657197,0.03982159,0.000033890505,0.9565202],"study_design_scores_gemma":[0.00082772406,0.00014395386,0.006064356,0.00012164259,0.0000018103143,0.00002129849,0.00064011104,0.857043,0.019533748,0.11422111,0.0009574617,0.00042376315],"about_ca_topic_score_codex":0.00006393314,"about_ca_topic_score_gemma":0.0000028945055,"teacher_disagreement_score":0.9560964,"about_ca_system_score_codex":0.00003595767,"about_ca_system_score_gemma":0.000017816486,"threshold_uncertainty_score":0.3091187},"labels":[],"label_agreement":null},{"id":"W2062719800","doi":"10.1090/s0025-5718-02-01419-9","title":"Rapid multiplication modulo the sum and difference of highly composite numbers","year":2002,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Modulo; Mathematics; Rounding; Multiplication (music); Fast Fourier transform; Correctness; Arithmetic; Computation; Discrete mathematics; Algorithm; Combinatorics; Computer science","score_opus":0.03163010017467035,"score_gpt":0.26836416721988715,"score_spread":0.2367340670452168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062719800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082106024,0.00012509974,0.9165828,0.00064758095,0.000045677923,0.00013933977,0.0000014713154,0.000026158092,0.00032580903],"genre_scores_gemma":[0.5449038,0.000020007912,0.4550286,0.000022223854,0.0000061584724,0.0000032139917,5.067853e-7,0.0000028104698,0.000012640936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923116,0.000063585925,0.00029074049,0.00012909231,0.00020309635,0.0000823259],"domain_scores_gemma":[0.9988949,0.000486776,0.00026278157,0.00022980596,0.00009651294,0.000029243742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020948259,0.00007739832,0.00017181721,0.000040692106,0.000050965864,0.00003185892,0.00027428067,0.000024692481,0.000002129219],"category_scores_gemma":[0.000040606996,0.00005399454,0.000034404697,0.00020554403,0.00008783584,0.000095753174,0.00008383096,0.00005008737,0.0000025965662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028563481,0.00042861028,0.00019819311,0.00027843716,0.000037473394,4.982877e-7,0.0068867113,0.0020509076,0.019116487,0.0831296,0.00010000958,0.88777024],"study_design_scores_gemma":[0.00015069419,0.00004864552,0.002628272,0.00003304157,0.0000070025767,0.0000035033931,0.000031412525,0.93871427,0.00436378,0.053940434,0.000019675894,0.000059300866],"about_ca_topic_score_codex":0.000010751381,"about_ca_topic_score_gemma":2.4375385e-7,"teacher_disagreement_score":0.9366633,"about_ca_system_score_codex":0.0000062191707,"about_ca_system_score_gemma":0.0000030711487,"threshold_uncertainty_score":0.22018334},"labels":[],"label_agreement":null},{"id":"W2063302371","doi":"10.1109/reconfig.2009.22","title":"A Scalable Architecture for Multivariate Polynomial Evaluation on FPGA","year":2009,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Field-programmable gate array; Computer science; Scalability; Parallel computing; Acceleration; Polynomial; Computation; Hardware acceleration; Architecture; Exploit; Computer architecture; Computer engineering; Embedded system; Algorithm; Mathematics; Operating system","score_opus":0.03858036621161746,"score_gpt":0.34307656679680976,"score_spread":0.3044962005851923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063302371","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070881733,0.0000123937,0.98883873,0.005397504,0.00028127042,0.00035826187,0.0000013222859,0.00009682844,0.004304877],"genre_scores_gemma":[0.06257927,4.155023e-7,0.9347594,0.0019966073,0.00018293325,0.00002467524,0.0000012239686,0.0000036248005,0.00045190126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990745,0.00008649795,0.00011720138,0.00029068638,0.00022144626,0.00020965902],"domain_scores_gemma":[0.9994119,0.00016068811,0.000037041566,0.0002577975,0.000061033355,0.000071536364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053940347,0.00009000956,0.00010875866,0.000053161555,0.00008592552,0.00008620556,0.00029420198,0.000038316426,0.000022265216],"category_scores_gemma":[0.00014569343,0.00006366175,0.00006257004,0.0001816661,0.000008461669,0.00010217015,0.000026112955,0.00007133584,0.000018934841],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014346824,0.000055616303,7.7537345e-7,8.8247737e-7,0.0000027061963,2.9081997e-7,0.000051520725,0.0005049084,0.002785526,0.0070986347,0.0008741574,0.9886106],"study_design_scores_gemma":[0.0011659694,0.0007937259,0.0022488248,0.000011102495,0.0000072884163,0.0000028392656,0.0000036707647,0.8725502,0.0133016715,0.096634805,0.013079793,0.00020014575],"about_ca_topic_score_codex":0.000016704746,"about_ca_topic_score_gemma":6.7633084e-7,"teacher_disagreement_score":0.9884105,"about_ca_system_score_codex":0.00002748466,"about_ca_system_score_gemma":0.000034923574,"threshold_uncertainty_score":0.25960505},"labels":[],"label_agreement":null},{"id":"W2063927241","doi":"10.1109/cjece.2013.6704691","title":"Leading one detectors and leading one position detectors - An evolutionary design methodology","year":2013,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Field-programmable gate array; Computer science; Electronic circuit; Detector; Application-specific integrated circuit; Shuffling; Gate array; Electronic engineering; Computer hardware; Engineering; Electrical engineering","score_opus":0.0399000260591533,"score_gpt":0.23769146724618168,"score_spread":0.19779144118702838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063927241","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08610487,0.0011079841,0.91217726,0.0002466979,0.00024977815,0.00008139909,3.111111e-7,0.00002760751,0.000004073229],"genre_scores_gemma":[0.38881737,0.000017546905,0.6108418,0.00010031955,0.00020769791,0.0000022586864,1.5975482e-7,0.000009449809,0.0000034144084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986377,0.00021275686,0.000315508,0.00024089836,0.00013364053,0.0004595357],"domain_scores_gemma":[0.9982719,0.00055095216,0.00009475516,0.000114008864,0.00010911387,0.00085927005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046468023,0.00016421526,0.0003480676,0.00047247653,0.00014445558,0.00020754433,0.00029537448,0.00009178688,0.0000072908106],"category_scores_gemma":[0.00011772266,0.00015800816,0.000051542505,0.00044158788,0.000037006794,0.00063990935,0.00003657259,0.0003737537,0.0000021948747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008537937,0.000035854326,0.00056094234,0.000030106921,0.00011620836,0.0001323759,0.00034643983,0.0071742283,0.031032538,0.005736193,0.00007210366,0.9547545],"study_design_scores_gemma":[0.0002670664,0.0011572813,0.019884627,0.000075822,0.000024081573,0.0008468359,0.000004062323,0.96856904,0.0031678411,0.00554411,0.00013474283,0.00032449546],"about_ca_topic_score_codex":0.00036088494,"about_ca_topic_score_gemma":0.000013271734,"teacher_disagreement_score":0.9613948,"about_ca_system_score_codex":0.00012162063,"about_ca_system_score_gemma":0.00012007428,"threshold_uncertainty_score":0.64433855},"labels":[],"label_agreement":null},{"id":"W2065013830","doi":"10.1007/s10898-006-9045-9","title":"Comparison Between Baumann and Admissible Simplex Forms in Interval Analysis","year":2006,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Simplex; Bounding overwatch; Combinatorics; Upper and lower bounds; Interval (graph theory); Simplex algorithm; Regular polygon; Linear programming; Discrete mathematics; Mathematical optimization; Mathematical analysis; Geometry","score_opus":0.021915825753188636,"score_gpt":0.3418294468815145,"score_spread":0.3199136211283259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065013830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03743194,0.00016332607,0.9614864,0.0004718555,0.00006228991,0.000034370943,0.000002258896,0.000009339584,0.00033823913],"genre_scores_gemma":[0.5254799,0.000007894397,0.47442797,0.000027302429,0.000048321384,2.0702778e-7,0.0000016234148,0.0000015297836,0.0000052119963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988908,0.00007966283,0.0005402745,0.00012385628,0.00022228222,0.00014311136],"domain_scores_gemma":[0.9993013,0.00005150166,0.00035613924,0.00009636001,0.00010594421,0.00008873065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040918653,0.0000838277,0.0003473801,0.0001436213,0.000034939072,0.0001366713,0.00025283368,0.000044933106,0.0000079084175],"category_scores_gemma":[0.00003619762,0.00006525025,0.00009390299,0.0012673794,0.000017928556,0.00054942217,0.000072414085,0.000093767776,4.5807994e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000116066,0.000088881105,0.4354396,0.000005079543,0.000071856266,0.000010971454,0.000029840327,0.47682714,0.0000052242453,0.0019448294,0.00015733087,0.08540767],"study_design_scores_gemma":[0.0003484897,0.000140155,0.20086953,0.000013707558,0.00006232952,0.000008989478,0.000012254443,0.79375184,0.00002520386,0.004417184,0.00026789823,0.000082419596],"about_ca_topic_score_codex":0.0000723209,"about_ca_topic_score_gemma":0.000016190794,"teacher_disagreement_score":0.488048,"about_ca_system_score_codex":0.000089981826,"about_ca_system_score_gemma":0.000030086714,"threshold_uncertainty_score":0.2660828},"labels":[],"label_agreement":null},{"id":"W2065170636","doi":"10.1109/iscas.2012.6271961","title":"High-frequency sequential decimal multipliers","year":2012,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decimal; Arithmetic; Adder; Computer science; Multiplier (economics); Multiplication (music); Parallel computing; Mathematics; Latency (audio); Telecommunications","score_opus":0.027341261062669295,"score_gpt":0.2916909146422373,"score_spread":0.26434965357956797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065170636","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010438475,0.00007300826,0.98237866,0.0004750484,0.0015534557,0.000059044054,6.9349704e-7,0.00019454063,0.0048271012],"genre_scores_gemma":[0.31232092,0.0000024533035,0.6868504,0.00033133655,0.000239272,0.000005155465,3.8622505e-7,0.0000044974026,0.00024553685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989506,0.00006986019,0.00014798988,0.00020325862,0.00019810305,0.00043018084],"domain_scores_gemma":[0.999283,0.00007940613,0.000035904835,0.00034283494,0.000027925815,0.00023091279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030597474,0.00010281691,0.000119908436,0.000042080224,0.00008080625,0.00007028505,0.00051812787,0.00004298498,0.00015092647],"category_scores_gemma":[0.00004664112,0.00007795721,0.000060664595,0.00024779578,0.000036988655,0.0006533583,0.00018835402,0.0000953304,0.0002797002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015762438,0.00010964097,0.0035959124,0.0000030425447,0.000015277607,0.0000064805536,0.00016203856,0.0000063353823,0.010410365,0.58898157,0.00041707305,0.3962907],"study_design_scores_gemma":[0.0058023967,0.00085188186,0.21252388,0.00005700329,0.00008731179,0.0003586352,0.0002752628,0.09274454,0.27694783,0.3341417,0.07110117,0.0051083937],"about_ca_topic_score_codex":0.00010708865,"about_ca_topic_score_gemma":6.193122e-7,"teacher_disagreement_score":0.3911823,"about_ca_system_score_codex":0.000027366925,"about_ca_system_score_gemma":0.00001916318,"threshold_uncertainty_score":0.35950738},"labels":[],"label_agreement":null},{"id":"W2067086525","doi":"10.1109/synasc.2013.17","title":"Common Factors in Fraction-Free Matrix Reduction","year":2013,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Fraction (chemistry); Factoring; Gaussian elimination; Reduction (mathematics); Integer matrix; Computation; Context (archaeology); Matrix (chemical analysis); Mathematics; Gaussian; Integer (computer science); Combinatorics; Discrete mathematics; Algebra over a field; Algorithm; Computer science; Pure mathematics; Symmetric matrix; Computational chemistry; Nonnegative matrix; Physics","score_opus":0.020456668224993854,"score_gpt":0.30352576031411216,"score_spread":0.2830690920891183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067086525","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14698677,0.000018920018,0.846269,0.0023153801,0.00058747735,0.0001270657,2.3124844e-7,0.00014355029,0.0035516287],"genre_scores_gemma":[0.36820507,0.0000055974488,0.630785,0.00007823717,0.00005641628,0.000012618076,4.628183e-7,0.00000416259,0.0008524485],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935186,0.000060921473,0.00013986738,0.00017826712,0.00012218488,0.0001468993],"domain_scores_gemma":[0.99944526,0.00007230553,0.000035112673,0.00036608105,0.000022747985,0.00005847752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010845082,0.00006613184,0.00010063226,0.00007065297,0.000038695176,0.00009829444,0.00040521324,0.00003618838,0.00018058186],"category_scores_gemma":[0.000033512508,0.000049158636,0.000028975695,0.0003265876,0.0000140723805,0.0006523123,0.00011976985,0.000111474736,0.00012550397],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018750425,0.00023297778,0.01776385,0.00000932384,0.000009982905,0.000004127235,0.00036012498,0.00008328057,0.010320149,0.058145653,0.0093999095,0.90366876],"study_design_scores_gemma":[0.0006764673,0.00021019766,0.31714386,0.000020520587,0.0000033443077,0.00002403048,0.0005281186,0.13816343,0.026315005,0.50620836,0.010091445,0.00061520084],"about_ca_topic_score_codex":0.0020199968,"about_ca_topic_score_gemma":0.0000062211698,"teacher_disagreement_score":0.9030535,"about_ca_system_score_codex":0.000032157594,"about_ca_system_score_gemma":0.000007989753,"threshold_uncertainty_score":0.30536443},"labels":[],"label_agreement":null},{"id":"W2067308523","doi":"10.1145/2016567.2016570","title":"Rounding coefficients and artificially underflowing terms in non-numeric expressions","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Rounding; Irrational number; Monomial; Mathematics; Point (geometry); Invariant (physics); Rational number; Discrete mathematics; Applied mathematics; Computer science","score_opus":0.08829774085748635,"score_gpt":0.3313756011568825,"score_spread":0.24307786029939618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067308523","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055111974,0.00016756485,0.9427757,0.0006123714,0.0003291671,0.00022320128,7.6339785e-7,0.000092797025,0.00068643136],"genre_scores_gemma":[0.46671906,0.00006523961,0.53295785,0.00019780599,0.000015822334,0.00002754544,0.0000015596424,0.0000085786105,0.0000065107843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981477,0.00036138273,0.0004920761,0.00045328107,0.00017149553,0.0003740574],"domain_scores_gemma":[0.996144,0.00068106,0.000104323255,0.002926112,0.000035402976,0.000109113826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066977006,0.00018456762,0.00027193595,0.00035068952,0.00024771207,0.00017446757,0.003788536,0.00007546749,0.00000511112],"category_scores_gemma":[0.00010140857,0.00017966104,0.000047402988,0.0011135247,0.00014664554,0.00056491734,0.004087768,0.00039614487,0.000015306616],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005317408,0.00080224394,0.022367096,0.000016684302,0.000018753635,0.000026580368,0.008467944,0.00016098862,0.0008359219,0.04315701,0.000042471052,0.92409897],"study_design_scores_gemma":[0.00072510785,0.000115826,0.14720497,0.00033348362,0.000007284618,0.00002498038,0.00012566076,0.725633,0.00038677835,0.12437941,0.00050482526,0.00055865076],"about_ca_topic_score_codex":0.00017517083,"about_ca_topic_score_gemma":0.00003511678,"teacher_disagreement_score":0.92354035,"about_ca_system_score_codex":0.00006517553,"about_ca_system_score_gemma":0.000036909198,"threshold_uncertainty_score":0.7326365},"labels":[],"label_agreement":null},{"id":"W2068652665","doi":"10.1119/1.4872408","title":"An Unusual Exponential Graph","year":2014,"lang":"en","type":"article","venue":"The Physics Teacher","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Royal University","funders":"","keywords":"Exponential function; Graph; Mathematics; Function (biology); Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.02062481537719853,"score_gpt":0.28986439225460325,"score_spread":0.26923957687740474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068652665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024416195,0.000008210588,0.9724036,0.0005264037,0.00025651083,0.000043009353,2.909672e-7,0.00011644866,0.0022293592],"genre_scores_gemma":[0.8696569,8.994364e-7,0.128925,0.0004069502,0.00081277225,0.000007751753,7.325812e-7,0.0000104311575,0.000178527],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990584,0.00029353457,0.000081089995,0.00020547405,0.00017149282,0.0001899675],"domain_scores_gemma":[0.9991854,0.000060799823,0.00003910992,0.0006295576,0.000018784536,0.000066361135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042630685,0.00008880828,0.000095148935,0.000010724077,0.00012062223,0.000097681586,0.0008677957,0.000020680322,0.00000743042],"category_scores_gemma":[0.000010523736,0.000055273595,0.000060481347,0.00020332151,0.000060351475,0.00022757618,0.00011390802,0.00014822088,0.000060274284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001390252,0.00013208405,0.00006129165,9.3782495e-7,0.000008880543,3.7872383e-7,0.00069861586,0.000044480912,0.0048966752,0.1961601,0.00019857426,0.7977966],"study_design_scores_gemma":[0.0002525092,0.000179464,0.0025165093,0.0000039564056,0.000011753302,0.0000024026717,0.00003437255,0.248909,0.009675318,0.73269624,0.0054433225,0.00027516676],"about_ca_topic_score_codex":0.000031837568,"about_ca_topic_score_gemma":2.591421e-7,"teacher_disagreement_score":0.8452408,"about_ca_system_score_codex":0.000005367114,"about_ca_system_score_gemma":0.000007353139,"threshold_uncertainty_score":0.22539917},"labels":[],"label_agreement":null},{"id":"W2070144710","doi":"10.1109/cnsr.2010.50","title":"Analysis and Implementation of a Simple Method to Add Noise to a Channel Using Non-uniform Sampling","year":2010,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Atlantic Canada Opportunities Agency","keywords":"Variance (accounting); Channel (broadcasting); Sampling (signal processing); Noise (video); Computer science; Simple (philosophy); Algorithm; Statistics; Mathematics; Telecommunications; Artificial intelligence","score_opus":0.03716850048353386,"score_gpt":0.40431595797198217,"score_spread":0.3671474574884483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070144710","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10947416,0.0000010167417,0.89003736,0.00021189723,0.000056864763,0.00015795934,0.000005858105,0.000016968632,0.000037925925],"genre_scores_gemma":[0.15162021,2.714631e-7,0.8479876,0.00034068644,0.00003060047,0.000007953344,8.517107e-7,0.0000040973473,0.000007729504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990569,0.000034126573,0.00023362169,0.0003052457,0.0001590944,0.00021103356],"domain_scores_gemma":[0.9992291,0.00013269992,0.00006727599,0.00028105493,0.00009178076,0.0001981092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007058738,0.0000930891,0.00023362931,0.0003171616,0.00007329965,0.00007589773,0.00025304387,0.000026007141,0.000049946793],"category_scores_gemma":[0.000034964974,0.00007729165,0.00006513475,0.001611574,0.0000076654105,0.00018222633,0.0002826127,0.00006251356,0.0000017995116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003835023,0.000024232007,0.0013482949,0.000009437087,0.00007955941,7.649599e-7,0.0015691416,0.0013735036,0.20993786,0.0012064066,0.0000100904,0.7844369],"study_design_scores_gemma":[0.00023730753,0.00017391503,0.018209986,0.000004695869,0.00009468896,0.000003958072,0.000540899,0.8707525,0.1060789,0.0032799023,0.00036512333,0.00025814143],"about_ca_topic_score_codex":0.002474111,"about_ca_topic_score_gemma":0.00039347797,"teacher_disagreement_score":0.869379,"about_ca_system_score_codex":0.0000108448485,"about_ca_system_score_gemma":0.000023303983,"threshold_uncertainty_score":0.37401325},"labels":[],"label_agreement":null},{"id":"W2070355633","doi":"10.1117/12.558895","title":"On converting numbers to the double-base number system","year":2004,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Base (topology); Implementation; Computer science; Arithmetic; Diophantine equation; Algorithm; Theoretical computer science; Mathematics; Discrete mathematics; Programming language","score_opus":0.014722486056792819,"score_gpt":0.25269303779023833,"score_spread":0.2379705517334455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070355633","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9744857,0.00002072164,0.009425567,0.010956179,0.00063731347,0.0006451049,0.000012583084,0.00017601832,0.0036408217],"genre_scores_gemma":[0.39827058,0.000009382037,0.6001868,0.00066547,0.0004860235,0.0002046216,0.0000012592113,0.000050217885,0.0001256144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974211,2.7265456e-8,0.00064834,0.0005189887,0.00091670855,0.0004948732],"domain_scores_gemma":[0.99804014,0.00023463418,0.0003266694,0.00012250378,0.0010696247,0.00020641641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010250647,0.0003229188,0.00038761678,0.00006313167,0.00017023591,0.00025048925,0.0021516231,0.00012761413,0.000004807858],"category_scores_gemma":[0.00039867806,0.00021761004,0.0005738906,0.00063979503,0.00013310315,0.0004973833,0.00035062636,0.00036458825,0.000016593101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060388516,0.00008758014,0.00004558615,0.00019582653,0.0001649987,2.6526564e-7,0.00033512237,0.00083031174,0.049168024,0.9471333,0.0010118113,0.00096677203],"study_design_scores_gemma":[0.010653546,0.0021325892,0.0011357834,0.0035856715,0.0003811103,0.00024963872,0.006801418,0.22782086,0.6905721,0.03676762,0.01724458,0.002655088],"about_ca_topic_score_codex":0.00003687059,"about_ca_topic_score_gemma":1.1501699e-7,"teacher_disagreement_score":0.9103657,"about_ca_system_score_codex":0.00029420928,"about_ca_system_score_gemma":0.00004485243,"threshold_uncertainty_score":0.887388},"labels":[],"label_agreement":null},{"id":"W2073665305","doi":"10.1016/j.camwa.2010.02.013","title":"MAPLE code for the gamma algorithm for global optimization of uncertain functions in economy and finance","year":2010,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Algorithm; Mathematical optimization; Code (set theory); Monotonic function; Finance; Set (abstract data type); Computer science; Economics","score_opus":0.016541387212247117,"score_gpt":0.2789701868669476,"score_spread":0.26242879965470045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073665305","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006787658,0.000039757222,0.9973453,0.00096039654,0.00007426843,0.0013431627,0.00005553401,0.000030884792,0.00008277419],"genre_scores_gemma":[0.0010045249,0.000009724038,0.99741364,0.000074533775,0.000046832913,0.0014055284,0.000007630102,0.000007763624,0.000029803796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999281,0.000009912013,0.00024669242,0.0002478037,0.000060110146,0.00015450982],"domain_scores_gemma":[0.99852663,0.00072748825,0.00016402766,0.00042127812,0.0001266321,0.000033947377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024429557,0.00010509491,0.00017207835,0.000033717362,0.00014777348,0.000070340335,0.0004209982,0.00003843152,6.491256e-7],"category_scores_gemma":[0.000016854343,0.00007594954,0.00003857588,0.0003267945,0.000100208104,0.00010851573,0.000070514325,0.000066609035,5.088336e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002493432,0.00014671774,0.000025297964,0.000054638043,0.000018727455,8.899018e-8,0.00014274284,0.023974663,0.000010926556,0.4314048,0.00015522176,0.5440637],"study_design_scores_gemma":[0.00034365614,0.00005307903,0.000049395672,0.00001216798,0.000012201623,0.000007965337,0.000031431133,0.9083622,0.0000298255,0.08142475,0.009586555,0.00008678254],"about_ca_topic_score_codex":0.000004277577,"about_ca_topic_score_gemma":0.000012202565,"teacher_disagreement_score":0.88438755,"about_ca_system_score_codex":0.000016572825,"about_ca_system_score_gemma":0.000052171523,"threshold_uncertainty_score":0.3097132},"labels":[],"label_agreement":null},{"id":"W2073762939","doi":"10.1145/2631948.2631964","title":"Computing GCRDs of approximate differential polynomials","year":2014,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Differential (mechanical device); Mathematics; Physics","score_opus":0.01434590155827235,"score_gpt":0.2700452675961688,"score_spread":0.25569936603789645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073762939","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01592673,0.000006434773,0.9776716,0.00018189261,0.0003531326,0.000043316326,3.319814e-7,0.00008791456,0.0057286327],"genre_scores_gemma":[0.48311618,4.8659854e-7,0.5166626,0.00007529242,0.000072921146,4.5195907e-7,1.4983169e-7,0.00000261915,0.00006928591],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991484,0.00011081321,0.00021221716,0.00020026945,0.00014699632,0.00018130103],"domain_scores_gemma":[0.99936223,0.0001663566,0.00008507397,0.00029125653,0.000030225714,0.000064856955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003169418,0.00007848381,0.00020308283,0.00003871011,0.00004301408,0.00004719104,0.00048589415,0.000027269192,0.000028870383],"category_scores_gemma":[0.00004196082,0.00005723534,0.00006091641,0.00015296054,0.000033526292,0.00008366358,0.0002631241,0.000052153882,0.000009283848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013437257,0.000048620568,0.0001778452,0.000012804761,0.0000072751095,3.1953402e-7,0.00007367803,0.0000145044105,0.012317991,0.16870952,0.000082908984,0.8185532],"study_design_scores_gemma":[0.00029737418,0.00010691297,0.0028477341,0.0000125228935,0.0000035069163,0.0000031447642,0.0000065131294,0.93525726,0.049488124,0.010841651,0.00097624375,0.00015899689],"about_ca_topic_score_codex":0.000030190231,"about_ca_topic_score_gemma":1.6483337e-7,"teacher_disagreement_score":0.9352428,"about_ca_system_score_codex":0.000004638939,"about_ca_system_score_gemma":0.000008327522,"threshold_uncertainty_score":0.23339893},"labels":[],"label_agreement":null},{"id":"W2074109325","doi":"10.1145/354880.354899","title":"Embedded ISA support for enhanced floating-point to fixed-point ANSI-C compilation","year":2000,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Citation; Library science; Engineering; Architecture; Compiler; Point (geometry); Computer science; Telecommunications; Operating system; Geography; Archaeology; Mathematics","score_opus":0.01897660976313449,"score_gpt":0.30742453534076214,"score_spread":0.28844792557762766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074109325","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030579264,0.0000038870585,0.98008484,0.0019544382,0.000315628,0.00046661825,0.000007811162,0.00024651375,0.013862319],"genre_scores_gemma":[0.028223412,0.000002052325,0.9629146,0.0030270277,0.00014578467,0.00004429308,0.000007547151,0.0000126861,0.0056226114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984718,0.00006447308,0.0003554645,0.0004981007,0.00022353341,0.00038664884],"domain_scores_gemma":[0.9989644,0.00020296821,0.000056275843,0.0004652318,0.0001045113,0.00020659562],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045705002,0.00016427238,0.0002458731,0.00006056952,0.00013403765,0.00013879628,0.00047178846,0.000050342285,0.001082523],"category_scores_gemma":[0.000078815545,0.00013742165,0.00010504458,0.000380256,0.000019946663,0.00034889468,0.000084991225,0.00007781354,0.00032251034],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021045997,0.00008829615,0.000007883896,0.000010555538,0.000009506132,0.0000021764995,0.00093935896,0.0005104567,0.021132588,0.007496319,0.004285005,0.96549684],"study_design_scores_gemma":[0.0013340544,0.0015268264,0.0011250414,0.00004007634,0.000013094963,0.000015450803,0.0001414187,0.5800713,0.3403524,0.02329586,0.05118873,0.0008958025],"about_ca_topic_score_codex":0.000019296613,"about_ca_topic_score_gemma":0.000003372947,"teacher_disagreement_score":0.964601,"about_ca_system_score_codex":0.000035613775,"about_ca_system_score_gemma":0.000039043854,"threshold_uncertainty_score":0.9998306},"labels":[],"label_agreement":null},{"id":"W2075202684","doi":"10.1016/j.jal.2006.11.001","title":"Error analysis of digital filters using HOL theorem proving","year":2007,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Automated theorem proving; Fixed-point arithmetic; Mathematics; Digital filter; Algorithm; Mathematical proof; Parametric statistics; Fixed point; Filter (signal processing); Floating point; Discrete mathematics; Arithmetic; Computer science; Mathematical analysis","score_opus":0.04357466503073198,"score_gpt":0.3204460977775031,"score_spread":0.2768714327467711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075202684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1007467,0.000025990279,0.8969351,0.00005083385,0.00010972092,0.00004299893,0.0000012243554,0.0000094588495,0.0020779653],"genre_scores_gemma":[0.6016838,0.0000012041667,0.39818925,0.000068554014,0.000049889848,1.2128318e-7,1.5352775e-7,0.0000029515531,0.0000040879772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878645,0.000021463833,0.0005096193,0.00013721053,0.00033884367,0.00020642385],"domain_scores_gemma":[0.998765,0.00023586632,0.0006185444,0.00018894432,0.000088585926,0.00010308068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011253202,0.00009753224,0.0003743125,0.00036970637,0.00004211107,0.00008422169,0.0005257252,0.000044674805,0.000009654378],"category_scores_gemma":[0.000051236257,0.00006647763,0.00021098193,0.0011333314,0.000057905956,0.00024257643,0.00010152727,0.00017588945,0.0000010288254],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001568185,0.0004119476,0.0015957209,0.000030149075,0.0011734206,0.00020021445,0.001251056,0.018299265,0.06701049,0.07884857,0.000030632724,0.8309917],"study_design_scores_gemma":[0.0026510328,0.0017539655,0.023984011,0.00013055257,0.002111155,0.00035720348,0.0028660947,0.59404176,0.056019768,0.31294996,0.0016023272,0.0015321907],"about_ca_topic_score_codex":0.0000015518355,"about_ca_topic_score_gemma":1.6684685e-7,"teacher_disagreement_score":0.82945955,"about_ca_system_score_codex":0.00003804262,"about_ca_system_score_gemma":0.00003481241,"threshold_uncertainty_score":0.2710879},"labels":[],"label_agreement":null},{"id":"W2075451481","doi":"10.1016/j.enbuild.2006.11.008","title":"Applying uncertainty considerations to energy conservation equations","year":2007,"lang":"en","type":"article","venue":"Energy and Buildings","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Monte Carlo method; Computer science; Uncertainty quantification; Conservation of energy; Energy conservation; Mathematical optimization; Uncertainty analysis; Sensitivity analysis; Energy (signal processing); Industrial engineering; Simulation; Engineering; Mathematics; Machine learning; Statistics","score_opus":0.024311162219795335,"score_gpt":0.28167722446178206,"score_spread":0.2573660622419867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075451481","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013773377,0.000076002725,0.99372256,0.0033383577,0.00019827622,0.000045871882,9.469705e-7,0.00009312442,0.0011475035],"genre_scores_gemma":[0.3748707,0.0000131913985,0.61553305,0.009107933,0.00011495071,0.000048305083,0.0000023103344,0.0000058636456,0.00030371107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912184,0.000039369457,0.00019623646,0.00028081556,0.00014016811,0.00022156475],"domain_scores_gemma":[0.99891305,0.0006261632,0.000052280848,0.00017218021,0.00008352256,0.0001528178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004117211,0.00009718252,0.00011148211,0.000113231385,0.00031651853,0.00013747277,0.00013165771,0.00004773897,0.000014586418],"category_scores_gemma":[0.0001916243,0.00008948791,0.000027806705,0.0003960548,0.0000353875,0.00023363218,0.00010682663,0.000045213703,0.0000015897676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014194978,0.000011595369,0.000024763778,8.016277e-7,0.000004544005,0.000003601352,0.000070897135,0.00027694216,0.00386561,0.7615144,0.00046836908,0.23375702],"study_design_scores_gemma":[0.00031965415,0.000121363315,0.00038012746,0.00002834686,0.000009250521,0.000029641651,0.00007300971,0.101395465,0.02109385,0.3066027,0.5695293,0.00041733574],"about_ca_topic_score_codex":0.00074772025,"about_ca_topic_score_gemma":0.00012480123,"teacher_disagreement_score":0.5690609,"about_ca_system_score_codex":0.000022538421,"about_ca_system_score_gemma":0.000030580803,"threshold_uncertainty_score":0.36492112},"labels":[],"label_agreement":null},{"id":"W2075887856","doi":"10.1188/08.onf.449-454","title":"Understanding the Concept of Uncertainty in Patients With Indolent Lymphoma","year":2008,"lang":"en","type":"review","venue":"Oncology nursing forum","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CancerCare Manitoba","funders":"","keywords":"Medicine; Lymphoma; Internal medicine; Oncology; Intensive care medicine; Dermatology; Family medicine","score_opus":0.08595756026008981,"score_gpt":0.3553679361017726,"score_spread":0.26941037584168276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075887856","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004277343,0.75491136,0.2417376,0.00045148993,0.0010507676,0.0006794076,0.000008331565,0.00003229098,0.0011244935],"genre_scores_gemma":[0.00038209022,0.96131456,0.037891638,0.00020108453,0.00007028846,0.000050912466,0.00001603624,0.000039397848,0.000033999946],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99769396,0.00061682676,0.0005153928,0.00041689884,0.00028399852,0.00047292575],"domain_scores_gemma":[0.99818295,0.0006735314,0.00055277173,0.00047451755,0.000046609715,0.000069621514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023687493,0.00028401453,0.0012466522,0.00016403693,0.000150889,0.000021781958,0.0009130949,0.000250157,0.000002558054],"category_scores_gemma":[0.000039754734,0.00016021128,0.00018300611,0.00076262286,0.00056651176,0.00009697501,0.00012777364,0.00030080244,0.0000024052224],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074159384,0.00024333334,0.000023701972,0.00006819089,0.00002824221,0.000009414434,0.00042867035,0.000021635482,3.1377188e-9,0.0077223913,0.00029506147,0.9911519],"study_design_scores_gemma":[0.0020504568,0.0019515271,0.0001964824,0.01281169,0.00011286813,0.00008333161,0.0003260373,0.0009214314,4.696701e-7,0.005614749,0.9753727,0.0005582621],"about_ca_topic_score_codex":0.000014345087,"about_ca_topic_score_gemma":0.0000031441573,"teacher_disagreement_score":0.9905937,"about_ca_system_score_codex":0.0018800372,"about_ca_system_score_gemma":0.00071155495,"threshold_uncertainty_score":0.65332264},"labels":[],"label_agreement":null},{"id":"W2078477494","doi":"10.1109/newcas.2014.6933979","title":"A hybrid arithmetic transform for precision analysis of floating-point polynomial specifications","year":2014,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Affine arithmetic; Interval arithmetic; Saturation arithmetic; Polynomial; Floating point; Algorithm; Affine transformation; Arithmetic; Arbitrary-precision arithmetic; Mathematics; Computer science","score_opus":0.03482807649987794,"score_gpt":0.29225137411768154,"score_spread":0.2574232976178036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078477494","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001439141,0.0000106816005,0.9944625,0.0011483837,0.00013609653,0.00019361044,0.000010051597,0.000051060582,0.0025484592],"genre_scores_gemma":[0.19046427,0.0000033541196,0.8091994,0.00007713275,0.000050968873,0.00001372759,0.0000034200518,0.0000041640646,0.00018354188],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989419,0.000060955506,0.00035085922,0.00030000418,0.00017500158,0.00017126872],"domain_scores_gemma":[0.99865884,0.00061890204,0.00009250593,0.0004473428,0.000100414334,0.00008197157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066913967,0.00008873631,0.00029144896,0.00023635876,0.000072483315,0.000052585718,0.00047396446,0.000022596483,0.00003616796],"category_scores_gemma":[0.00016289145,0.000068164474,0.00026209085,0.00073935837,0.00003162784,0.00014230338,0.000040816325,0.000046359553,0.000004297524],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005913015,0.00008664937,0.000014917779,0.0000056543677,0.000086524924,9.180592e-8,0.00010998609,0.00023442463,0.001801435,0.025160927,0.00018401712,0.97230947],"study_design_scores_gemma":[0.00026494352,0.00018883533,0.0016543958,0.0000047815497,0.000124943,9.3602523e-7,0.000011502652,0.9498481,0.024616532,0.016039828,0.0071195187,0.00012565296],"about_ca_topic_score_codex":0.000040797877,"about_ca_topic_score_gemma":0.0000044425738,"teacher_disagreement_score":0.9721838,"about_ca_system_score_codex":0.000015644855,"about_ca_system_score_gemma":0.000017940147,"threshold_uncertainty_score":0.27796668},"labels":[],"label_agreement":null},{"id":"W2079035898","doi":"10.1109/pacrim.1995.519575","title":"A high speed CORDIC algorithm","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"CORDIC; Rounding; Algorithm; Computer science; Simple (philosophy); Trigonometry; Trigonometric functions; Noise (video); Mathematics; Field-programmable gate array; Artificial intelligence","score_opus":0.027132771953130276,"score_gpt":0.255478677385207,"score_spread":0.22834590543207675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079035898","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017625502,0.00007603264,0.9869984,0.0019209131,0.0005545561,0.000053456275,6.7889727e-7,0.00024960225,0.009970137],"genre_scores_gemma":[0.0042626224,0.000017355047,0.9881559,0.0010700854,0.0001344426,0.0000019389822,1.8956094e-7,0.0000053171825,0.0063521364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911773,0.00004904396,0.00013166317,0.00026880036,0.00019342251,0.00023933697],"domain_scores_gemma":[0.99937886,0.000074326905,0.000030110754,0.00036552662,0.000029446152,0.00012170555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012260154,0.000092009956,0.00013457931,0.000043645796,0.00006140972,0.0000994022,0.00052427914,0.000030060493,0.0007342176],"category_scores_gemma":[0.000020277077,0.00006917019,0.000052641106,0.0004043178,0.000027063232,0.0002091586,0.00014571942,0.00008551296,0.00075752963],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.0151718e-7,0.000038546343,0.000007316166,6.809095e-7,0.000003816881,0.000018341103,0.00002309416,0.0000022300471,0.00008856012,0.018994063,0.0027308597,0.9780924],"study_design_scores_gemma":[0.00032581898,0.00013675315,0.00037311055,0.000004127039,0.0000027192677,0.00003388774,0.0000069154016,0.94304925,0.0015574568,0.022949077,0.031325445,0.00023546319],"about_ca_topic_score_codex":0.000077785066,"about_ca_topic_score_gemma":2.0562612e-7,"teacher_disagreement_score":0.97785693,"about_ca_system_score_codex":0.000011757863,"about_ca_system_score_gemma":0.0000036876531,"threshold_uncertainty_score":0.9736763},"labels":[],"label_agreement":null},{"id":"W2083553720","doi":"10.1109/tcad.2010.2049154","title":"Optimization of Imprecise Circuits Represented by Taylor Series and Real-Valued Polynomials","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Taylor series; Series (stratigraphy); Arbitrary-precision arithmetic; Algorithm; Floating point; Interval arithmetic; Function (biology); Implementation; Representation (politics); Mathematics; Fixed-point arithmetic; Point (geometry); Double-precision floating-point format; Selection (genetic algorithm); Upper and lower bounds; Branch and bound; Mathematical optimization; Computer science; Artificial intelligence","score_opus":0.026209392058982654,"score_gpt":0.25936216038812093,"score_spread":0.23315276832913828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083553720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00839987,0.00014625626,0.9888316,0.000056355322,0.001633732,0.00064779585,0.00008790576,0.00013415606,0.000062360145],"genre_scores_gemma":[0.8504356,0.0002490931,0.14899632,0.000028725166,0.00006595911,0.0000555611,0.0000055228534,0.000033503547,0.00012972225],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972265,0.00054442306,0.0009167266,0.00065698114,0.00035133623,0.00030407382],"domain_scores_gemma":[0.9977687,0.00051477,0.00044154853,0.00062016584,0.00043072095,0.00022412036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008492393,0.00033327757,0.000751734,0.0003098967,0.0001751048,0.00020812634,0.00045322452,0.00023670506,0.000009728437],"category_scores_gemma":[0.000030569776,0.0002783406,0.0001005091,0.00067561306,0.0002063946,0.00051212235,0.000007851487,0.0003430942,0.0000010300593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066166634,0.00041433296,0.000020314508,0.00016311306,0.00022959235,0.000010587495,0.0006246701,0.05120646,0.4968512,0.0016407967,0.0002648897,0.44850788],"study_design_scores_gemma":[0.00084527774,0.0010384175,0.00003445012,0.00017362017,0.000042814678,0.00012661485,0.00009462438,0.896185,0.1009097,0.00015606587,0.00005355618,0.00033985393],"about_ca_topic_score_codex":0.00078156346,"about_ca_topic_score_gemma":0.0000034360583,"teacher_disagreement_score":0.8449785,"about_ca_system_score_codex":0.000026674943,"about_ca_system_score_gemma":0.00008850746,"threshold_uncertainty_score":0.99996686},"labels":[],"label_agreement":null},{"id":"W2083801841","doi":"10.1109/aspdac.2012.6165061","title":"Fixed-point accuracy analysis of datapaths with mixed CORDIC and polynomial computations","year":2012,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"CORDIC; Datapath; Polynomial; Mathematics; Taylor series; Floating point; Fixed point; Algorithm; Fixed-point arithmetic; Lookup table; Computer science; Arithmetic; Parallel computing; Field-programmable gate array","score_opus":0.021126978122245385,"score_gpt":0.2937076062067979,"score_spread":0.2725806280845525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083801841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055087823,0.00006783938,0.94394296,0.00027302036,0.00009904199,0.000060605445,0.000009451779,0.00003802801,0.00042124477],"genre_scores_gemma":[0.50647175,0.0000039258734,0.49338147,0.000090042086,0.000020904521,0.0000021177916,0.000003963985,0.000002226262,0.000023574552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992049,0.00008217785,0.0001819167,0.00018996281,0.0001492295,0.0001918558],"domain_scores_gemma":[0.99895656,0.0004337882,0.00009975464,0.0003217358,0.000046796078,0.00014136179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027329504,0.000087111184,0.00024579724,0.00015689095,0.00006161975,0.000051115225,0.00025727716,0.00002047506,0.000028378114],"category_scores_gemma":[0.000053191376,0.0000590495,0.0000483923,0.0010356009,0.00006777572,0.0005088035,0.00018430615,0.00005553495,0.0000036282727],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020569621,0.00041800045,0.04314116,0.000020548985,0.0009149432,0.0000044090407,0.001298777,0.000548925,0.0011885002,0.027053555,0.0011206496,0.92427],"study_design_scores_gemma":[0.00067673455,0.00026400393,0.352937,0.000012955617,0.00049922446,0.000017735892,0.00024849313,0.64018923,0.0022828009,0.0004451457,0.002042411,0.00038425805],"about_ca_topic_score_codex":0.00018119547,"about_ca_topic_score_gemma":0.000009267914,"teacher_disagreement_score":0.9238857,"about_ca_system_score_codex":0.0000073791416,"about_ca_system_score_gemma":0.000019492163,"threshold_uncertainty_score":0.24079686},"labels":[],"label_agreement":null},{"id":"W2084363214","doi":"10.1109/hldvt.2010.5496667","title":"Analysis of range and precision for fixed-point linear arithmetic circuits with feedbacks","year":2010,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Heuristics; Fixed-point arithmetic; Electronic circuit; Algorithm; Range (aeronautics); Infinite impulse response; Filter (signal processing); Floating point; Digital filter","score_opus":0.014945658344899446,"score_gpt":0.28512894158239543,"score_spread":0.27018328323749596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084363214","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040245097,0.000022295659,0.95878124,0.00028129056,0.00009242726,0.0001628149,0.000004591001,0.00003248304,0.0003777776],"genre_scores_gemma":[0.2005568,0.0000044700923,0.79916,0.00008336055,0.00002652899,0.000011440461,8.85506e-7,0.0000046430623,0.00015184438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915504,0.000030877214,0.00018304262,0.00030891327,0.00017027711,0.000151851],"domain_scores_gemma":[0.9988923,0.0004335027,0.000077153745,0.00037024225,0.00013075523,0.00009604847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047791388,0.00009255627,0.00028432795,0.00016568454,0.000047228743,0.000047517016,0.0002823327,0.000046426303,0.000023796252],"category_scores_gemma":[0.00011031068,0.000058600137,0.00008080931,0.0008028411,0.00005736019,0.00014946032,0.00008684971,0.00009118323,0.0000011357068],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000103199145,0.00008939238,0.0029216628,0.000017464758,0.00017137628,0.0000015699718,0.0001947446,0.000046899593,0.00460988,0.006704295,0.000025246234,0.98520714],"study_design_scores_gemma":[0.000862364,0.0005876278,0.036362857,0.000014734516,0.00027684457,0.000008284642,0.000026999134,0.94593304,0.009902636,0.0045621037,0.0011929907,0.00026948782],"about_ca_topic_score_codex":0.000033789154,"about_ca_topic_score_gemma":0.000022096365,"teacher_disagreement_score":0.98493767,"about_ca_system_score_codex":0.0000031440043,"about_ca_system_score_gemma":0.000016291344,"threshold_uncertainty_score":0.23896442},"labels":[],"label_agreement":null},{"id":"W2085969366","doi":"10.1023/b:numa.0000049478.42605.cf","title":"Interval Arithmetic, Affine Arithmetic, Taylor Series Methods: Why, What Next?","year":2004,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Affine arithmetic; Interval arithmetic; Mathematics; Taylor series; Interval (graph theory); Arithmetic; Affine transformation; Theory of computation; Arbitrary-precision arithmetic; Computation; Series (stratigraphy); Range (aeronautics); Saturation arithmetic; Discrete mathematics; Algebra over a field; Pure mathematics; Algorithm; Combinatorics; Mathematical analysis","score_opus":0.03378618326497619,"score_gpt":0.32408456002474917,"score_spread":0.290298376759773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085969366","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010879361,0.0023237334,0.97340244,0.018366454,0.0037743733,0.00047836752,0.000007801528,0.00091392983,0.00062413426],"genre_scores_gemma":[0.0013578013,0.00059020636,0.992246,0.004336316,0.00086858094,0.00014885564,0.000011062318,0.00009322807,0.00034797762],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9935613,0.00082725193,0.001162349,0.0017895148,0.0011035413,0.001556022],"domain_scores_gemma":[0.9961096,0.00064382143,0.00035425578,0.0016186669,0.00035284515,0.000920783],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001591251,0.0008856406,0.0013148857,0.00034767506,0.00043896952,0.002886455,0.0027195977,0.00033311904,0.00024836732],"category_scores_gemma":[0.00059835915,0.00074542384,0.0005861482,0.002452269,0.0004517789,0.0067482092,0.0013286468,0.001041623,0.00041737733],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025065568,0.00051221944,0.0000051917855,0.000025975613,0.00009315046,0.00018068959,0.0004295864,0.00018140725,0.0014613374,0.020145958,0.00016057638,0.97677886],"study_design_scores_gemma":[0.0047848676,0.004047797,0.0006438384,0.00040526883,0.00019134374,0.001776326,0.0016726826,0.19050181,0.058460258,0.31617266,0.4169583,0.0043848264],"about_ca_topic_score_codex":0.00027651613,"about_ca_topic_score_gemma":0.0000038989015,"teacher_disagreement_score":0.972394,"about_ca_system_score_codex":0.00028555232,"about_ca_system_score_gemma":0.00016968319,"threshold_uncertainty_score":0.9994997},"labels":[],"label_agreement":null},{"id":"W2088111445","doi":"10.1109/tcad.2013.2238290","title":"On the Fixed-Point Accuracy Analysis and Optimization of Polynomial Specifications","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Polynomial; Robustness (evolution); Signal-flow graph; Algorithm; Quantization (signal processing); Mathematics; Mean squared error; Fixed point; Mathematical optimization; Computer science; Statistics","score_opus":0.04890648298728648,"score_gpt":0.2505818347307598,"score_spread":0.2016753517434733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088111445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029566037,0.000063593245,0.99557334,0.00027309667,0.00041599432,0.00059908733,0.000022031274,0.00005232889,0.000043941425],"genre_scores_gemma":[0.8819149,0.00008232493,0.117792614,0.00006583791,0.000029099094,0.00006461645,0.0000017193809,0.000010651244,0.00003821957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980214,0.00052655704,0.0006172899,0.0003982649,0.0002535127,0.0001829652],"domain_scores_gemma":[0.9970003,0.0017357434,0.00031570988,0.00052111887,0.00031845982,0.00010868552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050434633,0.00021052982,0.00045921077,0.00040547413,0.0001876054,0.00023110538,0.0003918181,0.000089852896,0.00003141595],"category_scores_gemma":[0.000026767462,0.00013678682,0.00012394578,0.0012309504,0.00011741327,0.0002804877,0.0000041086037,0.00020306266,0.000004063936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012623889,0.00028558949,0.00000852037,0.00003109738,0.00050591433,0.0000013700017,0.00058744417,0.75671196,0.005803202,0.0043457435,0.00028467324,0.23142189],"study_design_scores_gemma":[0.00023211207,0.0003962647,0.00014395833,0.00008196868,0.00007854343,0.000009798953,0.00013013069,0.9922503,0.0062783663,0.00023627297,0.000013583979,0.00014868643],"about_ca_topic_score_codex":0.00049925403,"about_ca_topic_score_gemma":0.0000014210212,"teacher_disagreement_score":0.8789583,"about_ca_system_score_codex":0.000032552052,"about_ca_system_score_gemma":0.000050736286,"threshold_uncertainty_score":0.5578005},"labels":[],"label_agreement":null},{"id":"W2088144429","doi":"10.1109/iscas.2012.6272100","title":"Verification of fixed-point datapaths with comparator units using Constrained Arithmetic Transform (CAT)","year":2012,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Comparator; Fixed-point arithmetic; Arithmetic; Computer science; Range (aeronautics); Arbitrary-precision arithmetic; Adder; Polynomial; Algorithm; Mathematics; Parallel computing; Floating point; Engineering","score_opus":0.06349508672955911,"score_gpt":0.30127826310572176,"score_spread":0.23778317637616264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088144429","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023949675,0.00003890104,0.9741662,0.00019518792,0.00012672499,0.00015994807,0.000008590384,0.000058318776,0.0012964201],"genre_scores_gemma":[0.43389723,0.0000019992478,0.56598705,0.000067522284,0.00002240009,0.0000029323555,0.0000026002263,0.0000042067463,0.000014039487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990348,0.00006896016,0.00024158726,0.00019000034,0.00020287692,0.00026177664],"domain_scores_gemma":[0.9991541,0.00009909146,0.00009307108,0.00038963166,0.00011623957,0.00014786485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037384543,0.00011780782,0.000211317,0.00006163875,0.000059523525,0.00003683485,0.00035214014,0.0000330091,0.000026348951],"category_scores_gemma":[0.000021736349,0.00008344348,0.000024755189,0.00065058697,0.0001132203,0.00059158617,0.00003798391,0.0000644028,0.0000070826122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054453256,0.00091445673,0.0019708753,0.00014666283,0.0001254311,0.0000069904668,0.004866434,0.00021932863,0.099364005,0.3589089,0.00014151334,0.53328097],"study_design_scores_gemma":[0.0016514875,0.00058126025,0.005130163,0.00011396287,0.00007222633,0.00018781789,0.0008435641,0.76037925,0.22414823,0.0018336712,0.0042459145,0.0008124507],"about_ca_topic_score_codex":0.00006089973,"about_ca_topic_score_gemma":0.0000010899911,"teacher_disagreement_score":0.7601599,"about_ca_system_score_codex":0.000023076993,"about_ca_system_score_gemma":0.00008796994,"threshold_uncertainty_score":0.34027267},"labels":[],"label_agreement":null},{"id":"W2089329507","doi":"10.1016/j.jalgor.2004.01.002","title":"Simple constant amortized time generation of fixed length numeric partitions","year":2004,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Amortized analysis; Simple (philosophy); Constant (computer programming); Mathematics; Combinatorics; Algorithm; Discrete mathematics; Data structure; Computer science","score_opus":0.03443542798261186,"score_gpt":0.29426492655903175,"score_spread":0.2598294985764199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089329507","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022207491,0.00022974044,0.9758301,0.0008680964,0.0005279493,0.0000914634,0.000008755589,0.000026716649,0.00020971781],"genre_scores_gemma":[0.13225445,0.00008497918,0.86703986,0.00016969013,0.00038867406,0.0000028952497,0.0000022675988,0.0000113154065,0.000045873043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981898,0.00013066821,0.0007880934,0.0001752757,0.00047327857,0.0002428801],"domain_scores_gemma":[0.99837697,0.00011295691,0.00068207335,0.00027350517,0.00037377144,0.00018069969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006382685,0.00014097904,0.00042101703,0.00015377169,0.00009855078,0.00007326952,0.00046975331,0.000056085722,0.00006307297],"category_scores_gemma":[0.00014749785,0.0001108942,0.00021066777,0.0005575386,0.00008764233,0.0005306484,0.000071278955,0.00020504942,0.000020570136],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056058427,0.0016239665,0.00021371765,0.00003919534,0.00043390697,0.000388171,0.0012603272,0.015010274,0.26560253,0.02072214,0.003079651,0.69157004],"study_design_scores_gemma":[0.011209761,0.0054477975,0.0037825939,0.0003010144,0.0002696387,0.0017168402,0.00025805202,0.47952434,0.29717255,0.18363744,0.015190444,0.0014895503],"about_ca_topic_score_codex":0.000019672236,"about_ca_topic_score_gemma":5.9828295e-7,"teacher_disagreement_score":0.6900805,"about_ca_system_score_codex":0.0000697555,"about_ca_system_score_gemma":0.00022801985,"threshold_uncertainty_score":0.45221344},"labels":[],"label_agreement":null},{"id":"W2089902593","doi":"10.1109/tvlsi.2008.2003004","title":"Time-Efficient Single Constant Multiplication Based on Overlapping Digit Patterns","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Multiplication (music); Adder; Constant (computer programming); Computer science; Heuristic; Algorithm; Multiplication algorithm; Arithmetic; Divide and conquer algorithms; Parallel computing; Mathematics; Combinatorics; Artificial intelligence; Binary number","score_opus":0.01695558374234841,"score_gpt":0.25498225957597764,"score_spread":0.23802667583362924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089902593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008184424,0.000017468314,0.98723435,0.0006149078,0.0015390181,0.0006661225,0.00011831477,0.00043899598,0.0011864019],"genre_scores_gemma":[0.9851284,0.000004044664,0.0136381695,0.00058213883,0.000103294165,0.000090500806,0.0000148969175,0.000020759373,0.00041779215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716216,0.00032422348,0.000637602,0.0007435359,0.0006781152,0.00045433137],"domain_scores_gemma":[0.99820036,0.00032693817,0.00022861174,0.0008115939,0.00022878675,0.00020368851],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004731781,0.00034204824,0.0003809612,0.0003278212,0.0003873824,0.0004627125,0.00046141626,0.00016049288,0.000035734607],"category_scores_gemma":[0.000023401008,0.0002934628,0.00023458693,0.0006749728,0.00004498462,0.00041902252,0.0000025196564,0.00035717193,0.00020260233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014597052,0.0053790077,0.000023175558,0.00006371966,0.000060619663,0.000024881992,0.0012291778,0.40901563,0.07730369,0.0025634805,0.00036315384,0.5038275],"study_design_scores_gemma":[0.00062805787,0.000534347,0.00009957854,0.00033114292,0.000013421412,0.000011072031,0.00014473544,0.96305245,0.033752777,0.00004770381,0.0010408252,0.00034389822],"about_ca_topic_score_codex":0.00003291374,"about_ca_topic_score_gemma":0.0000071111426,"teacher_disagreement_score":0.97694397,"about_ca_system_score_codex":0.00035110605,"about_ca_system_score_gemma":0.00006881002,"threshold_uncertainty_score":0.9999518},"labels":[],"label_agreement":null},{"id":"W2091085418","doi":"10.1051/ro:2008007","title":"La différentiation automatique et son utilisation en optimisation","year":2008,"lang":"fr","type":"article","venue":"RAIRO - Operations Research","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Sketch; Computer science; Software; Focus (optics); Automatic differentiation; Software engineering; Key (lock); Ideal (ethics); Operations research; Engineering; Computer security; Programming language; Algorithm; Epistemology; Philosophy","score_opus":0.14849846666276098,"score_gpt":0.4375453487014911,"score_spread":0.2890468820387301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091085418","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054151997,0.00069207855,0.9108064,0.027967384,0.0007472297,0.0007018453,0.000019895708,0.00015695383,0.0047561703],"genre_scores_gemma":[0.43561482,0.0013841641,0.54643625,0.0003017075,0.00051475095,0.00022903009,0.00007339208,0.000039645995,0.015406207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98967093,0.0072736843,0.0005291164,0.00067398493,0.0012144725,0.00063778996],"domain_scores_gemma":[0.99674547,0.0014979739,0.000053118652,0.00065543555,0.00081657176,0.00023143791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055301534,0.00023226299,0.00025656566,0.00042582978,0.0012321761,0.0008152724,0.0006349118,0.00034020853,0.00041260477],"category_scores_gemma":[0.0017244195,0.00023497915,0.00011426915,0.0016134555,0.0004309575,0.002244415,0.00033807955,0.0010923896,0.00046473191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012762062,0.0008924981,0.00025020557,0.0000872534,0.00005107902,0.000054316788,0.024837334,0.028507542,0.0065792943,0.35341433,0.0042152023,0.5810982],"study_design_scores_gemma":[0.00043377242,0.00021615266,0.018492028,0.0000878688,0.00000757008,0.00009621203,0.000257261,0.93660533,0.0035256946,0.0024375771,0.037572894,0.0002676319],"about_ca_topic_score_codex":0.0014338881,"about_ca_topic_score_gemma":0.00013523496,"teacher_disagreement_score":0.9080978,"about_ca_system_score_codex":0.00037320465,"about_ca_system_score_gemma":0.0009865764,"threshold_uncertainty_score":0.95821714},"labels":[],"label_agreement":null},{"id":"W2091144177","doi":"10.1117/12.452047","title":"Digital filtering using the multidimensional logarithmic number system","year":2002,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Logarithm; Digital signal processing; Reduction (mathematics); Exponential function; Digital filter; Generalization; Representation (politics); Binary number; Filter (signal processing); Massively parallel; Algorithm; Process (computing); Parallel computing; Computational science; Computer hardware; Arithmetic; Mathematics","score_opus":0.020347236851406877,"score_gpt":0.2453737323243149,"score_spread":0.225026495472908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091144177","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9808292,0.00007954586,0.013623718,0.0017711392,0.0005322466,0.00041246036,0.000027667831,0.000149838,0.0025741889],"genre_scores_gemma":[0.19613929,0.000021031101,0.80290145,0.00010462462,0.00048266363,0.000063027444,0.0000013377893,0.00004533265,0.00024121956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760115,3.135945e-8,0.00064720464,0.00046329058,0.0008267411,0.0004616035],"domain_scores_gemma":[0.9981343,0.0002679947,0.00036215165,0.00010546424,0.000995406,0.00013466224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005590982,0.0003176159,0.00038417522,0.000058773836,0.00018295828,0.0003336816,0.0016499058,0.00013518338,0.000011546263],"category_scores_gemma":[0.0003294033,0.00021709262,0.00061218144,0.00045307042,0.00021864845,0.0010311321,0.00051435863,0.00034471636,0.000005448177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016570277,0.00013822404,0.00023590612,0.0002968637,0.00032561703,5.316887e-7,0.0002507554,0.00032613953,0.22737513,0.7652701,0.0011794963,0.004584642],"study_design_scores_gemma":[0.0006662865,0.00012561803,0.00020766623,0.00033569112,0.00006197936,0.0001422111,0.0007302782,0.9646834,0.02765244,0.0008291299,0.0041696155,0.0003956741],"about_ca_topic_score_codex":0.000007903173,"about_ca_topic_score_gemma":1.4643816e-8,"teacher_disagreement_score":0.96435726,"about_ca_system_score_codex":0.00017400236,"about_ca_system_score_gemma":0.000016222159,"threshold_uncertainty_score":0.885278},"labels":[],"label_agreement":null},{"id":"W2093566518","doi":"10.1109/synasc.2013.25","title":"Software Implementation of Numerical Algorithms in Arbitrary Precision","year":2013,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"MATLAB; Computer science; Algebraic number; Class (philosophy); Software; Algorithm; Numerical analysis; Theoretical computer science; Mathematics; Programming language; Artificial intelligence","score_opus":0.01633220827336522,"score_gpt":0.31391695572249273,"score_spread":0.2975847474491275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093566518","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010616232,0.000039796636,0.98815566,0.00045632405,0.00013377325,0.00020146133,8.813294e-7,0.000060854283,0.00033498628],"genre_scores_gemma":[0.056261726,0.00000805943,0.9434075,0.00021499205,0.000023944696,0.000029219758,0.0000011360823,0.000004762017,0.00004866111],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9989196,0.00008803255,0.00031519812,0.0002512732,0.00022771722,0.00019820115],"domain_scores_gemma":[0.9993811,0.00017520096,0.00006902768,0.0002491502,0.000053048032,0.0000724342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020684404,0.00008554611,0.00016356976,0.000090806694,0.000020039424,0.000042739422,0.0003868379,0.00003407795,0.00038272148],"category_scores_gemma":[0.00003199567,0.00006559471,0.000046695768,0.00054994976,0.00001702316,0.0005509778,0.00016018738,0.00008500668,0.00004928206],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.711704e-7,0.000044482447,0.003359983,0.0000036460829,0.0000022406214,0.0000011425697,0.00010169268,0.000005285931,0.00025607567,0.00219469,0.0001749436,0.9938554],"study_design_scores_gemma":[0.0012657688,0.00058978895,0.56816995,0.000038998343,0.0000042044876,0.000014056669,0.0003880768,0.24535638,0.02644042,0.15566304,0.00154327,0.0005260466],"about_ca_topic_score_codex":0.0007571538,"about_ca_topic_score_gemma":0.0000021035485,"teacher_disagreement_score":0.9933294,"about_ca_system_score_codex":0.000018401197,"about_ca_system_score_gemma":0.00003008472,"threshold_uncertainty_score":0.4190532},"labels":[],"label_agreement":null},{"id":"W2095308140","doi":"10.1007/s00283-010-9158-3","title":"A World Record in Atlantic City and the Length of the Shooter’s Hand at Craps","year":2010,"lang":"en","type":"article","venue":"The Mathematical Intelligencer","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Geography","score_opus":0.03028968011135075,"score_gpt":0.29318468675765796,"score_spread":0.2628950066463072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095308140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4672454,0.000099454475,0.5185739,0.0099677835,0.00052419014,0.00054858153,0.000001103304,0.000025927362,0.003013685],"genre_scores_gemma":[0.95240635,0.000025876141,0.046019472,0.00040907392,0.00006006767,0.000029048633,4.52547e-8,0.000007677086,0.0010423977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986758,0.0002579813,0.0003645377,0.0002146033,0.00025884752,0.00022821639],"domain_scores_gemma":[0.99691814,0.0021260828,0.00010971375,0.00075921026,0.00003502898,0.00005184106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015780203,0.00012893292,0.00026583747,0.000034646633,0.00016719481,0.000103243176,0.0012384632,0.000042276348,0.00019956588],"category_scores_gemma":[0.00049355853,0.000047205936,0.00010144793,0.00047353393,0.0010569487,0.00006961507,0.0007378314,0.0004309258,0.000023781115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061640814,0.00017139055,0.0020207637,0.00006395072,0.000036583435,0.0000032850492,0.006634491,0.0000052833834,0.0016975754,0.80184186,0.00023980733,0.18722336],"study_design_scores_gemma":[0.0001905809,0.000030347343,0.0017489265,0.00008250015,0.000017690432,0.000027213198,0.00006904711,0.088593215,0.00929492,0.898374,0.0014389587,0.00013255657],"about_ca_topic_score_codex":0.00012093389,"about_ca_topic_score_gemma":0.00033056785,"teacher_disagreement_score":0.48516095,"about_ca_system_score_codex":0.000011390516,"about_ca_system_score_gemma":0.000016368846,"threshold_uncertainty_score":0.3894371},"labels":[],"label_agreement":null},{"id":"W2096180483","doi":"10.1155/asp.2005.3015","title":"A Low-Power Two-Digit Multi-dimensional Logarithmic Number System Filterbank Architecture for a Digital Hearing Aid","year":2005,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Filter bank; Computer science; Logarithm; Multiplication (music); Reduction (mathematics); Numerical digit; Arithmetic; Dynamic range; Computer hardware; Mathematics; Telecommunications","score_opus":0.01895903974653008,"score_gpt":0.3188527664335761,"score_spread":0.299893726687046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096180483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009005287,0.0011744444,0.98764384,0.00056591205,0.0003980415,0.00024274971,0.000007087038,0.00012327735,0.0008393811],"genre_scores_gemma":[0.5261471,0.000004901904,0.47291973,0.0003977387,0.00041853185,0.000015581565,8.67086e-7,0.00002662716,0.00006889451],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729174,0.00011464321,0.00070353196,0.0005975883,0.0005996679,0.000692805],"domain_scores_gemma":[0.9985497,0.00041412862,0.00039098915,0.00020123541,0.00017530941,0.00026862283],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005502464,0.00035422097,0.00044284467,0.00020335117,0.00037610103,0.00093691144,0.0007462815,0.000072169976,0.00001521197],"category_scores_gemma":[0.00011020772,0.0002763169,0.0001899811,0.00048125605,0.00008466018,0.0027075554,0.00014999796,0.00082494825,0.000030224186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108344764,0.00023056817,0.00022018862,0.0000921794,0.000012046578,0.0001313462,0.00023202812,0.04218425,0.0005604936,0.00035477956,0.000019233448,0.95585454],"study_design_scores_gemma":[0.007911383,0.0009704196,0.00027763768,0.005626273,0.000021391343,0.0055435873,0.00022594546,0.92052627,0.008390765,0.0122708725,0.03651895,0.0017164899],"about_ca_topic_score_codex":5.7812065e-7,"about_ca_topic_score_gemma":0.0000010545359,"teacher_disagreement_score":0.95413804,"about_ca_system_score_codex":0.00025241717,"about_ca_system_score_gemma":0.00014032195,"threshold_uncertainty_score":0.9999689},"labels":[],"label_agreement":null},{"id":"W2096263144","doi":"10.1109/tvlsi.2010.2048588","title":"CVNS-Based Storage and Refreshing Scheme for a Multi-Valued Dynamic Memory","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Noise margin; Computer science; Dynamic random-access memory; Chip; CMOS; Computer data storage; Electronic engineering; Noise (video); Electronic circuit; Scheme (mathematics); Margin (machine learning); Voltage; Computer hardware; Electrical engineering; Semiconductor memory; Engineering; Transistor; Telecommunications; Mathematics; Artificial intelligence","score_opus":0.024249072349999786,"score_gpt":0.3058745595877071,"score_spread":0.2816254872377073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096263144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02396278,0.00006219301,0.96998197,0.0001913364,0.004500849,0.00082159415,0.00012094021,0.00030626185,0.000052050404],"genre_scores_gemma":[0.564868,0.0000050984,0.43399864,0.00013986434,0.0000805339,0.00028534466,0.000006875735,0.000028718438,0.0005869585],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777734,0.0002486291,0.0005063682,0.00068301364,0.0003671651,0.00041745947],"domain_scores_gemma":[0.99846816,0.0002613412,0.00017730061,0.00065040827,0.00022542136,0.00021739308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001067439,0.00030533888,0.0003824078,0.00026975936,0.0005263456,0.00040999672,0.000444949,0.00022752983,0.0000137528195],"category_scores_gemma":[0.00004747964,0.0002631905,0.0001989123,0.0004050062,0.00007749858,0.00068088964,0.000004260362,0.0006189604,0.00001950562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035505983,0.0030279804,0.000042291515,0.0006705728,0.0002738619,0.000040684336,0.003945516,0.012392584,0.67222553,0.012120889,0.0005782332,0.29432678],"study_design_scores_gemma":[0.0012349747,0.00017589511,0.000043389195,0.00010993095,0.000019406616,0.000018188297,0.00027731044,0.976248,0.020689683,0.00007301757,0.00079842587,0.00031176067],"about_ca_topic_score_codex":0.000121658624,"about_ca_topic_score_gemma":0.0003421234,"teacher_disagreement_score":0.96385545,"about_ca_system_score_codex":0.0000993237,"about_ca_system_score_gemma":0.00009469873,"threshold_uncertainty_score":0.99998206},"labels":[],"label_agreement":null},{"id":"W2096343316","doi":"10.1049/ip-cds:20040500","title":"Phase to sinusoid amplitude conversion techniques for direct digital frequency synthesis","year":2004,"lang":"en","type":"article","venue":"IEE Proceedings - Circuits Devices and Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Amplitude; Sine; Sine wave; Mathematics; Phase (matter); Algorithm; Computer science; Electronic engineering; Control theory (sociology); Physics; Optics; Engineering; Electrical engineering; Geometry; Artificial intelligence","score_opus":0.028906789993339427,"score_gpt":0.2931598722116165,"score_spread":0.26425308221827704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096343316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06785715,0.00086172245,0.92284137,0.00072370266,0.000658659,0.0015713925,0.00006399036,0.00066793355,0.0047540516],"genre_scores_gemma":[0.9621932,0.000017393208,0.037001338,0.00019350214,0.00024353295,0.00028592278,0.0000011558843,0.000022094706,0.000041866566],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998216,0.0000105894305,0.00038219543,0.0006736221,0.00029523217,0.0004224029],"domain_scores_gemma":[0.99892503,0.00017975066,0.00017972518,0.00016606675,0.00026167164,0.00028774716],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00049491547,0.00025110395,0.000432122,0.0001520836,0.00022650747,0.0012864036,0.00056547613,0.00009932109,8.768561e-7],"category_scores_gemma":[0.00019242111,0.00020677588,0.000091060756,0.0004203984,0.000040882365,0.0011011628,0.00010718993,0.00008257631,0.000009933973],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021605843,0.0006862644,0.001753049,0.0018605397,0.00013534524,0.000022533,0.002905948,0.0000052373825,0.04748181,0.075347155,0.00039057483,0.86938995],"study_design_scores_gemma":[0.014112274,0.019379225,0.0025280784,0.0129684275,0.00057210756,0.0017358433,0.007292472,0.03824618,0.38653815,0.079433955,0.42514092,0.012052389],"about_ca_topic_score_codex":0.00008378865,"about_ca_topic_score_gemma":6.6232553e-7,"teacher_disagreement_score":0.89433604,"about_ca_system_score_codex":0.00008290513,"about_ca_system_score_gemma":0.000037069047,"threshold_uncertainty_score":0.9997504},"labels":[],"label_agreement":null},{"id":"W2097232115","doi":"10.1109/newcas.2004.1359116","title":"Carry free, bit parallel approximate squarers with linear complexity and constant delay","year":2004,"lang":"en","type":"article","venue":"The 2nd Annual IEEE Northeast Workshop on Circuits and Systems, 2004. NEWCAS 2004.","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Parameterized complexity; Constant (computer programming); Function (biology); Boolean function; Bit (key); Computer science; Simple (philosophy); Algorithm; Mathematics; Lookup table; Arithmetic","score_opus":0.04791621092080614,"score_gpt":0.2789545173268937,"score_spread":0.23103830640608755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097232115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08656843,0.0066705695,0.89711213,0.0037354943,0.0013035599,0.0017713277,0.00032791216,0.00045203653,0.0020585451],"genre_scores_gemma":[0.9805051,0.00022469627,0.016943092,0.00092871103,0.0006479557,0.000089991314,0.000011038277,0.00008414334,0.00056528964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961339,0.0004007454,0.0007032584,0.0010414058,0.0007715645,0.0009490998],"domain_scores_gemma":[0.9973027,0.0003503959,0.0003353701,0.0012025856,0.00024601552,0.0005629022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010520173,0.0006310709,0.0008496477,0.00015311503,0.00079863204,0.00047990697,0.000981874,0.00019536428,0.0000064730784],"category_scores_gemma":[0.000046797762,0.00038888695,0.000109970904,0.0007415326,0.0007705793,0.00045473452,0.00017114369,0.00062315044,0.000020155161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083037926,0.0024552974,0.004852893,0.0012079021,0.0014344611,0.0024164089,0.025229191,0.20331292,0.00034343707,0.36794704,0.0052168537,0.38475323],"study_design_scores_gemma":[0.064077586,0.014303264,0.015827488,0.015026317,0.0013824058,0.025800405,0.062761866,0.57150733,0.00053032715,0.11673041,0.09066595,0.02138667],"about_ca_topic_score_codex":0.00091210235,"about_ca_topic_score_gemma":0.00013967938,"teacher_disagreement_score":0.89393663,"about_ca_system_score_codex":0.000092778806,"about_ca_system_score_gemma":0.00018128207,"threshold_uncertainty_score":0.9998563},"labels":[],"label_agreement":null},{"id":"W2097345549","doi":"10.1109/itcc.2000.844266","title":"Parallel real-time numerical computation: beyond speedup. III","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Queen's University","funders":"","keywords":"Speedup; Computer science; Computation; Parallel computing; Parallel algorithm; Process (computing); Algorithm; Cryptography; Programming language","score_opus":0.026756783680449505,"score_gpt":0.2805241409058742,"score_spread":0.2537673572254247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097345549","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024211242,0.000042029253,0.8875664,0.0033891017,0.00024089895,0.00008894966,5.211895e-7,0.00032374397,0.10810627],"genre_scores_gemma":[0.007293133,0.000027484004,0.9828256,0.0009371192,0.00015809046,0.0000058636138,0.0000011522466,0.000009814645,0.008741791],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985563,0.00010364279,0.0002652701,0.00042139433,0.00031771464,0.00033563309],"domain_scores_gemma":[0.99912375,0.00019955191,0.00006646178,0.0003431904,0.00005517607,0.00021186171],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00017487966,0.00015399948,0.00024379692,0.000052771582,0.00012104499,0.00015120136,0.00055879814,0.000052258336,0.0011178133],"category_scores_gemma":[0.000019740626,0.00012345657,0.00009062319,0.00053322356,0.000047428824,0.0003146576,0.00019055874,0.00011552621,0.0017033523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040875398,0.00030463905,0.000064136155,0.00000526022,0.000028363997,0.00007546786,0.0003516371,0.00082503003,0.00039609612,0.08358764,0.046422053,0.8679356],"study_design_scores_gemma":[0.00038947316,0.00012089107,0.00046154694,0.0000033479419,0.000003540562,0.000035683865,0.000007909477,0.97387934,0.00009704241,0.016482696,0.008273812,0.0002447353],"about_ca_topic_score_codex":0.00005213372,"about_ca_topic_score_gemma":1.3713442e-7,"teacher_disagreement_score":0.9730543,"about_ca_system_score_codex":0.000022571632,"about_ca_system_score_gemma":0.000009766114,"threshold_uncertainty_score":0.9997953},"labels":[],"label_agreement":null},{"id":"W2099124997","doi":"10.1109/tcad.2011.2153853","title":"An Optimal and Practical Approach to Single Constant Multiplication","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Multiplication (music); Constant (computer programming); Arithmetic; Mathematics; Computer science; Combinatorics; Programming language","score_opus":0.1102515315918191,"score_gpt":0.2907375211890358,"score_spread":0.18048598959721668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099124997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003391123,0.000050032653,0.9950525,0.0000307918,0.00045631826,0.00064561586,0.000014476614,0.00014388478,0.00021521539],"genre_scores_gemma":[0.5337678,0.000008906872,0.4660971,0.000047496233,0.000019165298,0.00004047287,6.4204875e-7,0.000010461385,0.000007969467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783,0.0005089979,0.0005014621,0.0006443883,0.0002447315,0.0002704284],"domain_scores_gemma":[0.99846613,0.00030754632,0.00015582125,0.0004680794,0.0002745911,0.0003278388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006349972,0.0002489356,0.00041538884,0.00023448456,0.0001503937,0.00022194543,0.00027011853,0.00012889641,0.0000026014588],"category_scores_gemma":[0.000011985473,0.0002002103,0.000048558068,0.0004667541,0.00010883333,0.00046549327,0.0000044087424,0.00023051143,0.000003435706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011495449,0.0025657113,0.00000825509,0.00009028953,0.00015439882,0.000024398338,0.0036629657,0.019470235,0.057376202,0.013309751,0.0000606043,0.90316224],"study_design_scores_gemma":[0.00042773518,0.0020834724,0.000047031623,0.00009438766,0.000023640852,0.000284489,0.00027231578,0.9775883,0.018667392,0.00015002312,0.00007224586,0.00028895645],"about_ca_topic_score_codex":0.00016340306,"about_ca_topic_score_gemma":5.2052525e-7,"teacher_disagreement_score":0.9581181,"about_ca_system_score_codex":0.00004218074,"about_ca_system_score_gemma":0.00007283603,"threshold_uncertainty_score":0.8164339},"labels":[],"label_agreement":null},{"id":"W2099817857","doi":"10.1109/n-ssc.2007.4785653","title":"Tales of the Continuum: A Subsampled History of Analog Circuits","year":2007,"lang":"en","type":"article","venue":"IEEE Solid-State Circuits Society Newsletter","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"George (robot); Tribute; Analogue electronics; Art history; Engineering; Art; Electrical engineering; Electronic circuit","score_opus":0.030117602702326562,"score_gpt":0.2739686817458178,"score_spread":0.24385107904349124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099817857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13761559,0.00046513916,0.8563292,0.0010533321,0.002650713,0.0003692087,0.000022855469,0.000098448414,0.0013955294],"genre_scores_gemma":[0.9656774,0.00004828064,0.022422401,0.009166085,0.0003702485,0.000015261514,0.000002690622,0.0000556676,0.002242],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99698186,0.00020657988,0.00085280515,0.0005654418,0.0006777614,0.0007155707],"domain_scores_gemma":[0.9973787,0.00051179854,0.0006313582,0.0010256694,0.00028537988,0.00016709289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013236582,0.00030364335,0.0006018135,0.00006951878,0.00009485167,0.00003171453,0.0015209793,0.00015217064,0.000027065658],"category_scores_gemma":[0.00007441552,0.00023423969,0.00074849435,0.00071172067,0.0006127917,0.00028960197,0.00018395975,0.00040359295,0.000009846394],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005043044,0.00036227278,0.0051910365,0.00021520203,0.00033470386,0.000031232503,0.01672233,0.00007370002,0.7297573,0.001344327,0.081390336,0.1645725],"study_design_scores_gemma":[0.006501721,0.0006133944,0.14869305,0.00057454244,0.0003124234,0.0001704907,0.0007610494,0.010752132,0.5630788,0.028964592,0.23608643,0.0034913511],"about_ca_topic_score_codex":0.00011187119,"about_ca_topic_score_gemma":0.00002002266,"teacher_disagreement_score":0.83390677,"about_ca_system_score_codex":0.0002593254,"about_ca_system_score_gemma":0.00022050143,"threshold_uncertainty_score":0.95520175},"labels":[],"label_agreement":null},{"id":"W2099838466","doi":"10.1109/ccece.1999.807240","title":"Design and synthesis of an IEEE-754 exponential function","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; VHDL; Rounding; Verilog; Exponential function; Lookup table; Floating point; Hardware description language; Table (database); Function (biology); Multiplication (music); Integer (computer science); Parallel computing; Algorithm; Computer hardware; Field-programmable gate array; Programming language; Mathematics; Operating system","score_opus":0.029777982015880656,"score_gpt":0.26213926544419147,"score_spread":0.2323612834283108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099838466","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065731616,0.000016988522,0.99219227,0.00002605701,0.00021271511,0.000048133923,9.19127e-8,0.00003572441,0.00089484337],"genre_scores_gemma":[0.20846084,0.0000036464603,0.7914182,0.000043282213,0.000010311764,0.0000041918693,2.0287949e-8,0.0000023096177,0.00005721633],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992465,0.00029901648,0.0000958694,0.00016913506,0.00009559885,0.000093921575],"domain_scores_gemma":[0.99951404,0.00020243503,0.000030495652,0.00017134154,0.000021800015,0.000059907987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045938962,0.00005192511,0.00008995502,0.000031481355,0.000042775744,0.000031872445,0.00011095392,0.00002380176,0.000026176105],"category_scores_gemma":[0.00005209038,0.00003982821,0.000017030976,0.00009841913,0.000024302271,0.00022498894,0.000014619804,0.000032412514,0.0000035250462],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007130745,0.00010245532,0.000020808515,0.0000047281105,0.00000784606,0.0000018868645,0.000054671502,0.00004821986,0.027419215,0.026440296,0.00003651299,0.9458562],"study_design_scores_gemma":[0.00030367423,0.0005308381,0.0011085765,0.000009338169,0.000016623078,0.00001909754,0.000038654834,0.18618,0.76733583,0.04345193,0.0007748973,0.00023056992],"about_ca_topic_score_codex":0.000017764838,"about_ca_topic_score_gemma":2.2288455e-7,"teacher_disagreement_score":0.94562566,"about_ca_system_score_codex":0.0000030167064,"about_ca_system_score_gemma":0.000011915384,"threshold_uncertainty_score":0.16241471},"labels":[],"label_agreement":null},{"id":"W2100494504","doi":"10.1142/s0218126615500206","title":"ICAT: Engine to Perform Range Analysis and Allocate Bit-Widths for Arithmetic Datapaths","year":2014,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Affine arithmetic; Arithmetic; Saturation arithmetic; Computer science; Range (aeronautics); Register allocation; Interval arithmetic; Arbitrary-precision arithmetic; Integer (computer science); Fixed-point arithmetic; Algorithm; Floating point; Affine transformation; Mathematics; Compiler","score_opus":0.015153297430085507,"score_gpt":0.253707234686,"score_spread":0.23855393725591448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100494504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023012966,0.0007256124,0.97458214,0.000641818,0.0008020781,0.00018445686,0.0000051996144,0.000018172646,0.000027583415],"genre_scores_gemma":[0.78256994,0.000066403234,0.21648306,0.00036181402,0.00046368205,0.000008345119,8.0231985e-7,0.000011604009,0.000034353077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843913,0.00012537719,0.000555062,0.00030981388,0.00029720482,0.0002734355],"domain_scores_gemma":[0.9983706,0.00041667526,0.00032141875,0.00031328842,0.00020115194,0.00037689053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016047417,0.0001756094,0.00065559737,0.0004442856,0.00011617885,0.00036362605,0.00053034996,0.000050963252,7.8131245e-7],"category_scores_gemma":[0.00007015947,0.0001319167,0.00015297343,0.0006210664,0.000029935783,0.0003217714,0.0001253833,0.00012773764,0.0000010382352],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007487682,0.00005094706,0.0013388254,0.00014573034,0.00041179,0.00000916038,0.0005176099,0.0012623222,0.0003837704,0.0049299835,0.00028134816,0.990661],"study_design_scores_gemma":[0.0011634721,0.0011208014,0.015171225,0.00016849597,0.00027045386,0.00030429073,0.000051788033,0.95447004,0.00009079907,0.00085285184,0.025959557,0.00037621855],"about_ca_topic_score_codex":0.000026958218,"about_ca_topic_score_gemma":0.0000010193811,"teacher_disagreement_score":0.9902848,"about_ca_system_score_codex":0.000023437715,"about_ca_system_score_gemma":0.000024843745,"threshold_uncertainty_score":0.5379407},"labels":[],"label_agreement":null},{"id":"W2100695032","doi":"10.2139/ssrn.2269814","title":"A Fast Fractional Difference Algorithm","year":2013,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada; Canada Research Chairs; Danmarks Grundforskningsfond; National Research Foundation","keywords":"Algorithm; Mathematics; Computer science","score_opus":0.008465826394422352,"score_gpt":0.2501804840411531,"score_spread":0.24171465764673078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100695032","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018902705,0.0005227335,0.99414873,0.002316413,0.0004582021,0.00007699967,5.1533596e-7,0.00006703303,0.0005191003],"genre_scores_gemma":[0.11319377,0.0012713469,0.8773473,0.00089227996,0.0011415542,0.000037399062,0.0000011734852,0.000027571823,0.0060876394],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971193,0.00012354067,0.00023432358,0.00026595124,0.0003835031,0.0018733967],"domain_scores_gemma":[0.9992345,0.00010131633,0.00012752139,0.00023279038,0.00013071687,0.00017317019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006782003,0.00015125345,0.0001667812,0.000088232875,0.00024811097,0.00029801668,0.00083653384,0.000054284887,0.00008818314],"category_scores_gemma":[0.00004429487,0.000115213035,0.000109779896,0.00030237157,0.000037699614,0.00061706087,0.000117857366,0.0016228121,0.00027078646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.123386e-7,0.00004259945,0.00007693265,4.886725e-7,0.0000261565,0.0000021238545,0.000024661718,0.0000042819274,0.0002733999,0.10547668,0.00005886076,0.8940132],"study_design_scores_gemma":[0.0002806654,0.00024600673,0.0033172285,0.0000072100515,0.000004495569,0.0008684376,0.00012792839,0.054043185,0.00009040717,0.9392048,0.001598626,0.00021098112],"about_ca_topic_score_codex":0.000092667295,"about_ca_topic_score_gemma":0.0000055318847,"teacher_disagreement_score":0.8938022,"about_ca_system_score_codex":0.00031479055,"about_ca_system_score_gemma":0.0007633986,"threshold_uncertainty_score":0.70504016},"labels":[],"label_agreement":null},{"id":"W2100853394","doi":"10.1109/ccece.2006.277355","title":"An FPGA-Based Singular Value Decomposition Processor","year":2006,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"CMC Microsystems","keywords":"Singular value decomposition; Computer science; Field-programmable gate array; CORDIC; Systolic array; Parallel computing; Virtex; Algorithm; Matrix (chemical analysis); Matrix multiplication; MATLAB; Vector processor; Computational science; Computer hardware; Embedded system; Very-large-scale integration","score_opus":0.009827068608507123,"score_gpt":0.3031902495135223,"score_spread":0.2933631809050152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100853394","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008550149,0.000020521977,0.98801374,0.00074640533,0.00011480281,0.000071978575,4.797434e-7,0.00026973255,0.0022121652],"genre_scores_gemma":[0.20586604,1.3250373e-7,0.79337347,0.0006005172,0.00008331525,0.0000050576455,0.0000031076256,0.000004855338,0.00006352005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991366,0.0000803182,0.00013690932,0.0002812364,0.00017949013,0.00018544153],"domain_scores_gemma":[0.99950725,0.00004563096,0.000039427723,0.0002845241,0.000053583604,0.00006959983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020048539,0.00008605528,0.000097427815,0.000046191893,0.00009537153,0.00016750999,0.0003762433,0.00003176363,0.00001595251],"category_scores_gemma":[0.000007566022,0.00006862678,0.00003737805,0.0002890469,0.00002016112,0.0003217976,0.000024633635,0.00005078968,0.000022214299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008505748,0.0009082605,0.00040512806,0.000023885452,0.000006050222,0.00003982462,0.000040406372,0.006274102,0.062906355,0.22830221,0.00041944298,0.70066583],"study_design_scores_gemma":[0.00021467014,0.00019325764,0.0017135118,0.000007719042,0.000002873236,0.0000040454247,0.0000015224513,0.8208387,0.120897435,0.054843266,0.0011068755,0.00017612152],"about_ca_topic_score_codex":0.00011962521,"about_ca_topic_score_gemma":0.0000014826277,"teacher_disagreement_score":0.8145646,"about_ca_system_score_codex":0.000017839087,"about_ca_system_score_gemma":0.000031893444,"threshold_uncertainty_score":0.27985188},"labels":[],"label_agreement":null},{"id":"W2101173251","doi":"10.1109/arith.2001.930126","title":"The use of the multi-dimensional logarithmic number system in DSP applications","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Logarithm; Digital signal processing; Computer science; Cryptography; Discrete logarithm; Base (topology); Extension (predicate logic); Arithmetic; Signal processing; Theoretical computer science; Algorithm; Representation (politics); Mathematics; Computer hardware; Public-key cryptography; Encryption","score_opus":0.07222602232512369,"score_gpt":0.2809821754083183,"score_spread":0.20875615308319462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101173251","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009699504,0.000046559526,0.9965677,0.0011939909,0.0001657389,0.0002770467,0.0000015936494,0.000042099466,0.0007352748],"genre_scores_gemma":[0.08781423,0.000005744422,0.9094993,0.0002640075,0.000024176074,0.00006853461,8.791306e-8,0.00000457939,0.0023193697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924284,0.00012381948,0.00018295621,0.00015651052,0.00016222312,0.00013162506],"domain_scores_gemma":[0.9989827,0.00040233094,0.00005711741,0.00048604063,0.000041921554,0.000029882012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018253253,0.000057567097,0.00008044046,0.000012597376,0.00012238832,0.00004890179,0.00055166724,0.000025145322,0.000012967484],"category_scores_gemma":[0.000028089915,0.000026948312,0.00004750337,0.00039024404,0.00006463453,0.000096816584,0.00020398121,0.000091389236,0.000057475496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016544734,0.00034930013,0.0046006367,0.000019694282,0.000020060188,0.0000035382532,0.00019006066,0.0011092317,0.00059247634,0.47793636,0.0022935749,0.5128834],"study_design_scores_gemma":[0.00016355884,0.0000056764893,0.0043440526,0.000014320095,0.0000017613555,0.000014828156,0.00001612526,0.9571144,0.0003194001,0.00058980635,0.0373461,0.00007000133],"about_ca_topic_score_codex":0.00010603315,"about_ca_topic_score_gemma":0.000011824883,"teacher_disagreement_score":0.95600516,"about_ca_system_score_codex":0.000021632262,"about_ca_system_score_gemma":0.000008507365,"threshold_uncertainty_score":0.109892026},"labels":[],"label_agreement":null},{"id":"W2101221074","doi":"10.1109/arith.1991.145548","title":"Specifications for a variable-precision arithmetic coprocessor","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Coprocessor; Computer science; Programmer; Arithmetic; Variable (mathematics); Decimal; Programming language; Arbitrary-precision arithmetic; Set (abstract data type); Software; Embedded system; Mathematics","score_opus":0.1095624609350344,"score_gpt":0.2956864882773909,"score_spread":0.1861240273423565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101221074","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013185145,0.00011501108,0.9819368,0.0024772931,0.0002460185,0.00018437477,0.000002664054,0.0001418006,0.014882864],"genre_scores_gemma":[0.0018527481,0.000018399489,0.9916735,0.00041676834,0.000086138396,0.00004826538,5.704045e-7,0.0000058685946,0.0058977245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991574,0.00002659327,0.00016907911,0.00030528044,0.00014318207,0.0001984217],"domain_scores_gemma":[0.9989069,0.0004656367,0.000041120013,0.00039468656,0.00010255591,0.00008909928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022776853,0.0000788786,0.00011456926,0.000053788674,0.00012231396,0.00013464462,0.00056519615,0.000033748573,0.00026278818],"category_scores_gemma":[0.00020603462,0.00006065429,0.00004490603,0.0005278097,0.000018704164,0.00021661825,0.000072413575,0.000053278,0.00013300302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.09489e-7,0.00011444274,0.000005993322,0.000006457839,0.000004665675,5.5934333e-7,0.00005243192,0.000015907432,0.00058848073,0.3664554,0.006878426,0.6258763],"study_design_scores_gemma":[0.00025186973,0.00009079155,0.00008015971,0.0000072008424,0.0000039496745,0.0000072117236,0.0000079875535,0.6723069,0.0011173737,0.15718207,0.16879876,0.00014569577],"about_ca_topic_score_codex":0.0000039754095,"about_ca_topic_score_gemma":1.5270264e-7,"teacher_disagreement_score":0.67229104,"about_ca_system_score_codex":0.000013424695,"about_ca_system_score_gemma":0.000008841358,"threshold_uncertainty_score":0.28773463},"labels":[],"label_agreement":null},{"id":"W2102282062","doi":"10.1109/tc.2010.45","title":"A Karatsuba-Based Algorithm for Polynomial Multiplication in Chebyshev Form","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Multiplication (music); Computer science; Algorithm; Polynomial; Arithmetic; Mathematics; Parallel computing; Combinatorics","score_opus":0.017022166178700227,"score_gpt":0.28066250431296863,"score_spread":0.2636403381342684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102282062","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014459004,0.0000039928655,0.9941031,0.0010149315,0.0027153625,0.0004884978,0.00001633059,0.00018515639,0.000026724083],"genre_scores_gemma":[0.10966452,0.000001804475,0.88940674,0.0005796376,0.00011646314,0.00018969543,0.0000017902039,0.00001561793,0.000023728995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998656,0.000044695535,0.00028497717,0.0004939394,0.00017699222,0.00034342104],"domain_scores_gemma":[0.9988117,0.0004355886,0.00007188638,0.00047996524,0.000061979415,0.00013883272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028678615,0.0001884557,0.0002095457,0.00024926197,0.00015642855,0.00011293271,0.00059928437,0.000115152856,0.000005964726],"category_scores_gemma":[0.000004386626,0.00018266031,0.00016734637,0.0004763235,0.0000512127,0.0002771669,0.0000028682207,0.00036054823,0.000016299025],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001146085,0.00023482226,0.0000022278034,0.0000046028695,0.0000070608985,0.0000016716621,0.00008484051,0.0019521303,0.0026754525,0.00009246808,0.000073541814,0.9948597],"study_design_scores_gemma":[0.0012202734,0.00018233224,0.00013236453,0.000013318284,0.0000047326776,0.000004803714,0.0000037878285,0.9601874,0.035554778,0.00032752394,0.0021472748,0.00022145912],"about_ca_topic_score_codex":0.000056388602,"about_ca_topic_score_gemma":0.000031797677,"teacher_disagreement_score":0.99463826,"about_ca_system_score_codex":0.000060008322,"about_ca_system_score_gemma":0.00008024903,"threshold_uncertainty_score":0.74486715},"labels":[],"label_agreement":null},{"id":"W2105153879","doi":"10.1109/arith.1995.465368","title":"The K5 transcendental functions","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Transcendental number; Transcendental function; Computer science; Microprocessor; x86; Algorithm; Schedule; Table (database); Polynomial; Arithmetic; Mathematics; Programming language; Embedded system; Operating system; Data mining; Software","score_opus":0.02679106760959364,"score_gpt":0.2421225720561345,"score_spread":0.21533150444654087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105153879","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007642249,0.00012455009,0.9543254,0.005028833,0.00046136518,0.000027698577,2.3487358e-7,0.00009124788,0.03986427],"genre_scores_gemma":[0.19727401,0.000109037166,0.73068726,0.0015433622,0.000252511,0.000020756717,1.7059673e-7,0.000008222759,0.070104636],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99957985,0.000031048814,0.00006128079,0.000104997845,0.00009932917,0.00012349446],"domain_scores_gemma":[0.99964947,0.00009195831,0.000008497532,0.00019647092,0.000009713814,0.00004388971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008597086,0.000036686404,0.0000325168,0.000008712222,0.00021587843,0.0001007153,0.00032438347,0.000010717819,0.0001684758],"category_scores_gemma":[0.000007973457,0.000019533712,0.000041105242,0.0001673601,0.00002605625,0.00010591163,0.000027159951,0.000054527085,0.0003188866],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.4210855e-7,0.000020931671,0.000018644818,2.0316382e-7,0.0000029769014,0.0000012364336,0.000045434444,0.0000013947467,0.00011274593,0.047467493,0.0040796064,0.94824916],"study_design_scores_gemma":[0.00024441184,0.00011175739,0.0013751178,0.0000019687614,0.0000036108624,0.000035609173,0.00010010491,0.31687647,0.0008423702,0.013242186,0.6669824,0.00018399431],"about_ca_topic_score_codex":0.000006532829,"about_ca_topic_score_gemma":0.0000016032433,"teacher_disagreement_score":0.9480652,"about_ca_system_score_codex":0.0000052177347,"about_ca_system_score_gemma":0.0000017349295,"threshold_uncertainty_score":0.40987483},"labels":[],"label_agreement":null},{"id":"W2105605001","doi":"10.1109/mwscas.1993.343072","title":"A VLSI architecture for DFT","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Very-large-scale integration; Computer science; Architecture; Simple (philosophy); Discrete Fourier transform (general); Modular design; Parallel computing; Point (geometry); Computational science; Fast Fourier transform; Computation; Theoretical computer science; Algorithm; Fourier transform; Computer architecture; Arithmetic; Embedded system; Mathematics; Fourier analysis; Fractional Fourier transform","score_opus":0.03497187509894589,"score_gpt":0.2768092329434893,"score_spread":0.2418373578445434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105605001","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048305123,0.000056014942,0.98510116,0.0047321813,0.00015979075,0.000081627375,5.835104e-7,0.000111056215,0.009709247],"genre_scores_gemma":[0.0032599184,0.0000024215938,0.9919274,0.0013131726,0.00008130551,0.000008638424,8.4030894e-8,0.0000031801271,0.003403887],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999524,0.000017512128,0.000064827924,0.00016795578,0.00007109833,0.00015461838],"domain_scores_gemma":[0.99959093,0.00011578838,0.000013720677,0.00020463762,0.000016323698,0.00005862596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000074712734,0.00005178709,0.00006959387,0.000022503958,0.00004495922,0.000051361916,0.00032603592,0.000018655497,0.00008314199],"category_scores_gemma":[0.00003423704,0.000035204503,0.00005053727,0.0001391158,0.000011286856,0.000061157945,0.00005663324,0.00004309449,0.0000426121],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.5705586e-7,0.000018155377,0.0000037611342,0.0000022151598,0.0000021692638,0.0000010220133,0.000063790045,0.0000067439223,0.00020442485,0.039040633,0.0030770504,0.9575798],"study_design_scores_gemma":[0.00028762105,0.00017559344,0.00009693433,0.000004020366,0.0000019984318,0.000014786132,0.0000048807,0.3964503,0.0026268307,0.1144757,0.4856781,0.00018322811],"about_ca_topic_score_codex":0.0000034516763,"about_ca_topic_score_gemma":4.2232006e-7,"teacher_disagreement_score":0.95739657,"about_ca_system_score_codex":0.0000036443466,"about_ca_system_score_gemma":0.0000020517741,"threshold_uncertainty_score":0.1435598},"labels":[],"label_agreement":null},{"id":"W2105999745","doi":"10.1109/sips.2007.4387509","title":"Embedded Reconfigurable Solution for OFDM Detection Over Fast Fading Radio Channels","year":2007,"lang":"en","type":"article","venue":"SiPS ... design and implementation - IEEE Workshop on Signal Processing Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"CORDIC; Computer science; Fading; Demodulation; Orthogonal frequency-division multiplexing; Software-defined radio; QR decomposition; Block (permutation group theory); Overhead (engineering); Pipeline (software); Channel (broadcasting); Computer hardware; Embedded system; Algorithm; Field-programmable gate array; Decoding methods; Computer network; Mathematics; Telecommunications; Eigenvalues and eigenvectors","score_opus":0.06289223757742589,"score_gpt":0.3544005188633682,"score_spread":0.2915082812859423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105999745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020694511,0.00030514842,0.9948159,0.00009264851,0.0012624738,0.0011653117,0.000003799826,0.00017972797,0.00010552869],"genre_scores_gemma":[0.898014,0.000015074445,0.100705154,0.00017931184,0.0005737011,0.00018370178,0.0000077992645,0.000033538516,0.0002877373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973969,0.00025833785,0.00067775813,0.00064465665,0.00040223319,0.0006201071],"domain_scores_gemma":[0.9984134,0.000592849,0.00043837202,0.00018093565,0.00018547461,0.00018895685],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002840339,0.00028289523,0.00033249072,0.00028598125,0.00072906987,0.00078125054,0.00024525652,0.00012728236,0.000011430202],"category_scores_gemma":[0.000030227658,0.00026171948,0.00007940301,0.00061033375,0.000040594692,0.00094862824,0.000016774737,0.00018057448,0.000005127559],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009571663,0.000038890816,0.000007046546,0.00011596424,0.000026124073,0.0000026363707,0.0011009525,0.0018616292,0.080910444,0.00042356492,0.00039028426,0.9150267],"study_design_scores_gemma":[0.001666969,0.0005917602,0.00006243543,0.0003362279,0.000031894313,0.000042271262,0.0017103449,0.89777213,0.093979485,0.0015568745,0.0016930604,0.0005565118],"about_ca_topic_score_codex":0.000031046384,"about_ca_topic_score_gemma":0.0000033101394,"teacher_disagreement_score":0.91447026,"about_ca_system_score_codex":0.00017154834,"about_ca_system_score_gemma":0.00007102939,"threshold_uncertainty_score":0.9999835},"labels":[],"label_agreement":null},{"id":"W2107131148","doi":"10.1145/980175.980177","title":"A comparison of methods for accurate summation","year":2004,"lang":"en","type":"article","venue":"ACM SIGSAM Bulletin","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Rounding; Computer science; Double-precision floating-point format; Compensation (psychology); Algorithm; Cascade; Accuracy and precision; Arithmetic; Mathematics; Floating point; Statistics; Engineering","score_opus":0.09880814579206969,"score_gpt":0.45556522887872203,"score_spread":0.3567570830866523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107131148","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009131708,0.00017369605,0.9906639,0.007508222,0.00027338258,0.00022262354,0.0000026657517,0.00007288286,0.00016945417],"genre_scores_gemma":[0.031285573,0.0000070486235,0.9682866,0.00026851948,0.000053449545,0.000040116593,0.0000026378552,0.000008038921,0.000048069836],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99893826,0.00014704323,0.00033600512,0.00026465792,0.000106043146,0.00020800471],"domain_scores_gemma":[0.9980002,0.0010794222,0.0001858859,0.0005611319,0.00010853112,0.00006484529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079455884,0.0001058857,0.00027300403,0.000052479536,0.00006867021,0.00004771681,0.0008866598,0.0000543,0.000022497756],"category_scores_gemma":[0.0014757203,0.000091052105,0.00009590878,0.00024388902,0.00003476474,0.000073420335,0.00022422831,0.00008317088,0.000028718065],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012169782,0.0001470959,0.000056314384,0.00004085696,0.000015817164,4.488435e-7,0.0004015793,0.00043533303,0.00943885,0.036262423,0.0016403362,0.95154876],"study_design_scores_gemma":[0.0018787885,0.00078355405,0.001074794,0.00009969327,0.000026635404,0.000006162765,0.00011398078,0.030487694,0.35298422,0.17184867,0.44016933,0.0005264694],"about_ca_topic_score_codex":0.000034829387,"about_ca_topic_score_gemma":3.4773862e-7,"teacher_disagreement_score":0.9510223,"about_ca_system_score_codex":0.000022400634,"about_ca_system_score_gemma":0.000031463664,"threshold_uncertainty_score":0.3712997},"labels":[],"label_agreement":null},{"id":"W2108119746","doi":"10.1109/tc.2010.78","title":"High-Radix Multiplier-Dividers: Theory, Design, and Hardware","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Cairo University; University of Utah","keywords":"Rounding; Arithmetic; Multiplier (economics); Division (mathematics); Radix (gastropod); Multiplication (music); Shift register; Computer science; Quotient; Numerical digit; Mathematics; Division algorithm; Computer hardware; Telecommunications","score_opus":0.019991996110876847,"score_gpt":0.25543929078501293,"score_spread":0.23544729467413608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108119746","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017810228,0.000014309053,0.9929093,0.00090158725,0.0038244715,0.00022474171,0.0000050426843,0.0003160047,0.000023531178],"genre_scores_gemma":[0.2281131,0.000010645028,0.77118444,0.000514857,0.00007399106,0.000021115984,2.439237e-7,0.000014566681,0.0000670231],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852735,0.00021230907,0.0002024061,0.00052802265,0.00021738913,0.00031251195],"domain_scores_gemma":[0.998226,0.00091080996,0.00005522483,0.0005333933,0.00004639216,0.00022816425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042695348,0.00021973507,0.00022282287,0.00014892542,0.00029098324,0.00023797437,0.0005947341,0.00009452612,0.000026229218],"category_scores_gemma":[0.000007984112,0.00019254295,0.0000944991,0.00029541051,0.0001295519,0.00035897974,0.0000075655935,0.00047227243,0.0000434245],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015657024,0.00013514092,0.00000168038,0.0000060589027,0.000041615152,0.000015765976,0.00029360858,0.008811402,0.0031437916,0.00443567,0.00018431533,0.9829153],"study_design_scores_gemma":[0.0017054637,0.0006874113,0.00025689608,0.00006488509,0.000043685868,0.00012547986,0.000038441958,0.8992239,0.06900058,0.024011116,0.0039428254,0.0008992948],"about_ca_topic_score_codex":0.000027421149,"about_ca_topic_score_gemma":0.0000026242524,"teacher_disagreement_score":0.982016,"about_ca_system_score_codex":0.000017078059,"about_ca_system_score_gemma":0.00003139576,"threshold_uncertainty_score":0.7851674},"labels":[],"label_agreement":null},{"id":"W2110534080","doi":"10.1109/iscas.2011.5937750","title":"Nonspeculative decimal signed digit adder","year":2011,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adder; Decimal; Arithmetic; Computer science; Multiplication (music); Carry-save adder; Numerical digit; Division (mathematics); Subtraction; Binary number; VHDL; Carry (investment); Multiplication algorithm; Parallel computing; Computer hardware; Mathematics; Field-programmable gate array; Telecommunications","score_opus":0.06457336308468495,"score_gpt":0.2531912788677962,"score_spread":0.18861791578311124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110534080","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005872466,0.000008865891,0.849581,0.00010517961,0.00013621712,0.0000477228,3.6921816e-7,0.00012597136,0.14940743],"genre_scores_gemma":[0.12302151,7.358667e-7,0.8754578,0.00041622156,0.000032173153,0.0000050317485,1.3346343e-7,0.000004026167,0.0010623416],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992859,0.00004228218,0.00011048223,0.00024051532,0.00012791705,0.00019292466],"domain_scores_gemma":[0.9994704,0.00008003411,0.000028353861,0.00027804822,0.000042213695,0.00010096113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008410756,0.00008174006,0.00010044808,0.00003119476,0.000048141563,0.00005049991,0.00044197455,0.000025683315,0.0004273943],"category_scores_gemma":[0.000032270123,0.000057761998,0.000050910527,0.00023677947,0.000035914814,0.00032417921,0.0001728067,0.000053301555,0.00022796683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042776833,0.000102934646,0.00032606785,0.0000011162235,0.000016567514,0.000028686518,0.00064887496,6.3406236e-7,0.0004830894,0.36697885,0.0004793619,0.6309295],"study_design_scores_gemma":[0.0013906512,0.0011316511,0.05579516,0.000027192626,0.000020026308,0.00005329623,0.00022257527,0.077293366,0.15171513,0.6847578,0.026020385,0.0015727155],"about_ca_topic_score_codex":0.000032728345,"about_ca_topic_score_gemma":7.771965e-7,"teacher_disagreement_score":0.6293568,"about_ca_system_score_codex":0.00000787782,"about_ca_system_score_gemma":0.000016590606,"threshold_uncertainty_score":0.46796677},"labels":[],"label_agreement":null},{"id":"W2111546354","doi":"10.1109/acc.2002.1024794","title":"Rigorous simulation of hybrid dynamic systems with symbolic and interval methods","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Interval (graph theory); Computer science; Interval arithmetic; Symbolic data analysis; Theoretical computer science; Mathematics","score_opus":0.01652825348506537,"score_gpt":0.33327256542471095,"score_spread":0.3167443119396456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111546354","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0142882075,0.00020601052,0.98393553,0.000025436237,0.00016053263,0.00010590214,5.0951246e-7,0.000050105533,0.0012277561],"genre_scores_gemma":[0.45848835,0.0000028026952,0.54138654,0.000017571034,0.0000035444525,0.0000023533594,9.468013e-8,0.000003317925,0.000095448086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900544,0.00033675402,0.00018149709,0.00022351129,0.000119494805,0.00013328162],"domain_scores_gemma":[0.9992598,0.00029921334,0.00007714565,0.00024306687,0.00005780843,0.00006296028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005525618,0.00008956885,0.00020816077,0.00005276457,0.000032121574,0.000056532135,0.00016045447,0.000015497697,0.000004010864],"category_scores_gemma":[0.000057948222,0.0000595083,0.000022891814,0.00019954352,0.0000405103,0.00017011547,0.00004625162,0.000056006513,0.0000013436529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000098721375,0.0001039478,0.00045698576,0.00009581369,0.000061023573,0.000017156199,0.00028193672,0.028738,0.0015712652,0.09701046,0.0000062820777,0.87164724],"study_design_scores_gemma":[0.00017143498,0.00016192274,0.00025756718,0.00001892558,0.000005922568,0.00005401735,0.000029835412,0.99355155,0.0016747225,0.003487915,0.00048740435,0.00009879249],"about_ca_topic_score_codex":0.00003612908,"about_ca_topic_score_gemma":5.013771e-7,"teacher_disagreement_score":0.96481353,"about_ca_system_score_codex":0.000012701756,"about_ca_system_score_gemma":0.000015950513,"threshold_uncertainty_score":0.2426678},"labels":[],"label_agreement":null},{"id":"W2111675255","doi":"10.1109/iccit.2009.5407171","title":"On the fast computation of decimal logarithm","year":2009,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decimal; Logarithm; Computer science; Computation; Arithmetic; Double-precision floating-point format; Floating point; Field-programmable gate array; Binary number; Algorithm; Mathematics; Computer hardware","score_opus":0.02206580754195244,"score_gpt":0.2926224837445959,"score_spread":0.27055667620264345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111675255","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028776843,0.0000067620194,0.9839179,0.0038028962,0.00007749216,0.000042164054,1.8611244e-7,0.000033494933,0.009241451],"genre_scores_gemma":[0.48206827,6.4998744e-7,0.51663357,0.0012213901,0.000014374858,4.7763723e-7,7.803318e-8,8.3477534e-7,0.00006032815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995229,0.00005279987,0.00009373625,0.00010814347,0.00013949437,0.00008291065],"domain_scores_gemma":[0.9995644,0.00019807086,0.000034423592,0.00014739105,0.00003197709,0.000023742772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017873546,0.000043448385,0.00006584295,0.000021290145,0.000037516438,0.000029481935,0.00027610658,0.0000136852395,0.000011563798],"category_scores_gemma":[0.000036477682,0.000023380251,0.000030316844,0.00019336356,0.000019126932,0.000062818915,0.000029586312,0.000049569462,0.000016212523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.628638e-7,0.000031404565,0.0000034536488,2.6828835e-7,0.0000010719588,7.11709e-7,0.000029891375,0.00010981421,0.00019770315,0.3696193,0.00022777707,0.6297777],"study_design_scores_gemma":[0.00017507354,0.0005326123,0.009547195,0.000011542566,0.0000016145295,0.0000047856743,0.000019373314,0.5773798,0.006522065,0.40531966,0.00038608187,0.00010017496],"about_ca_topic_score_codex":0.0000053660488,"about_ca_topic_score_gemma":1.2617646e-7,"teacher_disagreement_score":0.62967753,"about_ca_system_score_codex":0.000004811333,"about_ca_system_score_gemma":0.000007907179,"threshold_uncertainty_score":0.0953419},"labels":[],"label_agreement":null},{"id":"W2111833899","doi":"10.1109/ccece.1996.548095","title":"Rounding techniques for signed binary arithmetic","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Rounding; Arithmetic; Binary number; Truncation (statistics); Arbitrary-precision arithmetic; Kernel (algebra); Complement (music); Arithmetic logic unit; Computer science; Mathematics; Saturation arithmetic; Algorithm; Discrete mathematics; Statistics","score_opus":0.048949543692598615,"score_gpt":0.30091939788317934,"score_spread":0.2519698541905807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111833899","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006238682,0.00010416871,0.99070007,0.0015435794,0.00017545249,0.00017688125,4.3611254e-7,0.0004094327,0.0068276096],"genre_scores_gemma":[0.015154088,0.000008605257,0.9812495,0.00054082414,0.00008509729,0.000050948394,1.6973587e-7,0.00000673141,0.0029040088],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992625,0.000036258956,0.00012850651,0.00024602565,0.00010667617,0.0002200496],"domain_scores_gemma":[0.99940073,0.00021494125,0.000031057192,0.00025280315,0.00003378854,0.0000666502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024256165,0.000083418905,0.00011848007,0.00006755446,0.00009971469,0.00011713504,0.00042175804,0.000034886565,0.000054412252],"category_scores_gemma":[0.00005484152,0.00006429863,0.00006324178,0.00028492423,0.000019800282,0.00026094232,0.000099387704,0.00004887846,0.000023396513],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.441641e-7,0.000050638322,0.0000072697853,0.0000061093915,0.000003659974,0.0000036935444,0.000035465862,6.413682e-7,0.0031773823,0.05360419,0.0015261045,0.9415843],"study_design_scores_gemma":[0.0002179242,0.0005966702,0.00004623641,0.00001845887,0.00000547862,0.000016744878,0.000016398346,0.8499731,0.026271164,0.06299329,0.05950682,0.00033771046],"about_ca_topic_score_codex":0.00000641863,"about_ca_topic_score_gemma":9.8071254e-8,"teacher_disagreement_score":0.94124657,"about_ca_system_score_codex":0.000018787561,"about_ca_system_score_gemma":0.0000037402642,"threshold_uncertainty_score":0.2622022},"labels":[],"label_agreement":null},{"id":"W2113155657","doi":"10.1145/1391469.1391574","title":"Optimizing imprecise fixed-point arithmetic circuits specified by Taylor Series through arithmetic transform","year":2008,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Saturation arithmetic; Arbitrary-precision arithmetic; Fixed-point arithmetic; Affine arithmetic; Arithmetic; Taylor series; Quantization (signal processing); Arithmetic circuit complexity; Series (stratigraphy); Floating point; Algorithm; Mathematics; Computer science","score_opus":0.032327384215790365,"score_gpt":0.2613277696845557,"score_spread":0.2290003854687653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113155657","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000700919,0.00058790296,0.9741201,0.0031033151,0.0007164173,0.00037354574,0.000011535049,0.00047718512,0.019909102],"genre_scores_gemma":[0.034177627,0.0004659988,0.96122533,0.0009643229,0.00016666594,0.000059895403,0.000004790638,0.000039883318,0.0028954993],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969179,0.00014059567,0.0006222471,0.0008979261,0.0005925761,0.00082876475],"domain_scores_gemma":[0.99836373,0.00026857277,0.00011929962,0.00082916894,0.000119483135,0.00029975435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038207183,0.00042383882,0.000588393,0.00010344055,0.0004276306,0.00024378688,0.0011967204,0.0001423454,0.00020760173],"category_scores_gemma":[0.00007360444,0.00034746472,0.0002473467,0.00092583586,0.00024296196,0.001639889,0.0002038877,0.0003790804,0.00011962359],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027389393,0.0005833177,0.000023971235,0.00005911616,0.000102777754,0.0003101279,0.005370096,0.00012778104,0.010357393,0.031949267,0.005724555,0.94536424],"study_design_scores_gemma":[0.0061028106,0.003031286,0.0008541024,0.00017605185,0.00012197413,0.0033092094,0.001333321,0.13891456,0.50268024,0.1616772,0.17632093,0.005478304],"about_ca_topic_score_codex":0.00011552419,"about_ca_topic_score_gemma":0.000003248159,"teacher_disagreement_score":0.9398859,"about_ca_system_score_codex":0.00008156103,"about_ca_system_score_gemma":0.00006502252,"threshold_uncertainty_score":0.9998977},"labels":[],"label_agreement":null},{"id":"W2113291399","doi":"10.1109/tcsii.2003.815020","title":"Novel approach to the design of direct digital frequency synthesizers based on linear interpolation","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"CMC Microsystems","keywords":"Spurious-free dynamic range; Interpolation (computer graphics); Linear phase; Spurious relationship; Linear interpolation; Algorithm; Computer science; Sine; Dynamic range; Sine wave; Direct digital synthesizer; Electronic engineering; Mathematics; Filter (signal processing); Engineering; Phase noise; Telecommunications; Frequency synthesizer; Electrical engineering; Phase-locked loop","score_opus":0.04092386196837652,"score_gpt":0.2486332864599392,"score_spread":0.20770942449156268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113291399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037187175,0.00013975704,0.9940474,0.000041839012,0.000098372824,0.00025681654,0.00002704105,0.000045360583,0.00497154],"genre_scores_gemma":[0.991254,0.0000022844408,0.008551411,0.00006838985,0.000023474824,0.000022998536,6.923496e-7,0.000011762635,0.000065006076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872106,0.00008608464,0.0003092867,0.00039521916,0.00027947122,0.0002088788],"domain_scores_gemma":[0.9991335,0.0003707075,0.000106981286,0.00016486451,0.000080005135,0.00014390853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041112065,0.00018849406,0.00026109736,0.00013957196,0.00038539164,0.00059734704,0.00017909285,0.00006305415,7.3223936e-7],"category_scores_gemma":[0.00003522673,0.00012463635,0.00006119731,0.00044077137,0.00007363404,0.0006026544,0.0000024900096,0.00014028708,9.5206303e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016603837,0.00050671445,0.00002892497,0.00012428442,0.00003624438,0.000001980764,0.0006327373,0.0667339,0.002330997,0.0014441921,0.0000045365377,0.9281389],"study_design_scores_gemma":[0.00026355538,0.0005645648,0.000022331498,0.00025770842,0.0000164144,0.000033507084,0.00019425096,0.99714273,0.0008216793,0.0003198938,0.00011373194,0.00024961296],"about_ca_topic_score_codex":0.000013739505,"about_ca_topic_score_gemma":1.7062673e-7,"teacher_disagreement_score":0.9908821,"about_ca_system_score_codex":0.000019787287,"about_ca_system_score_gemma":0.00006314011,"threshold_uncertainty_score":0.57602316},"labels":[],"label_agreement":null},{"id":"W2115204962","doi":"10.1016/j.jsc.2007.10.013","title":"Solving polynomial systems via symbolic-numeric reduction to geometric involutive form","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Science Foundation","keywords":"Mathematics; Reduction (mathematics); Polynomial; Algebra over a field; Symbolic computation; Applied mathematics; Partial differential equation; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.025414302656878687,"score_gpt":0.27760462594355306,"score_spread":0.2521903232866744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115204962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22937071,0.0003525489,0.76711744,0.00032558737,0.0024911494,0.00017333742,6.364293e-7,0.00004737555,0.00012119338],"genre_scores_gemma":[0.810269,0.000044188393,0.18851529,0.000087966306,0.001017369,0.0000047841745,6.7514645e-7,0.00001474438,0.00004597038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759895,0.0001963204,0.00086941966,0.00028612107,0.00067962846,0.00036955505],"domain_scores_gemma":[0.9980246,0.00019605193,0.00074419467,0.00019833709,0.0005168854,0.00031996745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073853804,0.00020281444,0.00052424043,0.0011051594,0.00027377432,0.00017895197,0.0005420709,0.00007862508,0.000002619078],"category_scores_gemma":[0.00014036406,0.00017962448,0.00017682204,0.002561539,0.000042213436,0.0011740418,0.00013784897,0.0002989791,0.000029773795],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063916705,0.00029668715,0.0005982714,0.00004475472,0.0001359466,0.00010976329,0.0062471926,0.037701547,0.0077431053,0.0006048185,0.0029207973,0.9435332],"study_design_scores_gemma":[0.0027213716,0.003301112,0.11873054,0.0003770113,0.00010343237,0.015231575,0.0011061856,0.84341216,0.0037435791,0.0062579964,0.0036380845,0.0013769687],"about_ca_topic_score_codex":0.0001450499,"about_ca_topic_score_gemma":2.914777e-7,"teacher_disagreement_score":0.94215626,"about_ca_system_score_codex":0.00030333482,"about_ca_system_score_gemma":0.00018690538,"threshold_uncertainty_score":0.7324874},"labels":[],"label_agreement":null},{"id":"W2115626949","doi":"10.1109/freq.2002.1075963","title":"A new approach to the design of low power direct digital frequency synthesizers","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Direct digital synthesizer; Realization (probability); Computer science; Selection (genetic algorithm); Reduction (mathematics); Set (abstract data type); Frequency synthesizer; Power (physics); Function (biology); Electronic engineering; Algorithm; Phase-locked loop; Telecommunications; Mathematics; Engineering; Artificial intelligence","score_opus":0.026510744798304623,"score_gpt":0.24961593968343787,"score_spread":0.22310519488513325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115626949","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019493986,0.000034979777,0.86066306,0.00030905587,0.00011461898,0.000159546,6.278486e-7,0.00004582331,0.13865282],"genre_scores_gemma":[0.04822645,0.0000013397778,0.9497805,0.00026827492,0.000013798354,0.000007972596,4.6613454e-8,0.000005977207,0.0016956424],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989972,0.00015709101,0.00015175053,0.00027417357,0.00020900933,0.00021076293],"domain_scores_gemma":[0.99890786,0.0003958343,0.000036898455,0.0004874903,0.000030737083,0.0001411751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045929314,0.0001013964,0.00015254016,0.00003404971,0.000042224623,0.00013037914,0.00069940527,0.000026680944,0.00004702697],"category_scores_gemma":[0.00043979142,0.000055944623,0.000064322114,0.0005155085,0.000023153958,0.0002124907,0.00006346754,0.00005976809,0.00006206744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066682137,0.00030491265,0.00010103264,0.000010715564,0.000056366815,0.0000059509034,0.001123189,0.0009950597,0.0016187498,0.36037496,0.008340633,0.6270618],"study_design_scores_gemma":[0.002751189,0.0029463582,0.002476174,0.00028129327,0.00008548711,0.00028100432,0.0016048722,0.17210415,0.20545344,0.47255287,0.13433024,0.0051329476],"about_ca_topic_score_codex":0.000024253693,"about_ca_topic_score_gemma":6.695172e-8,"teacher_disagreement_score":0.6219288,"about_ca_system_score_codex":0.000012146128,"about_ca_system_score_gemma":0.000073129115,"threshold_uncertainty_score":0.22813556},"labels":[],"label_agreement":null},{"id":"W2116444959","doi":"10.1109/asap.2002.1030711","title":"Efficient conversion from binary to multi-digit multi-dimensional logarithmic number systems using arrays of range addressable look-up tables","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Windsor","funders":"","keywords":"Binary number; Logarithm; Computer science; Floating point; Representation (politics); Range (aeronautics); Domain (mathematical analysis); Point (geometry); Parallel computing; Algorithm; Arithmetic; Theoretical computer science; Computer hardware; Mathematics","score_opus":0.05533831300258389,"score_gpt":0.30217389553960045,"score_spread":0.24683558253701654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116444959","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16595344,0.00017257818,0.8317706,0.00003277712,0.0014154896,0.00037020448,0.00003345723,0.0000835413,0.00016791049],"genre_scores_gemma":[0.17313747,0.0000024410665,0.825923,0.00016805656,0.00003668735,0.00001044241,0.0000036144095,0.00001797052,0.0007003143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976008,0.00029201692,0.0004641955,0.0006783091,0.0004982781,0.00046639045],"domain_scores_gemma":[0.99843574,0.00031872577,0.00016605877,0.0005728487,0.00022642604,0.00028023444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045583915,0.0002626926,0.00047602947,0.000113713846,0.00016202703,0.00010366519,0.00050675723,0.000113071896,0.0002071101],"category_scores_gemma":[0.000114394104,0.00021401914,0.00011891636,0.00054269785,0.00007799803,0.00018150278,0.00029635956,0.00014287405,0.00015679337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001369239,0.0035828296,0.011996048,0.00030251604,0.00029875652,0.00022947525,0.001557093,0.6715159,0.286793,0.011232399,0.003242048,0.009113075],"study_design_scores_gemma":[0.0013595397,0.000060568476,0.00029540263,0.00013900608,0.0000144153155,0.00001597838,0.00016132109,0.972962,0.02330654,0.000044283817,0.0013123007,0.0003286361],"about_ca_topic_score_codex":0.0023605574,"about_ca_topic_score_gemma":0.0000036151337,"teacher_disagreement_score":0.30144614,"about_ca_system_score_codex":0.00008916337,"about_ca_system_score_gemma":0.00009684462,"threshold_uncertainty_score":0.87274474},"labels":[],"label_agreement":null},{"id":"W2117005707","doi":"10.1109/newcas.2005.1496664","title":"Optimized Distributed Processing of Scaling Factor-in CORDIC","year":2005,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"CORDIC; Computer science; Scaling; Factor (programming language); Scale factor (cosmology); Parallel computing; Path (computing); Very-large-scale integration; Algorithm; Iterative method; Mathematics; Field-programmable gate array; Computer hardware; Embedded system","score_opus":0.024718627889776943,"score_gpt":0.3039779492210318,"score_spread":0.2792593213312548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117005707","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007850682,0.000080300415,0.9907315,0.00051402824,0.000049164,0.000051488765,0.0000017438756,0.00005257008,0.0006685691],"genre_scores_gemma":[0.39314455,0.000002928738,0.60676336,0.00003141113,0.000016979602,0.0000015094719,3.7855676e-7,0.00000198851,0.000036862617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992734,0.00003769396,0.00020495155,0.00018183752,0.00013398234,0.00016810859],"domain_scores_gemma":[0.9995394,0.00006274848,0.00008919352,0.0002200097,0.000036878224,0.000051822524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018207487,0.00006863216,0.0001772539,0.000042105206,0.00004536933,0.000072276816,0.0004494263,0.000027568165,0.000020522846],"category_scores_gemma":[0.00006905551,0.000052719734,0.000038304333,0.0002133394,0.000029547211,0.00032090963,0.00010643352,0.00007037867,0.0000034756492],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024530802,0.00004147691,0.0003980708,0.0000065543736,0.0000016548458,0.0000020477964,0.00005447423,0.00080206845,0.00056072656,0.00070696615,0.000006728025,0.9974168],"study_design_scores_gemma":[0.0005036437,0.000020744043,0.0066044605,0.000039300332,0.0000012513283,0.000002343189,0.000014006763,0.98142713,0.009686949,0.0009703101,0.00060872216,0.00012116348],"about_ca_topic_score_codex":0.00003765352,"about_ca_topic_score_gemma":8.9870224e-7,"teacher_disagreement_score":0.9972956,"about_ca_system_score_codex":0.000018483257,"about_ca_system_score_gemma":0.00002935291,"threshold_uncertainty_score":0.21498483},"labels":[],"label_agreement":null},{"id":"W2118489076","doi":"10.1109/iscas.2015.7169114","title":"Efficient radix conversions for classes of radices","year":2015,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Radix (gastropod); Division (mathematics); Arithmetic; Computer science; Parallel computing; Integer (computer science); Algorithm; Fraction (chemistry); Mathematics","score_opus":0.06361355208152067,"score_gpt":0.3275038079313259,"score_spread":0.2638902558498052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118489076","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032680042,0.00008060974,0.9920403,0.00088016654,0.00039817844,0.00009662887,0.0000017223996,0.000045438934,0.0031889842],"genre_scores_gemma":[0.06818273,0.0000016726682,0.93121034,0.00014375438,0.000030602503,0.0000054688676,2.5839248e-7,0.0000022811082,0.0004228965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994804,0.00003013257,0.00010954962,0.00013633337,0.0001268377,0.000116745156],"domain_scores_gemma":[0.9993214,0.00025449184,0.00004441676,0.00018043259,0.000088158755,0.00011111778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002765761,0.000046860045,0.00010862221,0.000034111785,0.000026626618,0.000018332898,0.00032428553,0.000018314864,0.00000741033],"category_scores_gemma":[0.00010321948,0.000032832897,0.000046355108,0.00017528147,0.00003894072,0.000043938624,0.000078802484,0.000022814307,0.000008573071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018399705,0.00033974054,0.00023694942,0.00003633899,0.000034035795,0.0000031809554,0.00089494087,0.0014034649,0.002625514,0.7030123,0.016761089,0.2746341],"study_design_scores_gemma":[0.000671431,0.0003145045,0.000100842255,0.0000080662785,0.000006038154,0.000003286108,0.00018356704,0.9131946,0.013790157,0.008289623,0.06331938,0.0001184928],"about_ca_topic_score_codex":0.000018430816,"about_ca_topic_score_gemma":1.5600774e-7,"teacher_disagreement_score":0.91179115,"about_ca_system_score_codex":0.000009814272,"about_ca_system_score_gemma":0.000050012888,"threshold_uncertainty_score":0.13388868},"labels":[],"label_agreement":null},{"id":"W2119178646","doi":"10.1109/ccece.2007.279","title":"Design and Implementation of Decimal Reciprocal Unit","year":2007,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Lunds Universitet","keywords":"Decimal; Reciprocal; Arithmetic; Computer science; Field-programmable gate array; Lookup table; Table (database); Multiplication (music); Floating point; Double-precision floating-point format; Algorithm; Computer hardware; Mathematics; Programming language","score_opus":0.048125248478341195,"score_gpt":0.37327293362729086,"score_spread":0.32514768514894965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119178646","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011649623,0.00001595671,0.9877233,0.00010767159,0.000042735217,0.00006041821,8.101053e-8,0.000019846322,0.00038040517],"genre_scores_gemma":[0.094954245,0.000003213158,0.9049124,0.00009009792,0.000010605539,8.3722773e-7,8.217783e-8,0.0000013325185,0.000027173322],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995631,0.00003367443,0.00011605444,0.00010025653,0.0000864327,0.000100471734],"domain_scores_gemma":[0.9996402,0.00017836741,0.000028882934,0.00008014006,0.000028575256,0.000043829183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064576475,0.00003401948,0.00005501368,0.00003270327,0.000021898715,0.000015186516,0.00010934231,0.000012969924,0.000019425996],"category_scores_gemma":[0.000009389343,0.000026104046,0.000008888506,0.0001667678,0.000017158689,0.000114137765,0.000053863067,0.000023909446,0.0000016328229],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023499927,0.0000073569927,0.00062574947,0.0000013814655,0.0000019218876,0.0000013615518,0.00008610334,0.000001615938,0.0028434072,0.023501232,0.000017441109,0.9729101],"study_design_scores_gemma":[0.0013411089,0.00121246,0.14980148,0.000012391114,0.000010425476,0.000037700043,0.0006940307,0.06847835,0.70616764,0.06822831,0.00363234,0.00038374748],"about_ca_topic_score_codex":0.00003719488,"about_ca_topic_score_gemma":0.0000019391905,"teacher_disagreement_score":0.9725263,"about_ca_system_score_codex":0.0000035478884,"about_ca_system_score_gemma":0.0000119787765,"threshold_uncertainty_score":0.10644921},"labels":[],"label_agreement":null},{"id":"W2119490711","doi":"10.1142/s0218195900000085","title":"EXACT AND OPTIMAL CONVEX HULLS IN 2D","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Convex hull; Rounding; Mathematics; Hull; Floating point; Computation; Convex combination; Interval arithmetic; Algorithm; Convex set; Regular polygon; Combinatorics; Arithmetic; Convex optimization; Computer science; Geometry; Mathematical analysis","score_opus":0.011457383642419352,"score_gpt":0.31300177017626346,"score_spread":0.30154438653384413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119490711","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027689397,0.0004084247,0.9684378,0.002266051,0.0001530918,0.00014409208,0.000011055377,0.000020082423,0.00086998916],"genre_scores_gemma":[0.40130165,0.00015098673,0.59741855,0.00060011545,0.00035003907,0.00002839955,0.0000071035133,0.000008612572,0.0001345401],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983358,0.00006876232,0.000589789,0.00022587115,0.0006246864,0.00015513434],"domain_scores_gemma":[0.9985629,0.00049048767,0.00024592597,0.00012742939,0.00043825328,0.00013501788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045135373,0.00012151038,0.00021279491,0.0004597199,0.000057943307,0.00017938572,0.0008713034,0.00004635749,0.0001989751],"category_scores_gemma":[0.000030834017,0.00011487388,0.00008601678,0.0006183317,0.00007797658,0.00053025817,0.00008863005,0.00023296545,0.000043098204],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002117966,0.00024144752,0.00090468343,0.0000045820734,0.000070203416,0.000029868757,0.00010445173,0.03638298,0.00007101479,0.031481978,0.00012271688,0.9305649],"study_design_scores_gemma":[0.0037159647,0.00040119665,0.1118223,0.00013270733,0.000034419027,0.002111035,0.00012980736,0.21320595,0.00042210982,0.3749636,0.29225788,0.0008030252],"about_ca_topic_score_codex":0.0000073615897,"about_ca_topic_score_gemma":2.8934582e-7,"teacher_disagreement_score":0.9297619,"about_ca_system_score_codex":0.00006600023,"about_ca_system_score_gemma":0.00010364108,"threshold_uncertainty_score":0.46844208},"labels":[],"label_agreement":null},{"id":"W2121253617","doi":"10.1109/20.877764","title":"Dimensional analysis and constraint propagation systems applied to the design of electromagnetic devices","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Constraint (computer-aided design); Structuring; Set (abstract data type); Local consistency; Interval arithmetic; Interval (graph theory); Computational electromagnetics; Space (punctuation); Mathematical optimization; Applied mathematics; Algorithm; Theoretical computer science; Constraint satisfaction problem; Electromagnetic field; Mathematics; Mathematical analysis; Physics; Programming language","score_opus":0.014415060345806028,"score_gpt":0.23816061982779055,"score_spread":0.22374555948198452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121253617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007818004,0.000072299576,0.9910987,0.00040605082,0.00008184043,0.00036850214,0.0000056801196,0.000034207307,0.0001146932],"genre_scores_gemma":[0.7225272,0.00002339853,0.27713278,0.000123831,0.000011425867,0.000039959396,2.620775e-7,0.0000043879036,0.00013676852],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895644,0.00015298864,0.00023075567,0.00024966823,0.00024929966,0.00016082804],"domain_scores_gemma":[0.999283,0.00025871376,0.000046595695,0.00027899764,0.000052321444,0.000080354475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027736457,0.00011075789,0.00018260344,0.00012877808,0.00012400675,0.000072092516,0.00023049014,0.00003678072,0.00006092841],"category_scores_gemma":[0.0000023282125,0.000077342804,0.000048064492,0.0009643444,0.00007320529,0.000042988933,0.0000015436755,0.00010306529,0.000012876653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021950393,0.00009683244,0.0000021966137,0.000010681826,0.00007846615,0.0000012118537,0.00018635277,0.27848613,0.009979648,0.00061210763,0.000011039884,0.7105134],"study_design_scores_gemma":[0.00028337722,0.0012104049,0.0011603368,0.000016168477,0.00030821562,0.0000170886,0.000036085457,0.9780584,0.017950563,0.0003850051,0.00033603315,0.00023834416],"about_ca_topic_score_codex":0.0000351198,"about_ca_topic_score_gemma":0.0000051509573,"teacher_disagreement_score":0.71470916,"about_ca_system_score_codex":0.000011889561,"about_ca_system_score_gemma":0.000028658818,"threshold_uncertainty_score":0.3153948},"labels":[],"label_agreement":null},{"id":"W2123886643","doi":"10.1109/ccece.2008.4564605","title":"Software efficient implementation of GMSK modem for an automatic identification system transceiver","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Demodulation; Minimum-shift keying; Computer science; Digital signal processing; Software; Transceiver; Embedded system; Software-defined radio; Computer hardware; Bit error rate; Phase-shift keying; Computer network; Telecommunications; Operating system; Wireless; Channel (broadcasting)","score_opus":0.02680996116435334,"score_gpt":0.2504761636768973,"score_spread":0.22366620251254396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123886643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120064214,0.000024208579,0.87903225,0.00013425676,0.00012973897,0.00040051976,0.00001222674,0.0001704989,0.00003210464],"genre_scores_gemma":[0.8883976,0.00001005556,0.111389324,0.000045193192,0.000054570464,0.000078957724,0.0000049288274,0.000013398531,0.0000060281445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832165,0.000015549176,0.00040059362,0.0005329508,0.000245944,0.00048332114],"domain_scores_gemma":[0.9988352,0.00006359443,0.00012294046,0.0001565197,0.00038415848,0.00043759006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021122857,0.00023587023,0.00032921025,0.00031361487,0.00018484611,0.00018288936,0.00050404813,0.00009020638,0.00000441649],"category_scores_gemma":[0.000019517083,0.00022968848,0.00006217765,0.00043296572,0.00003865915,0.00030685312,0.000025658685,0.00015457647,0.0000018881102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008198123,0.00007038723,0.00041157685,0.00033314063,0.000044147357,0.0000063293296,0.0023539108,0.0010978932,0.003535083,0.39605626,0.000054174234,0.5960289],"study_design_scores_gemma":[0.0003099883,0.00042455536,0.006044323,0.00007588284,0.0000119005945,0.000033424778,0.00005332509,0.9903687,0.0018244516,0.00054435764,0.00003750668,0.00027156874],"about_ca_topic_score_codex":0.00089654105,"about_ca_topic_score_gemma":0.000054207227,"teacher_disagreement_score":0.9892708,"about_ca_system_score_codex":0.00012989416,"about_ca_system_score_gemma":0.00030853754,"threshold_uncertainty_score":0.9366424},"labels":[],"label_agreement":null},{"id":"W2125097461","doi":"10.1145/1101884.1101886","title":"Space-efficient evaluation of hypergeometric series","year":2005,"lang":"en","type":"article","venue":"ACM SIGSAM Bulletin","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Lethbridge","funders":"","keywords":"Series (stratigraphy); Binary number; Mathematics; Hypergeometric function; Hypergeometric distribution; Basic hypergeometric series; Computation; Algorithm; Double-precision floating-point format; Constant (computer programming); Applied mathematics; Computer science; Pure mathematics; Arithmetic","score_opus":0.03926145888206123,"score_gpt":0.3030860639389255,"score_spread":0.2638246050568643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125097461","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16463609,0.0020608858,0.77512836,0.049789634,0.0010090201,0.00058950967,0.0000073622437,0.0002510546,0.0065280953],"genre_scores_gemma":[0.38268992,0.000019695251,0.6166751,0.00016683944,0.000118724696,0.000017705373,8.9178275e-7,0.0000069110565,0.0003042333],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99828917,0.00021420587,0.000248099,0.0003021474,0.0007177941,0.0002286141],"domain_scores_gemma":[0.99848515,0.0003235758,0.00011926529,0.00073590485,0.00025788308,0.000078209756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016222892,0.00011127512,0.00017871804,0.00017693464,0.00006272477,0.000040919032,0.0007958638,0.00004518301,0.000514435],"category_scores_gemma":[0.0017450881,0.00009474261,0.00007037157,0.00094732695,0.000044686258,0.0000676887,0.00033463183,0.00008844346,0.00025699075],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049712417,0.00017611896,0.00009012628,0.000008513674,0.000012462363,0.0000012964201,0.0001763512,0.0046992977,0.00201121,0.00706957,0.0038399107,0.98191017],"study_design_scores_gemma":[0.0015391115,0.00053810584,0.011908272,0.000055752378,0.00006817743,0.000038955706,0.00011870386,0.22558823,0.07063412,0.009005232,0.67979896,0.00070638076],"about_ca_topic_score_codex":0.000017961273,"about_ca_topic_score_gemma":3.827395e-7,"teacher_disagreement_score":0.9812038,"about_ca_system_score_codex":0.000048025257,"about_ca_system_score_gemma":0.000049243834,"threshold_uncertainty_score":0.5632703},"labels":[],"label_agreement":null},{"id":"W2126235977","doi":"10.1109/iccd.2007.4601917","title":"Floating-point division algorithms for an x86 microprocessor with a rectangular multiplier","year":2007,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Division (mathematics); x86; Multiplier (economics); Microprocessor; Computer science; Division algorithm; Floating point; Algorithm; Point (geometry); Parallel computing; Arithmetic; Computer hardware; Mathematics; Software; Operating system; Geometry","score_opus":0.03208559869844244,"score_gpt":0.32738260642221867,"score_spread":0.2952970077237762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126235977","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071092984,0.00004971458,0.99097776,0.00028025778,0.00020554759,0.0003882627,0.0000023047958,0.00025669902,0.0007301412],"genre_scores_gemma":[0.022947215,0.000001668097,0.97596955,0.00052400056,0.00014489586,0.000016743317,0.0000025886757,0.00002250272,0.00037082305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982497,0.00004218129,0.00028079076,0.0006234344,0.00028966164,0.0005142156],"domain_scores_gemma":[0.99869967,0.00026244958,0.00010008479,0.0004959705,0.00019849202,0.00024334331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012113051,0.0001999114,0.00022966145,0.00009067627,0.00020166596,0.00016337326,0.00061799795,0.000071208946,0.000010790103],"category_scores_gemma":[0.00009471948,0.00013247864,0.000068607296,0.00047297523,0.000047379468,0.0004738923,0.00013073566,0.00012150965,0.000010124568],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028256078,0.00016230997,0.00010746152,0.000016051477,0.000012815706,0.000011767925,0.0004611773,0.000023655537,0.01715799,0.002165266,0.00008214935,0.9797711],"study_design_scores_gemma":[0.0029693057,0.00390153,0.002583944,0.000099386474,0.000022671129,0.000077474404,0.00049732055,0.67007047,0.2865733,0.0150203975,0.016898377,0.0012858381],"about_ca_topic_score_codex":0.0000690014,"about_ca_topic_score_gemma":0.00001584972,"teacher_disagreement_score":0.9784853,"about_ca_system_score_codex":0.000032350956,"about_ca_system_score_gemma":0.00003323598,"threshold_uncertainty_score":0.54023224},"labels":[],"label_agreement":null},{"id":"W2127458442","doi":"10.1109/asap.2007.4430003","title":"A Simple Central Processing Unit with Multi-Dimensional Logarithmic Number System Extensions","year":2007,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Logarithm; Multiplication (music); Computer science; Massively parallel; Simple (philosophy); Binary number; Division (mathematics); Parallel computing; Reduction (mathematics); Arithmetic; Base (topology); Algorithm; Mathematics; Combinatorics","score_opus":0.02922258930425549,"score_gpt":0.30841790871485714,"score_spread":0.27919531941060166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127458442","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014423663,0.000023071434,0.98326737,0.0001293469,0.00015156603,0.00014951499,0.0000011892668,0.0003429834,0.0015113157],"genre_scores_gemma":[0.36409032,2.1349001e-7,0.6352815,0.00025807924,0.000049232276,0.0000030974568,0.0000010707317,0.000009128098,0.0003073186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983505,0.000059537597,0.00024143973,0.00041887056,0.00033866306,0.00059101323],"domain_scores_gemma":[0.9990245,0.00013305688,0.00007767814,0.00030729864,0.0001717922,0.00028563812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040865608,0.00016711224,0.00019833134,0.0000538568,0.0002463859,0.000113153976,0.00035319442,0.000055915993,0.000030270827],"category_scores_gemma":[0.000021652275,0.000109485314,0.00004574407,0.00058235467,0.00006221391,0.00029993727,0.0001609225,0.00017002039,0.00005810103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009174899,0.0010547697,0.020007616,0.00019506973,0.00009263468,0.001675947,0.0007823185,0.001587758,0.0043459404,0.10821649,0.0005970708,0.8613526],"study_design_scores_gemma":[0.0011092057,0.00011527715,0.04069743,0.00013098677,0.000015484999,0.00069488876,0.00032832997,0.95104754,0.0018425438,0.0005385114,0.0029611418,0.00051868916],"about_ca_topic_score_codex":0.00012813754,"about_ca_topic_score_gemma":0.000021343072,"teacher_disagreement_score":0.94945973,"about_ca_system_score_codex":0.00004874415,"about_ca_system_score_gemma":0.00009871738,"threshold_uncertainty_score":0.44646814},"labels":[],"label_agreement":null},{"id":"W2128760591","doi":"10.1109/cacsd.1994.288930","title":"A knowledge-based system for control system design using MEDAL","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Expert system; Medal; USable; Software engineering; Knowledge-based systems; Controller (irrigation); Artificial intelligence; Human–computer interaction; Multimedia","score_opus":0.09622411135862424,"score_gpt":0.3046279500539558,"score_spread":0.20840383869533158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128760591","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002875017,0.00023774264,0.9965316,0.00012550612,0.0007599317,0.0005572615,0.0000025364582,0.0004412134,0.0013154421],"genre_scores_gemma":[0.30345836,1.1287239e-7,0.69616795,0.00006660714,0.00012305097,0.000052208714,6.925437e-8,0.000009515744,0.00012211157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985663,0.00030212858,0.00027271852,0.00035393806,0.0001583051,0.00034657004],"domain_scores_gemma":[0.99853814,0.00073625206,0.00008616259,0.0003605386,0.00013098247,0.00014790882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072119886,0.000148855,0.0003028961,0.00007495889,0.00016591579,0.00014935202,0.00050219137,0.000059637372,0.0000066936],"category_scores_gemma":[0.00004591712,0.000110920664,0.00011996095,0.00030463256,0.000021856316,0.00014220356,0.000025684332,0.000055203294,0.000047580503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006745221,0.00053243805,0.000056366225,0.0016691026,0.00018295817,0.00008846839,0.00044664906,0.016199235,0.014187919,0.34341398,0.0019597267,0.6211957],"study_design_scores_gemma":[0.0010398519,0.00012417488,0.0000023290347,0.00008354043,0.000015473493,0.000019677424,0.00003850638,0.99427736,0.0035451048,0.000058353766,0.00063414295,0.00016146859],"about_ca_topic_score_codex":0.000013611882,"about_ca_topic_score_gemma":1.9609206e-7,"teacher_disagreement_score":0.9780781,"about_ca_system_score_codex":0.00014367004,"about_ca_system_score_gemma":0.00003851093,"threshold_uncertainty_score":0.45232135},"labels":[],"label_agreement":null},{"id":"W2129905147","doi":"10.1007/978-3-540-30142-4_1","title":"Error Analysis of Digital Filters Using Theorem Proving","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Fixed-point arithmetic; Automated theorem proving; Computer science; Digital filter; Algorithm; Fixed point; Mathematical proof; Parametric statistics; Floating point; Arithmetic; Filter (signal processing); Mathematics; Discrete mathematics; Programming language","score_opus":0.030259835712247527,"score_gpt":0.29045335749546014,"score_spread":0.2601935217832126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129905147","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022808209,0.00010956868,0.9975448,0.00013806552,0.0006728725,0.00020091767,0.000015888483,0.000072136565,0.0010176144],"genre_scores_gemma":[0.13270655,0.000004311372,0.86687624,0.00022343497,0.00012198906,0.0000014870127,0.0000035198425,0.00002038903,0.000042061252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966568,0.000033808818,0.0005901718,0.0012605465,0.0009193286,0.0005393568],"domain_scores_gemma":[0.9975711,0.0005009761,0.0004439046,0.0011467604,0.00017997649,0.00015727736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007013913,0.00042878633,0.0008286185,0.0014596639,0.00014034279,0.00050548295,0.002688491,0.0002065087,0.000019974665],"category_scores_gemma":[0.00012662122,0.00035561842,0.0003179316,0.0021617173,0.00079598767,0.0007215547,0.0011650372,0.0005137466,0.0000035560176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002932055,0.000031412477,0.00008588082,0.000026463033,0.000102930666,0.00004794067,0.0004765979,0.19241896,0.00022894423,0.023834947,2.82591e-7,0.7827427],"study_design_scores_gemma":[0.00010477397,0.000100241574,0.000075225165,0.00017906558,0.00007354444,0.000012381971,2.2797944e-7,0.81190914,0.00066801195,0.18642047,0.000039343162,0.00041759695],"about_ca_topic_score_codex":0.00003432315,"about_ca_topic_score_gemma":0.0000060041248,"teacher_disagreement_score":0.7823251,"about_ca_system_score_codex":0.0002771871,"about_ca_system_score_gemma":0.00047764071,"threshold_uncertainty_score":0.99988955},"labels":[],"label_agreement":null},{"id":"W2130130502","doi":"10.1109/sfcs.1984.715894","title":"Log Depth Circuits For Division And Related Problems","year":2005,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Division (mathematics); Divisibility rule; Integer (computer science); Electronic circuit; Boolean circuit; Space (punctuation); Boolean function; Mathematics; Circuit complexity; Algorithm; Computer science; Discrete mathematics; Arithmetic; Engineering","score_opus":0.02844324645905073,"score_gpt":0.2895281330211929,"score_spread":0.2610848865621422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130130502","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014569517,0.00014204068,0.9920991,0.0017071125,0.00011255935,0.00016355327,3.3965551e-7,0.00011183192,0.0042064837],"genre_scores_gemma":[0.23651417,0.000012468505,0.7617577,0.00028271286,0.000030418178,0.0000119873675,4.163046e-7,0.000004746382,0.0013854045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993757,0.00002356186,0.0001228064,0.000235239,0.00008026504,0.00016245479],"domain_scores_gemma":[0.9996017,0.00011311798,0.000029015177,0.00015469457,0.00002672962,0.000074748415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023611505,0.000063071515,0.00008848619,0.000027231288,0.00006629495,0.00006723224,0.00018958189,0.000034897465,0.000010240809],"category_scores_gemma":[0.00003592663,0.000044974222,0.000026607262,0.00013997577,0.00001700798,0.00022824053,0.0000905286,0.000047250945,0.000014925846],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.1230827e-7,0.00001875675,0.00014625692,0.0000039158867,0.0000027333876,2.9236438e-7,0.00006447135,0.000021956512,0.0005040138,0.021334814,0.00013430648,0.97776836],"study_design_scores_gemma":[0.000933512,0.00035630513,0.011756372,0.00002805889,0.000005673588,0.000025302481,0.000007718019,0.81310076,0.0024439092,0.12222594,0.04877679,0.00033964272],"about_ca_topic_score_codex":0.00000548399,"about_ca_topic_score_gemma":0.0000016461895,"teacher_disagreement_score":0.97742873,"about_ca_system_score_codex":0.0000077245495,"about_ca_system_score_gemma":0.0000073572437,"threshold_uncertainty_score":0.18339956},"labels":[],"label_agreement":null},{"id":"W2130757597","doi":"10.1109/iscas.2008.4542127","title":"Efficient FPGA implementation of complex multipliers using the logarithmic number system","year":2008,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Polytechnique Montréal","funders":"","keywords":"Field-programmable gate array; Multiplier (economics); Computer science; Logarithm; Pipeline (software); Computer hardware; Realization (probability); Clock rate; Arithmetic; Embedded system; Parallel computing; Mathematics","score_opus":0.067071208832831,"score_gpt":0.3489269499089081,"score_spread":0.2818557410760771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130757597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11631411,0.0000058623423,0.8825026,0.000104745486,0.00017715433,0.00016523746,0.000001829522,0.000054983197,0.0006734379],"genre_scores_gemma":[0.5792805,4.699956e-7,0.42062673,0.000053554875,0.000018433639,0.0000028666207,2.712113e-7,0.0000027946176,0.000014397477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990267,0.000118606884,0.0002430605,0.00018560962,0.0002441741,0.000181824],"domain_scores_gemma":[0.99940646,0.00008482457,0.00010854862,0.00028773336,0.0000671606,0.000045272765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026694956,0.00008194734,0.00013692568,0.000026815509,0.00018712363,0.000021392323,0.00037429712,0.000018803075,0.000036196547],"category_scores_gemma":[0.0000059563718,0.000050487717,0.00006068392,0.00031165383,0.00007776261,0.00004441652,0.00014198963,0.000052720745,0.000012685488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018620995,0.00043442292,0.010653581,0.00018736732,0.00019502947,0.00007712474,0.009158322,0.062792,0.04994618,0.11626899,0.0010602531,0.7492081],"study_design_scores_gemma":[0.0003037931,0.000021939963,0.005514397,0.000007260827,0.0000049234513,0.00008775766,0.0009839009,0.9840363,0.008684239,0.000068394926,0.00019191031,0.000095168565],"about_ca_topic_score_codex":0.0005092225,"about_ca_topic_score_gemma":0.0000014425184,"teacher_disagreement_score":0.9212443,"about_ca_system_score_codex":0.000051286395,"about_ca_system_score_gemma":0.00003548436,"threshold_uncertainty_score":0.20588294},"labels":[],"label_agreement":null},{"id":"W2131222327","doi":"10.1023/a:1022268319273","title":"Adaptive Monotone Rational Approximation on Finite Sets","year":2003,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Monotonic function; Monotone polygon; Mathematics; Theory of computation; Interval (graph theory); Code (set theory); Set (abstract data type); Applied mathematics; Discrete mathematics; Algorithm; Combinatorics; Computer science; Mathematical analysis","score_opus":0.03546421941878482,"score_gpt":0.2899272823238965,"score_spread":0.25446306290511167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131222327","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010330816,0.000055865516,0.99058086,0.0008419561,0.00059263443,0.00025124295,0.00000794891,0.00021712878,0.007349051],"genre_scores_gemma":[0.046834257,0.000008902005,0.95132786,0.0012189378,0.00012475134,0.00008845508,0.000007582264,0.00002058943,0.0003686618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974906,0.00036845682,0.00036401436,0.00067686505,0.00064096064,0.00045912847],"domain_scores_gemma":[0.998415,0.00057904917,0.00014045417,0.00048459697,0.00012217708,0.00025874903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004419088,0.00027261704,0.00031510153,0.00011386897,0.00021270246,0.0001409888,0.0005009248,0.00010650045,0.0000853757],"category_scores_gemma":[0.00033430106,0.00022876037,0.00013575434,0.0008793721,0.000065292275,0.0004260815,0.00008132615,0.00032865338,0.00036689235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017319288,0.0004707191,0.0000342667,0.000004961416,0.000034698107,0.000030085896,0.00018696494,0.0020369745,0.00013357896,0.30830446,0.0005629438,0.688183],"study_design_scores_gemma":[0.00058027095,0.0005581035,0.0005509815,0.000014554199,0.0000067169203,0.000022308775,0.000024991507,0.8994955,0.0030690818,0.07848873,0.016741985,0.00044679167],"about_ca_topic_score_codex":0.000011650144,"about_ca_topic_score_gemma":8.064721e-8,"teacher_disagreement_score":0.8974585,"about_ca_system_score_codex":0.00008288283,"about_ca_system_score_gemma":0.000083577695,"threshold_uncertainty_score":0.93285775},"labels":[],"label_agreement":null},{"id":"W2133323787","doi":"10.1504/ijhpsa.2011.040467","title":"A RISC architecture for 2DLNS-based signal processing","year":2011,"lang":"en","type":"article","venue":"International Journal of High Performance Systems Architecture","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"CMC Microsystems","keywords":"Computer science; Digital signal processing; Architecture; Computer architecture; Parallel computing; Computation; Signal processing; Representation (politics); Multiplication (music); Coprocessor; Reduced instruction set computing; Embedded system; Instruction set; Computer hardware; Algorithm","score_opus":0.021467394392861494,"score_gpt":0.2709714346652626,"score_spread":0.24950404027240108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133323787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029449442,0.00033919344,0.967268,0.00062045996,0.0018038142,0.00021988862,0.000014542959,0.000048061964,0.0002366262],"genre_scores_gemma":[0.60815793,0.000005272767,0.3907511,0.00015493901,0.00084838,0.000017141376,0.0000017808949,0.000015164149,0.00004829559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997781,0.00011139959,0.0006961589,0.00027429496,0.00080927904,0.0003279122],"domain_scores_gemma":[0.99796224,0.0001468337,0.00074113405,0.00021398741,0.0007775011,0.00015829732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071880384,0.00023802665,0.0003747951,0.0004258574,0.00012813351,0.00020015074,0.0018144511,0.00009231872,0.000017776601],"category_scores_gemma":[0.00003904764,0.00016523743,0.00020803043,0.00024183841,0.000070988004,0.00040697373,0.00010183983,0.00046589348,0.000005341882],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039590578,0.00019761668,0.0005737955,0.0002024407,0.00016762497,0.00011285468,0.0013755604,0.029558629,0.0014587467,0.0018969493,0.00018222303,0.9638777],"study_design_scores_gemma":[0.008455896,0.0055496595,0.01037697,0.0037124946,0.00012810639,0.007806747,0.00019666064,0.7988916,0.03302764,0.033822633,0.096132435,0.0018991611],"about_ca_topic_score_codex":0.000027593529,"about_ca_topic_score_gemma":0.000001208016,"teacher_disagreement_score":0.9619785,"about_ca_system_score_codex":0.00007169013,"about_ca_system_score_gemma":0.00021690287,"threshold_uncertainty_score":0.6738187},"labels":[],"label_agreement":null},{"id":"W2134470982","doi":"10.1109/iscas.2011.5938158","title":"A study on resistive-type truncated CVNS Distributed Neural Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Noise (video); Resistive touchscreen; Computer science; Artificial neural network; Artificial intelligence","score_opus":0.08475696188919818,"score_gpt":0.30943120658778167,"score_spread":0.2246742446985835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134470982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026842188,0.000012599962,0.9688924,0.00015677682,0.0006762918,0.0002282343,0.0000014946603,0.00029848173,0.0028915422],"genre_scores_gemma":[0.91655,0.0000010159177,0.08283958,0.0002883126,0.000064185144,0.000009919044,0.0000022468814,0.000007929097,0.00023685329],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99870074,0.00022644809,0.00018874629,0.0004052942,0.0001807264,0.00029804814],"domain_scores_gemma":[0.9990966,0.00012480543,0.00005410172,0.0005105487,0.00007830668,0.00013568753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025323487,0.00014501934,0.00018355057,0.000042245447,0.00010732987,0.000065599845,0.0006498165,0.00003849969,0.000048086644],"category_scores_gemma":[0.00007745988,0.00010153335,0.000046770052,0.0007749345,0.000030998082,0.00013503217,0.00019971239,0.00017112351,0.000037599726],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061154726,0.009061138,0.05017369,0.000009472297,0.0003585408,0.0013103104,0.004385123,0.0010037903,0.0003056265,0.11003864,0.00841773,0.8143244],"study_design_scores_gemma":[0.0008456841,0.0034085403,0.5194448,0.000007857968,0.000018322331,0.000008942536,0.00023226313,0.4713859,0.0003883326,0.003288168,0.0005055135,0.00046563856],"about_ca_topic_score_codex":0.00009221662,"about_ca_topic_score_gemma":0.0000035139549,"teacher_disagreement_score":0.88970774,"about_ca_system_score_codex":0.000018114722,"about_ca_system_score_gemma":0.000012190258,"threshold_uncertainty_score":0.41404095},"labels":[],"label_agreement":null},{"id":"W2134620537","doi":"10.1109/ccece.1999.807264","title":"Digit-serial digit-online addition","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Numerical digit; Computer science; Adder; Emulation; Arithmetic; Serial communication; Computer hardware; Mathematics; Telecommunications; Psychology","score_opus":0.023012422187147188,"score_gpt":0.27829423470103026,"score_spread":0.2552818125138831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134620537","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021295962,0.000010659914,0.9697997,0.000411146,0.0007440043,0.000058497146,0.000007642352,0.00018875835,0.026649985],"genre_scores_gemma":[0.020938924,0.0000076085003,0.97625697,0.00077355845,0.00020691226,0.0000061094383,0.0000071275535,0.000006620208,0.0017961806],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918383,0.00006334117,0.00014418873,0.000247427,0.00015710607,0.00020411125],"domain_scores_gemma":[0.99945176,0.00008895584,0.000033790886,0.00028394646,0.000036058787,0.00010549458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000867135,0.000088021494,0.000104619416,0.00003038034,0.00005603234,0.0001645174,0.0002895788,0.000033166292,0.00023714399],"category_scores_gemma":[0.0001307007,0.000066795175,0.000050981198,0.0002620024,0.000022255552,0.00044511238,0.00006109491,0.000066043656,0.00009738481],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014521297,0.00013010984,0.00004461796,0.0000019828972,0.0000052656733,0.000007726413,0.000019019108,0.0000075655207,0.0004866748,0.16000484,0.0023473408,0.8369434],"study_design_scores_gemma":[0.0008334667,0.00031255887,0.0011148412,0.0000147933115,0.0000052200753,0.00004586019,0.000029800454,0.01181141,0.041324757,0.18280642,0.76112425,0.0005765952],"about_ca_topic_score_codex":0.000006964959,"about_ca_topic_score_gemma":9.3599965e-7,"teacher_disagreement_score":0.83636683,"about_ca_system_score_codex":0.000012941796,"about_ca_system_score_gemma":0.000026978078,"threshold_uncertainty_score":0.27238283},"labels":[],"label_agreement":null},{"id":"W2135526242","doi":"10.1109/iscas.2014.6865615","title":"High-speed FFT processors based on redundant number systems","year":2014,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Fast Fourier transform; Adder; Operand; Computer science; Parallel computing; Coprocessor; Multiplier (economics); Binary number; Arithmetic; Computer hardware; Latency (audio); Algorithm; Mathematics; Telecommunications","score_opus":0.014148220458314261,"score_gpt":0.2677238959681255,"score_spread":0.25357567550981125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135526242","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013430025,0.000004644721,0.976149,0.001362061,0.0009291825,0.00012540331,6.448409e-7,0.00028123945,0.01980479],"genre_scores_gemma":[0.36892232,7.2440486e-7,0.6274917,0.001087112,0.00019311745,0.000011542465,7.200617e-7,0.000012054594,0.0022807086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985658,0.0001786524,0.00020664757,0.00040632987,0.0003595776,0.00028302526],"domain_scores_gemma":[0.99893886,0.00024156549,0.00007336125,0.00052565977,0.00007240584,0.00014812438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000562342,0.00014146189,0.00021727018,0.00004229197,0.000089084824,0.00021446624,0.0005999005,0.000049333394,0.000051069306],"category_scores_gemma":[0.00010504511,0.00009608123,0.000051375948,0.00036019282,0.000029166435,0.000148044,0.00006945098,0.00010829303,0.00037469453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019473498,0.00037391912,0.00042323934,0.000108217726,0.000019978756,0.000018506824,0.00010805875,0.004375883,0.0014011244,0.79688734,0.004707841,0.19155645],"study_design_scores_gemma":[0.00030459077,0.00014113594,0.0003002374,0.00003544335,0.000002488526,0.0000043181244,0.0000058291785,0.97721153,0.0014977533,0.003588576,0.016709585,0.00019852424],"about_ca_topic_score_codex":0.00013231549,"about_ca_topic_score_gemma":4.3789353e-7,"teacher_disagreement_score":0.97283566,"about_ca_system_score_codex":0.000023509996,"about_ca_system_score_gemma":0.000029707668,"threshold_uncertainty_score":0.4816065},"labels":[],"label_agreement":null},{"id":"W2136511364","doi":"10.1109/ccece.2007.317","title":"FPGA Implementation and Performance Evaluation of a Digital Carrier Synchronizer Using Different Numerically Controlled Oscillators","year":2007,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Synchronizer; Field-programmable gate array; Demodulation; Computer science; Lookup table; Synchronization (alternating current); Embedded system; Digital electronics; Phase-locked loop; Emulation; Electronic engineering; Computer hardware; Electronic circuit; Engineering; Electrical engineering; Telecommunications; Jitter","score_opus":0.03488506565078323,"score_gpt":0.3480327066057627,"score_spread":0.31314764095497943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136511364","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.507467,0.000031321855,0.49196187,0.000022289512,0.00008033875,0.00018313453,0.0000010205075,0.000014041312,0.00023904945],"genre_scores_gemma":[0.93264717,0.000004330481,0.06726727,0.000030455396,0.00002910856,0.0000052917967,8.7999035e-7,0.0000045355505,0.00001096629],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864584,0.0000663912,0.00034154256,0.00021930419,0.00052376994,0.00020315753],"domain_scores_gemma":[0.9992951,0.00012757636,0.00014108181,0.00015835138,0.00018894278,0.00008891632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009965331,0.000107930755,0.00023523219,0.00007356233,0.00006807312,0.00008652635,0.00012614696,0.000027109534,0.000036004654],"category_scores_gemma":[0.00005131192,0.000075266,0.000048326205,0.0002148397,0.000040775623,0.0004177901,0.00008780938,0.000044561733,6.4109696e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025051895,0.000028119635,0.011534647,0.000005705996,0.000023898561,3.6533035e-7,0.00013496343,0.000045545305,0.0016922684,0.00044672532,0.000002120152,0.98606056],"study_design_scores_gemma":[0.004495263,0.00033859408,0.07441946,0.000014489837,0.000057182,0.00000988535,0.00023155288,0.9015145,0.017406816,0.001245593,0.00003709603,0.00022961857],"about_ca_topic_score_codex":0.000016909607,"about_ca_topic_score_gemma":0.0000018024173,"teacher_disagreement_score":0.98583096,"about_ca_system_score_codex":0.00007461791,"about_ca_system_score_gemma":0.000052340176,"threshold_uncertainty_score":0.30692583},"labels":[],"label_agreement":null},{"id":"W2136617430","doi":"10.1109/iscas.2012.6271460","title":"Design and implementation of a Radix-100 division unit","year":2012,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Radix (gastropod); Divisor (algebraic geometry); Decimal; Division (mathematics); Initialization; Quotient; Computer science; Arithmetic; Greatest common divisor; Division algorithm; Parallel computing; Mathematics; Algorithm; Discrete mathematics","score_opus":0.059845922551351544,"score_gpt":0.370374186297669,"score_spread":0.3105282637463175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136617430","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013626509,0.00007154841,0.9858622,0.00013208415,0.00006868977,0.00006830615,1.4877624e-7,0.000019098341,0.0001514107],"genre_scores_gemma":[0.31209385,0.000006256807,0.6878165,0.0000452989,0.00000981436,0.0000017140334,1.16209684e-7,0.0000012162824,0.000025247029],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99957186,0.00008123506,0.00008582222,0.000071511255,0.00008144409,0.00010814064],"domain_scores_gemma":[0.9996897,0.00011023826,0.000031095904,0.00009713417,0.000015322214,0.000056514138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037829412,0.00003628124,0.00005850514,0.000027703445,0.000025186204,0.000016453781,0.000098370714,0.0000103193515,0.000036134737],"category_scores_gemma":[0.000005867123,0.000026046488,0.00000972999,0.00013585962,0.000011461,0.00027538784,0.00007586096,0.00001916348,0.000003412377],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.838612e-7,0.000017910956,0.0027171127,0.0000028527504,0.0000026786518,1.172901e-7,0.00031843493,0.000002040396,0.0033461142,0.023160359,0.00004678904,0.97038513],"study_design_scores_gemma":[0.0017915022,0.0010929991,0.35654193,0.000027251019,0.000022286073,0.000021919437,0.00069285877,0.17325781,0.4171442,0.04080423,0.007988983,0.00061402255],"about_ca_topic_score_codex":0.0000432892,"about_ca_topic_score_gemma":1.3091186e-7,"teacher_disagreement_score":0.9697711,"about_ca_system_score_codex":0.000002919812,"about_ca_system_score_gemma":0.000006283457,"threshold_uncertainty_score":0.10621449},"labels":[],"label_agreement":null},{"id":"W2137831111","doi":"10.1109/ccece.2007.346","title":"A Technology-Independent Logarithmic Converter IP Block","year":2007,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Block (permutation group theory); Computer science; CMOS; USable; Logarithm; Computer hardware; Electronic engineering; Mathematics; Engineering","score_opus":0.012920728899103456,"score_gpt":0.27326013592376114,"score_spread":0.2603394070246577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137831111","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024671666,0.000047709633,0.9864121,0.0023143783,0.00040507063,0.000096845215,2.1685871e-7,0.00039822396,0.007858291],"genre_scores_gemma":[0.25666893,0.0000033305992,0.7404973,0.0010747082,0.000056953435,0.0000045926095,1.0591106e-7,0.0000058973596,0.0016881997],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885994,0.000019877358,0.00019064872,0.00034499101,0.0002080453,0.00037651297],"domain_scores_gemma":[0.9992729,0.000071959425,0.00004096672,0.00045074712,0.00005426687,0.0001091727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048558836,0.00011021252,0.00014120157,0.0001719875,0.00006508879,0.000056354856,0.00075149414,0.0001058918,0.0000501831],"category_scores_gemma":[0.000028958217,0.000083634106,0.000050580747,0.0005714473,0.000058654703,0.00013685528,0.00030115244,0.00018970313,0.00024329309],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001939132,0.00006733015,0.000566913,0.000002360869,0.000011969854,0.000087898516,0.000036378344,4.2811493e-7,0.0021908623,0.10040019,0.00032912072,0.8963046],"study_design_scores_gemma":[0.0034328802,0.0012038545,0.022795115,0.000060713814,0.000030975185,0.0013759856,0.000451604,0.16831823,0.2807903,0.29067683,0.22863498,0.002228536],"about_ca_topic_score_codex":0.000020549403,"about_ca_topic_score_gemma":0.000004024931,"teacher_disagreement_score":0.89407605,"about_ca_system_score_codex":0.000028041391,"about_ca_system_score_gemma":0.000022847844,"threshold_uncertainty_score":0.34105},"labels":[],"label_agreement":null},{"id":"W2138131169","doi":"10.1007/s12532-013-0052-9","title":"Local cuts for mixed-integer programming","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Cutting-plane method; Integer programming; Travelling salesman problem; Mathematics; Linear programming relaxation; Context (archaeology); Mathematical optimization; Relaxation (psychology); Theory of computation; Space (punctuation); Integer (computer science); Hyperplane; Point (geometry); Plane (geometry); Range (aeronautics); Linear programming; Algorithm; Computer science; Combinatorics; Geometry","score_opus":0.02548378838351857,"score_gpt":0.30913257376755415,"score_spread":0.2836487853840356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138131169","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046488622,0.000032575997,0.9958323,0.0011320056,0.00027666986,0.0014396672,4.4029673e-7,0.00057613145,0.00024532527],"genre_scores_gemma":[0.120855846,3.1571335e-7,0.87820834,0.00012276696,0.00007963993,0.00060615473,0.0000058024193,0.000023616034,0.00009749244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979713,0.00009957097,0.0004988388,0.0004927666,0.00036405673,0.0005734657],"domain_scores_gemma":[0.99837565,0.00071435294,0.00014898146,0.00028587485,0.00025597838,0.00021913677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058970234,0.00023058575,0.00032634923,0.000092385584,0.00018907026,0.0006548927,0.00048130692,0.00009537105,0.000014562298],"category_scores_gemma":[0.0002519881,0.00018563448,0.00016769826,0.000431875,0.00011280939,0.0005060687,0.00016448513,0.00016174662,0.00023967476],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015406767,0.00019067289,0.0000045233332,0.00011397047,0.0000151441145,0.0000017315363,0.0001979607,0.00016115127,0.000027880116,0.062636316,0.0003096269,0.9363395],"study_design_scores_gemma":[0.0002469706,0.00021221432,0.000029473136,0.000050785104,0.00000995716,0.000016193577,0.00008217083,0.7313723,0.00022026822,0.26213965,0.0054008686,0.00021914323],"about_ca_topic_score_codex":0.000012017001,"about_ca_topic_score_gemma":3.2760013e-7,"teacher_disagreement_score":0.93612033,"about_ca_system_score_codex":0.000054478765,"about_ca_system_score_gemma":0.000029797891,"threshold_uncertainty_score":0.7569954},"labels":[],"label_agreement":null},{"id":"W2140571294","doi":"10.1016/j.tcs.2004.01.013","title":"The abc conjecture and correctly rounded reciprocal square roots","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Conjecture; Reciprocal; Square root; Square (algebra); Mathematics; Point (geometry); Code (set theory); Constant (computer programming); Computation; Collatz conjecture; Scheme (mathematics); Combinatorics; Discrete mathematics; Computer science; Algorithm; Mathematical analysis; Geometry","score_opus":0.008188843754170748,"score_gpt":0.26321091355238313,"score_spread":0.2550220697982124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140571294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014521293,0.00012143969,0.97704756,0.0059206304,0.0011430741,0.00018395885,8.075389e-7,0.000179598,0.00088160986],"genre_scores_gemma":[0.63202506,0.000015722242,0.3670843,0.00072904496,0.00012694286,0.00000631679,1.3309507e-7,0.0000059605045,0.0000065503064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743134,0.00015665799,0.00025706802,0.00077581574,0.0006837149,0.0006953778],"domain_scores_gemma":[0.99800557,0.0006640898,0.00006678866,0.0007493117,0.00013767117,0.00037658785],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016784341,0.00021431275,0.00021655826,0.000067127956,0.0012684664,0.0011557288,0.0021968852,0.00006329212,0.000004671903],"category_scores_gemma":[0.00021255613,0.00012543393,0.00006024941,0.0011044198,0.0041760462,0.00047480324,0.001082788,0.00034048603,0.0000274472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041857215,0.000023831566,0.000008484392,0.0000017104319,0.00000195555,0.000010991889,0.00019123754,0.000040911098,0.000107083535,0.7517368,0.00000892112,0.24786384],"study_design_scores_gemma":[0.00043008552,0.0004223264,0.0011732685,0.00003001298,0.0000027670571,0.00016263475,0.000015995147,0.12514374,0.0019741983,0.869711,0.00068169954,0.0002523245],"about_ca_topic_score_codex":0.000010112522,"about_ca_topic_score_gemma":0.0000016750404,"teacher_disagreement_score":0.61750376,"about_ca_system_score_codex":0.000073665185,"about_ca_system_score_gemma":0.00016334285,"threshold_uncertainty_score":0.99988115},"labels":[],"label_agreement":null},{"id":"W2140736088","doi":"10.1109/newcas.2006.250901","title":"On the Design of a Double Precision Logarithmic Number System Arithmetic Unit","year":2006,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"CORDIC; Computer science; Arithmetic; Logarithm; Floating-point unit; Microprocessor; Latency (audio); Clock rate; Parallel computing; Computer hardware; Floating point; Interpolation (computer graphics); Series (stratigraphy); Saturation arithmetic; Arbitrary-precision arithmetic; Cache; Table (database); Double-precision floating-point format; Mathematics; Algorithm; Field-programmable gate array; Telecommunications","score_opus":0.0412253742137817,"score_gpt":0.281485395339671,"score_spread":0.2402600211258893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140736088","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016335894,0.00001382638,0.97805566,0.0003918661,0.00018900566,0.00028221385,5.7561846e-7,0.00010285804,0.01933041],"genre_scores_gemma":[0.32215598,0.0000011063372,0.6762661,0.000091772985,0.00003931156,0.000021906659,2.1540879e-7,0.000007196706,0.001416406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869835,0.0002664098,0.00025288327,0.00025608696,0.00032635074,0.00019992012],"domain_scores_gemma":[0.99826586,0.0009836793,0.00009108423,0.00054015324,0.00007976615,0.000039453065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082704244,0.000115422605,0.00017708779,0.000043966003,0.00008868031,0.000084873616,0.00071353785,0.000046121422,0.000050723258],"category_scores_gemma":[0.000026661763,0.000061694525,0.00006079164,0.0005129671,0.000045124358,0.00010132004,0.00012994814,0.00010785116,0.00014369581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001466577,0.00009423883,0.000036948604,0.000010970082,0.0000069864136,0.0000065810236,0.000020054793,0.0012541013,0.0004910494,0.97379255,0.0007792427,0.023492597],"study_design_scores_gemma":[0.0011418856,0.0003166535,0.0008958813,0.0001616656,0.000015999123,0.00006578659,0.000063236395,0.8252437,0.030135293,0.13975388,0.0018381646,0.00036784066],"about_ca_topic_score_codex":0.0002561076,"about_ca_topic_score_gemma":8.3976533e-7,"teacher_disagreement_score":0.8340387,"about_ca_system_score_codex":0.000024073099,"about_ca_system_score_gemma":0.000028612689,"threshold_uncertainty_score":0.25158298},"labels":[],"label_agreement":null},{"id":"W2141682399","doi":"10.1007/978-3-642-30885-7_8","title":"Preventing Arithmetic Overflows in Alloy","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Counterexample; Spurious relationship; Computer science; Bounded function; Semantics (computer science); Programming language; Arithmetic; Range (aeronautics); Key (lock); Theoretical computer science; Algorithm; Discrete mathematics; Mathematics; Operating system","score_opus":0.02226271050203656,"score_gpt":0.27457102186265875,"score_spread":0.2523083113606222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141682399","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000092198134,0.0012051418,0.9937073,0.00041738918,0.0020922117,0.00033453162,0.0000016774578,0.00010831697,0.0020412346],"genre_scores_gemma":[0.021451712,0.00006468969,0.9766712,0.0008690587,0.00058888097,0.000010771888,0.0000011531818,0.000033584358,0.00030890366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582916,0.00009186818,0.00064614543,0.0014456533,0.00094897125,0.0010381675],"domain_scores_gemma":[0.9974634,0.0007023029,0.00027958988,0.0012151819,0.00009909446,0.00024042149],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019843918,0.0005244477,0.00065597706,0.0008105425,0.00014184829,0.00041481134,0.0031408423,0.00030066533,0.000033913835],"category_scores_gemma":[0.00016525868,0.0004689283,0.00015655765,0.0009176383,0.00038215073,0.00076097326,0.0018002257,0.0011124739,0.000055871948],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000124379,0.000039866427,0.00019023176,0.000025088068,0.0000042239176,0.000058961192,0.0002589946,0.0028864427,0.00013266347,0.0096364,0.0000024570622,0.9867634],"study_design_scores_gemma":[0.0003662721,0.00015391898,0.0012695664,0.00067157176,0.0000087332255,0.00008940673,1.11507994e-7,0.69572574,0.0008964481,0.29566792,0.004026202,0.0011240795],"about_ca_topic_score_codex":0.00004238955,"about_ca_topic_score_gemma":0.000028166905,"teacher_disagreement_score":0.98563933,"about_ca_system_score_codex":0.00027348465,"about_ca_system_score_gemma":0.00027117407,"threshold_uncertainty_score":0.99977624},"labels":[],"label_agreement":null},{"id":"W2141987758","doi":"10.1016/j.amc.2009.10.012","title":"Blending implicit interval curves and surfaces","year":2009,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Interval (graph theory); Mathematics; Interval arithmetic; Mathematical analysis; Geometry; Combinatorics","score_opus":0.022240295227680208,"score_gpt":0.2977170133105186,"score_spread":0.27547671808283836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141987758","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030358264,0.00027930355,0.96734107,0.00062939164,0.000031401487,0.00010889905,3.8189955e-7,0.000066639695,0.0011846768],"genre_scores_gemma":[0.2813373,0.00010393227,0.71823186,0.00030222558,0.000012795682,0.000002922565,7.390453e-7,0.0000029243038,0.0000053183517],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994473,0.000007960711,0.00015536889,0.00017799705,0.00010093003,0.00011047431],"domain_scores_gemma":[0.9996517,0.00012313231,0.000071313894,0.00008526904,0.000017305589,0.000051306215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020748177,0.00008639816,0.0001488994,0.00003164861,0.000074979034,0.00012263254,0.000102453065,0.00002048958,7.2950763e-7],"category_scores_gemma":[0.000008212686,0.00007176986,0.000013753635,0.000113262104,0.000018281511,0.00010249203,0.000065912274,0.000049931386,0.0000017589657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.3309705e-7,0.000034731274,0.000003640787,0.00007448008,0.000004740509,8.140552e-7,0.00039976597,0.000032131702,0.0021845866,0.28470182,0.000055321332,0.7125073],"study_design_scores_gemma":[0.0001592141,0.000083201245,0.0010191117,0.00008586252,0.000007924186,0.000017828506,0.00007113678,0.44496566,0.0006597675,0.5527184,0.0000678046,0.00014405538],"about_ca_topic_score_codex":0.0000014759576,"about_ca_topic_score_gemma":8.558223e-8,"teacher_disagreement_score":0.71236324,"about_ca_system_score_codex":0.0000045053157,"about_ca_system_score_gemma":0.000004410286,"threshold_uncertainty_score":0.292669},"labels":[],"label_agreement":null},{"id":"W2143581900","doi":"10.1109/asap.2003.1212843","title":"A floating-point CORDIC based SVD processor","year":2004,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"CORDIC; Computer science; Computation; Parallel computing; Singular value decomposition; Floating point; Computer hardware; Computational science; Fixed-point arithmetic; Algorithm; Field-programmable gate array","score_opus":0.015086061521323144,"score_gpt":0.2698592292911693,"score_spread":0.25477316776984615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143581900","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009721991,0.000021563412,0.9894708,0.004159902,0.00016930491,0.000091444286,3.1060267e-7,0.00025802915,0.0048564402],"genre_scores_gemma":[0.10813507,6.3358914e-7,0.8895532,0.002076425,0.000047231366,0.000007969912,2.2826218e-7,0.000005092131,0.00017418987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913955,0.000029928115,0.00014240957,0.00027474161,0.00019114447,0.00022220929],"domain_scores_gemma":[0.99944997,0.00006328449,0.00004192127,0.00028392888,0.000052074007,0.000108828266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022704147,0.00009070744,0.000116132105,0.000040370243,0.0000738995,0.000097434946,0.0004600642,0.000025893518,0.00006576156],"category_scores_gemma":[0.000092006754,0.000066074426,0.000049127495,0.00042646422,0.00002557421,0.00019893082,0.00008757445,0.00008278667,0.00012448464],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006191641,0.00033817257,0.00013785427,0.00004268728,0.000010830094,0.000056120884,0.00031160432,0.0012060199,0.0041314755,0.12701909,0.00031357037,0.8664264],"study_design_scores_gemma":[0.0030642608,0.0009967169,0.0022746746,0.00012490561,0.000010971774,0.000044264725,0.000079262085,0.59109867,0.123948336,0.26805642,0.009299893,0.001001615],"about_ca_topic_score_codex":0.00007814858,"about_ca_topic_score_gemma":0.0000020106793,"teacher_disagreement_score":0.86542475,"about_ca_system_score_codex":0.000025356721,"about_ca_system_score_gemma":0.00009292199,"threshold_uncertainty_score":0.2694437},"labels":[],"label_agreement":null},{"id":"W2143972262","doi":"10.1117/12.406502","title":"&lt;title&gt;Nonlinear signal processing using index calculus DBNS arithmetic&lt;/title&gt;","year":2000,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Signal processing; Representation (politics); Digital signal processing; Dynamic range; Range (aeronautics); Arithmetic; Binary number; Algorithm; Speech processing; Speech recognition; Mathematics; Computer hardware; Computer vision","score_opus":0.015274226636533038,"score_gpt":0.2558410371923289,"score_spread":0.24056681055579587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143972262","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91146505,0.0004796106,0.034564372,0.0019167857,0.0005525933,0.0005388723,0.000036040212,0.0002873748,0.050159324],"genre_scores_gemma":[0.031360544,0.00006491945,0.9663106,0.00015562368,0.0007191052,0.000027765549,0.000002392275,0.00005154623,0.0013074628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983368,3.5765108e-8,0.0004115776,0.0003423162,0.0005713093,0.00033798537],"domain_scores_gemma":[0.9989904,0.000062065425,0.00016939672,0.000059307255,0.00060030655,0.00011849427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039375175,0.00022178073,0.00028442396,0.00007569996,0.00008522121,0.00016544503,0.0009169453,0.00014030184,0.00013445012],"category_scores_gemma":[0.00010464161,0.00018237001,0.00033061634,0.00042582361,0.00014210619,0.00039519067,0.00013989575,0.000253487,0.000018025781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032576787,0.00023616196,0.000052310916,0.00036751278,0.00026062934,8.9755963e-7,0.00019464358,0.00032142407,0.20436072,0.6274254,0.004656866,0.1620909],"study_design_scores_gemma":[0.00040032802,0.00012462366,0.00008699558,0.00020195902,0.000054540495,0.000029074268,0.0000519579,0.9119366,0.014351909,0.0028139267,0.06959548,0.00035264838],"about_ca_topic_score_codex":0.0000035138453,"about_ca_topic_score_gemma":2.1265297e-8,"teacher_disagreement_score":0.93174624,"about_ca_system_score_codex":0.000095922995,"about_ca_system_score_gemma":0.000054322456,"threshold_uncertainty_score":0.74368334},"labels":[],"label_agreement":null},{"id":"W2144397004","doi":"10.1109/tc.2010.266","title":"Computational Vector-Magnitude-Based Range Determination for Scientific Abstract Data Types","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Computational complexity theory; Scalar (mathematics); Range (aeronautics); Key (lock); Modulo; Theoretical computer science; Satisfiability; Computational science; Block (permutation group theory); Algorithm; Computer engineering; Mathematics","score_opus":0.055371385950592815,"score_gpt":0.32539545675151266,"score_spread":0.27002407080091984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144397004","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025977364,0.0000057901925,0.98981196,0.00083381607,0.0060760733,0.00032351248,0.000112001166,0.00021211704,0.000026981546],"genre_scores_gemma":[0.38054964,3.1790944e-7,0.6190776,0.00020805765,0.000081103826,0.000023851402,0.000022084338,0.000011267618,0.000026075262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839175,0.000047183876,0.00025604139,0.00067901745,0.00035606473,0.00026996955],"domain_scores_gemma":[0.99786824,0.0008861691,0.00009291153,0.00083393604,0.00018376563,0.00013494873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054969836,0.00017607241,0.00017056361,0.00022656373,0.000453961,0.00047269036,0.0012731226,0.000075201446,0.00002622517],"category_scores_gemma":[0.000016803277,0.00016931871,0.00010592538,0.00041577162,0.00012827497,0.0005816038,0.000008517954,0.000271763,0.0000393957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017141598,0.00030573472,0.0000045126694,0.000021067975,0.000019025401,0.0000043061627,0.000057069312,0.04142708,0.0014203254,0.00052126637,0.00038536944,0.9558171],"study_design_scores_gemma":[0.0006253373,0.00010873545,0.00047604917,0.000018276085,0.000014190474,0.0000062983618,0.000002135779,0.9920312,0.0027836603,0.000999774,0.0027169187,0.0002174292],"about_ca_topic_score_codex":0.000012009963,"about_ca_topic_score_gemma":0.000022437905,"teacher_disagreement_score":0.95559967,"about_ca_system_score_codex":0.000026862932,"about_ca_system_score_gemma":0.00013396163,"threshold_uncertainty_score":0.69046164},"labels":[],"label_agreement":null},{"id":"W2145660355","doi":"10.1109/mwscas.2005.1594354","title":"Error analysis of FIR filters implemented with 1-digit 2-dimensional logarithmic number systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Finite impulse response; Logarithm; Digital filter; Algorithm; Variance (accounting); Filter (signal processing); Computer science; Reduction (mathematics); Impulse (physics); Linear filter; Arithmetic; Mathematics","score_opus":0.02064610220527882,"score_gpt":0.3031119482476305,"score_spread":0.2824658460423517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145660355","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0375366,0.000021574673,0.95874757,0.0007487747,0.000109470006,0.00015817987,0.00002342548,0.00010660819,0.0025478262],"genre_scores_gemma":[0.38896617,0.000001126546,0.6095799,0.00033705845,0.00003669008,0.0000127405765,0.000010906963,0.000007017033,0.0010483618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985651,0.000082855266,0.0003357536,0.00035135174,0.00039247566,0.00027250595],"domain_scores_gemma":[0.99904066,0.00015811666,0.00013589415,0.00043509193,0.00011132374,0.00011891802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023187266,0.00013951941,0.00036195962,0.00015618827,0.00005214171,0.00006531022,0.00042243968,0.000036127076,0.00033170448],"category_scores_gemma":[0.00001070429,0.00009251182,0.000110367386,0.0013160295,0.000045941353,0.00026953415,0.00013541909,0.00007920358,0.00003415473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016785777,0.0021056675,0.04883385,0.00013995395,0.011853258,0.00014561974,0.0010150746,0.15924774,0.0065266346,0.13225406,0.022047138,0.6156631],"study_design_scores_gemma":[0.00049328187,0.0001271463,0.0054049604,0.000015512069,0.00017106914,0.00002015758,0.00004933897,0.9804975,0.0012942092,0.000088228015,0.011574694,0.00026389564],"about_ca_topic_score_codex":0.00034090914,"about_ca_topic_score_gemma":0.000030686348,"teacher_disagreement_score":0.8212498,"about_ca_system_score_codex":0.000034032153,"about_ca_system_score_gemma":0.00003831911,"threshold_uncertainty_score":0.37725228},"labels":[],"label_agreement":null},{"id":"W2147123689","doi":"10.1109/cjece.2007.364327","title":"A new algorithm for finding the optimal solution of the least absolute value estimation problem","year":2007,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Least absolute deviations; Algorithm; Value (mathematics); Mathematical optimization; Estimation; Computer science; Mathematics; Statistics; Engineering","score_opus":0.009453302953869485,"score_gpt":0.22120612998919234,"score_spread":0.21175282703532286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147123689","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012695767,0.00037666102,0.99715894,0.0006934187,0.00038532363,0.00010253068,7.138862e-7,0.000006484285,0.000006317689],"genre_scores_gemma":[0.049361534,0.000002989292,0.9502518,0.000068223555,0.0002949371,8.73283e-7,1.0658515e-7,0.0000058352716,0.000013694088],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991794,0.000020389794,0.00027948234,0.00009727091,0.00012950922,0.00029391982],"domain_scores_gemma":[0.99921364,0.0002369632,0.0001265773,0.00009553845,0.000075708,0.00025156068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053684757,0.00008838797,0.00014311446,0.00012034433,0.00012400006,0.00008140079,0.0004069418,0.000038417915,5.1371535e-7],"category_scores_gemma":[0.000043777683,0.00005455695,0.00009152422,0.0004220907,0.000018064304,0.00014665183,0.000030798874,0.00019901257,1.17706264e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001455643,0.0000038651638,0.000015019199,0.000006138702,0.000019208555,0.000004098806,0.00013260286,0.022656819,0.00011288089,0.008700019,0.00017041442,0.9681775],"study_design_scores_gemma":[0.00020798508,0.0001547128,0.0024558094,0.000043519372,0.000010407237,0.00016187128,0.000001416135,0.99387664,0.00043423608,0.0012168491,0.0013647568,0.00007177703],"about_ca_topic_score_codex":0.00019936667,"about_ca_topic_score_gemma":0.000015555572,"teacher_disagreement_score":0.97121984,"about_ca_system_score_codex":0.0000639262,"about_ca_system_score_gemma":0.00022503964,"threshold_uncertainty_score":0.2224768},"labels":[],"label_agreement":null},{"id":"W2147326654","doi":"10.1109/icis.2008.97","title":"Convergence Analysis of Jacobi Iterative Method Using Logarithmic Number System","year":2008,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan; CMC Microsystems","keywords":"Jacobi method; Logarithm; Convergence (economics); Iterative method; Jacobi eigenvalue algorithm; Computer science; Constraint (computer-aided design); Applied mathematics; Mathematical optimization; Floating point; Mathematics; Algorithm; Mathematical analysis","score_opus":0.04638021523409191,"score_gpt":0.3447272514047174,"score_spread":0.29834703617062547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147326654","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014325252,0.000021436197,0.9830318,0.0000303008,0.00016644222,0.00007464268,0.0000038039966,0.00007565321,0.0022706527],"genre_scores_gemma":[0.23139353,0.000003337285,0.7682575,0.00006346797,0.00001747964,0.0000027359808,4.717087e-7,0.0000035849885,0.00025790153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846905,0.00033948803,0.00034623538,0.00037046903,0.00026847707,0.00020626473],"domain_scores_gemma":[0.9988975,0.00026244373,0.00015629437,0.00041444873,0.00017668652,0.00009263114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043323822,0.00012675177,0.0004640485,0.00016422503,0.00010581999,0.000026050076,0.00046945945,0.000047333928,0.000112255846],"category_scores_gemma":[0.000029088098,0.00009799573,0.00019989199,0.002376433,0.00006192123,0.00027065846,0.0001609416,0.00008068377,0.000018347138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003847071,0.0007174581,0.090582944,0.0002486581,0.0066773705,0.00061006856,0.009772585,0.029237116,0.05214578,0.69907594,0.00044808214,0.11044554],"study_design_scores_gemma":[0.00009286425,0.000021014204,0.0028659601,0.000009940892,0.00010268418,0.000053490126,0.0000695718,0.9890418,0.0073070317,0.00019846385,0.000098478835,0.00013871086],"about_ca_topic_score_codex":0.00040130725,"about_ca_topic_score_gemma":0.000001968715,"teacher_disagreement_score":0.95980465,"about_ca_system_score_codex":0.000046804667,"about_ca_system_score_gemma":0.000047450692,"threshold_uncertainty_score":0.399615},"labels":[],"label_agreement":null},{"id":"W2148482408","doi":"10.1109/isit.1994.395018","title":"Search procedures for very low rate quasi-optimal convolutional codes","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Computer science; Serial concatenated convolutional codes; Algorithm; Turbo code; Concatenated error correction code; Block code; Decoding methods","score_opus":0.043674470397610014,"score_gpt":0.30736767732931547,"score_spread":0.26369320693170545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148482408","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033063851,0.00011730789,0.99338925,0.0018487573,0.00019176654,0.00016999229,0.0000053922213,0.00011710837,0.0008540522],"genre_scores_gemma":[0.08181481,0.000018059594,0.9140359,0.00067217863,0.00015706458,0.000040473325,0.0000012797705,0.00000686939,0.003253354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900144,0.00006872316,0.00013830759,0.00030019082,0.00018039484,0.00031093345],"domain_scores_gemma":[0.9992131,0.00036975692,0.000024221168,0.00018114246,0.000107080494,0.00010468816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034350675,0.000095348376,0.00013064532,0.0000434176,0.0001361125,0.00011729339,0.00040462444,0.000036637164,0.00013527807],"category_scores_gemma":[0.0001191421,0.00007358262,0.00006916413,0.00020203515,0.00006592728,0.00024780535,0.00009787108,0.000075348304,0.00009010055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004519644,0.0010905628,0.0005457141,0.0001956543,0.00008354836,0.000020059704,0.0006045965,0.0011945323,0.007069454,0.52091616,0.037744492,0.43049005],"study_design_scores_gemma":[0.00034326685,0.00023727417,0.00055303035,0.000010620995,0.0000020805646,0.000009208175,0.000018962106,0.98530257,0.005259328,0.0042972337,0.0038018257,0.0001645958],"about_ca_topic_score_codex":0.000009546816,"about_ca_topic_score_gemma":6.9063054e-7,"teacher_disagreement_score":0.98410803,"about_ca_system_score_codex":0.00001925426,"about_ca_system_score_gemma":0.00004358024,"threshold_uncertainty_score":0.3000612},"labels":[],"label_agreement":null},{"id":"W2151641706","doi":"10.1109/iscas.2008.4541511","title":"A novel decimal-to-decimal logarithmic converter","year":2008,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decimal; Computer science; Arithmetic; Logarithm; Mathematics","score_opus":0.04315103663352693,"score_gpt":0.27999601444877115,"score_spread":0.23684497781524422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151641706","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003212172,0.000014690171,0.9885661,0.0018064943,0.00040342563,0.00012301095,0.0000014137978,0.00019253482,0.005680134],"genre_scores_gemma":[0.04896547,0.000004001482,0.9442958,0.0046364567,0.00009722597,0.000013864093,2.7869993e-7,0.000009076958,0.001977819],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867725,0.00003276657,0.00020225266,0.00044347928,0.00027604395,0.00036817792],"domain_scores_gemma":[0.9990494,0.00013358395,0.000031473304,0.00046922694,0.00007197695,0.00024433318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016899171,0.00014323767,0.0002012387,0.00008870042,0.00012146343,0.000064232074,0.0008042223,0.000047942136,0.00012327362],"category_scores_gemma":[0.00005951875,0.000110179324,0.00008087912,0.0004677807,0.00005570266,0.0002648783,0.00034481357,0.00011716524,0.00070298323],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020140033,0.00052884046,0.001553316,0.000007596389,0.00004283535,0.00023476795,0.0007760639,0.000027820568,0.029015075,0.08252421,0.012601153,0.8726682],"study_design_scores_gemma":[0.003957655,0.0013997577,0.103154995,0.000044283745,0.000016491715,0.002463978,0.00006246747,0.61942065,0.024499273,0.013524464,0.22913617,0.002319835],"about_ca_topic_score_codex":0.00008770268,"about_ca_topic_score_gemma":0.0000015933058,"teacher_disagreement_score":0.87034833,"about_ca_system_score_codex":0.000024005538,"about_ca_system_score_gemma":0.000055919645,"threshold_uncertainty_score":0.9035662},"labels":[],"label_agreement":null},{"id":"W2152494213","doi":"10.1109/ismvl.2012.36","title":"Complexity Study of the Continuous Valued Number System Adders","year":2012,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Adder; Computer science; Operand; Arithmetic; Binary number; Redundancy (engineering); Mathematics; Algorithm; Latency (audio); Telecommunications","score_opus":0.054636617296167596,"score_gpt":0.3104786803961886,"score_spread":0.255842063100021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152494213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22498865,0.00001700467,0.7543126,0.00012908521,0.001194482,0.0003864512,9.4824856e-7,0.00012753918,0.018843241],"genre_scores_gemma":[0.83460546,6.278733e-8,0.1650485,0.000073947784,0.00004577694,0.000006046338,3.063412e-8,0.0000031581385,0.0002170303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99885684,0.00034115062,0.0001894215,0.0001381768,0.00026235194,0.00021205007],"domain_scores_gemma":[0.99918354,0.00008794243,0.00008899657,0.0005167741,0.0000491522,0.00007359697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005023246,0.00007789116,0.00018481516,0.000010282689,0.00008334708,0.000027279773,0.0006545496,0.000019163068,0.000033275697],"category_scores_gemma":[0.000025662133,0.00004207705,0.00005864385,0.00028124748,0.00004897485,0.00014491205,0.00030946243,0.000071721115,0.00003222048],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007512503,0.0021921108,0.20528768,0.000051711704,0.0001265973,0.000003034511,0.0059151268,0.000009217075,0.00024008477,0.7171694,0.0018588628,0.06713864],"study_design_scores_gemma":[0.0038760265,0.0007390014,0.8557127,0.00010017671,0.00011337185,0.000115274735,0.02682591,0.094789006,0.0052909013,0.006739823,0.004594727,0.0011030475],"about_ca_topic_score_codex":0.0002455847,"about_ca_topic_score_gemma":0.0000027536314,"teacher_disagreement_score":0.7104296,"about_ca_system_score_codex":0.000015080272,"about_ca_system_score_gemma":0.000009252727,"threshold_uncertainty_score":0.17158522},"labels":[],"label_agreement":null},{"id":"W2152694458","doi":"10.48550/arxiv.1505.05571","title":"Fast exact summation using small and large superaccumulators","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rounding; Computer science; Floating point; Exponent; Simple (philosophy); Algorithm; Set (abstract data type); Sign (mathematics); Point (geometry); Arithmetic; Mathematics","score_opus":0.1721135326766977,"score_gpt":0.24333264004153377,"score_spread":0.07121910736483605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152694458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36836085,0.000050767336,0.6308111,0.000021984351,0.00033914525,0.00010848651,0.000008874091,0.00008991598,0.00020887048],"genre_scores_gemma":[0.8978139,0.000049578208,0.10174665,0.000053718475,0.00009094489,2.4582013e-7,0.0000070872757,0.000015096022,0.0002227497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983813,0.0002260333,0.00016113497,0.0008284684,0.00008002476,0.0003230289],"domain_scores_gemma":[0.9987054,0.000086099,0.0001517154,0.0006596681,0.00015060641,0.0002465291],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004792241,0.00025046009,0.00030791768,0.00017976225,0.00013755391,0.00018152151,0.00076239614,0.00020586813,0.0000086198],"category_scores_gemma":[0.000045818797,0.00026797352,0.000096600896,0.0004053562,0.0000539647,0.00039598194,0.0018357737,0.00037996806,0.000013654175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009314764,0.00078468845,0.062047053,0.0005891844,0.00048634503,0.0014843628,0.0034935528,0.354227,0.0006590573,0.4707279,0.0002710306,0.10513669],"study_design_scores_gemma":[0.00033022373,0.0000294002,0.0009518718,0.00004925455,0.000031830306,0.00000542557,0.00007163709,0.95937496,0.00006237493,0.038155455,0.00058873935,0.000348841],"about_ca_topic_score_codex":0.00019559449,"about_ca_topic_score_gemma":0.000011153403,"teacher_disagreement_score":0.60514796,"about_ca_system_score_codex":0.00014503395,"about_ca_system_score_gemma":0.00013099887,"threshold_uncertainty_score":0.99997723},"labels":[],"label_agreement":null},{"id":"W2152795079","doi":"10.1093/comjnl/bxp023","title":"Verifying a Synthesized Implementation of IEEE-754 Floating-Point Exponential Function using HOL","year":2009,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Library science; Computer science; Point (geometry); Art history; Management; History; Mathematics","score_opus":0.03781534554123004,"score_gpt":0.32767521011262674,"score_spread":0.2898598645713967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152795079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076889396,0.00005505878,0.9210114,0.0005201141,0.0013800905,0.00009212555,4.2120695e-7,0.000033231237,0.000018178063],"genre_scores_gemma":[0.46880198,0.0000070215106,0.5302688,0.00033585384,0.0005792676,4.5776815e-7,1.619247e-7,0.000004705439,0.0000017867964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984616,0.0003645292,0.00042433315,0.00017048963,0.0003333551,0.0002456836],"domain_scores_gemma":[0.9990903,0.00012259917,0.0003637438,0.00024373058,0.00010206826,0.000077520555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010546206,0.00012265082,0.00019921067,0.00009127095,0.00031235104,0.00022861503,0.00053892354,0.000028312372,0.00002082611],"category_scores_gemma":[0.000010366604,0.00008392019,0.00013487278,0.00020991251,0.000026040529,0.00044169414,0.00008289491,0.00023674258,0.0000029873197],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018854053,0.00004073355,0.000029265908,0.0000035613623,0.000033682867,0.000008764796,0.0007448277,0.0012474175,0.03893371,0.0011464567,0.00010845562,0.9576843],"study_design_scores_gemma":[0.0016541333,0.0009525881,0.008242583,0.00012631794,0.000088108434,0.000753633,0.00019705227,0.9137278,0.03791034,0.035613313,0.00037252242,0.0003615869],"about_ca_topic_score_codex":0.000022017131,"about_ca_topic_score_gemma":3.1311274e-7,"teacher_disagreement_score":0.95732266,"about_ca_system_score_codex":0.00003953895,"about_ca_system_score_gemma":0.00006455865,"threshold_uncertainty_score":0.3422166},"labels":[],"label_agreement":null},{"id":"W2153846939","doi":"10.1109/tnn.2006.883002","title":"The Impact of Arithmetic Representation on Implementing MLP-BP on FPGAs: A Study","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Arithmetic; Field-programmable gate array; Representation (politics); Parallel computing; Theoretical computer science; Computer architecture; Mathematics; Computer hardware","score_opus":0.035797712668031376,"score_gpt":0.36823864259842787,"score_spread":0.3324409299303965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153846939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11228161,0.000013283429,0.8861257,0.0001877417,0.0007508805,0.00040814362,0.0000025106926,0.00007518412,0.00015496089],"genre_scores_gemma":[0.99456674,0.0000135329565,0.0050916616,0.000121945704,0.00011422845,0.000023040267,4.1104275e-7,0.00001446005,0.0000539676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798626,0.0002929662,0.00043731436,0.00040436446,0.00038718223,0.0004919294],"domain_scores_gemma":[0.9976705,0.0013769444,0.00016936148,0.00060656125,0.00006514924,0.000111495574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096623914,0.00019525064,0.00021033181,0.00012814817,0.00047482882,0.00012482188,0.00047865743,0.00004796972,0.00000978048],"category_scores_gemma":[0.000013599578,0.00012500466,0.00023666344,0.00086433295,0.00004750463,0.00015665553,0.000005817405,0.0004932714,0.0000039534107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009844339,0.0004438505,0.00009721832,9.953685e-7,0.000052755182,0.000011871607,0.00016278643,0.27943462,0.00011095733,0.00008939225,0.00004536271,0.7194517],"study_design_scores_gemma":[0.0007706085,0.0036769141,0.010163772,0.000024627561,0.000025264251,0.000010269947,0.00020040946,0.9817755,0.0026408643,0.00046558867,0.000033079166,0.00021305874],"about_ca_topic_score_codex":0.00022828329,"about_ca_topic_score_gemma":0.000038906375,"teacher_disagreement_score":0.8822851,"about_ca_system_score_codex":0.00006279366,"about_ca_system_score_gemma":0.000014640381,"threshold_uncertainty_score":0.50975424},"labels":[],"label_agreement":null},{"id":"W2154489416","doi":"10.1109/isspa.2001.949836","title":"An on-line CORDIC based 2-D IDCT implementation using distributed arithmetic","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"CORDIC; Computer science; Very-large-scale integration; Parallel computing; Block (permutation group theory); Arithmetic; Adder; Computation; Computer hardware; CMOS; Algorithm; Embedded system; Field-programmable gate array; Mathematics; Electronic engineering","score_opus":0.1015332003149012,"score_gpt":0.38466634489817986,"score_spread":0.28313314458327865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154489416","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008886688,0.00000989339,0.98974365,0.0007599667,0.0001855406,0.00010627326,0.000011253623,0.00014580783,0.00015092219],"genre_scores_gemma":[0.38044706,0.0000010738302,0.6186798,0.0007874372,0.000050039915,0.000003778126,0.000009014448,0.000005362071,0.000016425685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889845,0.00013118533,0.00019310057,0.00030816885,0.00022828527,0.0002408264],"domain_scores_gemma":[0.99929625,0.00009606692,0.000059047587,0.00037157827,0.000046036163,0.00013100098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021269472,0.00011074191,0.000125966,0.00006905486,0.00011486496,0.00013804565,0.00034042608,0.000025560032,0.00039099995],"category_scores_gemma":[0.00001871528,0.00008936681,0.000044229622,0.0005020497,0.00002129971,0.0002525638,0.000036379046,0.000075389136,0.00003217275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003054537,0.00033056916,0.00044180488,0.000005091824,0.000008150017,0.000020151609,0.000037376656,0.003506703,0.0032611028,0.0071965726,0.00027002458,0.98491937],"study_design_scores_gemma":[0.00038516414,0.00037213444,0.0006267296,0.000004408809,0.000004639114,0.0000034833008,0.00001524934,0.99164677,0.0050930753,0.0011687917,0.0005429194,0.0001366332],"about_ca_topic_score_codex":0.00009023122,"about_ca_topic_score_gemma":0.0000022611302,"teacher_disagreement_score":0.98814005,"about_ca_system_score_codex":0.000040975272,"about_ca_system_score_gemma":0.000012448707,"threshold_uncertainty_score":0.42811754},"labels":[],"label_agreement":null},{"id":"W2154758172","doi":"10.1109/20.952668","title":"The use of interval mathematics in electromagnetic design","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Interval (graph theory); Process (computing); Computer science; Function (biology); Electromagnetism; Electromagnetics; Mathematical optimization; Applied mathematics; Mathematics; Physics; Engineering physics; Quantum mechanics","score_opus":0.07329594397173386,"score_gpt":0.2828399444887979,"score_spread":0.20954400051706404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154758172","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003161892,0.000054699784,0.99569017,0.00054841896,0.0002592235,0.00017602454,0.000001113603,0.000039128954,0.00006932723],"genre_scores_gemma":[0.069465786,0.0004170575,0.92930067,0.00010417258,0.00001121229,0.00002217617,4.5827854e-8,0.000011463627,0.0006674425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886423,0.00017081377,0.00032164148,0.00017624006,0.00021108826,0.00025598254],"domain_scores_gemma":[0.9984125,0.000969496,0.00006432219,0.00044904204,0.00004951719,0.000055128265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026700695,0.00011701002,0.00015399794,0.00009374476,0.00008294337,0.000089970694,0.000474043,0.000046833127,0.000019666772],"category_scores_gemma":[0.000022876397,0.00008540775,0.00007087987,0.0005967524,0.00008341784,0.00012324924,0.0000030856052,0.00021173565,0.000012604139],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022211978,0.00039804226,0.0000041097305,0.000008296978,0.000009942941,0.000014316504,0.00031161433,0.008757168,0.0038525877,0.0011943394,0.00005286593,0.9853745],"study_design_scores_gemma":[0.0005080239,0.0021572243,0.00027314937,0.000051145656,0.000022275102,0.00005782316,0.000042737363,0.9547487,0.027248662,0.011010849,0.003611676,0.0002677486],"about_ca_topic_score_codex":0.000017764502,"about_ca_topic_score_gemma":0.000010629984,"teacher_disagreement_score":0.98510677,"about_ca_system_score_codex":0.000023499475,"about_ca_system_score_gemma":0.000028308708,"threshold_uncertainty_score":0.34828272},"labels":[],"label_agreement":null},{"id":"W2157265006","doi":"10.1155/s0161171202012899","title":"On constrained uniform approximation","year":2002,"lang":"en","type":"article","venue":"International Journal of Mathematics and Mathematical Sciences","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"King Fahd University of Petroleum and Minerals; University of Alberta","keywords":"Mathematics; Generalization; Uniqueness; Hermite polynomials; Convergence (economics); Applied mathematics; Work (physics); Calculus (dental); Mathematical analysis","score_opus":0.04508577417861007,"score_gpt":0.3144215874656488,"score_spread":0.2693358132870387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157265006","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009390234,0.0000422187,0.97256637,0.0039320206,0.00027079476,0.000057860903,0.0000010030419,0.000016921042,0.01372256],"genre_scores_gemma":[0.14748281,0.000051686402,0.85208607,0.00024116285,0.000067801084,0.0000014606059,4.9901e-8,0.0000031449993,0.000065827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984888,0.00002465511,0.00045306535,0.00012295766,0.00077493186,0.0001356295],"domain_scores_gemma":[0.9986054,0.00070587825,0.0003220519,0.00009675222,0.00016326115,0.00010671431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010139806,0.00009648697,0.00019635168,0.00014887108,0.00007637671,0.00028190445,0.0008179414,0.000030655752,0.00012860358],"category_scores_gemma":[0.00061139045,0.000059654063,0.00007033101,0.00016916022,0.00019765727,0.00039506255,0.00009598392,0.00010540473,0.000024918552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.8520145e-7,0.00022125697,0.000001976329,0.000011899416,0.000017386405,0.0000128040365,0.00040894758,0.000017820304,0.0001474706,0.92897487,0.00010990599,0.07007487],"study_design_scores_gemma":[0.00020233224,0.00021339871,0.000005753219,0.00009987068,0.000004415057,0.00030681043,0.00011780983,0.28964004,0.0003365516,0.7088032,0.00019761312,0.00007220723],"about_ca_topic_score_codex":3.639458e-7,"about_ca_topic_score_gemma":4.7925134e-8,"teacher_disagreement_score":0.28962222,"about_ca_system_score_codex":0.000018424165,"about_ca_system_score_gemma":0.00001499041,"threshold_uncertainty_score":0.2718411},"labels":[],"label_agreement":null},{"id":"W2159401583","doi":"10.5555/1874620.1874889","title":"Finite precision bit-width allocation using SAT-modulo theory","year":2009,"lang":"en","type":"article","venue":"Design, Automation, and Test in Europe","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Modulo; Bit (key); Context (archaeology); Computer science; Finite field; Algorithm; Division (mathematics); Arithmetic; Mathematics; Discrete mathematics","score_opus":0.032130310794171495,"score_gpt":0.2864878461000372,"score_spread":0.2543575353058657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159401583","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008960701,0.00018714608,0.9898065,0.00026440585,0.00013556035,0.0001856083,9.298354e-7,0.00017375544,0.00028542202],"genre_scores_gemma":[0.28803486,0.00006716346,0.71133906,0.0004141073,0.00005618322,0.0000030454576,0.0000030433553,0.000008787261,0.000073782874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985151,0.00047102128,0.00029628875,0.00033566653,0.0001896177,0.00019225657],"domain_scores_gemma":[0.99818206,0.001210091,0.000111933245,0.00029340593,0.00013190582,0.000070599664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012039995,0.00013511843,0.0001492123,0.00016321418,0.00013418446,0.00018585304,0.0002851403,0.00004450147,0.000005492874],"category_scores_gemma":[0.0012187362,0.000114375,0.000019158913,0.0009614719,0.000030917956,0.0005522589,0.000047588997,0.00009136822,0.000018356799],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057963557,0.00015244252,0.0007118187,0.000008235649,0.0000030478627,0.00001183261,0.0006767726,0.0028607273,0.005792368,0.019154131,0.00004653875,0.9705763],"study_design_scores_gemma":[0.00024404291,0.00020020342,0.08125257,0.000056998237,0.00000453926,0.000014514116,0.0000050759027,0.84979284,0.0011601126,0.06650236,0.00058388815,0.0001828536],"about_ca_topic_score_codex":0.00000671171,"about_ca_topic_score_gemma":2.9684708e-7,"teacher_disagreement_score":0.9703934,"about_ca_system_score_codex":0.000022003289,"about_ca_system_score_gemma":0.00004534213,"threshold_uncertainty_score":0.4664077},"labels":[],"label_agreement":null},{"id":"W2159907637","doi":"10.5555/1356802.1356904","title":"Faster projection based methods for circuit level verification","year":2008,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Reachability; Very-large-scale integration; Flip-flop; Formal verification; Computation; Transistor; Digital electronics; Reduction (mathematics); Projection (relational algebra); Computer engineering; Electronic circuit; Functional verification; Embedded system; Computer hardware; Algorithm; Electrical engineering; Engineering","score_opus":0.23190064172941766,"score_gpt":0.39893578764126963,"score_spread":0.16703514591185198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159907637","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000083998835,0.000009062008,0.9970993,0.0005115305,0.00036944658,0.00025624942,0.0000010672803,0.00013784252,0.0015315197],"genre_scores_gemma":[0.0036054289,0.0000016421972,0.9944671,0.00050857535,0.00006685047,0.00008974978,0.0000015066587,0.0000061641813,0.0012529913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918133,0.00013356413,0.00014533865,0.00028860173,0.00009337581,0.00015781898],"domain_scores_gemma":[0.9993043,0.00021816097,0.000049097358,0.00028871975,0.000089380985,0.00005034584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005005267,0.00007655124,0.00010341542,0.000060837763,0.00013368367,0.00003882699,0.00025996222,0.000039855913,0.000014874469],"category_scores_gemma":[0.000096599106,0.00006110182,0.00006446413,0.0002914705,0.000022772729,0.00023451116,0.000024850466,0.000048027872,0.000012664405],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022824825,0.00003825745,0.000031632768,0.0000055824685,0.0000031244865,2.9661703e-7,0.000076880315,0.0000036331198,0.00817633,0.014650095,0.0002014023,0.97681046],"study_design_scores_gemma":[0.0004025718,0.00016587271,0.0037070513,0.000003982814,0.0000038211597,0.00001396959,0.000010043917,0.89068574,0.06377772,0.009934668,0.031095421,0.00019914682],"about_ca_topic_score_codex":0.000016632273,"about_ca_topic_score_gemma":2.1583018e-7,"teacher_disagreement_score":0.9766113,"about_ca_system_score_codex":0.000024268744,"about_ca_system_score_gemma":0.00005281053,"threshold_uncertainty_score":0.24916598},"labels":[],"label_agreement":null},{"id":"W2160829946","doi":"10.1109/ccece.1998.682562","title":"On the distribution of exponent differences during floating point addition","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Concordia University","funders":"","keywords":"Exponent; Adder; Class (philosophy); A priori and a posteriori; Point (geometry); Distribution (mathematics); Mathematics; Probability density function; Statistical physics; Power consumption; Power (physics); Computer science; Mathematical analysis; Physics; Statistics; Artificial intelligence; Telecommunications; Quantum mechanics; Geometry","score_opus":0.032809701327877284,"score_gpt":0.23100535847261397,"score_spread":0.1981956571447367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160829946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24165279,0.000010088658,0.7556983,0.0014775094,0.00009056971,0.000049288876,0.0000033425765,0.000038060865,0.0009800278],"genre_scores_gemma":[0.96862364,0.0000062885683,0.031190276,0.00005671069,0.000028103781,0.000004702643,8.200596e-7,0.0000013367236,0.00008811218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999406,0.00007876585,0.00012457337,0.00012440859,0.00016335062,0.00010293522],"domain_scores_gemma":[0.99947065,0.00025004163,0.00005684759,0.0001758378,0.000021403026,0.000025239975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012782193,0.00005207922,0.00006883625,0.000012346061,0.000097248296,0.00003384714,0.0002163699,0.000013449916,0.00022802994],"category_scores_gemma":[0.00010183053,0.000028208851,0.000035701712,0.0001439913,0.000022216329,0.00009836909,0.00006324516,0.00005613815,0.00001647346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039597817,0.0002676144,0.00021699702,0.000017673647,0.000015283915,0.00000418504,0.00061520026,0.000055409266,0.008542964,0.5913476,0.0012153722,0.39769778],"study_design_scores_gemma":[0.00039005466,0.00041357888,0.0649119,0.0001453746,0.0000057917637,0.000008593086,0.00024017257,0.71863055,0.13782014,0.07688,0.00022254621,0.00033129405],"about_ca_topic_score_codex":0.000014130588,"about_ca_topic_score_gemma":1.8079257e-7,"teacher_disagreement_score":0.72697085,"about_ca_system_score_codex":0.000014005781,"about_ca_system_score_gemma":0.0000013106617,"threshold_uncertainty_score":0.2496768},"labels":[],"label_agreement":null},{"id":"W2160863424","doi":"10.1109/newcas.2008.4606371","title":"Verification of fixed-point circuits specified by Taylor Series using Arithmetic Transform","year":2008,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Taylor series; Arithmetic; Saturation arithmetic; Fixed-point arithmetic; Quantization (signal processing); Algorithm; Computer science; Arbitrary-precision arithmetic; Series (stratigraphy); Electronic circuit; Implementation; Simple (philosophy); Floating point; Mathematics","score_opus":0.04589429743245357,"score_gpt":0.26922215878604594,"score_spread":0.22332786135359237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160863424","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009754106,0.000083901665,0.9863317,0.0005830279,0.00019309911,0.000121719524,0.0000039021356,0.00007421978,0.0028543028],"genre_scores_gemma":[0.31799644,0.000052427968,0.68142205,0.00010050419,0.00004015505,0.00000531544,0.0000016271124,0.000008436501,0.00037303957],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99898255,0.000050316434,0.00028214697,0.00026438964,0.00022666613,0.00019395884],"domain_scores_gemma":[0.99937683,0.00007613065,0.00007621642,0.000323524,0.00006901679,0.00007830744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017747658,0.00010881868,0.00020014006,0.00005408843,0.00009924672,0.00002794177,0.00035973324,0.000043632044,0.00004417627],"category_scores_gemma":[0.00003364191,0.00009114372,0.00006621688,0.00041578207,0.00009549071,0.00045896778,0.00003232783,0.000074985226,0.000008097548],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011696907,0.00028326653,0.0001149656,0.00004470347,0.00003041416,0.00001615875,0.0014300679,0.00005501706,0.2332713,0.03948832,0.00053426257,0.7247198],"study_design_scores_gemma":[0.00066088716,0.00037776228,0.002750219,0.00002394111,0.000013727285,0.00019580654,0.00015361396,0.09858546,0.8751422,0.013883834,0.0076733595,0.0005391526],"about_ca_topic_score_codex":0.000058188394,"about_ca_topic_score_gemma":6.1236983e-7,"teacher_disagreement_score":0.7241807,"about_ca_system_score_codex":0.000025937921,"about_ca_system_score_gemma":0.00002951074,"threshold_uncertainty_score":0.37167332},"labels":[],"label_agreement":null},{"id":"W2161442949","doi":"10.1109/mwscas.2008.4616807","title":"A mixed-signal adder based on the Continuous Valued Number System","year":2008,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Adder; Computer science; Binary number; Carry-save adder; Representation (politics); Signal processing; Serial binary adder; SIGNAL (programming language); Electronic engineering; Electronic circuit; Modular design; Mixed-signal integrated circuit; Digital signal processing; Arithmetic; Computer hardware; Mathematics; Integrated circuit; Electrical engineering; Engineering; Telecommunications","score_opus":0.03723561490849926,"score_gpt":0.2527806383633029,"score_spread":0.21554502345480364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161442949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022709114,0.000006921386,0.95723057,0.0010607829,0.000341887,0.00014174133,0.0000010417807,0.00023013816,0.038715996],"genre_scores_gemma":[0.5433151,3.991996e-7,0.45283836,0.0022204344,0.00010761394,0.000025847869,2.5281147e-7,0.00000845973,0.0014834807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986066,0.0003108172,0.0001700705,0.0002945,0.00036079987,0.00025721188],"domain_scores_gemma":[0.9988347,0.00046038974,0.00005273553,0.00049628655,0.000061021303,0.000094853036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042730046,0.00012646451,0.00017343392,0.000022468681,0.00021102522,0.000072606,0.0006214255,0.000039398616,0.0002331682],"category_scores_gemma":[0.0000366312,0.00006718517,0.00010081482,0.00030984357,0.000057564423,0.000081070786,0.00007973891,0.0001302603,0.00047495047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022564474,0.0003365795,0.0011926666,0.00002226133,0.00004776141,0.00033070237,0.00030023983,0.0002100249,0.0002914469,0.8421813,0.04137775,0.11368669],"study_design_scores_gemma":[0.00044535607,0.00013193699,0.0014121027,0.00003421664,0.0000051929082,0.00010364281,0.00007884366,0.9863522,0.0029248751,0.0009305747,0.0073257135,0.00025531847],"about_ca_topic_score_codex":0.000035988996,"about_ca_topic_score_gemma":2.8008878e-7,"teacher_disagreement_score":0.9861422,"about_ca_system_score_codex":0.000023606373,"about_ca_system_score_gemma":0.00004546132,"threshold_uncertainty_score":0.61046857},"labels":[],"label_agreement":null},{"id":"W2165108299","doi":"10.1109/aqtr.2010.5520840","title":"Challenges in verifying and optimizing fixed-point arithmetic-intensive designs","year":2010,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Datapath; Computer science; Arithmetic; Saturation arithmetic; Fixed-point arithmetic; Arbitrary-precision arithmetic; Arithmetic circuit complexity; Digital signal processing; Arithmetic logic unit; Polynomial; Implementation; Affine arithmetic; Algorithm; Floating point; Parallel computing; Computer hardware; Mathematics; Programming language","score_opus":0.1049849363005423,"score_gpt":0.31954189717801984,"score_spread":0.21455696087747755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165108299","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004533913,0.00035831842,0.985323,0.004517418,0.00040608124,0.000095272335,1.6470787e-7,0.00009091144,0.0046749255],"genre_scores_gemma":[0.08320235,0.00021546945,0.91609097,0.0004038207,0.000041743235,0.000008122464,6.440281e-8,0.000006223147,0.00003125229],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990394,0.00006374531,0.00015266084,0.000378807,0.000109504115,0.00025589854],"domain_scores_gemma":[0.9992222,0.00026820958,0.000034673874,0.0002919267,0.00007481034,0.00010813898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004735126,0.00011187847,0.00017785726,0.00008934693,0.000053149153,0.000102942504,0.00029543336,0.00005753899,0.000011021604],"category_scores_gemma":[0.0002224518,0.00008926022,0.000027739217,0.00015790222,0.00004986344,0.0002854608,0.00024920682,0.00029001743,0.0000074698837],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020885668,0.000027361777,0.00007720864,0.000009533558,0.000004922674,0.000040474803,0.0010390688,0.000009877004,0.013173958,0.06439089,0.000017719649,0.9212069],"study_design_scores_gemma":[0.0019971754,0.0006914114,0.017534595,0.00017202295,0.0000150321985,0.00049636466,0.004853435,0.7742323,0.074761845,0.11804487,0.0055981,0.001602804],"about_ca_topic_score_codex":0.000040338477,"about_ca_topic_score_gemma":0.00002293001,"teacher_disagreement_score":0.91960406,"about_ca_system_score_codex":0.000008078093,"about_ca_system_score_gemma":0.000015106244,"threshold_uncertainty_score":0.3639926},"labels":[],"label_agreement":null},{"id":"W2166069547","doi":"10.1109/acssc.2008.5074736","title":"Transcedental functions on a shift-enabled reconfigurable device: CORDIC as a case-study","year":2008,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"CMC Microsystems","keywords":"CORDIC; Field-programmable gate array; Application-specific integrated circuit; Flexibility (engineering); Computer science; Embedded system; Computer hardware; Energy consumption; Reconfigurable computing; Computer architecture; Parallel computing; Electronic engineering; Electrical engineering; Engineering; Mathematics","score_opus":0.05108182027550622,"score_gpt":0.30801966143084497,"score_spread":0.25693784115533874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166069547","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49890023,0.00003308966,0.44577456,0.0009820381,0.00075426867,0.0005190943,0.0000023525445,0.0004121497,0.052622236],"genre_scores_gemma":[0.96047854,0.0000054133934,0.033260513,0.0008253697,0.00007292906,0.00005968127,6.0034796e-7,0.000012205612,0.005284767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984265,0.00017403343,0.00026027532,0.0005161922,0.0002821472,0.00034086773],"domain_scores_gemma":[0.99902076,0.00020213015,0.00004596721,0.0004898859,0.000039412025,0.00020185532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026874014,0.00017767496,0.00023459339,0.000104211336,0.0005208729,0.00010154292,0.00038427487,0.000046517875,0.00047196107],"category_scores_gemma":[0.000024379337,0.00013887773,0.0001122422,0.0006705281,0.000039994553,0.00029864957,0.00003312001,0.00021289321,0.0006202829],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021053726,0.012744864,0.0130557995,0.000052725543,0.00058081857,0.07989308,0.019829236,0.00040682926,0.002287913,0.022706395,0.012880194,0.8353516],"study_design_scores_gemma":[0.0394869,0.06770134,0.07092977,0.00035117945,0.00058660057,0.24098676,0.060647897,0.2478396,0.019518133,0.036769547,0.20308757,0.01209469],"about_ca_topic_score_codex":0.0022708771,"about_ca_topic_score_gemma":0.00010044687,"teacher_disagreement_score":0.8232569,"about_ca_system_score_codex":0.000038641767,"about_ca_system_score_gemma":0.00007271542,"threshold_uncertainty_score":0.7972688},"labels":[],"label_agreement":null},{"id":"W2166087899","doi":"10.1109/tc.2011.43","title":"Improved Decimal Floating-Point Logarithmic Converter Based on Selection by Rounding","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rounding; Retiming; Computer science; CORDIC; Logarithm; Parallel computing; Latency (audio); Floating point; Critical path method; Decimal; Adder; Standard cell; Field-programmable gate array; Arithmetic; Algorithm; Computer hardware; Mathematics; Integrated circuit","score_opus":0.024148604484967667,"score_gpt":0.24773158991262176,"score_spread":0.2235829854276541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166087899","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010878424,0.0000030657422,0.99525505,0.00024936502,0.0025752466,0.00023350793,0.00000592141,0.00037009784,0.0002199221],"genre_scores_gemma":[0.4835524,0.0000015951737,0.51510465,0.0012057823,0.000045289748,0.000019618676,7.434491e-7,0.000018343671,0.000051589497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822676,0.0001853244,0.00029861505,0.0006168751,0.00026210916,0.00041030804],"domain_scores_gemma":[0.9990025,0.00026614574,0.00009901116,0.00038372196,0.000065962915,0.00018263448],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027894846,0.0002652404,0.00023973906,0.00022009101,0.00029824357,0.00014382033,0.0005239508,0.00009968498,0.00005718499],"category_scores_gemma":[0.0000044290414,0.0002485051,0.00016955443,0.0004943115,0.00005467355,0.00037240938,0.0000040422324,0.00039202903,0.00004787792],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010622542,0.00083910633,0.000017154569,0.00001576413,0.00007023494,0.000013160204,0.0004981671,0.0065430384,0.010806789,0.00032019275,0.00065030705,0.9801199],"study_design_scores_gemma":[0.0006905424,0.0008742775,0.000051530067,0.00003689689,0.000011926039,0.000011899288,0.000009742839,0.9418124,0.05581037,0.00018144528,0.00021959265,0.0002893958],"about_ca_topic_score_codex":0.0001644674,"about_ca_topic_score_gemma":0.0000041980165,"teacher_disagreement_score":0.97983044,"about_ca_system_score_codex":0.00015463651,"about_ca_system_score_gemma":0.000051919767,"threshold_uncertainty_score":0.9999967},"labels":[],"label_agreement":null},{"id":"W2166141986","doi":"10.1109/arith.2011.17","title":"On the Fixed-Point Accuracy Analysis and Optimization of FFT Units with CORDIC Multipliers","year":2011,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"CORDIC; Fast Fourier transform; Twiddle factor; Split-radix FFT algorithm; Fixed-point arithmetic; Quantization (signal processing); Prime-factor FFT algorithm; Computer science; Algorithm; Floating point; LTI system theory; Arithmetic; Mathematics; Field-programmable gate array; Fourier transform; Linear system; Computer hardware; Fourier analysis; Fractional Fourier transform","score_opus":0.03535542563393678,"score_gpt":0.25269453159188754,"score_spread":0.21733910595795075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166141986","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058709956,0.000005462477,0.9920107,0.00020317791,0.000021747175,0.000075808144,6.7849294e-7,0.000025600224,0.0017858411],"genre_scores_gemma":[0.32323372,0.000006809024,0.676541,0.00017295315,0.0000027969616,0.0000029993967,3.3703807e-7,0.0000022222032,0.000037188227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994332,0.00007957929,0.000107709166,0.00016773096,0.00012003849,0.000091728296],"domain_scores_gemma":[0.9991149,0.00037836755,0.00008182027,0.0002948839,0.00008269396,0.000047382553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018449548,0.000068177884,0.00012168299,0.00008060701,0.00005757515,0.000027013411,0.00024833612,0.00001676076,0.00007047713],"category_scores_gemma":[0.00012556696,0.0000334289,0.000023576269,0.0012030677,0.000062712126,0.00013070705,0.00007332956,0.000050391533,0.000001238752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012367233,0.00041374433,0.010858704,0.000025063511,0.0011254137,0.000016281716,0.006343835,0.051571533,0.00046168658,0.28560165,0.00021565167,0.6432428],"study_design_scores_gemma":[0.000142448,0.00019878008,0.003705304,0.000005728399,0.000047254,0.0000011158975,0.00012477883,0.99222964,0.0021163141,0.0013367303,0.000011483791,0.00008040493],"about_ca_topic_score_codex":0.00014647904,"about_ca_topic_score_gemma":0.0000048158768,"teacher_disagreement_score":0.94065815,"about_ca_system_score_codex":0.0000041043263,"about_ca_system_score_gemma":0.00001171258,"threshold_uncertainty_score":0.1363191},"labels":[],"label_agreement":null},{"id":"W2167110608","doi":"10.1109/arith.2007.24","title":"Multiplication by a Constant is Sublinear","year":2007,"lang":"en","type":"article","venue":"Proceedings/Proceedings - Symposium on Computer Arithmetic","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Calgary Laboratory Services; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sublinear function; Multiplication (music); Constant (computer programming); Integer (computer science); Conjecture; Mathematics; Scheme (mathematics); Computer science; Arithmetic; Discrete mathematics; Combinatorics; Mathematical analysis","score_opus":0.013488359848803496,"score_gpt":0.26533982185857047,"score_spread":0.251851462009767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167110608","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024964038,0.00014726425,0.9468652,0.008660264,0.0011351344,0.00097500056,0.000015229729,0.0013605282,0.015877336],"genre_scores_gemma":[0.2524225,0.00006513223,0.7393788,0.0064294417,0.001013373,0.000087332075,0.0000061667965,0.00010301002,0.000494246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944449,0.000012376921,0.0010535055,0.0019088007,0.0012168675,0.0013635601],"domain_scores_gemma":[0.99709564,0.00025642096,0.00053097244,0.00036522772,0.00102766,0.0007240935],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019017253,0.0007421767,0.0007008477,0.00061262003,0.00048559206,0.0013445633,0.002050483,0.0003009244,0.000019994612],"category_scores_gemma":[0.000089042966,0.0006853061,0.0002602284,0.0021172145,0.00021896676,0.0013004179,0.0006522367,0.00073866965,0.00018929852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022084924,0.0022732732,0.005282581,0.00047552038,0.00025775307,0.00003766789,0.0053752623,0.000008365681,0.22324644,0.29114768,0.09175329,0.37992132],"study_design_scores_gemma":[0.0042259214,0.003334247,0.0021588025,0.00048563,0.00011253948,0.00052576204,0.00029202428,0.5531386,0.2738242,0.016835334,0.14156683,0.0035000995],"about_ca_topic_score_codex":0.000022487877,"about_ca_topic_score_gemma":1.7540961e-7,"teacher_disagreement_score":0.55313027,"about_ca_system_score_codex":0.00024553682,"about_ca_system_score_gemma":0.000054900174,"threshold_uncertainty_score":0.99969214},"labels":[],"label_agreement":null},{"id":"W2167420410","doi":"10.1109/ccece.2013.6567806","title":"Decimal signed digit addition using stored transfer encoding","year":2013,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adder; Decimal; Arithmetic; Computer science; Multiplication (music); Carry (investment); Division (mathematics); Carry-save adder; Encoding (memory); Transfer (computing); Numerical digit; Parallel computing; Mathematics; Artificial intelligence; Telecommunications","score_opus":0.03344471264640212,"score_gpt":0.2664507804216076,"score_spread":0.23300606777520547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167420410","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02686959,0.000008739612,0.9693195,0.00024730177,0.00020642184,0.0001131497,0.0000010960282,0.00013885902,0.0030953218],"genre_scores_gemma":[0.37337202,0.000001010581,0.6261533,0.00025766835,0.00007161436,0.00000908164,7.075929e-7,0.0000051437064,0.00012944656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914336,0.00005574943,0.00014980181,0.0002441884,0.00017561122,0.00023129265],"domain_scores_gemma":[0.9995152,0.00011763109,0.000014960827,0.00019396769,0.00005208894,0.00010614823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009411075,0.00009275737,0.00011518929,0.000048618647,0.0000945611,0.0002353102,0.0003022367,0.00003565478,0.00050276594],"category_scores_gemma":[0.000024284418,0.000071999195,0.000057610287,0.00024713267,0.00002295662,0.0009321657,0.000050876686,0.000063017076,0.00008705381],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014832895,0.000051816187,0.00004192282,0.000004314801,0.000009626851,0.0000054790535,0.00016634294,0.000050970546,0.086076155,0.016692054,0.0003479812,0.89655185],"study_design_scores_gemma":[0.0005942309,0.00020816011,0.0015800972,0.000034483954,0.000009363569,0.000025860789,0.00007948561,0.8745839,0.08671862,0.031999893,0.0035729003,0.00059299986],"about_ca_topic_score_codex":0.00009049422,"about_ca_topic_score_gemma":5.3115747e-7,"teacher_disagreement_score":0.89595884,"about_ca_system_score_codex":0.00002791783,"about_ca_system_score_gemma":0.000019400553,"threshold_uncertainty_score":0.5504935},"labels":[],"label_agreement":null},{"id":"W2167518328","doi":"10.1109/ccece.2008.4564734","title":"A decimal-to-decimal antilogarithmic converter","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decimal; VHDL; Computer science; Field-programmable gate array; Arithmetic; Algorithm; Mathematics; Computer hardware","score_opus":0.022116321013438633,"score_gpt":0.21675470269017671,"score_spread":0.19463838167673808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167518328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044953827,0.000052681007,0.9501876,0.002381576,0.00035087005,0.00034548077,0.000005371557,0.0003119979,0.0014105482],"genre_scores_gemma":[0.873176,0.000059857593,0.124734506,0.0016570734,0.00019030555,0.00004687867,0.0000013732408,0.000024932102,0.00010908108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971126,0.00001758166,0.0003656048,0.0009868201,0.00037468396,0.0011427533],"domain_scores_gemma":[0.9977438,0.000093418115,0.000065149514,0.00025191545,0.0003534086,0.0014923351],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017968735,0.00046034213,0.00051827834,0.0006184735,0.0002814504,0.0005135034,0.0010546,0.0001698716,0.000034688892],"category_scores_gemma":[0.00007613831,0.0004359885,0.000083010804,0.0009964121,0.00007662383,0.00044949964,0.00020634869,0.0005689733,0.00008016451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025581603,0.00010354691,0.0026533117,0.000046515994,0.00006848081,0.0002939592,0.001265916,0.000057040317,0.0022955665,0.48180464,0.0018757384,0.5095097],"study_design_scores_gemma":[0.00037755538,0.0006639049,0.013864863,0.000089126625,0.0000068406903,0.00031216495,0.000007035393,0.9769177,0.00045511557,0.0015679708,0.0050092363,0.0007284744],"about_ca_topic_score_codex":0.0012348933,"about_ca_topic_score_gemma":0.00007114584,"teacher_disagreement_score":0.97686064,"about_ca_system_score_codex":0.0001400583,"about_ca_system_score_gemma":0.00048761716,"threshold_uncertainty_score":0.9998092},"labels":[],"label_agreement":null},{"id":"W2167718530","doi":"10.1109/ccece.2005.1557027","title":"Effective implementation of floating-point adder using pipelined LOP in FPGAs","year":2006,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adder; Field-programmable gate array; Computer science; Floating point; Parallel computing; Point (geometry); Computer architecture; Embedded system; Algorithm; Telecommunications; Mathematics; Latency (audio)","score_opus":0.012115070235764195,"score_gpt":0.3282469413671694,"score_spread":0.31613187113140523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167718530","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11270687,0.000013365828,0.8864137,0.00010451632,0.00008759406,0.00015527068,6.9183415e-7,0.000024627932,0.0004933698],"genre_scores_gemma":[0.43006587,2.646799e-7,0.5698343,0.000048142672,0.000032631364,0.000002886078,5.105632e-7,0.0000025373965,0.000012867794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991862,0.00011232494,0.00024688875,0.00018037138,0.00012579908,0.0001484031],"domain_scores_gemma":[0.9995871,0.00012978585,0.00008042835,0.0001313676,0.000050349754,0.000020923071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034948156,0.00006823721,0.00012757911,0.00007583071,0.00002315378,0.000023725563,0.00013983842,0.000019537147,0.00003761485],"category_scores_gemma":[0.000020459784,0.0000559971,0.00003325304,0.000401705,0.000014772805,0.0001902117,0.00007768826,0.000046376514,0.0000027388942],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053322656,0.00014209509,0.0077302847,0.000022138649,0.000009009786,0.000008679142,0.0005092002,0.0021454948,0.06692735,0.029665112,0.00011502269,0.8927203],"study_design_scores_gemma":[0.0011508905,0.00018384116,0.071949296,0.00003002371,0.000006057961,0.000005218705,0.00027800945,0.6434092,0.25113925,0.03150452,0.000100350706,0.000243323],"about_ca_topic_score_codex":0.0032140082,"about_ca_topic_score_gemma":0.0000754108,"teacher_disagreement_score":0.892477,"about_ca_system_score_codex":0.000035196703,"about_ca_system_score_gemma":0.000022559434,"threshold_uncertainty_score":0.48586404},"labels":[],"label_agreement":null},{"id":"W2169100599","doi":"10.1109/cicc.2000.852612","title":"Direct digital frequency synthesis of low-jitter clocks","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Accumulator (cryptography); Jitter; Computer science; Direct digital synthesizer; Synchronization (alternating current); Clock recovery; NTSC; Digital television; Electronic engineering; Frequency divider; Clock synchronization; Clock domain crossing; Digital audio; Digital clock; Frequency synthesizer; Audio signal; Computer hardware; Phase-locked loop; Clock signal; High-definition television; Synchronous circuit; Digital signal processing; Telecommunications; Engineering; Algorithm","score_opus":0.016167481553252323,"score_gpt":0.23111847010635803,"score_spread":0.2149509885531057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169100599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024776605,0.000074738484,0.8024876,0.0007570704,0.00020347247,0.0000523854,0.0000038672392,0.00012776314,0.19381543],"genre_scores_gemma":[0.60264575,0.00001033526,0.3956514,0.0002066261,0.00005115889,0.000006248432,8.4677175e-8,0.0000059808813,0.0014224126],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991901,0.00003470894,0.00018243006,0.00023071008,0.00017757797,0.0001845093],"domain_scores_gemma":[0.9991812,0.00029315392,0.000047142275,0.00036972467,0.00003378358,0.000074960524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000088885616,0.00008982619,0.00017166951,0.00004415998,0.00002839926,0.00008264954,0.00048635638,0.0000319072,0.00031629673],"category_scores_gemma":[0.0001289664,0.00006464111,0.00008632606,0.00026736953,0.000040762647,0.00036371136,0.00010838421,0.000049477345,0.00013346336],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.2219586e-7,0.00012096227,0.0006343513,0.0000100276875,0.000013417317,0.0000111675845,0.000078334524,0.0000015420189,0.0009158703,0.0055554574,0.00092988374,0.99172866],"study_design_scores_gemma":[0.0010858907,0.00091705355,0.009707138,0.0003529117,0.000047444257,0.00009901599,0.00010622326,0.2513839,0.62042755,0.0831208,0.029906092,0.0028459898],"about_ca_topic_score_codex":0.000011948405,"about_ca_topic_score_gemma":1.8528712e-7,"teacher_disagreement_score":0.98888266,"about_ca_system_score_codex":0.000008644831,"about_ca_system_score_gemma":0.000004223886,"threshold_uncertainty_score":0.34632275},"labels":[],"label_agreement":null},{"id":"W2170373566","doi":"10.1109/acssc.2009.5470207","title":"CORDIC instruction set extensions for matrix decompositions on Software Defined Radio processors","year":2009,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"CORDIC; Computer science; Software-defined radio; Singular value decomposition; Digital signal processing; Wireless; Overhead (engineering); Digital signal processor; QR decomposition; Software; Set (abstract data type); Instruction set; Matrix decomposition; Decomposition; Embedded system; Parallel computing; Computer engineering; Computer architecture; Computer hardware; Algorithm; Field-programmable gate array; Telecommunications; Operating system","score_opus":0.026346043517069335,"score_gpt":0.33021071000739033,"score_spread":0.303864666490321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170373566","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059826146,0.000029583438,0.989989,0.0027526238,0.00035155777,0.0002697928,0.000008584634,0.00037499392,0.00024125926],"genre_scores_gemma":[0.03590164,0.0000069631064,0.96270686,0.0009973375,0.0000806857,0.000028896764,0.000008172081,0.0000067603264,0.00026268954],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990256,0.000038789312,0.00019089886,0.00034450274,0.00015533135,0.00024487087],"domain_scores_gemma":[0.99923927,0.00017435086,0.00006252545,0.0002975127,0.00010404158,0.00012228731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013151894,0.00012701342,0.00016456228,0.00010346721,0.0002846374,0.000096406664,0.00030994928,0.000051763032,0.000012025132],"category_scores_gemma":[0.000119812874,0.00010083396,0.00009263877,0.0004425772,0.000020560612,0.00024530248,0.000031045794,0.0000933315,0.000023485087],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027271779,0.00017910762,0.000047226396,0.000011945745,0.000011311606,0.0000054797715,0.000083483545,0.00035684803,0.00082444516,0.15202421,0.0031345354,0.84329414],"study_design_scores_gemma":[0.0037114385,0.0041319104,0.0177423,0.00014767841,0.00006115268,0.00034491642,0.00008754541,0.37329805,0.009958386,0.5700195,0.019175759,0.0013213919],"about_ca_topic_score_codex":0.0000067445553,"about_ca_topic_score_gemma":7.745457e-7,"teacher_disagreement_score":0.84197277,"about_ca_system_score_codex":0.000031532916,"about_ca_system_score_gemma":0.000037972128,"threshold_uncertainty_score":0.41118896},"labels":[],"label_agreement":null},{"id":"W2171539959","doi":"10.2139/ssrn.2326121","title":"The Iterated Bootstrap","year":2011,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Statistics; Econometrics","score_opus":0.03041850977332306,"score_gpt":0.2722613953100024,"score_spread":0.24184288553667932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171539959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022851285,0.0017729128,0.9915884,0.0008846471,0.0004664771,0.00004217965,1.1216754e-7,0.000050862236,0.002909277],"genre_scores_gemma":[0.84847814,0.005205,0.14031225,0.00059406704,0.0005864858,0.000010062275,2.400236e-7,0.000028709894,0.004785017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977284,0.00014841555,0.00018092204,0.0001436876,0.0001778741,0.0016206845],"domain_scores_gemma":[0.9994564,0.00006474469,0.00009132775,0.00024081624,0.00006343279,0.00008327756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017313133,0.000091436945,0.00008485923,0.000032301366,0.00040482555,0.0001720324,0.0010020573,0.000028967168,0.000009262878],"category_scores_gemma":[0.000039639137,0.000052057894,0.00007690448,0.00026584225,0.000041758503,0.00025851597,0.00006855013,0.0010755094,0.00003767258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040227965,0.000015904834,0.000049780752,1.874595e-7,0.000024699095,0.000004070672,0.00009777877,3.069054e-7,0.00008195151,0.5457396,0.00003149177,0.45395023],"study_design_scores_gemma":[0.00017533006,0.0002853265,0.0005543025,0.0000036095182,0.000004262684,0.00050149753,0.00013718141,0.001754577,0.00044631585,0.987948,0.008077726,0.000111859845],"about_ca_topic_score_codex":0.000018889992,"about_ca_topic_score_gemma":0.000015667847,"teacher_disagreement_score":0.85127616,"about_ca_system_score_codex":0.00011808304,"about_ca_system_score_gemma":0.0005481634,"threshold_uncertainty_score":0.46726125},"labels":[],"label_agreement":null},{"id":"W2171832160","doi":"10.1109/sips.2000.886743","title":"A 2-digit DBNS filter architecture","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Arithmetic; Finite impulse response; Numerical digit; Binary number; Computer science; Logarithm; Filter (signal processing); Algorithm; Multiplier (economics); Mathematics; Computer vision; Mathematical analysis","score_opus":0.030185239369253387,"score_gpt":0.24561561861796152,"score_spread":0.21543037924870814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171832160","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001908513,0.00003745888,0.9300438,0.0041839755,0.00014795305,0.000036233236,4.5358544e-7,0.00016333291,0.06519593],"genre_scores_gemma":[0.012887767,0.000004353277,0.97434187,0.00234481,0.000091767746,0.0000046489236,1.02711766e-7,0.0000043226823,0.010320377],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99935764,0.00003139695,0.00008308806,0.00021005054,0.00012599224,0.00019183598],"domain_scores_gemma":[0.99949026,0.00006888495,0.00001595658,0.00032290112,0.000013437145,0.00008854618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000046838297,0.000071931725,0.000078914054,0.000032832464,0.00004102826,0.00010441945,0.0004487237,0.000023222057,0.00062731124],"category_scores_gemma":[0.00002262285,0.000048360675,0.000050190138,0.00021758933,0.000018474138,0.00012407349,0.00012796042,0.00008909005,0.0003771643],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.5221896e-7,0.00002600875,0.000021038424,0.0000012113298,0.000002887039,0.000009249591,0.00010223698,0.000007603369,0.00013924933,0.010754476,0.0042264485,0.98470944],"study_design_scores_gemma":[0.0003739415,0.00020135107,0.00068154436,0.000012088579,0.0000032686148,0.00009208779,0.000008860887,0.19461171,0.0064199003,0.09321061,0.7038957,0.0004889409],"about_ca_topic_score_codex":0.000006149118,"about_ca_topic_score_gemma":4.0643513e-7,"teacher_disagreement_score":0.9842205,"about_ca_system_score_codex":0.0000051250195,"about_ca_system_score_gemma":0.0000023684358,"threshold_uncertainty_score":0.6868618},"labels":[],"label_agreement":null},{"id":"W2171890123","doi":"10.1109/rfic.2003.1214013","title":"Piecewise continuous linear interpolation of the sine function for Direct Digital Frequency Synthesis","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Piecewise linear function; Sine; Interpolation (computer graphics); Spurious-free dynamic range; Computer science; Algorithm; Spurious relationship; Range (aeronautics); Function (biology); Piecewise; Dynamic range; Mathematics; Telecommunications; Engineering; Mathematical analysis","score_opus":0.015009701529014565,"score_gpt":0.24662261296184798,"score_spread":0.2316129114328334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171890123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014823906,0.00003515414,0.98698545,0.00023939236,0.000439119,0.00015768656,0.0000052645078,0.0000478252,0.01060773],"genre_scores_gemma":[0.6351944,0.0000011967778,0.3642502,0.000068375906,0.000031043055,0.000015191324,3.0735492e-7,0.0000047060716,0.00043453704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993706,0.000059737722,0.00017831365,0.00016858164,0.00010769557,0.0001150677],"domain_scores_gemma":[0.9991361,0.00040495265,0.00008629794,0.0002567781,0.00008576439,0.000030131418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022168648,0.00007261412,0.00012971085,0.000026435026,0.00005224723,0.000050922732,0.00022005488,0.000028458397,0.000018532672],"category_scores_gemma":[0.0007907732,0.000043150212,0.000098890916,0.00023499315,0.000029439829,0.00027434144,0.000035020767,0.00003669355,0.0000037569691],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016022423,0.00018815706,0.0020669703,0.000021768172,0.000042690997,4.0285425e-7,0.000098139295,0.000023158334,0.008741259,0.103599876,0.00029292124,0.8849086],"study_design_scores_gemma":[0.0015604234,0.0018908684,0.009012225,0.00021795985,0.00013547271,0.000026135129,0.00023406999,0.41262084,0.2626297,0.25887522,0.05163643,0.0011606363],"about_ca_topic_score_codex":0.0000106097505,"about_ca_topic_score_gemma":9.380805e-7,"teacher_disagreement_score":0.883748,"about_ca_system_score_codex":0.000010308477,"about_ca_system_score_gemma":0.000019818159,"threshold_uncertainty_score":0.17596146},"labels":[],"label_agreement":null},{"id":"W2171948637","doi":"10.1109/ccece.2006.277498","title":"A Study on the Floating-Point Adder in FPGAS","year":2006,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adder; Field-programmable gate array; Computer science; Latency (audio); Floating point; Critical path method; Parallel computing; Very-large-scale integration; Computer hardware; Embedded system; Algorithm; Engineering; Telecommunications","score_opus":0.03326623066855305,"score_gpt":0.2960138498039547,"score_spread":0.2627476191354016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171948637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08911474,0.000011132868,0.864356,0.0059066857,0.00019127694,0.000312175,1.8315957e-7,0.00010091699,0.04000693],"genre_scores_gemma":[0.7823963,1.7985325e-7,0.21583687,0.0010007878,0.000068953035,0.00001527624,4.941065e-8,0.0000037556833,0.0006777916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99919593,0.00015787617,0.00013204168,0.00019948231,0.00016317486,0.00015146338],"domain_scores_gemma":[0.9993627,0.00026462474,0.000022804488,0.00031738292,0.000013060461,0.000019445286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004948205,0.00006573904,0.00007977482,0.000032133103,0.00004950652,0.00007803074,0.0003936937,0.000011953473,0.000036010882],"category_scores_gemma":[0.000043967782,0.000033933145,0.000024487577,0.00034212385,0.000012474087,0.00006801481,0.000118035336,0.00009854701,0.00006005581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005781043,0.0023937444,0.008010358,0.0000022793326,0.000013870416,0.00013584741,0.0022280428,0.0005561829,0.000600076,0.61571133,0.007194655,0.36314785],"study_design_scores_gemma":[0.0021034728,0.002100956,0.43956426,0.000046069083,0.0000074299137,0.000016740785,0.003442716,0.21626543,0.0067822263,0.32041788,0.008330206,0.00092261954],"about_ca_topic_score_codex":0.00036246027,"about_ca_topic_score_gemma":0.000030163093,"teacher_disagreement_score":0.6932816,"about_ca_system_score_codex":0.000011609716,"about_ca_system_score_gemma":0.000008704894,"threshold_uncertainty_score":0.13837536},"labels":[],"label_agreement":null},{"id":"W2188548788","doi":"10.1016/j.neunet.2015.10.001","title":"Constructing general partial differential equations using polynomial and neural networks","year":2015,"lang":"en","type":"article","venue":"Neural Networks","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"European Regional Development Fund; National Oceanic and Atmospheric Administration","keywords":"Polynomial; Mathematics; Partial derivative; Artificial neural network; Applied mathematics; Partial differential equation; Differential equation; Variable (mathematics); Function (biology); Similarity (geometry); Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.05939473861804295,"score_gpt":0.302278272939761,"score_spread":0.24288353432171805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188548788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11618719,0.00027155934,0.87928534,0.00029803356,0.0036432594,0.000133002,0.0000016176195,0.0001341497,0.000045845252],"genre_scores_gemma":[0.9037756,0.000004610997,0.09278668,0.00031185494,0.0030670338,0.000006408917,0.000005409187,0.000018879193,0.000023550494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789685,0.0003155585,0.0003713363,0.00052248064,0.00025445278,0.0006393127],"domain_scores_gemma":[0.998793,0.00023453987,0.0001600221,0.0003206398,0.00007069469,0.00042107934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023051584,0.00025279078,0.00031975948,0.000056380577,0.00026361737,0.00043743738,0.00041617345,0.00013493748,0.00000826305],"category_scores_gemma":[0.00007342528,0.00022327635,0.00009180897,0.0003609991,0.00016035355,0.00047445414,0.0004739075,0.00044086474,7.06681e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033691576,0.000036742986,0.002752386,0.0000026865516,0.000025503457,0.00003880359,0.0000974275,0.36407518,0.00012152941,0.0046940227,0.00031163584,0.6278104],"study_design_scores_gemma":[0.00057298806,0.000091802256,0.00022076417,0.000005999392,0.000019043602,0.00008798644,0.000019351452,0.99845654,0.00002680754,0.00017142556,0.00006334555,0.00026392462],"about_ca_topic_score_codex":0.0001087072,"about_ca_topic_score_gemma":0.0000063085326,"teacher_disagreement_score":0.7875884,"about_ca_system_score_codex":0.00004732903,"about_ca_system_score_gemma":0.000028221624,"threshold_uncertainty_score":0.91049457},"labels":[],"label_agreement":null},{"id":"W2213705925","doi":"10.1049/iet-cta.2012.0648","title":"Improved bounds for the spectrum of interval matrices","year":2013,"lang":"en","type":"article","venue":"IET Control Theory and Applications","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Spectrum (functional analysis); Interval (graph theory); Control theory (sociology); Mathematics; Computer science; Combinatorics; Physics; Control (management); Artificial intelligence","score_opus":0.0074098188230117615,"score_gpt":0.2641158796103952,"score_spread":0.2567060607873834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2213705925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031306632,0.00053155166,0.99512124,0.0030188623,0.000048475616,0.0006849947,0.000010064872,0.00002948196,0.00024223603],"genre_scores_gemma":[0.92286223,0.000040113853,0.07463445,0.00059722987,0.0001683724,0.0014490917,5.9221065e-7,0.000005725762,0.00024220409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994889,0.00006457412,0.00013999791,0.000148199,0.000041564886,0.00011678577],"domain_scores_gemma":[0.998164,0.0013898615,0.000080492406,0.00028458468,0.000042867217,0.000038220598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005021963,0.00006161004,0.00011117361,0.00001784737,0.00014828364,0.00009037721,0.00040578865,0.000020952099,0.000012889152],"category_scores_gemma":[0.00003172547,0.000036820646,0.00005662342,0.0001182019,0.000096791766,0.00011877873,0.000048807327,0.00004898667,0.00000429974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061266496,0.000020295352,0.0000061311202,0.00000487015,0.000016783428,9.780457e-9,0.000035728128,0.0000018388803,0.0026695067,0.684993,0.000036015655,0.31220967],"study_design_scores_gemma":[0.00040792476,0.000086233966,0.00049050176,0.0000030563237,0.000021542859,0.0000019960364,0.00006396627,0.07109356,0.001074071,0.91159874,0.015082792,0.00007563977],"about_ca_topic_score_codex":0.0000152906,"about_ca_topic_score_gemma":4.7324863e-7,"teacher_disagreement_score":0.9225492,"about_ca_system_score_codex":0.00000311738,"about_ca_system_score_gemma":0.000009966223,"threshold_uncertainty_score":0.15015022},"labels":[],"label_agreement":null},{"id":"W2218028243","doi":"10.1155/2015/765898","title":"FFT Splitting for Improved FPGA-Based Acquisition of GNSS Signals","year":2015,"lang":"en","type":"article","venue":"International Journal of Navigation and Observation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Fast Fourier transform; Field-programmable gate array; Computer science; GNSS applications; Reduction (mathematics); Global Positioning System; Code (set theory); Multiplier (economics); Algorithm; Computer hardware; Mathematics; Telecommunications","score_opus":0.06772072481751056,"score_gpt":0.349152864870594,"score_spread":0.2814321400530834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2218028243","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12038047,0.00006403231,0.87497455,0.0038089226,0.0006520608,0.000089095076,0.0000065440445,0.0000097159955,0.0000145836075],"genre_scores_gemma":[0.44306144,0.000005320511,0.5561633,0.00049677276,0.00023650425,0.000003294578,0.000015391459,0.0000044017934,0.000013583463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892247,0.000064562766,0.00049723213,0.00010569114,0.00033578626,0.000074261916],"domain_scores_gemma":[0.9971058,0.00023127298,0.0007073453,0.00007011865,0.0018077667,0.00007770651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010922657,0.000069351976,0.00014284583,0.00010856709,0.000028046767,0.00008785677,0.00028667838,0.00004121366,0.0000020096509],"category_scores_gemma":[0.0003061624,0.000060250513,0.000073074785,0.0001461831,0.000021833492,0.0007026,0.00002968083,0.00006600914,3.5468258e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034942673,0.0002731608,0.0032166834,0.00005604418,0.00012389728,0.0000072460853,0.0008075903,0.002787633,0.17040817,0.025630662,0.00045046431,0.795889],"study_design_scores_gemma":[0.002946948,0.0006626305,0.008920436,0.00025397917,0.00002216749,0.000029245737,0.000106530744,0.8555056,0.06610143,0.061859854,0.0034251972,0.00016598254],"about_ca_topic_score_codex":0.000009502646,"about_ca_topic_score_gemma":1.6878387e-7,"teacher_disagreement_score":0.85271794,"about_ca_system_score_codex":0.00005238188,"about_ca_system_score_gemma":0.00009621886,"threshold_uncertainty_score":0.24569447},"labels":[],"label_agreement":null},{"id":"W2235113569","doi":"10.1115/1.4031657","title":"Motion Analysis of Manipulators With Uncertainty in Kinematic Parameters","year":2015,"lang":"en","type":"article","venue":"Journal of Mechanisms and Robotics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Kinematics; Parametric statistics; Control theory (sociology); Interval (graph theory); Mathematics; Matrix (chemical analysis); Motion (physics); Computer science; Artificial intelligence; Classical mechanics; Physics; Statistics","score_opus":0.03715333811767787,"score_gpt":0.27444144863137027,"score_spread":0.2372881105136924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2235113569","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023754744,0.00004754759,0.9757744,0.0002501439,0.00012678768,0.000033781507,2.6930513e-7,0.000003018492,0.000009318679],"genre_scores_gemma":[0.26513982,0.000011867752,0.73480356,0.00003225016,0.0000065135687,1.83623e-7,1.1205725e-7,0.000002350641,0.0000033142537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990705,0.000084138184,0.00035479682,0.00009015347,0.00029757858,0.00010282638],"domain_scores_gemma":[0.99920183,0.00007316923,0.00034971267,0.00012323365,0.00013462445,0.00011743614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007741618,0.00007444761,0.0003658604,0.0003126912,0.000013762124,0.000029568686,0.00018289454,0.0000336628,8.7385513e-7],"category_scores_gemma":[0.000054682147,0.00004611367,0.00006633723,0.00077390834,0.000019001824,0.00015159472,0.000039463324,0.000100728226,1.10000606e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009928529,0.000058832753,0.00039523465,0.000010120432,0.00012021465,0.00002536433,0.000236283,0.965813,0.0001334724,0.022271618,0.0000019056013,0.010924031],"study_design_scores_gemma":[0.00041159356,0.0005328205,0.0020470892,0.00004619458,0.00019043518,0.00003430256,0.00021981611,0.9671035,0.00013062262,0.029207405,0.0000018209093,0.00007442243],"about_ca_topic_score_codex":0.000024073555,"about_ca_topic_score_gemma":0.000006053237,"teacher_disagreement_score":0.24138507,"about_ca_system_score_codex":0.000025763535,"about_ca_system_score_gemma":0.000030547682,"threshold_uncertainty_score":0.1880461},"labels":[],"label_agreement":null},{"id":"W2242362341","doi":"","title":"Numeracy CD – Whole Number Concepts and Operations Numeracy II CD – Understanding, Using, and Applying Fractions","year":2001,"lang":"en","type":"article","venue":"Society for Information Technology & Teacher Education International Conference","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saskatchewan Polytechnic","funders":"","keywords":"Numeracy; Computer science; Mathematics; Psychology; Literacy; Pedagogy","score_opus":0.04887005566464688,"score_gpt":0.37428784084193883,"score_spread":0.325417785177292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2242362341","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02969929,0.00007026813,0.9526098,0.014112519,0.0007354729,0.00048786544,0.000018848224,0.00022640525,0.0020395825],"genre_scores_gemma":[0.6028144,0.00015497513,0.39465302,0.00097433245,0.00010211173,0.00033891265,0.00006734266,0.000009186401,0.00088572013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998791,0.000026160187,0.00042426845,0.0002992098,0.0002242064,0.00023514708],"domain_scores_gemma":[0.9988312,0.000070202645,0.00022892012,0.00025461378,0.000520654,0.00009440804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028949848,0.0001884133,0.00017097045,0.00017767728,0.00086539757,0.00046105514,0.0004450192,0.00020276835,0.000119734614],"category_scores_gemma":[0.00015728931,0.00019536905,0.00009084855,0.0004387625,0.00023469233,0.0032274514,0.00023568817,0.00031582746,0.000017501394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005188042,0.00017912217,0.004316185,0.000018674311,0.000099813165,1.1836399e-7,0.0052681887,0.00004757383,0.00072393345,0.8318257,0.0022625914,0.15525296],"study_design_scores_gemma":[0.001320346,0.0001260105,0.0018501462,0.00010272417,0.000060381233,0.00023093853,0.025111891,0.38318744,0.00036734488,0.16854279,0.41834903,0.00075097097],"about_ca_topic_score_codex":0.00008325191,"about_ca_topic_score_gemma":0.0000051138572,"teacher_disagreement_score":0.6632829,"about_ca_system_score_codex":0.00023455356,"about_ca_system_score_gemma":0.00031456386,"threshold_uncertainty_score":0.7966919},"labels":[],"label_agreement":null},{"id":"W2246496525","doi":"10.1049/el.2015.0786","title":"Area and power efficient decimal carry‐free adder","year":2015,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adder; Carry (investment); Arithmetic; Decimal; Carry-save adder; Serial binary adder; Power (physics); Computer science; Mathematics; Telecommunications; Physics","score_opus":0.015553933112458208,"score_gpt":0.2419785368044795,"score_spread":0.2264246036920213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2246496525","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077928774,0.0013101238,0.90734065,0.012252984,0.0003623901,0.00009549125,0.0000013055816,0.00010640991,0.000601885],"genre_scores_gemma":[0.41713458,0.000023636541,0.5705707,0.011949036,0.00016348944,0.000020771615,0.0000015844098,0.000031215513,0.000104959945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986041,0.00007718875,0.00013995776,0.00036780877,0.000306254,0.00050465757],"domain_scores_gemma":[0.9991303,0.00008543904,0.000045034227,0.00049087877,0.00004087931,0.00020747284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038760118,0.00014032009,0.00015022143,0.0000587414,0.000065960194,0.0001250899,0.0005950512,0.00003730355,0.0000055910537],"category_scores_gemma":[0.00009293207,0.000118817705,0.00004382458,0.00026107865,0.00005336926,0.000112565445,0.00026836336,0.00021093638,0.00001456437],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012790282,0.00064580835,0.0017845224,0.000038800863,0.0003104706,0.0004889797,0.0063481303,0.005237868,0.08356336,0.24381465,0.18117517,0.47646433],"study_design_scores_gemma":[0.007622925,0.002757937,0.004469654,0.0000791452,0.000064814754,0.0006238515,0.00021686073,0.45748103,0.025041921,0.05495348,0.44329926,0.0033891364],"about_ca_topic_score_codex":0.000009817912,"about_ca_topic_score_gemma":0.0000014190102,"teacher_disagreement_score":0.4730752,"about_ca_system_score_codex":0.00008741586,"about_ca_system_score_gemma":0.00007838375,"threshold_uncertainty_score":0.48452452},"labels":[],"label_agreement":null},{"id":"W2265220008","doi":"","title":"Efficient Evaluation of Large Polynomials","year":2010,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Representation (politics); Polynomial; Field (mathematics); Base (topology); Mathematics; Degree (music); Algorithm; Computer science; Mathematical optimization; Discrete mathematics; Pure mathematics","score_opus":0.030217460948634423,"score_gpt":0.35544306765992617,"score_spread":0.32522560671129175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2265220008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19079682,0.0000095248615,0.8031047,0.00027862014,0.0005414685,0.00007540915,6.3474704e-7,0.000027939897,0.005164876],"genre_scores_gemma":[0.5886739,1.12691254e-7,0.41119146,0.00005983096,0.000028003351,0.0000026816977,8.25298e-8,0.0000011070953,0.000042807893],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999261,0.00007735133,0.00011643309,0.00012643289,0.0003133868,0.000105368636],"domain_scores_gemma":[0.99945533,0.000068308946,0.00004331054,0.0002689953,0.00012364158,0.000040393235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019512326,0.000037384114,0.0000733167,0.00003164406,0.000025121519,0.00001683935,0.0002561435,0.000022986926,0.00017787066],"category_scores_gemma":[0.00012511811,0.000026867343,0.00003089357,0.00016498151,0.000013615718,0.000030581356,0.00008341499,0.000054413842,0.000023663322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.5170385e-7,0.00014459195,0.00011460424,0.0000021878423,0.000004313625,2.3503513e-7,0.00010954441,0.00015438111,0.094036005,0.18399848,0.00014275406,0.72129214],"study_design_scores_gemma":[0.00023990756,0.0000233459,0.004287946,0.0000013617299,0.00000402893,0.0000011616697,0.0000060096822,0.93989587,0.047980446,0.0066251527,0.000880109,0.000054653465],"about_ca_topic_score_codex":0.000010643595,"about_ca_topic_score_gemma":0.0000014646052,"teacher_disagreement_score":0.9397415,"about_ca_system_score_codex":0.0000045351157,"about_ca_system_score_gemma":0.00003858086,"threshold_uncertainty_score":0.19475591},"labels":[],"label_agreement":null},{"id":"W2269393291","doi":"10.1017/cbo9780511550881.035","title":"GETTING THE NUMBERS RIGHT, A CAUTIONARY TALE","year":2000,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Point (geometry); Computer science; Mythology; Algorithm; History; Mathematics; Classics","score_opus":0.016546954477195796,"score_gpt":0.21075530621483157,"score_spread":0.1942083517376358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269393291","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000071646855,0.00015620937,0.071628176,0.00015388588,0.00032964084,0.00024655956,0.000053862736,0.00020512388,0.9272194],"genre_scores_gemma":[0.00006897028,0.00006944073,0.017603477,0.0003130789,0.00019909182,8.6381294e-7,0.000007782551,0.000024362176,0.98171294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984133,0.000103571605,0.00018026914,0.0006148359,0.00034843152,0.00033958157],"domain_scores_gemma":[0.99851835,0.00019862037,0.00018112067,0.00086431485,0.000073949835,0.00016364771],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017221956,0.00032759615,0.00030874618,0.000087885266,0.0005041603,0.00011338858,0.001664995,0.00021767402,0.000014528328],"category_scores_gemma":[0.0000059843683,0.00027712676,0.0002686446,0.00002072568,0.00029847992,0.00016779124,0.0006817165,0.00059739966,0.00004437965],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007389597,0.000006180489,1.7375585e-7,0.000010672617,0.000057461955,0.000376533,0.000044441927,0.000004623879,0.000008682552,0.951936,0.011847803,0.035700046],"study_design_scores_gemma":[0.0001867461,0.000027789636,0.00000935857,0.000062851555,0.000055561723,0.000066361106,0.000007025085,0.0017458256,0.000065226326,0.00079708325,0.9965851,0.00039110804],"about_ca_topic_score_codex":0.00016061675,"about_ca_topic_score_gemma":5.748904e-7,"teacher_disagreement_score":0.9847373,"about_ca_system_score_codex":0.00012753512,"about_ca_system_score_gemma":0.00010618181,"threshold_uncertainty_score":0.9999681},"labels":[],"label_agreement":null},{"id":"W2272492589","doi":"","title":"Implementation and application of extended precision in Matlab","year":2009,"lang":"en","type":"article","venue":"International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"MATLAB; Computer science; Syntax; Arithmetic; Point (geometry); Floating point; Fixed-point arithmetic; Programming language; Algorithm; Computational science; Computer engineering; Artificial intelligence; Mathematics","score_opus":0.022702905862066067,"score_gpt":0.4067607116917569,"score_spread":0.38405780582969085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2272492589","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027710055,0.000030615436,0.99575657,0.0006962978,0.00001878024,0.00020389938,8.802435e-7,0.000054740027,0.00046724128],"genre_scores_gemma":[0.3587559,0.000024578405,0.64112365,0.00005713292,0.000007866002,0.000025297097,0.0000011926867,0.0000028851953,0.0000014881413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988316,0.00009056068,0.0004270271,0.00027585783,0.00023764126,0.0001373002],"domain_scores_gemma":[0.99914294,0.0005565996,0.00008228426,0.0000958733,0.00007298136,0.00004933757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007351596,0.00011816038,0.00022038822,0.00032672443,0.000013591869,0.000048264283,0.00022932874,0.000058792055,0.000005717326],"category_scores_gemma":[0.00015845303,0.00010762066,0.000023750368,0.00034596262,0.000020750631,0.00016278267,0.000058500125,0.00017841179,3.8318473e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043850887,0.00004923651,0.000020477117,0.000005159752,0.000001631648,9.0532023e-7,0.000025382216,0.00016717178,0.0023546366,0.4923802,3.3815772e-7,0.50499046],"study_design_scores_gemma":[0.0001029148,0.000108030414,0.0033325988,0.000036766578,7.4411554e-7,0.000007024073,0.0000043590967,0.52019435,0.002378956,0.47375816,0.000013545894,0.000062562234],"about_ca_topic_score_codex":0.0000056484155,"about_ca_topic_score_gemma":2.1160581e-7,"teacher_disagreement_score":0.52002716,"about_ca_system_score_codex":0.000048528695,"about_ca_system_score_gemma":0.000016430862,"threshold_uncertainty_score":0.43886432},"labels":[],"label_agreement":null},{"id":"W2273070579","doi":"10.1049/iet-cdt.2015.0066","title":"Design of a novel energy efficient topology for maximum magnitude generator","year":2016,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Multiplexer; Computer science; Least significant bit; 4-bit; Comparator; Algorithm; Parallel computing; Verilog; Generator (circuit theory); Mathematics; Topology (electrical circuits); Computer hardware; Electronic engineering; CMOS; Multiplexing; Field-programmable gate array; Power (physics); Engineering; Electrical engineering; Voltage","score_opus":0.028594193466471494,"score_gpt":0.277706297829231,"score_spread":0.24911210436275952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2273070579","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023084831,0.000049729602,0.9977535,0.0007350978,0.00033735522,0.00028418028,0.000029286255,0.0004381215,0.00014189939],"genre_scores_gemma":[0.046085157,0.000009987052,0.953262,0.00036957036,0.0001090957,0.00008644955,0.0000013905873,0.000018357357,0.000058011035],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985395,0.00005662788,0.0003565928,0.0004823401,0.00019268975,0.00037225863],"domain_scores_gemma":[0.9984761,0.00059712847,0.0001554775,0.0004883859,0.00016988326,0.00011303897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028139024,0.00021097109,0.00032903586,0.0001373369,0.000051014937,0.0001289832,0.0009782013,0.000090717076,0.0000017116912],"category_scores_gemma":[0.00006437603,0.00014447633,0.00013648812,0.00023609232,0.00014711403,0.000274598,0.00038209735,0.00004235185,0.0000014929992],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016475853,0.00025004277,0.000005029629,0.0000090701,0.000021156804,0.000004646534,0.0000262374,0.00005044706,0.032930937,0.040738717,0.0012477086,0.92469954],"study_design_scores_gemma":[0.0011944921,0.0024376072,0.000024529883,0.00017253846,0.000013517007,0.000096237265,0.0000050356844,0.21714446,0.6607939,0.08152859,0.035737067,0.00085201394],"about_ca_topic_score_codex":0.0000065365803,"about_ca_topic_score_gemma":8.3207766e-8,"teacher_disagreement_score":0.9238475,"about_ca_system_score_codex":0.000042329288,"about_ca_system_score_gemma":0.000053526113,"threshold_uncertainty_score":0.5891574},"labels":[],"label_agreement":null},{"id":"W227382844","doi":"10.1023/a:1009950630139","title":"Interval Constraint Plotting for Interactive Visual Exploration of Implicitly Defined Relations","year":2000,"lang":"en","type":"article","venue":"Reliable Computing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hull; Correctness; Completeness (order theory); Computer science; Testbed; Java applet; Property (philosophy); Interval arithmetic; Java; Mathematics; Interval (graph theory); Algorithm; Calculus (dental); Discrete mathematics; Programming language; Combinatorics; Mathematical analysis","score_opus":0.034983481817895644,"score_gpt":0.3330606291159964,"score_spread":0.29807714729810075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W227382844","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043419085,0.00003078167,0.95401514,0.00032454554,0.00024026424,0.00022534144,0.0000024368974,0.00012564866,0.0016167776],"genre_scores_gemma":[0.45982328,0.0000022681395,0.53995883,0.00006697701,0.00006883391,0.000006999071,0.0000027438873,0.0000081856615,0.00006189689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876916,0.000072076116,0.00045380954,0.00031216533,0.0001333528,0.00025943966],"domain_scores_gemma":[0.9986737,0.00073028344,0.00019840691,0.0001850901,0.00015088868,0.000061638784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047232083,0.00012175861,0.00023866704,0.00007582442,0.00017214492,0.00007981143,0.00028258306,0.000047446676,0.00002583504],"category_scores_gemma":[0.0001888057,0.000117109026,0.0001050905,0.0003527178,0.000037889753,0.00054778304,0.00010560991,0.00013894856,0.000017540142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017017775,0.000092765295,0.00016362792,0.000024981244,0.000027261054,0.00000138134,0.001174088,0.008378788,0.0019096136,0.020182662,0.000104414525,0.9679234],"study_design_scores_gemma":[0.00036159606,0.00024083625,0.00020113922,0.00014312127,0.000008136806,0.000011163428,0.00015660773,0.9820447,0.0032145008,0.012357677,0.0011095967,0.00015095512],"about_ca_topic_score_codex":0.000035500587,"about_ca_topic_score_gemma":4.3981348e-7,"teacher_disagreement_score":0.9736659,"about_ca_system_score_codex":0.0000474878,"about_ca_system_score_gemma":0.000050148752,"threshold_uncertainty_score":0.47755674},"labels":[],"label_agreement":null},{"id":"W2274911716","doi":"","title":"Searching for sinks of Henon map using a multiple-precision GPU arithmetic library","year":2013,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Computer science; Hénon map; Arithmetic; Computer graphics (images); Parallel computing; Mathematics; Artificial intelligence","score_opus":0.0320911317824659,"score_gpt":0.27697651504820126,"score_spread":0.24488538326573536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274911716","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017228168,0.00080063945,0.97443783,0.004234449,0.0004637557,0.00087029155,0.000043742835,0.00022269029,0.0016984511],"genre_scores_gemma":[0.08757847,0.00011672514,0.9108826,0.00007439775,0.00004012918,0.000071385504,0.00007400429,0.00004943596,0.0011128464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99251926,0.0047544446,0.00073728047,0.000997926,0.0005240623,0.00046702637],"domain_scores_gemma":[0.9900414,0.0053334287,0.0006947989,0.0025043474,0.0011796305,0.00024640543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004471059,0.00035462945,0.0005776592,0.00030974133,0.00030747152,0.0007814886,0.0029413428,0.00029068993,0.000035251804],"category_scores_gemma":[0.0017879279,0.00034343006,0.0003499506,0.00047683073,0.00018998419,0.0005220228,0.0042069536,0.00068308215,0.000011459199],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012370066,0.0005303349,0.00037197268,0.00049534533,0.000069289126,0.0000029848595,0.003698873,0.0005306408,0.011199786,0.072081506,0.0002277129,0.9107792],"study_design_scores_gemma":[0.00041241254,0.0000012784571,0.00034136046,0.0018964434,0.000020131225,0.00000472382,0.000025093846,0.87178856,0.049946085,0.071545586,0.0036374517,0.00038084362],"about_ca_topic_score_codex":0.0007341709,"about_ca_topic_score_gemma":0.00001425119,"teacher_disagreement_score":0.91039836,"about_ca_system_score_codex":0.000063575884,"about_ca_system_score_gemma":0.00030602055,"threshold_uncertainty_score":0.9999018},"labels":[],"label_agreement":null},{"id":"W2289344546","doi":"10.1109/tvlsi.2015.2437999","title":"Floating-Point Butterfly Architecture Based on Binary Signed-Digit Representation","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Arithmetic underflow; Adder; Computer science; Operand; Parallel computing; Floating point; Fast Fourier transform; Butterfly; Arithmetic; Multiplier (economics); Computer hardware; Algorithm; Mathematics; Latency (audio); Telecommunications","score_opus":0.030153833998448953,"score_gpt":0.2853131006588002,"score_spread":0.25515926666035127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289344546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003129027,0.000023690187,0.98877335,0.0015096164,0.0039931764,0.00065892166,0.00008252507,0.0004861131,0.0013435773],"genre_scores_gemma":[0.93034124,0.0000032184196,0.06715424,0.0009088844,0.00029850093,0.0001776434,0.000023080587,0.000043957825,0.0010492464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99624676,0.0008008273,0.00069234427,0.000849976,0.0009379621,0.00047213997],"domain_scores_gemma":[0.99777436,0.00043633327,0.00024341696,0.000876963,0.00032045855,0.00034846432],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076684065,0.00039201335,0.00043405904,0.0004535353,0.00033647413,0.00048483323,0.000550369,0.00020152942,0.000029114883],"category_scores_gemma":[0.00006100648,0.00032335325,0.00026220537,0.0010214554,0.00005888382,0.00073578255,0.000005965169,0.0005767797,0.00019736511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004655454,0.002286137,0.00005267451,0.00011647068,0.00011598209,0.000094918636,0.0040087495,0.6549401,0.017081114,0.0012571574,0.006368898,0.31321222],"study_design_scores_gemma":[0.001194305,0.001116157,0.000028584418,0.00024028732,0.000023378332,0.000033538032,0.0006192588,0.9389102,0.05381983,0.00061247643,0.0029186602,0.0004833518],"about_ca_topic_score_codex":0.00019896922,"about_ca_topic_score_gemma":0.000031198633,"teacher_disagreement_score":0.9272122,"about_ca_system_score_codex":0.00026326487,"about_ca_system_score_gemma":0.00014681477,"threshold_uncertainty_score":0.99992186},"labels":[],"label_agreement":null},{"id":"W2292182108","doi":"10.48550/arxiv.1112.5052","title":"A method to rigorously enclose eigendecompositions of interval matrices","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Interval (graph theory); Mathematics; Nonlinear system; Argument (complex analysis); Interval arithmetic; Set (abstract data type); Contraction (grammar); Applied mathematics; Pure mathematics; Algebra over a field; Mathematical analysis; Computer science; Combinatorics; Physics; Philosophy; Quantum mechanics","score_opus":0.10441230298063876,"score_gpt":0.25264989495161183,"score_spread":0.14823759197097308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292182108","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013807369,0.000059355956,0.9810708,0.00008252179,0.00046738167,0.00029024392,0.000030135403,0.00015551556,0.0040366524],"genre_scores_gemma":[0.30334783,0.000038522885,0.69609666,0.000092094786,0.00004897779,0.0000016022135,0.000002480608,0.000012805694,0.00035901438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776417,0.00044412655,0.0003109178,0.001033012,0.00010631348,0.00034146817],"domain_scores_gemma":[0.9978404,0.0002192851,0.00032823978,0.0011187579,0.0001975712,0.000295719],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051177404,0.00029909896,0.0005294835,0.00041555127,0.00009582856,0.00006405381,0.0025258288,0.00019387431,0.000066514],"category_scores_gemma":[0.000024681774,0.00031350035,0.0003525039,0.0009205918,0.000063849155,0.0002503972,0.0031593419,0.0004339601,0.00007671727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009536909,0.00084637175,0.00057436887,0.00026619746,0.00046650154,0.0005727766,0.0026569257,0.02601654,0.0012507254,0.83889145,0.0004286601,0.12793408],"study_design_scores_gemma":[0.0005656165,0.0005899769,0.0016658612,0.0003183491,0.0002463808,0.000027563377,0.0001715139,0.27440587,0.007054602,0.71183527,0.0018409512,0.0012780501],"about_ca_topic_score_codex":0.0006439802,"about_ca_topic_score_gemma":0.0000095314035,"teacher_disagreement_score":0.28954044,"about_ca_system_score_codex":0.00009858094,"about_ca_system_score_gemma":0.00012092867,"threshold_uncertainty_score":0.9999317},"labels":[],"label_agreement":null},{"id":"W2296022720","doi":"10.48550/arxiv.cs/0703026","title":"Formal proof for delayed finite field arithmetic using floating point operators","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Mathematical proof; Rewriting; Computer science; Proof assistant; Field (mathematics); Arithmetic; Formal proof; Code (set theory); Point (geometry); Finite field; Floating point; Proof complexity; Theoretical computer science; Programming language; Mathematics; Discrete mathematics","score_opus":0.08182958631761202,"score_gpt":0.3469505712361439,"score_spread":0.2651209849185319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296022720","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13186611,0.00018968957,0.86479855,0.00043270667,0.0017022919,0.0006791043,0.000010177679,0.00013776556,0.00018361774],"genre_scores_gemma":[0.16483122,0.000009276577,0.83323133,0.0011995789,0.00056332967,0.000049165985,0.0000076125266,0.000036324538,0.000072175244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971491,0.00012038222,0.0007043032,0.00089130073,0.000318828,0.0008160699],"domain_scores_gemma":[0.99751645,0.00081194186,0.00032913327,0.00088584056,0.00024269358,0.00021396684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014161363,0.0004099881,0.0005383664,0.00019290928,0.00031806465,0.0002613226,0.0012349576,0.00035347394,0.000014271586],"category_scores_gemma":[0.00070611166,0.0003688343,0.00030473463,0.00037791595,0.000044528068,0.00043173844,0.001836258,0.0008136984,0.000010474632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110105815,0.00044274636,0.017723165,0.0008406452,0.0004029393,0.00016323477,0.002401412,0.016633952,0.0042839525,0.004570575,0.00025082735,0.95217645],"study_design_scores_gemma":[0.0005958994,0.0004349236,0.0012266819,0.00032428064,0.0000617591,0.000021382553,0.000059374437,0.95094186,0.036453623,0.0075556235,0.0013834304,0.0009411783],"about_ca_topic_score_codex":0.00017299471,"about_ca_topic_score_gemma":0.000004733757,"teacher_disagreement_score":0.9512353,"about_ca_system_score_codex":0.00009921221,"about_ca_system_score_gemma":0.00020397847,"threshold_uncertainty_score":0.9998764},"labels":[],"label_agreement":null},{"id":"W2296058057","doi":"10.1145/2812813","title":"An Enhanced Adaptive Recoding Rotation CORDIC","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"CORDIC; Computer science; Fast Fourier transform; Spurious-free dynamic range; Field-programmable gate array; Trigonometric functions; Twiddle factor; Power of two; Algorithm; Rotation (mathematics); Parallel computing; Computer hardware; Dynamic range; Fourier transform; Mathematics","score_opus":0.04924053905206561,"score_gpt":0.2963204737438354,"score_spread":0.2470799346917698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296058057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011226401,0.00026577516,0.984487,0.00079062063,0.0008760716,0.00024839243,0.0000034790132,0.00050388346,0.0015983598],"genre_scores_gemma":[0.89523506,0.00004455337,0.10422307,0.00005331569,0.000022187265,0.00011590445,7.898909e-7,0.0000091129405,0.00029602894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987636,0.00016361801,0.0002555202,0.00043967838,0.00012876447,0.00024878333],"domain_scores_gemma":[0.9988272,0.00013432806,0.00010184732,0.00067175133,0.00012429632,0.0001405474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004909319,0.00014657195,0.00025322716,0.0004004038,0.00022283595,0.000095403215,0.0005438127,0.00020664286,0.000007733169],"category_scores_gemma":[0.000056130553,0.0001314845,0.00003071003,0.000769871,0.00008070614,0.0004587556,0.00000462944,0.00029372855,0.00003628057],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020300276,0.0000753363,0.000021904634,0.000008684866,0.000029976201,0.0000063250914,0.00021221345,0.0007661113,0.003911993,0.019596625,0.00001827615,0.97533226],"study_design_scores_gemma":[0.0032338456,0.006921228,0.0002174528,0.00040071737,0.00007367184,0.0006105392,0.008802823,0.55832386,0.17600055,0.23770288,0.0060952995,0.0016171398],"about_ca_topic_score_codex":0.000072841474,"about_ca_topic_score_gemma":0.000004373165,"teacher_disagreement_score":0.9737151,"about_ca_system_score_codex":0.000046889567,"about_ca_system_score_gemma":0.000044820186,"threshold_uncertainty_score":0.53617823},"labels":[],"label_agreement":null},{"id":"W2301399139","doi":"10.1145/2827700","title":"CORDIC-Based Enhanced Systolic Array Architecture for QR Decomposition","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National University of Defense Technology","keywords":"CORDIC; QR decomposition; Systolic array; Computer science; Field-programmable gate array; Parallel computing; Speedup; Multiplexing; MIMO; Computational science; Computer hardware; Algorithm; Embedded system; Channel (broadcasting); Very-large-scale integration","score_opus":0.03008047115474734,"score_gpt":0.2969631896991813,"score_spread":0.26688271854443396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2301399139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035119397,0.0004025793,0.98997986,0.0035776137,0.0009739906,0.00057880353,0.000016200465,0.00051948044,0.0004395399],"genre_scores_gemma":[0.78164065,0.000012745202,0.21741837,0.00017170985,0.000034450615,0.0004661106,0.000003165631,0.000014893402,0.00023792712],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986443,0.00011726858,0.00029764773,0.00048053436,0.00013124231,0.0003290387],"domain_scores_gemma":[0.9985748,0.00030821585,0.00011673483,0.0007247276,0.00013245145,0.00014309603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040379158,0.00019567317,0.00035759763,0.00047951113,0.0002699392,0.000092390415,0.00059436547,0.00027158996,0.0000039763795],"category_scores_gemma":[0.000065195796,0.00016788807,0.00007623377,0.0006436361,0.00010126175,0.00012884937,0.0000035717712,0.00029629146,0.000015669342],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010670206,0.00021854529,0.000015465137,0.00016316342,0.000104746745,0.000007704241,0.00019759318,0.005321394,0.03273371,0.0140499845,0.00014229695,0.9469387],"study_design_scores_gemma":[0.006285954,0.004984303,0.000047962563,0.0007628623,0.00013247524,0.0006906523,0.0011358538,0.123188704,0.6376283,0.17938966,0.044069078,0.001684166],"about_ca_topic_score_codex":0.00003554663,"about_ca_topic_score_gemma":0.0000056254876,"teacher_disagreement_score":0.9452545,"about_ca_system_score_codex":0.000050933006,"about_ca_system_score_gemma":0.00007002275,"threshold_uncertainty_score":0.6846277},"labels":[],"label_agreement":null},{"id":"W2304461947","doi":"10.1109/icm.2015.7437978","title":"Reducing the number of embedded multipliers in squaring large size complex numbers","year":2015,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Multiplier (economics); Partition (number theory); Arithmetic; Mathematics; Field-programmable gate array; Computer science; Discrete mathematics; Parallel computing; Algorithm; Combinatorics; Computer hardware","score_opus":0.05366920460987557,"score_gpt":0.3451073287977335,"score_spread":0.2914381241878579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2304461947","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085907646,0.000015715137,0.87736267,0.001053852,0.00040607905,0.00017382833,0.0000011432759,0.00009360553,0.034985445],"genre_scores_gemma":[0.49675593,8.1503003e-7,0.5027961,0.0002055635,0.000023294348,0.0000041451012,1.2994423e-7,0.0000045806646,0.00020945286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987255,0.00016965097,0.00027769763,0.00025757356,0.00026173837,0.00030786864],"domain_scores_gemma":[0.9988614,0.00043601752,0.00008331133,0.0004496553,0.000058836922,0.00011080532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010469223,0.00010330782,0.00020151424,0.000024870697,0.00004964843,0.000050726365,0.0006714297,0.000035854206,0.000056144145],"category_scores_gemma":[0.00032504497,0.00006742424,0.000057253485,0.0005324867,0.00005469881,0.0001999075,0.0003105992,0.0001458023,0.000030267647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007639632,0.0012292083,0.08293551,0.000087894055,0.00012306217,0.000080735146,0.045487165,0.004313423,0.01105004,0.350657,0.007875914,0.49608365],"study_design_scores_gemma":[0.0024154559,0.00006223931,0.027781898,0.000053524524,0.000007184118,0.000032790344,0.004190275,0.9271307,0.003070469,0.029995972,0.0047723474,0.00048714134],"about_ca_topic_score_codex":0.0006756182,"about_ca_topic_score_gemma":0.000013515278,"teacher_disagreement_score":0.9228173,"about_ca_system_score_codex":0.00003761343,"about_ca_system_score_gemma":0.000044505618,"threshold_uncertainty_score":0.2749481},"labels":[],"label_agreement":null},{"id":"W2333744133","doi":"10.2514/6.2015-3062","title":"A Continuous Sensitivity Equation of Arbitrary High Order","year":2015,"lang":"en","type":"article","venue":"22nd AIAA Computational Fluid Dynamics Conference","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Sensitivity (control systems); Order (exchange); Computer science; Applied mathematics; Mathematics; Engineering; Electronic engineering; Business","score_opus":0.03592210093840128,"score_gpt":0.2693761547304198,"score_spread":0.23345405379201853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2333744133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04286295,0.000026750035,0.95437086,0.0011160157,0.00043405677,0.00015009628,0.00003499773,0.000103835475,0.0009004251],"genre_scores_gemma":[0.5326391,0.0000017545854,0.46704918,0.00017506396,0.00003195889,0.0000018864905,0.000041935316,0.0000061266805,0.00005298568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980373,0.00029485306,0.00040923594,0.00041624394,0.0005946013,0.00024781015],"domain_scores_gemma":[0.9975617,0.00056499935,0.00019317708,0.00029812497,0.0011977475,0.00018423647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006944847,0.00018998985,0.0003380921,0.00011521727,0.000066178516,0.000116499425,0.00031991696,0.00007637963,0.0000092520495],"category_scores_gemma":[0.0002877986,0.00018358041,0.00006237896,0.0005704074,0.0001272003,0.00042142678,0.00022514636,0.00016215797,0.000030230003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011464873,0.00013569272,0.00023294953,0.000012354355,0.000025251667,0.000028111792,0.0002678926,0.033326566,0.00041207424,0.8867287,0.000052788244,0.07876613],"study_design_scores_gemma":[0.00034988206,0.000108208405,0.0026097775,0.000019047799,0.000005440697,0.00002368732,0.000035552985,0.7829052,0.0001321258,0.21360493,0.000033553057,0.00017258424],"about_ca_topic_score_codex":0.0001916678,"about_ca_topic_score_gemma":0.000010093889,"teacher_disagreement_score":0.74957865,"about_ca_system_score_codex":0.000084005966,"about_ca_system_score_gemma":0.0005150199,"threshold_uncertainty_score":0.7486192},"labels":[],"label_agreement":null},{"id":"W2338924859","doi":"10.1017/mag.2016.23","title":"100.14 Optimum choice of interpolation points in Newton’s divided difference formula","year":2016,"lang":"en","type":"article","venue":"The Mathematical Gazette","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Content (measure theory); Interpolation (computer graphics); Mathematics; Applied mathematics; Computer science; Mathematical optimization; Mathematical analysis; Computer graphics (images)","score_opus":0.04053620404358291,"score_gpt":0.311944611900072,"score_spread":0.2714084078564891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338924859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0387354,0.000014683877,0.95128196,0.008652494,0.000093677736,0.00017870108,0.0000014674728,0.000046962832,0.0009946543],"genre_scores_gemma":[0.6225987,0.000006673129,0.37579277,0.00043613501,0.00006402045,0.000029420753,2.0903094e-7,0.000014198578,0.0010578365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985797,0.00018255322,0.000417097,0.00023615459,0.00030078483,0.00028373906],"domain_scores_gemma":[0.99739563,0.0017483275,0.00013509148,0.0006020117,0.00004292222,0.00007603576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006842125,0.00013843269,0.0002840273,0.000062616695,0.00003569157,0.000041526022,0.0009376084,0.000048607457,0.00006875593],"category_scores_gemma":[0.00077424844,0.000064916705,0.00007992965,0.00028457353,0.000108595654,0.00020593172,0.0003728833,0.000118734526,0.00008063048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022579186,0.00037051237,0.0007457973,0.00010947233,0.000032273514,0.0000062180065,0.0017450392,0.00000533083,0.038445476,0.521461,0.00032570027,0.43673056],"study_design_scores_gemma":[0.0005946911,0.00011738823,0.0098585365,0.00036889658,0.000009138367,0.0000075226185,0.000012189111,0.12042317,0.005781539,0.86237925,0.0002431378,0.00020455846],"about_ca_topic_score_codex":0.000012311326,"about_ca_topic_score_gemma":0.000001644467,"teacher_disagreement_score":0.5838633,"about_ca_system_score_codex":0.000026605252,"about_ca_system_score_gemma":0.00001437012,"threshold_uncertainty_score":0.26472265},"labels":[],"label_agreement":null},{"id":"W2341796638","doi":"10.1049/iet-cdt.2015.0058","title":"Decimal floating‐point fused multiply‐add with redundant internal encodings","year":2015,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Rounding; Adder; Arithmetic; Decimal; Critical path method; Computer science; Floating point; Square root; Binary number; Division (mathematics); Parallel computing; Multiplier (economics); Multiplication algorithm; Algorithm; Mathematics; Engineering; Latency (audio)","score_opus":0.022599201386390284,"score_gpt":0.2639737822558015,"score_spread":0.2413745808694112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2341796638","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063712155,0.000034120083,0.9859297,0.0006167005,0.00039019092,0.00029729563,0.0000072948606,0.0016300665,0.0047234055],"genre_scores_gemma":[0.25100988,0.0000026700052,0.7482535,0.00043841673,0.00017076165,0.000017338933,0.0000032860032,0.000025659396,0.00007848829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766654,0.00007269305,0.00043844077,0.0007137902,0.0005809025,0.0005276072],"domain_scores_gemma":[0.9983111,0.00019882232,0.0002114458,0.00062438473,0.00024438853,0.00040986054],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00043681473,0.00035888574,0.00040399822,0.0001713892,0.00009136964,0.0012102402,0.0014862696,0.000085967564,0.000002581682],"category_scores_gemma":[0.000111497284,0.0002764312,0.00013444874,0.0004780442,0.00018164913,0.0016874995,0.00084672094,0.00030782074,0.000022408949],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005922443,0.0002277381,0.00057995087,0.000012729962,0.000045068606,0.00021412542,0.0008800466,0.00001618186,0.0008998612,0.004696062,0.0076172138,0.9847518],"study_design_scores_gemma":[0.0049908166,0.013138137,0.0012801915,0.001965858,0.000053007832,0.0030793431,0.0005273924,0.36339644,0.27224308,0.12371275,0.21033943,0.0052735466],"about_ca_topic_score_codex":0.000055054486,"about_ca_topic_score_gemma":0.0000012202532,"teacher_disagreement_score":0.97947824,"about_ca_system_score_codex":0.00012923391,"about_ca_system_score_gemma":0.00009978561,"threshold_uncertainty_score":0.99996877},"labels":[],"label_agreement":null},{"id":"W2353422490","doi":"","title":"A KIND OF TRIGONOMETRIC GRNERATOR ON COMPUTING DYNAMIC EQUATIONS FASTLY","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Trigonometry; CORDIC; Computer science; Trigonometric functions; Computation; Computational science; Parallel computing; Algorithm; Throughput; Computer hardware; Field-programmable gate array; Mathematics; Operating system","score_opus":0.02732572413722066,"score_gpt":0.30398967904245555,"score_spread":0.2766639549052349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2353422490","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007292888,0.000038244798,0.98481715,0.00012828094,0.0002403728,0.000080831545,8.9149614e-7,0.00005077821,0.007350573],"genre_scores_gemma":[0.48705772,0.0000010266808,0.512692,0.00010126498,0.0000069516996,0.0000011478165,1.8287712e-7,0.0000028299626,0.00013689509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990467,0.00013642402,0.00022832365,0.00023579004,0.0001756425,0.00017716337],"domain_scores_gemma":[0.9989403,0.00056345126,0.00008701201,0.00028332486,0.000052283238,0.000073621435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042228375,0.00008422687,0.00015935047,0.00024170165,0.000068993075,0.000047465033,0.00030474216,0.000026943422,0.000032766944],"category_scores_gemma":[0.00034667584,0.00006618884,0.00006244919,0.0016543348,0.000021956334,0.000099207835,0.000047268848,0.00008241731,0.000031448373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.63438e-7,0.00014933682,0.00008385522,0.000004971003,0.000010263238,0.0000013505777,0.00007441333,0.0004914481,0.0009716462,0.5083609,0.000018065306,0.48983288],"study_design_scores_gemma":[0.000582004,0.00041733004,0.0022704178,0.000018913113,0.000006296073,0.00000473447,0.00004495604,0.9709857,0.0069104987,0.016336212,0.0021381022,0.00028482793],"about_ca_topic_score_codex":0.000008307001,"about_ca_topic_score_gemma":4.0714932e-7,"teacher_disagreement_score":0.9704943,"about_ca_system_score_codex":0.00002530723,"about_ca_system_score_gemma":0.00003972142,"threshold_uncertainty_score":0.26991028},"labels":[],"label_agreement":null},{"id":"W2488658996","doi":"10.1007/978-3-319-30379-6_63","title":"Fixed Point Techniques in Analog Systems","year":2016,"lang":"en","type":"book-chapter","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Uniqueness; Fixed point; Fixed-point theorem; Mathematics; Ordinary differential equation; Partial differential equation; Applied mathematics; Mathematical analysis; Differential equation","score_opus":0.02360638829615991,"score_gpt":0.2682178212213849,"score_spread":0.24461143292522497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2488658996","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.6661902e-8,0.00015714362,0.5097033,0.00030045566,0.0002465277,0.00013384374,0.0000026110713,0.00017068705,0.4892854],"genre_scores_gemma":[0.00006645159,0.0001405105,0.40400398,0.00026257045,0.00022407208,0.000022869799,8.111163e-7,0.000024463578,0.59525424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99858075,0.000044062916,0.00037601063,0.0005104065,0.00024505207,0.00024368684],"domain_scores_gemma":[0.99885124,0.00019654156,0.0001400566,0.0006596205,0.000057965237,0.00009458037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043212055,0.00024883676,0.0004403203,0.00022675822,0.00002425514,0.00009823767,0.00081072893,0.00023487472,0.00009677552],"category_scores_gemma":[0.000023442359,0.00015791097,0.00010829839,0.000054637912,0.000044159933,0.00015741437,0.00023435747,0.00022592214,0.00015032786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.004652e-7,0.000004030997,0.0000011251313,0.00000943001,0.000005480907,0.000034002,0.0000049308924,5.685962e-8,0.00003901102,0.7077682,0.00062119873,0.291512],"study_design_scores_gemma":[0.00012152525,0.00014868587,0.0000093167355,0.00060057995,0.0000045040106,0.00003158396,0.0000016366735,0.0012043966,0.0005083119,0.43279356,0.56396896,0.0006069616],"about_ca_topic_score_codex":0.00004624979,"about_ca_topic_score_gemma":0.0000028912175,"teacher_disagreement_score":0.56334776,"about_ca_system_score_codex":0.00008195827,"about_ca_system_score_gemma":0.000042968335,"threshold_uncertainty_score":0.64394224},"labels":[],"label_agreement":null},{"id":"W2520705664","doi":"10.1145/2950067.2950076","title":"A fully parallel approximate CORDIC design","year":2016,"lang":"en","type":"article","venue":"International Symposium on Nanoscale Architectures","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"CORDIC; Computer science; Rotation (mathematics); Transformation (genetics); Scheme (mathematics); Algorithm; Trigonometric functions; Discrete cosine transform; Parallel computing; Arithmetic; Mathematics; Field-programmable gate array; Computer hardware; Artificial intelligence; Image (mathematics)","score_opus":0.01793891184503775,"score_gpt":0.2685308559063751,"score_spread":0.25059194406133734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520705664","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023687165,0.000028445054,0.9726452,0.020275151,0.0010745132,0.00020046126,0.00001189318,0.0002256958,0.0031698782],"genre_scores_gemma":[0.38197795,0.00003571881,0.61348546,0.0021175866,0.00039952598,0.0001083108,0.0000015872959,0.000026818934,0.0018470342],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980274,0.00020781488,0.00027652556,0.00056463183,0.0005674149,0.0003562278],"domain_scores_gemma":[0.9985609,0.0006475529,0.00011553616,0.00044529443,0.00007442692,0.00015626768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002843813,0.00022107412,0.00018929751,0.00012950918,0.00010122979,0.00013042326,0.0014591365,0.00006291673,0.000059395272],"category_scores_gemma":[0.0001144693,0.00013110838,0.0001362066,0.00017519499,0.000095717485,0.00012087606,0.00026272368,0.00013053392,0.00013135762],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002260382,0.00029611756,0.00033436192,0.0000069035345,0.00010123501,0.00007501842,0.00021720881,0.002207978,0.13175844,0.061818164,0.0015614728,0.8013971],"study_design_scores_gemma":[0.0056279376,0.0027761857,0.008264992,0.00047108208,0.000029498047,0.00042820946,0.000011353692,0.10364549,0.25723562,0.49470785,0.12461541,0.0021863491],"about_ca_topic_score_codex":0.000016406431,"about_ca_topic_score_gemma":9.2209467e-7,"teacher_disagreement_score":0.7992107,"about_ca_system_score_codex":0.000060804483,"about_ca_system_score_gemma":0.000029904217,"threshold_uncertainty_score":0.5346445},"labels":[],"label_agreement":null},{"id":"W2533798978","doi":"10.1109/iceec.2004.1374440","title":"ERL: an algorithm for fast evaluation of exponential, reciprocal, and logarithmic functions","year":2005,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Reciprocal; Exponential function; Logarithm; Algorithm; Computer science; Algorithm design; Mathematics; Mathematical analysis","score_opus":0.05882662110972689,"score_gpt":0.3478527906744261,"score_spread":0.2890261695646992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2533798978","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038561581,0.00012600233,0.99457407,0.00045815724,0.00023341928,0.0003172282,0.000006578385,0.000065123924,0.0003632637],"genre_scores_gemma":[0.01559989,0.000009376129,0.9836828,0.000118547265,0.00017688106,0.00007392236,0.0000047841236,0.0000067480437,0.00032706358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988814,0.00012023617,0.00021786486,0.00032115265,0.00029514363,0.00016418591],"domain_scores_gemma":[0.9991932,0.000093389826,0.000071922055,0.00027541217,0.00027148813,0.000094587565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010412688,0.00009124012,0.00014116357,0.00007803371,0.000106396954,0.00006614472,0.00021024318,0.000047140144,0.000046787667],"category_scores_gemma":[0.000044001263,0.00007620107,0.000044123943,0.00019728308,0.000047698126,0.0005451349,0.00006920536,0.000052429208,0.0000053897543],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016053946,0.000090941285,0.0000054413035,0.0000024851115,0.0000075267517,6.137232e-8,0.00007220621,0.0000457087,0.0013303456,0.0018281731,0.00015614415,0.99645936],"study_design_scores_gemma":[0.00055448123,0.00028026546,0.0003061733,0.000004824826,0.000023555842,0.0000060106904,0.00006701801,0.98644537,0.0053249192,0.0036627967,0.0032133097,0.00011125644],"about_ca_topic_score_codex":0.000027711867,"about_ca_topic_score_gemma":0.000008193904,"teacher_disagreement_score":0.9963481,"about_ca_system_score_codex":0.000023724077,"about_ca_system_score_gemma":0.00005014501,"threshold_uncertainty_score":0.31073892},"labels":[],"label_agreement":null},{"id":"W2539913202","doi":"10.1109/acssc.2011.6190419","title":"Exploration of sign precomputation-based CORDIC in reconfigurable systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"AUTO21 Network of Centres of Excellence","keywords":"CORDIC; Precomputation; Virtex; Field-programmable gate array; Computer science; Parallel computing; Sign (mathematics); Computer hardware; Algorithm; Mathematics; Computation","score_opus":0.09872016904157115,"score_gpt":0.2855447442718708,"score_spread":0.18682457523029966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2539913202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011371097,0.000026251046,0.98866844,0.000056757177,0.00033902362,0.00014590123,3.5541987e-7,0.00005167489,0.009574478],"genre_scores_gemma":[0.5500449,0.000001554942,0.44977087,0.0000352363,0.000009184933,0.000018891335,5.498372e-7,0.000002905682,0.00011590909],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922323,0.0001380343,0.00025412263,0.00017082194,0.000104942344,0.000108850996],"domain_scores_gemma":[0.9994825,0.00014169274,0.00009292307,0.00018210386,0.00006364274,0.000037123435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037157472,0.000058885726,0.0001344816,0.00009507508,0.000016283786,0.00002463488,0.00023280329,0.000027383767,0.00003045938],"category_scores_gemma":[0.000029250792,0.000048887472,0.000024073079,0.00036573785,0.000014075757,0.0004562885,0.00001132879,0.000041869105,0.000017669176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002250248,0.0004665326,0.0023441233,0.00010937082,0.000014686599,0.000010692705,0.0019492708,0.01752229,0.0016684913,0.113853954,0.00024893487,0.86178917],"study_design_scores_gemma":[0.00026645078,0.00019859624,0.0015760668,0.000036804024,0.0000013258119,7.3856495e-7,0.00008897507,0.9711475,0.011057552,0.015383688,0.00013213945,0.00011017024],"about_ca_topic_score_codex":0.0006178878,"about_ca_topic_score_gemma":0.0000046200653,"teacher_disagreement_score":0.9536252,"about_ca_system_score_codex":0.000013871674,"about_ca_system_score_gemma":0.00003823668,"threshold_uncertainty_score":0.19935733},"labels":[],"label_agreement":null},{"id":"W2555658659","doi":"10.1115/1.4035221","title":"Wrench Accuracy for Parallel Manipulators and Interval Dependency","year":2016,"lang":"en","type":"article","venue":"Journal of Mechanisms and Robotics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Wrench; Jacobian matrix and determinant; Interval (graph theory); Dependency (UML); Actuator; Set (abstract data type); Intersection (aeronautics); Torque; Control theory (sociology); Computer science; Parallel manipulator; Interval arithmetic; Mathematics; Robot; Engineering; Control (management); Artificial intelligence; Mechanical engineering; Applied mathematics","score_opus":0.029219883202387935,"score_gpt":0.28797043611305234,"score_spread":0.2587505529106644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555658659","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079662236,0.00027643066,0.99587137,0.002352013,0.0006188614,0.00006530162,9.591355e-7,0.000008107587,0.0000103179345],"genre_scores_gemma":[0.033467192,0.00035100902,0.96584487,0.00013622722,0.00011349855,9.581962e-7,3.2288725e-8,0.000006378569,0.00007984311],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919075,0.000038798702,0.00030131885,0.00013720992,0.00016360368,0.00016834387],"domain_scores_gemma":[0.9990972,0.00029406484,0.00023710023,0.00011110788,0.00010504321,0.00015542972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004816625,0.000099354475,0.00022151037,0.000061881794,0.000074987016,0.00008134134,0.00026361208,0.00005336471,0.0000035326334],"category_scores_gemma":[0.0001403606,0.00005374844,0.000072032984,0.00005410634,0.000020904781,0.00034977164,0.00013153191,0.00008199301,5.964445e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016616408,0.00004673374,0.000067012676,0.000020498392,0.000036429643,0.000026152093,0.000094940566,0.00017163753,0.0044256533,0.3580333,0.000081818616,0.6369792],"study_design_scores_gemma":[0.0017330749,0.0016154037,0.0009668526,0.00018260992,0.00004745241,0.0006944828,0.00006394809,0.05289501,0.0011355116,0.93931305,0.001068948,0.00028365545],"about_ca_topic_score_codex":0.0000012023726,"about_ca_topic_score_gemma":4.144567e-7,"teacher_disagreement_score":0.63669556,"about_ca_system_score_codex":0.000011755436,"about_ca_system_score_gemma":0.000026263977,"threshold_uncertainty_score":0.21917978},"labels":[],"label_agreement":null},{"id":"W2561509960","doi":"10.1016/j.amc.2016.12.024","title":"Improving CAS capabilities: New rules for computing improper integrals","year":2016,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Symbolic computation; Computation; Calculus (dental); Limit (mathematics); Laplace transform; Computer science; Mathematics; Algebra over a field; Applied mathematics; Algorithm; Mathematical analysis; Pure mathematics","score_opus":0.026937031370197553,"score_gpt":0.28951362115763574,"score_spread":0.2625765897874382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561509960","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017664954,0.00003428134,0.98105377,0.00038549217,0.00011241375,0.000341467,0.0000024417502,0.00011126198,0.00029393908],"genre_scores_gemma":[0.08113238,0.000003783945,0.9185824,0.00009301259,0.0000895292,0.000018075782,0.0000011064654,0.000012786747,0.000066912835],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905354,0.000010128659,0.0002927099,0.00030155983,0.00012597964,0.00021608594],"domain_scores_gemma":[0.9988249,0.0006977332,0.0001497905,0.00016942808,0.000063860716,0.00009427642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035882095,0.00014026812,0.00021617093,0.000047498303,0.00012197418,0.00015449336,0.00020090915,0.000036748883,0.0000020793927],"category_scores_gemma":[0.000070121416,0.0000868431,0.000044395525,0.00008533538,0.000039131508,0.00013366074,0.00013067554,0.000043046362,0.000007812151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013238866,0.000017202057,0.0000011020796,0.000056140878,0.0000056438216,1.9873654e-7,0.0006414669,0.000009773582,0.0041292296,0.24749474,0.000048034082,0.74759513],"study_design_scores_gemma":[0.00050680427,0.00008366855,0.000028995562,0.000054096294,0.000009176505,0.000008908064,0.00020480309,0.39057973,0.003014261,0.6050755,0.00023367748,0.00020043025],"about_ca_topic_score_codex":0.00002756331,"about_ca_topic_score_gemma":7.311995e-7,"teacher_disagreement_score":0.74739474,"about_ca_system_score_codex":0.000026964097,"about_ca_system_score_gemma":0.000036832847,"threshold_uncertainty_score":0.3541359},"labels":[],"label_agreement":null},{"id":"W2562314876","doi":"10.1016/j.jpdc.2016.12.013","title":"Low latency and division free Gauss–Jordan solver in floating point arithmetic","year":2016,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Gaussian elimination; Latency (audio); Parallel computing; Division (mathematics); Solver; Floating point; Gauss; Field-programmable gate array; Critical path method; Algorithm; Arithmetic; Gaussian; Computer hardware; Mathematics","score_opus":0.011599648206551433,"score_gpt":0.2535385210227733,"score_spread":0.24193887281622187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562314876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22858447,0.0003190575,0.769368,0.001495038,0.00015457741,0.000039595223,0.0000030492315,0.000013176626,0.000023075138],"genre_scores_gemma":[0.7029152,0.000059046524,0.2968844,0.0000579474,0.00007422804,1.8305357e-7,2.9302166e-7,0.0000042718734,0.0000044494805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984985,0.00014111144,0.000571688,0.0002349998,0.0002445228,0.00030916874],"domain_scores_gemma":[0.9987195,0.00046502944,0.0003482642,0.0001785716,0.00010081699,0.00018780955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009386275,0.00014749069,0.00033305975,0.00011214463,0.00011396595,0.00013234079,0.00038161498,0.00005304658,0.0000031657787],"category_scores_gemma":[0.00038265804,0.0000904714,0.000064654814,0.00026148444,0.000054652068,0.0003851009,0.00043995702,0.0002076633,9.739639e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027114982,0.00018117648,0.027403815,0.000043542528,0.000034089753,0.00024934267,0.00044502213,0.00074056134,0.002985252,0.006356044,0.00016391497,0.9613701],"study_design_scores_gemma":[0.00733666,0.0010365006,0.3736542,0.0019184091,0.000028460268,0.00073099555,0.00025436975,0.43855593,0.00088506076,0.17440422,0.0004023493,0.00079287397],"about_ca_topic_score_codex":0.000016790336,"about_ca_topic_score_gemma":9.3901673e-7,"teacher_disagreement_score":0.96057725,"about_ca_system_score_codex":0.000033023596,"about_ca_system_score_gemma":0.00003184224,"threshold_uncertainty_score":0.36893168},"labels":[],"label_agreement":null},{"id":"W2567514703","doi":"10.1109/arith.1997.614878","title":"Theory and applications for a double-base number system","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Modular design; Computation; Logarithm; Arithmetic; Base (topology); Cryptography; Simple (philosophy); Modular arithmetic; Theoretical computer science; Digital signal processing; Representation (politics); Table (database); Algorithm; Mathematics; Computer hardware; Programming language; Data mining","score_opus":0.032881321108376056,"score_gpt":0.2949261330994269,"score_spread":0.26204481199105084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567514703","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005143493,0.00006884234,0.982115,0.000341421,0.000050264127,0.0002812358,0.0000012603499,0.00013545086,0.016955106],"genre_scores_gemma":[0.032472078,0.000004090391,0.96392673,0.00027839327,0.00009228792,0.00034757663,2.2168986e-7,0.0000049442147,0.0028736726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953574,0.00003343274,0.00008191182,0.00018615558,0.000052533196,0.00011022238],"domain_scores_gemma":[0.99941933,0.00024247021,0.000021080688,0.0002230998,0.000026344445,0.00006767527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002668083,0.000050675764,0.00007311318,0.000012775909,0.000084740386,0.000069983544,0.0001786235,0.000018835535,0.00002707991],"category_scores_gemma":[0.0000053090534,0.000036692712,0.000025917585,0.00012376816,0.000020114625,0.000089655354,0.00005053499,0.00002535537,0.000061323415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013374371,0.0000139757185,0.000009356844,0.000012596789,0.0000024447643,2.78863e-7,0.000022406093,5.2125995e-7,0.000021865082,0.794447,0.00017964702,0.20528857],"study_design_scores_gemma":[0.003160435,0.00015098852,0.00011127646,0.000037344405,0.000031207197,0.00014506585,0.00030397746,0.4723189,0.0039466126,0.25883707,0.26024505,0.00071205094],"about_ca_topic_score_codex":0.0000040327564,"about_ca_topic_score_gemma":1.2862083e-7,"teacher_disagreement_score":0.5356099,"about_ca_system_score_codex":0.000007793246,"about_ca_system_score_gemma":0.0000026629639,"threshold_uncertainty_score":0.14962853},"labels":[],"label_agreement":null},{"id":"W2576532738","doi":"10.1515/udt-2016-0005","title":"On Strong Normality","year":2016,"lang":"en","type":"article","venue":"Uniform distribution theory","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Normality; Mathematics; Statistics","score_opus":0.012554835116144029,"score_gpt":0.26215723515878847,"score_spread":0.24960240004264445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576532738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027185245,0.000009568271,0.9912307,0.00079000904,0.0002633431,0.000058649664,0.000077939316,0.00014827946,0.0047029518],"genre_scores_gemma":[0.9813212,0.0000065467507,0.01759987,0.00026353862,0.000072213705,0.000008558423,0.000013991987,0.0000049020273,0.0007091454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990344,0.00015953156,0.00014799615,0.0002231556,0.00018004111,0.0002548592],"domain_scores_gemma":[0.9990009,0.00036539862,0.000061024122,0.00041624636,0.00004970921,0.00010672485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007942866,0.000097626624,0.00009679761,0.000022198561,0.00011421839,0.00004191038,0.0004322031,0.000041169762,0.000104592924],"category_scores_gemma":[0.00022692265,0.000056045563,0.00006374545,0.00017392453,0.000070570444,0.0003108046,0.00011095335,0.00006957926,0.0002176902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000778747,0.000025342566,0.0000217519,9.1454206e-7,0.0000029978803,0.0000014716508,0.0000054823013,0.0000010416056,0.000097116215,0.7115097,0.00014168372,0.2881847],"study_design_scores_gemma":[0.0003772873,0.00014764743,0.00251411,0.000024240433,0.0000029207854,0.0000050948092,0.000010578634,0.00084001495,0.008687787,0.97329515,0.013913724,0.00018146537],"about_ca_topic_score_codex":0.0000023123544,"about_ca_topic_score_gemma":1.3633094e-7,"teacher_disagreement_score":0.9786027,"about_ca_system_score_codex":0.000093845716,"about_ca_system_score_gemma":0.00002445023,"threshold_uncertainty_score":0.27980396},"labels":[],"label_agreement":null},{"id":"W2586442443","doi":"10.1142/s0218126617501298","title":"VLIW DSP-Based Low-Level Instruction Scheme of Givens QR Decomposition for Real-Time Processing","year":2017,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Very long instruction word; Computer science; Parallel computing; Instruction-level parallelism; QR decomposition; Compiler; SIMD; Digital signal processing; Key (lock); Cache; Instruction set; Data parallelism; Parallelism (grammar); Computer hardware; Programming language","score_opus":0.035155931262750344,"score_gpt":0.31015807332598694,"score_spread":0.2750021420632366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586442443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12137908,0.00014723794,0.8769885,0.00019221037,0.0010507315,0.00015378367,0.0000044845174,0.00001412779,0.00006986268],"genre_scores_gemma":[0.67062813,0.000021156899,0.32895848,0.000026425729,0.00034153296,0.0000032942437,5.8877356e-7,0.000009585444,0.0000107889955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998689,0.000081301754,0.0005704506,0.00019257194,0.0002866126,0.00018006584],"domain_scores_gemma":[0.9976447,0.00011738859,0.0014209109,0.00026040146,0.00042563106,0.00013094171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006833851,0.00013216809,0.00043317926,0.00014111368,0.00029797762,0.00040202047,0.0005315322,0.000065939676,4.1177935e-7],"category_scores_gemma":[0.000035100915,0.0001094955,0.00013060714,0.00008418992,0.00006907925,0.00068074255,0.000055345652,0.00010263235,4.1585812e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031817464,0.00011489859,0.00041078113,0.0005712097,0.00007033733,0.000016742066,0.00026147897,0.00075055374,0.0378802,0.003523477,0.00012672196,0.9562418],"study_design_scores_gemma":[0.00338028,0.0011610185,0.01411669,0.0023719184,0.000044885393,0.00047293288,0.00006024247,0.9703241,0.0041891695,0.0028576762,0.00063756667,0.00038349186],"about_ca_topic_score_codex":0.00001835399,"about_ca_topic_score_gemma":1.7374794e-7,"teacher_disagreement_score":0.96957356,"about_ca_system_score_codex":0.00004064937,"about_ca_system_score_gemma":0.000112671405,"threshold_uncertainty_score":0.44650972},"labels":[],"label_agreement":null},{"id":"W2587600302","doi":"10.1145/3175502.3175509","title":"Blue sky ideas in artificial intelligence education from the EAAI 2017 new and future AI educator program","year":2018,"lang":"en","type":"article","venue":"AI Matters","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Curriculum; Pedagogy; Psychology","score_opus":0.021680109443894677,"score_gpt":0.3422874222797634,"score_spread":0.3206073128358687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2587600302","genre_codex":"commentary","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020213429,0.000353876,0.4610575,0.5141059,0.003773645,0.00037389874,0.0000021742965,0.000080028825,0.00003948625],"genre_scores_gemma":[0.041784298,0.000067953,0.75486267,0.19598691,0.006992144,0.000090966525,0.0000056367358,0.00002488769,0.00018453083],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990331,0.00009624429,0.00018053837,0.0003403508,0.00013379921,0.0002160012],"domain_scores_gemma":[0.9992875,0.00009249191,0.000060292772,0.0004042191,0.000039909915,0.00011560551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018862232,0.00011561852,0.00011315191,0.000041585503,0.00010203015,0.0003150098,0.0005622136,0.00004468198,0.000035282792],"category_scores_gemma":[0.000020315876,0.00008134097,0.000028851464,0.0003146701,0.000115331764,0.00028538905,0.00012850041,0.00017425999,0.00010177847],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029954401,0.000067585046,0.00020165877,0.0000020642037,0.0000039509346,8.254055e-7,0.0014249538,4.4675494e-7,0.00009609572,0.0063795047,0.0312849,0.960535],"study_design_scores_gemma":[0.0001275273,0.00033046803,0.024144026,0.00012390855,0.000019782115,0.00002330519,0.0016393469,0.011854469,0.0042849653,0.3913805,0.56544954,0.00062214496],"about_ca_topic_score_codex":0.0010730027,"about_ca_topic_score_gemma":0.00006533401,"teacher_disagreement_score":0.9599129,"about_ca_system_score_codex":0.00002202186,"about_ca_system_score_gemma":0.00019316997,"threshold_uncertainty_score":0.33169886},"labels":[],"label_agreement":null},{"id":"W2588085343","doi":"10.18429/jacow-hiat2015-wem2i01","title":"The ISAC-II Linac Performance","year":2016,"lang":"en","type":"article","venue":"JACOW","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"TRIUMF","funders":"","keywords":"Linear particle accelerator; Computer science; Physics; Optics","score_opus":0.01158514282765951,"score_gpt":0.24476566502629413,"score_spread":0.2331805221986346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588085343","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019932436,0.00015913697,0.9599952,0.014587156,0.0009902078,0.000060510174,5.581845e-7,0.00011041326,0.004164376],"genre_scores_gemma":[0.4143559,0.00045129357,0.5590429,0.0012370667,0.0006628485,0.000032022825,8.036511e-8,0.000013894354,0.024204023],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936384,0.00004204359,0.000090480265,0.00015812155,0.0001373081,0.00020822526],"domain_scores_gemma":[0.9992833,0.00021110944,0.000033890632,0.00038807266,0.000029583869,0.00005400628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030902718,0.00005912982,0.000060775823,0.000011369165,0.00029824776,0.000052134958,0.0006500353,0.000020888123,0.00001189686],"category_scores_gemma":[0.000058939193,0.00002419456,0.000034187,0.0001442038,0.00004892467,0.00019940831,0.00023440454,0.000051190902,0.00017619431],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010215883,0.00000746913,0.0001699257,8.0225266e-7,0.000002020117,8.34527e-7,0.000033898305,2.8079776e-7,0.0006532156,0.0088614235,0.0010882557,0.98918086],"study_design_scores_gemma":[0.00027822892,0.0002593006,0.013778103,0.000030370227,0.0000020494297,0.000010242254,0.000006004921,0.018812219,0.009883628,0.015916364,0.94082695,0.00019655495],"about_ca_topic_score_codex":0.0000025089719,"about_ca_topic_score_gemma":3.299058e-7,"teacher_disagreement_score":0.9889843,"about_ca_system_score_codex":0.000013326957,"about_ca_system_score_gemma":0.000016911541,"threshold_uncertainty_score":0.22939108},"labels":[],"label_agreement":null},{"id":"W2590023945","doi":"10.1049/iet-cdt.2016.0100","title":"Area‐ and power‐efficient iterative single/double‐precision merged floating‐point multiplier on FPGA","year":2017,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Multiplier (economics); Field-programmable gate array; Digital signal processing; Computer science; Virtex; Application-specific integrated circuit; Clock rate; Computer hardware; Floating point; Double-precision floating-point format; Embedded system; Parallel computing; Algorithm; Chip; Telecommunications","score_opus":0.030274449641461147,"score_gpt":0.2961824391776271,"score_spread":0.26590798953616596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590023945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023862392,0.00003730002,0.9649009,0.00090385723,0.00057667156,0.0004495313,0.000012275807,0.00070395553,0.0085531045],"genre_scores_gemma":[0.5663103,0.0000042344295,0.43329826,0.00023567876,0.000061474944,0.000013842263,0.000002168302,0.000017171029,0.00005685346],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99782974,0.000058288224,0.00039236218,0.00085938664,0.00043721258,0.00042302074],"domain_scores_gemma":[0.9979159,0.00026328836,0.0003070424,0.0011435787,0.00014587195,0.00022430124],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00036074678,0.00036891445,0.00040036096,0.00015555632,0.0005140544,0.002621131,0.0012834915,0.00011053958,0.0000032527842],"category_scores_gemma":[0.00014879195,0.00029838958,0.00014151649,0.00014844141,0.00021255217,0.0010785356,0.0012193988,0.00026231984,0.00001223172],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004493219,0.00032378605,0.00007002358,0.000009338892,0.000020105219,0.00004995954,0.00073137955,0.00003061329,0.0020323521,0.004142246,0.0009618742,0.9915834],"study_design_scores_gemma":[0.0036183153,0.007920267,0.005480664,0.0022245788,0.000028693612,0.00023058149,0.00015070089,0.35295397,0.5209234,0.06613302,0.036492404,0.0038434237],"about_ca_topic_score_codex":0.000011599123,"about_ca_topic_score_gemma":3.049509e-7,"teacher_disagreement_score":0.98774,"about_ca_system_score_codex":0.00007282733,"about_ca_system_score_gemma":0.000019334588,"threshold_uncertainty_score":0.99994683},"labels":[],"label_agreement":null},{"id":"W2597524413","doi":"10.1007/978-3-319-49742-6_7","title":"Robust Analog Arithmetic Based on the Continuous Valued Number System","year":2017,"lang":"en","type":"book-chapter","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Arithmetic; Multiplication (music); Flexibility (engineering); Analogue electronics; Representation (politics); Electronic circuit; Computer science; Set (abstract data type); Analog computer; Analog signal; Mathematics; Computer hardware; Engineering; Statistics; Electrical engineering; Digital signal processing","score_opus":0.05182333295821514,"score_gpt":0.2632467167304395,"score_spread":0.21142338377222433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597524413","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.0761786e-7,0.00001897853,0.4911591,0.00066589087,0.00062744826,0.00021112729,0.0000061690853,0.00014928886,0.5071618],"genre_scores_gemma":[0.0009768746,0.0000055167807,0.40565872,0.0014921832,0.0004003351,0.00002732142,0.0000035324672,0.000056034994,0.59137946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766624,0.00014477759,0.000378807,0.00078435196,0.00065380376,0.0003720097],"domain_scores_gemma":[0.996245,0.0006265378,0.0004085695,0.0023967824,0.00015726767,0.00016582217],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009363695,0.0004568095,0.00066332007,0.00007930358,0.00038197995,0.00059573556,0.0023561094,0.00026983692,0.0003708655],"category_scores_gemma":[0.00009308134,0.00026114302,0.00034703125,0.000035698984,0.00015857701,0.0000931614,0.0003045499,0.0005670143,0.0009811093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029920973,0.000016131564,0.0000035282183,0.000026577527,0.000039370945,0.00010131646,0.0000076331735,0.000036513946,7.6861755e-7,0.95000577,0.0025108822,0.047248513],"study_design_scores_gemma":[0.00062244735,0.00029852128,0.00007357793,0.0009957654,0.00011451085,0.00008372748,0.000011621695,0.7465581,0.00005172549,0.054629765,0.1952108,0.0013493862],"about_ca_topic_score_codex":0.000053037533,"about_ca_topic_score_gemma":0.000002290838,"teacher_disagreement_score":0.895376,"about_ca_system_score_codex":0.00008656847,"about_ca_system_score_gemma":0.000099784666,"threshold_uncertainty_score":0.9999841},"labels":[],"label_agreement":null},{"id":"W2607445385","doi":"10.1109/tmscs.2017.2696003","title":"Algorithm and Design of a Fully Parallel Approximate Coordinate Rotation Digital Computer (CORDIC)","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Multi-Scale Computing Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"CORDIC; Rotation (mathematics); Computer science; Discrete cosine transform; Algorithm; Transformation (genetics); Trigonometric functions; Scheme (mathematics); Inverse; Arithmetic; Parallel computing; Mathematics; Computer hardware; Artificial intelligence; Field-programmable gate array; Image (mathematics)","score_opus":0.04612738478204215,"score_gpt":0.2917238515425709,"score_spread":0.24559646676052876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607445385","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014552523,0.000059037473,0.9956402,0.000100290534,0.0018356817,0.00065137894,0.000024663696,0.00021070258,0.000022766684],"genre_scores_gemma":[0.3304034,0.0000073130745,0.66936296,0.00001770345,0.00007857395,0.000020348381,7.55202e-7,0.000019833296,0.00008913536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977667,0.00024433478,0.00058808684,0.0006627738,0.00033973655,0.00039840897],"domain_scores_gemma":[0.99797183,0.00034786478,0.0004971489,0.00081267767,0.00018502033,0.00018542644],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000631575,0.0003058107,0.00053594075,0.00015219783,0.0007447475,0.00091778126,0.0008233655,0.00011754868,7.282912e-7],"category_scores_gemma":[0.0000103720195,0.00027835724,0.00013350578,0.00016834478,0.00019345152,0.0006757441,0.000026591555,0.00026474442,0.000010639367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001543151,0.0002601217,0.0000694967,0.0000831974,0.00006164073,0.000012394621,0.00041303912,0.15168932,0.00037403367,0.000060809318,0.000011604199,0.8469489],"study_design_scores_gemma":[0.0011487697,0.00028517316,0.00079370005,0.00020586974,0.000016409507,0.000060490114,0.00004060389,0.99648964,0.0005068552,0.00010675924,0.000039248753,0.0003064531],"about_ca_topic_score_codex":0.0001571065,"about_ca_topic_score_gemma":0.0000010070241,"teacher_disagreement_score":0.84664243,"about_ca_system_score_codex":0.00004410443,"about_ca_system_score_gemma":0.000033764227,"threshold_uncertainty_score":0.99996686},"labels":[],"label_agreement":null},{"id":"W2608075123","doi":"10.1515/msr-2017-0008","title":"Field Programmable Gate Array (FPGA) Respiratory Monitoring System Using a Flow Microsensor and an Accelerometer","year":2017,"lang":"en","type":"article","venue":"Measurement Science Review","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Accelerometer; Field-programmable gate array; Respiratory monitoring; Inertial measurement unit; Tilt sensor; Wearable computer; Microelectromechanical systems; CORDIC; Tilt (camera); Computer science; Rotation (mathematics); Engineering; Sigmoid function; Computer hardware; Embedded system; Artificial neural network; Electronic engineering; Computer vision; Materials science; Artificial intelligence; Mechanical engineering; Respiratory system","score_opus":0.23949843646242508,"score_gpt":0.4042629836665343,"score_spread":0.1647645472041092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608075123","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018374885,0.04756956,0.92742926,0.0011437595,0.0025381679,0.00177188,0.000001361084,0.00028709532,0.0008840256],"genre_scores_gemma":[0.11203007,0.0016811857,0.88554,0.00040837735,0.00025384917,0.000059673614,3.794789e-8,0.000015257561,0.0000115261455],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967852,0.00019052722,0.0003604623,0.00076056446,0.0013413925,0.0005618177],"domain_scores_gemma":[0.99746686,0.000024325544,0.00030894557,0.0014138003,0.0004657174,0.0003203536],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008449693,0.00020202542,0.00039155447,0.00008388228,0.0013149577,0.0014139698,0.0018635393,0.00003429319,0.0000020984942],"category_scores_gemma":[0.00067598757,0.0001534001,0.00007126349,0.00040082735,0.00020131946,0.0017682229,0.0003307709,0.00014823697,0.000008055086],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014308256,0.000031304175,0.00075248524,0.0008895302,0.0000066161165,0.00001314844,0.0000430667,0.0000020520572,0.1311273,0.00009529656,0.000009459363,0.8670283],"study_design_scores_gemma":[0.0018103658,0.0022658827,0.017350424,0.061664406,0.00031875452,0.00035674308,0.00016267513,0.06724691,0.7866854,0.0009965074,0.057440262,0.0037016454],"about_ca_topic_score_codex":0.00003378208,"about_ca_topic_score_gemma":8.8793956e-7,"teacher_disagreement_score":0.86332667,"about_ca_system_score_codex":0.0002059157,"about_ca_system_score_gemma":0.00018903043,"threshold_uncertainty_score":0.9999852},"labels":[],"label_agreement":null},{"id":"W2623814935","doi":"","title":"Accounting for tolerances in the design parameters of the 3-RRR","year":2016,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Accounting; Computer science; Business","score_opus":0.034104931882048724,"score_gpt":0.26791538012572585,"score_spread":0.23381044824367714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623814935","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049343887,0.00035869493,0.9726323,0.018832399,0.00035647087,0.0006828728,0.000012901337,0.000041989162,0.0021479707],"genre_scores_gemma":[0.23127888,0.000076447825,0.76791394,0.00022566036,0.000017664917,0.00016146313,0.0000030903166,0.000013029583,0.000309832],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99171764,0.0066601085,0.0004515629,0.00051540625,0.00037138647,0.00028390446],"domain_scores_gemma":[0.9896216,0.0069597727,0.0005647867,0.0021379204,0.0006760168,0.000039943854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010849169,0.00019568451,0.0002888693,0.000076230805,0.00021408068,0.00032199713,0.00429724,0.000120925084,0.0000034581626],"category_scores_gemma":[0.0020733185,0.00010978598,0.00022250896,0.00042420923,0.00020497805,0.00014540592,0.0012389573,0.00033296001,0.000001949019],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009327911,0.0003260886,0.0010172679,0.00015161699,0.00004375638,0.000001032081,0.010782619,0.0002780877,0.0030288345,0.14983392,0.00046487074,0.8340626],"study_design_scores_gemma":[0.0011541866,0.000002127291,0.008583649,0.005137713,0.00004963308,0.00001009794,0.00021372447,0.31732264,0.22281523,0.43445188,0.009369902,0.0008892181],"about_ca_topic_score_codex":0.00021709835,"about_ca_topic_score_gemma":0.000036064528,"teacher_disagreement_score":0.83317333,"about_ca_system_score_codex":0.000038302336,"about_ca_system_score_gemma":0.00016860841,"threshold_uncertainty_score":0.7985413},"labels":[],"label_agreement":null},{"id":"W266245875","doi":"","title":"Optimization of algorithms with the opal framework","year":2012,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Generality; Computer science; Task (project management); Simple (philosophy); Session (web analytics); Domain (mathematical analysis); Base (topology); Algorithm; Theoretical computer science; Mathematics; Systems engineering; Engineering","score_opus":0.01826293320742537,"score_gpt":0.27850780085308025,"score_spread":0.26024486764565485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W266245875","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014561121,0.00006447158,0.9960856,0.0013998514,0.00015836899,0.0000584449,2.5310584e-7,0.000040884017,0.0020465378],"genre_scores_gemma":[0.03740036,0.000003359523,0.9619684,0.0003868262,0.0001023464,0.000004525146,1.7331085e-7,0.0000036954539,0.0001302692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942917,0.000059403996,0.000082028906,0.000093338575,0.0001706738,0.00016539854],"domain_scores_gemma":[0.99939585,0.00017525614,0.0000497389,0.00028045988,0.000041404877,0.000057265785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027356314,0.000058564056,0.00008125617,0.000017101145,0.00005053362,0.000029970355,0.0003668104,0.000026310097,0.00003872867],"category_scores_gemma":[0.000023584627,0.000027510123,0.000022557906,0.0003555186,0.000045255627,0.00025124388,0.00008608085,0.000077677294,0.0000057893035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005732156,0.00017511052,0.0015348004,0.0000074026407,0.00003135004,0.0000010117336,0.0011032443,0.010832779,0.000061753126,0.3840101,0.00042866275,0.601808],"study_design_scores_gemma":[0.00027058602,0.00029720954,0.005973188,0.000027935805,0.000015802007,0.000024140818,0.0001883027,0.9759279,0.003181609,0.005746537,0.008030588,0.00031620386],"about_ca_topic_score_codex":0.00001214184,"about_ca_topic_score_gemma":1.0062062e-7,"teacher_disagreement_score":0.9650951,"about_ca_system_score_codex":0.0000046107684,"about_ca_system_score_gemma":0.000009178196,"threshold_uncertainty_score":0.11218303},"labels":[],"label_agreement":null},{"id":"W2713952360","doi":"10.1109/ccece.2017.7946811","title":"A software tool for generating optimized multipartite table parameters","year":2017,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"CMC Microsystems","keywords":"Multipartite; Rounding; Table (database); Computer science; Software; Algorithm; Coding (social sciences); Generator (circuit theory); Theoretical computer science; Mathematics; Data mining; Power (physics); Programming language; Statistics","score_opus":0.05067381196039145,"score_gpt":0.3244771661584488,"score_spread":0.27380335419805735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2713952360","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002409045,0.000017745551,0.9960824,0.00050422346,0.00044599033,0.0002356099,0.000003213538,0.00014276213,0.0001589911],"genre_scores_gemma":[0.0015864713,0.0000025629834,0.99648094,0.00049346965,0.000073115145,0.00009321343,7.2445323e-7,0.0000081231165,0.001261367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990521,0.000033453893,0.00016796224,0.00033429282,0.00011108111,0.00030110954],"domain_scores_gemma":[0.9987139,0.00027283843,0.00011717379,0.000749749,0.000066452776,0.00007988627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000396751,0.000104383085,0.00018064673,0.000019286046,0.00058345596,0.0008002463,0.00084498693,0.000035687168,0.000011413591],"category_scores_gemma":[0.00093136803,0.00007990354,0.00008376669,0.00004501526,0.00003517072,0.00057412015,0.00025554388,0.000054511333,0.000011760592],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008873069,0.000038310936,0.00025701692,0.0000112578,0.00001991722,0.0000042191064,0.0000618909,0.0026177014,0.002126935,0.0041099354,0.000994281,0.98974967],"study_design_scores_gemma":[0.0007179286,0.00005889761,0.00011704993,0.000008794906,0.000004082979,0.0000020857685,0.0000035624525,0.9844373,0.008403964,0.0026628897,0.003400063,0.00018341486],"about_ca_topic_score_codex":0.000060741193,"about_ca_topic_score_gemma":0.0000010518653,"teacher_disagreement_score":0.98956627,"about_ca_system_score_codex":0.000011185281,"about_ca_system_score_gemma":0.000025805848,"threshold_uncertainty_score":0.77167934},"labels":[],"label_agreement":null},{"id":"W2727803506","doi":"","title":"A Load-balancing Tool for Structured Multi-block CFD Applications Applied to a Parallel Newton-Krylov Algorithm","year":2012,"lang":"en","type":"article","venue":"TSpace","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto; Mitacs; Canada Research Chairs","keywords":"Computational fluid dynamics; Computer science; Block (permutation group theory); Parallel computing; Computational science; CFD-DEM; Load balancing (electrical power); Algorithm; Mathematics; Mechanics; Physics; Geometry","score_opus":0.027742068052757547,"score_gpt":0.3459688790231117,"score_spread":0.31822681097035416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727803506","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037514657,0.00015094123,0.9961824,0.0011715036,0.00031005676,0.0012916459,0.000008920713,0.00024143445,0.000267956],"genre_scores_gemma":[0.007528099,0.0000034676425,0.9892906,0.00078645366,0.00048112663,0.00087955024,0.0000032500336,0.000026148062,0.0010012935],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998228,0.000034394776,0.00024242667,0.0004970394,0.00029280895,0.00070530764],"domain_scores_gemma":[0.9985301,0.00019449384,0.00010338291,0.0007072859,0.000108523425,0.0003562383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003901766,0.00023639317,0.00029679507,0.00006612069,0.00020557147,0.00012220032,0.0007030544,0.00009051155,0.000010060833],"category_scores_gemma":[0.00006157365,0.0002101475,0.00010020685,0.0005382315,0.000027366226,0.00017218453,0.00025099417,0.00014791302,0.000081219005],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017994276,0.00025693272,0.00014004325,0.00003755113,0.000048709873,0.0000011440762,0.0039781947,0.00048768352,0.014232251,0.027989851,0.0027342355,0.9500754],"study_design_scores_gemma":[0.0032986999,0.00024324945,0.008087927,0.00003214188,0.00006068587,0.000043644613,0.00047094197,0.21329057,0.0078429645,0.007633744,0.75722927,0.0017661746],"about_ca_topic_score_codex":0.000046270467,"about_ca_topic_score_gemma":0.000003046549,"teacher_disagreement_score":0.94830924,"about_ca_system_score_codex":0.00010418779,"about_ca_system_score_gemma":0.000078635254,"threshold_uncertainty_score":0.85695666},"labels":[],"label_agreement":null},{"id":"W2737864593","doi":"10.1145/3061665","title":"Algorithm 978","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Arithmetic underflow; Computer science; Norm (philosophy); Scaling; Parallel computing; Algorithm; Range (aeronautics); Software; Test suite; Suite; Test case; Mathematics; Programming language","score_opus":0.03807129413798471,"score_gpt":0.3171835573263141,"score_spread":0.2791122631883294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737864593","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057236935,0.00001312048,0.9962893,0.0025349413,0.0003333296,0.00013409113,0.000009845497,0.00035006375,0.0002780363],"genre_scores_gemma":[0.0010772292,0.000009403409,0.99770427,0.00027336227,0.0000516187,0.000042094183,3.6604442e-7,0.000015735173,0.00082592835],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865663,0.000051423405,0.00023165383,0.0003899566,0.00034559038,0.0003247186],"domain_scores_gemma":[0.9968107,0.000491326,0.00009230201,0.0023391438,0.000055875873,0.00021067525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025468916,0.00017910406,0.00025354163,0.000052770825,0.0008483757,0.00042290412,0.002288891,0.000089997935,0.0002454222],"category_scores_gemma":[0.0005166916,0.00014111378,0.00016850227,0.0001079041,0.00012309788,0.00047559736,0.000059863447,0.00027916822,0.00066494587],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010940547,0.00015924739,0.000003424187,0.000013260086,0.000015664933,0.00001341434,0.000053488762,0.000007513904,0.000009708085,0.002253177,0.000009198859,0.9974608],"study_design_scores_gemma":[0.00024761845,0.00010956498,0.0003065543,0.000049547572,0.000013627448,0.00002749754,0.0000094554125,0.006306299,0.0010800017,0.98978215,0.001836952,0.00023073913],"about_ca_topic_score_codex":0.000008392471,"about_ca_topic_score_gemma":4.2502464e-7,"teacher_disagreement_score":0.99723005,"about_ca_system_score_codex":0.000027646183,"about_ca_system_score_gemma":0.000027525224,"threshold_uncertainty_score":0.8546756},"labels":[],"label_agreement":null},{"id":"W2741584520","doi":"10.1145/3129173.3129176","title":"2017 Kleene award","year":2017,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Constructive; Presentation (obstetrics); Completeness (order theory); Computer science; Kleene's recursion theorem; Kleene algebra; Calculus (dental); Mathematics; Programming language; Discrete mathematics; Algorithm; Medicine","score_opus":0.06795900448942767,"score_gpt":0.35323624604111287,"score_spread":0.2852772415516852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741584520","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047800895,0.0001761135,0.95411086,0.018550241,0.0024441166,0.00012970057,0.0000024747324,0.00019529942,0.01961108],"genre_scores_gemma":[0.048404854,0.00007240759,0.9472455,0.0012668855,0.00044522193,0.0000118401695,5.8777175e-7,0.000010159856,0.0025425581],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99893,0.00005927997,0.00014730846,0.00037387758,0.00018391803,0.0003056288],"domain_scores_gemma":[0.9965285,0.00014303239,0.00014509371,0.002997645,0.000038641916,0.00014710684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025447705,0.00012121578,0.00018812208,0.00002900246,0.00043526982,0.0004375071,0.004005498,0.000057985642,0.000021590991],"category_scores_gemma":[0.0008471555,0.00009613189,0.000081405495,0.000059765032,0.000079229976,0.00052385073,0.0013326238,0.00013059699,0.00037705136],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015962503,0.000027859653,0.002164273,0.0000027541046,0.000009023936,0.000047456022,0.000051491177,0.0000012781213,0.0019584463,0.00783674,0.011836857,0.97606224],"study_design_scores_gemma":[0.0008869726,0.00026470912,0.09783301,0.00003091528,0.0000135826285,0.000049403963,0.000017181797,0.006575669,0.0073832767,0.20548671,0.68074626,0.00071230764],"about_ca_topic_score_codex":0.00025396535,"about_ca_topic_score_gemma":0.000007675787,"teacher_disagreement_score":0.9753499,"about_ca_system_score_codex":0.000014036496,"about_ca_system_score_gemma":0.00003130892,"threshold_uncertainty_score":0.74432784},"labels":[],"label_agreement":null},{"id":"W2752065998","doi":"10.1049/iet-cdt.2016.0200","title":"High performance and energy efficient single‐precision and double‐precision merged floating‐point adder on FPGA","year":2017,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Adder; Field-programmable gate array; Double-precision floating-point format; Computer science; Single-precision floating-point format; Stratix; Computer hardware; Carry-save adder; Throughput; Efficient energy use; Parallel computing; Floating point; Embedded system; Algorithm; Engineering; Latency (audio); Electrical engineering","score_opus":0.01911748253702997,"score_gpt":0.26412505777196205,"score_spread":0.24500757523493208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752065998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1469363,0.00007099205,0.84904003,0.0005824798,0.00058269466,0.0001707146,0.00000572067,0.0004979545,0.0021131032],"genre_scores_gemma":[0.65442467,0.000050965144,0.34514713,0.00018000204,0.00010073343,0.000010384345,0.0000020870468,0.000016987937,0.00006701385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793386,0.000049414914,0.0003744699,0.0008116589,0.00044802533,0.00038258504],"domain_scores_gemma":[0.99821955,0.00023427719,0.00026258035,0.0009713036,0.000103900085,0.00020840477],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00038260894,0.00033530215,0.0003817149,0.00015780012,0.00052321353,0.001882938,0.0009895677,0.000117040974,0.0000018423605],"category_scores_gemma":[0.000068904235,0.00026925988,0.0000741751,0.0001405677,0.0001977817,0.0010749352,0.0013966722,0.00019171878,0.0000036936913],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040098887,0.00011552321,0.00004023297,0.000010043495,0.0000086028485,0.000012261878,0.00009033153,0.000043355307,0.00090091,0.0027634606,0.00054344774,0.9954317],"study_design_scores_gemma":[0.002752475,0.006553309,0.009919095,0.0016571111,0.000029241586,0.0002519612,0.00003297168,0.48095986,0.42309245,0.033713747,0.038450558,0.002587205],"about_ca_topic_score_codex":0.00004051102,"about_ca_topic_score_gemma":4.611081e-7,"teacher_disagreement_score":0.9928445,"about_ca_system_score_codex":0.00004570019,"about_ca_system_score_gemma":0.000015145678,"threshold_uncertainty_score":0.999976},"labels":[],"label_agreement":null},{"id":"W2752693332","doi":"10.1115/detc2017-67091","title":"Solutions of Interval Systems for Under-Constrained and Redundant Parallel Manipulators","year":2017,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Orthant; Jacobian matrix and determinant; Wrench; Solution set; Mathematics; Control theory (sociology); Actuator; Interval (graph theory); Parameterized complexity; Linear system; Context (archaeology); Mathematical optimization; Computer science; Set (abstract data type); Algorithm; Applied mathematics; Mathematical analysis; Engineering","score_opus":0.09412869442614291,"score_gpt":0.33452082577681524,"score_spread":0.24039213135067233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752693332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015805651,0.00013371014,0.9957635,0.00096458965,0.0004349484,0.00015748499,0.0000036062281,0.000032446744,0.0009291628],"genre_scores_gemma":[0.5326795,0.000010404331,0.46697518,0.000022755368,0.00003101289,0.000010533954,2.0748476e-7,0.000002866133,0.0002675203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937975,0.000026483585,0.00017212726,0.00018359677,0.00007481611,0.00016320538],"domain_scores_gemma":[0.9992865,0.00008885287,0.00011722221,0.00039365815,0.000043979046,0.000069807495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030178958,0.00006750843,0.0001643674,0.000026538324,0.00024040314,0.00017066156,0.0004315236,0.000029514573,0.0000017431792],"category_scores_gemma":[0.00005855242,0.000050807816,0.00005169994,0.000024913605,0.00012884011,0.00019942169,0.00020594097,0.00003444065,9.0500583e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028310728,0.000027020085,0.00008072756,0.000028350463,0.000020818185,8.987626e-7,0.000042780997,0.000038709717,0.00049398147,0.9441221,0.000120995035,0.05502079],"study_design_scores_gemma":[0.0007759278,0.0002899554,0.0057375384,0.00007054156,0.000014731675,0.00003491003,0.0001727332,0.897217,0.0002871634,0.09375894,0.0014074595,0.00023313738],"about_ca_topic_score_codex":0.00016161031,"about_ca_topic_score_gemma":0.000003637055,"teacher_disagreement_score":0.89717823,"about_ca_system_score_codex":0.000007135313,"about_ca_system_score_gemma":0.00002187066,"threshold_uncertainty_score":0.20718826},"labels":[],"label_agreement":null},{"id":"W2753204513","doi":"","title":"Software-Based Geometry Operations for 3D Computer Graphics","year":2008,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"CORDIC; Computer science; Floating point; Vector graphics; Fixed-point arithmetic; Software; Computation; Coprocessor; Fixed point; Parallel computing; Graphics; Vertex (graph theory); Rotation (mathematics); Computational science; Graphics hardware; Computer hardware; Computer graphics (images); Algorithm; Theoretical computer science; Field-programmable gate array; Graph; Artificial intelligence; Programming language; Mathematics","score_opus":0.039412128931581754,"score_gpt":0.28894626032397863,"score_spread":0.24953413139239689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753204513","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072626554,0.000023476648,0.99760544,0.0007719271,0.00040491647,0.00015890277,0.0000038270364,0.00024320767,0.00006202478],"genre_scores_gemma":[0.0022617043,0.000004346284,0.99352455,0.0038219767,0.00013136241,0.00003003802,0.0000033004364,0.0000071222257,0.00021560614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914354,0.00003807674,0.00015958039,0.00028398854,0.00015809534,0.00021674192],"domain_scores_gemma":[0.9991094,0.0003205675,0.000019372117,0.0003319594,0.00011782861,0.00010086013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017931724,0.00009766015,0.00013403386,0.00010509812,0.00028532333,0.0000733103,0.00042686082,0.00004274077,0.000019036157],"category_scores_gemma":[0.00005598435,0.00007676526,0.00009318872,0.00051594985,0.000053298336,0.00020135246,0.000076651515,0.00007230566,0.000017569648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006432738,0.0004568688,0.0015565313,0.00002754944,0.00003867301,0.000023828992,0.00016107748,0.004740841,0.00011359466,0.24819855,0.009279674,0.7353964],"study_design_scores_gemma":[0.00032224,0.00015807993,0.0012150019,0.0000032079836,0.0000022255867,0.000009766865,7.823251e-7,0.98249865,0.00048813515,0.001559531,0.013583759,0.00015864115],"about_ca_topic_score_codex":0.00002428333,"about_ca_topic_score_gemma":0.0000014929402,"teacher_disagreement_score":0.9777578,"about_ca_system_score_codex":0.000009943014,"about_ca_system_score_gemma":0.00006409312,"threshold_uncertainty_score":0.31303963},"labels":[],"label_agreement":null},{"id":"W2761962793","doi":"10.1109/tac.2017.2760106","title":"Invariance Control Synthesis for Switched Nonlinear Systems: An Interval Analysis Approach","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canada Research Chairs","keywords":"Nonlinear system; Mathematics; Partition (number theory); Control theory (sociology); Interval (graph theory); Invariant (physics); Computation; Interval arithmetic; Upper and lower bounds; Applied mathematics; Algorithm; Computer science; Control (management); Mathematical analysis; Artificial intelligence; Combinatorics","score_opus":0.03102403031255806,"score_gpt":0.29807022549944273,"score_spread":0.26704619518688466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761962793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010026761,0.000022249922,0.99580985,0.0008181368,0.00077140477,0.0010121011,0.00012786039,0.00033475697,0.000100979414],"genre_scores_gemma":[0.68713516,0.0000017494957,0.31178474,0.0001744929,0.00007748249,0.00073128135,6.7521006e-7,0.000017306364,0.00007710668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756914,0.000374029,0.000588912,0.0006745664,0.00035483766,0.0004385024],"domain_scores_gemma":[0.9961948,0.0011568828,0.00041680646,0.0018209257,0.00016210109,0.00024849363],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011609148,0.00030252567,0.00094340363,0.00026019593,0.0007522837,0.00088850386,0.001621295,0.00012766627,0.000020180762],"category_scores_gemma":[0.0001458025,0.00025167744,0.00052715366,0.00030814682,0.00009147767,0.0007131067,0.0000034645734,0.000168365,0.000019418152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014848431,0.0015780053,0.00004181675,0.00020557322,0.0037528744,0.000013617651,0.0004385254,0.072573274,0.0015714698,0.001820244,0.000021654616,0.91783446],"study_design_scores_gemma":[0.0019227663,0.00020348522,0.00039969923,0.000038051418,0.00090670737,0.0000067472643,0.00004241778,0.99546486,0.00044989018,0.00019475546,0.0000745543,0.0002960627],"about_ca_topic_score_codex":0.00016130846,"about_ca_topic_score_gemma":0.000015117456,"teacher_disagreement_score":0.9228916,"about_ca_system_score_codex":0.00007169793,"about_ca_system_score_gemma":0.00007459656,"threshold_uncertainty_score":0.99999356},"labels":[],"label_agreement":null},{"id":"W2786598203","doi":"10.1007/978-3-030-26831-2_16","title":"Root-Finding with Implicit Deflation","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Deflation; Root (linguistics); Computation; Polynomial; Subdivision; Mathematics; Applied mathematics; Computer science; Mathematical optimization; Algorithm; Mathematical analysis","score_opus":0.022283940828799538,"score_gpt":0.3024834169206719,"score_spread":0.28019947609187235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786598203","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016206732,0.00013005333,0.9794705,0.00096291135,0.0025315913,0.00045386943,0.0000018293905,0.00018231789,0.000060216455],"genre_scores_gemma":[0.4508146,0.0000028346205,0.54865736,0.00031951637,0.00018164612,0.000011411825,0.0000011941324,0.0000106204125,8.0249487e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959724,0.00013685742,0.00038952805,0.0018204047,0.0009087244,0.00077208],"domain_scores_gemma":[0.99714124,0.0005419701,0.00028946914,0.001675366,0.00018764725,0.00016428322],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011929948,0.00042680075,0.00051043165,0.00055966026,0.00019589033,0.0010620345,0.0036765584,0.00022157516,0.000003752245],"category_scores_gemma":[0.000112217225,0.00032595085,0.00009230656,0.0021777628,0.00024759572,0.00057627313,0.0034313751,0.0010452495,0.000022005734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028507652,0.000024995374,0.003447001,0.00003295982,0.0000051113193,0.000017713122,0.0003730329,0.33286217,0.000314886,0.00060561777,0.0000013918565,0.66231227],"study_design_scores_gemma":[0.00019181802,0.00014555715,0.011035501,0.0002468911,0.000004078364,0.000035195404,1.9537353e-7,0.9263389,0.0038330187,0.057640716,0.000033362194,0.0004947505],"about_ca_topic_score_codex":0.0000921751,"about_ca_topic_score_gemma":0.000022245338,"teacher_disagreement_score":0.66181755,"about_ca_system_score_codex":0.0002596411,"about_ca_system_score_gemma":0.00056742056,"threshold_uncertainty_score":0.99997497},"labels":[],"label_agreement":null},{"id":"W2787037985","doi":"10.1109/reconfig.2017.8279781","title":"Build fast, trade fast: FPGA-based high-frequency trading using high-level synthesis","year":2017,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Field-programmable gate array; Computer science; Latency (audio); High-frequency trading; Implementation; Low latency (capital markets); Embedded system; Software; ARM architecture; Time to market; High-level synthesis; Protocol stack; Scheduling (production processes); Computer architecture; Algorithmic trading; Operating system; Stack (abstract data type); Software engineering; Computer network; Telecommunications","score_opus":0.07441522438581342,"score_gpt":0.3109154474418738,"score_spread":0.2365002230560604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787037985","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01721726,0.000027335072,0.97535574,0.0045562913,0.000967855,0.00014679064,0.000016472477,0.0002367098,0.0014755467],"genre_scores_gemma":[0.45124176,0.0000017803152,0.54822904,0.00026148473,0.00016205267,0.0000091777565,3.287842e-7,0.000016740043,0.00007766386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758935,0.00017262423,0.00038596877,0.000750426,0.00045790957,0.0006437413],"domain_scores_gemma":[0.99745196,0.00042853568,0.0002687057,0.0015273867,0.000037891983,0.00028550992],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000551782,0.0003205357,0.00046469498,0.00013529016,0.00087344454,0.00078920875,0.002357443,0.000120844576,0.00011176141],"category_scores_gemma":[0.00027504753,0.00026313806,0.0001789359,0.0002332114,0.00015029374,0.000927895,0.00021841214,0.00023937249,0.000021897975],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004673049,0.00015483613,0.0003588918,0.000028217293,0.000040328756,0.000082418876,0.00007669207,0.00014666148,0.02971489,0.04852232,0.000108783104,0.9207613],"study_design_scores_gemma":[0.0010201114,0.00017288896,0.02317651,0.00022082792,0.00007126503,0.00004113847,0.000034888413,0.6824458,0.25450704,0.036463633,0.00049517426,0.0013506709],"about_ca_topic_score_codex":0.0011388399,"about_ca_topic_score_gemma":0.000008139736,"teacher_disagreement_score":0.91941065,"about_ca_system_score_codex":0.000092534756,"about_ca_system_score_gemma":0.00011198747,"threshold_uncertainty_score":0.99998206},"labels":[],"label_agreement":null},{"id":"W2889700844","doi":"10.5539/jmr.v10n5p76","title":"Solutions to Four-Letter Words in Mathematics","year":2018,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Logarithm; Homogeneous; Notation; Zero (linguistics); Homogeneous differential equation; Mathematical analysis; Algebra over a field; Calculus (dental); Pure mathematics; Differential equation; Combinatorics; Arithmetic","score_opus":0.25593417755247966,"score_gpt":0.4572076234385613,"score_spread":0.20127344588608165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889700844","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012882461,0.000036976086,0.97517747,0.008925448,0.00028883005,0.00015377978,5.9768087e-7,0.000011786031,0.0025226793],"genre_scores_gemma":[0.023114795,0.0000144016185,0.9756833,0.00022563843,0.00048233222,0.0000062574436,2.3420343e-8,0.000013399142,0.00045985082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970655,0.0002454072,0.0006826825,0.0001568828,0.0012722813,0.0005772871],"domain_scores_gemma":[0.9973068,0.001054572,0.00017133271,0.0005041957,0.0007071487,0.00025593795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007964893,0.0001053373,0.00031819713,0.0007074351,0.00014253777,0.0002203679,0.0014653102,0.00006043831,0.000058761452],"category_scores_gemma":[0.001598835,0.000076912045,0.00009335427,0.0014251459,0.00012452377,0.00028148008,0.000555557,0.00059216446,0.00023306918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004473044,0.00591534,0.00029506444,0.0006952891,0.0002182398,0.001105339,0.05624515,0.0002509083,0.034165844,0.4500012,0.11251538,0.3385475],"study_design_scores_gemma":[0.00072207395,0.0014198687,0.00043982698,0.00078629784,0.000008633695,0.00050033676,0.001082643,0.2051642,0.0040824097,0.76500005,0.020444822,0.00034886194],"about_ca_topic_score_codex":0.000005478588,"about_ca_topic_score_gemma":0.0000056608415,"teacher_disagreement_score":0.33819863,"about_ca_system_score_codex":0.00011828475,"about_ca_system_score_gemma":0.00013611712,"threshold_uncertainty_score":0.3136382},"labels":[],"label_agreement":null},{"id":"W2891906689","doi":"10.1109/arith.2018.8464818","title":"A Correctly Rounded Mixed-Radix Fused-Multiply-Add","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Rounding; Computer science; Arithmetic; Floating point; Radix (gastropod); Double-precision floating-point format; Parallel computing; Point (geometry); Algorithm; Mathematics; Operating system","score_opus":0.034019104119754964,"score_gpt":0.3016679507167429,"score_spread":0.26764884659698795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891906689","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012368808,0.00018646519,0.9717828,0.0007988594,0.009713916,0.00038259444,0.00001017422,0.00081589085,0.015072416],"genre_scores_gemma":[0.0105500985,0.00004566356,0.98376876,0.0008690477,0.00096095173,0.000072395094,0.000008453164,0.00003741985,0.0036872358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965114,0.00035233257,0.00052115077,0.0014103869,0.0005617295,0.00064299034],"domain_scores_gemma":[0.99678755,0.00036065216,0.00027496307,0.0020052316,0.00023186757,0.000339714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007544843,0.0005047945,0.0006555719,0.00016478558,0.0001596612,0.0007421801,0.003040772,0.00038182532,0.0002468258],"category_scores_gemma":[0.000212191,0.00040899275,0.00032842904,0.00041481922,0.00014254429,0.00024023146,0.003811157,0.0008006585,0.00066279684],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013602567,0.0002911037,0.00014456487,0.00007387027,0.00013114208,0.00006505026,0.0004437463,0.00006090234,0.0002820424,0.018181162,0.038439,0.9418738],"study_design_scores_gemma":[0.000935593,0.00047301117,0.0016479447,0.00023675463,0.00003505729,0.000069029375,0.000049631566,0.6446732,0.0065826597,0.20824677,0.13491364,0.0021366598],"about_ca_topic_score_codex":0.00035424804,"about_ca_topic_score_gemma":0.000026764457,"teacher_disagreement_score":0.93973714,"about_ca_system_score_codex":0.00012148143,"about_ca_system_score_gemma":0.00023538865,"threshold_uncertainty_score":0.9998362},"labels":[],"label_agreement":null},{"id":"W2912431218","doi":"10.1002/spe.2689","title":"Faster remainder by direct computation: Applications to compilers and software libraries","year":2019,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Remainder; Divisibility rule; Divisor (algebraic geometry); Multiplication (music); Mathematics; Integer (computer science); Arithmetic; Inverse; Greatest common divisor; Quotient; Multiple; Division (mathematics); Compiler; Subtraction; Discrete mathematics; Computer science; Combinatorics","score_opus":0.016278115832119504,"score_gpt":0.3049469259117814,"score_spread":0.2886688100796619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912431218","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047321743,0.00087184797,0.9906708,0.0024422428,0.0001680074,0.0003671313,0.0000065908052,0.00021612053,0.00052509806],"genre_scores_gemma":[0.03261565,0.00006919668,0.96197915,0.00482786,0.0000422518,0.0001282301,0.000003900023,0.000012998357,0.0003207442],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985994,0.000109067994,0.00019175826,0.0005990875,0.00024217839,0.00025849117],"domain_scores_gemma":[0.9980633,0.0011816918,0.000100085286,0.00033669945,0.00009274816,0.0002254341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019231885,0.0001617491,0.00020022568,0.000048791655,0.00024252535,0.000496841,0.00032348756,0.000053472046,0.000015898358],"category_scores_gemma":[0.00031797646,0.00014467789,0.00002283233,0.00040133175,0.00010644725,0.001981673,0.0003770775,0.00013587988,0.000055923512],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003795625,0.00013432781,0.006694104,0.000060335093,0.000031038497,0.000009692013,0.016421473,0.000048212685,0.00045382656,0.004610007,0.0031538308,0.9683452],"study_design_scores_gemma":[0.0007597438,0.0005484813,0.0034718954,0.00008937857,0.00002553693,0.00016328893,0.007222766,0.0038639999,0.0012615991,0.006716427,0.97473174,0.0011451581],"about_ca_topic_score_codex":0.000025139147,"about_ca_topic_score_gemma":3.585391e-7,"teacher_disagreement_score":0.9715779,"about_ca_system_score_codex":0.000013217361,"about_ca_system_score_gemma":0.000034310662,"threshold_uncertainty_score":0.5899793},"labels":[],"label_agreement":null},{"id":"W2913269411","doi":"10.1109/mwscas.2018.8623885","title":"Review of Arithmetic Operations Using the Continuous Valued Number System","year":2018,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Institute for International Education; Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Multiplication (music); Arithmetic; Computer science; Relation (database); Series (stratigraphy); Power (physics); Algorithm; Mathematics; Data mining","score_opus":0.04087906962084958,"score_gpt":0.346876304207155,"score_spread":0.3059972345863054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913269411","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028115718,0.0011290872,0.99226105,0.0005129346,0.00032199407,0.00017043966,6.4358096e-7,0.00004843833,0.0052742744],"genre_scores_gemma":[0.015224878,0.00009214796,0.9828313,0.0015137504,0.00010955347,0.0000062844615,1.1780415e-7,0.0000041223807,0.00021787443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991327,0.00021557913,0.00023782512,0.00015133964,0.00014330565,0.000119229524],"domain_scores_gemma":[0.99918455,0.00007182642,0.00005064169,0.00043699637,0.00021905704,0.00003694015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000646371,0.00006419001,0.00018173334,0.000011399612,0.00011994347,0.00005287357,0.00045282234,0.000016297681,0.00005520941],"category_scores_gemma":[0.000082218074,0.00003436112,0.000055944303,0.0003890427,0.00007848759,0.000106823965,0.00012698348,0.000046541198,0.000044015596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013282272,0.00010708395,0.0001311418,0.0015324332,0.00006392497,0.000005460704,0.0003501986,0.000020497564,0.0018445264,0.82703286,0.0025338274,0.16637671],"study_design_scores_gemma":[0.000187938,0.00010420661,0.000097751974,0.0033844088,0.000048566053,0.00015319066,0.00010827576,0.98057187,0.0041017686,0.0009926709,0.010021097,0.00022827466],"about_ca_topic_score_codex":0.000106439074,"about_ca_topic_score_gemma":9.695372e-7,"teacher_disagreement_score":0.98055136,"about_ca_system_score_codex":0.000014246062,"about_ca_system_score_gemma":0.000035573474,"threshold_uncertainty_score":0.14012058},"labels":[],"label_agreement":null},{"id":"W2914973130","doi":"10.1109/tc.2019.2895031","title":"Efficient Multiple-Precision Floating-Point Fused Multiply-Add with Mixed-Precision Support","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Double-precision floating-point format; Single-precision floating-point format; Accuracy and precision; Computer science; Multiplication (music); Floating point; Floating-point unit; Dot product; Algorithm; Mathematics; Statistics","score_opus":0.01378502794709515,"score_gpt":0.24885029591215002,"score_spread":0.23506526796505486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914973130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06665099,0.000008043329,0.9274907,0.00026939355,0.0043313405,0.00065464457,0.000013107454,0.00043230853,0.00014943464],"genre_scores_gemma":[0.52198523,0.000003006056,0.4775546,0.00026255313,0.000042465726,0.000015444162,0.0000013839448,0.000026977901,0.00010835744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966431,0.0002762485,0.00053328235,0.0010935062,0.00085139886,0.0006024667],"domain_scores_gemma":[0.99675924,0.0013712868,0.00017845184,0.0012041115,0.00016123969,0.00032564762],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058961863,0.00042641768,0.0004769541,0.0003419548,0.0002944301,0.00023139697,0.0010786691,0.00013089094,0.00009289229],"category_scores_gemma":[0.000014853151,0.0003345581,0.0002604279,0.000880371,0.00007394645,0.00027179474,0.000023358834,0.0004966351,0.0005157667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105357074,0.00043121976,0.000036738726,0.000012944566,0.000038366103,0.000023078659,0.00040943135,0.4098108,0.0024235179,0.000043461605,0.00017290574,0.5864922],"study_design_scores_gemma":[0.0022402178,0.0012346763,0.0003779868,0.0001561181,0.000015171054,0.00004426095,0.00004958332,0.97279304,0.021449007,0.0000629079,0.0010717872,0.00050525914],"about_ca_topic_score_codex":0.000046882436,"about_ca_topic_score_gemma":0.000008204964,"teacher_disagreement_score":0.5859869,"about_ca_system_score_codex":0.00013363779,"about_ca_system_score_gemma":0.00007912268,"threshold_uncertainty_score":0.99991065},"labels":[],"label_agreement":null},{"id":"W2915767988","doi":"10.2172/983320","title":"Solution to Monthly Problem 11277","year":2007,"lang":"en","type":"report","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Environmental science","score_opus":0.0620953541275931,"score_gpt":0.3581646799043258,"score_spread":0.29606932577673273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915767988","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.6248434e-7,0.00017218309,0.66837025,0.0006775068,0.0012498952,0.0002257005,0.0000025640957,0.00021430629,0.3290867],"genre_scores_gemma":[0.000030372034,0.00005019985,0.9649694,0.0005526204,0.00060713745,0.00002753188,0.0000047204026,0.000019214795,0.03373882],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99728256,0.000055820143,0.0004287758,0.00069359416,0.0010367164,0.00050251797],"domain_scores_gemma":[0.99839133,0.000089020104,0.0001506569,0.0006971687,0.0003873727,0.00028442958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001667343,0.00025107028,0.00038231045,0.0002227565,0.00008465358,0.00015912545,0.0009340054,0.00023309946,0.000048841186],"category_scores_gemma":[0.00013548961,0.00019615362,0.00014758714,0.00068593916,0.000018215707,0.00015394912,0.00050466805,0.00031858654,0.00025227523],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.2442006e-7,0.000035347966,0.000009168647,0.000028152861,0.000013704289,0.000029294682,0.00002600003,0.000014716008,0.000032722168,0.0026125151,0.06948107,0.9277165],"study_design_scores_gemma":[0.000050572504,0.000144666,0.0002452717,0.00006834754,0.000007748872,0.000024311577,0.0000020465397,0.0042221053,0.00034217353,0.0050019636,0.98950076,0.00039001793],"about_ca_topic_score_codex":0.0009407742,"about_ca_topic_score_gemma":0.000016361346,"teacher_disagreement_score":0.92732644,"about_ca_system_score_codex":0.00023874281,"about_ca_system_score_gemma":0.00046288833,"threshold_uncertainty_score":0.79989123},"labels":[],"label_agreement":null},{"id":"W2916027198","doi":"10.1109/isspit.2018.8642667","title":"Behavioral Implementation of SVD on FPGA","year":2018,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Field-programmable gate array; Computer science; Singular value decomposition; Coding (social sciences); Reconfigurable computing; Wireless; Software; Embedded system; Computer architecture; Hardware architecture; Gate array; Computer hardware; Computer engineering; Artificial intelligence","score_opus":0.05047965757708408,"score_gpt":0.41674507260046584,"score_spread":0.3662654150233818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916027198","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07022472,0.0000015166979,0.92650455,0.0002894013,0.00022446857,0.00004404493,7.7709234e-7,0.000034385648,0.00267614],"genre_scores_gemma":[0.47191006,3.7639143e-7,0.5277634,0.00017667517,0.000045116416,0.0000017841764,2.0114062e-7,0.0000014246986,0.00010091524],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995864,0.00002390549,0.00009060702,0.000109495435,0.0001063623,0.000083242725],"domain_scores_gemma":[0.999727,0.000017979472,0.00003095389,0.00015840099,0.0000373905,0.000028265373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010118606,0.000034225035,0.000051382784,0.000025293757,0.000024527171,0.00001565168,0.00018496969,0.000009896693,0.00017839011],"category_scores_gemma":[0.0000023513064,0.00002537426,0.000020278467,0.00013254191,0.000023528357,0.000090243324,0.00005208635,0.000019373858,0.00003775255],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.8523167e-7,0.000031407297,0.0003300418,5.488101e-7,0.0000010497643,3.9367305e-7,0.000105359,8.437773e-8,0.0019929959,0.025733294,0.00027922427,0.9715249],"study_design_scores_gemma":[0.0005426869,0.0030982904,0.041038215,0.000007636645,0.0000057082334,0.0000028643851,0.00021416892,0.0041136635,0.92347765,0.018965594,0.008320001,0.00021353208],"about_ca_topic_score_codex":0.000113834845,"about_ca_topic_score_gemma":0.0000069937455,"teacher_disagreement_score":0.9713114,"about_ca_system_score_codex":0.0000059890845,"about_ca_system_score_gemma":0.000009728105,"threshold_uncertainty_score":0.19532466},"labels":[],"label_agreement":null},{"id":"W2920380655","doi":"","title":"Hardware/software codesign for mathematical function acceleration.","year":2018,"lang":"en","type":"article","venue":"Conference of the Centre for Advanced Studies on Collaborative Research","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Acceleration; Hardware acceleration; Function (biology); Software; Embedded system; Computational science; Computer hardware; Computer architecture; Programming language; Physics","score_opus":0.22619401309447307,"score_gpt":0.4544651877290336,"score_spread":0.22827117463456054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920380655","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057163887,0.00020339296,0.9906838,0.005282494,0.0007200849,0.0020808787,0.0000893821,0.00004450343,0.0003238545],"genre_scores_gemma":[0.0957743,0.00011870278,0.89883435,0.00016731054,0.00027936226,0.000849354,0.000003684659,0.000025845593,0.0039470745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977966,0.00039177053,0.00033042792,0.00047827567,0.0005502853,0.00045262897],"domain_scores_gemma":[0.98791265,0.0031602709,0.00017495958,0.0005502649,0.008118764,0.00008306955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012922885,0.00017061036,0.00036252273,0.0000857727,0.0008500652,0.000119149845,0.0008586481,0.000053552765,0.000013114524],"category_scores_gemma":[0.007274757,0.0001074715,0.00009446834,0.00106603,0.00060344336,0.00028218006,0.0003253631,0.00015746316,0.000011754551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069153827,0.00029026734,0.000021458398,0.00025389128,0.00021823792,4.6460934e-7,0.003513383,0.00013405424,0.007867951,0.7709942,0.012345282,0.2036693],"study_design_scores_gemma":[0.0020219889,0.004027732,0.00007834101,0.00050135405,0.000026259566,5.4001964e-7,0.0058327094,0.026864048,0.22913119,0.68147814,0.04965876,0.0003789416],"about_ca_topic_score_codex":4.020895e-7,"about_ca_topic_score_gemma":0.0000071307,"teacher_disagreement_score":0.22126324,"about_ca_system_score_codex":0.00011848873,"about_ca_system_score_gemma":0.00030307428,"threshold_uncertainty_score":0.8709089},"labels":[],"label_agreement":null},{"id":"W2943147624","doi":"10.1109/iscas.2019.8702349","title":"Efficient Posit Multiply-Accumulate Unit Generator for Deep Learning Applications","year":2019,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Datapath; Computer science; Adder; Pipeline (software); Generator (circuit theory); IEEE floating point; Exponent; Multiplier (economics); Floating point; Code (set theory); Binary number; Parallel computing; Parameterized complexity; Arithmetic; Algorithm; Power (physics); Mathematics; Programming language","score_opus":0.021829614808894622,"score_gpt":0.3019435780608762,"score_spread":0.28011396325198157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943147624","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0098556345,0.000058223373,0.98800796,0.00022534578,0.0001671112,0.0005241838,9.614698e-7,0.00017666443,0.0009839345],"genre_scores_gemma":[0.09015156,0.00000178856,0.90761995,0.00027761445,0.000069192545,0.00010937949,0.0000021380126,0.000010330066,0.0017580607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990923,0.00004914276,0.00015140523,0.0003431804,0.00012156387,0.00024241969],"domain_scores_gemma":[0.9992123,0.00020643236,0.0000521309,0.00033902616,0.00008919954,0.0001009003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002238009,0.00009825555,0.00012766133,0.00004625554,0.00014699517,0.00011045265,0.0004468852,0.00003640349,0.000035038916],"category_scores_gemma":[0.000021385129,0.000079387144,0.00006738185,0.00030590998,0.000012219356,0.000056014032,0.00014876784,0.00008783809,0.00022525221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048375055,0.000118625765,0.000708002,0.000021190122,0.000020831754,7.103376e-7,0.00015591747,0.0787271,0.022843702,0.09636468,0.000020693082,0.8010137],"study_design_scores_gemma":[0.0002617896,0.000066993794,0.00036628539,0.0000024636183,0.0000027840838,0.0000015191254,0.000015560325,0.9606276,0.0029256076,0.00055354094,0.035040822,0.00013502566],"about_ca_topic_score_codex":0.000009585148,"about_ca_topic_score_gemma":3.5220737e-7,"teacher_disagreement_score":0.8819005,"about_ca_system_score_codex":0.000014869605,"about_ca_system_score_gemma":0.000015262549,"threshold_uncertainty_score":0.32373136},"labels":[],"label_agreement":null},{"id":"W2949609940","doi":"","title":"Alternative Implementations of Secure Real Numbers.","year":2016,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Implementation; Computer science; Computation; Floating point; Point (geometry); Arithmetic; Elementary function; Scheme (mathematics); Theoretical computer science; Algorithm; Mathematics; Programming language","score_opus":0.027726830641980345,"score_gpt":0.34933784493661135,"score_spread":0.321611014294631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949609940","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004940633,0.00003135522,0.9785776,0.0019865823,0.0014222914,0.00041535817,0.00025829172,0.00011223239,0.012255642],"genre_scores_gemma":[0.021583062,0.00017703968,0.97771335,0.00013050172,0.00022433668,0.00012256711,0.000023406981,0.000021072497,0.000004670488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969521,0.00064398034,0.00065724447,0.00095229584,0.00030162395,0.0004927547],"domain_scores_gemma":[0.99698454,0.0009225584,0.0006524492,0.001103678,0.00016220404,0.00017459392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037771318,0.00035242073,0.0006808234,0.00021720745,0.00009366367,0.000040697487,0.001871357,0.00018005304,0.00012002992],"category_scores_gemma":[0.00011678933,0.00028383645,0.0003051764,0.00014384519,0.00040164293,0.0001116822,0.003977123,0.00066505803,0.00006757081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001215703,0.00007166404,0.0015976628,0.000034441942,0.00018054924,0.000034223234,0.0022131342,0.000053346997,0.0007254954,0.94855696,0.00025376354,0.046266608],"study_design_scores_gemma":[0.0003626939,0.00009062744,0.0042137755,0.00008046531,0.000022665445,0.000019250067,0.00006068018,0.0037099654,0.0025909634,0.98774374,0.0008011927,0.00030400563],"about_ca_topic_score_codex":0.00036693245,"about_ca_topic_score_gemma":0.00003967246,"teacher_disagreement_score":0.045962602,"about_ca_system_score_codex":0.000065162436,"about_ca_system_score_gemma":0.00023129817,"threshold_uncertainty_score":0.9999614},"labels":[],"label_agreement":null},{"id":"W2952102246","doi":"10.1109/fccm.2019.00046","title":"Rethinking Integer Divider Design for FPGA-Based Soft-Processors","year":2019,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Field-programmable gate array; Latency (audio); Pipeline (software); Parallel computing; Integer (computer science); Division (mathematics); Bottleneck; Algorithm; Computer hardware; Embedded system; Arithmetic; Mathematics; Operating system; Telecommunications","score_opus":0.062301625625910594,"score_gpt":0.30375060704955054,"score_spread":0.24144898142363994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952102246","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030445927,0.00003228141,0.9958979,0.001839806,0.0005329674,0.00032085873,5.2166234e-7,0.00021808584,0.0008531572],"genre_scores_gemma":[0.057989936,5.5800336e-7,0.93796074,0.002625152,0.000050440478,0.00003391575,5.03336e-7,0.000012217959,0.0013265378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880564,0.00008379735,0.00017980744,0.0004082218,0.00021551184,0.00030699786],"domain_scores_gemma":[0.9984052,0.0009536762,0.000064992135,0.00038718435,0.00010630806,0.000082621424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008081459,0.0001288871,0.00018311571,0.000056313987,0.00007763814,0.00016105622,0.00070305145,0.00006136387,0.000080667276],"category_scores_gemma":[0.00019036417,0.00009284214,0.00009042124,0.00028297494,0.000021667462,0.00030679101,0.00010595159,0.00011443288,0.00009573254],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032801105,0.00012278375,0.0002625096,0.00010596627,0.000032074146,0.0000046169052,0.00076005794,0.003866947,0.0022429707,0.058886167,0.002406329,0.9312768],"study_design_scores_gemma":[0.0003805104,0.00018341308,0.000043473647,0.000028487644,0.000003856828,0.0000012675656,0.000011077712,0.8074308,0.019909272,0.1674662,0.004320638,0.00022100129],"about_ca_topic_score_codex":0.000010041654,"about_ca_topic_score_gemma":3.4472342e-7,"teacher_disagreement_score":0.9310558,"about_ca_system_score_codex":0.000022743596,"about_ca_system_score_gemma":0.00006980478,"threshold_uncertainty_score":0.37859926},"labels":[],"label_agreement":null},{"id":"W2953353697","doi":"10.48550/arxiv.1210.4960","title":"A new Truncated Fourier Transform algorithm","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fast Fourier transform; Algorithm; Fourier transform; Transformation (genetics); Computer science; Ring (chemistry); Arithmetic; Mathematics; Mathematical analysis","score_opus":0.07502044757962618,"score_gpt":0.2097360619565806,"score_spread":0.1347156143769544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953353697","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065450754,0.00017750365,0.9928303,0.00034996602,0.0015274838,0.000305325,0.000016319073,0.00039785533,0.003740758],"genre_scores_gemma":[0.06486353,0.00019165485,0.92668116,0.00020569231,0.0005091074,0.0000014787751,0.000014467922,0.000039967807,0.007492938],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976426,0.00017300644,0.00025134807,0.0011044324,0.00015610195,0.0006725592],"domain_scores_gemma":[0.997674,0.00011277611,0.00019328277,0.0012755874,0.000107098764,0.00063725386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003585065,0.00043852016,0.0005008425,0.00021247557,0.0001425879,0.00014961114,0.0021728107,0.00038775668,0.00014357935],"category_scores_gemma":[0.000018837105,0.00045008873,0.0003809138,0.00087664404,0.00007200108,0.00055927725,0.0011079108,0.00081312767,0.00018862294],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012886241,0.0001235642,0.00007876853,0.000035596986,0.00014562545,0.00021507523,0.00032700255,0.0017297934,0.000018418907,0.066588975,0.00074666395,0.92997766],"study_design_scores_gemma":[0.000755136,0.00007101648,0.00033422266,0.000060223145,0.00011895346,0.00001430128,0.000025802292,0.764747,0.00030936883,0.21481933,0.017850291,0.0008943219],"about_ca_topic_score_codex":0.00040623598,"about_ca_topic_score_gemma":0.000005350125,"teacher_disagreement_score":0.9290833,"about_ca_system_score_codex":0.0001734112,"about_ca_system_score_gemma":0.00031057134,"threshold_uncertainty_score":0.9997951},"labels":[],"label_agreement":null},{"id":"W2954615675","doi":"","title":"Variable Precision Floating-Point RISC-V Coprocessor Evaluation using Lightweight Software and Compiler Support","year":2019,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada)","funders":"","keywords":"Computer science; Compiler; Floating point; Coprocessor; Speedup; Parallel computing; Reduced instruction set computing; Variable (mathematics); Double-precision floating-point format; Instruction set; Single-precision floating-point format; Computational science; Programming language; Mathematics","score_opus":0.02770308438994855,"score_gpt":0.28145826803365837,"score_spread":0.2537551836437098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954615675","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008117616,0.0009257573,0.9797012,0.0016823952,0.000734324,0.00088848494,0.000038157123,0.00026621297,0.00764585],"genre_scores_gemma":[0.029106142,0.00017995996,0.9686798,0.00013928705,0.000046935842,0.000047630878,0.0001582514,0.00004621326,0.0015958205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99064964,0.0057499874,0.00077698036,0.0014358644,0.0009113029,0.00047619856],"domain_scores_gemma":[0.99078155,0.0021491637,0.0008522533,0.002554749,0.003404321,0.00025798177],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.012876569,0.0004489806,0.0006150204,0.00023054145,0.00045804103,0.001020532,0.0018596108,0.00036470112,0.00022412412],"category_scores_gemma":[0.0027168544,0.00043111164,0.00015338666,0.0006055488,0.00014299045,0.0005975486,0.0034888738,0.00074873725,0.000050233062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024824214,0.0011317201,0.00260565,0.0009637686,0.00020385862,0.000009680342,0.010492289,0.003483445,0.007251955,0.07049838,0.001840456,0.90149397],"study_design_scores_gemma":[0.00069100363,0.0000019883328,0.00096744444,0.0017934596,0.00008144541,0.000024122452,0.0000274866,0.91490227,0.020219622,0.0530582,0.007554856,0.00067809655],"about_ca_topic_score_codex":0.00043478148,"about_ca_topic_score_gemma":0.000023590927,"teacher_disagreement_score":0.91141886,"about_ca_system_score_codex":0.00018781409,"about_ca_system_score_gemma":0.00071174867,"threshold_uncertainty_score":0.9998141},"labels":[],"label_agreement":null},{"id":"W2962778453","doi":"10.3934/dcds.2015.35.4765","title":"Rigorous numerics for nonlinear operators with tridiagonal dominant linear parts","year":2016,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Agence Nationale de la Recherche","keywords":"Tridiagonal matrix; Operator (biology); Mathematics; Nonlinear system; Linear operators; Diagonal; Computation; Inverse; Applied mathematics; Linear map; Contraction (grammar); Pure mathematics; Mathematical analysis; Algebra over a field; Physics; Algorithm; Eigenvalues and eigenvectors; Quantum mechanics; Geometry","score_opus":0.020160505517053808,"score_gpt":0.2844780856119548,"score_spread":0.26431758009490103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962778453","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021043958,0.000032641503,0.99443734,0.0024941666,0.000355141,0.00025534752,0.000014431207,0.00010399926,0.00020252187],"genre_scores_gemma":[0.0059921914,0.00002005027,0.99183196,0.00059037184,0.00028074946,0.000059657894,9.656009e-7,0.000016754359,0.0012073106],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866027,0.000050305527,0.00022060354,0.00044636062,0.00022862734,0.00039384895],"domain_scores_gemma":[0.998834,0.0003663811,0.000065316985,0.00040528507,0.00013651936,0.00019246971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003415111,0.000171824,0.0002441526,0.000042502208,0.00011905143,0.000067772504,0.00052144466,0.00004733072,0.00003070548],"category_scores_gemma":[0.00009429985,0.00007907219,0.00007818339,0.00027814723,0.00006895129,0.00030792243,0.000107203974,0.000055082182,0.000052541385],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006109315,0.00018145653,0.0002720847,0.000009497637,0.000031267584,0.000027867181,0.00006772235,0.000017058239,0.0017761784,0.026201652,0.0007720865,0.970582],"study_design_scores_gemma":[0.0051802807,0.0027566503,0.0003106802,0.0000842843,0.000028652634,0.000106159365,0.0000340418,0.1705545,0.13667868,0.007552297,0.67553324,0.0011805021],"about_ca_topic_score_codex":0.000011750019,"about_ca_topic_score_gemma":0.0000016641902,"teacher_disagreement_score":0.96940154,"about_ca_system_score_codex":0.000023789396,"about_ca_system_score_gemma":0.00010155235,"threshold_uncertainty_score":0.32244703},"labels":[],"label_agreement":null},{"id":"W2963455733","doi":"10.5539/jmr.v11n3p60","title":"An Asymptotic Expansion for the Error Term in the Brent-McMillan Algorithm for Euler’s Constant","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bessel function; Term (time); Asymptotic expansion; Constant (computer programming); Euler's formula; Computation; Integer (computer science); Applied mathematics; Algorithm; Mathematical analysis; Combinatorics","score_opus":0.1310918809042816,"score_gpt":0.4442376703974151,"score_spread":0.3131457894931335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963455733","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014251079,0.00019796823,0.9813845,0.002720812,0.0003992967,0.0009437696,0.0000058492574,0.0000061798073,0.00009052514],"genre_scores_gemma":[0.070180625,0.00006408738,0.92925656,0.00012056969,0.00023932787,0.000049210485,4.012224e-7,0.000016954045,0.00007225286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974798,0.00038316517,0.00052859384,0.00017607021,0.001005993,0.00042637167],"domain_scores_gemma":[0.99157065,0.007014516,0.00023068018,0.0005971977,0.00049072073,0.00009624567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011107592,0.00010950165,0.00028704142,0.00018801315,0.0001877463,0.0003173419,0.0020239223,0.000053456457,0.00001275658],"category_scores_gemma":[0.00049028074,0.00005047503,0.00013286521,0.0003368322,0.00009289235,0.00020806432,0.00011973236,0.00043477997,0.000008696911],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037309394,0.00090032193,0.000092278315,0.0002712607,0.00006744303,0.000026506443,0.0068235258,0.00012161971,0.006215397,0.04092991,0.0011625936,0.9433518],"study_design_scores_gemma":[0.0010822426,0.0017111204,0.00042020425,0.00016066345,0.000012521723,0.00015645717,0.003497685,0.90088236,0.00054389826,0.08995791,0.0014529602,0.000121950055],"about_ca_topic_score_codex":0.0000037232296,"about_ca_topic_score_gemma":0.0000011229271,"teacher_disagreement_score":0.94322985,"about_ca_system_score_codex":0.00005469056,"about_ca_system_score_gemma":0.0001687391,"threshold_uncertainty_score":0.38496917},"labels":[],"label_agreement":null},{"id":"W2963813846","doi":"10.1093/imanum/dry024","title":"Optimal sampling rates for approximating analytic functions from pointwise samples","year":2018,"lang":"en","type":"article","venue":"IMA Journal of Numerical Analysis","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Air Force Office of Scientific Research; Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Rate of convergence; Polynomial; Applied mathematics; Bounded function; Combinatorics; Exponential polynomial; Minimax approximation algorithm; Equidistributed sequence; Discrete mathematics; Exponential function; Mathematical analysis","score_opus":0.055206926224184875,"score_gpt":0.3594723217996215,"score_spread":0.30426539557543664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963813846","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019511482,0.00022393759,0.9785122,0.001324974,0.0002800592,0.00006048412,0.000019393648,0.000032703392,0.00003476423],"genre_scores_gemma":[0.19293237,0.000007133353,0.8061183,0.00023664998,0.0006578009,0.0000040891255,0.000004218102,0.000010491229,0.000028933026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976885,0.00016807995,0.00095672545,0.00038486006,0.00042206785,0.00037979585],"domain_scores_gemma":[0.9965479,0.001347906,0.00077515584,0.00037369147,0.00066874776,0.00028660026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008816684,0.00020549288,0.0008103619,0.00044511602,0.00029514005,0.00031763758,0.0008084222,0.000057562953,0.000137213],"category_scores_gemma":[0.0008898684,0.00015231482,0.0009043621,0.0025534877,0.00011369075,0.0005199069,0.00014256706,0.00022234343,0.00001574082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002425564,0.00096252817,0.014420752,0.000032114083,0.011275731,0.000038188973,0.0015946716,0.030654458,0.0092894435,0.0021125625,0.0010830201,0.92829394],"study_design_scores_gemma":[0.00047818158,0.00052729854,0.004852526,0.000025217898,0.0014078427,0.000023049652,0.00030956217,0.97990376,0.00090497674,0.008876845,0.0023977638,0.00029296],"about_ca_topic_score_codex":0.000125515,"about_ca_topic_score_gemma":0.000002647232,"teacher_disagreement_score":0.9492493,"about_ca_system_score_codex":0.000059415986,"about_ca_system_score_gemma":0.000065876055,"threshold_uncertainty_score":0.6211218},"labels":[],"label_agreement":null},{"id":"W2974844866","doi":"10.2200/s00946ed1v01y201908mas029","title":"Fast Start Integral Calculus","year":2019,"lang":"en","type":"article","venue":"Synthesis lectures on mathematics and statistics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Division of Graduate Education; California Institute of Technology","keywords":"Fundamental theorem of calculus; Mathematics; Calculus (dental); Trigonometric integral; Differential calculus; Trigonometric substitution; Integration by parts; Trigonometric functions; Trigonometry; Algebra over a field; Pure mathematics; Mathematical analysis; Fundamental theorem","score_opus":0.012847277263968573,"score_gpt":0.2591135490813591,"score_spread":0.24626627181739053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974844866","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019394197,0.000052545452,0.99501485,0.00025999572,0.00020540423,0.00014530156,0.00005015577,0.000059755937,0.002272592],"genre_scores_gemma":[0.02782496,0.000028103615,0.9714943,0.0002834515,0.00003152916,0.000010995485,0.0000012068599,0.000016429478,0.00030900957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883854,0.00006088048,0.00023674282,0.00030365027,0.00029229457,0.00026787943],"domain_scores_gemma":[0.99788153,0.0014379559,0.00009305666,0.00041977403,0.000050258812,0.00011743037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026870493,0.00019084931,0.0003137634,0.00007113155,0.000085780455,0.00019132547,0.00035236712,0.000057417186,0.000088150395],"category_scores_gemma":[0.00041659756,0.00013399747,0.000044298817,0.00013484538,0.000049109796,0.000059517817,0.000101732745,0.00016606007,0.00009753177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034683678,0.000081300655,0.000018713292,0.000080191625,0.00002429658,0.000010378808,0.0003885622,0.00003228176,0.0003386955,0.58070946,0.0006052696,0.4177074],"study_design_scores_gemma":[0.00023374452,0.000388587,0.00038798442,0.00014150765,0.000029889537,0.000028274142,0.00014288398,0.60613537,0.0045560617,0.3828128,0.004598725,0.00054416875],"about_ca_topic_score_codex":0.000009180268,"about_ca_topic_score_gemma":0.000002100316,"teacher_disagreement_score":0.60610306,"about_ca_system_score_codex":0.000019703175,"about_ca_system_score_gemma":0.000025559842,"threshold_uncertainty_score":0.5464258},"labels":[],"label_agreement":null},{"id":"W2979049289","doi":"10.1007/978-3-030-41258-6_6","title":"Approximate GCD in Bernstein basis","year":2019,"lang":"en","type":"preprint","venue":"Communications in computer and information science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Bipartite graph; Bernstein polynomial; Mathematics; Root (linguistics); Matching (statistics); Degree (music); Basis (linear algebra); Combinatorics; Discrete mathematics; Applied mathematics; Statistics; Graph; Physics; Geometry","score_opus":0.04903440410928161,"score_gpt":0.3396691884607903,"score_spread":0.2906347843515087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979049289","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029309855,0.00023193475,0.98899686,0.002045272,0.0006215765,0.00045078015,0.0000065723166,0.00007336855,0.0046426374],"genre_scores_gemma":[0.18318501,0.0009391988,0.8150602,0.0007181752,0.000015728941,0.000060602728,0.000011532079,0.0000036212275,0.0000059299036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795574,0.00017827273,0.0007361865,0.0003911209,0.0004122522,0.00032640347],"domain_scores_gemma":[0.99620676,0.0002834603,0.00028216484,0.0029378114,0.00019469419,0.00009509262],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0023886245,0.00019663954,0.00031335995,0.0010531738,0.00018130314,0.0009842402,0.0056048157,0.00011587431,0.0000020218777],"category_scores_gemma":[0.000099415935,0.00018815309,0.00004407288,0.0017922055,0.00042612883,0.0054872464,0.010789721,0.0007005621,0.000026297112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001302057,0.00006294575,0.0021473074,0.00007490056,0.0000024580697,4.1168292e-7,0.0031750372,0.00459079,0.0000062632894,0.06206281,0.0000357829,0.92784],"study_design_scores_gemma":[0.00021341312,0.000020328045,0.011922644,0.00016036148,0.0000010087407,0.000004938484,0.000032476764,0.9757204,0.000031932792,0.008126286,0.0035375846,0.00022860087],"about_ca_topic_score_codex":0.00010188399,"about_ca_topic_score_gemma":0.000006112801,"teacher_disagreement_score":0.97112966,"about_ca_system_score_codex":0.00015342017,"about_ca_system_score_gemma":0.00031314293,"threshold_uncertainty_score":0.99977535},"labels":[],"label_agreement":null},{"id":"W2980033125","doi":"10.1109/ccece.2019.8861890","title":"Universal Functions Originator—Part II: Evaluation","year":2019,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science","score_opus":0.023250711673455333,"score_gpt":0.290864293816401,"score_spread":0.26761358214294567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980033125","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012432654,0.00001980329,0.9089411,0.0010187163,0.0024243786,0.00014499517,5.4090344e-7,0.00014223102,0.0748756],"genre_scores_gemma":[0.19119059,0.000005776528,0.7502997,0.0007206102,0.00031204787,0.000015702872,0.0000040168193,0.000010081021,0.057441458],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926484,0.00006972942,0.000073689094,0.00021439607,0.00025154706,0.00012578162],"domain_scores_gemma":[0.9994859,0.000047086793,0.000025109492,0.00029621756,0.0000897326,0.000055957826],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035855832,0.000054888955,0.00006637322,0.00004239752,0.000086099266,0.0000429952,0.00024027142,0.000023679093,0.001052225],"category_scores_gemma":[0.000018060211,0.000043824148,0.000033878376,0.00031892347,0.0000106623365,0.0003568716,0.00010901401,0.000057361194,0.00074749667],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001742504,0.00006409887,0.0005102355,0.0000020776204,0.000013402637,6.802396e-7,0.000081743994,0.00017080078,0.0005082251,0.42609876,0.008000655,0.56454754],"study_design_scores_gemma":[0.00038329454,0.00018164737,0.0010443858,0.000004407015,0.0000079357515,0.0000034184297,0.000046848676,0.43035758,0.0003363357,0.012990906,0.55448866,0.00015460044],"about_ca_topic_score_codex":0.00002050467,"about_ca_topic_score_gemma":6.2598474e-7,"teacher_disagreement_score":0.564393,"about_ca_system_score_codex":0.000042995423,"about_ca_system_score_gemma":0.00006215149,"threshold_uncertainty_score":0.99986094},"labels":[],"label_agreement":null},{"id":"W2986717322","doi":"10.1145/3371934.3371954","title":"Reflections on \"a control-theoretic approach to flow control\"","year":2019,"lang":"en","type":"article","venue":"ACM SIGCOMM Computer Communication Review","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Control (management); Flow control (data); Control flow; Flow (mathematics); Test (biology); Operations research; Industrial engineering; Telecommunications; Artificial intelligence; Programming language; Mathematics","score_opus":0.046613424821494144,"score_gpt":0.3527846151115188,"score_spread":0.30617119029002465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2986717322","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018788789,0.008524885,0.95552176,0.022427144,0.00035448628,0.001411608,0.000004852382,0.0002819105,0.011454562],"genre_scores_gemma":[0.019722428,0.004895829,0.9243549,0.050570633,0.000084093495,0.00022830121,0.0000119812275,0.0000260447,0.000105748935],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961934,0.0017939364,0.0006314418,0.0006207814,0.00038108137,0.0003793685],"domain_scores_gemma":[0.991513,0.001610373,0.00023807246,0.006183507,0.00021799798,0.00023703708],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016100582,0.00030931388,0.00074654823,0.0001303999,0.00024222319,0.00020156254,0.0053103967,0.000074950956,0.000045364624],"category_scores_gemma":[0.0002458696,0.00025571836,0.00024562344,0.0009674777,0.000057536832,0.0002739802,0.001018581,0.00047899407,0.001030428],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013570507,0.0004857289,0.000050605628,0.00038104662,0.000089555586,0.0000010841856,0.00018884153,0.0019422689,0.00004722983,0.336651,0.009665341,0.6504837],"study_design_scores_gemma":[0.002140677,0.00083631807,0.0010358647,0.0026301923,0.000087905115,0.000053280764,0.000007658336,0.46481064,0.000021345073,0.023019893,0.5043612,0.0009950196],"about_ca_topic_score_codex":0.000008900693,"about_ca_topic_score_gemma":4.7491983e-7,"teacher_disagreement_score":0.6494887,"about_ca_system_score_codex":0.000073960146,"about_ca_system_score_gemma":0.000042053056,"threshold_uncertainty_score":0.9999895},"labels":[],"label_agreement":null},{"id":"W2996677505","doi":"","title":"Sparse polynomial interpolation. Exploring fast heuristic algorithms over finite fields","year":2019,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences","funders":"","keywords":"Heuristic; Interpolation (computer graphics); Algorithm; Polynomial interpolation; Polynomial; Computer science; Finite field; Mathematical optimization; Mathematics; Linear interpolation; Discrete mathematics; Artificial intelligence; Mathematical analysis","score_opus":0.03631179572215997,"score_gpt":0.2608554636284519,"score_spread":0.22454366790629193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996677505","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046174196,0.00044771214,0.97448987,0.004137011,0.0020346437,0.00039079902,0.000042434927,0.00034874323,0.01349134],"genre_scores_gemma":[0.2866152,0.00032769074,0.70733243,0.00023831509,0.00015725424,0.00011462934,0.00010217101,0.000057287692,0.005055034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99337316,0.0035368772,0.0007166161,0.0012508009,0.00057952886,0.00054304214],"domain_scores_gemma":[0.99236023,0.0027598795,0.0005739298,0.0031031314,0.00092605036,0.00027680423],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034240435,0.00047374578,0.00056870404,0.0002807731,0.00028355996,0.0009806782,0.0028609047,0.00032236803,0.00014080205],"category_scores_gemma":[0.0013877294,0.00049085816,0.00033390013,0.00051714183,0.00014275097,0.00048526074,0.004014798,0.0011218431,0.00013274503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019414556,0.0007881528,0.0017391896,0.000284468,0.00019292596,0.000034727353,0.013288424,0.0016945641,0.0008938031,0.05075412,0.002925348,0.92738485],"study_design_scores_gemma":[0.00063848705,0.0000018575544,0.0029891045,0.0014707556,0.00003611082,0.000010655219,0.000057280853,0.9640307,0.0064452146,0.0079598045,0.015430547,0.000929475],"about_ca_topic_score_codex":0.00091992674,"about_ca_topic_score_gemma":0.00007848793,"teacher_disagreement_score":0.9623361,"about_ca_system_score_codex":0.00011832165,"about_ca_system_score_gemma":0.00027106825,"threshold_uncertainty_score":0.9997543},"labels":[],"label_agreement":null},{"id":"W2997405391","doi":"10.1016/j.cam.2019.112698","title":"Parameter range reduction from partial data in systems of differential algebraic equations","year":2019,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Reduction (mathematics); Range (aeronautics); Partial differential equation; Algebraic equation; Algebraic number; Applied mathematics; Parameter space; Interval (graph theory); Series (stratigraphy); Algorithm; Mathematical analysis; Nonlinear system; Statistics; Geometry","score_opus":0.04460851064823682,"score_gpt":0.29311661962750934,"score_spread":0.24850810897927253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997405391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27877086,0.000055341792,0.72074455,0.0000766174,0.00022208245,0.00008524023,0.0000092284745,0.0000037285147,0.00003235146],"genre_scores_gemma":[0.5810256,0.000004015258,0.41887987,0.0000067132537,0.00007128308,0.0000011022095,0.0000047669732,0.0000028049872,0.0000038267567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988655,0.000036989455,0.00055723725,0.00012684299,0.00033352585,0.00007991586],"domain_scores_gemma":[0.9985461,0.0007081149,0.0004477694,0.0001851125,0.00006820024,0.000044705765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034387744,0.00007618086,0.00029297077,0.00008649557,0.00001925016,0.000060433424,0.00033867394,0.000032844953,0.000009278815],"category_scores_gemma":[0.00004062875,0.00005792158,0.000031426727,0.00013972794,0.00002738812,0.00020947818,0.000119825716,0.00010774233,0.0000034180364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006897963,0.0011221009,0.0003430791,0.00033231737,0.00022020725,0.0000062167833,0.0028629738,0.05213021,0.008467646,0.84270364,0.000119939206,0.091622695],"study_design_scores_gemma":[0.0006752485,0.00005755583,0.0011895313,0.00008199182,0.000019233825,0.000020683923,0.00012843897,0.79604834,0.000206693,0.20146322,0.00002535446,0.00008369237],"about_ca_topic_score_codex":0.000006287548,"about_ca_topic_score_gemma":1.3298656e-7,"teacher_disagreement_score":0.7439181,"about_ca_system_score_codex":0.000009877715,"about_ca_system_score_gemma":0.00003661838,"threshold_uncertainty_score":0.23619735},"labels":[],"label_agreement":null},{"id":"W3004075224","doi":"","title":"HOUR(s and Hours) OF (Math +) CODE","year":2018,"lang":"ru","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Code (set theory); Programming language; Mathematics; Computer science; Set (abstract data type)","score_opus":0.03182749736907063,"score_gpt":0.3158943191478868,"score_spread":0.28406682177881615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004075224","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03658519,0.00038874405,0.95273185,0.0011553713,0.00080720306,0.00009320609,0.00000947927,0.000049933682,0.00817905],"genre_scores_gemma":[0.23970254,0.000096342555,0.7579275,0.00048398203,0.0003247862,0.0000012224727,1.4218551e-7,0.0000093835215,0.0014541139],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998751,0.00010404064,0.0002521363,0.00037707397,0.0002261853,0.0002896066],"domain_scores_gemma":[0.9989849,0.00016816522,0.00011614422,0.0004263465,0.00012950884,0.00017496126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046538742,0.000142805,0.00027973976,0.000052328214,0.0000847877,0.000098206096,0.00044326458,0.00007030766,0.00012217941],"category_scores_gemma":[0.00007345416,0.00010797752,0.00005323531,0.00033658053,0.00041052073,0.00018332733,0.00039050716,0.00010134569,0.00006809586],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071339487,0.000102111044,0.0010361777,0.000024173576,0.000023833096,0.000006220512,0.00067900785,3.0370077e-7,0.0015649546,0.082136154,0.00090420834,0.91351575],"study_design_scores_gemma":[0.0024835002,0.0065871673,0.06848882,0.0005090309,0.00012381536,0.00014818148,0.00054483116,0.68067765,0.088846266,0.07478287,0.07508218,0.0017256762],"about_ca_topic_score_codex":0.00011378924,"about_ca_topic_score_gemma":0.0000050829667,"teacher_disagreement_score":0.9117901,"about_ca_system_score_codex":0.0000075226017,"about_ca_system_score_gemma":0.00004605044,"threshold_uncertainty_score":0.44031954},"labels":[],"label_agreement":null},{"id":"W3011681010","doi":"10.1109/tcsii.2020.2980531","title":"Design of Power Efficient Posit Multiplier","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits & Systems II Express Briefs","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multiplier (economics); Arithmetic; Computer science; Speedup; Algorithm; Mathematics; Parallel computing","score_opus":0.037269546807745836,"score_gpt":0.2528530961319673,"score_spread":0.2155835493242215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011681010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010675401,0.0001817112,0.99571407,0.00029490227,0.0015003051,0.00063944573,0.00003078672,0.0002613556,0.0003099006],"genre_scores_gemma":[0.96128917,0.000007145283,0.038065303,0.00029780803,0.00006518542,0.00008382836,3.0652677e-7,0.000030842548,0.00016042055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730647,0.00038635274,0.0005880022,0.00068923546,0.0006225086,0.00040744425],"domain_scores_gemma":[0.99829566,0.00034418565,0.00019763738,0.0006812254,0.00015855729,0.0003227417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003426015,0.00028168393,0.00050187897,0.00011781077,0.00027569322,0.000110634406,0.00091678416,0.00012437152,0.000030101734],"category_scores_gemma":[0.000016006114,0.00025780764,0.0001807284,0.0006643911,0.000074887386,0.00021456243,0.000010480739,0.00029335346,0.00005240656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034491866,0.0007057157,0.0000022448435,0.00012841697,0.00014182513,0.000036725876,0.0067873457,0.66314125,0.25684476,0.0012570644,0.00031261597,0.07060752],"study_design_scores_gemma":[0.0016464846,0.0013043343,0.000053016538,0.00030487732,0.000056256362,0.000059024584,0.00021468173,0.77464235,0.215353,0.000051868104,0.005436994,0.00087709475],"about_ca_topic_score_codex":0.00006441893,"about_ca_topic_score_gemma":9.375843e-8,"teacher_disagreement_score":0.96022165,"about_ca_system_score_codex":0.000048111226,"about_ca_system_score_gemma":0.00008103356,"threshold_uncertainty_score":0.9999874},"labels":[],"label_agreement":null},{"id":"W3018597471","doi":"10.1002/cpe.6270","title":"High‐performance SIMD modular arithmetic for polynomial evaluation","year":2021,"lang":"en","type":"preprint","venue":"Concurrency and Computation Practice and Experience","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"SIMD; Computer science; Parallel computing; Polynomial; Modular design; Computation; Modular arithmetic; Matrix polynomial; Compiler; Arithmetic; Mathematics; Algorithm; Programming language","score_opus":0.05114997092760116,"score_gpt":0.37793689660265356,"score_spread":0.3267869256750524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018597471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17089416,0.0037084057,0.8220611,0.00081491796,0.0018545624,0.00052179466,0.0000056368076,0.00005668676,0.00008269764],"genre_scores_gemma":[0.6629412,0.00074804964,0.33550736,0.00035580515,0.00014260982,0.00025938833,0.000028851688,0.000008020696,0.000008719035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763656,0.0003328887,0.00042889387,0.00092825125,0.00041141882,0.00026196128],"domain_scores_gemma":[0.9977783,0.0007619643,0.00039231626,0.00032357563,0.0006071344,0.0001367001],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009344204,0.00027251954,0.00035695703,0.00008518305,0.00031982493,0.000778186,0.00033082155,0.00016112613,0.0000044494095],"category_scores_gemma":[0.00078497437,0.00027144706,0.00005489838,0.00021979884,0.00012296347,0.0014247074,0.00057872175,0.00034457294,0.000001311025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001708479,0.00007444562,0.00002364261,0.0001225266,0.000026583648,0.0000028123309,0.0040613525,0.0027253581,0.00017681193,0.0013040829,0.000047930793,0.99141735],"study_design_scores_gemma":[0.00061910163,0.00023326972,0.00070072943,0.00012908605,0.00007274297,0.000039478353,0.000786549,0.9909185,0.00073874777,0.0036022598,0.0017502517,0.0004092609],"about_ca_topic_score_codex":0.00005445719,"about_ca_topic_score_gemma":4.614547e-7,"teacher_disagreement_score":0.9910081,"about_ca_system_score_codex":0.000036740243,"about_ca_system_score_gemma":0.0002625035,"threshold_uncertainty_score":0.9999738},"labels":[],"label_agreement":null},{"id":"W30280942","doi":"10.1007/978-1-4614-7085-4_10","title":"Optimization of Real-Time Coding and Control Policies: Structural and Existence Results","year":2013,"lang":"en","type":"book-chapter","venue":"Systems & control","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Coding (social sciences); Computer science; Control (management); Chemistry; Mathematics; Artificial intelligence; Statistics","score_opus":0.01554463908515861,"score_gpt":0.24820345421000486,"score_spread":0.23265881512484626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30280942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005990608,0.0019763205,0.939604,0.00044346444,0.0006686752,0.0014909258,0.00024142757,0.00013941455,0.055375874],"genre_scores_gemma":[0.4061923,0.0018363346,0.36626235,0.0005863816,0.002204844,0.00019636973,0.000062121515,0.00025426547,0.22240505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978293,0.00015365046,0.0007844939,0.0005882359,0.00034742674,0.00029685016],"domain_scores_gemma":[0.9975665,0.00063419563,0.0008070346,0.0005286301,0.0002802121,0.00018342145],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005284297,0.00035679524,0.0010024665,0.00013963874,0.00011187613,0.00024989844,0.00038405423,0.00023978448,0.000009222297],"category_scores_gemma":[0.00011177363,0.00028541483,0.00008285156,0.00004961157,0.00017601807,0.000272174,0.00010533358,0.00018152493,0.000007672193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019259613,0.000015792592,0.00004358335,0.00074215047,0.0005619926,0.0000395022,0.0010342192,0.003471162,0.00556406,0.9331342,0.0004321056,0.05476864],"study_design_scores_gemma":[0.003343938,0.00034095565,0.00014295976,0.00067810796,0.00009396062,0.00008463298,0.000022117461,0.98771906,0.000010714726,0.004457817,0.0025306127,0.00057513756],"about_ca_topic_score_codex":0.0005532213,"about_ca_topic_score_gemma":8.0671794e-7,"teacher_disagreement_score":0.98424786,"about_ca_system_score_codex":0.000039913608,"about_ca_system_score_gemma":0.000048169928,"threshold_uncertainty_score":0.9999598},"labels":[],"label_agreement":null},{"id":"W30299302","doi":"10.1097/mat.0000000000000892","title":"Improved MDLNS Number System Addition and Subtraction by Use of the Novel Co- Transformation","year":2012,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Transformation (genetics); Computer science; Subtraction; Mathematics; Arithmetic; Chemistry","score_opus":0.027980252807517068,"score_gpt":0.2722321824950851,"score_spread":0.244251929687568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30299302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025182495,0.00000619025,0.97349757,0.0001671253,0.0002531598,0.00012272892,0.000018291683,0.000040036848,0.00071241456],"genre_scores_gemma":[0.8728775,0.0000034598402,0.1269204,0.000069105525,0.00003112513,0.000007616907,0.0000029540543,0.0000028634192,0.00008497288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999512,0.000049712802,0.00014035296,0.00007728958,0.000111606794,0.00010904412],"domain_scores_gemma":[0.9996327,0.000082476654,0.00007551234,0.00013348562,0.000030591505,0.0000452239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020022955,0.000053755582,0.0000713148,0.000010757468,0.000060506292,0.00004574253,0.00008772207,0.000034588447,0.000010078765],"category_scores_gemma":[0.000011790263,0.00003283549,0.000028924556,0.000116833115,0.000019672596,0.001215782,0.00001526851,0.00005324789,0.0000034817874],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001597096,0.00039786854,0.0016641126,0.00017089154,0.000038787686,8.44544e-8,0.0020445576,0.000006088519,0.41197956,0.1441514,0.0024493723,0.4370813],"study_design_scores_gemma":[0.0011484817,0.00012036789,0.032461878,0.00008754593,0.00004190531,0.00015300789,0.00053102686,0.5600124,0.36509484,0.00028906082,0.039582975,0.0004765418],"about_ca_topic_score_codex":0.00011444365,"about_ca_topic_score_gemma":8.304539e-7,"teacher_disagreement_score":0.847695,"about_ca_system_score_codex":0.000018845189,"about_ca_system_score_gemma":0.000005442688,"threshold_uncertainty_score":0.13389924},"labels":[],"label_agreement":null},{"id":"W3033979988","doi":"10.1016/j.parco.2020.102663","title":"AIR: Iterative refinement acceleration using arbitrary dynamic precision","year":2020,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Queen's University Belfast; European Commission","keywords":"Iterative refinement; Computer science; Algorithm; Granularity; Iterative method; Acceleration; Double-precision floating-point format; Arbitrary-precision arithmetic; Floating point","score_opus":0.058257262045882184,"score_gpt":0.32999513388837365,"score_spread":0.2717378718424915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033979988","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02138542,0.00016399054,0.97511226,0.0022046615,0.00026118508,0.00017845581,8.128262e-7,0.00020365666,0.00048954086],"genre_scores_gemma":[0.33927292,0.0000036582212,0.65921044,0.0013739439,0.000120142045,0.0000015485763,0.0000022249894,0.000007703953,0.0000074243017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983465,0.00021487586,0.00036429026,0.0005112402,0.00027924575,0.00028385263],"domain_scores_gemma":[0.9992176,0.00018827217,0.00015568454,0.00022880196,0.00006717674,0.00014246201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030744498,0.00017103885,0.00024159945,0.000046357807,0.00024961782,0.00019198292,0.00050711544,0.000042388165,0.00001106392],"category_scores_gemma":[0.00008916687,0.00015331543,0.000086533924,0.00044264254,0.000018700199,0.00037820387,0.00044075242,0.00021234331,0.00002727184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024567054,0.000104864856,0.00024241136,0.000043453674,0.00004643252,0.00004556455,0.0035521623,0.098179735,0.010822949,0.00868116,0.00019835099,0.8780584],"study_design_scores_gemma":[0.00024776068,0.000108390785,0.0007889515,0.000035726054,0.0000042985084,0.000006593259,0.00002442686,0.9953042,0.00043087662,0.0022247557,0.0006326674,0.00019133753],"about_ca_topic_score_codex":0.000009266889,"about_ca_topic_score_gemma":3.045621e-7,"teacher_disagreement_score":0.89712447,"about_ca_system_score_codex":0.00005145352,"about_ca_system_score_gemma":0.00004028184,"threshold_uncertainty_score":0.6252022},"labels":[],"label_agreement":null},{"id":"W3088805374","doi":"10.1080/00029890.2020.1793635","title":"l’Hôpital’s Rule for Multivariable Functions","year":2020,"lang":"en","type":"article","venue":"American Mathematical Monthly","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Multivariable calculus; Zero (linguistics); Indeterminate; Mathematics; Variable (mathematics); Calculus (dental); Variety (cybernetics); Quotient; Pure mathematics; Philosophy; Mathematical analysis; Medicine; Engineering; Statistics","score_opus":0.027600597603742012,"score_gpt":0.28299147808842745,"score_spread":0.25539088048468545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088805374","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024607926,0.000021378191,0.97400165,0.008609049,0.00009639574,0.00029231858,0.00001902382,0.00029443367,0.01641968],"genre_scores_gemma":[0.036716793,0.0000010486991,0.96028525,0.0024043103,0.00015577477,0.00013047847,0.0000025197817,0.000020654248,0.0002831703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861854,0.000059858583,0.00029345672,0.0004390186,0.00021027503,0.00037884334],"domain_scores_gemma":[0.99836767,0.0007228394,0.000113433365,0.00037115623,0.0000674588,0.00035743447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001746788,0.0001683217,0.0003787078,0.000028518512,0.0001251033,0.00010900681,0.0005849257,0.000029851784,0.000051076124],"category_scores_gemma":[0.0007431158,0.00013563962,0.00015252277,0.0005456821,0.0001441587,0.00021685049,0.0001766962,0.00012456138,0.00026787218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003140939,0.0004625299,0.000045532477,0.00010940738,0.000096276046,0.000013205458,0.0010886776,0.00021559282,0.0025806457,0.67861557,0.006388642,0.3103525],"study_design_scores_gemma":[0.00040454103,0.0006667938,0.00013322108,0.000016197066,0.000023785378,0.0000030900194,0.00024441082,0.65171295,0.0006568466,0.3155524,0.03022463,0.000361128],"about_ca_topic_score_codex":0.00001587497,"about_ca_topic_score_gemma":1.226455e-7,"teacher_disagreement_score":0.65149736,"about_ca_system_score_codex":0.000019549298,"about_ca_system_score_gemma":0.00003200821,"threshold_uncertainty_score":0.55312234},"labels":[],"label_agreement":null},{"id":"W3092128573","doi":"10.1007/s40435-020-00702-2","title":"A global optimization approach for sliding mode tuning and existence maps generation","year":2020,"lang":"en","type":"article","venue":"International Journal of Dynamics and Control","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Agencia Nacional de Promoción de la Investigación, el Desarrollo Tecnológico y la Innovación; Universidad Nacional de La Plata; Direction Générale de l’Armement; Consejo Nacional de Investigaciones Científicas y Técnicas","keywords":"Control theory (sociology); A priori and a posteriori; Sizing; Context (archaeology); Mode (computer interface); Nonlinear system; Global optimization; Interval (graph theory); Series (stratigraphy); Computer science; Sliding mode control; Power (physics); Mathematical optimization; Control (management); Mathematics; Artificial intelligence","score_opus":0.0236990048038738,"score_gpt":0.2865947986139553,"score_spread":0.2628957938100815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092128573","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011028149,0.0001444357,0.9945039,0.0038893844,0.00020057445,0.000062397616,0.000019713694,0.0000064493906,0.000070300346],"genre_scores_gemma":[0.42901668,0.000032287262,0.5703331,0.00042669513,0.00018178455,0.0000016633976,0.0000038101316,0.0000018893608,0.0000020683476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999396,0.000031057032,0.0002092283,0.00012082018,0.00017299443,0.000069870366],"domain_scores_gemma":[0.99941134,0.000047591242,0.00017930704,0.000031820367,0.00024831548,0.000081620776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017830123,0.000060957187,0.000120190554,0.00002825503,0.00004482692,0.00021410586,0.00022699083,0.000023751492,3.3089523e-7],"category_scores_gemma":[0.00009345291,0.00005184196,0.000039484243,0.00005270026,0.000011958286,0.00030917753,0.000044002718,0.00004953963,2.0796197e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013611256,0.000054487766,0.0011797323,0.000014693397,0.00016870775,0.000019305482,0.00023720386,0.28761148,0.0019142189,0.38350135,0.000017713108,0.32514498],"study_design_scores_gemma":[0.00080501294,0.00012211173,0.000055869266,0.000007648468,0.0000098650025,0.000074043404,0.000024606834,0.99578786,0.000007511275,0.003023361,0.000026794358,0.000055312586],"about_ca_topic_score_codex":0.0000037762159,"about_ca_topic_score_gemma":3.540877e-7,"teacher_disagreement_score":0.7081764,"about_ca_system_score_codex":0.00003603719,"about_ca_system_score_gemma":0.000023794686,"threshold_uncertainty_score":0.21140537},"labels":[],"label_agreement":null},{"id":"W3106655363","doi":"10.1016/j.jcin.2020.10.043","title":"When Something Can Be Worse Than Failing","year":2020,"lang":"en","type":"letter","venue":"JACC: Cardiovascular Interventions","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"London Health Sciences Centre; Western University","funders":"","keywords":"Psychology","score_opus":0.07610198946987051,"score_gpt":0.30331776423431195,"score_spread":0.22721577476444144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106655363","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000042485003,0.003430545,0.63949746,0.3536189,0.0021426359,0.00032747025,0.000047576574,0.00039617292,0.0005349929],"genre_scores_gemma":[0.00019875202,0.00011807141,0.6940984,0.29578888,0.0064811315,0.00024618054,0.0001832318,0.000161491,0.0027238692],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9939243,0.0014144059,0.0009084889,0.0015430447,0.0013592264,0.00085049786],"domain_scores_gemma":[0.99641335,0.00030262733,0.00031055187,0.0024967697,0.00022028605,0.0002563993],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0013068535,0.0006419901,0.001424803,0.00041910022,0.00039205942,0.00093087426,0.002851455,0.00055049924,0.00011779567],"category_scores_gemma":[0.00046541527,0.00062275917,0.009782587,0.00083872955,0.000111339024,0.0004754355,0.0014203681,0.0032953282,0.00014960454],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017398467,0.00007243971,0.000014468811,0.00088921975,0.0063113025,0.0028765283,0.0009895875,0.00016410096,0.000017550068,0.0006059655,0.737629,0.25042808],"study_design_scores_gemma":[0.00033409218,0.000084836,0.000018990559,0.0006795609,0.0006711663,0.0001098876,0.00004822539,0.0017800342,0.00012678168,0.0077890367,0.98751837,0.0008390133],"about_ca_topic_score_codex":0.00052017526,"about_ca_topic_score_gemma":0.00001381313,"teacher_disagreement_score":0.24988937,"about_ca_system_score_codex":0.00019128545,"about_ca_system_score_gemma":0.00012949822,"threshold_uncertainty_score":0.99962234},"labels":[],"label_agreement":null},{"id":"W3114299204","doi":"10.1016/j.heliyon.2021.e07442","title":"Integer division by constants: optimal bounds","year":2021,"lang":"en","type":"preprint","venue":"Heliyon","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Remainder; Quotient; Divisor (algebraic geometry); Division (mathematics); Integer (computer science); Mathematics; Combinatorics; Constant (computer programming); Discrete mathematics; Computation; Arithmetic; Computer science; Algorithm","score_opus":0.019943574410049132,"score_gpt":0.2998659197484796,"score_spread":0.27992234533843047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114299204","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004290576,0.009103355,0.9810647,0.00083348545,0.0027007603,0.00014314703,0.000026256825,0.00020032398,0.0016374002],"genre_scores_gemma":[0.023425156,0.002132198,0.9722037,0.0009871616,0.00020101115,0.00004111598,0.000046499386,0.000033797613,0.0009293907],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99756014,0.0002515552,0.00037352633,0.00095360726,0.00046242657,0.00039874908],"domain_scores_gemma":[0.99829364,0.00015812994,0.00016954455,0.0010348756,0.00015393492,0.00018988074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004208255,0.00031391412,0.0004650174,0.00007636529,0.000107578635,0.0008438222,0.0011984356,0.00028244557,0.00011886405],"category_scores_gemma":[0.00013215585,0.00027651511,0.00019785883,0.0002769875,0.00008690398,0.00022210766,0.0031331608,0.00083446794,0.000055593613],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009294781,0.0004383135,0.00022106135,0.00067261583,0.00012023919,0.0002683685,0.00092450855,0.00028280084,0.00647033,0.005592729,0.0047668503,0.9802329],"study_design_scores_gemma":[0.0029274372,0.0012795356,0.0022721249,0.0140499575,0.0001590763,0.00022283927,0.00085134123,0.36642233,0.080354296,0.022191018,0.5013585,0.007911539],"about_ca_topic_score_codex":0.000026137384,"about_ca_topic_score_gemma":6.7652053e-7,"teacher_disagreement_score":0.97232133,"about_ca_system_score_codex":0.00008325225,"about_ca_system_score_gemma":0.00017485341,"threshold_uncertainty_score":0.9999687},"labels":[],"label_agreement":null},{"id":"W3116903618","doi":"10.12697/acutm.2011.15.04","title":"Polynomial expansions via embedded Pascal’s triangles","year":2011,"lang":"en","type":"article","venue":"Acta et Commentationes Universitatis Tartuensis de Mathematica","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Monomial; Mathematics; Pascal (unit); Symbolic computation; Binomial coefficient; Combinatorics; Extension (predicate logic); Computation; Polynomial; Row; Algebra over a field; Pure mathematics; Algorithm; Mathematical analysis; Computer science","score_opus":0.0452933026454616,"score_gpt":0.28123519166350475,"score_spread":0.23594188901804314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116903618","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012598601,0.000015745118,0.973151,0.0078042434,0.00019681914,0.00024833655,0.000010280859,0.00020690558,0.0057680323],"genre_scores_gemma":[0.2351317,0.000015900701,0.7629277,0.0017392443,0.000018407043,0.000010030699,0.0000063835846,0.000014474724,0.00013614674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984374,0.000375456,0.00030109443,0.00031732026,0.00024452727,0.00032418637],"domain_scores_gemma":[0.9982172,0.0008179341,0.0001782125,0.00049956294,0.000082895574,0.00020417427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035354684,0.00020033831,0.00028816276,0.00018378865,0.00024039893,0.00008923742,0.0005447196,0.00006497759,0.00031028464],"category_scores_gemma":[0.00009498713,0.00019029585,0.00013015528,0.00036414483,0.00008513122,0.0007733707,0.00024791792,0.00013544988,0.00009034616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018202898,0.0027454153,0.00044249406,0.00017916765,0.00085513585,0.00055303244,0.23850651,0.000019496641,0.029556913,0.3530004,0.11522698,0.2587324],"study_design_scores_gemma":[0.0155904675,0.002966614,0.024682866,0.00057991035,0.0010929834,0.0010052364,0.07663362,0.21055646,0.068446875,0.55591327,0.0367931,0.005738614],"about_ca_topic_score_codex":0.00007497983,"about_ca_topic_score_gemma":0.0000097053035,"teacher_disagreement_score":0.2529938,"about_ca_system_score_codex":0.00007883255,"about_ca_system_score_gemma":0.00005482535,"threshold_uncertainty_score":0.7760039},"labels":[],"label_agreement":null},{"id":"W3124418772","doi":"10.1109/itc44778.2020.9325274","title":"A Unified Method of Designing Signature Analyzers for Digital and Mixed-Signal Circuits Testing","year":2020,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Ryerson University","keywords":"Computer science; Aliasing; Signature (topology); Digital signature; Cryptography; Simple (philosophy); Computer hardware; Computer engineering; Coding (social sciences); Electronic circuit; Algorithm; Theoretical computer science; Mathematics; Engineering; Electrical engineering; Artificial intelligence","score_opus":0.06128384308820082,"score_gpt":0.3006648045891169,"score_spread":0.23938096150091606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124418772","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043793724,0.000051439765,0.99817663,0.00048350013,0.00003891068,0.00014565345,0.0000060769244,0.00008682101,0.0005730482],"genre_scores_gemma":[0.17757864,4.460899e-7,0.82205725,0.00029257903,0.000041370484,0.0000043876094,5.7712464e-7,0.000006514385,0.000018228826],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902505,0.000071284216,0.00020814681,0.0003493706,0.00014531905,0.00020081658],"domain_scores_gemma":[0.9982403,0.001278472,0.000096199496,0.00011329051,0.00010733064,0.00016440032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003454696,0.00011417591,0.00023662618,0.00004310621,0.00006160044,0.00013587167,0.0003224326,0.00004847428,0.0000034919556],"category_scores_gemma":[0.00057100155,0.000091746246,0.000059487727,0.0006206505,0.000030441182,0.00031380195,0.00013191397,0.00010266257,5.3676877e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003553494,0.000012006817,0.00013512465,0.00003163999,0.000020060588,0.0000030709352,0.00017732117,0.00010637325,0.05187848,0.0055003213,0.00007159508,0.9420605],"study_design_scores_gemma":[0.00044252657,0.00060003006,0.00023675067,0.00003289567,0.000020136164,0.00001109518,0.00015402657,0.872841,0.10705808,0.01791937,0.00039174125,0.00029237664],"about_ca_topic_score_codex":0.0000045360734,"about_ca_topic_score_gemma":5.5654372e-8,"teacher_disagreement_score":0.94176805,"about_ca_system_score_codex":0.000005443746,"about_ca_system_score_gemma":0.00003875503,"threshold_uncertainty_score":0.37413034},"labels":[],"label_agreement":null},{"id":"W3125503078","doi":"10.1002/spe.2984","title":"Number parsing at a gigabyte per second","year":2021,"lang":"en","type":"preprint","venue":"Software Practice and Experience","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"","keywords":"Decimal; Computer science; Parsing; Arithmetic; IEEE floating point; Bottleneck; Floating point; Binary number; Software; Algorithm; Mathematics; Operating system; Programming language; Embedded system","score_opus":0.027065916225519984,"score_gpt":0.33769450273096907,"score_spread":0.3106285865054491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125503078","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081821926,0.0033458287,0.90923184,0.0017355718,0.0019306572,0.00020798834,0.0000068504237,0.00028133456,0.0014379952],"genre_scores_gemma":[0.03397092,0.0005362203,0.96172285,0.0026554193,0.00018987754,0.000104092556,0.000006322322,0.000026224487,0.0007881031],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969973,0.00035690918,0.00036749718,0.0013093788,0.00047417113,0.00049475266],"domain_scores_gemma":[0.99706346,0.0009981372,0.00033209161,0.001077013,0.00024236448,0.00028695166],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004725374,0.00036761313,0.00044506785,0.000041231095,0.0003837274,0.0011140598,0.0008245425,0.00025271816,0.00043105707],"category_scores_gemma":[0.0013077515,0.00034760532,0.00013176935,0.0002361694,0.00016674654,0.0016778096,0.004166326,0.00079696387,0.00007082751],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006744628,0.00043895046,0.0032364102,0.0004572364,0.00019267503,0.0012575326,0.11605034,0.000039865106,0.0016209888,0.0017435105,0.001394605,0.87350047],"study_design_scores_gemma":[0.0011563844,0.00026970197,0.0040590903,0.0011254176,0.00019388083,0.0047094617,0.017491415,0.010341036,0.011130452,0.015358781,0.92946607,0.0046982868],"about_ca_topic_score_codex":0.00012490882,"about_ca_topic_score_gemma":0.000005747528,"teacher_disagreement_score":0.9280715,"about_ca_system_score_codex":0.00009625652,"about_ca_system_score_gemma":0.0001899072,"threshold_uncertainty_score":0.9999229},"labels":[],"label_agreement":null},{"id":"W3133741379","doi":"10.1109/synasc51798.2020.00018","title":"Approximate GCD in Lagrange bases","year":2020,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monomial; Basis (linear algebra); Eigenvalues and eigenvectors; Polynomial; Lagrange polynomial; Matrix (chemical analysis); Computation; Polynomial matrix; Gröbner basis; Applied mathematics; Difference polynomials; Combinatorics; Algebra over a field; Discrete mathematics; Orthogonal polynomials; Algorithm; Pure mathematics; Matrix polynomial; Mathematical analysis","score_opus":0.04444588995579091,"score_gpt":0.27106900194536193,"score_spread":0.22662311198957102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133741379","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007690846,0.00003881407,0.98256904,0.008799599,0.000061771934,0.00005000416,4.2436992e-7,0.000121964236,0.007589326],"genre_scores_gemma":[0.036539447,0.0000071051763,0.9579102,0.0054022614,0.000049229155,0.0000056360536,1.9433104e-7,0.000003166644,0.00008280274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994457,0.000044455053,0.00009096594,0.00019382821,0.00008941563,0.00013565223],"domain_scores_gemma":[0.9997087,0.00005967129,0.000013923132,0.00012386986,0.000008359313,0.00008545028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010085904,0.000052320895,0.000091166046,0.000018480408,0.000015007546,0.000045598023,0.00033204062,0.0000143957905,0.000048950267],"category_scores_gemma":[0.000042961135,0.000038711787,0.000024087929,0.0003861734,0.000010242745,0.00015786373,0.00012687634,0.00005857661,0.00006140931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031074314,0.00006120951,0.00096208835,0.000018236198,0.0000029296561,0.000053068845,0.000449708,0.000018103483,0.0013966796,0.102555424,0.0010847393,0.8933947],"study_design_scores_gemma":[0.00047418894,0.000153606,0.002845799,0.000010334182,0.000001481544,0.000003816115,0.000056639965,0.93484473,0.006872763,0.015095413,0.03935064,0.00029059013],"about_ca_topic_score_codex":0.000035026438,"about_ca_topic_score_gemma":0.0000013142312,"teacher_disagreement_score":0.9348266,"about_ca_system_score_codex":0.000004113858,"about_ca_system_score_gemma":0.000007858268,"threshold_uncertainty_score":0.1578621},"labels":[],"label_agreement":null},{"id":"W3137311011","doi":"10.48550/arxiv.2103.13949","title":"Approximate GCD in Lagrange bases","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Basis (linear algebra); Eigenvalues and eigenvectors; Monomial; Polynomial; Lagrange polynomial; Matrix (chemical analysis); Computation; Polynomial matrix; Applied mathematics; Gröbner basis; Combinatorics; Algebra over a field; Discrete mathematics; Pure mathematics; Matrix polynomial; Algorithm; Mathematical analysis","score_opus":0.09662659302102211,"score_gpt":0.208398435864334,"score_spread":0.11177184284331187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137311011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08164719,0.00015206242,0.9149807,0.00015271988,0.0005932372,0.00016511927,0.000006832825,0.00015794352,0.0021441989],"genre_scores_gemma":[0.8583951,0.00030608667,0.14029254,0.0002298832,0.00007339745,0.0000017506468,0.000010075831,0.000016891387,0.0006742645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979371,0.0003036361,0.0001840429,0.0011169927,0.000087969,0.00037029167],"domain_scores_gemma":[0.99844396,0.00015731594,0.00013571087,0.001030638,0.000081260216,0.00015108634],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003139303,0.00026090932,0.0003982715,0.00021302252,0.00006447377,0.00016916035,0.0014537255,0.00019745097,0.000042401174],"category_scores_gemma":[0.000053188487,0.00028671548,0.00019496116,0.00095741346,0.00006631932,0.00032338535,0.0022434648,0.00057383155,0.000023675631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007663008,0.0019352254,0.021750044,0.0010066744,0.00032437532,0.018446736,0.0020143925,0.14358883,0.0005821713,0.6392421,0.00050535606,0.17052744],"study_design_scores_gemma":[0.0005423766,0.000043541382,0.0031496526,0.0002158211,0.0000290322,0.000007999014,0.00015939964,0.9360833,0.00039434087,0.057635676,0.001016168,0.0007226772],"about_ca_topic_score_codex":0.00037868452,"about_ca_topic_score_gemma":0.00004371219,"teacher_disagreement_score":0.7924945,"about_ca_system_score_codex":0.000115726405,"about_ca_system_score_gemma":0.00013066233,"threshold_uncertainty_score":0.9999585},"labels":[],"label_agreement":null},{"id":"W3137786380","doi":"10.1049/cdt2.12019","title":"Fast and low‐power leading‐one detectors for energy‐efficient logarithmic computing","year":2021,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Logarithm; Multiplexer; Computation; Multiplier (economics); Binary number; Detector; Algorithm; Multiplication (music); Computer science; Scaling; Arithmetic; Mathematics; Parallel computing; Multiplexing; Combinatorics; Mathematical analysis","score_opus":0.012124931183356386,"score_gpt":0.25848350127571584,"score_spread":0.24635857009235945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137786380","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057047787,0.00017671916,0.9914827,0.0003962214,0.00042438332,0.00021161578,0.000014692508,0.0008717596,0.0007171448],"genre_scores_gemma":[0.33090517,0.000008740915,0.66838676,0.00048304562,0.00010541005,0.000017290642,0.000006097147,0.000023965522,0.00006352541],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979681,0.000058447335,0.00038014396,0.00080415147,0.00027476385,0.00051440817],"domain_scores_gemma":[0.9985899,0.00040918734,0.0001355699,0.00046900165,0.00019971807,0.00019667034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002285974,0.0002950298,0.00042374464,0.00013843537,0.00018520793,0.0009807812,0.0006140355,0.0001074094,0.0000016609491],"category_scores_gemma":[0.00006914593,0.00029117952,0.00016885548,0.00047628462,0.00013226166,0.00040358852,0.00084507366,0.0001603178,0.0000027872622],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050833,0.0001718258,0.00003094306,0.000029967861,0.000031176067,0.000037105554,0.00013637434,0.00007548567,0.002310186,0.013238449,0.0005023694,0.98343104],"study_design_scores_gemma":[0.0007898489,0.0011103404,0.0003633781,0.00057537435,0.000021619922,0.00037050858,0.000065342174,0.69950044,0.23948169,0.030092156,0.026031727,0.0015975756],"about_ca_topic_score_codex":0.0000058084374,"about_ca_topic_score_gemma":4.3229397e-7,"teacher_disagreement_score":0.98183346,"about_ca_system_score_codex":0.00006195539,"about_ca_system_score_gemma":0.00005546239,"threshold_uncertainty_score":0.99995404},"labels":[],"label_agreement":null},{"id":"W3145632036","doi":"10.1109/iccad.2010.5654270","title":"Analysis of precision for scaling the intermediate variables in fixed-point arithmetic circuits","year":2010,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Robustness (evolution); Polynomial; Scaling; Fixed-point arithmetic; Algorithm; Computation; Mathematics; Fixed point; Set (abstract data type); Computer science; Electronic circuit; Floating point; Arithmetic","score_opus":0.018511695251513815,"score_gpt":0.30015418394928134,"score_spread":0.28164248869776753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3145632036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036601577,0.000014066121,0.96220934,0.00033402152,0.0003718877,0.00015091011,0.0000027437948,0.000021394046,0.00029406563],"genre_scores_gemma":[0.57033443,0.0000034624625,0.42946893,0.0001049833,0.000027444315,0.00001833843,7.0189816e-7,0.000003122773,0.000038602022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899244,0.00008136343,0.0003170334,0.00026311312,0.00016243562,0.00018359566],"domain_scores_gemma":[0.9979521,0.0013762919,0.00009526352,0.00045167725,0.00007750225,0.00004718023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015353282,0.000080220496,0.00025037376,0.00022764187,0.00004295965,0.00006905444,0.00073245243,0.000046250996,0.000027380127],"category_scores_gemma":[0.00043383765,0.000046484132,0.00013708051,0.0013014468,0.00004783793,0.00013922114,0.00017626178,0.00014125631,0.0000014530094],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025721351,0.00008089641,0.0019767259,0.000008967127,0.000079787016,8.4473527e-7,0.00040865803,0.00052580895,0.006968834,0.021471865,0.000016504267,0.96845853],"study_design_scores_gemma":[0.00017172411,0.000043025913,0.023600344,0.0000117840145,0.00005410812,8.223398e-7,0.000032242406,0.94424176,0.0051576947,0.026404573,0.00019272135,0.00008921685],"about_ca_topic_score_codex":0.0000801653,"about_ca_topic_score_gemma":0.000036538022,"teacher_disagreement_score":0.9683693,"about_ca_system_score_codex":0.000007775283,"about_ca_system_score_gemma":0.000021909613,"threshold_uncertainty_score":0.18955679},"labels":[],"label_agreement":null},{"id":"W3151060349","doi":"10.5206/mt.v3i1.14661","title":"How to hunt wild constants","year":2023,"lang":"en","type":"preprint","venue":"Maple Transactions","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Limit (mathematics); Computer science; Float (project management); Calculator; Inverse trigonometric functions; Software; Symbolic computation; Conjecture; Constant (computer programming); Inverse; Computation; Series (stratigraphy); Point (geometry); Function (biology); Theoretical computer science; Discrete mathematics; Algorithm; Mathematics; Programming language; Mathematical analysis","score_opus":0.0668388024161281,"score_gpt":0.3085335090658384,"score_spread":0.24169470664971027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151060349","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006357528,0.00004038048,0.9665947,0.028121285,0.003543559,0.000362425,0.00013650791,0.0007235807,0.00041399815],"genre_scores_gemma":[0.022546569,0.00006343015,0.96731555,0.000581559,0.0001931555,0.00024872145,0.0000066102994,0.0000419425,0.009002436],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981301,0.0001076322,0.00022863787,0.0007759423,0.00035279116,0.00040492023],"domain_scores_gemma":[0.99839604,0.0001729615,0.00006832225,0.0009998191,0.00008062492,0.00028222645],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025772487,0.0002572338,0.0003465706,0.00021223068,0.00019240633,0.0005765414,0.0011161945,0.00016692765,0.000040302715],"category_scores_gemma":[0.000033141776,0.00025022976,0.00021852467,0.00062289805,0.000045368426,0.00014654704,0.00018099893,0.0006249188,0.00019556953],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007787334,0.00021135336,0.00002003349,0.00014018941,0.00019984234,0.00013416997,0.0011527058,0.005741691,0.0009595483,0.008542951,0.004423365,0.9784664],"study_design_scores_gemma":[0.001231943,0.0005223672,0.0031265523,0.0007329509,0.0002268781,0.00009144754,0.0006478547,0.17494646,0.010315372,0.19847995,0.60560423,0.004073994],"about_ca_topic_score_codex":0.00017681284,"about_ca_topic_score_gemma":0.0000469363,"teacher_disagreement_score":0.97439235,"about_ca_system_score_codex":0.0000731227,"about_ca_system_score_gemma":0.000118844175,"threshold_uncertainty_score":0.999995},"labels":[],"label_agreement":null},{"id":"W3157983286","doi":"10.18280/mmep.080207","title":"An Efficient VLSI Architecture Design of Antilogarithm Converter with 10-Regions Error Correction Scheme","year":2021,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Very-large-scale integration; Converters; Computer science; Digital signal processing; Compiler; Signal processing; MATLAB; Error detection and correction; Computer hardware; Computer engineering; Arithmetic; Electronic engineering; Embedded system; Algorithm; Mathematics; Voltage; Engineering; Electrical engineering","score_opus":0.03079870109555168,"score_gpt":0.23797992601217438,"score_spread":0.2071812249166227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157983286","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003085115,0.000073900825,0.9963605,0.000106042426,0.00008563832,0.00011886466,6.865612e-7,0.00013050083,0.00003875324],"genre_scores_gemma":[0.14513409,0.000005800851,0.85474706,0.000010408274,0.000016148088,0.000010205387,8.544957e-7,0.000014072448,0.000061358405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990359,0.000042116586,0.00021142383,0.00030591685,0.00017991541,0.00022471331],"domain_scores_gemma":[0.9992875,0.00017401126,0.000043604607,0.0002900739,0.00008104879,0.00012377287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024428972,0.0001513537,0.00025547837,0.000058744165,0.00005469372,0.000073272466,0.0001529282,0.00005917458,0.0000067032825],"category_scores_gemma":[0.000026366299,0.00011271209,0.00003495041,0.0002557559,0.000038822793,0.000072508854,0.00004537992,0.00016318476,0.0000022710876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003850686,0.00011215236,9.4474814e-7,0.00013449365,0.000016403428,0.000005746202,0.00044806174,0.9838696,0.0020935182,0.009712078,0.0000026176215,0.0036005313],"study_design_scores_gemma":[0.00016353598,0.00017549173,0.0000023976286,0.0002242008,0.000010690238,0.00007007222,0.000014712035,0.9910489,0.00244136,0.0056545744,0.000036666355,0.00015741306],"about_ca_topic_score_codex":0.000002710797,"about_ca_topic_score_gemma":5.2914622e-8,"teacher_disagreement_score":0.14204898,"about_ca_system_score_codex":0.000008828927,"about_ca_system_score_gemma":0.000023249713,"threshold_uncertainty_score":0.4596266},"labels":[],"label_agreement":null},{"id":"W3158271463","doi":"10.1109/iscas51556.2021.9401213","title":"Efficient Multiple-Precision Posit Multiplier","year":2021,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Multiplier (economics); Computer science; Computation; Architecture; Computer architecture; Parallel computing; Computer engineering; Algorithm","score_opus":0.017923194034822343,"score_gpt":0.27863330335093495,"score_spread":0.2607101093161126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158271463","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00944668,0.000112675596,0.98372024,0.0009273286,0.0005873866,0.00005993894,7.71929e-7,0.00014605383,0.0049989177],"genre_scores_gemma":[0.13344292,0.0000035479084,0.86456305,0.00056509086,0.000049540835,0.0000042978263,5.703021e-7,0.00000523201,0.0013657334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988263,0.000097478944,0.00016600805,0.00041318111,0.00026189673,0.00023511515],"domain_scores_gemma":[0.99883217,0.00037072273,0.000028622246,0.00053237606,0.00010535711,0.0001307712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020638239,0.00009797523,0.00013225415,0.000034159482,0.00009391354,0.0001247137,0.0004136548,0.000040404084,0.00009406479],"category_scores_gemma":[0.00022368177,0.0000740872,0.00008320162,0.0004363482,0.0000171406,0.000057983307,0.0004492828,0.00009459761,0.00021149573],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025823442,0.0001953034,0.00030829757,0.000003160998,0.00000841907,0.00007637909,0.00012034893,0.001259736,0.024135135,0.014689,0.0002973153,0.9589043],"study_design_scores_gemma":[0.00034362252,0.000028435783,0.0034876294,0.000009515584,0.0000019521322,0.000024317016,0.00001847312,0.9386462,0.047236092,0.0015760553,0.0084626805,0.0001650196],"about_ca_topic_score_codex":0.000011872547,"about_ca_topic_score_gemma":0.0000010589084,"teacher_disagreement_score":0.9587393,"about_ca_system_score_codex":0.000019701436,"about_ca_system_score_gemma":0.000030274075,"threshold_uncertainty_score":0.30211884},"labels":[],"label_agreement":null},{"id":"W3173842498","doi":"","title":"Low-Precision Training in Logarithmic Number System using Multiplicative Weight Update","year":2021,"lang":"en","type":"preprint","venue":"CaltechAUTHORS (California Institute of Technology)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Semtech (Canada)","funders":"Nvidia; California Institute of Technology","keywords":"Computer science; Madam; Multiplicative function; Algorithm; Quantization (signal processing); Overhead (engineering); Convolutional neural network; Computer engineering; Artificial intelligence; Mathematics","score_opus":0.03206347963469536,"score_gpt":0.30419752982388604,"score_spread":0.2721340501891907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173842498","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12585604,0.0004147104,0.86833525,0.00080162025,0.0026234728,0.0008484022,0.00012196992,0.00079514965,0.00020340913],"genre_scores_gemma":[0.3031985,0.00010547681,0.6963351,0.000042763466,0.000085700216,0.00014972474,0.00002865726,0.00004628345,0.00000780739],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945941,0.0002288445,0.0016468703,0.0020099303,0.0006009681,0.00091927376],"domain_scores_gemma":[0.99579346,0.000095695344,0.0010513697,0.0024223235,0.00040757554,0.00022955818],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0012709983,0.00078534585,0.0017944835,0.0012739177,0.00019500058,0.00015217574,0.0034819967,0.0018883287,0.000012780079],"category_scores_gemma":[0.0005914923,0.000757245,0.00040534852,0.0028273102,0.0006465281,0.00038810857,0.0052763983,0.0026576037,0.00005015633],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039483115,0.00046233585,0.00065474375,0.0013937298,0.00024300303,0.0011525733,0.00073930895,0.006868689,0.014743604,0.09363134,0.00003019598,0.880041],"study_design_scores_gemma":[0.001393431,0.00009044788,0.000088856184,0.007022177,0.00010577483,0.00043419295,0.0008560057,0.81998235,0.105362654,0.054120027,0.008538752,0.0020053582],"about_ca_topic_score_codex":0.0001269967,"about_ca_topic_score_gemma":0.000013748331,"teacher_disagreement_score":0.87803566,"about_ca_system_score_codex":0.0006380327,"about_ca_system_score_gemma":0.0007851218,"threshold_uncertainty_score":0.9996433},"labels":[],"label_agreement":null},{"id":"W3199119351","doi":"10.5206/mt.v3i1.14591","title":"Arbitrary-precision computation of the gamma function","year":2023,"lang":"en","type":"article","venue":"Maple Transactions","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Precomputation; Digamma function; Algebraic number; Function (biology); Computation; Computer science; Algorithm; Cover (algebra); Mathematics; Arbitrary-precision arithmetic; Gamma function; Incomplete gamma function; Riemann zeta function; Pure mathematics; Mathematical analysis","score_opus":0.02362472644781519,"score_gpt":0.2722187500334173,"score_spread":0.2485940235856021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199119351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00469136,0.00001520319,0.99210626,0.001475147,0.0010180839,0.00010551123,0.000004275146,0.00017507683,0.00040905594],"genre_scores_gemma":[0.8713752,0.000014828078,0.12777391,0.00013325509,0.000046039782,0.000019845183,0.0000019046233,0.000008984261,0.0006260425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922127,0.000096745425,0.0001649959,0.00016790506,0.00022344121,0.0001256253],"domain_scores_gemma":[0.9994814,0.00012956125,0.000050745002,0.00025953614,0.00004320414,0.000035565678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021562178,0.00006346758,0.00008699211,0.000078814955,0.00017023073,0.000029910736,0.00028933678,0.000033524826,0.000024217947],"category_scores_gemma":[0.000011937538,0.00004523601,0.00010620382,0.001258314,0.00003229396,0.00017982755,0.000017889468,0.00011142952,0.000046682806],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005827664,0.000055697645,0.000041071657,0.000012568781,0.000015453506,8.3910464e-7,0.00025275364,0.0072996262,0.0050695427,0.0040689553,0.0002938527,0.9828838],"study_design_scores_gemma":[0.00042799022,0.00015301938,0.04844997,0.00004187494,0.000027836793,0.000008330753,0.00009984507,0.8322173,0.010846941,0.095124915,0.012405236,0.00019674988],"about_ca_topic_score_codex":0.000030663625,"about_ca_topic_score_gemma":0.0000047744043,"teacher_disagreement_score":0.98268706,"about_ca_system_score_codex":0.000011910498,"about_ca_system_score_gemma":0.000021917287,"threshold_uncertainty_score":0.18446709},"labels":[],"label_agreement":null},{"id":"W3201173787","doi":"10.1016/j.rinam.2021.100185","title":"Polynomial degree reduction in the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e65\" altimg=\"si4.svg\"> <mml:msup> <mml:mrow> <mml:mi mathvariant=\"script\">L</mml:mi> </mml:mrow> <mml:mrow> <mml:mn>2</mml:mn> </mml:mrow> </mml:msup> </mml:math> -norm on a symmetric interval for the canonical basis","year":2021,"lang":"lv","type":"article","venue":"Results in Applied Mathematics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Scalable Vector Graphics; Degree (music); Reduction (mathematics); Mathematics; Polynomial; Discrete mathematics; Combinatorics; Computer science; Physics; Geometry; World Wide Web; Mathematical analysis","score_opus":0.03605556553535473,"score_gpt":0.2749079152879501,"score_spread":0.2388523497525954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201173787","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40369508,0.0019000473,0.08162354,0.007875019,0.00904673,0.0004762033,0.0012623828,0.00046259657,0.49365842],"genre_scores_gemma":[0.88850605,0.00094527524,0.1037648,0.0014744276,0.0023972718,0.0017161822,0.00043206575,0.00046465025,0.00029926441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99035853,0.0005337237,0.002555206,0.0019510015,0.0024224753,0.0021790457],"domain_scores_gemma":[0.9892213,0.005051331,0.0018727848,0.0030625588,0.0001602954,0.00063173025],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004295863,0.0009157696,0.0005573331,0.0005267024,0.0011584925,0.00175582,0.0032374358,0.0016206859,0.007614886],"category_scores_gemma":[0.0032828723,0.0011749713,0.0013126318,0.0024212284,0.0011146585,0.00072673155,0.0021669208,0.0021608642,0.00065299036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011482424,0.00088714604,7.985703e-7,0.001035883,0.0006187779,0.0007268809,0.004300046,0.0009642903,0.0011125503,0.91494477,0.04442294,0.029837681],"study_design_scores_gemma":[0.0027877854,0.0013377705,0.000048143862,0.0011969521,0.0008275446,0.0016343357,0.004303173,0.70738477,0.27244163,0.0007305978,0.0060599814,0.0012473272],"about_ca_topic_score_codex":0.00082290487,"about_ca_topic_score_gemma":0.0005121231,"teacher_disagreement_score":0.9142142,"about_ca_system_score_codex":0.00005530787,"about_ca_system_score_gemma":0.0015306665,"threshold_uncertainty_score":0.9996754},"labels":[],"label_agreement":null},{"id":"W3205213491","doi":"10.1007/978-3-031-30445-3_35","title":"A Cross-Platform Benchmark for Interval Computation Libraries","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Benchmark (surveying); Computation; Interval (graph theory); Interval arithmetic; Parallel computing; Theoretical computer science; Computational science; Algorithm; Mathematics; Cartography; Combinatorics","score_opus":0.04205215407942594,"score_gpt":0.31812423413195146,"score_spread":0.27607208005252554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205213491","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027319471,0.00014336099,0.9924298,0.00065550796,0.0044648997,0.0005720128,0.000020459272,0.000383125,0.0013035486],"genre_scores_gemma":[0.0024747474,0.00001589239,0.9947704,0.0009210529,0.0007014796,0.000030932788,0.000018846482,0.00005332892,0.0010133362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960721,0.000026121756,0.00067481067,0.0016175051,0.000823483,0.00078594976],"domain_scores_gemma":[0.99647915,0.0018634109,0.00033420132,0.0008184169,0.0002968605,0.00020798066],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012074454,0.00053842633,0.0006597641,0.0007146962,0.00039098662,0.0017194032,0.0029927122,0.00032504197,0.0000140503025],"category_scores_gemma":[0.0002638403,0.0004739849,0.0002535958,0.0008511299,0.00080921303,0.0012974868,0.0016563298,0.000627094,0.00004468748],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000084381145,0.000015627611,0.000018878067,0.000056947636,0.00001214114,0.000027559165,0.00035421245,0.00826095,0.000021590338,0.055639125,0.000037729274,0.9355468],"study_design_scores_gemma":[0.00019503331,0.00021382471,0.00012022802,0.00017165496,0.000003881702,0.000015472606,1.0556259e-7,0.50020367,0.00031204638,0.49708676,0.0012861147,0.00039120825],"about_ca_topic_score_codex":0.000013800302,"about_ca_topic_score_gemma":0.000009431996,"teacher_disagreement_score":0.9351556,"about_ca_system_score_codex":0.00016869254,"about_ca_system_score_gemma":0.0004302591,"threshold_uncertainty_score":0.9997712},"labels":[],"label_agreement":null},{"id":"W320568238","doi":"10.1007/s00224-005-1279-2","title":"Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"","keywords":"Semigroup; Mathematics; Monoid; Commutative property; Constraint satisfaction problem; Dichotomy; Polynomial; Domain (mathematical analysis); Finite set; Special classes of semigroups; Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.060242600002026164,"score_gpt":0.3048558017418451,"score_spread":0.24461320173981896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W320568238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104923174,0.00079866935,0.89256775,0.00006760694,0.00038517144,0.0003006355,0.0000071035156,0.000035275825,0.0009145884],"genre_scores_gemma":[0.9643104,0.0000032585508,0.035503935,0.000024606876,0.000122773,0.0000049390796,8.391546e-7,0.0000073450183,0.000021877973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967476,0.0014470357,0.0009206976,0.00021629478,0.00043455273,0.00023379865],"domain_scores_gemma":[0.9944921,0.004051833,0.0007046778,0.00059334177,0.00012429722,0.000033733493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004977131,0.00013984849,0.00053754187,0.00015206478,0.00007830915,0.00004876256,0.0010583455,0.000051252788,0.0000022263298],"category_scores_gemma":[0.00028444067,0.00010022784,0.000104482875,0.0005661423,0.00031371292,0.00015434981,0.00018079698,0.00015023517,0.0000019391384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007636389,0.00012747891,0.0007591903,0.00029491136,0.000031961106,0.0000010680461,0.0070300517,0.045053158,0.0014130693,0.9377664,0.000019168087,0.0074959416],"study_design_scores_gemma":[0.00031567883,0.00008354619,0.003764281,0.000645127,0.000010258943,0.000007646873,0.0009872048,0.98060924,0.0005112453,0.012816338,0.00011352628,0.00013590422],"about_ca_topic_score_codex":0.00031427402,"about_ca_topic_score_gemma":0.0000035064656,"teacher_disagreement_score":0.9355561,"about_ca_system_score_codex":0.000028809765,"about_ca_system_score_gemma":0.000035547208,"threshold_uncertainty_score":0.40871724},"labels":[],"label_agreement":null},{"id":"W3211272906","doi":"10.5281/zenodo.4458977","title":"JuliaData/Tables.jl: v1.3.1","year":2021,"lang":"en","type":"article","venue":"Edinburgh Research Explorer","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Invenia (Canada)","funders":"","keywords":"Computer science","score_opus":0.1905788622703148,"score_gpt":0.4234606503070905,"score_spread":0.2328817880367757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211272906","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022544356,0.0017541638,0.95841444,0.016695168,0.0027037761,0.0002755433,0.000012142986,0.00031520822,0.017575143],"genre_scores_gemma":[0.01837584,0.00071416167,0.95733756,0.0013116864,0.0028578623,0.0002530873,0.000026679592,0.000055955807,0.01906718],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955877,0.00052244903,0.0002905084,0.0008797255,0.0016234764,0.0010961555],"domain_scores_gemma":[0.9965188,0.000856415,0.000037826234,0.0013914034,0.000712757,0.00048278784],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0026170393,0.00017680212,0.00027438198,0.00020588815,0.00035487782,0.0005886233,0.001597533,0.00009383065,0.0014989104],"category_scores_gemma":[0.0014213879,0.00014967263,0.00011390382,0.002274105,0.0001748897,0.00095793675,0.0017730698,0.00078080554,0.00043499545],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011906248,0.00034813196,0.0001470329,0.000018874698,0.00005048523,0.0011742577,0.0011905414,0.000014797417,0.008724376,0.03586016,0.46303168,0.48942778],"study_design_scores_gemma":[0.000366216,0.00012338246,0.0001749581,0.00004508772,0.0000026486016,0.00003983353,0.00036796436,0.008191849,0.043357335,0.078436874,0.86858934,0.0003044941],"about_ca_topic_score_codex":0.000038247003,"about_ca_topic_score_gemma":0.000001368345,"teacher_disagreement_score":0.48912328,"about_ca_system_score_codex":0.00008964035,"about_ca_system_score_gemma":0.00036816884,"threshold_uncertainty_score":0.99941385},"labels":[],"label_agreement":null},{"id":"W3216435508","doi":"10.5206/mt.v1i1.14466","title":"An Interview with the Authors: Log-Lightning Computation, and Some Instructive Mathematical Errors","year":2021,"lang":"en","type":"article","venue":"Maple Transactions","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Maple; Computation; Zoom; Lightning (connector); George (robot); Function (biology); Computer science; Algorithm; Artificial intelligence; Physics","score_opus":0.028433252055116553,"score_gpt":0.2951867353316376,"score_spread":0.26675348327652104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216435508","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004482873,0.000088000364,0.9864111,0.008594144,0.000114809794,0.000084253414,0.0000028507961,0.00007908068,0.00014287651],"genre_scores_gemma":[0.22591022,0.000009917067,0.77348095,0.00043055948,0.000031413587,0.000021435537,0.0000013206405,0.000008519608,0.00010567883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901366,0.00025915366,0.00014155175,0.00027579517,0.00015332914,0.0001565217],"domain_scores_gemma":[0.99938416,0.00015598263,0.000038869166,0.000245679,0.000073962605,0.000101352336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002416523,0.00010434348,0.00015029358,0.000034454824,0.00028531955,0.00022096014,0.00021439699,0.00003218931,0.000044639026],"category_scores_gemma":[0.000007129623,0.00006606611,0.000039050494,0.00036987767,0.00010768801,0.0005740782,0.000016273398,0.00018937865,0.000008217685],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005371077,0.0002516926,0.000016246458,0.00006851982,0.00010560766,0.00004476087,0.007691487,0.0016994552,0.00078842667,0.09933618,0.000040644354,0.8899516],"study_design_scores_gemma":[0.0010220202,0.0005501336,0.0035842883,0.00019096369,0.00013847103,0.0008766684,0.0065365555,0.72744757,0.005285461,0.24741144,0.006226926,0.0007294708],"about_ca_topic_score_codex":0.0000068741574,"about_ca_topic_score_gemma":0.000008789094,"teacher_disagreement_score":0.88922215,"about_ca_system_score_codex":0.000014299058,"about_ca_system_score_gemma":0.000038866372,"threshold_uncertainty_score":0.26940978},"labels":[],"label_agreement":null},{"id":"W332188984","doi":"10.15215/aupress/9781927356388.01","title":"Open Data Structures: An Introduction","year":2013,"lang":"en","type":"book","venue":"Athabasca University Press eBooks","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Government of Alberta; Government of Canada; Athabasca University","keywords":"Computer science","score_opus":0.07474945680873323,"score_gpt":0.28570251096979693,"score_spread":0.2109530541610637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W332188984","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000060409307,0.000047728343,0.3040712,0.00023472487,0.0011095395,0.000721615,0.00018377136,0.000254689,0.6933707],"genre_scores_gemma":[0.000004084506,0.000016745695,0.25751558,0.000081807244,0.000658496,8.766953e-7,0.00016035589,0.00002350623,0.7415386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973156,0.00027771277,0.00019111989,0.0015091789,0.0003681942,0.0003381873],"domain_scores_gemma":[0.9951861,0.00008586214,0.00027650065,0.004041054,0.00014291577,0.00026756446],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00032357572,0.00034553165,0.00044464596,0.00012551015,0.0002718829,0.0007431874,0.014938648,0.00028172147,0.00005158311],"category_scores_gemma":[0.000025540287,0.00034991605,0.00007412734,0.000038923215,0.00013910815,0.0021957802,0.01478634,0.00054698903,0.000018501272],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009415471,0.000021477857,3.8952837e-7,0.000024621579,0.000075336095,0.000046914494,0.00013225434,0.000001928323,0.000011545215,0.6301943,0.147864,0.22161779],"study_design_scores_gemma":[0.00027458018,0.000101807964,0.00001900764,0.000020140082,0.000049579674,0.00001634962,0.000016734939,0.003373983,0.000045126344,0.010581834,0.9850566,0.00044430487],"about_ca_topic_score_codex":0.0012167688,"about_ca_topic_score_gemma":0.000015708038,"teacher_disagreement_score":0.83719254,"about_ca_system_score_codex":0.00015877117,"about_ca_system_score_gemma":0.0003467615,"threshold_uncertainty_score":0.9998953},"labels":[],"label_agreement":null},{"id":"W337437596","doi":"10.1007/978-3-642-57172-5_6","title":"ODE Software that Computes Guaranteed Bounds on the Solution","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ode; Ordinary differential equation; Solver; Computer science; Initial value problem; Software; Applied mathematics; Algorithm; Mathematics; Differential equation; Programming language; Mathematical analysis","score_opus":0.020822315806311033,"score_gpt":0.23976566695893486,"score_spread":0.21894335115262384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W337437596","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014015706,0.0003641051,0.9953458,0.0019270689,0.0003782916,0.00014961023,0.0000045680295,0.00011341822,0.0015770339],"genre_scores_gemma":[0.2144402,0.00007723259,0.7821426,0.0027692937,0.00034408612,0.000015355505,0.000008248224,0.000039397037,0.00016361213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980929,0.000015763651,0.00020724234,0.00055858784,0.0007811389,0.0003443502],"domain_scores_gemma":[0.99824053,0.0012804193,0.000070768205,0.00024803108,0.00007666255,0.0000835676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005743982,0.00028098948,0.00023925834,0.00027736506,0.0003027424,0.00034303835,0.0007659011,0.00011738663,0.000015422625],"category_scores_gemma":[0.00017715448,0.00020205481,0.000057904745,0.00033896262,0.0002470876,0.00020591341,0.00017838375,0.00048474644,0.000011269307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003224207,0.0000106401085,0.000012318984,0.000015938107,0.000010166228,0.000014054528,0.00019676289,0.4876934,0.000049511036,0.1515961,0.000021046291,0.36037683],"study_design_scores_gemma":[0.00008336751,0.0000521737,0.00044952476,0.00017974798,0.000003140556,0.000028013781,3.706819e-7,0.74449,0.000060384948,0.25130397,0.0030783436,0.00027090957],"about_ca_topic_score_codex":0.000011905778,"about_ca_topic_score_gemma":0.0000017482612,"teacher_disagreement_score":0.36010593,"about_ca_system_score_codex":0.00012258027,"about_ca_system_score_gemma":0.00012876772,"threshold_uncertainty_score":0.82395566},"labels":[],"label_agreement":null},{"id":"W38126735","doi":"10.7554/elife.86409","title":"Arithmetic with the two-dimensional logarithmic number system (2dlns)","year":2011,"lang":"en","type":"article","venue":"eLife","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Eunice Kennedy Shriver National Institute of Child Health and Human Development; National Institute of General Medical Sciences; National Institutes of Health","keywords":"Multiplication (music); Computer science; Operand; Arithmetic; Multiplication algorithm; Logarithm; Realization (probability); Digital signal processing; Parallel computing; Mathematics; Binary number; Computer hardware","score_opus":0.024372311536349018,"score_gpt":0.25356009853251144,"score_spread":0.2291877869961624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38126735","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015453964,0.0000838076,0.96716243,0.0008303823,0.00062543195,0.00022078618,0.0000020762088,0.00028324325,0.015337907],"genre_scores_gemma":[0.32365167,8.014587e-7,0.67477393,0.00088073337,0.00015993623,0.000021865624,3.927701e-7,0.000013542426,0.00049713417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985825,0.00017232359,0.00016072072,0.00034177533,0.0004401093,0.0003025824],"domain_scores_gemma":[0.99898976,0.00013900947,0.00008082933,0.0005604845,0.00010344267,0.00012648231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004953158,0.00014907643,0.00017612605,0.000027348045,0.00016062823,0.000072948336,0.0007401103,0.000034217952,0.000053686093],"category_scores_gemma":[0.00001690509,0.000079157886,0.000056246437,0.00034576902,0.00009808045,0.00016129468,0.00021493791,0.00018934882,0.00057130045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009599754,0.0006675127,0.0052983067,0.00009575231,0.00034043923,0.0011962331,0.0034792607,0.00044635637,0.0007895748,0.71153724,0.010587657,0.2654657],"study_design_scores_gemma":[0.00792928,0.0019783445,0.07391764,0.00071574195,0.0002804058,0.007829309,0.0012061121,0.7817468,0.030214652,0.017768428,0.07194189,0.0044713696],"about_ca_topic_score_codex":0.00014267756,"about_ca_topic_score_gemma":0.0000029318655,"teacher_disagreement_score":0.7813005,"about_ca_system_score_codex":0.000028396265,"about_ca_system_score_gemma":0.000055007207,"threshold_uncertainty_score":0.7343102},"labels":[],"label_agreement":null},{"id":"W4206215463","doi":"10.1145/3015306.3015312","title":"The basic polynomial algebra subprograms","year":2016,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Microsoft (Canada)","funders":"","keywords":"Computer science; Multiplication (music); Prime (order theory); Univariate; Polynomial; Division (mathematics); Rational function; Variety (cybernetics); Isolation (microbiology); Algebra over a field; Arithmetic; Rational number; Code (set theory); Theoretical computer science; Mathematics; Programming language; Discrete mathematics; Multivariate statistics; Pure mathematics; Set (abstract data type); Combinatorics","score_opus":0.04041744860613087,"score_gpt":0.316534470289144,"score_spread":0.2761170216830131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206215463","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004416202,0.0008664231,0.9372282,0.055653557,0.0008175234,0.00030238778,0.0000024895844,0.00029400695,0.00041918526],"genre_scores_gemma":[0.16391113,0.0005900814,0.8342094,0.0008710655,0.00018025952,0.00011434702,0.0000019840472,0.000019290434,0.000102446225],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975261,0.00068505976,0.00051759754,0.0004651244,0.00027120564,0.00053489156],"domain_scores_gemma":[0.9884316,0.003665658,0.00014725061,0.0075240666,0.00009870526,0.00013273227],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0010950037,0.00021638995,0.00023653568,0.00011507428,0.0005636033,0.0003873173,0.011588522,0.00008182437,0.0000078647845],"category_scores_gemma":[0.00024239991,0.00012567322,0.0001281654,0.0008883345,0.0004302052,0.0005092997,0.0055947336,0.000313922,0.00014980051],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024610572,0.000092392664,0.0008358193,0.0000011497681,0.000014916992,0.0000022009206,0.00012110023,9.127859e-7,0.00008100964,0.07213592,0.001172818,0.9255393],"study_design_scores_gemma":[0.00231399,0.00040402726,0.040246505,0.00020104599,0.00001719913,0.00008274687,0.00003583642,0.08185286,0.000811966,0.3857695,0.4870816,0.0011827544],"about_ca_topic_score_codex":0.00006035691,"about_ca_topic_score_gemma":0.000045498426,"teacher_disagreement_score":0.9243565,"about_ca_system_score_codex":0.00009433793,"about_ca_system_score_gemma":0.00008239007,"threshold_uncertainty_score":0.9937593},"labels":[],"label_agreement":null},{"id":"W4210720283","doi":"10.1145/3502492","title":"Quick-Div: Rethinking Integer Divider Design for FPGA-based Soft-processors","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Latency (audio); Field-programmable gate array; Division (mathematics); Integer (computer science); Radix (gastropod); Arithmetic; Parallel computing; Computer hardware; Mathematics; Operating system; Telecommunications","score_opus":0.05208566830806895,"score_gpt":0.28130916773205966,"score_spread":0.22922349942399073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210720283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062770606,0.0006876277,0.9902744,0.0058792797,0.0011405337,0.0006536142,0.00001940409,0.0006175193,0.00009987478],"genre_scores_gemma":[0.76716983,0.000021677848,0.22951302,0.00055342907,0.00002533099,0.0017692881,0.0000023580137,0.000029579713,0.0009155023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980778,0.000263477,0.00038321372,0.0006384729,0.00021399834,0.00042303276],"domain_scores_gemma":[0.99789804,0.0009795845,0.00015903734,0.0007898669,0.00009612682,0.00007731398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012493266,0.00021687611,0.00037313136,0.0005753329,0.0011908256,0.00011871388,0.0011237427,0.00019997908,0.000048791182],"category_scores_gemma":[0.00013668924,0.00019969707,0.00009543412,0.0010684708,0.00011367523,0.00019386683,0.000020731568,0.00064654194,0.0000071593536],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010446909,0.0003001781,0.000037560952,0.00018755837,0.00015941105,0.000022845978,0.0005211194,0.04074265,0.0014663219,0.021573983,0.00039336577,0.93449056],"study_design_scores_gemma":[0.0020359077,0.0023688404,0.000012704825,0.00018571834,0.000078866105,0.00029881744,0.0016478987,0.68528384,0.03035883,0.24333772,0.033369575,0.0010212768],"about_ca_topic_score_codex":0.00003751576,"about_ca_topic_score_gemma":0.0000019224192,"teacher_disagreement_score":0.93346924,"about_ca_system_score_codex":0.00008031899,"about_ca_system_score_gemma":0.000099354074,"threshold_uncertainty_score":0.9158988},"labels":[],"label_agreement":null},{"id":"W42139197","doi":"10.1007/978-0-387-68477-2_14","title":"Distributions with Bounded Support","year":2007,"lang":"en","type":"book-chapter","venue":"Springer series in statistics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Interval (graph theory); Bounded function; Scale (ratio); Distribution (mathematics); Mathematics; Statistics; Mathematical analysis; Combinatorics; Physics","score_opus":0.0346898154038766,"score_gpt":0.3012447235696555,"score_spread":0.26655490816577887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W42139197","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002266823,0.000057773144,0.8851104,0.00008266624,0.0003988224,0.0001431593,0.0002585029,0.000052638356,0.11389378],"genre_scores_gemma":[0.000074069976,0.00011413301,0.9388452,0.00007019118,0.00006602274,0.000009117096,0.000045273828,0.000030270188,0.060745694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832964,0.000018558347,0.00043075538,0.00047013673,0.00034058408,0.00041033843],"domain_scores_gemma":[0.9989272,0.00017540863,0.00015275046,0.0005489083,0.00008785861,0.00010786869],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030408625,0.00028935002,0.00040631913,0.00017775872,0.000058068126,0.000112213165,0.0005226639,0.00015600989,0.000111619054],"category_scores_gemma":[0.0000509382,0.00026663704,0.000033373723,0.00014782272,0.00024327393,0.00017438644,0.00025237037,0.0005203006,0.000037369613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010255361,0.000018405237,0.00011380435,0.000025892867,0.0000097722295,0.0006995409,0.000074089665,0.0000028383008,7.128206e-7,0.93293965,0.00015509254,0.065949954],"study_design_scores_gemma":[0.00033674279,0.0003284715,0.0018043182,0.00016002446,0.0000138273845,0.000059643648,0.000010671828,0.00044132568,0.000030409816,0.56468755,0.43143308,0.00069392164],"about_ca_topic_score_codex":0.00003762972,"about_ca_topic_score_gemma":0.0002913258,"teacher_disagreement_score":0.431278,"about_ca_system_score_codex":0.00016191421,"about_ca_system_score_gemma":0.00017580701,"threshold_uncertainty_score":0.9999786},"labels":[],"label_agreement":null},{"id":"W4214868813","doi":"10.1007/s00366-022-01612-x","title":"FPGA-orthopoly: a hardware implementation of orthogonal polynomials","year":2022,"lang":"en","type":"article","venue":"Engineering With Computers","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Field-programmable gate array; Orthogonal polynomials; Chebyshev polynomials; Jacobi polynomials; Computer science; Legendre polynomials; Laguerre polynomials; Gegenbauer polynomials; Orthogonal functions; Mathematics; Algorithm; Classical orthogonal polynomials; Computer hardware; Pure mathematics","score_opus":0.0075699329214089775,"score_gpt":0.24044164590683137,"score_spread":0.2328717129854224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214868813","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03532499,0.000056360634,0.9634003,0.0002455621,0.0006892364,0.00011996616,0.000010554365,0.00013589828,0.000017152066],"genre_scores_gemma":[0.4081849,0.0000010612131,0.5916118,0.000095662646,0.0000503949,0.000028598071,0.0000039758106,0.000011929229,0.000011690608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989338,0.000052222258,0.00021233772,0.0002537836,0.00032142326,0.00022641358],"domain_scores_gemma":[0.9994264,0.00011333346,0.00009564261,0.00025987925,0.00002793428,0.000076800745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024091428,0.00012272611,0.00018810359,0.00013498792,0.00008848876,0.00003527946,0.00046865185,0.000011084295,0.000031671552],"category_scores_gemma":[0.000005731255,0.00011563396,0.000058988593,0.00050038187,0.000013100314,0.00014856804,0.0003076195,0.00013145,0.0000010820859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021371769,0.00011592423,0.0035849384,0.00007239257,0.00018295232,0.00009424096,0.0015104593,0.2939804,0.0035313421,0.025055366,0.0009573947,0.6708932],"study_design_scores_gemma":[0.002776794,0.0020914394,0.057819016,0.00008148159,0.000037691945,0.00027095273,0.00033283763,0.8860439,0.014621155,0.00034655244,0.03430314,0.0012750569],"about_ca_topic_score_codex":0.000033841843,"about_ca_topic_score_gemma":5.6901376e-7,"teacher_disagreement_score":0.6696182,"about_ca_system_score_codex":0.000045948826,"about_ca_system_score_gemma":0.000058465343,"threshold_uncertainty_score":0.47154158},"labels":[],"label_agreement":null},{"id":"W4220896534","doi":"10.28924/2291-8639-20-2022-19","title":"Approximating the Mode of the Non-Central Chi-Squared Distribution","year":2022,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Centrality; Degrees of freedom (physics and chemistry); Probability density function; Mode (computer interface); Function (biology); Domain (mathematical analysis); Distribution (mathematics); Enhanced Data Rates for GSM Evolution; Applied mathematics; Mathematical analysis; Statistics; Computer science; Artificial intelligence; Physics","score_opus":0.007268214019607473,"score_gpt":0.28424877010868244,"score_spread":0.27698055608907496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220896534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015019067,0.00004248,0.98135805,0.0033251224,0.0000936901,0.000061855244,0.000035547833,0.0000025451213,0.00006162753],"genre_scores_gemma":[0.9724527,0.000017482222,0.027282065,0.00010782585,0.0000955117,0.000018577859,0.0000050609897,0.0000015963705,0.000019205216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998994,0.00008237978,0.00033956132,0.00008760294,0.00042720028,0.00006928108],"domain_scores_gemma":[0.9990295,0.00009184237,0.00049633416,0.00017382385,0.00017803044,0.000030449772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003181806,0.0000456369,0.000118140255,0.000060599003,0.00022477761,0.00006243544,0.0010025278,0.000008198204,0.000010485021],"category_scores_gemma":[0.000026208405,0.00002580768,0.00020274169,0.0007134797,0.00004443414,0.00008815944,0.00026117748,0.00014370216,1.3487363e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002372541,0.00072057906,0.019185377,0.000008279444,0.0026993577,0.0000031571362,0.0017867486,0.09005165,0.0052984916,0.30600476,0.00049356464,0.5737243],"study_design_scores_gemma":[0.0003248568,0.000051514286,0.053978994,0.000008446754,0.0003177395,0.00005636048,0.00041265224,0.90668714,0.001782012,0.024315972,0.011953431,0.00011090106],"about_ca_topic_score_codex":0.000036360278,"about_ca_topic_score_gemma":0.0000015594995,"teacher_disagreement_score":0.9574336,"about_ca_system_score_codex":0.00003753274,"about_ca_system_score_gemma":0.000035444904,"threshold_uncertainty_score":0.18629627},"labels":[],"label_agreement":null},{"id":"W4221036944","doi":"10.1109/tcsii.2022.3161005","title":"Variable-Precision Approximate Floating-Point Multiplier for Efficient Deep Learning Computation","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits & Systems II Express Briefs","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Ocean University of China; University of Saskatchewan","keywords":"Multiplier (economics); Computation; Exponent; Floating point; Adder; Mathematics; Multiplication (music); Algorithm; Computer science","score_opus":0.02239759204039348,"score_gpt":0.2650750091429171,"score_spread":0.2426774171025236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221036944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012231073,0.0001609201,0.99218714,0.000046925154,0.0042854627,0.0012441848,0.00005459597,0.0005855627,0.00021211799],"genre_scores_gemma":[0.82418716,0.0000049092764,0.1742871,0.00008530062,0.00011448893,0.0009210174,0.0000086121345,0.00005847322,0.00033292506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99656534,0.0006178632,0.0006761824,0.00083398813,0.0007519327,0.0005546632],"domain_scores_gemma":[0.9980232,0.0008480963,0.0002515596,0.00051554554,0.00017621601,0.00018538961],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012920747,0.0003152048,0.000454342,0.0002555448,0.002112421,0.000273001,0.00072356185,0.00008997348,0.000023104258],"category_scores_gemma":[0.000029152712,0.00032669998,0.00019371668,0.0007554329,0.000039842536,0.00026402855,0.00002665237,0.00055396033,0.000008176444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011075105,0.00022349773,4.6602543e-7,0.000064328146,0.000029955301,0.0000028805734,0.0013957451,0.79976875,0.0075717047,0.00065119244,0.00004515335,0.19023524],"study_design_scores_gemma":[0.00095057365,0.00040341303,0.000004073588,0.00007443557,0.000021414318,0.000048800888,0.00036768403,0.9867746,0.0033260852,0.00029660933,0.007341061,0.00039119707],"about_ca_topic_score_codex":0.00006133629,"about_ca_topic_score_gemma":3.7264016e-7,"teacher_disagreement_score":0.8229641,"about_ca_system_score_codex":0.00023919147,"about_ca_system_score_gemma":0.00006207617,"threshold_uncertainty_score":0.9999185},"labels":[],"label_agreement":null},{"id":"W4233832720","doi":"10.1109/asap.2000.862402","title":"A new algorithm for the elimination of common subexpressions in hardware implementation of digital filters by using genetic programming","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Constant (computer programming); Digital signal processing; Multiplication (music); Digital filter; Genetic programming; Algorithm; Genetic algorithm; Parallel computing; Computer hardware; Filter (signal processing); Mathematics; Programming language; Artificial intelligence; Machine learning","score_opus":0.04420860618494046,"score_gpt":0.3385677893883045,"score_spread":0.29435918320336407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233832720","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033843194,0.000115983246,0.99577683,0.00030804475,0.000054692868,0.00032170722,0.000014043277,0.000012240842,0.000012125469],"genre_scores_gemma":[0.111233145,0.0000060918096,0.8886759,0.000016812835,0.000012938478,0.000015201963,0.0000027313115,0.000004268865,0.000032910582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930054,0.00002935879,0.00025606426,0.00013313133,0.00014659236,0.00013432906],"domain_scores_gemma":[0.999452,0.00020300572,0.00012025116,0.00015037133,0.00004135733,0.000033025433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010263197,0.00006332259,0.00011026514,0.000047718197,0.000041835134,0.000052430572,0.0002509088,0.000018812325,0.000016216947],"category_scores_gemma":[0.00001539736,0.000044207914,0.00004721197,0.00026825638,0.000019274343,0.00024730637,0.00006875604,0.00003262092,1.8875664e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.100438e-7,0.000035067,0.00025322087,0.0000054116804,0.0000040739096,1.5507612e-7,0.0003149148,0.00004545666,0.0009892429,0.000087879045,0.000139233,0.99812496],"study_design_scores_gemma":[0.00045519677,0.00015775331,0.0011610859,0.000024679986,0.000008599219,0.0000019579243,0.00050386775,0.9759999,0.02039892,0.0005400067,0.0006595266,0.00008853914],"about_ca_topic_score_codex":0.00024915533,"about_ca_topic_score_gemma":0.0000051888396,"teacher_disagreement_score":0.9980364,"about_ca_system_score_codex":0.000016361315,"about_ca_system_score_gemma":0.000011752022,"threshold_uncertainty_score":0.18027465},"labels":[],"label_agreement":null},{"id":"W4236443661","doi":"10.1007/978-0-387-39940-9_2153","title":"Calculus Expression","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Calculus (dental); Expression (computer science); Computer science; Mathematics; Medicine; Programming language; Dentistry","score_opus":0.019122738037544423,"score_gpt":0.26189831884412806,"score_spread":0.24277558080658365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236443661","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.053484e-7,0.002955152,0.41855118,0.000044456763,0.0019036026,0.00032756673,0.00022152114,0.00011719693,0.57587844],"genre_scores_gemma":[0.000050920422,0.00279187,0.33089697,0.00009027598,0.0015894959,0.000028310871,0.00018947043,0.00007501135,0.6642877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99723965,0.00010283948,0.0007863704,0.00077192095,0.0007649518,0.00033423974],"domain_scores_gemma":[0.9970572,0.00020793387,0.00060211646,0.0017551938,0.00012857399,0.0002490017],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050843024,0.00043222815,0.0008028025,0.00019597617,0.000070793,0.000060751492,0.0013396295,0.000254354,0.00005574512],"category_scores_gemma":[0.00007181377,0.00035424894,0.00019743395,0.00009136156,0.00006248301,0.00038245297,0.0005027478,0.00041156518,0.00015021084],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009609628,0.00009054686,0.0000034260506,0.00044197548,0.00005649856,0.00030141976,0.00013996092,0.000017583538,0.0006353648,0.5136811,0.03695384,0.44766867],"study_design_scores_gemma":[0.00019955431,0.00012000334,0.0000043231075,0.0010613833,0.000023177603,0.00003058364,0.0000051285756,0.0015729924,0.00018691934,0.002756568,0.9935396,0.00049981766],"about_ca_topic_score_codex":0.00006468922,"about_ca_topic_score_gemma":8.202373e-7,"teacher_disagreement_score":0.9565857,"about_ca_system_score_codex":0.00004568061,"about_ca_system_score_gemma":0.00012629032,"threshold_uncertainty_score":0.9998909},"labels":[],"label_agreement":null},{"id":"W4236655281","doi":"10.11113/mjfas.v7n1.207","title":"A numerical algorithm for nth root","year":2014,"lang":"en","type":"article","venue":"Malaysian Journal of Fundamental and Applied Sciences","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Sinai Hospital","funders":"","keywords":"Square root; Root (linguistics); Numerical digit; Convergence (economics); Mathematics; Algorithm; Arithmetic; Computer science; Geometry","score_opus":0.01721227881018055,"score_gpt":0.27211939264703766,"score_spread":0.2549071138368571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236655281","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019194435,0.000086416265,0.9778125,0.0011562379,0.000329882,0.00008899636,0.0000013700975,0.000014116379,0.0013160015],"genre_scores_gemma":[0.43992677,0.000002664409,0.55964106,0.00023517759,0.00016836978,0.0000037417285,8.482854e-8,0.000002864514,0.0000192657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987428,0.000048261656,0.00031628244,0.0002585227,0.00034526535,0.00028887874],"domain_scores_gemma":[0.9992251,0.00019890766,0.00023058424,0.00009591508,0.000035018333,0.00021451736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011647714,0.00012582351,0.00027124732,0.00009925542,0.00028652372,0.00029984117,0.0006509106,0.000028165177,0.0000093192475],"category_scores_gemma":[0.000021481357,0.000084740495,0.000090714195,0.00034803036,0.0002451035,0.00029013943,0.00009418953,0.000111691246,0.0000031192028],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061614587,0.0000634793,0.00035749885,0.000006388738,0.000009967165,0.0000020739988,0.00012625755,0.00006304254,0.0012458328,0.031830683,0.00008716022,0.9662014],"study_design_scores_gemma":[0.003092273,0.0062699774,0.007521839,0.000110166984,0.000045360925,0.000845182,0.00087168766,0.7377904,0.016597856,0.19421127,0.031653058,0.0009909547],"about_ca_topic_score_codex":0.0000013646031,"about_ca_topic_score_gemma":8.084221e-8,"teacher_disagreement_score":0.9652105,"about_ca_system_score_codex":0.000014425182,"about_ca_system_score_gemma":0.00003573495,"threshold_uncertainty_score":0.3455617},"labels":[],"label_agreement":null},{"id":"W4238351182","doi":"10.1007/11816492_107","title":"Benchmarking a Recurrent Linear GP Model on Prediction and Control Problems","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in control and information sciences","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Chaotic; Genetic programming; Benchmarking; Computer science; Linear programming; Series (stratigraphy); Lorenz system; Algorithm; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.017295690028529945,"score_gpt":0.24987953059124796,"score_spread":0.23258384056271802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238351182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022584945,0.0006091308,0.9815089,0.0012595805,0.00031472702,0.00044146733,0.000042339987,0.000053168584,0.015748097],"genre_scores_gemma":[0.66256857,0.0016260813,0.32044977,0.013264734,0.0011375789,0.00017652808,0.000056673623,0.00003485646,0.0006852046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983283,0.000038574875,0.00052856235,0.00036119975,0.0004867811,0.00025657596],"domain_scores_gemma":[0.9988967,0.0004371805,0.0003289733,0.0001651356,0.00009322643,0.00007876669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008653991,0.00026710203,0.000355337,0.00034761408,0.00024094053,0.00037218307,0.0002917323,0.00020304887,0.0000035594912],"category_scores_gemma":[0.00011724404,0.00019084329,0.000054268432,0.00013848688,0.00020695987,0.001442032,0.00006223407,0.00037117465,0.0000030524807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017447894,0.000009556184,0.00005444831,0.000039303923,0.000009129572,6.156709e-7,0.00026098118,0.077283576,0.000012025452,0.029411854,0.000031130938,0.89286995],"study_design_scores_gemma":[0.0007063596,0.0003886231,0.00011947973,0.00016538239,0.00000918771,0.0000063283032,7.8451865e-7,0.93238664,0.0000060109437,0.058560863,0.007448155,0.0002021667],"about_ca_topic_score_codex":0.000022628443,"about_ca_topic_score_gemma":0.000007070659,"teacher_disagreement_score":0.8926678,"about_ca_system_score_codex":0.000036442325,"about_ca_system_score_gemma":0.00007521248,"threshold_uncertainty_score":0.7782363},"labels":[],"label_agreement":null},{"id":"W4240515399","doi":"10.1109/iwsoc.2004.1319850","title":"A programmable base MDLNS MAC with self-generated lookup table","year":2004,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dram; Lookup table; Computer science; Adder; Accumulator (cryptography); Parallel computing; Logarithm; Reduction (mathematics); Binary number; Computer hardware; Table (database); Algorithm; Arithmetic; Mathematics","score_opus":0.011717074925306282,"score_gpt":0.2381415275958603,"score_spread":0.22642445267055403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240515399","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028725427,0.000053583914,0.9911568,0.0013153411,0.00009628063,0.00021083602,8.975062e-7,0.00063684286,0.0036568306],"genre_scores_gemma":[0.007967613,0.0000059523263,0.9895676,0.0008072016,0.000054336677,0.000037788413,0.0000017305836,0.000012253237,0.001545554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871755,0.00004509819,0.00014553011,0.00041614118,0.00023810043,0.00043757807],"domain_scores_gemma":[0.9991955,0.000023295219,0.000045219418,0.0004346287,0.00009761355,0.00020371035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021493537,0.00015164327,0.0001648188,0.000047105936,0.00012725392,0.00026700698,0.0004588005,0.000038939437,0.00004518785],"category_scores_gemma":[0.0000093852705,0.00009903303,0.000032236796,0.0010265912,0.00003001759,0.00037499392,0.00010748733,0.000111050234,0.000079189624],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047305584,0.0025915604,0.00090167596,0.000080776335,0.00022382257,0.0007621285,0.000812904,0.008506664,0.010191576,0.40632978,0.002367207,0.56718457],"study_design_scores_gemma":[0.007869351,0.0038324927,0.00046162063,0.00012747882,0.00007265395,0.0004282868,0.00013098145,0.47533175,0.29621202,0.054681234,0.15844144,0.0024106966],"about_ca_topic_score_codex":0.00041744206,"about_ca_topic_score_gemma":0.000018187207,"teacher_disagreement_score":0.5647739,"about_ca_system_score_codex":0.000045562214,"about_ca_system_score_gemma":0.00016174231,"threshold_uncertainty_score":0.40384498},"labels":[],"label_agreement":null},{"id":"W4244897181","doi":"10.1109/pact.2004.1342544","title":"A high-performance SIMD floating point unit for BlueGene/L: architecture, compilation, and algorithm design","year":2004,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Parallel computing; PowerPC; Compiler; SIMD; Memory bandwidth; Floating point; Memory hierarchy; Computer architecture; Software; Algorithm; Operating system","score_opus":0.03092589562900043,"score_gpt":0.26976995702838674,"score_spread":0.2388440613993863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244897181","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024534753,0.0000549271,0.995843,0.00082783797,0.00017819589,0.00034686338,0.0000062139197,0.00017300995,0.000116454146],"genre_scores_gemma":[0.022985486,0.000014243628,0.97622603,0.0005774265,0.000111042464,0.000021166263,0.000003086917,0.000012156025,0.000049354203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887663,0.000061338345,0.00023697487,0.00035771908,0.00016548375,0.00030185224],"domain_scores_gemma":[0.99917024,0.00029232746,0.000072842515,0.00025531856,0.00008908881,0.00012015404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047935487,0.00015656902,0.00019051392,0.00007830998,0.0002318738,0.00012890928,0.00032062852,0.000043372325,0.0000035461462],"category_scores_gemma":[0.00005043617,0.00012289407,0.000033074244,0.00032854927,0.00004853535,0.00027085986,0.0001212855,0.00010226708,0.0000055847777],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048739817,0.00003269892,0.00002404846,0.000014900568,0.000011215332,0.0000012847484,0.00019787991,0.022310894,0.0010052135,0.02336575,0.00002180997,0.9530094],"study_design_scores_gemma":[0.0011853344,0.0005810887,0.001271245,0.000035021025,0.000007876324,0.000031555817,0.000019819185,0.7688843,0.047693245,0.17927307,0.0006772957,0.0003401427],"about_ca_topic_score_codex":0.000037612725,"about_ca_topic_score_gemma":0.0000010876453,"teacher_disagreement_score":0.95266926,"about_ca_system_score_codex":0.000020984031,"about_ca_system_score_gemma":0.000048582613,"threshold_uncertainty_score":0.5011475},"labels":[],"label_agreement":null},{"id":"W4247218661","doi":"10.1002/9781118316948.ch27","title":"Efficient Approximations for the Arctangent Function","year":2012,"lang":"en","type":"other","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Inverse trigonometric functions; Approximations of π; Quadrant (abdomen); Mathematics; Computer science; Applied mathematics; Calculus (dental); Mathematical analysis; Medicine","score_opus":0.03142524699923648,"score_gpt":0.2836481641776861,"score_spread":0.25222291717844963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247218661","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.260905e-8,0.0007865226,0.79914904,0.0005462712,0.0014123424,0.00039339843,0.0000051863644,0.00016983662,0.19753739],"genre_scores_gemma":[0.000006107914,0.00000734205,0.5966323,0.0002352788,0.00045250042,0.00013581953,0.0000014843879,0.000043140335,0.402486],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937433,0.000029617771,0.00008912894,0.00018823199,0.00013741471,0.00018128885],"domain_scores_gemma":[0.9992741,0.00016328886,0.000074029515,0.00042176672,0.000017503677,0.000049324095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022235235,0.00010680447,0.00010269151,0.00005189666,0.00007853467,0.000053908265,0.0003935959,0.00006246348,0.0005159285],"category_scores_gemma":[0.000016423626,0.000055982044,0.00008492745,0.0001504475,0.000021636817,0.0000123202435,0.00008658676,0.000064832435,0.00011447135],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.5222e-7,0.000046361216,4.7397398e-7,0.000016484653,0.000025101064,3.9622353e-8,0.000020842763,0.000025327876,0.0000042774354,0.19643623,0.18474516,0.61867917],"study_design_scores_gemma":[0.000051992058,0.000018026025,0.0000146444945,0.000006776718,0.0000141359,6.231223e-7,0.0000041983662,0.12409667,0.000005543093,0.0010949201,0.8746085,0.00008395781],"about_ca_topic_score_codex":0.000023164477,"about_ca_topic_score_gemma":0.0000015319614,"teacher_disagreement_score":0.6898633,"about_ca_system_score_codex":0.000012826806,"about_ca_system_score_gemma":0.000012755933,"threshold_uncertainty_score":0.5649055},"labels":[],"label_agreement":null},{"id":"W4250035399","doi":"10.1115/1.4037803","title":"On the Solutions of Interval Systems for Under-Constrained and Redundant Parallel Manipulators","year":2017,"lang":"en","type":"article","venue":"Journal of Mechanisms and Robotics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Orthant; Jacobian matrix and determinant; Mathematics; Solution set; Wrench; Interval (graph theory); Parameterized complexity; Control theory (sociology); Actuator; Mathematical optimization; Set (abstract data type); Computer science; Applied mathematics; Algorithm; Engineering","score_opus":0.07155371988058924,"score_gpt":0.3019212601783187,"score_spread":0.2303675402977295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250035399","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008215092,0.00023768641,0.99449795,0.0035761378,0.00074302935,0.00009476445,0.0000020674636,0.0000030709748,0.000023753893],"genre_scores_gemma":[0.31848493,0.00012719486,0.68121856,0.000067221416,0.000063213316,0.0000010472389,4.0577223e-8,0.000004389998,0.000033387016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932677,0.00004926173,0.00027018707,0.00008703379,0.00014273137,0.00012403454],"domain_scores_gemma":[0.9989443,0.00022962589,0.00045607513,0.00020175231,0.000093154486,0.00007512484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008161676,0.00007509962,0.00021467966,0.000036265406,0.00033723045,0.00017286389,0.00035549613,0.00003878589,5.58047e-7],"category_scores_gemma":[0.00011493934,0.000041569354,0.0000713433,0.000021741513,0.00008084811,0.00011909465,0.00011489327,0.00010824667,9.410142e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007934012,0.000027322429,0.0000018004142,0.000015235304,0.000032520536,0.0000033414585,0.000050133072,0.0057386826,0.00063355564,0.98645264,0.00003827064,0.0069985404],"study_design_scores_gemma":[0.0005283062,0.00093629415,0.0002605771,0.00018172723,0.000036718346,0.00018079401,0.00024019234,0.5285954,0.00012066594,0.46877062,0.000055393462,0.0000933067],"about_ca_topic_score_codex":0.000006525985,"about_ca_topic_score_gemma":5.48187e-7,"teacher_disagreement_score":0.5228567,"about_ca_system_score_codex":0.000008048596,"about_ca_system_score_gemma":0.000028917459,"threshold_uncertainty_score":0.25937378},"labels":[],"label_agreement":null},{"id":"W4251445548","doi":"10.1007/978-1-84882-406-5_4","title":"Interval Arithmetic","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Victoria","funders":"","keywords":"Arithmetic; Mathematics; Interval (graph theory); Interval arithmetic; Computer science; Combinatorics; Mathematical analysis","score_opus":0.02883518811282298,"score_gpt":0.27489151986644933,"score_spread":0.24605633175362635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251445548","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.0518089e-8,0.00011989658,0.4912703,0.0005748936,0.00026927344,0.000043512115,6.2174405e-7,0.00012483438,0.5075967],"genre_scores_gemma":[0.0000032245966,0.000027703221,0.47745642,0.0009168029,0.00012634366,8.102541e-7,6.3744915e-7,0.000009037762,0.52145904],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988085,0.000016307009,0.00024324142,0.00046364812,0.00026218608,0.00020611542],"domain_scores_gemma":[0.99904907,0.00007342459,0.00008804885,0.00061298197,0.000049278427,0.000127225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016144365,0.00024294764,0.0003359023,0.000100102,0.00003655346,0.00013485733,0.0009654943,0.0001590858,0.00035962323],"category_scores_gemma":[0.000012956293,0.00018896598,0.00019092325,0.000036226684,0.000037618458,0.00011089826,0.0002700358,0.00032070174,0.0006006134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.118773e-7,0.0000041380836,3.1293176e-8,0.0000017176003,0.000005825215,0.00002018681,0.0000040597256,1.2707379e-7,0.0000014936877,0.45616594,0.0008191622,0.5429771],"study_design_scores_gemma":[0.00004815077,0.0001144289,0.0000050688177,0.00003498021,0.00000564304,0.000020296442,2.2389449e-7,0.0023427163,0.000024752271,0.47633943,0.5208345,0.00022980996],"about_ca_topic_score_codex":0.0000041524017,"about_ca_topic_score_gemma":4.6857895e-7,"teacher_disagreement_score":0.54274726,"about_ca_system_score_codex":0.000029451625,"about_ca_system_score_gemma":0.000031567968,"threshold_uncertainty_score":0.7719871},"labels":[],"label_agreement":null},{"id":"W4253633424","doi":"10.31219/osf.io/35297","title":"Función de dos variables y sucesiones numéricas eventualmente periódicas.","year":2021,"lang":"es","type":"preprint","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cegep de Sept Iles","funders":"","keywords":"Chemistry; Humanities; Philosophy","score_opus":0.03162879485124109,"score_gpt":0.31400904422611114,"score_spread":0.28238024937487005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253633424","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061633484,0.0018455256,0.9745482,0.0032775044,0.0037859997,0.00044996873,0.000020295283,0.00034940487,0.009559706],"genre_scores_gemma":[0.030568399,0.0033252786,0.9571853,0.0014523524,0.00088745035,0.00012927431,0.000027328912,0.00006761353,0.0063569723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931192,0.0012559395,0.0010205107,0.0021854753,0.0011444049,0.001274482],"domain_scores_gemma":[0.9954544,0.0008717278,0.0004797974,0.0020427816,0.0004269564,0.00072434003],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018745993,0.000870392,0.0012227067,0.00020273906,0.00043509924,0.0019386304,0.0026299262,0.0005928256,0.0018570803],"category_scores_gemma":[0.000485734,0.00073719845,0.0005960099,0.0010459134,0.00019233741,0.00046168108,0.005398219,0.0012135882,0.00021509515],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004142662,0.0019880736,0.0026323118,0.0009790295,0.0007328143,0.0011429078,0.005019323,0.00072995765,0.006123074,0.09253308,0.0035539148,0.8845241],"study_design_scores_gemma":[0.0024992998,0.0011702523,0.020730158,0.0038851066,0.00052937324,0.0009197392,0.0036292616,0.5490724,0.025905574,0.08659762,0.2978207,0.007240542],"about_ca_topic_score_codex":0.0008855227,"about_ca_topic_score_gemma":0.0000056904846,"teacher_disagreement_score":0.8772835,"about_ca_system_score_codex":0.0002676397,"about_ca_system_score_gemma":0.0010551382,"threshold_uncertainty_score":0.9995079},"labels":[],"label_agreement":null},{"id":"W4254701380","doi":"10.1007/bf02985860","title":"The SIAM 100-Digit challenge: a study in high-accuracy numerical computing","year":2005,"lang":"en","type":"article","venue":"The Mathematical Intelligencer","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Numerical digit; Arithmetic; Computer science; Parallel computing; Mathematics","score_opus":0.05911578884719328,"score_gpt":0.36633160644383944,"score_spread":0.3072158175966462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254701380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01277417,0.00024412702,0.97475,0.009347347,0.00023143555,0.0006290726,4.062848e-7,0.0001393247,0.0018841124],"genre_scores_gemma":[0.8648559,0.00003988717,0.13416442,0.0003783996,0.00026495167,0.00005569139,1.14604426e-7,0.000018338906,0.00022232068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719155,0.00045784438,0.0007214011,0.00044994318,0.0005660553,0.00061320304],"domain_scores_gemma":[0.99424046,0.004421864,0.00014491485,0.0009935865,0.00006630728,0.0001328845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017860162,0.00025130014,0.00036972208,0.00005038375,0.0003538096,0.0004025254,0.002268843,0.00005709422,0.00008796805],"category_scores_gemma":[0.000797849,0.00012213174,0.00011144244,0.0007319443,0.00019561058,0.00024033726,0.000779009,0.0005239969,0.00057726837],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000819241,0.000682293,0.00003096131,0.000008561884,0.000023413982,0.000011666713,0.0040277895,0.00029439531,0.0000069463304,0.20008369,0.000085028565,0.79473704],"study_design_scores_gemma":[0.00020781052,0.0003880349,0.0003820941,0.00006125669,0.000012725398,0.00002736993,0.001311087,0.599096,0.00045490076,0.39328638,0.004414112,0.00035823896],"about_ca_topic_score_codex":0.000036656766,"about_ca_topic_score_gemma":0.00000800773,"teacher_disagreement_score":0.8520817,"about_ca_system_score_codex":0.000071929586,"about_ca_system_score_gemma":0.00003813075,"threshold_uncertainty_score":0.74198097},"labels":[],"label_agreement":null},{"id":"W4254743552","doi":"10.1142/s0218126600000056","title":"AN ALTERNATIVE PROOF OF MODIFIED-BOOTH RECODING ALGORITHM BASED ON NUMBER-DOMAIN TRANSFORMATIONS","year":2000,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Nortel (Canada)","funders":"","keywords":"Complement (music); Algorithm; Arithmetic; Radix (gastropod); Representation (politics); Mathematics; Set (abstract data type); Numerical digit; Computer science; Domain (mathematical analysis)","score_opus":0.02235452750072046,"score_gpt":0.2774658672538252,"score_spread":0.25511133975310474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254743552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014879147,0.0000825216,0.98273605,0.000173399,0.00066623674,0.00017015527,0.000008021579,0.000017141048,0.0012673346],"genre_scores_gemma":[0.8054616,0.000025513484,0.19409342,0.00013490485,0.00025091396,0.0000040570962,6.2838177e-7,0.000010767047,0.00001818962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808997,0.0003228882,0.00071121805,0.00019821912,0.00046850945,0.00020918371],"domain_scores_gemma":[0.99877423,0.00018950606,0.0004287389,0.0002349981,0.00016269404,0.00020982887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086818094,0.00016152753,0.0004418238,0.00017162094,0.00010446406,0.0001746927,0.00054186303,0.00005304767,0.0000073391425],"category_scores_gemma":[0.000005759605,0.00012661537,0.00012508023,0.00029581165,0.000043832482,0.00065446575,0.000010770126,0.00019898787,0.0000012114732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074737013,0.00016939816,0.000024467303,0.00004181272,0.00003898064,0.000025042305,0.0010148312,0.03402844,0.00011645726,0.0043326067,0.00004525028,0.96015525],"study_design_scores_gemma":[0.0009008591,0.0008496464,0.00021271729,0.00037648622,0.000010940059,0.00022306337,0.000088785266,0.9928669,0.000425024,0.0029527107,0.0009175885,0.00017530486],"about_ca_topic_score_codex":0.000026930506,"about_ca_topic_score_gemma":1.6782468e-7,"teacher_disagreement_score":0.95997995,"about_ca_system_score_codex":0.00004189998,"about_ca_system_score_gemma":0.00006660166,"threshold_uncertainty_score":0.5163225},"labels":[],"label_agreement":null},{"id":"W4255714343","doi":"10.1109/mwscas.2000.951607","title":"Limitations of criteria for testing transistor circuits for multiple DC operating points","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Resistor; Transistor; Jacobian matrix and determinant; Electronic circuit; Equivalent circuit; Computer science; Control theory (sociology); Value (mathematics); Topology (electrical circuits); Mathematics; Electronic engineering; Electrical engineering; Engineering; Statistics; Voltage; Control (management); Applied mathematics","score_opus":0.31272017551827463,"score_gpt":0.3389295590777967,"score_spread":0.02620938355952207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255714343","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013118824,0.000036066027,0.9962946,0.0008318122,0.00021892936,0.0003590975,0.000013584252,0.00006950911,0.00086452067],"genre_scores_gemma":[0.15809594,0.000001120373,0.84137845,0.00018783967,0.000057589077,0.00007949262,8.432321e-7,0.0000076190813,0.0001911227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919784,0.000035942045,0.0002581653,0.00023226012,0.00008165975,0.00019411708],"domain_scores_gemma":[0.99691045,0.0025911517,0.000059225054,0.0001707178,0.0002090093,0.000059439044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027888705,0.00008095519,0.00015698554,0.00004038849,0.00014694536,0.00005947937,0.000266971,0.000027045937,0.000009867525],"category_scores_gemma":[0.0022089721,0.00007051516,0.00007709124,0.00021597886,0.0000192308,0.0002277453,0.00002192111,0.00003127509,0.0000019864124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.3632015e-7,0.00009726619,0.000045221015,0.00004248219,0.000009165798,3.5561513e-7,0.0007563412,0.00004517601,0.06583804,0.006064908,0.00032633496,0.92677397],"study_design_scores_gemma":[0.00051721046,0.00022560204,0.00020051359,0.00001970701,0.000005908316,0.0000028538689,0.000044978864,0.9818155,0.012702815,0.0025823768,0.0017587882,0.00012373895],"about_ca_topic_score_codex":0.000008990753,"about_ca_topic_score_gemma":0.0000018476084,"teacher_disagreement_score":0.98177034,"about_ca_system_score_codex":0.0000102725635,"about_ca_system_score_gemma":0.000010822367,"threshold_uncertainty_score":0.28755248},"labels":[],"label_agreement":null},{"id":"W4288869073","doi":"10.1007/978-3-031-02420-7","title":"Fast Start Differential Calculus","year":2019,"lang":"en","type":"book","venue":"Synthesis lectures on mathematics and statistics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Calculus (dental); Differential calculus; Logarithm; Limit (mathematics); Mathematics; Derivative (finance); Differential (mechanical device); Time-scale calculus; Algebraic number; Logarithmic derivative; Applied mathematics; Algebra over a field; Computer science; Multivariable calculus; Pure mathematics; Mathematical analysis; Medicine; Engineering","score_opus":0.016719283064697058,"score_gpt":0.2555289625368816,"score_spread":0.23880967947218457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288869073","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000035385071,0.0001504793,0.9602084,0.000103744394,0.00050188287,0.00028459096,0.0004973486,0.00007671808,0.038173255],"genre_scores_gemma":[0.000048686266,0.00016857486,0.8857136,0.00019694073,0.00019596316,0.000021373857,0.000019722609,0.00007056631,0.11356457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978126,0.00008130525,0.00046759535,0.00061273965,0.0006259002,0.00039985313],"domain_scores_gemma":[0.9958647,0.002733123,0.00032089988,0.0008129142,0.0000872238,0.00018113725],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021269538,0.00052061165,0.00087342033,0.00015035116,0.00014668693,0.0003703758,0.0006964944,0.00027593962,0.00014735996],"category_scores_gemma":[0.00040055308,0.00039035108,0.00012381386,0.00006814461,0.00010737666,0.000042869742,0.00025503815,0.00047123112,0.00012455492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004640167,0.00009431685,2.2103347e-7,0.0004841106,0.000112938695,0.00003372354,0.00023266656,0.000012465185,0.000030434343,0.6550221,0.020795314,0.32317707],"study_design_scores_gemma":[0.000265959,0.00042836685,0.000018038108,0.0006948593,0.00022030504,0.00003189259,0.000014201066,0.19619656,0.000392507,0.7386645,0.0617748,0.0012979968],"about_ca_topic_score_codex":0.0000031896643,"about_ca_topic_score_gemma":0.0000021137348,"teacher_disagreement_score":0.32187906,"about_ca_system_score_codex":0.00007409783,"about_ca_system_score_gemma":0.0001606878,"threshold_uncertainty_score":0.99985486},"labels":[],"label_agreement":null},{"id":"W4289783938","doi":"","title":"Proofs of numerical programs when the compiler optimizes","year":2011,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Compiler; Mathematical proof; Computer science; Programming language; Parallel computing; Mathematics; Geometry","score_opus":0.031183257836975096,"score_gpt":0.2366826916201283,"score_spread":0.20549943378315322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289783938","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021243063,0.00022172205,0.9594411,0.0046211337,0.00011471774,0.00027676846,0.0000021664575,0.00015232935,0.03304573],"genre_scores_gemma":[0.21285017,0.000025253772,0.7858967,0.00009916939,0.0000089802215,0.000039728628,0.0000047587737,0.000011913708,0.0010632926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99547774,0.0031360025,0.000363389,0.00039643943,0.00033714322,0.00028930354],"domain_scores_gemma":[0.99648935,0.0007866394,0.00026428574,0.0015081137,0.00082196726,0.00012965532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033315152,0.00015723187,0.00023325194,0.000052783416,0.00021385874,0.00014722843,0.0020362842,0.00006121263,0.000085196094],"category_scores_gemma":[0.00041988125,0.00011014658,0.0001341114,0.0005115606,0.0002946767,0.00022878092,0.0006455111,0.00020946392,0.00002274778],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005081842,0.00075019186,0.0012612873,0.000018483317,0.00003425508,0.0000020076855,0.012141385,0.0000033290366,0.0007313261,0.31043506,0.00028096657,0.6743366],"study_design_scores_gemma":[0.002157468,0.000014021794,0.025663627,0.001108931,0.00008389304,0.000076107026,0.000483493,0.4563139,0.29616398,0.16006604,0.056397762,0.0014707665],"about_ca_topic_score_codex":0.00042591503,"about_ca_topic_score_gemma":0.00001789283,"teacher_disagreement_score":0.67286587,"about_ca_system_score_codex":0.00001754601,"about_ca_system_score_gemma":0.00006747997,"threshold_uncertainty_score":0.44916472},"labels":[],"label_agreement":null},{"id":"W4300819837","doi":"10.1007/0-306-48332-7_70","title":"Continuous Global Optimization: Applications","year":2001,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science","score_opus":0.010883409763587856,"score_gpt":0.25235946537320536,"score_spread":0.2414760556096175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300819837","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.3396139e-8,0.00034113872,0.52783257,0.0001341478,0.00024788227,0.00030697306,0.000018224284,0.00010825694,0.4710108],"genre_scores_gemma":[0.0000021135231,0.0042530717,0.89464754,0.000096445096,0.0003501153,0.000049808234,0.000106103595,0.000034222005,0.1004606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980047,0.000038766208,0.0006554531,0.00061749085,0.0004404516,0.00024316656],"domain_scores_gemma":[0.99797696,0.000093502,0.0006177365,0.0007805446,0.00038341858,0.00014781657],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001675281,0.00035082555,0.00051092287,0.00012070117,0.00010513537,0.0000768995,0.0008583769,0.0003207469,0.0004534978],"category_scores_gemma":[0.000042795382,0.00036006494,0.00016606295,0.00031344208,0.00009672893,0.0003270338,0.00022730058,0.0001882866,0.00003832156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034955965,0.000048596965,0.000013018934,0.000024660038,0.00003634895,0.000007704085,0.000021397742,0.5549642,1.3220019e-7,0.27235508,0.0009569246,0.17156848],"study_design_scores_gemma":[0.0003589025,0.000121880235,0.0000060434986,0.00008379836,0.00007375003,0.000030738698,0.000003740253,0.45674318,0.0000023120722,0.028190983,0.51374674,0.00063794164],"about_ca_topic_score_codex":0.0000069944163,"about_ca_topic_score_gemma":4.751001e-7,"teacher_disagreement_score":0.5127898,"about_ca_system_score_codex":0.00009443963,"about_ca_system_score_gemma":0.00014562406,"threshold_uncertainty_score":0.99988514},"labels":[],"label_agreement":null},{"id":"W4301385812","doi":"","title":"Hard faults and soft errors: possible numerical remedies in linear algebra solvers","year":2016,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Linear algebra; Computer science; Algebra over a field; Numerical linear algebra; Algorithm; Applied mathematics; Linear system; Mathematics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.01603705846315263,"score_gpt":0.2482776919323049,"score_spread":0.23224063346915227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301385812","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030706841,0.0002852783,0.9418399,0.024336359,0.00017202461,0.00013222994,0.0000048929764,0.00016874576,0.0023537579],"genre_scores_gemma":[0.2679161,0.00024064964,0.72806525,0.0002236081,0.000020561374,0.000020095877,0.0000037338705,0.000017235387,0.0034927388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648696,0.0018889224,0.00033895095,0.00059735577,0.0003075375,0.00038024798],"domain_scores_gemma":[0.99665743,0.0016155656,0.00015016504,0.0009496364,0.00041626804,0.0002109451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00285968,0.00018138478,0.0002512759,0.00013481083,0.00018205322,0.00013007213,0.000917308,0.00008739854,0.000030582258],"category_scores_gemma":[0.0016172962,0.00013680999,0.000072931405,0.0005729999,0.00021845475,0.0004709307,0.0005955835,0.0001758838,0.000039597908],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001098806,0.00032581837,0.008691865,0.000024910645,0.000022518712,0.000015376623,0.0046588047,0.00000406406,0.018166445,0.06980265,0.00046341532,0.89781314],"study_design_scores_gemma":[0.006499086,0.000014760847,0.13181408,0.0039675,0.000041736024,0.000116802636,0.00048148827,0.36988178,0.30670145,0.1026446,0.075189784,0.0026469198],"about_ca_topic_score_codex":0.00031139172,"about_ca_topic_score_gemma":0.00007038059,"teacher_disagreement_score":0.8951662,"about_ca_system_score_codex":0.000049430953,"about_ca_system_score_gemma":0.00008094352,"threshold_uncertainty_score":0.55789495},"labels":[],"label_agreement":null},{"id":"W4304782293","doi":"10.1007/s00365-022-09593-2","title":"Fast and Stable Approximation of Analytic Functions from Equispaced Samples via Polynomial Frames","year":2022,"lang":"lv","type":"article","venue":"Constructive Approximation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Polynomial; Computer science; Mathematics; Mathematical analysis","score_opus":0.022991958534008716,"score_gpt":0.2560468056044899,"score_spread":0.23305484707048119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4304782293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11620888,0.00051092624,0.8803484,0.00038603088,0.0009670953,0.00059913733,0.0005083084,0.0000658532,0.00040541508],"genre_scores_gemma":[0.54886156,0.000015087248,0.45058322,0.000057270852,0.0001593544,0.00009499434,0.00012118017,0.000021741838,0.000085611595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673736,0.00071210996,0.0006983548,0.0008403094,0.00061836175,0.0003935202],"domain_scores_gemma":[0.9976646,0.00059917546,0.0007869694,0.0005521978,0.00024460896,0.00015245343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000641255,0.00032694082,0.0006145301,0.00031915895,0.0006891375,0.00021139655,0.0004228957,0.00011241988,0.00030514397],"category_scores_gemma":[0.0001979187,0.0003510419,0.00014186231,0.0011197426,0.00049197883,0.00082245824,0.0007143658,0.00044183468,0.000007852414],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015070768,0.00033308385,0.0035846462,0.0001360212,0.0003221286,0.0000032459457,0.0047081662,0.0015562677,0.027234504,0.026023684,0.00020537533,0.93574214],"study_design_scores_gemma":[0.0013781324,0.00045018707,0.009472202,0.00005505788,0.00020457574,0.00003460566,0.0060894676,0.92342454,0.0059983605,0.051700026,0.0006236353,0.00056922314],"about_ca_topic_score_codex":0.00083362317,"about_ca_topic_score_gemma":0.0000069596995,"teacher_disagreement_score":0.935173,"about_ca_system_score_codex":0.00021196557,"about_ca_system_score_gemma":0.00019351674,"threshold_uncertainty_score":0.99989414},"labels":[],"label_agreement":null},{"id":"W4308091049","doi":"10.1109/ccece49351.2022.9918302","title":"FPGA-Based Designs of the Factorial Function","year":2022,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Field-programmable gate array; Computer science; Factorial; Realization (probability); Function (biology); FLOPS; Logic synthesis; Embedded system; Parallel computing; Logic gate; Algorithm; Mathematics; Statistics","score_opus":0.04423702671045924,"score_gpt":0.26672045141523515,"score_spread":0.22248342470477592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308091049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007937339,0.000005167358,0.99538577,0.000617169,0.0022259764,0.000057949954,0.0000010765023,0.00003403567,0.0008791392],"genre_scores_gemma":[0.69009626,1.2271163e-7,0.30825636,0.0010563849,0.00011655173,0.000016649909,2.7535523e-7,0.0000037040627,0.0004537084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933267,0.00017837608,0.0000801649,0.00010787212,0.00022477341,0.00007614162],"domain_scores_gemma":[0.99957633,0.00010525591,0.000041283205,0.0002411884,0.000016742086,0.000019217834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022431089,0.00003541143,0.000053382933,0.000016220432,0.00012538451,0.000013798589,0.00043354655,0.000007855466,0.00018524972],"category_scores_gemma":[0.000022063314,0.000021285648,0.0000542768,0.000318429,0.000013830374,0.000044664164,0.0001830174,0.00007319972,0.000001984985],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003473749,0.00025840494,0.0006276829,0.0000069515554,0.00001621961,0.0000015289779,0.00018267464,0.004087573,0.028967112,0.19551572,0.0035994642,0.76670194],"study_design_scores_gemma":[0.00170576,0.0018163768,0.015774893,0.0000060553043,0.000024184574,0.0000050638114,0.00008878779,0.44671285,0.16999057,0.14770459,0.2156688,0.00050207524],"about_ca_topic_score_codex":0.000030858653,"about_ca_topic_score_gemma":2.9999762e-7,"teacher_disagreement_score":0.7661999,"about_ca_system_score_codex":0.000016325977,"about_ca_system_score_gemma":0.000043857046,"threshold_uncertainty_score":0.20283546},"labels":[],"label_agreement":null},{"id":"W4308506738","doi":"10.32920/21518007","title":"On the Theory and Design of Polynomial Division Circuits","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Aliasing; Polynomial; Cryptography; Arithmetic function; Division (mathematics); Arithmetic; Mixed-signal integrated circuit; Theoretical computer science; Electronic circuit; Algorithm; Mathematics; Integrated circuit; Telecommunications; Engineering; Discrete mathematics; Electrical engineering","score_opus":0.04665917966233167,"score_gpt":0.29993043207952497,"score_spread":0.2532712524171933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308506738","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012025437,0.00012861067,0.99516183,0.0005900691,0.000573362,0.00025047397,0.0000033787956,0.000040882118,0.0020488559],"genre_scores_gemma":[0.38300166,0.000092764174,0.61397266,0.0015779709,0.00010845743,0.00008861543,0.0000012933243,0.00002282518,0.0011337608],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978816,0.001175957,0.00016992129,0.00038008703,0.0002644702,0.00012796248],"domain_scores_gemma":[0.99630797,0.002873828,0.00011604244,0.0006399634,0.000019030282,0.000043186745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022817366,0.00012903364,0.00019867737,0.000052063326,0.00010426133,0.00007767218,0.0010363067,0.00005513358,0.00018818676],"category_scores_gemma":[0.00022768849,0.00007326008,0.00006421462,0.00011416596,0.000061745784,0.000032688324,0.0024398563,0.00038361776,0.00000260594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006789705,0.00004789216,0.000008454436,0.000011724704,0.000019316287,0.0000030548929,0.00032641581,0.00068493665,0.00027520646,0.4020729,0.0005380107,0.5960053],"study_design_scores_gemma":[0.0001548736,0.00034805504,0.0011167149,0.00004541702,0.0000096545455,0.0000026156088,0.00006791654,0.06655409,0.001922051,0.92894435,0.00055217335,0.000282114],"about_ca_topic_score_codex":0.000018493487,"about_ca_topic_score_gemma":3.0783823e-8,"teacher_disagreement_score":0.5957232,"about_ca_system_score_codex":0.000015958884,"about_ca_system_score_gemma":0.000052883333,"threshold_uncertainty_score":0.30411062},"labels":[],"label_agreement":null},{"id":"W4308507040","doi":"10.32920/21518007.v1","title":"On the Theory and Design of Polynomial Division Circuits","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Aliasing; Polynomial; Arithmetic function; Cryptography; Division (mathematics); Arithmetic; Mixed-signal integrated circuit; Electronic circuit; Theoretical computer science; Algorithm; Mathematics; Integrated circuit; Telecommunications; Engineering; Discrete mathematics; Electrical engineering","score_opus":0.04665917966233167,"score_gpt":0.29993043207952497,"score_spread":0.2532712524171933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308507040","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012025437,0.00012861067,0.99516183,0.0005900691,0.000573362,0.00025047397,0.0000033787956,0.000040882118,0.0020488559],"genre_scores_gemma":[0.38300166,0.000092764174,0.61397266,0.0015779709,0.00010845743,0.00008861543,0.0000012933243,0.00002282518,0.0011337608],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978816,0.001175957,0.00016992129,0.00038008703,0.0002644702,0.00012796248],"domain_scores_gemma":[0.99630797,0.002873828,0.00011604244,0.0006399634,0.000019030282,0.000043186745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022817366,0.00012903364,0.00019867737,0.000052063326,0.00010426133,0.00007767218,0.0010363067,0.00005513358,0.00018818676],"category_scores_gemma":[0.00022768849,0.00007326008,0.00006421462,0.00011416596,0.000061745784,0.000032688324,0.0024398563,0.00038361776,0.00000260594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006789705,0.00004789216,0.000008454436,0.000011724704,0.000019316287,0.0000030548929,0.00032641581,0.00068493665,0.00027520646,0.4020729,0.0005380107,0.5960053],"study_design_scores_gemma":[0.0001548736,0.00034805504,0.0011167149,0.00004541702,0.0000096545455,0.0000026156088,0.00006791654,0.06655409,0.001922051,0.92894435,0.00055217335,0.000282114],"about_ca_topic_score_codex":0.000018493487,"about_ca_topic_score_gemma":3.0783823e-8,"teacher_disagreement_score":0.5957232,"about_ca_system_score_codex":0.000015958884,"about_ca_system_score_gemma":0.000052883333,"threshold_uncertainty_score":0.30411062},"labels":[],"label_agreement":null},{"id":"W4309640194","doi":"10.1109/iemcon56893.2022.9946578","title":"Optimized FPGA-Based Datapath for the Iterative Design for the Factorial Function","year":2022,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Datapath; Field-programmable gate array; Computer science; Logic synthesis; Factorial; Realization (probability); Function (biology); Factorial experiment; Parallel computing; Computer architecture; Embedded system; Algorithm; Logic gate; Mathematics","score_opus":0.08987991328655642,"score_gpt":0.3183921529389845,"score_spread":0.22851223965242806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309640194","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000021895878,0.000049593924,0.99243003,0.0028720866,0.0032592786,0.001251802,0.000039967716,0.00006476595,0.000030307381],"genre_scores_gemma":[0.0024897354,0.000001407745,0.99351966,0.0017247,0.00041810167,0.0014236972,0.000007976961,0.000008436024,0.0004062758],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894464,0.00025589718,0.0001371949,0.00026817096,0.00020324023,0.00019084803],"domain_scores_gemma":[0.9935481,0.005880139,0.00006943034,0.00040814216,0.00006352369,0.000030664312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012903659,0.00009640612,0.00011135554,0.000019338424,0.00096993084,0.00020255677,0.00081451796,0.000015053813,0.00008105812],"category_scores_gemma":[0.00016121488,0.000045106914,0.00011112463,0.00020676253,0.000026372214,0.00015082702,0.00016257272,0.00010132962,0.0000013205254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009441708,0.0001432198,0.000001176019,0.000006285783,0.00010087154,6.3328497e-7,0.00055012305,0.12962611,0.00060659915,0.059106335,0.027275613,0.78163886],"study_design_scores_gemma":[0.0009799625,0.00049614086,0.0000072612547,5.968731e-7,0.00001851572,4.4719604e-7,0.000062133986,0.88810474,0.0011263005,0.0070058927,0.10211881,0.00007922601],"about_ca_topic_score_codex":0.000017565937,"about_ca_topic_score_gemma":2.7471125e-7,"teacher_disagreement_score":0.78155965,"about_ca_system_score_codex":0.000030130335,"about_ca_system_score_gemma":0.00007398015,"threshold_uncertainty_score":0.7460022},"labels":[],"label_agreement":null},{"id":"W4313569974","doi":"","title":"CAMPARY: Cuda Multiple Precision Arithmetic Library and Applications","year":2016,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"CUDA; Computer science; Arithmetic; Parallel computing; Saturation arithmetic; Arbitrary-precision arithmetic; Double-precision floating-point format; Computational science; Mathematics; Algorithm; Computation","score_opus":0.010196513595180012,"score_gpt":0.2226014731006912,"score_spread":0.2124049595055112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313569974","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003148029,0.00047644065,0.97210693,0.01374951,0.00006499674,0.00025799696,0.000011015137,0.00028028476,0.00990477],"genre_scores_gemma":[0.1663821,0.000543931,0.8276356,0.00018681995,0.000026717586,0.00009380374,0.000008987458,0.00002046743,0.005101552],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99685717,0.0018285633,0.00027041865,0.0005647891,0.00022236996,0.00025669392],"domain_scores_gemma":[0.9950002,0.0031231926,0.0001442906,0.001287908,0.00022299941,0.0002214482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013611881,0.0001530968,0.00017601019,0.00010523675,0.00027569677,0.00030025246,0.001031494,0.000070275855,0.00004292703],"category_scores_gemma":[0.0005328594,0.00011306521,0.00006407461,0.00054690125,0.0001616839,0.0008456351,0.0007640262,0.000114005874,0.00004508315],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017542828,0.00012661517,0.0018345689,0.000007877844,0.000006819564,0.0000010244592,0.0003001447,4.6004266e-7,0.005674462,0.18873228,0.00016038402,0.8031536],"study_design_scores_gemma":[0.0021982715,0.0000035559567,0.031218033,0.0010631273,0.000028335908,0.00006137723,0.00005510015,0.07073129,0.27889645,0.1666228,0.44798297,0.0011387012],"about_ca_topic_score_codex":0.00002862268,"about_ca_topic_score_gemma":0.0000068301974,"teacher_disagreement_score":0.8020149,"about_ca_system_score_codex":0.000014746328,"about_ca_system_score_gemma":0.000055534663,"threshold_uncertainty_score":0.46106654},"labels":[],"label_agreement":null},{"id":"W4323074617","doi":"10.1002/spe.3198","title":"Fast number parsing without fallback","year":2023,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Correctness; Computer science; String (physics); Parsing; Rust (programming language); Point (geometry); Algorithm; Function (biology); Binary number; Floating point; Arithmetic; Theoretical computer science; Programming language; Mathematics","score_opus":0.02836546243983597,"score_gpt":0.3547149455127382,"score_spread":0.32634948307290224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323074617","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030620143,0.00017044056,0.96303946,0.0027497176,0.00062924944,0.00011436311,0.0000012680847,0.00073611375,0.0019392576],"genre_scores_gemma":[0.08532005,0.00029822477,0.91210556,0.0016048839,0.0001069589,0.000039896877,0.0000010256651,0.000014087382,0.00050929305],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985845,0.000121286954,0.00016882917,0.00046511804,0.0002907377,0.00036954298],"domain_scores_gemma":[0.9986487,0.00064592087,0.00008948014,0.0003729258,0.00007921078,0.00016374564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037939282,0.00013590736,0.00015347886,0.000037560763,0.00026737718,0.0003070011,0.00040109621,0.00004889568,0.000017857621],"category_scores_gemma":[0.0011286605,0.00011745515,0.000033160548,0.0007352378,0.000100574915,0.0018555329,0.00035713267,0.00016678602,0.0003529316],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014419614,0.00005981247,0.004647052,0.000016745435,0.000014061517,0.00013819258,0.015150635,0.000012350734,0.00040718773,0.00984396,0.0007814475,0.96891415],"study_design_scores_gemma":[0.0009494627,0.0002924282,0.007577952,0.00016183205,0.000033151024,0.0010365125,0.015757527,0.02574945,0.0028841142,0.020063093,0.9239425,0.0015519593],"about_ca_topic_score_codex":0.000065533306,"about_ca_topic_score_gemma":7.861564e-7,"teacher_disagreement_score":0.96736217,"about_ca_system_score_codex":0.000015738677,"about_ca_system_score_gemma":0.00003206203,"threshold_uncertainty_score":0.4789682},"labels":[],"label_agreement":null},{"id":"W4324316870","doi":"10.48550/arxiv.2303.06527","title":"Optimal Control Duality and the Douglas-Rachford Algorithm","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; Australian Government","keywords":"Optimal control; Certificate; Duality (order theory); Mathematical optimization; Mathematics; Dual (grammatical number); Point (geometry); Control (management); Operator (biology); Fixed point; Quadratic equation; Computer science; Algorithm; Discrete mathematics; Artificial intelligence","score_opus":0.08058703082518184,"score_gpt":0.21891496504562977,"score_spread":0.13832793422044792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324316870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005021687,0.00011829882,0.9910538,0.0012076303,0.0014307293,0.00041675929,0.000038615173,0.0003379778,0.00037445303],"genre_scores_gemma":[0.5816422,0.00093138433,0.40952086,0.0009301871,0.000754393,0.000012282787,0.000013214806,0.000065159635,0.006130313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973846,0.0006719489,0.0002494156,0.0011303924,0.0001380357,0.00042558103],"domain_scores_gemma":[0.99730635,0.00091744174,0.00025021605,0.0012070884,0.00012058505,0.00019831499],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013285688,0.000331586,0.00054662646,0.0001156446,0.00028529656,0.00027303255,0.0017877448,0.0002228886,0.000008774559],"category_scores_gemma":[0.00011181481,0.0002578579,0.0002687169,0.00054311816,0.00046840962,0.0002392641,0.0028739995,0.0007940478,0.000055453715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020824205,0.00018776763,0.0008246149,0.00012687556,0.0006780668,0.0010527384,0.0009154313,0.089615986,0.000006413759,0.7726498,0.0007651721,0.13296889],"study_design_scores_gemma":[0.0016340428,0.000036075326,0.00083241076,0.000025303094,0.000072427625,0.0000067483306,0.00006129787,0.8722547,0.0000071042896,0.12350766,0.0012439132,0.0003183118],"about_ca_topic_score_codex":0.00044341883,"about_ca_topic_score_gemma":0.0000051250904,"teacher_disagreement_score":0.7826387,"about_ca_system_score_codex":0.00006451979,"about_ca_system_score_gemma":0.00009289724,"threshold_uncertainty_score":0.99998736},"labels":[],"label_agreement":null},{"id":"W4362583342","doi":"10.3390/s23073683","title":"A New Recursive Trigonometric Technique for FPGA-Design Implementation","year":2023,"lang":"en","type":"article","venue":"Sensors","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"CORDIC; Field-programmable gate array; Lookup table; Trigonometry; Computer science; Trigonometric functions; Algorithm; Waveform; Process (computing); Logic block; Transformation (genetics); Computer hardware; Mathematics","score_opus":0.062452244769170794,"score_gpt":0.3659777004172674,"score_spread":0.30352545564809663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362583342","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030307114,0.00001666802,0.9970567,0.0012933406,0.00028392888,0.0007045425,0.000004933602,0.000233824,0.000102981314],"genre_scores_gemma":[0.001354394,0.000016387547,0.9975663,0.00009863671,0.00011090926,0.00010946165,0.0000037978548,0.000011025638,0.0007290881],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904823,0.00009827634,0.00016655764,0.00028602782,0.00012847027,0.00027243284],"domain_scores_gemma":[0.99908495,0.00047803385,0.0000710482,0.00022089184,0.00004630396,0.000098795426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005590367,0.00009035335,0.00012878927,0.0003380315,0.00007972444,0.00006114752,0.00029909064,0.00003675527,0.00001546583],"category_scores_gemma":[0.0001085913,0.00008072112,0.000071950126,0.0022922829,0.000008723739,0.000114386174,0.000059261638,0.000055300134,0.00005788239],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072545367,0.000009130425,0.000006360478,0.0000066053803,0.000011891002,0.000005599577,0.00021619239,0.00015281756,0.0024634933,0.010788715,0.010803553,0.97552836],"study_design_scores_gemma":[0.001965431,0.0015521382,0.0017673443,0.00003102728,0.000029836954,0.000024592184,0.0007262061,0.065409556,0.40124673,0.43949774,0.086872816,0.00087657984],"about_ca_topic_score_codex":0.000036027228,"about_ca_topic_score_gemma":3.892959e-7,"teacher_disagreement_score":0.9746518,"about_ca_system_score_codex":0.000036868885,"about_ca_system_score_gemma":0.000058342528,"threshold_uncertainty_score":0.32917118},"labels":[],"label_agreement":null},{"id":"W4366087967","doi":"10.3390/appliedmath3020020","title":"A Generalized Series Expansion of the Arctangent Function Based on the Enhanced Midpoint Integration","year":2023,"lang":"en","type":"article","venue":"AppliedMath","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thoth Technology (Canada); York University","funders":"National Research Council Canada; York University","keywords":"Inverse trigonometric functions; Series (stratigraphy); Computation; Series expansion; Mathematics; Midpoint; Function (biology); Generalization; Applied mathematics; Trigonometric functions; Algorithm; Convergence (economics); Numerical integration; Integer (computer science); Taylor series; Mathematical optimization; Computer science; Mathematical analysis; Geometry","score_opus":0.024677146434924226,"score_gpt":0.25492067740690616,"score_spread":0.23024353097198194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366087967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055685848,0.000007788568,0.9391821,0.0036327953,0.00043439248,0.0002919449,0.0000016843007,0.0001136227,0.00064980105],"genre_scores_gemma":[0.92895365,0.000011411386,0.069397554,0.0011820132,0.00006844819,0.00016248753,0.0000028514132,0.000009699265,0.00021186794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990995,0.00012097677,0.00015978492,0.00019941835,0.00028647034,0.00013386704],"domain_scores_gemma":[0.9991931,0.00015167778,0.00009432361,0.00050116016,0.000035423076,0.000024354633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041081238,0.00009365991,0.000106770196,0.00003668378,0.00013529642,0.000038848822,0.00036681507,0.0000291672,0.000013422897],"category_scores_gemma":[0.000043353368,0.00004423958,0.00007533417,0.0006478262,0.00004408808,0.000062764586,0.00010472372,0.00009097645,0.000031039806],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051824056,0.000050381976,0.000005340095,0.000013266378,0.000010324156,6.5395676e-7,0.0006348737,0.0009435509,0.3345835,0.374041,0.00094250374,0.2887228],"study_design_scores_gemma":[0.00032842514,0.00021259334,0.0023855926,0.000059307775,0.000010328955,8.3927e-7,0.00019170178,0.32221234,0.603844,0.06774382,0.0028500345,0.00016102548],"about_ca_topic_score_codex":0.000013912581,"about_ca_topic_score_gemma":0.0000019011089,"teacher_disagreement_score":0.8732678,"about_ca_system_score_codex":0.00001813796,"about_ca_system_score_gemma":0.000027808725,"threshold_uncertainty_score":0.18040377},"labels":[],"label_agreement":null},{"id":"W4375868211","doi":"10.31219/osf.io/9r743","title":"An Alternative Method for the Gamma Function derived from Natural Logarithm and Pi Function","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Factorial; Logarithm; Gamma function; Function (biology); Factorial experiment; Mathematics; Euler's formula; Natural logarithm; Fractional factorial design; Applied mathematics; Pure mathematics; Statistics; Mathematical analysis","score_opus":0.05778114293934835,"score_gpt":0.348013009391659,"score_spread":0.2902318664523107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4375868211","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048249177,0.00039523546,0.98838013,0.0019243967,0.0077537023,0.00062199513,0.00003351005,0.00037094965,0.000037613394],"genre_scores_gemma":[0.008686124,0.00007168654,0.9884262,0.0009988863,0.0010059916,0.00022185215,0.000048804897,0.000027626227,0.00051282515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772185,0.00039337217,0.00027568088,0.001050757,0.00028133747,0.00027698954],"domain_scores_gemma":[0.99690443,0.0018613082,0.00020232108,0.0007448894,0.00018152862,0.0001054992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090729824,0.00029585816,0.00034812765,0.0000885982,0.00024997763,0.0005230967,0.00081224757,0.00018371757,0.000016008304],"category_scores_gemma":[0.00011913632,0.00018674634,0.00014978727,0.00017733115,0.00005607372,0.000294786,0.00093059347,0.00056439487,0.000009586843],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005031498,0.000025586987,0.000020634363,0.0000138293835,0.0001905696,0.0000020894533,0.00021862939,0.000581723,0.0012898571,0.0062429393,0.00027023786,0.9910936],"study_design_scores_gemma":[0.00025809425,0.00017098307,0.008974102,0.000016506167,0.00007930297,0.0000015694945,0.00008553605,0.77267647,0.00070199283,0.21541679,0.0013909647,0.00022771569],"about_ca_topic_score_codex":0.0017637432,"about_ca_topic_score_gemma":0.00006724019,"teacher_disagreement_score":0.9908659,"about_ca_system_score_codex":0.000038365044,"about_ca_system_score_gemma":0.000047213605,"threshold_uncertainty_score":0.7615295},"labels":[],"label_agreement":null},{"id":"W4376473171","doi":"10.1007/978-3-031-32180-1_10","title":"Evaluation of the Use of Low Precision Floating-Point Arithmetic for Applications in Radio Astronomy","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Herzberg Institute of Astrophysics","funders":"","keywords":"Digital signal processing; Computer science; Upgrade; Radio astronomy; Bandwidth (computing); Electromagnetic interference; Millimeter; Signal processing; Computer hardware; Telecommunications; Physics; Astronomy","score_opus":0.07419582912512034,"score_gpt":0.3185929965358885,"score_spread":0.24439716741076817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376473171","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000121471,0.00007185526,0.9974992,0.00020753236,0.000627588,0.0013989793,0.000010667712,0.000023122955,0.00003955345],"genre_scores_gemma":[0.009570953,0.000005387472,0.990165,0.000049484337,0.00008798259,0.00006131636,0.0000020360355,0.00001593361,0.00004193536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701416,0.00013387001,0.0006238594,0.0007668142,0.0011801288,0.00028117112],"domain_scores_gemma":[0.99575263,0.0020751406,0.00045970705,0.001064081,0.00059701543,0.000051406423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033551336,0.00022747176,0.00040700953,0.00045192242,0.000091752074,0.00010153578,0.0018407231,0.00012937342,0.0000023504476],"category_scores_gemma":[0.000709287,0.00016493307,0.00014849102,0.0010217882,0.00037008015,0.00026965883,0.00070314715,0.0003022756,0.0000012243289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013095004,0.000024358094,0.000033093194,0.00002585033,0.000004135235,1.4726743e-7,0.00017682009,0.12868057,0.00012937354,0.003256101,0.0000018246108,0.8676664],"study_design_scores_gemma":[0.0002050694,0.00007624682,0.0006372777,0.0003560577,0.000013051426,0.0000013531509,2.2261402e-7,0.8215513,0.002470474,0.17431942,0.0002208142,0.00014869787],"about_ca_topic_score_codex":0.000026772277,"about_ca_topic_score_gemma":0.000021182715,"teacher_disagreement_score":0.8675177,"about_ca_system_score_codex":0.00018709784,"about_ca_system_score_gemma":0.0005251013,"threshold_uncertainty_score":0.67257756},"labels":[],"label_agreement":null},{"id":"W4377018777","doi":"10.33774/coe-2023-wv4rc-v4","title":"An Alternative Method for the Gamma Function derived from Natural Logarithm and Pi Function","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Factorial; Logarithm; Gamma function; Function (biology); Factorial experiment; Mathematics; Euler's formula; Natural logarithm; Fractional factorial design; Applied mathematics; Pure mathematics; Statistics; Mathematical analysis","score_opus":0.05778114293934835,"score_gpt":0.348013009391659,"score_spread":0.2902318664523107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377018777","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048249177,0.00039523546,0.98838013,0.0019243967,0.0077537023,0.00062199513,0.00003351005,0.00037094965,0.000037613394],"genre_scores_gemma":[0.008686124,0.00007168654,0.9884262,0.0009988863,0.0010059916,0.00022185215,0.000048804897,0.000027626227,0.00051282515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772185,0.00039337217,0.00027568088,0.001050757,0.00028133747,0.00027698954],"domain_scores_gemma":[0.99690443,0.0018613082,0.00020232108,0.0007448894,0.00018152862,0.0001054992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090729824,0.00029585816,0.00034812765,0.0000885982,0.00024997763,0.0005230967,0.00081224757,0.00018371757,0.000016008304],"category_scores_gemma":[0.00011913632,0.00018674634,0.00014978727,0.00017733115,0.00005607372,0.000294786,0.00093059347,0.00056439487,0.000009586843],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005031498,0.000025586987,0.000020634363,0.0000138293835,0.0001905696,0.0000020894533,0.00021862939,0.000581723,0.0012898571,0.0062429393,0.00027023786,0.9910936],"study_design_scores_gemma":[0.00025809425,0.00017098307,0.008974102,0.000016506167,0.00007930297,0.0000015694945,0.00008553605,0.77267647,0.00070199283,0.21541679,0.0013909647,0.00022771569],"about_ca_topic_score_codex":0.0017637432,"about_ca_topic_score_gemma":0.00006724019,"teacher_disagreement_score":0.9908659,"about_ca_system_score_codex":0.000038365044,"about_ca_system_score_gemma":0.000047213605,"threshold_uncertainty_score":0.7615295},"labels":[],"label_agreement":null},{"id":"W4380787291","doi":"10.1090/stml/104/04","title":"Introduction to congruence arithmetic","year":2023,"lang":"en","type":"book-chapter","venue":"Student mathematical library","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Congruence (geometry); Arithmetic; Mathematics; Computer science; Algebra over a field; Pure mathematics; Geometry","score_opus":0.02096316968295584,"score_gpt":0.2816607727206539,"score_spread":0.260697603037698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380787291","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000031074662,0.00006058341,0.5087931,0.017310468,0.0014272964,0.0005921677,0.000014947415,0.0010436099,0.4707547],"genre_scores_gemma":[0.0000057252873,0.00003567901,0.39189157,0.0006981833,0.0012182244,0.00003727313,0.0000066267535,0.00006989275,0.60603684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973812,0.000045098615,0.00054787064,0.0008773855,0.00077315053,0.00037531016],"domain_scores_gemma":[0.9980533,0.00040793046,0.00013168107,0.0010283829,0.000037033697,0.00034164469],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027962137,0.000381603,0.0006052608,0.00022060524,0.00006833416,0.00042459604,0.0016180942,0.00017437049,0.0007079862],"category_scores_gemma":[0.000104562394,0.00031430266,0.00018789092,0.00022687564,0.000084493324,0.0004619999,0.0016955802,0.00042693276,0.008682121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016063817,0.00004057697,7.997475e-7,0.00006558424,0.00003998658,0.00006471423,0.00009922665,0.0000022137096,0.000007999694,0.94299805,0.028315835,0.028363412],"study_design_scores_gemma":[0.000069551854,0.00014441986,0.000025753186,0.00016747418,0.000020651278,0.00001761032,0.000007096096,0.0005630417,0.000046018446,0.8115107,0.18702826,0.00039943116],"about_ca_topic_score_codex":3.2195922e-7,"about_ca_topic_score_gemma":4.3731742e-8,"teacher_disagreement_score":0.15871243,"about_ca_system_score_codex":0.000026450089,"about_ca_system_score_gemma":0.000051558167,"threshold_uncertainty_score":0.9999309},"labels":[],"label_agreement":null},{"id":"W4383749590","doi":"10.1109/fccm57271.2023.00030","title":"Designing a configurable IEEE-compliant FPU that supports variable precision for soft processors","year":2023,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Xilinx; Intel Corporation","keywords":"Computer science; Field-programmable gate array; Throughput; Embedded system; Floating point; Latency (audio); Implementation; Pipeline transport; Computer hardware; Operating system; Wireless; Engineering","score_opus":0.06201858391409828,"score_gpt":0.3183571542873503,"score_spread":0.25633857037325203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383749590","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021989548,0.00002410799,0.9940698,0.0006433205,0.00069334864,0.0004821181,0.000004083362,0.00061808346,0.0032452312],"genre_scores_gemma":[0.008385666,0.000008544267,0.98136467,0.00037989017,0.000075072676,0.00016211109,0.000004439267,0.000020899855,0.00959873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981838,0.00006407677,0.00025389186,0.00058056327,0.00032184235,0.0005958147],"domain_scores_gemma":[0.9983841,0.0008323477,0.00009656012,0.00039908334,0.00011933708,0.00016856371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011932044,0.00017372963,0.0002678417,0.000114456474,0.0002516189,0.0002807147,0.000687425,0.00007009468,0.00008413018],"category_scores_gemma":[0.00017251851,0.00013241365,0.00007977296,0.000892959,0.000025806268,0.00050234096,0.00011970252,0.000098460485,0.00012178193],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050295937,0.0002418798,0.00028138584,0.0002992374,0.000074848154,0.000073633775,0.001010066,0.0027836016,0.05993993,0.039569195,0.06895592,0.82672],"study_design_scores_gemma":[0.00058949884,0.00028212726,0.00015268069,0.00010005173,0.000011720039,0.00002579664,0.000112132635,0.7011515,0.12162508,0.13375327,0.041717187,0.00047893485],"about_ca_topic_score_codex":0.000027945594,"about_ca_topic_score_gemma":4.690886e-7,"teacher_disagreement_score":0.8262411,"about_ca_system_score_codex":0.00002190443,"about_ca_system_score_gemma":0.00010812653,"threshold_uncertainty_score":0.5399672},"labels":[],"label_agreement":null},{"id":"W4384828140","doi":"10.21203/rs.3.rs-3135514/v1","title":"Predictive Biomarker Profiles in Cancer Using a Unique AI Model Based on Set Theory","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; McGill University Health Centre","funders":"","keywords":"Identification (biology); Biomarker; Outcome (game theory); Cancer; Set (abstract data type); Computer science; Artificial intelligence; Biomarker discovery; Machine learning; Computational biology; Medicine; Internal medicine; Mathematics; Biology; Proteomics","score_opus":0.2520936272897684,"score_gpt":0.503769002380663,"score_spread":0.2516753750908946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384828140","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002774522,0.00014247754,0.9921314,0.0023716595,0.00029376632,0.0013613469,0.00035655816,0.00021156881,0.0003566647],"genre_scores_gemma":[0.39509,0.00029559093,0.5988141,0.0006712998,0.00040171406,0.003401249,0.00008164896,0.00019856599,0.0010458505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931794,0.0030546545,0.00033265015,0.0012190301,0.0013556877,0.000858595],"domain_scores_gemma":[0.9965883,0.0014552199,0.00009117302,0.001168999,0.000472089,0.00022420063],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005732266,0.0003013965,0.0004079151,0.001035725,0.00017372561,0.00028923596,0.0015247271,0.00034165476,0.000022037178],"category_scores_gemma":[0.0007055426,0.00025067283,0.00014823623,0.001634484,0.00019230292,0.0001585419,0.0023734062,0.0021745977,0.000014701192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031568843,0.0004549351,0.0017461899,0.0013110759,0.00008521464,0.00032673313,0.0015848005,0.8414563,0.000676281,0.020767588,0.0011840577,0.13009112],"study_design_scores_gemma":[0.00018339787,0.00010529468,0.0014826026,0.001574782,0.0000026775112,3.9228271e-7,0.00005449685,0.8629218,0.00045007208,0.13294554,0.000050967355,0.00022798705],"about_ca_topic_score_codex":0.0011721165,"about_ca_topic_score_gemma":0.000025820753,"teacher_disagreement_score":0.39331737,"about_ca_system_score_codex":0.00069781387,"about_ca_system_score_gemma":0.0019379476,"threshold_uncertainty_score":0.9999946},"labels":[],"label_agreement":null},{"id":"W4386068295","doi":"10.28924/2291-8639-21-2023-87","title":"A Symbolic Algorithm for Solving Doubly Bordered k-Tridiagonal Interval Linear Systems","year":2023,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tridiagonal matrix; Interval (graph theory); Tridiagonal matrix algorithm; Algorithm; Interval arithmetic; Computation; Mathematics; Divide and conquer algorithms; Computer science; Algebra over a field; Pure mathematics","score_opus":0.023516237977498588,"score_gpt":0.3436594488449571,"score_spread":0.3201432108674585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386068295","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011471681,0.00024074774,0.99656826,0.0014561479,0.00032288994,0.00015169902,0.00004152759,0.00003516471,0.000036406414],"genre_scores_gemma":[0.14462999,0.0006238855,0.8517981,0.0002555447,0.0020050302,0.0002687731,0.00004246822,0.000018843846,0.00035734978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986466,0.000035290217,0.0005427486,0.00021853481,0.00039764473,0.00015918749],"domain_scores_gemma":[0.99823904,0.0003446906,0.00038993236,0.00016788162,0.0007330441,0.00012538224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069998915,0.00010478965,0.00030605006,0.00065217994,0.00011034073,0.00027241174,0.0007980042,0.000040105984,0.000004841042],"category_scores_gemma":[0.000053257,0.00008588915,0.0003184174,0.0011874421,0.00003471409,0.00025954872,0.00014453224,0.00011360558,0.000006710821],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000079873835,0.00011685203,0.00039477486,0.000008204404,0.0018655292,0.000011997264,0.00013707847,0.0023329658,0.00065374054,0.030104972,0.00045440136,0.9639115],"study_design_scores_gemma":[0.0004579238,0.00006811002,0.0016055363,0.000020981515,0.00021485167,0.00004776126,0.00009807002,0.95108336,0.0002497596,0.0067217723,0.03929032,0.00014152772],"about_ca_topic_score_codex":0.000030735937,"about_ca_topic_score_gemma":0.0000015119232,"teacher_disagreement_score":0.96377,"about_ca_system_score_codex":0.000032888503,"about_ca_system_score_gemma":0.00005529442,"threshold_uncertainty_score":0.3502458},"labels":[],"label_agreement":null},{"id":"W4386248611","doi":"10.1017/9781009303897.003","title":"Numbers","year":2023,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Multipole expansion; Legendre polynomials; Recursion (computer science); Rounding; Set (abstract data type); Variety (cybernetics); Representation (politics); Series (stratigraphy); Electromagnetism; Computer science; Applied mathematics; Algebra over a field; Calculus (dental); Mathematics; Theoretical physics; Algorithm; Pure mathematics; Physics; Mathematical analysis; Artificial intelligence; Quantum mechanics; Programming language","score_opus":0.0364773823564095,"score_gpt":0.2296667590256715,"score_spread":0.193189376669262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386248611","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.540772e-7,0.000022067235,0.16335335,0.00004267941,0.0007054537,0.00015334213,0.000046518395,0.000532726,0.8351431],"genre_scores_gemma":[0.0000051243205,0.000061435676,0.025512312,0.000097829434,0.00013262557,4.199139e-7,0.0000064565643,0.000039379207,0.9741444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984717,0.00004649946,0.0001548705,0.00066929817,0.00032924404,0.00032840745],"domain_scores_gemma":[0.9985243,0.00014660608,0.00015864648,0.00084137515,0.00009689121,0.00023216465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013934037,0.0003138611,0.00037011362,0.0001568997,0.00016275771,0.0000951419,0.0014966247,0.00026351048,0.0000020659734],"category_scores_gemma":[0.000011812097,0.0003533055,0.00025259855,0.000022088312,0.00014143182,0.00012985656,0.0011096819,0.00045190964,0.00014440416],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004081814,0.000003028789,1.457594e-7,0.000019455958,0.000053961132,0.00051016343,0.000015494701,9.454133e-7,0.000007651001,0.94661695,0.02392582,0.028842311],"study_design_scores_gemma":[0.00020420749,0.00003654043,0.00000481056,0.00007205699,0.0000381639,0.000012093341,0.000004906906,0.0008097499,0.0000782492,0.00041474335,0.99788815,0.00043634523],"about_ca_topic_score_codex":0.000091317415,"about_ca_topic_score_gemma":3.6498116e-7,"teacher_disagreement_score":0.9739623,"about_ca_system_score_codex":0.00010459033,"about_ca_system_score_gemma":0.00008146281,"threshold_uncertainty_score":0.9998919},"labels":[],"label_agreement":null},{"id":"W4386297689","doi":"10.1007/978-3-031-42753-4_8","title":"Teaching Linear Algebra in a Mechanized Mathematical Environment","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; Western University","funders":"","keywords":"Python (programming language); Linear algebra; Computer science; Algebra over a field; Maple; MATLAB; Symbolic computation; Mathematics education; Programming language; Software engineering; Mathematics; Pure mathematics; Geometry","score_opus":0.02543426211771828,"score_gpt":0.27545338647031814,"score_spread":0.2500191243525999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386297689","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025454327,0.00006776711,0.9959854,0.0013123563,0.0008132124,0.00036153928,0.000002317148,0.00019875621,0.0012332284],"genre_scores_gemma":[0.0015631415,0.000027233553,0.9965593,0.0007553755,0.00030319326,0.000016891014,0.000001419,0.00004614831,0.0007272954],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99579567,0.000111189365,0.0006576321,0.0015723018,0.0010977953,0.00076543237],"domain_scores_gemma":[0.99729806,0.0010730171,0.00019916135,0.0011921969,0.00003145489,0.00020611653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023642713,0.00050342374,0.00071476493,0.00076699746,0.00016439702,0.00025562383,0.0028450114,0.00028838147,0.000033744498],"category_scores_gemma":[0.00021330162,0.00042749254,0.00014808874,0.00049297424,0.00031705925,0.00032217984,0.0021388135,0.0013975278,0.0002767604],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022837826,0.0000468539,0.000002460317,0.00003313969,0.000006139191,0.00021008187,0.0005774764,0.0037209077,0.00019841843,0.1283442,0.0000022838126,0.86685574],"study_design_scores_gemma":[0.0001489784,0.00007589762,0.0000074413515,0.00020950712,0.000002433179,0.000021234719,1.4210016e-7,0.49720198,0.00025727277,0.5014173,0.00033923352,0.00031862638],"about_ca_topic_score_codex":0.000025005638,"about_ca_topic_score_gemma":0.000004774419,"teacher_disagreement_score":0.86653715,"about_ca_system_score_codex":0.00027038064,"about_ca_system_score_gemma":0.00015974276,"threshold_uncertainty_score":0.99981767},"labels":[],"label_agreement":null},{"id":"W4386986665","doi":"10.3850/978-981-18-8071-1_p672-cd","title":"On the Construction of Numerical Models through a Prime Convolutional Approach","year":2023,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Commission; Canadian Institute of Steel Construction","keywords":"Modulo; Computer science; Congruence (geometry); Prime factor; Convolutional neural network; Representation (politics); Prime (order theory); Set (abstract data type); Integer (computer science); Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Discrete mathematics; Programming language; Combinatorics","score_opus":0.06688757919077966,"score_gpt":0.2875273924641743,"score_spread":0.22063981327339466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386986665","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006509585,0.0000074569507,0.98011905,0.001738012,0.00016300406,0.00009405954,0.0000017771503,0.00013263266,0.01709306],"genre_scores_gemma":[0.12114432,0.0000051276706,0.8782726,0.00031978684,0.000032636333,0.000016554633,0.0000011462408,0.0000037916764,0.00020406157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991048,0.00010773477,0.0001464812,0.00021211039,0.00027719414,0.00015169683],"domain_scores_gemma":[0.99924725,0.00035888783,0.000050877763,0.00026982484,0.000043526557,0.00002960044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026704595,0.00006962991,0.000115836054,0.000028127688,0.00007682617,0.000023632676,0.00036473418,0.000030215027,0.000022966746],"category_scores_gemma":[0.0000457279,0.00003968568,0.000060945793,0.00067927677,0.00011183418,0.00016552002,0.00012742092,0.00009382016,0.000039726296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001496786,0.00003074804,0.0000060057732,0.000001784323,0.0000074934333,2.8575639e-7,0.00007899792,0.0009923697,0.00007438774,0.9839956,0.00044387614,0.014366965],"study_design_scores_gemma":[0.00005388463,0.00003157716,0.000089779474,0.0000020684843,9.48593e-7,0.000004724168,0.000030234669,0.6114477,0.00045653404,0.38767242,0.0001703603,0.000039791852],"about_ca_topic_score_codex":0.000022447945,"about_ca_topic_score_gemma":1.4586491e-8,"teacher_disagreement_score":0.61045533,"about_ca_system_score_codex":0.000011739003,"about_ca_system_score_gemma":0.000034165383,"threshold_uncertainty_score":0.16183352},"labels":[],"label_agreement":null},{"id":"W4387260750","doi":"10.23952/jnva.7.2023.5.09","title":"Fréchet subdifferential calculus for interval-valued functions and its applications in nonsmooth interval optimization","year":2023,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Subderivative; Interval (graph theory); Mathematics; Calculus (dental); Applied mathematics; Mathematical optimization; Pure mathematics; Regular polygon; Combinatorics; Medicine; Convex optimization; Geometry","score_opus":0.026272807803175938,"score_gpt":0.31612973782345194,"score_spread":0.289856930020276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387260750","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013267196,0.0000699481,0.9852859,0.0011219674,0.000103233804,0.000090773414,0.000038937993,0.000013029274,0.000009051095],"genre_scores_gemma":[0.18572551,0.00013575735,0.81322324,0.00010780778,0.00042898775,0.0000305094,0.000096372896,0.000011049566,0.00024077183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999012,0.000081944185,0.00042113822,0.00017872883,0.00018819148,0.00011797549],"domain_scores_gemma":[0.9990365,0.00032452983,0.00021554613,0.00008119403,0.0002526564,0.0000895804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057002244,0.00008844274,0.00027539596,0.0005655448,0.000103709805,0.00009698219,0.00016017251,0.000045916833,0.000015241756],"category_scores_gemma":[0.00015081449,0.000069631606,0.00016750734,0.001409322,0.0000154929,0.00026382526,0.000078459154,0.00010711964,0.0000011716029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042086066,0.0023157622,0.03341524,0.00024874278,0.0072738007,0.00003254715,0.0034709396,0.6075796,0.0021509796,0.14582328,0.00062815426,0.19664012],"study_design_scores_gemma":[0.00039442652,0.000078128265,0.015961992,0.000007766662,0.00022509559,0.0000053771273,0.000044183213,0.9812794,0.000020644851,0.0016200485,0.00028729608,0.00007564793],"about_ca_topic_score_codex":0.000012093606,"about_ca_topic_score_gemma":0.000007960138,"teacher_disagreement_score":0.3736998,"about_ca_system_score_codex":0.00002347094,"about_ca_system_score_gemma":0.000043603213,"threshold_uncertainty_score":0.28394943},"labels":[],"label_agreement":null},{"id":"W4389387126","doi":"10.1109/iccs59700.2023.10335508","title":"High Performance and Energy Efficient Floating-Point Multiplier on FPGA","year":2023,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Qingdao","keywords":"Multiplier (economics); Double-precision floating-point format; Field-programmable gate array; Computer science; Single-precision floating-point format; Computer hardware; Floating point; Embedded system; Digital signal processing; Energy consumption; Virtex; Algorithm; Engineering; Electrical engineering","score_opus":0.015254500720810788,"score_gpt":0.24867582358008872,"score_spread":0.23342132285927794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389387126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17201585,0.000010147105,0.82280266,0.001145442,0.00056202675,0.00003714255,6.876937e-7,0.000372177,0.0030538898],"genre_scores_gemma":[0.61704504,0.000025920128,0.37970287,0.0007239708,0.00008031183,0.000008392892,6.4295426e-7,0.000007882136,0.0024049855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990957,0.000038010337,0.00012525656,0.00031217825,0.00018791498,0.00024099086],"domain_scores_gemma":[0.9994254,0.00016872001,0.000028586577,0.00026481916,0.000022381448,0.00009007324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025500418,0.00009701018,0.00011205563,0.00007507325,0.000117206146,0.00006926673,0.00024137444,0.000027181586,0.000014580998],"category_scores_gemma":[0.000032843458,0.00006882948,0.000022786337,0.0004424019,0.000028012722,0.00006727907,0.00024782232,0.00006545562,0.00009406928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023860061,0.000030302892,0.000037679605,0.0000051229736,0.0000035758378,0.000006229513,0.00010695159,0.005420287,0.0006304577,0.039689533,0.00045174392,0.9536157],"study_design_scores_gemma":[0.0001862107,0.00014221737,0.004345104,0.000012035156,8.6398717e-7,0.0000026542457,0.00001255777,0.9777863,0.012800314,0.0009001487,0.0036805968,0.00013101668],"about_ca_topic_score_codex":0.000047638307,"about_ca_topic_score_gemma":4.0941137e-7,"teacher_disagreement_score":0.972366,"about_ca_system_score_codex":0.000011986309,"about_ca_system_score_gemma":0.000008605325,"threshold_uncertainty_score":0.28067848},"labels":[],"label_agreement":null},{"id":"W4390055465","doi":"10.18280/mmep.100636","title":"Implementing Interval Linear Equations Systems for Enhanced Circuit Analysis","year":2023,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Network analysis; Computer science; Linear circuit; Interval (graph theory); Mathematics; Equivalent circuit; Electrical engineering; Engineering; Voltage; Combinatorics","score_opus":0.07300491375540492,"score_gpt":0.2948277919037262,"score_spread":0.2218228781483213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390055465","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016196513,0.00007973445,0.9973959,0.000074125506,0.000108959,0.00022995441,0.0000044261656,0.0004200811,0.00006722054],"genre_scores_gemma":[0.3690217,0.000023724926,0.6305076,0.000007171655,0.00006743519,0.00018579216,0.0000068426502,0.00001894454,0.00016082151],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871314,0.000017536455,0.00036596594,0.0003044637,0.00015873107,0.00044014084],"domain_scores_gemma":[0.99896795,0.00059055124,0.00005412524,0.00022987483,0.00005293389,0.000104590115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097553566,0.00013531232,0.00030809068,0.00021031956,0.00012515146,0.0001776805,0.00022429303,0.00004544034,0.0000023558646],"category_scores_gemma":[0.00010047139,0.000118102806,0.0001174671,0.0008681175,0.000010039387,0.0001237717,0.0001206249,0.00009132576,0.000010821072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.4957498e-7,0.000011775851,8.367988e-7,0.00025681785,0.000094670344,3.8631643e-7,0.00038687157,0.87145674,0.00042453592,0.124392025,0.0000026510943,0.002972416],"study_design_scores_gemma":[0.0000920128,0.000028111841,0.0000010707671,0.00007172193,0.000057038458,8.8160726e-7,0.000022570615,0.9681996,0.00013082044,0.031020913,0.00022897928,0.00014627523],"about_ca_topic_score_codex":0.000007372673,"about_ca_topic_score_gemma":8.839341e-8,"teacher_disagreement_score":0.36740205,"about_ca_system_score_codex":0.000013579283,"about_ca_system_score_gemma":0.0000065231307,"threshold_uncertainty_score":0.48160926},"labels":[],"label_agreement":null},{"id":"W4390846317","doi":"10.1007/978-3-031-42478-6_24","title":"A Review of Posit Arithmetic for Energy-Efficient Computation: Methodologies, Applications, and Challenges","year":2023,"lang":"en","type":"review","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Rounding; Computer science; Floating point; Computation; Range (aeronautics); Computer engineering; Point (geometry); Representation (politics); Computer architecture; Computer hardware; Theoretical computer science; Arithmetic; Algorithm; Engineering","score_opus":0.35806147755987094,"score_gpt":0.4591130289443622,"score_spread":0.10105155138449123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390846317","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.3522705e-11,0.50095236,0.49788713,0.00030470232,0.00006555074,0.00061615586,0.000009289945,0.00008059928,0.000084181636],"genre_scores_gemma":[2.8907557e-10,0.517196,0.48196772,0.000095147625,0.000033104196,0.0006433244,0.000008409977,0.00001194676,0.000044364384],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99759597,0.0005590121,0.0007718544,0.00066824653,0.00018810901,0.00021683803],"domain_scores_gemma":[0.99496096,0.0037927309,0.0004826283,0.000517877,0.0001586172,0.00008717242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017889413,0.00028599787,0.0017648895,0.00016434836,0.00006375298,0.000037701808,0.0007359013,0.00012617563,0.0000015281493],"category_scores_gemma":[0.00023913333,0.00019954889,0.00033739768,0.0007690358,0.000061989995,0.000035181638,0.0004195692,0.00010359343,0.000004536152],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.0963711e-7,0.000016473143,7.542793e-10,0.12749752,0.00004125872,3.658757e-7,0.000003090553,9.421347e-7,1.45389185e-8,0.07680289,0.00013092735,0.7955064],"study_design_scores_gemma":[0.00004507695,0.00006929809,9.114677e-8,0.030346626,0.00019582105,0.000020280493,0.0000031859927,0.002939945,5.442823e-7,0.010275721,0.95588344,0.00021996554],"about_ca_topic_score_codex":0.000006370867,"about_ca_topic_score_gemma":2.234842e-7,"teacher_disagreement_score":0.9557525,"about_ca_system_score_codex":0.000026680425,"about_ca_system_score_gemma":0.00011047442,"threshold_uncertainty_score":0.81373674},"labels":[],"label_agreement":null},{"id":"W4391935804","doi":"10.1109/tetc.2024.3365650","title":"A Design Framework for Hardware-Efficient Logarithmic Floating-Point Multipliers","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Computer science; Logarithm; Parallel computing; Floating point; Point (geometry); Field-programmable gate array; Computer hardware; Computational science; Embedded system; Algorithm; Mathematics","score_opus":0.04551023257329208,"score_gpt":0.3369960229184239,"score_spread":0.29148579034513183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391935804","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005555441,0.00010704998,0.9921524,0.001538978,0.004718989,0.00042447625,0.0000027879814,0.00045672542,0.000043033506],"genre_scores_gemma":[0.1903375,0.0000073457754,0.80920255,0.00017563101,0.00018453802,0.00002523124,2.2300213e-7,0.00002163756,0.00004532883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980792,0.00014515656,0.00041350498,0.00064721046,0.00024011095,0.0004748347],"domain_scores_gemma":[0.9978875,0.0015513785,0.00005505716,0.0003685532,0.00004935806,0.00008818131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092766166,0.00021517684,0.00024069988,0.00030730883,0.00031027835,0.00023937805,0.00049788866,0.00011078997,0.0000070680903],"category_scores_gemma":[0.00005930262,0.00021181274,0.00016292733,0.00081914244,0.000039493036,0.00011109416,0.0000105424,0.00060894975,0.000010545822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000403609,0.000064035456,0.0000011084306,0.000041376676,0.00001659401,0.000012817454,0.0012737833,0.47886539,0.00010881173,0.0077671134,0.000013051468,0.5118319],"study_design_scores_gemma":[0.00019205923,0.0000974513,0.000008477297,0.00036756243,0.000008696036,0.000007948211,0.00006052069,0.97981316,0.0036743586,0.014910405,0.00061853975,0.00024081637],"about_ca_topic_score_codex":0.000021240923,"about_ca_topic_score_gemma":0.0000010714923,"teacher_disagreement_score":0.5115911,"about_ca_system_score_codex":0.00016172067,"about_ca_system_score_gemma":0.00007011569,"threshold_uncertainty_score":0.86374736},"labels":[],"label_agreement":null},{"id":"W4392759659","doi":"10.5194/egusphere-egu24-13330","title":"An improved Copula-Based Framework for Efficient Global Sensitivity Analysis","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Calgary; University of Alberta","funders":"","keywords":"Copula (linguistics); Sensitivity (control systems); Econometrics; Computer science; Economics; Engineering","score_opus":0.023194804921752625,"score_gpt":0.3603589878813745,"score_spread":0.33716418295962186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392759659","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021366498,0.00009206946,0.9927437,0.0014469168,0.0020308879,0.0005548649,0.00021771833,0.0006433623,0.00013385808],"genre_scores_gemma":[0.20269775,7.107038e-7,0.7963933,0.00057713484,0.00020418923,0.000065672575,0.000026473752,0.000013412513,0.000021356851],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681085,0.00032793268,0.0003960837,0.0016113062,0.00036753775,0.00048629605],"domain_scores_gemma":[0.9970497,0.0005355549,0.00016387655,0.0017520142,0.00019841772,0.00030045942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012957264,0.00040001373,0.00074782193,0.0001747563,0.00010537599,0.00079192437,0.00089996663,0.0003958227,0.000013443874],"category_scores_gemma":[0.00018681619,0.00032067293,0.0008614179,0.0015453531,0.00005607177,0.000034825433,0.0012622696,0.00058585446,0.000014619483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032801792,0.000645739,0.00019141591,0.00032833914,0.0011634264,0.000067632885,0.00009161931,0.23846827,0.00024213867,0.22676434,0.000110051194,0.5318942],"study_design_scores_gemma":[0.00007384614,0.00008573474,0.00035010916,0.000035310615,0.0003232304,8.568238e-7,0.00000539145,0.84205467,0.0004308751,0.15620169,0.0000735928,0.00036470432],"about_ca_topic_score_codex":0.00040345694,"about_ca_topic_score_gemma":0.000028829287,"teacher_disagreement_score":0.6035864,"about_ca_system_score_codex":0.00018750153,"about_ca_system_score_gemma":0.000256889,"threshold_uncertainty_score":0.99992454},"labels":[],"label_agreement":null},{"id":"W4392849806","doi":"10.1145/3650036","title":"Designing an IEEE-Compliant FPU that Supports Configurable Precision for Soft Processors","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Field-programmable gate array; Single-precision floating-point format; Scalability; Lookup table; Latency (audio); Floating point; Parallel computing; Embedded system; Computer hardware; Algorithm; Operating system","score_opus":0.048089707626656666,"score_gpt":0.30750307460928855,"score_spread":0.2594133669826319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392849806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020994104,0.0016784337,0.990088,0.0017560527,0.0018947688,0.00084647274,0.00002547946,0.0012040223,0.0004073814],"genre_scores_gemma":[0.85428864,0.00018629876,0.1417605,0.000093917035,0.000058393583,0.000784739,0.00000460952,0.000045805595,0.0027771345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978055,0.00011219381,0.00042080486,0.00093435246,0.00019702913,0.0005301551],"domain_scores_gemma":[0.99812335,0.0006594071,0.00009782922,0.0008563391,0.00010809614,0.00015498362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008996158,0.00029416688,0.00044779584,0.0006822021,0.00053646386,0.00046361983,0.00084824266,0.00037111656,0.000031176805],"category_scores_gemma":[0.0000518872,0.00024328275,0.00009840638,0.0008715969,0.0001228182,0.00073333323,0.0000066097496,0.00044306787,0.00003057547],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002884648,0.00012341942,0.00001788567,0.00035192916,0.000102545215,0.000041783114,0.00026956256,0.000658692,0.011679003,0.011327715,0.00025108474,0.97514755],"study_design_scores_gemma":[0.0011285596,0.0025803405,0.000031488387,0.001548313,0.0001292843,0.001509856,0.0016702036,0.46673396,0.31383082,0.15690751,0.052525356,0.0014043157],"about_ca_topic_score_codex":0.00003325801,"about_ca_topic_score_gemma":0.0000037831317,"teacher_disagreement_score":0.9737432,"about_ca_system_score_codex":0.00004500408,"about_ca_system_score_gemma":0.000104478575,"threshold_uncertainty_score":0.99207824},"labels":[],"label_agreement":null},{"id":"W4393159133","doi":"10.1609/aaai.v38i8.28650","title":"An Approximate Skolem Function Counter","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Function (biology); Physics; Mathematics; Biology","score_opus":0.06802914258940301,"score_gpt":0.3278646981445455,"score_spread":0.2598355555551425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393159133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015516199,0.00007138475,0.9689971,0.0036202704,0.0018705827,0.00031763437,0.0000055798537,0.00036213585,0.009239101],"genre_scores_gemma":[0.96613413,0.000022915212,0.033119775,0.0002830721,0.0001618022,0.000025273052,3.343992e-7,0.00001438894,0.00023830429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982775,0.000023983435,0.00038980733,0.00056538027,0.0004410066,0.0003023417],"domain_scores_gemma":[0.99907905,0.000074030526,0.00012374733,0.0003023021,0.00032144063,0.00009944915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005838459,0.00019565344,0.00019715818,0.0001128331,0.00014064055,0.00071870507,0.0015242299,0.000073640855,0.00007786845],"category_scores_gemma":[0.00008968435,0.00012971285,0.000113030386,0.00077844405,0.00017117089,0.00079049746,0.00020100454,0.00030460645,0.000127426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013205367,0.00005873956,0.000009972885,0.00003079832,0.000008185035,4.7164372e-7,0.00033693243,0.000009911793,0.026303483,0.6461673,0.00008345584,0.32697758],"study_design_scores_gemma":[0.000007774586,0.0002754615,0.00004485095,0.00015851847,0.0000102380345,0.000004443588,0.00015949477,0.41240415,0.1723737,0.41352186,0.00088106276,0.0001584528],"about_ca_topic_score_codex":0.000017865674,"about_ca_topic_score_gemma":9.478372e-7,"teacher_disagreement_score":0.9506179,"about_ca_system_score_codex":0.00003306527,"about_ca_system_score_gemma":0.00006184436,"threshold_uncertainty_score":0.69304895},"labels":[],"label_agreement":null},{"id":"W4393443200","doi":"10.23952/jano.6.2024.2.02","title":"Generalized Hukuhara Dini Hadamard $\\epsilon$-subdifferential and $H_{\\epsilon}$-subgradient and their applications in interval optimization","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Board","keywords":"Subgradient method; Subderivative; Hadamard transform; Mathematics; Interval (graph theory); Pure mathematics; Applied mathematics; Mathematical analysis; Mathematical optimization; Regular polygon; Convex optimization; Combinatorics; Geometry","score_opus":0.01156842082400594,"score_gpt":0.2540222144213252,"score_spread":0.24245379359731928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393443200","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008382664,0.001132115,0.988988,0.0008979573,0.0001948747,0.000233662,0.0000035637388,0.000042938747,0.00012425544],"genre_scores_gemma":[0.25320137,0.0009162647,0.7455738,0.00014485062,0.0001041336,0.000021461525,0.000006805165,0.000019098901,0.000012162551],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855477,0.00008293506,0.00056917913,0.00037963223,0.00019669851,0.00021679487],"domain_scores_gemma":[0.999183,0.00019973764,0.00020276023,0.00013730387,0.00006983906,0.00020736629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035371346,0.00022464106,0.00042299734,0.00025974543,0.00010973655,0.00039785446,0.0002000568,0.00009630442,0.0000127422945],"category_scores_gemma":[0.000023127543,0.00016053942,0.00006776181,0.00051029143,0.0000874976,0.00041881934,0.0001551301,0.0002745298,4.7957246e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028546344,0.00049800536,0.00053714943,0.00022053871,0.0001974888,0.000029902902,0.0037274456,0.42157996,0.0019577695,0.09291504,0.00016226862,0.47788897],"study_design_scores_gemma":[0.0005999761,0.00018363535,0.00045855352,0.000063490406,0.000024683894,0.000051143084,0.00006843022,0.9917092,0.00022967305,0.005637011,0.0007741549,0.0002000469],"about_ca_topic_score_codex":0.000006345302,"about_ca_topic_score_gemma":2.4737525e-7,"teacher_disagreement_score":0.5701293,"about_ca_system_score_codex":0.000041874137,"about_ca_system_score_gemma":0.00003613079,"threshold_uncertainty_score":0.65466076},"labels":[],"label_agreement":null},{"id":"W4396670834","doi":"10.28924/2291-8639-22-2024-72","title":"Typical Sequence of Real Numbers From the Unit Interval Has All Distribution Functions","year":2024,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Unit interval; Interval (graph theory); Sequence (biology); Unit (ring theory); Distribution (mathematics); Real number; Combinatorics; Mathematical analysis; Mathematics education","score_opus":0.048301418521463996,"score_gpt":0.3541620675182604,"score_spread":0.30586064899679644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396670834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010586435,0.00023085081,0.981156,0.007542995,0.00018126634,0.00003370205,0.0001533652,0.000012147017,0.00010323815],"genre_scores_gemma":[0.9695119,0.0002976248,0.02962445,0.000113170565,0.00032427636,0.000007587496,0.000060147388,0.0000030771255,0.00005774967],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990609,0.000064864,0.00036714456,0.00014403787,0.00029694848,0.00006605326],"domain_scores_gemma":[0.9989146,0.0003904229,0.000173924,0.00015859169,0.00030144578,0.000061025476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031572065,0.00006439395,0.00014668229,0.00009567488,0.00006239825,0.00024066637,0.00059800234,0.000027357377,0.000034053774],"category_scores_gemma":[0.000033014265,0.000041471118,0.00021165438,0.00065178826,0.000108923196,0.00021619187,0.00009775534,0.00015625494,0.0000054672146],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035034154,0.00024055899,0.009724347,0.000006243485,0.00508571,0.000021491902,0.00061511045,0.00071734784,0.003888494,0.27132007,0.0020362653,0.7063093],"study_design_scores_gemma":[0.0005157196,0.0002092199,0.12038737,0.00015090509,0.002347918,0.000156219,0.0005999113,0.29779002,0.0012584609,0.10939423,0.46679452,0.0003955098],"about_ca_topic_score_codex":0.00026805484,"about_ca_topic_score_gemma":0.000024465588,"teacher_disagreement_score":0.9589255,"about_ca_system_score_codex":0.000032262647,"about_ca_system_score_gemma":0.00005740802,"threshold_uncertainty_score":0.23207514},"labels":[],"label_agreement":null},{"id":"W4396700653","doi":"10.4171/mems/13","title":"On Efficient Algorithms for Computing Near-Best Polynomial Approximations to High-Dimensional, Hilbert-Valued Functions from Limited Samples","year":2024,"lang":"en","type":"book","venue":"Memoirs of the European Mathematical Society","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Algorithm; Polynomial; Mathematics; Approximations of π; Computer science; Discrete mathematics; Applied mathematics; Mathematical analysis","score_opus":0.03900926662789469,"score_gpt":0.27792535818383807,"score_spread":0.23891609155594337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396700653","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040253464,0.00009652105,0.9796495,0.002704183,0.0017889861,0.0012167124,0.00050757336,0.00024603034,0.013387967],"genre_scores_gemma":[0.00025271787,0.0000015561404,0.9510857,0.00094286696,0.00082574255,0.000026514099,0.00006470198,0.00013636632,0.046663847],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634224,0.0003879788,0.0009242713,0.0009882174,0.00086089416,0.0004964094],"domain_scores_gemma":[0.99504846,0.0027749478,0.00038723284,0.0013301763,0.00019997546,0.00025918527],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013902737,0.00054264686,0.0008122077,0.00006218768,0.0006255418,0.00034418033,0.0017632387,0.00017460482,0.000038598842],"category_scores_gemma":[0.00061840244,0.00036645,0.001172373,0.00044275148,0.00028471576,0.000049064987,0.0016114232,0.00067216164,0.0005169198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040707793,0.0017421212,3.2266283e-7,0.0010061328,0.0013372776,0.000010380687,0.0056027924,0.02534041,0.00061986723,0.17450984,0.6855687,0.10422148],"study_design_scores_gemma":[0.0006149972,0.00030017356,0.000020630174,0.0016966815,0.00036305978,0.0000068654376,0.00006512122,0.8704303,0.00017777283,0.10135563,0.02420976,0.000759033],"about_ca_topic_score_codex":0.000015934385,"about_ca_topic_score_gemma":3.1166206e-7,"teacher_disagreement_score":0.84508985,"about_ca_system_score_codex":0.0002364702,"about_ca_system_score_gemma":0.00019535379,"threshold_uncertainty_score":0.99987876},"labels":[],"label_agreement":null},{"id":"W4399487307","doi":"10.1145/3649476.3658706","title":"A Low-Power and High-Accuracy Approximate Adder for Logarithmic Number System","year":2024,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Universitas Brawijaya","keywords":"Adder; Logarithm; Computer science; Power (physics); Arithmetic; Parallel computing; Mathematics; Telecommunications; Physics","score_opus":0.013159398471653237,"score_gpt":0.28706051908047736,"score_spread":0.2739011206088241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399487307","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011520855,0.00015620193,0.99360937,0.00076852395,0.0010070622,0.00029155062,0.000008014831,0.000498836,0.0025083278],"genre_scores_gemma":[0.1407308,0.0000073891847,0.8576256,0.00023178026,0.00011442193,0.00009392119,0.0000010496067,0.000016290918,0.0011787126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890673,0.000041714506,0.0001826096,0.000463687,0.00013107114,0.0002742037],"domain_scores_gemma":[0.99917215,0.00037569905,0.000025827281,0.0002774517,0.000042412234,0.00010648538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030095133,0.00013765234,0.00018583471,0.000040585503,0.000077490986,0.00045969558,0.00028092202,0.000053526637,0.000040933475],"category_scores_gemma":[0.000036285055,0.000096006646,0.00006562159,0.0002467047,0.000033033175,0.00037144474,0.00017916289,0.00008786454,0.000083662926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036018375,0.000027009695,0.000008722091,0.00030150134,0.00003267364,0.000030872972,0.00014089343,0.0000019528748,0.0003204993,0.6927132,0.0021189442,0.3043001],"study_design_scores_gemma":[0.00048834935,0.0001351768,0.000116465446,0.00022181032,0.00001952362,0.00018464477,0.00011135631,0.9200468,0.0028328658,0.033259246,0.042104587,0.00047915714],"about_ca_topic_score_codex":0.000025918276,"about_ca_topic_score_gemma":3.6375266e-7,"teacher_disagreement_score":0.92004484,"about_ca_system_score_codex":0.000024336492,"about_ca_system_score_gemma":0.000029781098,"threshold_uncertainty_score":0.4432855},"labels":[],"label_agreement":null},{"id":"W4399511785","doi":"10.48550/arxiv.2406.04530","title":"A general framework for floating point error analysis of simplex derivatives","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Simplex; Point (geometry); Error analysis; Computer science; Mathematics; Applied mathematics; Geometry","score_opus":0.12429011373928457,"score_gpt":0.2785428727080716,"score_spread":0.15425275896878704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399511785","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087934166,0.00008004106,0.9107525,0.0001924159,0.00042320645,0.00023484901,0.000065070715,0.00013187603,0.00018590008],"genre_scores_gemma":[0.46112302,0.000014646896,0.5385209,0.00006394651,0.00007262153,0.0000012924157,0.000008301299,0.000012377195,0.00018292766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980081,0.00016656188,0.00031191422,0.0010842852,0.00009735627,0.00033181693],"domain_scores_gemma":[0.99783474,0.0006235289,0.00032870236,0.0009014791,0.00017867288,0.00013290215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038110162,0.00028276021,0.000678209,0.00056968187,0.00009482015,0.00010345433,0.0012764806,0.00023140309,0.000026184654],"category_scores_gemma":[0.00020650655,0.00028519233,0.00075772405,0.0024296967,0.000099630604,0.00012099347,0.0022956156,0.00048842735,0.000004868805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014787324,0.000066549765,0.00030172276,0.00017555513,0.0015938478,0.000047011134,0.00063515943,0.15822466,0.00014672942,0.82721144,0.00004131462,0.011541228],"study_design_scores_gemma":[0.00006132267,0.00003474632,0.00029939422,0.00005733325,0.00042536767,2.1364947e-7,0.000062789295,0.59247154,0.00026461438,0.40603003,0.0000957544,0.00019689184],"about_ca_topic_score_codex":0.00012116993,"about_ca_topic_score_gemma":0.0000066188422,"teacher_disagreement_score":0.4342469,"about_ca_system_score_codex":0.00009354143,"about_ca_system_score_gemma":0.000118356766,"threshold_uncertainty_score":0.99996},"labels":[],"label_agreement":null},{"id":"W4399545623","doi":"10.20944/preprints202406.0554.v1","title":"A Rational Approximation of the Two-Term Machin-Like Formula for π","year":2024,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thoth Technology (Canada); York University","funders":"","keywords":"Term (time); Trigonometry; Representation (politics); Mathematics; Convergence (economics); Binary number; Rational function; Applied mathematics; Trigonometric functions; Algebra over a field; Pure mathematics; Mathematical analysis; Arithmetic","score_opus":0.11403171367061332,"score_gpt":0.383765199226723,"score_spread":0.26973348555610965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399545623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0682683,0.00010241637,0.9239361,0.0013724953,0.0029743998,0.0012815794,0.000044123884,0.0001481045,0.001872452],"genre_scores_gemma":[0.6207782,0.000010226911,0.37710854,0.00021022973,0.00030379902,0.00052077504,0.000017876835,0.000029122368,0.0010212624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784046,0.00016699442,0.00051403523,0.0008140462,0.00042389877,0.00024053887],"domain_scores_gemma":[0.9978874,0.0001828292,0.00034200546,0.0013570085,0.00016315872,0.0000676141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010714468,0.00024448513,0.00032893062,0.00009132478,0.0001031556,0.00007500829,0.0017488957,0.00013999772,0.00003524727],"category_scores_gemma":[0.00019294936,0.0001762002,0.00040086615,0.00022918248,0.000069976166,0.000109936096,0.0050687906,0.00057041645,0.00007061374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063312356,0.0005791803,0.022894816,0.0027676322,0.00050738064,0.00000587487,0.0042866883,0.0051243897,0.029467586,0.730904,0.00027020974,0.20312895],"study_design_scores_gemma":[0.00036631103,0.000021312786,0.022129938,0.00028022839,0.000056015713,0.000009296172,0.000009066288,0.3515535,0.037645575,0.5857016,0.001871827,0.00035533367],"about_ca_topic_score_codex":0.000030397912,"about_ca_topic_score_gemma":0.0000017518746,"teacher_disagreement_score":0.5525099,"about_ca_system_score_codex":0.00007651313,"about_ca_system_score_gemma":0.00021319251,"threshold_uncertainty_score":0.7185236},"labels":[],"label_agreement":null},{"id":"W4399582806","doi":"10.32614/cran.package.precisesums","title":"PreciseSums: Accurate Floating Point Sums and Products","year":2017,"lang":"en","type":"dataset","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Point (geometry); Mathematics; Computer science; Geometry","score_opus":0.04113843165412018,"score_gpt":0.3412170548314588,"score_spread":0.30007862317733863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399582806","genre_codex":"dataset","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000036639558,0.0004474085,0.19532265,0.0017854732,0.0023170498,0.0004844301,0.7989798,0.0001553501,0.0005041413],"genre_scores_gemma":[0.000002159984,0.00032286442,0.7350735,0.00037887154,0.00062256964,0.000018825707,0.26259017,0.000013914816,0.0009771191],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980546,0.00012995792,0.0002890662,0.00087707595,0.00028838636,0.00036090557],"domain_scores_gemma":[0.9974187,0.00019337366,0.00032134497,0.0018054108,0.00010522597,0.00015592354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067921256,0.00029695837,0.00041466983,0.00007937191,0.00027705767,0.0009381465,0.0017405733,0.0001412726,0.000029336617],"category_scores_gemma":[0.0009805138,0.00021593524,0.00004804141,0.00012943905,0.000085242325,0.0005766802,0.0013691047,0.0003590853,0.00011611001],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.3509107e-7,0.000019795925,7.9030593e-7,0.00006415859,0.000011594216,0.00002032021,0.000010101429,2.6821732e-7,0.000011842762,0.00009676877,0.88196963,0.11779378],"study_design_scores_gemma":[0.0001181094,0.00006695749,0.000049485265,0.00008295885,0.000012506658,0.000026768847,0.00000311054,0.0012054532,0.00020829738,0.0015512371,0.99632037,0.00035477805],"about_ca_topic_score_codex":0.00027703366,"about_ca_topic_score_gemma":0.0000092420005,"teacher_disagreement_score":0.5397509,"about_ca_system_score_codex":0.000016983504,"about_ca_system_score_gemma":0.00009904355,"threshold_uncertainty_score":0.9046568},"labels":[],"label_agreement":null},{"id":"W4399828041","doi":"10.1007/978-3-031-54071-4_12","title":"Coding for Control and Connections with Information Theory","year":2024,"lang":"en","type":"book-chapter","venue":"Systems & control","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Coding (social sciences); Computer science; Information theory; Communication; Psychology; Mathematics; Statistics","score_opus":0.010349412030994072,"score_gpt":0.2325417374375132,"score_spread":0.22219232540651912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399828041","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.553155e-7,0.0018048488,0.9394116,0.00048754396,0.0013657172,0.0014573698,0.00016844664,0.00020915574,0.055094965],"genre_scores_gemma":[0.34151137,0.00024721658,0.08326831,0.003939073,0.0047082077,0.0033764618,0.000073732794,0.00034270625,0.5625329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987194,0.000055112912,0.00042122777,0.00033619232,0.00022446045,0.0002436119],"domain_scores_gemma":[0.99811417,0.00094949757,0.00027031888,0.00033887045,0.00020944558,0.000117689284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007972679,0.00029166002,0.00057249574,0.00017610146,0.0001656968,0.00056485087,0.0002525259,0.00017685513,0.0000040221576],"category_scores_gemma":[0.00004979112,0.00020818252,0.00011509086,0.00004453115,0.00006569564,0.0004280197,0.000037204536,0.00024019722,0.00004354324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031493862,0.0000022218378,7.6094113e-7,0.00018569136,0.00020773117,0.000004250883,0.000080014484,0.000036000565,0.000010937587,0.9711799,0.00020024105,0.02806076],"study_design_scores_gemma":[0.0032009722,0.00056829577,0.0000050990448,0.0008423259,0.00032442258,0.00015087683,0.00006685173,0.2541983,0.000002861151,0.17955375,0.5604504,0.00063587254],"about_ca_topic_score_codex":0.000016227625,"about_ca_topic_score_gemma":0.0000015380411,"teacher_disagreement_score":0.8561433,"about_ca_system_score_codex":0.00005476113,"about_ca_system_score_gemma":0.000071525974,"threshold_uncertainty_score":0.8489437},"labels":[],"label_agreement":null},{"id":"W4399828208","doi":"10.1007/978-3-031-54071-4_17","title":"Optimal Coding Under Small Estimation Error and Observability Criteria","year":2024,"lang":"en","type":"book-chapter","venue":"Systems & control","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Observability; Estimation; Coding (social sciences); Computer science; Mathematics; Statistics; Engineering; Applied mathematics","score_opus":0.054534141717654264,"score_gpt":0.3016642024157957,"score_spread":0.24713006069814147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399828208","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004485632,0.0031456172,0.97402745,0.0007997627,0.002835301,0.000727185,0.00005015857,0.00028257948,0.0180871],"genre_scores_gemma":[0.16758616,0.00007430883,0.5646352,0.00074083835,0.0020230634,0.00027323616,0.000026581543,0.0002234718,0.26441708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997878,0.00011154702,0.0005736814,0.0008344647,0.00029203633,0.00031022655],"domain_scores_gemma":[0.9984624,0.00038588338,0.00022068435,0.00062816957,0.00012562495,0.00017724211],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086772436,0.00039556806,0.0007383447,0.0001031294,0.00010955209,0.00068482786,0.00045081435,0.00027899057,0.000018297853],"category_scores_gemma":[0.00004973922,0.00033221394,0.00015727691,0.000051231396,0.00008420438,0.00020514808,0.00020551789,0.00037363044,0.00008399947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012003275,0.000012611277,0.0000046617447,0.00063218275,0.00016004467,0.0000565816,0.00012978389,0.0006658226,0.00021777075,0.96318775,0.00017538593,0.034745418],"study_design_scores_gemma":[0.00041400292,0.00012100624,0.00006740872,0.0005985913,0.0000963469,0.00006205677,0.000012787136,0.92488784,0.000004098098,0.05556481,0.017697372,0.00047371446],"about_ca_topic_score_codex":0.000075854034,"about_ca_topic_score_gemma":0.0000024949495,"teacher_disagreement_score":0.924222,"about_ca_system_score_codex":0.0001127507,"about_ca_system_score_gemma":0.000069860485,"threshold_uncertainty_score":0.999913},"labels":[],"label_agreement":null},{"id":"W4401762479","doi":"10.1007/978-3-031-69070-9_16","title":"Computing Clipped Products","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.024198788103117697,"score_gpt":0.2873780727970872,"score_spread":0.2631792846939695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401762479","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011784121,0.0012692052,0.9821291,0.0025934635,0.006241719,0.00036362273,0.000003150518,0.00043537916,0.0069525633],"genre_scores_gemma":[0.0072333124,0.00003366193,0.98820406,0.0012635892,0.0015619443,0.0000036624717,0.0000020531113,0.000053012383,0.0016446933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948834,0.000043223892,0.0006317755,0.0024548534,0.0010960884,0.0008906603],"domain_scores_gemma":[0.9971373,0.0005547445,0.00022903306,0.0015983874,0.00025736872,0.0002231737],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014759355,0.0006306032,0.0006771834,0.0007966531,0.000246345,0.0010560303,0.003720142,0.00027718602,0.000013299623],"category_scores_gemma":[0.00016499682,0.0005268249,0.0001631733,0.0013973825,0.00063713634,0.00044526017,0.002728028,0.00134017,0.00022569897],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011763394,0.000016070942,0.000003913774,0.00007044297,0.000009735076,0.00017220638,0.0002810955,0.00255295,0.00013135344,0.065713875,0.000025942385,0.9310212],"study_design_scores_gemma":[0.00010045686,0.00013462007,0.000019356246,0.0004966778,0.0000080997725,0.0001009976,6.86741e-8,0.55852485,0.0011372943,0.42986804,0.008945609,0.00066392677],"about_ca_topic_score_codex":0.00001394894,"about_ca_topic_score_gemma":0.000004090466,"teacher_disagreement_score":0.93035734,"about_ca_system_score_codex":0.00024782718,"about_ca_system_score_gemma":0.000515247,"threshold_uncertainty_score":0.999981},"labels":[],"label_agreement":null},{"id":"W4402147775","doi":"","title":"PartiallySeparableNLPModels.jl: A Julia framework for partitioned quasi-Newton optimization","year":2023,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Computer science; Newton's method; Mathematical optimization; Parallel computing; Mathematics; Physics; Nonlinear system","score_opus":0.027466760587304562,"score_gpt":0.2831541010722624,"score_spread":0.25568734048495784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402147775","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053786486,0.00010069119,0.97249985,0.0232476,0.0002790086,0.00035939494,0.000014353137,0.00068884675,0.0022724196],"genre_scores_gemma":[0.026980871,0.0001833255,0.96957594,0.00025853302,0.00003733099,0.00020190916,0.00008453743,0.00002917581,0.0026483939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959993,0.0021372063,0.00040906394,0.00064170023,0.00034833633,0.00046442292],"domain_scores_gemma":[0.9947519,0.0025492236,0.00023589648,0.0012837842,0.00097644667,0.00020280782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00431508,0.00019735708,0.0002546215,0.00014723516,0.0004946239,0.00043220108,0.0010732493,0.00013683642,0.000046108595],"category_scores_gemma":[0.0021664142,0.00020004335,0.00015857819,0.0013682798,0.000091803515,0.0004349169,0.00034012747,0.00018250474,0.00008407382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009741877,0.0003467399,0.00007983117,0.000038076352,0.000030849977,0.0000029167945,0.0024141183,0.008289411,0.0008237306,0.8808399,0.001755134,0.10536959],"study_design_scores_gemma":[0.00031673108,0.0000015651243,0.00011938075,0.00019483232,0.000010865797,0.00000224819,0.000023473407,0.8652594,0.014411529,0.11094811,0.008476326,0.0002355114],"about_ca_topic_score_codex":0.00008075495,"about_ca_topic_score_gemma":0.000020927064,"teacher_disagreement_score":0.85697,"about_ca_system_score_codex":0.000044482396,"about_ca_system_score_gemma":0.00010851651,"threshold_uncertainty_score":0.8157531},"labels":[],"label_agreement":null},{"id":"W4402211524","doi":"10.2139/ssrn.4946941","title":"Computing Optima in Standard Quadratic Functions in Zero-Error Probabilistic Polynomial Time","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Zero (linguistics); Probabilistic logic; Quadratic equation; Polynomial; Quadratic function; Mathematics; Applied mathematics; Mathematical optimization; Statistics; Mathematical analysis","score_opus":0.014377830679064786,"score_gpt":0.29128708501453315,"score_spread":0.27690925433546837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402211524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03288526,0.0033306708,0.9579454,0.002408994,0.0020847106,0.00049939594,0.0000101493415,0.00014278607,0.00069262035],"genre_scores_gemma":[0.7653535,0.00025304712,0.23122865,0.00014218145,0.0011865951,0.000052139036,0.000010385341,0.00011029263,0.0016631889],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994517,0.0005545292,0.0009556382,0.00085013086,0.0005099923,0.0026126709],"domain_scores_gemma":[0.9987039,0.00025375962,0.000301949,0.0004963819,0.0000884948,0.00015552314],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0046088146,0.00042418946,0.000725823,0.0006144589,0.0001426646,0.0005770219,0.0012776315,0.0002496645,0.000013750197],"category_scores_gemma":[0.00023408429,0.00037941904,0.00026090248,0.0008592796,0.00007055988,0.00016837042,0.0013423208,0.009059353,0.000086328895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015797078,0.0005784022,0.0004741369,0.00033435563,0.00040241846,0.00040557378,0.0018361153,0.08456526,0.00030853078,0.1283353,0.00062119524,0.78198075],"study_design_scores_gemma":[0.0004455126,0.00032480617,0.00012539125,0.00037716384,0.000024105932,0.00028093925,0.00009265204,0.33457258,0.00000640902,0.6632046,0.00015868586,0.00038718063],"about_ca_topic_score_codex":0.00014558628,"about_ca_topic_score_gemma":0.00020695261,"teacher_disagreement_score":0.78159356,"about_ca_system_score_codex":0.0035444612,"about_ca_system_score_gemma":0.006765739,"threshold_uncertainty_score":0.9998658},"labels":[],"label_agreement":null},{"id":"W4403262677","doi":"10.1016/j.cherd.2024.10.005","title":"ReLU surrogates in mixed-integer MPC for irrigation scheduling","year":2024,"lang":"en","type":"article","venue":"Process Safety and Environmental Protection","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Integer programming; Scheduling (production processes); Integer (computer science); Computer science; Mathematical optimization; Environmental science; Mathematics; Operating system","score_opus":0.01459223458876703,"score_gpt":0.2563255280713357,"score_spread":0.24173329348256867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403262677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00854082,0.0005082619,0.98942643,0.0007527752,0.00023622139,0.00036961728,0.0000037831821,0.000087849054,0.00007423715],"genre_scores_gemma":[0.96504873,0.000092066926,0.034571517,0.000025822297,0.000059150552,0.00013850714,0.0000053880926,0.000009043183,0.00004976084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992275,0.00003359802,0.00016191865,0.00033260716,0.00010014341,0.00014420864],"domain_scores_gemma":[0.9998091,0.000048911697,0.000029309918,0.00007199826,0.000003338714,0.000037353144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035415142,0.00009400406,0.00009132561,0.00005870614,0.00011538342,0.000084113744,0.00008408495,0.00005588823,0.0000039072047],"category_scores_gemma":[0.000022560615,0.00008185569,0.000030005549,0.00016408133,0.00003467895,0.00054404716,0.00004242718,0.00014198062,0.0000071880186],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006512689,0.00007731857,0.00011747456,0.00037015803,0.0000129896425,0.000002686763,0.0006571649,0.007306723,0.010394696,0.007780896,6.3099066e-7,0.97321415],"study_design_scores_gemma":[0.00018357871,0.000106205734,0.0009145421,0.00009306386,0.0000036212225,0.000012783163,0.0001324112,0.9456513,0.005540914,0.046402384,0.0008307999,0.00012841629],"about_ca_topic_score_codex":0.000015058345,"about_ca_topic_score_gemma":0.000001904905,"teacher_disagreement_score":0.9730857,"about_ca_system_score_codex":0.00006375968,"about_ca_system_score_gemma":0.000007826398,"threshold_uncertainty_score":0.33379778},"labels":[],"label_agreement":null},{"id":"W4403445211","doi":"10.48550/arxiv.2408.02778","title":"Polynomial-Time Classical Simulation of Hidden Shift Circuits via Confluent Rewriting of Symbolic Sums","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rewriting; Polynomial; Mathematics; Symbolic trajectory evaluation; Computer science; Algorithm; Discrete mathematics; Theoretical computer science; Mathematical analysis; Programming language; Model checking","score_opus":0.060615069150614646,"score_gpt":0.23025481272560583,"score_spread":0.16963974357499118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403445211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26582828,0.00010795742,0.7313537,0.00012070717,0.0005240915,0.00026948552,0.000026847692,0.00015067117,0.0016182562],"genre_scores_gemma":[0.9922918,0.00001565006,0.0071684998,0.000028042592,0.000120852485,5.345889e-7,0.000005309859,0.000021143007,0.00034817366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978523,0.000264248,0.00046118387,0.0009352252,0.00017532827,0.00031166224],"domain_scores_gemma":[0.99790776,0.00047785862,0.00043208007,0.0008492845,0.00016608939,0.0001669223],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041133832,0.0002853035,0.0006425494,0.0003126194,0.000055335917,0.00006028291,0.0011974346,0.0002908168,0.000026041404],"category_scores_gemma":[0.0000786919,0.00031119896,0.00034284356,0.000711185,0.00017772685,0.0001540151,0.0020753923,0.00057031505,0.00004906187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009027069,0.0007875949,0.0021664344,0.0019178479,0.0008760194,0.00067285355,0.002123026,0.6150113,0.012336651,0.1577402,0.00027666404,0.20600118],"study_design_scores_gemma":[0.00026418426,0.00008225302,0.0011931182,0.00029312618,0.00009599226,0.0000017744281,0.000016349277,0.9556264,0.0014537331,0.040504582,0.00014129981,0.00032714146],"about_ca_topic_score_codex":0.0001400499,"about_ca_topic_score_gemma":0.0000015325386,"teacher_disagreement_score":0.7264635,"about_ca_system_score_codex":0.000119364,"about_ca_system_score_gemma":0.00018205664,"threshold_uncertainty_score":0.999934},"labels":[],"label_agreement":null},{"id":"W4404564788","doi":"10.1109/uemcon62879.2024.10754781","title":"LUT-Based Multipliers for IEEE-754 Floating Point Arithmetic on FPGAs","year":2024,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Lookup table; Computer science; Arithmetic; Field-programmable gate array; Floating point; IEEE floating point; Parallel computing; Double-precision floating-point format; Saturation arithmetic; Computer hardware; Arbitrary-precision arithmetic; Algorithm; Mathematics","score_opus":0.030998825181658383,"score_gpt":0.3226229001053267,"score_spread":0.2916240749236683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404564788","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039966157,0.000047464706,0.99220675,0.003188025,0.0014555408,0.00024151366,0.000003650267,0.00045719446,0.0020002227],"genre_scores_gemma":[0.036748134,0.0000011707592,0.96070284,0.0016850692,0.00014491941,0.000035369452,8.851625e-7,0.000016912396,0.0006646926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868554,0.000057683195,0.00020804095,0.00050045963,0.00021403082,0.0003342659],"domain_scores_gemma":[0.99849635,0.0009735955,0.000027379076,0.00033613146,0.0000398274,0.0001267173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005265427,0.00015068718,0.00016369564,0.000117430485,0.000111789705,0.000294963,0.0004055076,0.000047081063,0.000021067577],"category_scores_gemma":[0.00014557324,0.00011120812,0.00014821305,0.00040368488,0.000030251504,0.00015147156,0.000049074206,0.00014393835,0.000084034466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056358135,0.000062412626,0.000003399459,0.000060562656,0.000016878234,0.000018632361,0.00012402292,0.0014742607,0.0030733275,0.0500493,0.0014229841,0.9436886],"study_design_scores_gemma":[0.00023137467,0.00022496955,0.000015448426,0.000059805036,0.0000052526243,0.0000023678786,0.000019142743,0.95486706,0.024812888,0.011401448,0.008182268,0.0001779523],"about_ca_topic_score_codex":0.000031087548,"about_ca_topic_score_gemma":0.0000010250404,"teacher_disagreement_score":0.9533928,"about_ca_system_score_codex":0.000050275023,"about_ca_system_score_gemma":0.000060183735,"threshold_uncertainty_score":0.45349357},"labels":[],"label_agreement":null},{"id":"W4404817872","doi":"10.1007/978-981-96-0617-7_17","title":"Formalizing Potential Flows Using the HOL Light Theorem Prover","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Automated theorem proving; Computer science; Gas meter prover; Programming language; Calculus (dental); Algorithm; Theoretical computer science; Mathematics; Mathematical proof","score_opus":0.019014583944511936,"score_gpt":0.2735598452041234,"score_spread":0.25454526125961147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404817872","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030431158,0.000948706,0.9882805,0.0017379755,0.005453312,0.00045132817,0.0000042548977,0.0001801142,0.0029133912],"genre_scores_gemma":[0.014611338,0.000026149044,0.98150015,0.0015982258,0.0016712858,0.000009091389,0.0000010243131,0.000054982527,0.0005277406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99606717,0.000060684735,0.0005122657,0.0014497936,0.001110657,0.00079940766],"domain_scores_gemma":[0.9978072,0.00031115566,0.00021015454,0.0013619779,0.00015314887,0.00015635755],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014225002,0.0005547515,0.00047157065,0.00043744157,0.0004667974,0.0015155118,0.003896179,0.00025410645,0.000019820045],"category_scores_gemma":[0.000053822303,0.0003433032,0.00025645515,0.00083163014,0.0004909141,0.00069602544,0.0025382654,0.0011943834,0.00004325102],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030142648,0.000013473289,0.0000012047204,0.000038935526,0.000018659619,0.00017860076,0.0006715619,0.015357084,0.00089566683,0.08945524,0.000011639477,0.89335495],"study_design_scores_gemma":[0.00006308183,0.00005724672,0.0000016320375,0.00022692846,0.000012463177,0.0001362311,2.2347187e-7,0.6540654,0.001006111,0.34006953,0.0040108827,0.0003503189],"about_ca_topic_score_codex":0.000016603919,"about_ca_topic_score_gemma":0.000006872269,"teacher_disagreement_score":0.8930046,"about_ca_system_score_codex":0.00021206762,"about_ca_system_score_gemma":0.00035082747,"threshold_uncertainty_score":0.9999019},"labels":[],"label_agreement":null},{"id":"W4404842853","doi":"10.1017/9781009423250.014","title":"Coding Examples","year":2024,"lang":"en","type":"other","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Coding (social sciences); Mathematics; Statistics","score_opus":0.04009487539982778,"score_gpt":0.3134272301250153,"score_spread":0.2733323547251875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404842853","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.6361313e-9,0.00056543306,0.49985218,0.00013650642,0.0006390322,0.000022145632,9.59628e-7,0.00045368986,0.49833006],"genre_scores_gemma":[3.0865195e-7,0.000033209326,0.47374925,0.0001166213,0.00017758195,0.0000022965303,1.8714883e-7,0.0000664743,0.52585405],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936754,0.000022095768,0.000067901216,0.00030289678,0.00011060151,0.00012894387],"domain_scores_gemma":[0.9995867,0.000029493654,0.000024253028,0.00030799277,0.000003694888,0.000047837955],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000085131986,0.000106050036,0.00013685027,0.00009500886,0.000007835111,0.00013657956,0.0004540862,0.00006881102,0.0012748637],"category_scores_gemma":[0.000009156116,0.000073505544,0.000049310314,0.00017256277,0.000013830274,0.000023099803,0.00021921526,0.00009794373,0.002390368],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.3883102e-8,0.0000023247176,1.2460544e-7,0.000017682265,0.000007669507,0.000010519933,0.0000062278314,8.708192e-9,0.000006078008,0.19168656,0.65480757,0.15345521],"study_design_scores_gemma":[0.000013318977,0.0000076643,4.833502e-7,0.00006826857,0.0000025065697,0.0000030448325,0.000001634412,0.0010588354,0.00002511929,0.01770182,0.98100156,0.000115769464],"about_ca_topic_score_codex":0.00009610921,"about_ca_topic_score_gemma":0.0000026558423,"teacher_disagreement_score":0.32619393,"about_ca_system_score_codex":0.0000062039962,"about_ca_system_score_gemma":0.0000110462215,"threshold_uncertainty_score":0.9996381},"labels":[],"label_agreement":null},{"id":"W4404971006","doi":"10.3390/electronics13234762","title":"A Recursive Trigonometric Technique for Direct Digital Frequency Synthesizer Implementation","year":2024,"lang":"en","type":"article","venue":"Electronics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Direct digital synthesizer; Trigonometry; Frequency synthesizer; Computer science; Electronic engineering; Mathematics; Phase-locked loop; Engineering; Phase noise","score_opus":0.014836370666718082,"score_gpt":0.3174335327464833,"score_spread":0.3025971620797652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404971006","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015157697,0.0067140777,0.9902106,0.0006617938,0.0002478616,0.0005232391,0.000022666974,0.00023432425,0.0012338395],"genre_scores_gemma":[0.09411242,0.00048653892,0.90365535,0.00013920716,0.00025538122,0.0008447587,0.000019780411,0.0000424286,0.00044412242],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887455,0.000038242288,0.00018921243,0.00037929844,0.00013169953,0.00038699128],"domain_scores_gemma":[0.99913824,0.0004991743,0.000041339877,0.0002172139,0.00004603804,0.000057995167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038270914,0.000121434045,0.00014489244,0.00021801864,0.00007226471,0.00036353117,0.0003579343,0.000045334393,0.000013734376],"category_scores_gemma":[0.00013023785,0.00010355538,0.00011879753,0.0012307579,0.00001424064,0.00051958946,0.000046580662,0.00013043806,0.000016045478],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002013121,0.000020132285,0.0000051551124,0.00001639437,0.000026389638,0.000003513983,0.000050065253,5.83096e-7,0.0020462659,0.113345265,0.00044221978,0.884042],"study_design_scores_gemma":[0.0002554551,0.0011765973,0.000053358624,0.00004370806,0.000030331106,0.00003580947,0.000024147825,0.004930312,0.10274371,0.5748709,0.31533888,0.00049681496],"about_ca_topic_score_codex":0.000002899255,"about_ca_topic_score_gemma":8.231846e-7,"teacher_disagreement_score":0.88354516,"about_ca_system_score_codex":0.00019563257,"about_ca_system_score_gemma":0.00018253569,"threshold_uncertainty_score":0.4222866},"labels":[],"label_agreement":null},{"id":"W4406525730","doi":"10.3390/electronics14020365","title":"Estimating Word Lengths for Fixed-Point DSP Implementations Using Polynomial Chaos Expansions","year":2025,"lang":"en","type":"article","venue":"Electronics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"CHAOS (operating system); Implementation; Fixed point; Polynomial; Fixed-point arithmetic; Word length; Word (group theory); Algorithm; Mathematics; Point (geometry); Digital signal processing; Computer science; Floating point; Arithmetic; Mathematical analysis; Computer hardware; Geometry","score_opus":0.02682425212788465,"score_gpt":0.3631049340599751,"score_spread":0.3362806819320905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406525730","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047015743,0.0005456403,0.9917119,0.0018042374,0.0006704074,0.00032001385,0.00000666014,0.000109505614,0.0001300277],"genre_scores_gemma":[0.014307043,0.000015489553,0.9847853,0.0005018928,0.00015615065,0.00006577827,0.0000045217575,0.000010760157,0.00015303039],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869424,0.00006114277,0.00027773523,0.00033035898,0.000113146016,0.0005233478],"domain_scores_gemma":[0.99911916,0.00035260193,0.00008499238,0.00031595732,0.00006467862,0.00006260849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034443405,0.00013050775,0.00017411243,0.00010176455,0.00044262232,0.00012993015,0.0004195065,0.00004142668,0.0000095343485],"category_scores_gemma":[0.00016156053,0.0001273929,0.00009763962,0.0005047998,0.00002137781,0.0002272007,0.00016260968,0.00016643447,0.0000026321497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006010496,0.00006493661,0.000023709732,0.000018298371,0.00004069251,0.0000010751039,0.00027569843,0.0011504437,0.011185453,0.051383022,0.0014335616,0.93441707],"study_design_scores_gemma":[0.00050852133,0.0001182873,0.00004420838,0.000031162654,0.000024434397,0.0000048085335,0.000060016584,0.93869174,0.010142026,0.026836194,0.023332497,0.0002061036],"about_ca_topic_score_codex":0.000018756085,"about_ca_topic_score_gemma":0.000012577402,"teacher_disagreement_score":0.9375413,"about_ca_system_score_codex":0.00016324982,"about_ca_system_score_gemma":0.00035863102,"threshold_uncertainty_score":0.51949316},"labels":[],"label_agreement":null},{"id":"W4406610261","doi":"10.1109/tetc.2025.3528972","title":"Software-Defined Number Formats for High-Speed Belief Propagation","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Queen's University Belfast; European Commission","keywords":"Computer science; Software; Parallel computing; Theoretical computer science; Operating system","score_opus":0.021023612039396095,"score_gpt":0.3123285599023229,"score_spread":0.2913049478629268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406610261","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056261886,0.000011004433,0.9889641,0.0019608,0.00261384,0.0003210103,0.0000023524246,0.00026523072,0.00023548915],"genre_scores_gemma":[0.30156636,0.0000039336182,0.6976345,0.00039251422,0.0000753857,0.000017427848,8.6425655e-7,0.000009077151,0.0002999232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986261,0.000077141245,0.00040780668,0.00038242643,0.00017193053,0.00033459376],"domain_scores_gemma":[0.9990337,0.00042695602,0.00008508258,0.0003232023,0.00008847884,0.00004257105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044017416,0.00015980897,0.00022120065,0.00019153998,0.00033403508,0.00009839001,0.0004080244,0.00007878397,0.000005314489],"category_scores_gemma":[0.000040863368,0.00016145039,0.00009293783,0.0007462294,0.00002449694,0.00022243502,0.000009615097,0.000264773,0.000006486433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009368409,0.00013393696,0.000103434795,0.000061014074,0.000019551486,0.0000018541679,0.00028186842,0.028255729,0.00012910673,0.03193781,0.00005702037,0.9390093],"study_design_scores_gemma":[0.0010441911,0.00008657312,0.0007007271,0.00021571768,0.000014229116,0.0000038064447,0.000027395772,0.926681,0.012299172,0.057025887,0.0015890333,0.0003122591],"about_ca_topic_score_codex":0.000052642437,"about_ca_topic_score_gemma":0.000007033909,"teacher_disagreement_score":0.93869704,"about_ca_system_score_codex":0.00010155683,"about_ca_system_score_gemma":0.00005451742,"threshold_uncertainty_score":0.6583756},"labels":[],"label_agreement":null},{"id":"W4408959881","doi":"10.1007/s10589-025-00676-x","title":"A multi-precision quadratic regularization method for unconstrained optimization with rounding error analysis","year":2025,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; HEC Montréal","funders":"","keywords":"Mathematics; Rounding; Regularization (linguistics); Round-off error; Mathematical optimization; Quadratic equation; Error analysis; Algorithm; Applied mathematics; Computer science","score_opus":0.021428376056036993,"score_gpt":0.3476668886019623,"score_spread":0.32623851254592534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408959881","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000046087903,0.000057644873,0.9969939,0.0015372734,0.00004781026,0.0010112184,0.000017340455,0.00016199939,0.00016823296],"genre_scores_gemma":[0.0028459355,0.000009421236,0.99548095,0.000416445,0.00002674271,0.0005360595,0.00033459516,0.0000117379805,0.00033809245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984965,0.00012851224,0.00041343714,0.0005878256,0.00020064616,0.00017310157],"domain_scores_gemma":[0.99821794,0.0006594771,0.00022095778,0.0002866842,0.00052174204,0.000093225986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040627952,0.0001819965,0.00027711433,0.0005110439,0.0005227134,0.00032763844,0.00027144866,0.0000787926,0.000010114156],"category_scores_gemma":[0.00008483888,0.00016466287,0.000084235486,0.0030816386,0.00006184631,0.00039545543,0.00007143578,0.000072584466,7.736603e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007642001,0.0000769409,0.000065669636,0.000015953212,0.00011062558,1.0665471e-7,0.000048888487,0.85532314,0.000016080361,0.12094837,0.000013045303,0.023373542],"study_design_scores_gemma":[0.0007943056,0.00003807831,0.00024504523,0.000019500458,0.00019719302,0.0000027184317,0.000038716866,0.9876861,0.00002574848,0.010481607,0.00028622642,0.00018474064],"about_ca_topic_score_codex":0.000004868599,"about_ca_topic_score_gemma":0.0000021488884,"teacher_disagreement_score":0.13236298,"about_ca_system_score_codex":0.00005769699,"about_ca_system_score_gemma":0.00013065612,"threshold_uncertainty_score":0.6714757},"labels":[],"label_agreement":null},{"id":"W4409920357","doi":"10.1145/3732933","title":"Sound Static Data Race Verification for C: Is the Race Lost?","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Race (biology); Sound (geography); Arms race; Acoustics","score_opus":0.053239937609046516,"score_gpt":0.37149698846588414,"score_spread":0.31825705085683764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409920357","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005169854,0.0016454225,0.9909228,0.00560135,0.00048716916,0.0006706742,0.000036982277,0.00007912926,0.000039462106],"genre_scores_gemma":[0.23972999,0.00020669351,0.7542877,0.0008006499,0.00011152346,0.00040317178,0.000021674134,0.000020965977,0.00441762],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989365,0.00011626245,0.00020890399,0.00039953622,0.00013904055,0.00019976417],"domain_scores_gemma":[0.9977864,0.00071777485,0.0000712893,0.0013276367,0.00005321517,0.000043672273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006760204,0.00011366132,0.00016106592,0.00005465101,0.000346848,0.00047850222,0.00093993364,0.000045985103,0.0000022988],"category_scores_gemma":[0.00008879799,0.0000759695,0.00004266082,0.00033030956,0.000047999816,0.00022099745,0.000030483407,0.00011681954,0.0000047318035],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007085747,0.00005515199,0.000014483652,0.00010720089,0.000053080093,0.0000010156077,0.0007333438,0.000045714976,0.00006511306,0.0038033887,0.0003123889,0.99480206],"study_design_scores_gemma":[0.0013613276,0.00046835575,0.00029663826,0.00035979386,0.00022483402,0.00004000982,0.010051859,0.4030393,0.0008258461,0.007528105,0.5751782,0.0006257401],"about_ca_topic_score_codex":0.000114455615,"about_ca_topic_score_gemma":0.0000067147985,"teacher_disagreement_score":0.99417627,"about_ca_system_score_codex":0.000016877362,"about_ca_system_score_gemma":0.000026879983,"threshold_uncertainty_score":0.46142077},"labels":[],"label_agreement":null},{"id":"W4410211991","doi":"10.3390/e27050506","title":"Karatsuba Algorithm Revisited for 2D Convolution Computation Optimization","year":2025,"lang":"en","type":"article","venue":"Entropy","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multiplication (music); Convolution (computer science); Computer science; Matrix multiplication; Operand; Computation; Reduction (mathematics); Algorithm; Parallel computing; Arithmetic; Mathematics; Artificial intelligence","score_opus":0.01295184550081136,"score_gpt":0.30300991690447093,"score_spread":0.2900580714036596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410211991","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023064564,0.0001984361,0.99721986,0.001152251,0.0006472653,0.00032203848,0.0000050051062,0.00015673386,0.00027534427],"genre_scores_gemma":[0.0013825847,0.000019323003,0.99767476,0.00049784995,0.00009863665,0.000033459888,0.000025160152,0.0000050604417,0.00026316234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911743,0.00009573708,0.00020466544,0.0002857147,0.00011648916,0.00017997979],"domain_scores_gemma":[0.9993882,0.00016413779,0.00007986155,0.00017543849,0.0001486964,0.000043641718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023437124,0.00009424809,0.00014629542,0.000095347394,0.00013669216,0.00011962171,0.00022476015,0.000047267873,0.0000066811353],"category_scores_gemma":[0.000090379246,0.000088302135,0.00006348472,0.00050925947,0.000020729238,0.00022593937,0.000058329777,0.000058618585,0.000009191088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000100311245,0.000059341022,0.000023663522,0.000022394677,0.000022252549,0.0000012512169,0.000040517312,0.012291567,0.0005150681,0.16317733,0.0031744668,0.82066214],"study_design_scores_gemma":[0.00045818166,0.00007220586,0.00013283612,0.00002114661,0.000009397268,8.6181535e-7,0.0000052704722,0.9688775,0.00092088757,0.024204778,0.005204115,0.000092851646],"about_ca_topic_score_codex":0.000004932664,"about_ca_topic_score_gemma":4.031106e-8,"teacher_disagreement_score":0.9565859,"about_ca_system_score_codex":0.0000577728,"about_ca_system_score_gemma":0.000036701724,"threshold_uncertainty_score":0.36008567},"labels":[],"label_agreement":null},{"id":"W4410810258","doi":"10.1109/fccm62733.2025.00024","title":"AutoNTT: Automatic Architecture Design and Exploration for Number Theoretic Transform Acceleration on FPGAs","year":2025,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Field-programmable gate array; Acceleration; Architecture; Computer science; Computer architecture; Hardware acceleration; Parallel computing; Computer engineering; Computational science; Embedded system; Physics","score_opus":0.02947099351882285,"score_gpt":0.3150801670171932,"score_spread":0.28560917349837034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410810258","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029893566,0.000009781864,0.9883526,0.0069441358,0.00013652795,0.0006097877,5.414184e-7,0.00017413349,0.003473587],"genre_scores_gemma":[0.05020437,0.000006548421,0.9481432,0.00088624726,0.000025151703,0.00015037402,0.0000012691993,0.0000053170415,0.0005775442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992355,0.000100894395,0.00015805771,0.0002532864,0.00010255638,0.0001497203],"domain_scores_gemma":[0.9992561,0.00046299445,0.000027406264,0.00018007775,0.000032669963,0.000040800616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003608856,0.00010797881,0.00012562325,0.00005714991,0.0001314917,0.0001882249,0.00018238324,0.0000460345,0.000020201775],"category_scores_gemma":[0.000050657796,0.00007610936,0.000038362417,0.0002184709,0.000027799448,0.00027688497,0.00002034767,0.0000685142,0.0000073892975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006126028,0.000022030765,0.0000010186216,0.000020798652,0.0000055451505,2.5902412e-7,0.0002508313,0.0003415973,0.00017732494,0.34304532,0.00014850644,0.65598065],"study_design_scores_gemma":[0.00021696878,0.00010508689,0.000050474217,0.000023770108,0.000004615179,0.0000012389249,0.000011910011,0.53430885,0.0070999274,0.457529,0.00057895796,0.00006922224],"about_ca_topic_score_codex":0.0000033358688,"about_ca_topic_score_gemma":8.9408576e-7,"teacher_disagreement_score":0.65591145,"about_ca_system_score_codex":0.000019704676,"about_ca_system_score_gemma":0.00003484884,"threshold_uncertainty_score":0.31036496},"labels":[],"label_agreement":null},{"id":"W4411019249","doi":"10.1109/tase.2025.3576731","title":"Learning Autonomous Surgical Irrigation and Suction With the da Vinci Research Kit Using Reinforcement Learning","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Automation Science and Engineering","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; Canadian Institutes of Health Research; China Scholarship Council; Canada Foundation for Innovation; Ministry of Innovation and Advanced Education; Ministry of Advanced Education, Government of Alberta","keywords":"Reinforcement learning; Suction; Reinforcement; Irrigation; Computer science; Engineering; Artificial intelligence; Simulation; Engineering drawing; Mechanical engineering; Structural engineering","score_opus":0.03111430367718968,"score_gpt":0.32100857693103685,"score_spread":0.28989427325384715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411019249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107452765,0.000017570244,0.891393,0.0005292879,0.00014911893,0.00012190741,6.909894e-8,0.00014963928,0.0001866153],"genre_scores_gemma":[0.96925473,0.000012044849,0.030549701,0.00002492711,0.000014794355,0.000018149622,1.0384776e-7,0.000004388711,0.0001211571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987313,0.00008208681,0.00014703661,0.00030051474,0.00048758235,0.00025144176],"domain_scores_gemma":[0.99933714,0.00024851135,0.000037405716,0.00014263496,0.00016979355,0.00006452683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019250795,0.000094349954,0.00009162988,0.00038763092,0.0011964208,0.00049239397,0.00018922579,0.000033954628,0.0000019983097],"category_scores_gemma":[0.000036690242,0.00006892222,0.000014924218,0.0017959519,0.00018551163,0.0007875061,0.000010456175,0.00039556308,0.0000014751394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028904503,0.0000060335933,0.000004762095,0.000011565116,0.0000043769596,0.0000012699691,0.00041791287,0.8331535,0.004384406,0.0029851021,5.7229227e-7,0.15902762],"study_design_scores_gemma":[0.00014419747,0.00009739214,0.00032847864,0.00005336538,0.0000046330847,0.000023573286,0.00013780629,0.9933053,0.004750359,0.00007215731,0.000999429,0.00008328578],"about_ca_topic_score_codex":0.000045535176,"about_ca_topic_score_gemma":7.6781583e-7,"teacher_disagreement_score":0.861802,"about_ca_system_score_codex":0.00014459025,"about_ca_system_score_gemma":0.00010964642,"threshold_uncertainty_score":0.92020226},"labels":[],"label_agreement":null},{"id":"W4411491548","doi":"10.3390/math13132048","title":"Efficient Application of the Voigt Functions in the Fourier Transform","year":2025,"lang":"en","type":"article","venue":"Mathematics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thoth Technology (Canada); York University","funders":"","keywords":"Voigt profile; Rational function; Fourier transform; Computation; Mathematics; The Imaginary; Function (biology); Mathematical analysis; Fast Fourier transform; Applied mathematics; Pure mathematics; Algorithm; Physics; Quantum mechanics","score_opus":0.011664004384170909,"score_gpt":0.2757056922076243,"score_spread":0.2640416878234534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411491548","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034945274,0.000020214986,0.98711455,0.0034628222,0.00009858801,0.0002299489,8.48504e-7,0.000012004015,0.005566476],"genre_scores_gemma":[0.36766386,0.0000014718827,0.63126296,0.00045110818,0.00001920457,0.0000965207,1.9929182e-7,0.0000038953585,0.0005007839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994912,0.000040675157,0.00016313037,0.000079018115,0.0001497184,0.000076235934],"domain_scores_gemma":[0.99926466,0.00021529141,0.000042414802,0.00044913724,0.000020989482,0.000007483735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004710383,0.00004354694,0.00007429662,0.00002776008,0.000059461425,0.000019895571,0.0005383733,0.000018646131,0.0000013825638],"category_scores_gemma":[0.00004389091,0.00002113601,0.000047764494,0.00065591926,0.000033659348,0.000014047344,0.00004636351,0.000073801166,0.000003977506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.6419653e-7,0.00035679023,0.000071949275,0.00007777524,0.000007962467,1.94612e-7,0.0032318807,0.0010764065,0.000275944,0.6035831,0.00019872024,0.39111865],"study_design_scores_gemma":[0.000094281146,0.000010647145,0.00085048965,0.000027428567,0.000008132717,0.0000014630776,0.00025197523,0.82911247,0.0007908678,0.16526598,0.0035465881,0.000039699466],"about_ca_topic_score_codex":0.0000066375524,"about_ca_topic_score_gemma":0.0000025073152,"teacher_disagreement_score":0.828036,"about_ca_system_score_codex":0.000010876988,"about_ca_system_score_gemma":0.000017710172,"threshold_uncertainty_score":0.10004405},"labels":[],"label_agreement":null},{"id":"W4411990406","doi":"10.1007/978-3-031-85747-8_4","title":"KronA: Parameter-Efficient Tuning with Kronecker Adapter","year":2025,"lang":"en","type":"book-chapter","venue":"Machine translation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Kronecker delta; Adapter (computing); Computer science; Artificial intelligence; Operating system; Physics","score_opus":0.026340994652421887,"score_gpt":0.25796435884123226,"score_spread":0.23162336418881035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411990406","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000066841967,0.00092764443,0.834069,0.0007761172,0.00025263123,0.0002824382,0.000017470156,0.00012616608,0.16354185],"genre_scores_gemma":[0.0038971864,0.000034470053,0.9205376,0.00029170653,0.00010852806,0.00001713873,0.00004987255,0.000045710367,0.07501781],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998197,0.000051310933,0.00036096695,0.00067815825,0.00044506608,0.00026748536],"domain_scores_gemma":[0.99886435,0.00023975318,0.00015775657,0.00057607103,0.00006626063,0.00009577723],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025026116,0.00039788798,0.00041737632,0.00020249313,0.00012081999,0.0001245609,0.00046740237,0.00017790345,0.00012321664],"category_scores_gemma":[0.0000074923873,0.00030974613,0.00015376272,0.000105122606,0.000058398724,0.00012771336,0.000064830296,0.00047516034,0.00004651687],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016598537,0.000029400611,0.0000065707727,0.000027844886,0.0000506313,0.000019047797,0.0001246579,0.00068126427,0.000015819143,0.06494036,0.000032573837,0.9340552],"study_design_scores_gemma":[0.000808716,0.00023633854,0.000091125126,0.00035199034,0.00010388794,0.000016203765,0.0000014940044,0.8110049,0.00004590048,0.012897498,0.17371483,0.00072715635],"about_ca_topic_score_codex":0.000026071406,"about_ca_topic_score_gemma":0.000008574998,"teacher_disagreement_score":0.9333281,"about_ca_system_score_codex":0.00004421875,"about_ca_system_score_gemma":0.000067460176,"threshold_uncertainty_score":0.99993545},"labels":[],"label_agreement":null},{"id":"W4412354895","doi":"10.1007/978-3-031-89087-1_5","title":"Iterative Sine 1° Computations in the Sanskrit Tradition","year":2025,"lang":"en","type":"book-chapter","venue":"Sources and studies in the history of mathematics and physical sciences","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity Western University; Western University","funders":"","keywords":"Sanskrit; Sine; Computation; Sine qua non; Sanskrit literature; Mathematics; Philosophy; Literature; Art; Algorithm; Geometry; Linguistics","score_opus":0.09775028216980898,"score_gpt":0.32829235397323153,"score_spread":0.23054207180342257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412354895","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022169093,0.120528266,0.15424545,0.027204715,0.0032542322,0.0029548611,0.000079956684,0.00008479974,0.66947865],"genre_scores_gemma":[0.4259695,0.011314653,0.5053364,0.004466991,0.0011700256,0.00024913577,0.00000803564,0.00004307116,0.05144217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991528,0.00007249649,0.00021104752,0.00021097275,0.0002602296,0.000092471135],"domain_scores_gemma":[0.99799925,0.001695346,0.00014333996,0.00012235717,0.000027090315,0.0000125907845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007489834,0.00013236115,0.00032987652,0.00006851084,0.00017437499,0.000039005667,0.00045123542,0.000026290038,8.6358995e-7],"category_scores_gemma":[0.000042615997,0.00006490436,0.000050709717,0.00010734765,0.0013681196,0.00006920654,0.000099731384,0.00015739456,2.4037962e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.987707e-7,0.00007893905,0.0000014156672,0.00010768397,0.000011694038,0.0000020037085,0.097977296,0.000011058677,0.0000012697166,0.8830414,0.0005109943,0.018255863],"study_design_scores_gemma":[0.000083104256,0.00022081455,0.000036458812,0.0003469388,0.000020388807,0.0000030326596,0.005898323,0.024052085,5.218152e-7,0.9574562,0.011758644,0.00012348927],"about_ca_topic_score_codex":0.000011385756,"about_ca_topic_score_gemma":0.000005482175,"teacher_disagreement_score":0.61803645,"about_ca_system_score_codex":0.00002662171,"about_ca_system_score_gemma":0.000027324704,"threshold_uncertainty_score":0.50408936},"labels":[],"label_agreement":null},{"id":"W4412712637","doi":"10.3390/electronics14153027","title":"A Hybrid Recursive Trigonometric Technique for Direct Digital Frequency Synthesizer","year":2025,"lang":"en","type":"article","venue":"Electronics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spurious-free dynamic range; CORDIC; dBc; Computer science; Direct digital synthesizer; Field-programmable gate array; Lookup table; Algorithm; Electronic engineering; Computer hardware; Dynamic range; Engineering; Frequency synthesizer; Phase-locked loop; Telecommunications; Offset (computer science)","score_opus":0.00959435611698719,"score_gpt":0.2703936046780751,"score_spread":0.26079924856108794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412712637","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015556903,0.0045104357,0.9847395,0.00081662135,0.00022797572,0.0005491883,0.000013317435,0.00016647598,0.008820922],"genre_scores_gemma":[0.05806418,0.00036586466,0.9382503,0.00045046912,0.00010573428,0.0006557451,0.0000062164027,0.000025590945,0.0020758975],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865675,0.00005296692,0.00022340362,0.00044544807,0.00012004355,0.00050139986],"domain_scores_gemma":[0.99856997,0.00076182606,0.000076636505,0.00043584354,0.0000907576,0.00006499798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038566557,0.00015785321,0.00025664605,0.0002842145,0.000117909934,0.00019064412,0.0007615131,0.000053384072,0.0000043137743],"category_scores_gemma":[0.0007579322,0.00013951225,0.00015437175,0.0012520577,0.000030285868,0.00031093357,0.000103162674,0.0001832326,0.000008066444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009311926,0.00009634991,0.000016541742,0.000016976628,0.0000439901,0.000004124735,0.000011407829,0.0000019179201,0.0013450371,0.18652411,0.0010901975,0.8108401],"study_design_scores_gemma":[0.00032284088,0.0004891737,0.00005362514,0.00003898533,0.000018915654,0.000013290331,0.0000027664623,0.0020836524,0.11238697,0.6893923,0.19485064,0.0003468121],"about_ca_topic_score_codex":0.0000019055223,"about_ca_topic_score_gemma":2.2984726e-7,"teacher_disagreement_score":0.81049323,"about_ca_system_score_codex":0.00019248326,"about_ca_system_score_gemma":0.0002599192,"threshold_uncertainty_score":0.5689145},"labels":[],"label_agreement":null},{"id":"W4413204333","doi":"10.1109/icccas65806.2025.11102693","title":"Efficient Multi-Precision Approximate Posit Multiply-Accumulate Unit","year":2025,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Science Foundation of Qingdao; Natural Science Foundation of Shandong Province","keywords":"Computer science; Unit (ring theory); Mathematics","score_opus":0.03676048071235502,"score_gpt":0.34252318668860565,"score_spread":0.30576270597625066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413204333","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005294973,0.000090849164,0.98875254,0.00067449425,0.000684296,0.0002344919,0.0000013438162,0.00032316093,0.0039438177],"genre_scores_gemma":[0.06075241,0.0000053004496,0.9354443,0.00059730286,0.000017181606,0.0000130990975,7.206072e-7,0.000006894431,0.0031628103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851817,0.00013423288,0.00027996607,0.0005075602,0.00021534771,0.00034474605],"domain_scores_gemma":[0.9988275,0.0002464344,0.000052242034,0.0006667298,0.00009161642,0.00011546348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044189012,0.00017030093,0.00021443241,0.00015170143,0.0001715102,0.0001899546,0.0009400169,0.00006479085,0.000025515692],"category_scores_gemma":[0.000106318665,0.00012665696,0.00009309412,0.0008997097,0.00003706566,0.0000922151,0.0007113947,0.00014617862,0.00009186743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011889191,0.00035631418,0.00024772622,0.000020113619,0.000024414665,0.000016458442,0.0001453868,0.00756217,0.007164205,0.047700234,0.00013141488,0.9366197],"study_design_scores_gemma":[0.00054456666,0.000032524003,0.002192983,0.00003082444,0.0000043885257,0.0000021832275,0.000014489537,0.9858266,0.006905606,0.0019287604,0.0023507809,0.00016628836],"about_ca_topic_score_codex":0.000053489606,"about_ca_topic_score_gemma":9.3930885e-7,"teacher_disagreement_score":0.97826445,"about_ca_system_score_codex":0.000026947138,"about_ca_system_score_gemma":0.000031561398,"threshold_uncertainty_score":0.51649207},"labels":[],"label_agreement":null},{"id":"W4413812281","doi":"10.1080/10556788.2025.2531478","title":"A general framework for floating point error analysis of first-order simplex derivatives","year":2025,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Simplex; Order (exchange); Point (geometry); Mathematical optimization; Simplex algorithm; Algorithm; Applied mathematics; Combinatorics; Linear programming; Geometry; Economics","score_opus":0.035310281368347456,"score_gpt":0.39890740731886803,"score_spread":0.36359712595052057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413812281","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005298055,0.00015947699,0.99804074,0.00090356846,0.0002908363,0.0003109029,0.000018340612,0.00016761363,0.00005555049],"genre_scores_gemma":[0.00007576203,0.000018570845,0.99906504,0.00056785316,0.000038752336,0.00006200405,0.000021341864,0.000015525944,0.00013513722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978712,0.0005430434,0.0005625377,0.0005416143,0.00018403743,0.0002975763],"domain_scores_gemma":[0.99490327,0.0035449232,0.0003251129,0.0005935407,0.0005547314,0.000078428115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011964438,0.00020488324,0.0005829681,0.00044086183,0.00025598955,0.00010897641,0.0005922957,0.00013212493,0.00008196735],"category_scores_gemma":[0.006647006,0.00018664188,0.00028275774,0.00495326,0.00006374895,0.00027857922,0.00024822517,0.0001308767,2.836585e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009488794,0.000057575155,0.0009857024,0.00005249131,0.00039021386,3.498028e-7,0.000493608,0.67473334,0.00005664668,0.025729612,0.000049920647,0.29744104],"study_design_scores_gemma":[0.00019243587,0.000042104148,0.0005900576,0.000041246978,0.00021808752,2.038167e-7,0.00006539712,0.95865184,0.0011704428,0.03777865,0.0010609363,0.00018862168],"about_ca_topic_score_codex":0.000022759139,"about_ca_topic_score_gemma":0.000001670962,"teacher_disagreement_score":0.29725242,"about_ca_system_score_codex":0.000041203955,"about_ca_system_score_gemma":0.00007412476,"threshold_uncertainty_score":0.79575676},"labels":[],"label_agreement":null},{"id":"W4416707459","doi":"10.1109/lca.2025.3637718","title":"Fusing Adds and Shifts for Efficient Dot Products","year":2025,"lang":"en","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adder; Dot product; Multiplier (economics); Multiplication (music); Tree (set theory); Product (mathematics)","score_opus":0.011399782714914467,"score_gpt":0.2591586618781034,"score_spread":0.24775887916318892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416707459","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028079983,0.00011015994,0.9329775,0.035905033,0.0022819655,0.00042981503,0.0000029120717,0.00017674996,0.000035911824],"genre_scores_gemma":[0.037203256,0.0000012314174,0.94611746,0.016056696,0.00055528624,0.00003009332,0.0000011173545,0.000012383109,0.000022461683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983318,0.000115377574,0.00022411367,0.0007265516,0.0001734174,0.000428778],"domain_scores_gemma":[0.99894255,0.00036245823,0.000061756335,0.0004948182,0.00004888072,0.0000895192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002928119,0.00022866143,0.00026380352,0.0002066492,0.00020023285,0.00024387286,0.00061605964,0.000045765046,4.7288913e-7],"category_scores_gemma":[0.000028509798,0.00018685107,0.00008147027,0.0005167843,0.00009511842,0.00006421331,0.0002617429,0.00021984684,0.0000017588173],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014120684,0.00004914075,0.000025145386,0.0001227177,0.000041448104,0.0000149361385,0.00062018813,0.011932847,0.022334883,0.0025754843,0.0036564583,0.9586126],"study_design_scores_gemma":[0.0023337458,0.00037606276,0.0050446456,0.000406258,0.000056764326,0.00008077274,0.0000055248856,0.85304236,0.02725794,0.015718346,0.09441369,0.001263871],"about_ca_topic_score_codex":0.0000056105355,"about_ca_topic_score_gemma":4.7395815e-7,"teacher_disagreement_score":0.95734876,"about_ca_system_score_codex":0.00002675277,"about_ca_system_score_gemma":0.000032396936,"threshold_uncertainty_score":0.7619566},"labels":[],"label_agreement":null},{"id":"W4417227565","doi":"10.1016/j.engappai.2025.113449","title":"A note on “Optimizing the selection of the secret parameters for public key cryptosystems by using interval linear programming and fully fuzzy linear programming”","year":2025,"lang":"en","type":"article","venue":"Engineering Applications of Artificial Intelligence","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Cryptosystem; Key (lock); Interval (graph theory); Fuzzy logic; Subtraction; Selection (genetic algorithm); Fuzzy number; Lexicographical order","score_opus":0.03616343098698093,"score_gpt":0.31103964180145327,"score_spread":0.27487621081447233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417227565","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069287806,0.000084449595,0.9910602,0.0006757653,0.00017398015,0.0009902483,0.000005386759,0.000074746466,0.000006472891],"genre_scores_gemma":[0.3269491,0.000004520178,0.6727132,0.000020291427,0.000040012586,0.00025619235,0.0000010322879,0.000009600983,0.0000060089637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987528,0.000053308835,0.0004726183,0.0003113606,0.00016871202,0.00024124334],"domain_scores_gemma":[0.9986834,0.00047982024,0.00019687014,0.00039533744,0.00019892873,0.000045637542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006259225,0.00014579261,0.0001989299,0.00011337378,0.0002074506,0.00011069477,0.00064041535,0.0000648041,2.933982e-7],"category_scores_gemma":[0.00025829842,0.000105426014,0.00010200448,0.0011793505,0.0001054253,0.000110132525,0.00013803001,0.00019538698,4.1438932e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010738466,0.00011625643,0.000029312643,0.00014415178,0.000041489537,4.5861608e-8,0.00039616646,0.04547557,0.01901017,0.05388817,0.0000065254326,0.8808814],"study_design_scores_gemma":[0.000020982396,0.00009069202,0.000004985492,0.00009527427,0.000015519112,0.0000016506409,0.0001034282,0.90180105,0.09284526,0.0010724271,0.0038489525,0.00009979331],"about_ca_topic_score_codex":0.000057840236,"about_ca_topic_score_gemma":0.0000029431358,"teacher_disagreement_score":0.8807816,"about_ca_system_score_codex":0.000041732095,"about_ca_system_score_gemma":0.000053592423,"threshold_uncertainty_score":0.4299148},"labels":[],"label_agreement":null},{"id":"W45337212","doi":"10.1007/978-3-319-07058-2_2","title":"Parametric Method for Motion Analysis of Manipulators with Uncertainty in Kinematic Parameters","year":2014,"lang":"en","type":"book-chapter","venue":"Mechanisms and machine science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Kinematics; Jacobian matrix and determinant; Parametric statistics; Control theory (sociology); Mathematics; Interval (graph theory); Range (aeronautics); Parametric equation; Planar; Equations of motion; Position (finance); Serial manipulator; Applied mathematics; Parallel manipulator; Computer science; Engineering; Geometry; Classical mechanics; Physics; Artificial intelligence; Statistics","score_opus":0.02584920889447265,"score_gpt":0.2866158899194706,"score_spread":0.26076668102499795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45337212","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000097776785,0.00006324824,0.99808663,0.00008368848,0.00013871431,0.00043605865,0.000015220718,0.000029360479,0.0010493189],"genre_scores_gemma":[0.013474639,0.000020816125,0.9849893,0.00011634124,0.0000075041935,0.000023718396,0.0000053383355,0.000015475689,0.0013468836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975728,0.000060302536,0.00047890435,0.00092958915,0.00061180734,0.00034663855],"domain_scores_gemma":[0.99812424,0.00049031165,0.00046422333,0.00061689696,0.00014295914,0.00016135213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027379142,0.00031430757,0.0009098071,0.0018739596,0.00011646016,0.00011524892,0.0008334068,0.00010465778,0.000009742513],"category_scores_gemma":[0.00016287065,0.00022221921,0.00016949476,0.0018390634,0.00018918725,0.0001637955,0.00022085545,0.0001821908,6.049945e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000688026,0.00001551918,0.000006929395,0.0000624828,0.00006750991,0.0000021589856,0.000045058725,0.011270518,0.0001962836,0.7414418,6.6850544e-7,0.24688421],"study_design_scores_gemma":[0.00020941114,0.00035046178,0.00013586823,0.00006138077,0.00022588189,0.0000044952853,0.0000045443026,0.8068086,0.00025909016,0.19160205,0.000082807404,0.0002553813],"about_ca_topic_score_codex":0.00021633992,"about_ca_topic_score_gemma":0.000046097946,"teacher_disagreement_score":0.7955381,"about_ca_system_score_codex":0.000058886144,"about_ca_system_score_gemma":0.000062171894,"threshold_uncertainty_score":0.90618366},"labels":[],"label_agreement":null},{"id":"W562550760","doi":"10.1049/el.2015.0342","title":"Area efficient floating‐point FFT butterfly architectures based on multi‐operand adders","year":2015,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Operand; Adder; Fast Fourier transform; Computer science; Parallel computing; Floating point; Butterfly; Point (geometry); Arithmetic; Computer architecture; Computer hardware; Algorithm; Mathematics; Telecommunications; Latency (audio)","score_opus":0.022838173421325377,"score_gpt":0.2606227942640772,"score_spread":0.23778462084275181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W562550760","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048448898,0.00016058226,0.9355308,0.0148378005,0.000393475,0.00022456858,0.0000022897912,0.00019663307,0.00020498633],"genre_scores_gemma":[0.40425214,0.0000018750626,0.5712095,0.02429876,0.00014674511,0.000022946137,0.0000038121277,0.00003221674,0.00003199761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753684,0.00026329106,0.00025568262,0.0006192476,0.0005388666,0.000786053],"domain_scores_gemma":[0.9986971,0.00024076697,0.000096471995,0.0006392512,0.000053962307,0.0002724729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006819913,0.0002815317,0.00025951953,0.00015929183,0.00013907546,0.00017646435,0.00079891196,0.000055264514,0.000009246142],"category_scores_gemma":[0.00017135551,0.00022787447,0.00012903947,0.00041015173,0.00006835667,0.00005247386,0.000104896106,0.00048036795,0.00003763158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017692985,0.0007369425,0.0002723344,0.000030123792,0.0000995124,0.00016205503,0.0024486503,0.6884189,0.0767853,0.0025645138,0.009787894,0.21851683],"study_design_scores_gemma":[0.0013134034,0.00043908422,0.00009712306,0.000025541167,0.000007766501,0.000010382025,0.000013321491,0.97887784,0.0130977165,0.00038032184,0.005361559,0.00037592024],"about_ca_topic_score_codex":0.000028060764,"about_ca_topic_score_gemma":0.0000042154466,"teacher_disagreement_score":0.36432126,"about_ca_system_score_codex":0.00018595316,"about_ca_system_score_gemma":0.000140419,"threshold_uncertainty_score":0.9292451},"labels":[],"label_agreement":null},{"id":"W592305","doi":"10.1530/jrf.0.0510495","title":"Exact computation of Simultaneous Rational Approximants","year":2000,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computation; Mathematics; Fraction (chemistry); Hermite polynomials; Symbolic computation; Field (mathematics); Applied mathematics; Algorithm; Mathematical analysis; Pure mathematics","score_opus":0.0170643665511168,"score_gpt":0.2888889388205207,"score_spread":0.2718245722694039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W592305","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009099573,0.000015124976,0.9835551,0.00014378685,0.000053372034,0.0000505576,6.094051e-7,0.000053146927,0.007028734],"genre_scores_gemma":[0.3795899,0.000002494639,0.6198607,0.00009763969,0.000018773515,0.0000010184905,6.571348e-7,0.0000015816488,0.00042723288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943036,0.000043641994,0.00013622742,0.00014133648,0.00016157898,0.000086830834],"domain_scores_gemma":[0.9996249,0.00016330877,0.000029840106,0.00010560838,0.000039555784,0.000036752426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010007981,0.000048536316,0.00008412645,0.00002259986,0.000029358183,0.000024294945,0.00018323438,0.000017483499,0.00017712066],"category_scores_gemma":[0.000016648539,0.00003816886,0.000027211388,0.00018452968,0.000020645673,0.00013724218,0.000020735428,0.000032365864,0.000044271597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021677797,0.000047689107,0.000012813945,0.0000026481098,0.000002923012,0.000002888866,0.00004566459,0.004865818,0.000410684,0.0065354374,0.000035584428,0.9880357],"study_design_scores_gemma":[0.00012525424,0.000056253815,0.00029289952,0.0000034134378,8.3642107e-7,0.00000590747,0.0000032812443,0.9848124,0.0020305612,0.012029358,0.00058040937,0.000059446564],"about_ca_topic_score_codex":0.000011979112,"about_ca_topic_score_gemma":1.8526953e-7,"teacher_disagreement_score":0.98797625,"about_ca_system_score_codex":0.0000056223453,"about_ca_system_score_gemma":0.000015023713,"threshold_uncertainty_score":0.19393471},"labels":[],"label_agreement":null},{"id":"W6242962","doi":"10.1007/978-94-017-9454-1_4","title":"Representation of Functions in Basis Sets","year":2015,"lang":"en","type":"book-chapter","venue":"Scientific computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Basis (linear algebra); Representation (politics); Computer science; Mathematics; Political science; Geometry","score_opus":0.09377608752637932,"score_gpt":0.344813922399883,"score_spread":0.2510378348735037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6242962","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001308572,0.00019047389,0.90990174,0.0002154088,0.0030227075,0.00026025408,0.000022364047,0.00007308636,0.08618313],"genre_scores_gemma":[0.016943242,0.000010472909,0.64265966,0.000045213685,0.00017482952,0.000023123559,0.0003323517,0.000049379043,0.3397617],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979996,0.00007907493,0.00047716137,0.00064396346,0.00064202055,0.00015817904],"domain_scores_gemma":[0.9985215,0.00016317786,0.00033669543,0.00046320198,0.00042871892,0.00008669618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000873243,0.0001583812,0.0003103155,0.0005742666,0.00008062526,0.00016472206,0.0003878947,0.000110167544,0.00004434235],"category_scores_gemma":[0.00008193138,0.00015996641,0.000107321895,0.00062053703,0.00013151253,0.00031278524,0.00018485835,0.00017151277,0.00010208806],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044782714,0.00004501292,0.000023456496,0.000028060545,0.000015128434,0.000008405544,0.00038766998,0.004318712,0.000109047534,0.054966755,0.007227726,0.93286556],"study_design_scores_gemma":[0.0004254828,0.00010441257,0.0005416607,0.00017047892,0.000022168939,0.00000906433,0.00003513233,0.32279372,0.00015956847,0.6466481,0.028704347,0.00038584162],"about_ca_topic_score_codex":0.000026520434,"about_ca_topic_score_gemma":0.000013399172,"teacher_disagreement_score":0.9324797,"about_ca_system_score_codex":0.00009932178,"about_ca_system_score_gemma":0.00016725886,"threshold_uncertainty_score":0.65232414},"labels":[],"label_agreement":null},{"id":"W6925025436","doi":"10.17605/osf.io/k5nup","title":"Does dietitian involvement during pregnancy improve birth outcomes? A systematic review","year":2022,"lang":"en","type":"other","venue":"Open Science Framework","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Pregnancy; Psychological intervention; Prenatal care; Low birth weight; Medical nutrition therapy; Intervention (counseling); Incidence (geometry); Health care","score_opus":0.019110993377965745,"score_gpt":0.32825058147598357,"score_spread":0.30913958809801784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925025436","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004008028,0.07861754,0.51087356,0.011579752,0.021747047,0.029980918,0.00021056198,0.001638265,0.34534833],"genre_scores_gemma":[0.000017538432,0.004789306,0.6103262,0.002984408,0.00012033127,0.002034251,0.0000023218831,0.00020067347,0.37952498],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.99462396,0.00037616838,0.00072762615,0.0017540031,0.0016761724,0.00084205903],"domain_scores_gemma":[0.9944658,0.00021300477,0.00093585905,0.003953466,0.0000724111,0.00035944462],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.001857391,0.0005082258,0.0014801812,0.00029782785,0.0005974112,0.0014891316,0.015393903,0.00013697652,0.0029276465],"category_scores_gemma":[0.0013752976,0.0002802156,0.00021702747,0.00267676,0.00029667365,0.00067250244,0.008837573,0.0007203274,0.00017388685],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048669144,0.00096081034,0.0008797895,0.7766405,0.00044804762,0.0006635454,0.0014736891,0.0000025300967,0.00010386846,0.14986677,0.016047498,0.052908093],"study_design_scores_gemma":[0.00050487154,0.0003780788,0.00018000917,0.871192,0.0002288816,0.00002491411,0.0002353984,0.00042838484,0.00010897233,0.028138464,0.09566231,0.002917709],"about_ca_topic_score_codex":0.00017194396,"about_ca_topic_score_gemma":0.00001078725,"teacher_disagreement_score":0.12172831,"about_ca_system_score_codex":0.00027175178,"about_ca_system_score_gemma":0.0003390451,"threshold_uncertainty_score":0.999965},"labels":[],"label_agreement":null},{"id":"W6926381370","doi":"10.25316/ir-10574","title":"Nanaimo Free Press [Tuesday, August 4, 1896]","year":2019,"lang":"en","type":"other","venue":"VIURRSpace (Vancouver Island University)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"","score_opus":0.012442272973211686,"score_gpt":0.21988064455126494,"score_spread":0.20743837157805325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6926381370","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.5459036e-8,0.00028388173,0.3025152,0.00014162697,0.0028979601,0.00026429936,0.000084099185,0.0004021988,0.6934107],"genre_scores_gemma":[0.0000059054832,0.00036828624,0.07266529,0.00010947396,0.00033967508,0.0000010379937,3.4557976e-7,0.00017499717,0.926335],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975848,0.00020059748,0.00014318559,0.000991652,0.0004904856,0.0005892568],"domain_scores_gemma":[0.9973955,0.00012055961,0.00030732207,0.0018690964,0.0000686527,0.00023884163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011652188,0.00050382246,0.0006300063,0.00054898136,0.00011253369,0.00012936919,0.0028901696,0.00043840674,0.00028797542],"category_scores_gemma":[0.000034224904,0.00047918296,0.00023961831,0.0007831749,0.00010832925,0.0003429377,0.0012775661,0.00046996237,0.00025013884],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000080974305,0.000057652273,7.5347674e-7,0.000061871295,0.00009265745,0.00018521163,0.000058907546,0.0000120353625,0.000005250313,0.008048839,0.98421234,0.0072563933],"study_design_scores_gemma":[0.0009909325,0.00010195735,0.000001777824,0.00014973435,0.000050698203,0.0000033397414,0.00005631474,0.0007389473,0.000028824197,0.00032609812,0.9968911,0.0006603133],"about_ca_topic_score_codex":0.0014730614,"about_ca_topic_score_gemma":0.00043376038,"teacher_disagreement_score":0.23292433,"about_ca_system_score_codex":0.00012607733,"about_ca_system_score_gemma":0.00015460086,"threshold_uncertainty_score":0.999766},"labels":[],"label_agreement":null},{"id":"W6929688700","doi":"10.48713/10336_10422","title":"El plan de los organismo internacionales, ONU y OEA dentro de la problemática de las minas antipersonal","year":2023,"lang":"es","type":"dissertation","venue":"Repositorio Institucional E-DocUR (Universidad Del Rosario)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Work (physics); Context (archaeology); Plan (archaeology)","score_opus":0.015876598821435477,"score_gpt":0.29341338523613675,"score_spread":0.27753678641470125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929688700","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58248746,0.0015092656,0.39583278,0.001325252,0.009406371,0.0011537079,0.00040452232,0.0009019826,0.00697866],"genre_scores_gemma":[0.52509516,0.0011469277,0.4394679,0.00055955595,0.0048205126,0.00012429287,0.0011957148,0.00044637083,0.027143568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99286515,0.00087064394,0.0009564177,0.0018552194,0.0017555108,0.0016970716],"domain_scores_gemma":[0.9952362,0.0013232147,0.00090050657,0.0008631432,0.0006037687,0.001073128],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013249492,0.0011193064,0.0011022978,0.0008289844,0.0013186554,0.0013327807,0.0026203739,0.0012224395,0.00008032569],"category_scores_gemma":[0.00057263614,0.0012605072,0.00072958105,0.0015813011,0.0004001036,0.0009979666,0.0006716092,0.0020205528,0.0002634323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017085947,0.0030774567,0.039364614,0.0024357096,0.0028208136,0.030180486,0.027226832,0.0033027492,0.07153261,0.75337857,0.010797505,0.05417404],"study_design_scores_gemma":[0.012988384,0.0033041744,0.2719661,0.014284213,0.0031229253,0.018292662,0.014396847,0.3017747,0.030923283,0.04442737,0.27216277,0.012356547],"about_ca_topic_score_codex":0.0032727143,"about_ca_topic_score_gemma":0.00023313615,"teacher_disagreement_score":0.70895123,"about_ca_system_score_codex":0.0023040108,"about_ca_system_score_gemma":0.005210203,"threshold_uncertainty_score":0.99998146},"labels":[],"label_agreement":null},{"id":"W6930932396","doi":"10.5281/zenodo.15439776","title":"50 YEARS OF ADVANCED COMPOSITES RESEARCH AND INNOVATION: A CANADIAN PERSPECTIVE","year":2013,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Perspective (graphical); Honour; Weaving; Scala","score_opus":0.04716823997825932,"score_gpt":0.2979474566705635,"score_spread":0.2507792166923042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930932396","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29266757,0.0009127525,0.33393964,0.024517493,0.0004450666,0.0032247591,0.00019993009,0.0014080257,0.34268475],"genre_scores_gemma":[0.8737863,0.00005891776,0.12486109,0.00021003303,0.000083374835,1.7759204e-7,0.00005778107,0.0003740113,0.0005683271],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99862236,0.00027342615,0.000167954,0.00031770967,0.0003093604,0.0003091857],"domain_scores_gemma":[0.9976589,0.000067957175,0.00005280824,0.00033500994,0.0017060039,0.00017930898],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007153071,0.000067794295,0.00010757416,0.00060896843,0.0008301559,0.0005681669,0.00089745846,0.00003399675,0.0009461891],"category_scores_gemma":[0.000595807,0.000072025185,0.000014003826,0.002148895,0.00022555311,0.00040513327,0.00080239715,0.00022207947,0.00075704895],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007671723,0.00007313668,0.0000083631185,0.000016693728,0.000020086272,0.0000058156447,0.0022018042,0.000008749564,0.01971739,0.3607023,0.010764412,0.60647357],"study_design_scores_gemma":[0.0005575607,0.00086301065,0.010692459,0.000048044647,0.0000028058887,0.00007345277,0.0018495822,0.0031567323,0.0019486222,0.042844232,0.93768996,0.0002735539],"about_ca_topic_score_codex":0.003332549,"about_ca_topic_score_gemma":0.000006687314,"teacher_disagreement_score":0.92692554,"about_ca_system_score_codex":0.00012931136,"about_ca_system_score_gemma":0.00001124142,"threshold_uncertainty_score":0.9999671},"labels":[],"label_agreement":null},{"id":"W6931275982","doi":"10.5281/zenodo.5226878","title":"Understanding behavioural responses to human-induced rapid environmental change: A meta-analysis","year":2021,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Boldness; Context (archaeology); Environmental change; Range (aeronautics); Fish <Actinopterygii>; Empirical research; Climate change; Empirical evidence","score_opus":0.45506976537317817,"score_gpt":0.35155478736076917,"score_spread":0.103514978012409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931275982","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008666258,0.0013006809,0.7388517,0.0025943797,0.00031186338,0.0013443067,0.0007919252,0.0018584947,0.25285998],"genre_scores_gemma":[0.13743602,0.00058293395,0.22758569,0.0038511024,0.001794226,0.0000036717533,0.0074587557,0.024314743,0.5969729],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99663985,0.0011267597,0.00027439525,0.0008924413,0.0006326205,0.00043394987],"domain_scores_gemma":[0.99840987,0.00003858732,0.00018610786,0.0010091367,0.00005480102,0.00030151752],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00077043276,0.00028564103,0.00061652577,0.00087236357,0.0011045958,0.0011035521,0.0018358661,0.00012458104,0.062143184],"category_scores_gemma":[0.00012575657,0.00027283252,0.00044392463,0.0014654709,0.000074613454,0.0001361091,0.0024299612,0.0003113816,0.0012790891],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063926615,0.0011485729,0.000011643457,0.000160584,0.057477914,0.00069635053,0.0048307944,0.00001107331,0.016101928,0.028044002,0.70836604,0.18308716],"study_design_scores_gemma":[0.00019195743,0.0002719235,0.00012857027,0.00001346406,0.0039653876,0.000034393546,0.00015788835,0.00021478914,0.00017241332,0.00011885892,0.9942663,0.00046405892],"about_ca_topic_score_codex":0.00007092562,"about_ca_topic_score_gemma":0.0000010303156,"teacher_disagreement_score":0.51126605,"about_ca_system_score_codex":0.0002589656,"about_ca_system_score_gemma":0.0000030377944,"threshold_uncertainty_score":0.9999724},"labels":[],"label_agreement":null},{"id":"W6984844887","doi":"","title":"Page 198","year":2011,"lang":"en","type":"article","venue":"Pittsburg State University Digital Commons (Pittsburg State University)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Ledger; Period (music); Register (sociolinguistics); Quarter (Canadian coin); Table (database)","score_opus":0.026721548299257297,"score_gpt":0.20163800878251967,"score_spread":0.17491646048326237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6984844887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047622003,0.000045844685,0.86915016,0.00031259994,0.00050546124,0.00044579545,0.00024221011,0.0011168648,0.08055905],"genre_scores_gemma":[0.8882425,0.00062116294,0.06368111,0.000346305,0.00008498432,9.0323744e-7,0.00005759288,0.00013385345,0.046831623],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960985,0.000342274,0.00039337148,0.0012785825,0.00060981896,0.0012774201],"domain_scores_gemma":[0.99657285,0.00034066278,0.00035218152,0.0014540799,0.00034534006,0.0009348592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023417239,0.0006603349,0.0006997247,0.0011715676,0.00075190945,0.00036906305,0.003447726,0.0001531413,0.0000967823],"category_scores_gemma":[0.000055694978,0.0007631927,0.00046225483,0.0028954353,0.00054910046,0.004585326,0.0022220714,0.0006531757,0.00021385332],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014077745,0.003967887,0.023760293,0.00018549345,0.0014605642,0.026827324,0.01561039,0.00025919444,0.0014062246,0.30809665,0.0110241175,0.6059941],"study_design_scores_gemma":[0.004472916,0.001336297,0.0149349645,0.00013253244,0.00015844162,0.00011822096,0.0037147754,0.0030137552,0.001224319,0.07625557,0.8911518,0.003486445],"about_ca_topic_score_codex":0.0005546809,"about_ca_topic_score_gemma":0.000038678485,"teacher_disagreement_score":0.88012767,"about_ca_system_score_codex":0.0004377472,"about_ca_system_score_gemma":0.00019564721,"threshold_uncertainty_score":0.9994819},"labels":[],"label_agreement":null},{"id":"W6989710314","doi":"","title":"Calabash Cadence Taisgeadan","year":2016,"lang":"en","type":"book","venue":"Research Portal (Queen's University Belfast)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Queen's University","funders":"","keywords":"Cadence; Feature (linguistics); Statistical analysis; Compression (physics)","score_opus":0.033119872254332924,"score_gpt":0.3088082630854348,"score_spread":0.27568839083110186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6989710314","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044246764,0.00009055433,0.18986906,0.0071624243,0.0006767042,0.0008235856,0.00021542286,0.00048127057,0.8006367],"genre_scores_gemma":[0.00037651567,0.0004308945,0.029240767,0.00007543326,0.00048311814,0.0000026015234,0.00002333931,0.000052111467,0.96931523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99339914,0.0007684063,0.00035503053,0.0015268598,0.002438201,0.0015123865],"domain_scores_gemma":[0.9954269,0.0009025178,0.00024378959,0.001608292,0.0008374734,0.0009810497],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001541455,0.00050656416,0.0006822249,0.0009155648,0.0007437008,0.00022102683,0.004279448,0.0005875376,0.00056405953],"category_scores_gemma":[0.00023588644,0.00045618505,0.00035076213,0.0009593324,0.00086383556,0.00093719515,0.003089161,0.0021051487,0.00092675316],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031594565,0.00013318489,0.00007526411,0.00013077479,0.00015768425,0.008139883,0.00015007805,0.0000014617493,0.000062312065,0.5956696,0.29586756,0.09958057],"study_design_scores_gemma":[0.00042326588,0.00032243456,0.0001904133,0.0003534337,0.000016203847,0.00002606378,0.000058118072,0.00008933872,0.00012190696,0.01977801,0.9779294,0.0006913996],"about_ca_topic_score_codex":0.0005566779,"about_ca_topic_score_gemma":0.000010674471,"teacher_disagreement_score":0.68206185,"about_ca_system_score_codex":0.00074036064,"about_ca_system_score_gemma":0.002458525,"threshold_uncertainty_score":0.99985117},"labels":[],"label_agreement":null},{"id":"W6996702661","doi":"","title":"Sparse Matrix-Vector floating-point multiplication with FPGAs for finite element electromagnetics","year":2006,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Pipeline (software); Field-programmable gate array; Sparse matrix; Iterative method; Initialization; Stratix; Finite element method; Solver; Multiplier (economics); Conjugate gradient method","score_opus":0.014864832620845857,"score_gpt":0.2654388472363755,"score_spread":0.25057401461552964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6996702661","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6062386,0.0030207024,0.27282214,0.0011707547,0.01172221,0.026692284,0.006309071,0.0066635874,0.06536064],"genre_scores_gemma":[0.068034954,0.00008647227,0.9199605,0.00026487937,0.00019967026,0.00084879383,0.0012174671,0.00025958772,0.0091277],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99452376,0.00034445475,0.0011763942,0.0017914652,0.0010021401,0.0011617931],"domain_scores_gemma":[0.995647,0.0007740109,0.0010767964,0.0013659911,0.00077100896,0.0003652059],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010271205,0.00095953577,0.0008943593,0.00036923803,0.0010198825,0.00035255347,0.0015587959,0.00052129145,0.000033918026],"category_scores_gemma":[0.00056807656,0.00089057616,0.0003887352,0.0010172017,0.00004668754,0.0007691938,0.00016800509,0.0010181147,0.00007876757],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022081018,0.00065194623,0.000011869334,0.0005019501,0.00020426586,0.00003784707,0.00001972037,0.0010639945,0.0694005,0.15734842,0.00003752926,0.77050114],"study_design_scores_gemma":[0.006497082,0.0058808713,0.0015937507,0.0010968549,0.00074026553,0.0000635139,0.00017933096,0.08527964,0.54313874,0.13048254,0.2189957,0.006051703],"about_ca_topic_score_codex":0.0004073125,"about_ca_topic_score_gemma":0.000442685,"teacher_disagreement_score":0.7644494,"about_ca_system_score_codex":0.00055094407,"about_ca_system_score_gemma":0.00010437719,"threshold_uncertainty_score":0.9993545},"labels":[],"label_agreement":null},{"id":"W6997240984","doi":"","title":"Two floating point LLL reduction algorithms","year":2013,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Reduction (mathematics); Lattice reduction; Block (permutation group theory); FLOPS; Floating point; Partition (number theory); Point (geometry)","score_opus":0.020990417027557592,"score_gpt":0.2800977408662967,"score_spread":0.2591073238387391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6997240984","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56398386,0.0024648325,0.007213707,0.00048561802,0.055929784,0.006450703,0.0008790355,0.0065080496,0.35608438],"genre_scores_gemma":[0.065424725,0.00025253207,0.913891,0.0004444188,0.0006470906,0.00032129575,0.0004139734,0.0003491172,0.018255861],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928971,0.00084064784,0.0013930467,0.0022291353,0.0013608617,0.0012791897],"domain_scores_gemma":[0.9954779,0.00031759698,0.0010712203,0.0016978494,0.0007640201,0.0006713765],"candidate_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016773654,0.0011071565,0.0011040728,0.0005589498,0.0015121786,0.0005684342,0.0023092334,0.0007281067,0.00023819302],"category_scores_gemma":[0.00076139875,0.0011005091,0.0005883636,0.0014570456,0.00007018428,0.002676043,0.00047243602,0.0023487767,0.001051995],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000135001,0.00014067997,6.936091e-7,0.00009801432,0.00009138394,0.0000396842,0.000016577807,0.00002617884,0.04377027,0.10116827,0.000013160579,0.8546216],"study_design_scores_gemma":[0.002692359,0.0008538623,0.0004333201,0.0013646448,0.00030431602,0.0004305659,0.0009705303,0.014221903,0.44516277,0.45887116,0.06901542,0.0056791576],"about_ca_topic_score_codex":0.0009959505,"about_ca_topic_score_gemma":0.000036182602,"teacher_disagreement_score":0.9066773,"about_ca_system_score_codex":0.00067224074,"about_ca_system_score_gemma":0.0000889479,"threshold_uncertainty_score":0.99995285},"labels":[],"label_agreement":null},{"id":"W6999426804","doi":"","title":"Computing with uncertainty truth degrees: a convolution-based degrees","year":2017,"lang":"en","type":"dissertation","venue":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Permission; License; Public use; Key (lock); Product (mathematics); Subject (documents); Order (exchange)","score_opus":0.026315590094846696,"score_gpt":0.27633630510345425,"score_spread":0.25002071500860756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6999426804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011930506,0.0014753963,0.8080414,0.008009801,0.006707719,0.0019182822,0.00014087113,0.0020042104,0.15977184],"genre_scores_gemma":[0.8209684,0.00004684271,0.17641798,0.00013105953,0.00075463776,0.00019409036,0.00057708437,0.0000994361,0.0008104639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9939947,0.00064795394,0.00097610505,0.001719882,0.0014826457,0.0011786842],"domain_scores_gemma":[0.9941662,0.000854673,0.0014648695,0.0017498232,0.0010418709,0.0007225506],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009998191,0.0010017889,0.0011111285,0.0006209199,0.0018885806,0.0011467924,0.0028540434,0.00091913994,0.000021920036],"category_scores_gemma":[0.0009942335,0.00085463916,0.0004356006,0.0007871152,0.000053158816,0.0007087177,0.00021034211,0.00136755,0.000016888282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039877227,0.00066811615,0.00021424376,0.00039878578,0.0003596757,0.00051247206,0.0013456674,0.0025146063,0.00042178345,0.93274957,0.00030475698,0.06011156],"study_design_scores_gemma":[0.0036945245,0.000567335,0.009344355,0.0020800096,0.00030777868,0.0008600872,0.00068188645,0.1425954,0.0012736437,0.0017329335,0.8339742,0.002887904],"about_ca_topic_score_codex":0.000010666923,"about_ca_topic_score_gemma":0.00032635807,"teacher_disagreement_score":0.9310166,"about_ca_system_score_codex":0.00076981675,"about_ca_system_score_gemma":0.0024709108,"threshold_uncertainty_score":0.9998901},"labels":[],"label_agreement":null},{"id":"W7033065352","doi":"","title":"Observation of the decay BÌ0âÎc+pÌÏ0","year":2010,"lang":"en","type":"article","venue":"eScholarship (California Digital Library)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"SLAC National Accelerator Laboratory; Institut National de Physique Nucléaire et de Physique des Particules; Centre National de la Recherche Scientifique; Bundesministerium für Bildung und Forschung; Science and Technology Facilities Council; Natural Sciences and Engineering Research Council of Canada; European Commission; Alfred P. Sloan Foundation; Deutsche Forschungsgemeinschaft; U.S. Department of Energy; National Science Foundation","keywords":"Branching fraction; Collider; Branching (polymer chemistry); Detector; Invariant mass; Particle decay","score_opus":0.018602331341912175,"score_gpt":0.23360929898252275,"score_spread":0.21500696764061059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033065352","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7757226,0.000091747715,0.189488,0.0074831927,0.0020353205,0.00050411886,0.00050518,0.0006348053,0.023535006],"genre_scores_gemma":[0.7953356,0.0000027635845,0.20280176,0.0008200424,0.00016047944,0.0000112313455,0.000017547402,0.000030585095,0.0008199958],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985202,0.000088249915,0.00036164417,0.0003454324,0.000391696,0.0002927706],"domain_scores_gemma":[0.9985376,0.0002315388,0.00017775837,0.00083480094,0.000049216404,0.00016907908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024004353,0.00017569063,0.00018980754,0.000058138405,0.00012174495,0.00081521453,0.0017902927,0.00010651734,0.00007945654],"category_scores_gemma":[0.00031036272,0.00011502219,0.00017850303,0.0008805381,0.00011457138,0.0038515616,0.00065483706,0.00052066805,0.00023336978],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017713739,0.000325816,0.20065679,0.00004354509,0.000031732125,0.000009305493,0.000045971006,0.00000646493,0.018339794,0.2209109,0.0012768635,0.5583351],"study_design_scores_gemma":[0.0005489807,0.00010936491,0.119068354,0.000070342816,0.000011043127,0.000023528482,0.000008170123,0.0034693507,0.16955209,0.20886172,0.49766344,0.00061361084],"about_ca_topic_score_codex":0.0000019335082,"about_ca_topic_score_gemma":3.6950934e-7,"teacher_disagreement_score":0.5577215,"about_ca_system_score_codex":0.000006162496,"about_ca_system_score_gemma":0.000087801425,"threshold_uncertainty_score":0.78611326},"labels":[],"label_agreement":null},{"id":"W7033864144","doi":"","title":"The state of oncology literature as it relates to access to equitable cancer care as experienced by equity-seeking groups and priority populations in Canada","year":2021,"lang":"en","type":"other","venue":"OSF Preprints (OSF Preprints)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cancer; Health care; State (computer science); MEDLINE; Population; Cancer survival","score_opus":0.031177112140332888,"score_gpt":0.3713941293423162,"score_spread":0.34021701720198333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033864144","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01905442,0.0008391622,0.05412722,0.005761847,0.0030868622,0.0037852451,0.00018413471,0.000143888,0.9130172],"genre_scores_gemma":[0.04598042,0.0013783913,0.10870527,0.00264493,0.0001869659,0.0016848175,0.00004296196,0.00027526845,0.83910096],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954455,0.0007371488,0.00059756864,0.0019271552,0.0005792889,0.0007133239],"domain_scores_gemma":[0.99638164,0.00048509004,0.0003664187,0.0021943462,0.00020653778,0.0003659383],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017506807,0.0003519757,0.0006393095,0.00016439184,0.00026816875,0.0005403684,0.002558823,0.0002239479,0.012307201],"category_scores_gemma":[0.0015058251,0.00031632525,0.000073222924,0.00093945983,0.0000816893,0.00022019421,0.007852797,0.00064748887,0.0011010121],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062402425,0.00013697283,0.007984306,0.00032768192,0.00014672383,0.00013986777,0.022888511,0.0014889601,0.0019241777,0.0030523078,0.0683455,0.8935026],"study_design_scores_gemma":[0.0005470974,0.000013471602,0.0056638303,0.0015867072,0.000031286745,0.000026384767,0.0011183068,0.0012229381,0.003189852,0.010488746,0.97509825,0.0010131067],"about_ca_topic_score_codex":0.6994933,"about_ca_topic_score_gemma":0.7683439,"teacher_disagreement_score":0.90675277,"about_ca_system_score_codex":0.0012484344,"about_ca_system_score_gemma":0.0019284248,"threshold_uncertainty_score":0.9999289},"labels":[],"label_agreement":null},{"id":"W7034041388","doi":"","title":"Silicon containing organic-inorganic hybrid materials as EUV photoresists","year":2005,"lang":"en","type":"article","venue":"NPARC","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Silicon; Extreme ultraviolet lithography; Hybrid material; Hybrid system; Process (computing)","score_opus":0.013163004075531585,"score_gpt":0.263996832983639,"score_spread":0.25083382890810746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034041388","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7673124,0.00008855242,0.2177977,0.0033831026,0.0009745616,0.00025302326,0.000007154519,0.0004845574,0.009698967],"genre_scores_gemma":[0.7825428,0.0000118929465,0.21532431,0.0013351176,0.0003473805,0.000009826746,0.0000013767083,0.000017773888,0.0004094715],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984543,0.00014992195,0.00029062002,0.00043441288,0.00026828068,0.00040249433],"domain_scores_gemma":[0.9990122,0.0001424466,0.000104594175,0.0005106085,0.0000587223,0.00017145816],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00043697347,0.00017378008,0.00027416836,0.000053551354,0.00012464488,0.00022825674,0.00078455196,0.000045620018,0.0018864166],"category_scores_gemma":[0.00016375913,0.00015371012,0.000051428335,0.00022639932,0.000037941412,0.00032999297,0.0002760686,0.0001156961,0.00081875664],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000705131,0.000037757214,0.00002161132,0.0000047874923,0.00001033439,0.000025218622,0.00017384793,4.6208137e-7,0.87467074,0.008022365,0.0004815351,0.11654426],"study_design_scores_gemma":[0.00036957228,0.00016245927,0.00051117834,0.000017755734,0.0000064790665,0.0000747898,0.000018528235,0.0015729397,0.96528655,0.015054603,0.016645838,0.00027927372],"about_ca_topic_score_codex":0.000018453435,"about_ca_topic_score_gemma":0.0000015568168,"teacher_disagreement_score":0.11626499,"about_ca_system_score_codex":0.000066141605,"about_ca_system_score_gemma":0.000071073824,"threshold_uncertainty_score":0.99995923},"labels":[],"label_agreement":null},{"id":"W7034842684","doi":"","title":"Yhteisöllisen asumisen merkitys ikääntyneelle : Asukkaiden kokemuksia Wilhelmiina Tenholasta","year":2025,"lang":"fi","type":"other","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Data collection; State (computer science); Set (abstract data type); Quarter (Canadian coin)","score_opus":0.017273555999428276,"score_gpt":0.2833779594071583,"score_spread":0.26610440340773006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034842684","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003534863,0.0016739431,0.47312015,0.0025766944,0.0025740545,0.0006478816,0.000063736385,0.00043196545,0.518908],"genre_scores_gemma":[0.00007062447,0.0007369635,0.37169376,0.0013265844,0.00091704,0.000038807833,0.000015755224,0.00019977326,0.6250007],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9913375,0.0012052417,0.0013174912,0.0029161277,0.0014200158,0.0018036707],"domain_scores_gemma":[0.99397606,0.0010000744,0.0006835296,0.0031323852,0.00034001027,0.00086792995],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0015906506,0.001565997,0.0019870778,0.00075864024,0.0004864871,0.001073838,0.0037287439,0.0011221184,0.020020282],"category_scores_gemma":[0.00057921885,0.0013533382,0.00089366233,0.002152296,0.0004255907,0.00051682926,0.0027177623,0.0015062494,0.007409123],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025018566,0.00041162598,0.00015984353,0.00025192424,0.00043399373,0.00024940693,0.00016493023,0.00002493851,0.0001932667,0.053689588,0.15994538,0.7844501],"study_design_scores_gemma":[0.0008012622,0.00025172305,0.0003965788,0.00069686543,0.00018344981,0.000028647288,0.000079689155,0.020746145,0.00047042017,0.009924471,0.96472204,0.0016987282],"about_ca_topic_score_codex":0.0021195894,"about_ca_topic_score_gemma":0.00011743466,"teacher_disagreement_score":0.80477667,"about_ca_system_score_codex":0.0002753615,"about_ca_system_score_gemma":0.0010219449,"threshold_uncertainty_score":0.99996316},"labels":[],"label_agreement":null},{"id":"W7036684052","doi":"","title":"COMMUNITY DEVELOPMENT OF A SEXUAL HEALTH EDUCATION PROGRAM FOR PERSONS WITH INTELLECTUAL DISABILITIES: A CASE STUDY","year":2009,"lang":"en","type":"article","venue":"Scholarship@Western (Western University)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Resource (disambiguation); Curriculum; Reproductive health; Community education; Work (physics); Health education; Intellectual disability; Human sexuality","score_opus":0.17620476522940276,"score_gpt":0.4034873847801959,"score_spread":0.22728261955079315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7036684052","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.791549,0.000015791995,0.20667332,0.00018548197,0.0000653979,0.0013595045,0.000005394703,0.00013389224,0.000012171796],"genre_scores_gemma":[0.8989645,6.636955e-7,0.10042827,0.00014809439,0.000022073127,0.000018066361,0.0000054903735,0.000012137952,0.00040066533],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9978502,0.0007513558,0.0003060325,0.00043500366,0.0002720351,0.0003853812],"domain_scores_gemma":[0.99822253,0.00043941577,0.00020681639,0.00066530344,0.00020235791,0.00026359578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087398343,0.00024222494,0.00036459428,0.00026395073,0.00063347653,0.00018424181,0.0009190948,0.00005812664,0.0000015354623],"category_scores_gemma":[0.000111881716,0.00022401036,0.000051528295,0.0007193002,0.0001027531,0.00088027364,0.00023889069,0.00042385975,0.0000024911315],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001116709,0.0057224655,0.114505544,0.00014548458,0.000083178,0.00006747491,0.10512335,0.00000551054,0.0000369678,0.00009393367,0.0000010387096,0.7741034],"study_design_scores_gemma":[0.0055537014,0.041478824,0.38826644,0.00056568184,0.00017663946,0.0013393799,0.5555734,0.00006323125,0.00091293274,0.00062515785,0.0035656095,0.0018790241],"about_ca_topic_score_codex":0.000045568882,"about_ca_topic_score_gemma":0.0015210893,"teacher_disagreement_score":0.77222437,"about_ca_system_score_codex":0.00025842505,"about_ca_system_score_gemma":0.0007711814,"threshold_uncertainty_score":0.91348773},"labels":[],"label_agreement":null},{"id":"W7040650297","doi":"","title":"Préface","year":2017,"lang":"fr","type":"book-chapter","venue":"OpenEdition (OpenEdition)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Limiting; Corporatization","score_opus":0.057885179421011596,"score_gpt":0.29996524356390064,"score_spread":0.24208006414288905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7040650297","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005883363,0.0011357291,0.35559404,0.069885366,0.012150973,0.0010470992,0.0005304163,0.00023287638,0.5594176],"genre_scores_gemma":[0.002826564,0.0021632595,0.3257713,0.03290982,0.006403403,0.00036445374,0.00089129363,0.00023467606,0.6284352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9930146,0.00039407014,0.0013874915,0.002302301,0.001690256,0.0012113175],"domain_scores_gemma":[0.99248517,0.0006533078,0.001753644,0.0030601237,0.001041994,0.0010057362],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"category_scores_codex":[0.0014836193,0.0013467219,0.0014882932,0.00031957508,0.0023307248,0.002641909,0.003857363,0.0010220123,0.012595642],"category_scores_gemma":[0.0004981388,0.0013956486,0.0007662707,0.00014249241,0.0012783685,0.02646234,0.0016649115,0.0014674762,0.019465541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021544873,0.00013073224,0.000003648567,0.00008767541,0.00011293564,0.00032826778,0.000031843738,0.00002419981,0.00011054437,0.7563671,0.0052329735,0.23754853],"study_design_scores_gemma":[0.0008881603,0.0005240644,0.0015945496,0.0011119151,0.00015828278,0.00028157554,0.000009739043,0.0016529805,0.0009033193,0.13700691,0.85426325,0.0016052775],"about_ca_topic_score_codex":0.00013563364,"about_ca_topic_score_gemma":0.00022106335,"teacher_disagreement_score":0.84903026,"about_ca_system_score_codex":0.00034787683,"about_ca_system_score_gemma":0.00051981804,"threshold_uncertainty_score":0.99992836},"labels":[],"label_agreement":null},{"id":"W7042266066","doi":"","title":"Patients' experience using a comprehensive web-based multimedia cancer information navigation platform","year":2018,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de Recherche du Québec - Santé; Canadian Institutes of Health Research","keywords":"Psychosocial; Competence (human resources); Autonomy; Cancer; Health care; Health information; Colorectal cancer; Health professionals","score_opus":0.028142168458529158,"score_gpt":0.2984056092033137,"score_spread":0.27026344074478453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7042266066","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98904735,0.00008635395,0.0013167489,0.000007860513,0.0052658143,0.0010884993,0.0006935251,0.0004413394,0.0020525223],"genre_scores_gemma":[0.4255358,0.00007140771,0.57010126,0.001076237,0.0001864428,0.0005493051,0.002069788,0.0001525143,0.00025725257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955001,0.00022470705,0.0011476282,0.0009785439,0.0013471497,0.00080186647],"domain_scores_gemma":[0.9955368,0.00024495152,0.0012507611,0.0008973121,0.0016597183,0.00041044684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037180664,0.000789619,0.00071051234,0.0004616077,0.0012112871,0.0003452845,0.0013996928,0.0006383741,0.00009098169],"category_scores_gemma":[0.00037475067,0.00078520604,0.00029129724,0.0012229716,0.00010795831,0.004656673,0.00022733168,0.0009706761,0.00017690065],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008989096,0.00014701419,0.00005757804,0.00023736108,0.000056950954,0.000008337231,0.00012229683,0.00013179956,0.007190292,0.0027306727,0.0000045943907,0.98922324],"study_design_scores_gemma":[0.009026275,0.0012390701,0.009539613,0.0041061826,0.00034179233,0.000022675626,0.001100898,0.46998852,0.2967261,0.022924067,0.17819268,0.006792147],"about_ca_topic_score_codex":0.000500244,"about_ca_topic_score_gemma":0.000046788893,"teacher_disagreement_score":0.98243105,"about_ca_system_score_codex":0.0009036992,"about_ca_system_score_gemma":0.00018708916,"threshold_uncertainty_score":0.99945986},"labels":[],"label_agreement":null},{"id":"W7094192768","doi":"","title":"Canadian Association of General Surgeons Evidence Based Reviews in Surgery. 2","year":2002,"lang":"en","type":"article","venue":"Europe PMC (PubMed Central)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Association (psychology); Evidence-based practice; MEDLINE; Evidence-based medicine; Public health; Systematic review","score_opus":0.054135872447719655,"score_gpt":0.2527157844903392,"score_spread":0.19857991204261954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7094192768","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39234188,0.044727143,0.3867243,0.13258174,0.019850135,0.006598103,0.00013469171,0.0008225952,0.016219404],"genre_scores_gemma":[0.7346995,0.016428743,0.2340661,0.006086174,0.00056727015,0.0002211045,0.000009046212,0.00008332964,0.007838726],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99677706,0.001026496,0.00052574347,0.0003690262,0.000312485,0.0009892028],"domain_scores_gemma":[0.9981023,0.00065071526,0.00025140774,0.0004429902,0.0000855932,0.00046701232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026309537,0.00014848911,0.00037936532,0.00020736264,0.000047306952,0.00007186319,0.0005324319,0.000052110692,0.00011086747],"category_scores_gemma":[0.0033442888,0.00013516616,0.00012348205,0.0014860479,0.000017108701,0.00038659846,0.00004931108,0.00017573057,0.000052874966],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000237066,0.00010155954,0.37317744,0.000041605304,0.000010079294,0.000085265005,0.0004679489,0.00008059412,0.00018789696,0.00056115474,0.02138107,0.603903],"study_design_scores_gemma":[0.00023561313,0.000025017107,0.6632362,0.00026768216,0.000011086365,0.0000037408472,0.0000019278045,0.029657934,0.0011678031,0.000119843964,0.304848,0.0004251501],"about_ca_topic_score_codex":0.013286659,"about_ca_topic_score_gemma":0.004322855,"teacher_disagreement_score":0.6034779,"about_ca_system_score_codex":0.0004295338,"about_ca_system_score_gemma":0.00015768236,"threshold_uncertainty_score":0.9932839},"labels":[],"label_agreement":null},{"id":"W7099318928","doi":"","title":"This paper represents the views of the authors and does not necessarily reflect the opinions of Statistics Canada. Enhancing Food Safety and Productivity: Technology Use in the Canadian Food Processing Industry","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Food safety; Food processing; Food industry; Government (linguistics); Food supply","score_opus":0.04978905326025906,"score_gpt":0.28376420649204664,"score_spread":0.23397515323178758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099318928","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23461697,0.0030788423,0.15335217,0.59660834,0.0018331419,0.005088418,0.0007065433,0.00011083697,0.004604733],"genre_scores_gemma":[0.9741003,0.000034442044,0.024774853,0.00082890916,0.000024453107,0.000017617662,3.346787e-7,0.000006780937,0.00021229434],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9983271,0.00045355255,0.0003313865,0.00031260285,0.00029975697,0.00027562137],"domain_scores_gemma":[0.9983704,0.0005860445,0.00018759652,0.00070906634,0.00009143349,0.00005543503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010317226,0.00012674472,0.00020528401,0.00005942265,0.0005042486,0.000110331435,0.0008040218,0.00010846082,0.0000066652146],"category_scores_gemma":[0.0009886635,0.00004687694,0.00001544939,0.0010265119,0.00035293621,0.00019143957,0.00026584853,0.0006209449,4.51609e-8],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012348324,0.00014102546,0.025742132,0.00014390847,0.000112556896,0.000008128776,0.0119450195,0.000055402506,0.0015023714,0.08386547,0.0027947244,0.8736769],"study_design_scores_gemma":[0.0025188196,0.0018916505,0.4935431,0.0012205258,0.00029435515,0.00047475426,0.014504999,0.0866494,0.07379585,0.09242204,0.2301716,0.0025129095],"about_ca_topic_score_codex":0.4199353,"about_ca_topic_score_gemma":0.9573641,"teacher_disagreement_score":0.871164,"about_ca_system_score_codex":0.00004521623,"about_ca_system_score_gemma":0.0003969983,"threshold_uncertainty_score":0.5839274},"labels":[],"label_agreement":null},{"id":"W7100041281","doi":"","title":"Surrogate Buyers in Corporate Buying of Luxury Hotel Rooms","year":2014,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Tourism; Sample (material); Hotel industry; Hospitality industry; Hospitality; Quarter (Canadian coin); Stakeholder; Business tourism","score_opus":0.029020186605008217,"score_gpt":0.25139274920571486,"score_spread":0.22237256260070665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100041281","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05734132,0.000020134687,0.9381931,0.00029246125,0.00025145718,0.000050840787,3.1005277e-7,0.000052492767,0.0037979237],"genre_scores_gemma":[0.46092767,0.0000047986337,0.53863466,0.00018152432,0.000020400716,0.0000020713655,1.9569447e-7,0.0000041822586,0.0002244923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990524,0.00013372781,0.000223336,0.00023214391,0.00015377317,0.00020462998],"domain_scores_gemma":[0.9992853,0.00017763692,0.00012380785,0.00030558763,0.00003696865,0.00007073032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072262547,0.000083298204,0.00019327781,0.000083639265,0.00002132857,0.00003208616,0.0004444612,0.000033638724,0.000014781235],"category_scores_gemma":[0.00008147666,0.00006607268,0.000042133368,0.00047672205,0.000036908215,0.00018600756,0.0001423858,0.000089584435,0.000021378053],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005703623,0.00009218183,0.007836932,0.000024824922,0.000007843314,0.000011860213,0.0002236586,0.0007797429,0.00845859,0.07383228,0.00009317519,0.90863323],"study_design_scores_gemma":[0.0007856044,0.00021445678,0.028957149,0.000051998468,0.0000031546726,0.00000680036,0.00004481727,0.8459124,0.02650077,0.0952081,0.001946356,0.0003683939],"about_ca_topic_score_codex":0.00015921393,"about_ca_topic_score_gemma":0.0000070873575,"teacher_disagreement_score":0.9082648,"about_ca_system_score_codex":0.000010934593,"about_ca_system_score_gemma":0.000017725311,"threshold_uncertainty_score":0.26943657},"labels":[],"label_agreement":null},{"id":"W7117958629","doi":"10.1145/3712285.3787186","title":"10.1145/3712285.3787186","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Component (thermodynamics); Key (lock); Representation (politics)","score_opus":0.00792250198283495,"score_gpt":0.21001345397978088,"score_spread":0.20209095199694593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117958629","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004651916,0.00004197756,0.015540876,0.0010446641,0.000009417298,0.00009957448,0.0000020217892,0.00024342688,0.98297155],"genre_scores_gemma":[0.000011304878,2.3152374e-7,0.17403154,0.0002298641,0.00009500921,0.000008366795,5.604931e-7,0.0000077208515,0.8256154],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990122,0.00006644972,0.00013850021,0.0003054324,0.00019136125,0.0002860731],"domain_scores_gemma":[0.9992291,0.00007521778,0.000019313642,0.00045450105,0.000027894912,0.00019400139],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00019355284,0.0001109311,0.00014650809,0.00004561585,0.00007252791,0.000104641214,0.00069287175,0.00003462257,0.9401033],"category_scores_gemma":[0.000027304824,0.00009619418,0.000054893833,0.00042481706,0.000019749885,0.00017270712,0.00011335245,0.000080256425,0.96331096],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036793217,0.00002846247,3.7534505e-8,0.0000010372233,0.0000035970202,0.0000070142364,0.0000100190155,0.000021592568,0.00004916801,0.000040678202,0.021393115,0.9784416],"study_design_scores_gemma":[0.000093878654,0.00012927559,0.000028063421,0.0000056038266,0.0000022622448,0.0000072987264,1.2774973e-7,0.009013367,0.00015124478,0.00028612584,0.99013317,0.00014960651],"about_ca_topic_score_codex":0.0000130164,"about_ca_topic_score_gemma":8.146923e-9,"teacher_disagreement_score":0.978292,"about_ca_system_score_codex":0.000016108987,"about_ca_system_score_gemma":0.00001856908,"threshold_uncertainty_score":0.39226848},"labels":[],"label_agreement":null},{"id":"W7117989144","doi":"10.1145/3712285.3787160","title":"10.1145/3712285.3787160","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Matrix (chemical analysis); Matrix multiplication; Multiplication (music)","score_opus":0.00793204319213153,"score_gpt":0.21006109204174314,"score_spread":0.2021290488496116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117989144","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041270687,0.00004130641,0.015792646,0.0012624882,0.000009428595,0.000101649384,0.0000020762643,0.00024805512,0.9825011],"genre_scores_gemma":[0.000013067624,2.1772112e-7,0.17343642,0.00022305478,0.000093792,0.000008406762,5.6397926e-7,0.000007743869,0.82621676],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999011,0.000067340436,0.000138726,0.00030541752,0.00019124911,0.00028631187],"domain_scores_gemma":[0.9992272,0.00007555251,0.000019336494,0.00045534628,0.000028200926,0.00019432874],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00019326012,0.00011101261,0.00014675016,0.000045683173,0.00007196118,0.00010263152,0.0006922322,0.00003464084,0.94370747],"category_scores_gemma":[0.000027847113,0.000096230346,0.00005527313,0.0004291725,0.000019769046,0.00017436547,0.00011358667,0.00008031391,0.96249473],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036576,0.000028477343,3.6745615e-8,9.960072e-7,0.0000036241154,0.0000074210725,0.0000098527025,0.00002183974,0.000050315863,0.000036573852,0.022409841,0.97742736],"study_design_scores_gemma":[0.00009332902,0.00013158155,0.000029015015,0.000005636673,0.0000021648643,0.0000075565076,1.1715932e-7,0.00950355,0.00015061321,0.00027967783,0.9896471,0.00014964408],"about_ca_topic_score_codex":0.000012693858,"about_ca_topic_score_gemma":8.178301e-9,"teacher_disagreement_score":0.9772777,"about_ca_system_score_codex":0.000016177166,"about_ca_system_score_gemma":0.00001816463,"threshold_uncertainty_score":0.39241594},"labels":[],"label_agreement":null},{"id":"W7125635159","doi":"10.1109/cascon66301.2025.00066","title":"A Multi-Table Approach to Floating-Point Function Approximation","year":2025,"lang":"","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); McMaster University","funders":"","keywords":"Function (biology); Function approximation; Approximation theory; Approximation algorithm; Term (time); Stability (learning theory)","score_opus":0.03342688432514955,"score_gpt":0.29553587074075166,"score_spread":0.2621089864156021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125635159","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008343884,0.00019059239,0.9419457,0.0013774883,0.0023160826,0.0009846506,0.0000022819277,0.00024575624,0.05285406],"genre_scores_gemma":[0.013970201,0.000008505701,0.96671057,0.0026951705,0.00015647188,0.00009166242,0.0000031745114,0.00001494955,0.016349293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654937,0.00039515973,0.00071488717,0.0012456009,0.0004128521,0.000682138],"domain_scores_gemma":[0.998192,0.00015416706,0.00015300962,0.000916407,0.00030218824,0.00028220305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015655941,0.00036627322,0.00045766856,0.0003315275,0.0004430149,0.00075618364,0.0008251125,0.00017007026,0.000069541944],"category_scores_gemma":[0.00037913714,0.0003244994,0.00015083939,0.0030543655,0.00004352226,0.0007398507,0.00074334966,0.00033419862,0.00020377162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025577561,0.00090477784,0.00006184077,0.0001461608,0.000053834632,6.7896883e-7,0.000482912,0.0023503462,0.002801607,0.1372926,0.0014730648,0.8544066],"study_design_scores_gemma":[0.0006147145,0.00021649878,0.0010942429,0.00008455828,0.00003480036,0.0000023144762,0.00022638083,0.9785386,0.0026361635,0.0066922735,0.009484878,0.00037461557],"about_ca_topic_score_codex":0.00026341563,"about_ca_topic_score_gemma":0.0000015840222,"teacher_disagreement_score":0.97618824,"about_ca_system_score_codex":0.00015217328,"about_ca_system_score_gemma":0.00017835182,"threshold_uncertainty_score":0.9999207},"labels":[],"label_agreement":null},{"id":"W7132011429","doi":"","title":"Report on the Last Work by Dr. Erich Nuding","year":2016,"lang":"en","type":"article","venue":"Digital Repository (National Repository of Grey Literature)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Work (physics); Facsimile; Quarter (Canadian coin); Mistake","score_opus":0.012281944063287234,"score_gpt":0.24928617091460992,"score_spread":0.2370042268513227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132011429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17809628,0.0028647247,0.39795166,0.015973814,0.012959485,0.0014608881,0.00015872606,0.0010591496,0.3894753],"genre_scores_gemma":[0.96626455,0.0000052703595,0.0066017224,0.00032264987,0.00063281844,0.000045306107,0.000010011963,0.000030117602,0.026087547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99667174,0.00017329406,0.00073633343,0.0007332882,0.0013555168,0.00032984593],"domain_scores_gemma":[0.9964698,0.0011670614,0.00053450646,0.00077812566,0.00087358523,0.00017693087],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00042410067,0.00029884843,0.00028935296,0.000117793665,0.00037842023,0.0011445795,0.00097158126,0.00013320807,0.0000020297405],"category_scores_gemma":[0.00094213104,0.00016820322,0.00024664678,0.0007439786,0.00018328358,0.0015172643,0.000211354,0.00024280752,0.000013752704],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039720608,0.002303456,0.062975086,0.00014389018,0.00085724355,0.0035220275,0.0014898927,0.00006067258,0.259104,0.2652342,0.23207535,0.17183696],"study_design_scores_gemma":[0.001631289,0.001284693,0.061647013,0.0031127534,0.000049704136,0.00526217,0.000060853807,0.00064907945,0.38935006,0.039656505,0.49474475,0.0025511526],"about_ca_topic_score_codex":0.0000013808851,"about_ca_topic_score_gemma":2.4495284e-8,"teacher_disagreement_score":0.7881683,"about_ca_system_score_codex":0.00015141754,"about_ca_system_score_gemma":0.0001427893,"threshold_uncertainty_score":0.99989235},"labels":[],"label_agreement":null},{"id":"W7140600106","doi":"10.1109/fpl68686.2025.00018","title":"FINN-GL: Generalized Mixed-Precision Extensions for FPGA-Accelerated LSTMS","year":2025,"lang":"","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Advanced Micro Devices","keywords":"Feature (linguistics); Sequence (biology); Generalization; Matching (statistics)","score_opus":0.06500321655007829,"score_gpt":0.36771589737225935,"score_spread":0.30271268082218106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7140600106","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022443696,0.0015490531,0.9727601,0.009259658,0.008958437,0.0013370375,0.000035453628,0.00029823047,0.003557653],"genre_scores_gemma":[0.010567794,0.00047164585,0.9423785,0.00486834,0.00031924422,0.00017240945,0.00001335431,0.00003885855,0.04116983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994725,0.0004860812,0.0013112621,0.0017807663,0.0005168574,0.0011800496],"domain_scores_gemma":[0.9949626,0.0017120762,0.00027417278,0.0016713548,0.0009431036,0.00043674052],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014088275,0.0006453426,0.0010506234,0.00038109566,0.00096159516,0.0009347874,0.0018761988,0.00036698935,0.0005653339],"category_scores_gemma":[0.0009735237,0.00052416784,0.0006107095,0.0029481994,0.00018039318,0.0005755836,0.0012537832,0.0004016294,0.00012065091],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007966722,0.00033984735,0.000010083566,0.00004117709,0.000092244045,0.000014952482,0.000062896135,0.00022227629,0.0077355443,0.077599086,0.027797677,0.88600457],"study_design_scores_gemma":[0.0021435483,0.00039575592,0.0006149526,0.00018526704,0.00008464549,0.000009506342,0.000038436145,0.7330538,0.030385163,0.09192581,0.14049019,0.00067295705],"about_ca_topic_score_codex":0.00016775625,"about_ca_topic_score_gemma":0.0000099990175,"teacher_disagreement_score":0.8853316,"about_ca_system_score_codex":0.000101931044,"about_ca_system_score_gemma":0.00036869792,"threshold_uncertainty_score":0.999721},"labels":[],"label_agreement":null},{"id":"W903632109","doi":"10.1007/978-3-319-12481-0","title":"An Introduction to Modern Analysis","year":2015,"lang":"en","type":"book","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Mount Royal University","funders":"","keywords":"History","score_opus":0.02503700869168377,"score_gpt":0.3121167884643101,"score_spread":0.28707977977262633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W903632109","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.4437413e-7,0.000029114524,0.906231,0.0020198228,0.00047633454,0.000079872145,0.0000026336966,0.00017728475,0.090983406],"genre_scores_gemma":[0.0000050761305,0.0000012316729,0.5785779,0.00030331686,0.0011458031,0.0000041807516,0.000012474155,0.000007552968,0.41994247],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984371,0.00007639655,0.00018918593,0.00072840956,0.00038379387,0.00018509323],"domain_scores_gemma":[0.99823487,0.000021599704,0.00006691748,0.0011715004,0.00018856039,0.00031656897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046627613,0.00017246437,0.00037590755,0.0003630863,0.00003514254,0.00017716708,0.00092156365,0.00011310999,0.000076127195],"category_scores_gemma":[0.0000253263,0.00013824734,0.0001293641,0.00065951276,0.000013793361,0.00023666646,0.00018605325,0.00015692489,0.00013435847],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015286868,0.000029427812,0.0000010573867,0.00000281543,0.00015825573,0.000004044951,0.000113199676,0.0014004775,0.0000250746,0.051824857,0.116008356,0.8304309],"study_design_scores_gemma":[0.000036121623,0.00016033037,0.00000968623,0.0000015180632,0.000115916824,0.0000020137493,0.0000017885824,0.29109868,0.000025933914,0.15665805,0.5515851,0.00030489915],"about_ca_topic_score_codex":0.000017611046,"about_ca_topic_score_gemma":0.000006382473,"teacher_disagreement_score":0.830126,"about_ca_system_score_codex":0.00012118101,"about_ca_system_score_gemma":0.00013575397,"threshold_uncertainty_score":0.56375635},"labels":[],"label_agreement":null},{"id":"W941612151","doi":"10.34767/simis.2011.05.02","title":"Crowdsourcing in rescue fire service – proposed application","year":2023,"lang":"en","type":"article","venue":"Repository of Kazimierz Wielki University","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Crowdsourcing; Service (business); Computer security; Business; Computer science; World Wide Web; Marketing","score_opus":0.011762760897319362,"score_gpt":0.22808932360512563,"score_spread":0.21632656270780626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W941612151","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75572234,0.000035173096,0.23763348,0.0017751032,0.0003505395,0.0003513739,0.0000025130107,0.00040142683,0.0037280456],"genre_scores_gemma":[0.92636967,0.000015707086,0.072490625,0.00006455913,0.000051480027,9.921981e-7,0.0000022425957,0.000008325407,0.0009964011],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989724,0.00014539658,0.00015819869,0.00032871758,0.0002032355,0.00019206198],"domain_scores_gemma":[0.9992115,0.00009958768,0.000091766364,0.0004325354,0.000089689995,0.0000749456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028269656,0.00008918018,0.00016581794,0.00014345808,0.00015182084,0.000018697623,0.00063166843,0.00007063897,9.428822e-7],"category_scores_gemma":[0.00002066031,0.000096517724,0.000053610278,0.0015955119,0.000041043317,0.0003130043,0.0002736989,0.00012669344,0.000014156528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020794431,0.000783408,0.03925267,0.0007579337,0.00012687508,0.0013350854,0.009533106,0.012714517,0.37857163,0.030002605,0.0012444787,0.5254698],"study_design_scores_gemma":[0.0013795007,0.00019753737,0.15881906,0.00020095934,0.000026527445,0.000035740697,0.0013058325,0.7703459,0.04727842,0.0023809092,0.017369622,0.000659954],"about_ca_topic_score_codex":0.0006432802,"about_ca_topic_score_gemma":0.000012634936,"teacher_disagreement_score":0.7576314,"about_ca_system_score_codex":0.000084461695,"about_ca_system_score_gemma":0.000069046975,"threshold_uncertainty_score":0.39358786},"labels":[],"label_agreement":null},{"id":"W964710139","doi":"10.1007/1-84628-210-1_39","title":"Predicting Design Quality through Sensitivity Modeling","year":2006,"lang":"en","type":"book-chapter","venue":"Springer series in advanced manufacturing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Université du Québec à Trois-Rivières","funders":"","keywords":"Quality (philosophy); Sensitivity (control systems); Product (mathematics); Context (archaeology); Computer science; Probabilistic design; Product design; Reliability engineering; Domain (mathematical analysis); Engineering; Engineering design process; Mathematics; Mechanical engineering","score_opus":0.04668122705234959,"score_gpt":0.2925921926027523,"score_spread":0.24591096555040273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W964710139","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006697433,0.00039068784,0.9384628,0.00012409728,0.0010003394,0.00042425492,0.000008314451,0.00050581,0.058413967],"genre_scores_gemma":[0.015085027,0.00022627115,0.9675523,0.00012207268,0.00033576603,0.000028606208,0.0000052318383,0.00010868471,0.016536037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961799,0.00018021169,0.0009309606,0.0013661118,0.0005722038,0.00077064836],"domain_scores_gemma":[0.99775255,0.00045311588,0.00044084722,0.001175891,0.00006778001,0.000109790926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010954792,0.0007251787,0.00093766686,0.00017425217,0.00023330582,0.0001901811,0.0006968151,0.00033980332,0.0000115045295],"category_scores_gemma":[0.00009957103,0.0007540763,0.0002249432,0.00007347928,0.00010484677,0.0015551031,0.0009611303,0.0010995965,0.000015367534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007851651,0.000049870818,0.000029808483,0.00031521966,0.00006953048,0.0004983036,0.00047997478,0.63691235,0.00082355615,0.08832682,0.000012380906,0.2724037],"study_design_scores_gemma":[0.0009731467,0.00018639381,0.0002520543,0.0014371261,0.00003649866,0.00009077443,0.00005410929,0.20882383,0.065672815,0.70012045,0.019097798,0.0032550269],"about_ca_topic_score_codex":0.00018758034,"about_ca_topic_score_gemma":0.000047779904,"teacher_disagreement_score":0.61179364,"about_ca_system_score_codex":0.00030146306,"about_ca_system_score_gemma":0.000066340384,"threshold_uncertainty_score":0.99949104},"labels":[],"label_agreement":null},{"id":"W968296380","doi":"10.1007/978-1-4614-8453-0_5","title":"Solving Ax = λx","year":2013,"lang":"en","type":"book-chapter","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Eigenvalues and eigenvectors; Mathematics; Factoring; Context (archaeology); Simple (philosophy); Algebra over a field; Applied mathematics; Lambda; Linear algebra; Pure mathematics; Geometry; Physics","score_opus":0.028221643925140736,"score_gpt":0.25425422480978666,"score_spread":0.22603258088464592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W968296380","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.9849283e-8,0.000118293596,0.48994368,0.0002789243,0.0003758221,0.000054519205,4.399727e-7,0.000114527444,0.5091138],"genre_scores_gemma":[0.0000024832566,0.000032647236,0.4863791,0.00045863568,0.00015324366,0.000002450537,4.2887248e-7,0.000011814843,0.5129592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887276,0.00001262448,0.00020614729,0.00043660688,0.00024400408,0.00022784699],"domain_scores_gemma":[0.9989799,0.000119932156,0.00009457282,0.00061017065,0.0000628595,0.00013254573],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00013381992,0.0002193867,0.00027311864,0.00006630233,0.00005901444,0.00019558247,0.00086258916,0.00015868353,0.002607222],"category_scores_gemma":[0.00001450448,0.00016467739,0.00013154755,0.000026312144,0.000034487224,0.00019473155,0.00044375795,0.0002637938,0.0031169523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.1312004e-8,0.0000017126127,9.061706e-8,0.0000030943797,0.0000065526247,0.0000059837284,0.0000066023063,1.5293719e-7,0.000008196764,0.5656302,0.0047020917,0.4296353],"study_design_scores_gemma":[0.000038068356,0.000034192857,0.000003910923,0.000032515843,0.000003777142,0.000007919726,5.3270605e-7,0.007046421,0.000040235307,0.3534627,0.6390514,0.00027837142],"about_ca_topic_score_codex":0.00002403061,"about_ca_topic_score_gemma":4.6203058e-7,"teacher_disagreement_score":0.6343493,"about_ca_system_score_codex":0.000022800727,"about_ca_system_score_gemma":0.000031869946,"threshold_uncertainty_score":0.99830455},"labels":[],"label_agreement":null}]}