{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":49,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":49,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"10620b39c15a","filters":{"venue":"ACM Transactions on Mathematical Software"}},"results":[{"id":"W1963898916","doi":"10.1145/1268776.1268777","title":"TestU01","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":998,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Generator (circuit theory); Random number generation; Class (philosophy); Software; Statistical hypothesis testing; Test suite; Pseudorandom number generator; Point (geometry); Algorithm; Function (biology); ANSI C; Theoretical computer science; Test case; Programming language; Mathematics; Artificial intelligence; Statistics; Power (physics)","retraction":null,"screen_n_in":null,"score":{"opus":0.02159482154592658,"gpt":0.2709987624452465,"spread":0.2494039408993199,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005105472,0.0001868928,0.0001847097,0.0001640971,0.0002059411,0.00009779132,0.0009273508,0.00009992075,0.0003835927],"category_scores_gemma":[0.0003852152,0.0001662462,0.0001398349,0.0005532413,0.00006860561,0.0004095345,0.00002087773,0.0003031733,0.001432278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001026261,"about_ca_system_score_gemma":0.00003921036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004708828,"about_ca_topic_score_gemma":0.00000431089,"domain_scores_codex":[0.9984069,0.00003207947,0.0003331291,0.0003692858,0.0004670822,0.0003914963],"domain_scores_gemma":[0.9973988,0.001209415,0.00005558152,0.00104609,0.00008549352,0.0002046489],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002411358,0.0007833544,0.00003022366,0.00009068737,0.00003424573,0.00005942415,0.0004918635,0.0004136608,0.001300653,0.009501133,0.0001015361,0.9871691],"study_design_scores_gemma":[0.0007350516,0.0003359393,0.0009451018,0.000141853,0.00003634491,0.000132284,0.00005934228,0.002749972,0.02262417,0.970059,0.001641654,0.000539296],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002044508,0.00001466577,0.9955096,0.0009161464,0.0001534966,0.0001968854,0.000003996523,0.0008146934,0.0003460115],"genre_scores_gemma":[0.09732899,0.000002872531,0.9015675,0.0005924901,0.00003786643,0.00002169793,0.000001510803,0.00002060114,0.0004264805],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9866298,"threshold_uncertainty_score":0.9993452,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969551552","doi":"10.1145/838250.838251","title":"The complex-step derivative approximation","year":2003,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":736,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Automatic differentiation; Maintainability; Robustness (evolution); Computer science; Implementation; Fortran; Python (programming language); Algorithm; Mathematical optimization; Computational science; Programming language; Mathematics; Computation","retraction":null,"screen_n_in":null,"score":{"opus":0.1111430008825493,"gpt":0.3599346648940409,"spread":0.2487916640114916,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006802176,0.0002888655,0.000359041,0.00007552878,0.0009671506,0.0001136677,0.0004850538,0.0001317565,0.001059421],"category_scores_gemma":[0.00818844,0.0001946869,0.0002462286,0.000461157,0.0002366455,0.0001344277,0.00001109884,0.0004066228,0.0003416661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001083421,"about_ca_system_score_gemma":0.00004087142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002150168,"about_ca_topic_score_gemma":0.000008032991,"domain_scores_codex":[0.9976195,0.0004787004,0.0006037342,0.0003241376,0.0005425966,0.0004313982],"domain_scores_gemma":[0.9901916,0.008269864,0.000168916,0.001056713,0.0001484094,0.0001645123],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004449295,0.001099014,0.00001518368,0.0001979835,0.0002252784,0.000002124632,0.0006718881,0.00005042806,0.0002910871,0.3891869,0.0001187656,0.6080968],"study_design_scores_gemma":[0.00034757,0.00008955578,0.00005411596,0.00004636399,0.00009573701,0.00001305103,0.0003192245,0.0002192612,0.001651073,0.9944559,0.00247925,0.0002289194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001662549,0.0000111633,0.9957432,0.0008136163,0.000151927,0.0006963391,0.00002068098,0.0003553523,0.0005451328],"genre_scores_gemma":[0.01468843,0.000007732466,0.9839733,0.0001212573,0.00001988548,0.0003094848,0.000004686347,0.00005963174,0.0008156248],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6078679,"threshold_uncertainty_score":0.9998537,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094132822","doi":"10.1145/1916461.1916468","title":"Algorithm 909","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":627,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Software; Mathematical optimization; Algorithm; Programming language; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1198276313203575,"gpt":0.3502867428089378,"spread":0.2304591114885803,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002886584,0.0002854252,0.0003601114,0.0001960584,0.0002721433,0.00003449159,0.0006331673,0.0001793382,0.009935072],"category_scores_gemma":[0.001257513,0.0002482624,0.0001924172,0.0004679725,0.0001636724,0.0002418476,0.00002356071,0.000489202,0.001311008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009476496,"about_ca_system_score_gemma":0.00004633758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000033689,"about_ca_topic_score_gemma":0.00000184235,"domain_scores_codex":[0.9979106,0.00008550988,0.0004823522,0.0004066282,0.0006167218,0.0004982363],"domain_scores_gemma":[0.9971861,0.001113619,0.00008662282,0.001142176,0.000192423,0.0002791214],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003935643,0.001571897,0.000007545175,0.0001655577,0.0001182865,0.00003886136,0.001235429,0.0001018539,0.000007863947,0.00533995,0.00010659,0.9912668],"study_design_scores_gemma":[0.0004593733,0.0001419208,0.00001722535,0.00006946546,0.000047271,0.00003984444,0.000196855,0.001340786,0.001708678,0.9953488,0.0003365692,0.0002931744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001727926,0.00001188857,0.9972354,0.0001436544,0.00009306479,0.0004669061,0.00004283361,0.0006989336,0.001134554],"genre_scores_gemma":[0.0005609176,0.00002060417,0.9951409,0.0001157667,0.00003286445,0.0001690457,0.000004329772,0.00009060906,0.003865012],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9909737,"threshold_uncertainty_score":0.999997,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986517320","doi":"10.1145/1132973.1132974","title":"Improved long-period generators based on linear recurrences modulo 2","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":282,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Modulo; Mersenne prime; Mathematics; Period (music); Random number generation; Algorithm; Linear feedback shift register; Mixing (physics); Pseudorandom number generator; Arithmetic; Discrete mathematics; Computer science; Shift register; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01491782847864873,"gpt":0.2470255346317831,"spread":0.2321077061531344,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002704145,0.0003276185,0.0002966028,0.0002183563,0.0003252388,0.0001918147,0.0009661771,0.0001518535,0.0003184085],"category_scores_gemma":[0.0002155885,0.0002820318,0.0002255609,0.0006370561,0.000103976,0.000386643,0.00001631513,0.000393326,0.0003856662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001304708,"about_ca_system_score_gemma":0.0001097427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002086567,"about_ca_topic_score_gemma":0.00001114367,"domain_scores_codex":[0.9978086,0.0001032619,0.0004488133,0.0006347093,0.0005834601,0.0004211279],"domain_scores_gemma":[0.9978537,0.000525594,0.0001032214,0.001222113,0.0001285605,0.0001667982],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001981501,0.005649497,0.0001641125,0.0005608407,0.00009616911,0.000125535,0.0004579295,0.1542713,0.005243388,0.006287047,0.0004299236,0.8265161],"study_design_scores_gemma":[0.00143553,0.0009673632,0.0003079494,0.0002740981,0.00005505443,0.00003176323,0.00002084994,0.77527,0.04505654,0.1753697,0.0002739215,0.0009372505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005964482,0.00002094535,0.9911557,0.001449577,0.0002680218,0.0003439928,0.00002842032,0.0007019901,0.00006682661],"genre_scores_gemma":[0.2565822,0.000002711397,0.7425749,0.0004322563,0.00009970737,0.0001174042,0.00001466573,0.00003252983,0.0001436375],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8255788,"threshold_uncertainty_score":0.9999632,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1995548785","doi":"10.1145/1206040.1206041","title":"Robust and reliable defect control for Runge-Kutta methods","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":100,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Fields Institute for Research in Mathematical Sciences","keywords":"Runge–Kutta methods; Ordinary differential equation; Interval (graph theory); Initial value problem; Ode; Computer science; Measure (data warehouse); Differential equation; Mathematics; Applied mathematics; Algorithm; Mathematical optimization; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.1081161445030232,"gpt":0.3969318327725593,"spread":0.2888156882695361,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002320339,0.0003390845,0.0006534655,0.0001768136,0.0004142727,0.00006744128,0.000333034,0.0002560756,0.0004112379],"category_scores_gemma":[0.006260084,0.0002851732,0.0004041003,0.000325492,0.000155014,0.0001381323,0.00001367374,0.0003832982,0.0000402506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008855824,"about_ca_system_score_gemma":0.00002992299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005304785,"about_ca_topic_score_gemma":0.000009386316,"domain_scores_codex":[0.9977273,0.0001764236,0.0007101799,0.000474839,0.0003212875,0.0005899404],"domain_scores_gemma":[0.9805002,0.01807012,0.000150977,0.0008160808,0.0001554782,0.0003070983],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002954334,0.0011586,0.00003411885,0.0009032695,0.0004450536,0.000003979484,0.0004058242,0.0001525342,0.0007908512,0.03037455,0.00005935384,0.9653764],"study_design_scores_gemma":[0.00119197,0.0002744189,0.0000666133,0.0001044052,0.0005551921,0.00001878036,0.0001009766,0.0005901196,0.002481347,0.9936695,0.000627344,0.0003193072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002011713,0.00005441715,0.9954981,0.0004777415,0.0001863698,0.001204919,0.00006363389,0.000429958,0.00007311233],"genre_scores_gemma":[0.005081243,0.000008015317,0.9937134,0.0001871841,0.00005682126,0.0002649026,0.000004521345,0.00009465623,0.0005892118],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9650571,"threshold_uncertainty_score":0.9999601,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4283025888","doi":"10.1145/3544489","title":"Algorithm 1027: <tt>NOMAD</tt> Version 4: Nonlinear Optimization with the MADS Algorithm","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Computer science; Algorithm; Component (thermodynamics); Software; Code (set theory); Parallel computing; Programming language; Set (abstract data type)","retraction":null,"screen_n_in":null,"score":{"opus":0.01549726687554553,"gpt":0.2522385660858305,"spread":0.2367412992102849,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008541484,0.0003445314,0.000351481,0.0002940157,0.001695573,0.0003166667,0.002377717,0.000096565,0.003610841],"category_scores_gemma":[0.0002004652,0.0002509014,0.0001676425,0.001753444,0.0001830424,0.0004521262,0.0002111501,0.0008757723,0.0003029489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002470084,"about_ca_system_score_gemma":0.0002177811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001116687,"about_ca_topic_score_gemma":7.582864e-7,"domain_scores_codex":[0.9959863,0.000405532,0.0004545386,0.0007391932,0.001838485,0.0005759086],"domain_scores_gemma":[0.9963924,0.001104525,0.0001530914,0.001796707,0.0002953479,0.0002579753],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002390207,0.0006524585,0.000002142987,0.00003173439,0.00008841424,0.00004693143,0.0004274515,0.3967057,0.00000188673,0.0002074718,0.0003340523,0.6014779],"study_design_scores_gemma":[0.0008193224,0.0004201384,0.000008293515,0.00002215398,0.00005333702,0.0001575458,0.0002439269,0.9865677,0.0001138795,0.006762879,0.004487006,0.0003437986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002648895,0.00003386267,0.9935939,0.004642112,0.0002348635,0.0007170946,0.0001357306,0.0005114848,0.0001045096],"genre_scores_gemma":[0.000145956,0.00002214826,0.9966395,0.000536374,0.00005516508,0.0003383071,0.00005122696,0.00005813775,0.00215312],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6011341,"threshold_uncertainty_score":0.9999943,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1839773802","doi":"10.1145/2818311","title":"KBLAS","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kootenay Association for Science & Technology","funders":"Nvidia; University of Pennsylvania","keywords":"Computer science; Parallel computing; Speedup; CUDA; Matrix multiplication; Supercomputer; Linear algebra; General-purpose computing on graphics processing units; Overhead (engineering); Multiplication (music); Graphics; Mathematics; Programming language; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02241672786206683,"gpt":0.2637491284405958,"spread":0.241332400578529,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001272409,0.0001199406,0.0001285402,0.00008302824,0.0001437165,0.00005855088,0.0008751943,0.00008261815,0.0001916505],"category_scores_gemma":[0.0002225291,0.00007616534,0.00008668307,0.0002158965,0.00004660885,0.0002261588,0.00001927345,0.0001158633,0.0006322201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000338115,"about_ca_system_score_gemma":0.00002154453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.457122e-7,"about_ca_topic_score_gemma":1.316476e-7,"domain_scores_codex":[0.9990606,0.00004306188,0.0001923747,0.000265063,0.0002209299,0.0002179702],"domain_scores_gemma":[0.9982997,0.0006484284,0.00003789026,0.0008777896,0.00005583744,0.00008036282],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004453053,0.0001950917,0.00001479997,0.00002260612,0.00002347538,0.00001210986,0.0001366681,0.0003256588,0.00008385173,0.0109425,0.001171932,0.9870669],"study_design_scores_gemma":[0.0002864411,0.0001301755,0.00004066233,0.0001195541,0.000007430345,0.00003536109,0.000002877004,0.002045485,0.009595603,0.9835258,0.003955677,0.0002549534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001142369,0.000004671762,0.979835,0.01817439,0.00005117842,0.00009397043,0.000002025495,0.001544495,0.0001800238],"genre_scores_gemma":[0.02461329,0.000007121101,0.9717547,0.002605363,0.00001801755,0.00002834478,2.020551e-7,0.00001131434,0.0009616287],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9868119,"threshold_uncertainty_score":0.8126122,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2398934262","doi":"10.1145/2754929","title":"Algorithm 958","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Lattice (music); Algorithm; Mathematics; Normalization (sociology); Computer science; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.05285829829686607,"gpt":0.3135045556838899,"spread":0.2606462573870238,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003898797,0.0003143676,0.0004136932,0.0001393541,0.000204748,0.00005596672,0.0004517032,0.0001960396,0.01058651],"category_scores_gemma":[0.002436394,0.0001823375,0.0002636085,0.0002559294,0.0001401409,0.0002703005,0.00001312882,0.0002210795,0.002785113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001080127,"about_ca_system_score_gemma":0.00003174564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.993623e-7,"about_ca_topic_score_gemma":0.000001772898,"domain_scores_codex":[0.9978885,0.0000875187,0.0006520189,0.0003885477,0.0005903571,0.0003930647],"domain_scores_gemma":[0.9957731,0.002720554,0.0001237547,0.0010049,0.0001473741,0.0002303315],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001699609,0.0007153206,0.000001669893,0.0001464177,0.00005454344,0.000003610536,0.0001950028,3.778077e-7,0.0001220114,0.09974608,0.0004362975,0.8985617],"study_design_scores_gemma":[0.0005641115,0.0001247394,0.00000664918,0.0003013442,0.00005349839,0.00002822138,0.00006064025,0.000150619,0.005476923,0.9912893,0.00166165,0.0002822675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001383301,0.000004902961,0.9935606,0.002524548,0.0001053062,0.0004567867,0.00005289282,0.0007197993,0.001191856],"genre_scores_gemma":[0.002854967,0.00001043623,0.9884828,0.0002794018,0.00005792566,0.0002041382,0.000002759611,0.00006321483,0.008044301],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8982794,"threshold_uncertainty_score":0.9979913,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971004571","doi":"10.1145/1555386.1555389","title":"pyMDO","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Institute for Christian Studies; University of Toronto","funders":"","keywords":"Computer science; Python (programming language); Fortran; Interface (matter); Object-oriented programming; Programming language; Focus (optics); Computational science; Parallel computing","retraction":null,"screen_n_in":null,"score":{"opus":0.01763026921332817,"gpt":0.2744212030316215,"spread":0.2567909338182934,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000974064,0.0001814177,0.0001924696,0.0001142745,0.0002155484,0.00008772352,0.0008414674,0.00008176624,0.0002432157],"category_scores_gemma":[0.0002843366,0.0001618162,0.0001105958,0.0004852829,0.00004278589,0.0004832647,0.00001134128,0.0002293826,0.0005814484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007059443,"about_ca_system_score_gemma":0.00002846156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.411991e-7,"about_ca_topic_score_gemma":2.906731e-7,"domain_scores_codex":[0.9987424,0.00003366641,0.0002455448,0.0003794193,0.0003184871,0.0002804895],"domain_scores_gemma":[0.9983793,0.0003258699,0.00005221165,0.0009884562,0.0001000498,0.0001540796],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006264872,0.0005091819,0.000001524577,0.00001114757,0.0000151412,0.00001362182,0.0003833286,0.01354712,0.00004385534,0.00868066,0.00002176858,0.9767664],"study_design_scores_gemma":[0.0005452019,0.0002379094,0.0001843089,0.00005031113,0.00001354477,0.00005354314,0.00003218884,0.02911868,0.002004817,0.9668611,0.0005474538,0.0003509472],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006875862,0.00001335468,0.996716,0.0017181,0.0001024425,0.0002084526,0.000004497536,0.0008357381,0.0003326395],"genre_scores_gemma":[0.01231648,0.000008420627,0.9860886,0.000886906,0.00001831175,0.00002499911,0.000001302092,0.00001344938,0.0006415362],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9764155,"threshold_uncertainty_score":0.7473536,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092445605","doi":"10.1145/569147.569151","title":"Algorithm 820","year":2002,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Sunnybrook Health Science Centre; Toronto Metropolitan University","funders":"","keywords":"Computer science; Implementation; Algorithm; Signal processing; Waveform; Context (archaeology); SIGNAL (programming language); Fast Fourier transform; Superposition principle; Digital signal processing; Mathematics; Computer hardware","retraction":null,"screen_n_in":null,"score":{"opus":0.03971491663720245,"gpt":0.2756292198976866,"spread":0.2359143032604841,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002200992,0.0001599764,0.0001966855,0.00009716204,0.000233319,0.0001477581,0.0009264559,0.00008644426,0.001180734],"category_scores_gemma":[0.0001972029,0.0001350992,0.0001440551,0.0003760677,0.00005175968,0.0003308348,0.00001766981,0.0002558768,0.001938751],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003103614,"about_ca_system_score_gemma":0.000008532263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001634178,"about_ca_topic_score_gemma":1.701306e-7,"domain_scores_codex":[0.9987221,0.00008902912,0.0002325006,0.0003166346,0.0003475982,0.0002921072],"domain_scores_gemma":[0.9981648,0.0006296455,0.00003379617,0.0009777808,0.0000542549,0.0001396806],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001170805,0.0002043521,4.10047e-7,0.0000158103,0.00001427092,0.00002262453,0.0003099436,0.00004205359,0.00002991819,0.0005343538,0.0001018241,0.9987233],"study_design_scores_gemma":[0.0006502046,0.0001803722,0.0000216333,0.00007389749,0.00002944384,0.0001363468,0.00002045432,0.03454471,0.003960132,0.9565866,0.003421718,0.0003745081],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005721271,0.0000577874,0.9974547,0.001200371,0.0001622551,0.0001119213,0.00000432428,0.0005103207,0.0004411096],"genre_scores_gemma":[0.001387421,0.00001266632,0.9951903,0.0005257866,0.00003090692,0.00002472775,4.149566e-7,0.00001561212,0.002812191],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9983488,"threshold_uncertainty_score":0.9997323,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999997491","doi":"10.1145/1462173.1462178","title":"Algorithm 890","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Benchmarking; MATLAB; Algorithm; License; Software; Compressed sensing; Software testing; Data mining; Computer engineering; Computational science; Programming language; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01595090383972415,"gpt":0.2412137621590857,"spread":0.2252628583193615,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003685042,0.000145256,0.0001600918,0.00006502838,0.00007385484,0.00002926799,0.0001941035,0.00008963092,0.0002614176],"category_scores_gemma":[0.00002836733,0.0001323002,0.00008993147,0.0001294142,0.0000220735,0.00007065071,0.00000171027,0.0002064105,0.0002375103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002991798,"about_ca_system_score_gemma":0.000004170819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.994136e-7,"about_ca_topic_score_gemma":2.332641e-7,"domain_scores_codex":[0.9993644,0.000009369561,0.0001574106,0.0001264509,0.0001472416,0.0001951384],"domain_scores_gemma":[0.9993315,0.0001066159,0.00001011126,0.0004511248,0.00002411799,0.0000764859],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001898645,0.00007979598,3.702772e-7,0.00000898467,0.00001804822,0.000008770032,0.00005648637,0.001653283,0.0002448874,0.00009680034,0.0002028608,0.9976278],"study_design_scores_gemma":[0.0001963265,0.0001424868,0.00009509428,0.0001548822,0.00004346291,0.00004613733,0.00002427574,0.009985473,0.03364073,0.9531377,0.002190638,0.0003428195],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001399066,0.00004125232,0.9953657,0.0001786033,0.00006856456,0.0001078503,0.000007641695,0.002307244,0.0005240183],"genre_scores_gemma":[0.1216716,0.00002777001,0.8778359,0.0002339167,0.00003528664,0.00001344635,0.000002389501,0.00002726869,0.0001524237],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.997285,"threshold_uncertainty_score":0.5395044,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2009441286","doi":"10.1145/2168773.2168779","title":"Algorithm 917","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Iterative Methods for Nonlinear Equations","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Computer science; Double-precision floating-point format; Algorithm; Wright; Function (biology); Floating point; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.1191100034427306,"gpt":0.390648290282733,"spread":0.2715382868400024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007135352,0.0002808882,0.000360938,0.0001447589,0.0003221445,0.00004654102,0.0003531722,0.0001574626,0.00282745],"category_scores_gemma":[0.002124022,0.0002339337,0.0002451311,0.0003358306,0.0001056973,0.0003181014,0.00001425844,0.000413564,0.001495286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009452112,"about_ca_system_score_gemma":0.00002676061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001563819,"about_ca_topic_score_gemma":0.000001186536,"domain_scores_codex":[0.9981281,0.0001948399,0.0004589388,0.0002390538,0.0004471244,0.0005320103],"domain_scores_gemma":[0.9955146,0.003095062,0.00009298318,0.0009292196,0.0001061361,0.0002619973],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001187241,0.00185916,0.0000553009,0.0001514919,0.0001338781,0.000003171765,0.001647772,0.00001077275,0.00006147341,0.01500937,0.0001122044,0.9809436],"study_design_scores_gemma":[0.0002984688,0.00007018009,0.0000481505,0.0000690899,0.0001206277,0.00003730338,0.0001528916,0.0002121091,0.002412769,0.9943992,0.001894407,0.0002847513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002285476,0.00002995798,0.995684,0.0004088992,0.0002594545,0.0003924797,0.0000825196,0.0004860863,0.0003710773],"genre_scores_gemma":[0.003019611,0.000004178196,0.9939698,0.0001588981,0.0001737913,0.0001356106,0.000009337026,0.00007554845,0.002453211],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9806588,"threshold_uncertainty_score":0.9992822,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963711014","doi":"10.1145/3450975","title":"HyperNOMAD","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"MNIST database; Hyperparameter; Computer science; Artificial intelligence; Artificial neural network; Flexibility (engineering); Process (computing); Categorical variable; Machine learning; Deep learning; Field (mathematics); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02620826938640882,"gpt":0.269840259014115,"spread":0.2436319896277061,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001210229,0.0001040468,0.0001265083,0.0000457118,0.000178205,0.000124351,0.0006007985,0.0000616476,0.0004841865],"category_scores_gemma":[0.0005109763,0.00009234143,0.00008150673,0.0003119214,0.00002482221,0.0002115301,0.00002097186,0.0002219195,0.001225172],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002464117,"about_ca_system_score_gemma":0.000049371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001748061,"about_ca_topic_score_gemma":0.000001714373,"domain_scores_codex":[0.9990296,0.00006529711,0.000175518,0.0003199054,0.0002401279,0.0001694896],"domain_scores_gemma":[0.9980925,0.0004601519,0.00003193084,0.001252161,0.00006459231,0.00009869082],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000238727,0.0003351394,0.00006101954,0.00004971745,0.00001964269,0.00002252454,0.0001868712,0.0001637511,0.0001697859,0.02303425,0.00007567666,0.9758793],"study_design_scores_gemma":[0.0005554213,0.0001130224,0.002771992,0.0001176328,0.00003814576,0.0002389278,0.00009083694,0.008027435,0.005167477,0.9563267,0.02607038,0.0004820832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008281983,0.0000319721,0.9933044,0.004635307,0.00009872318,0.00005211566,0.00000665169,0.0004436113,0.0005990586],"genre_scores_gemma":[0.04776698,0.00001302212,0.949637,0.0004973435,0.00002041663,0.00002567649,0.00001070723,0.00001133547,0.002017506],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9753972,"threshold_uncertainty_score":0.9995525,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162513761","doi":"10.1145/1039813.1039817","title":"BACOL","year":2004,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University; Dalhousie University","funders":"","keywords":"Computer science; Computation; Solver; Discretization; A priori and a posteriori; Software; Spline (mechanical); Algorithm; Fortran; Computational science; Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02618123241969983,"gpt":0.289979131187966,"spread":0.2637978987682662,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008592063,0.0001955415,0.0002294513,0.00007446638,0.00009825859,0.00002293003,0.0002796481,0.00009048099,0.0003931932],"category_scores_gemma":[0.0003804063,0.0001801122,0.0001097997,0.0002791141,0.00006103727,0.0001098626,0.000005293267,0.0002890901,0.0008428495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000131436,"about_ca_system_score_gemma":0.00001323688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.510033e-7,"about_ca_topic_score_gemma":2.432542e-7,"domain_scores_codex":[0.9990011,0.00001567298,0.0002974282,0.0001682635,0.0002728266,0.000244672],"domain_scores_gemma":[0.9984074,0.0009565692,0.00002168006,0.0004458906,0.00003694166,0.0001314909],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005505863,0.0002072459,8.482796e-7,0.0002372928,0.0000491798,0.000007664326,0.0001903886,0.7430242,0.0001112755,0.003936124,0.000008744928,0.2522216],"study_design_scores_gemma":[0.0002805564,0.00005074605,0.00001363975,0.00009672294,0.00002196057,0.00002442422,0.0000308711,0.00187284,0.002884605,0.9942682,0.0002465827,0.0002088876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001738589,0.00002268884,0.9961827,0.0001858227,0.0001678672,0.0002183937,0.00001315589,0.001152059,0.000318753],"genre_scores_gemma":[0.0306005,0.000009061177,0.9690253,0.0001235285,0.00003104505,0.00008926888,0.000001515947,0.00006080745,0.00005896544],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9903321,"threshold_uncertainty_score":0.9999351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2912699192","doi":"10.1145/3232850","title":"Hierarchical Matrix Operations on GPUs","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kootenay Association for Science & Technology","funders":"Qatar National Research Fund; Nvidia","keywords":"Computer science; Data structure; Matrix multiplication; Linear algebra; Block (permutation group theory); Parallel computing; Theoretical computer science; Matrix (chemical analysis); Algebraic operation; Algorithm; Mathematics; Algebraic number","retraction":null,"screen_n_in":null,"score":{"opus":0.01684977558226441,"gpt":0.2808800898770193,"spread":0.2640303142947549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001663777,0.0001852027,0.0002149088,0.0001581172,0.0002411491,0.0001698052,0.001004244,0.0001377716,0.0003422785],"category_scores_gemma":[0.0001985102,0.0001570655,0.0001320048,0.0003607265,0.00003898023,0.0002109788,0.0000270894,0.0004664807,0.001729469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004938068,"about_ca_system_score_gemma":0.00004509111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002106653,"about_ca_topic_score_gemma":3.182326e-7,"domain_scores_codex":[0.9985673,0.00008485231,0.0002868082,0.000413443,0.0003679987,0.000279536],"domain_scores_gemma":[0.9978005,0.000797456,0.00003055031,0.001192679,0.00006685089,0.0001119202],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006013189,0.002309183,0.00009529344,0.000233448,0.0001501883,0.00005143916,0.001461693,0.4923214,0.0002264745,0.2086381,0.002211755,0.2922409],"study_design_scores_gemma":[0.0008638271,0.0009588763,0.0001418529,0.0002406058,0.00002484506,0.00008217701,0.00002187051,0.3032757,0.004890624,0.6851242,0.003584192,0.0007912293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002613168,0.000005637175,0.984708,0.01062034,0.0001153528,0.0003088817,0.000004889398,0.001271162,0.000352641],"genre_scores_gemma":[0.07915437,0.0000048262,0.9152187,0.003900609,0.00002597693,0.0000485464,0.000003341326,0.00001935078,0.001624355],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4764861,"threshold_uncertainty_score":0.9990478,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972657290","doi":"10.1145/1824801.1864430","title":"An Interoperable, Data-Structure-Neutral Component for Mesh Query and Manipulation","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Component (thermodynamics); Interface (matter); Data structure; Interoperability; Application programming interface; Implementation; Software framework; Distributed computing; Common Component Architecture; Component-based software engineering; Overhead (engineering); Software; Data model (GIS); Code (set theory); Reuse; Adaptive mesh refinement; Programming language; Parallel computing; Operating system; Software development; Computational science","retraction":null,"screen_n_in":null,"score":{"opus":0.04022251843985802,"gpt":0.3014300847609404,"spread":0.2612075663210823,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002128637,0.0001403083,0.0001492675,0.0000989726,0.0002648204,0.0001970575,0.000705759,0.00008680644,0.00006302512],"category_scores_gemma":[0.000101507,0.0001221328,0.00003823527,0.0001448738,0.00003990022,0.0007551506,0.00002763627,0.0002080543,0.0000110597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001315142,"about_ca_system_score_gemma":0.00002796779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004152618,"about_ca_topic_score_gemma":0.00004017794,"domain_scores_codex":[0.9989719,0.00003540209,0.0002381831,0.0004216583,0.0001667998,0.0001660986],"domain_scores_gemma":[0.9984242,0.0003651669,0.00004559779,0.0009566023,0.0000832752,0.0001251708],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006895882,0.0007733286,0.00005670069,0.0002354701,0.00008568418,0.000003710432,0.0007970393,0.01393408,0.01409327,0.07321881,0.0001432313,0.8965897],"study_design_scores_gemma":[0.0006322857,0.0002641669,0.001207725,0.00003270552,0.00004466486,0.00009100451,0.00002425737,0.3943532,0.00718283,0.5946167,0.001206047,0.0003444328],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09122626,0.000006143288,0.9073104,0.0006391772,0.0003119431,0.0002798054,0.00006399334,0.0001573938,0.000004854683],"genre_scores_gemma":[0.435644,0.000001441717,0.5640174,0.0001436992,0.00004806637,0.00001960068,0.00008154099,0.000007942791,0.00003630959],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8962453,"threshold_uncertainty_score":0.4980431,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2095897158","doi":"10.1145/2689664","title":"DAESA—A Matlab Tool for Structural Analysis of Differential-Algebraic Equations","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Modeling and Simulation Systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Leverhulme Trust","keywords":"MATLAB; Block (permutation group theory); Mathematics; Nonlinear system; Algebraic equation; Differential (mechanical device); Code (set theory); Algebraic number; Differential equation; Set (abstract data type); Algorithm; Applied mathematics; Computer science; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.06772804534160513,"gpt":0.3109277498984829,"spread":0.2431997045568778,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002568707,0.0001464636,0.0003908276,0.000294539,0.0001377618,0.00009148361,0.0006028189,0.00008622774,0.00009512419],"category_scores_gemma":[0.0004310036,0.0001190886,0.0002918831,0.0007534702,0.00003264232,0.0002132824,0.00001411669,0.00008807233,0.00002760685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004774985,"about_ca_system_score_gemma":0.00005392363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008252869,"about_ca_topic_score_gemma":0.00000457981,"domain_scores_codex":[0.9985076,0.0000624444,0.0005146299,0.0002892349,0.0004341003,0.00019203],"domain_scores_gemma":[0.9975286,0.001031027,0.0001217779,0.0009266709,0.0002681473,0.0001238448],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008525931,0.0006922257,0.0005769673,0.0004229423,0.002355174,0.000001846657,0.007436236,0.6737329,0.0001579532,0.1123202,0.00008803558,0.2021302],"study_design_scores_gemma":[0.0004265186,0.00007469764,0.000172398,0.00002544628,0.0003258292,0.000001349975,0.00004724145,0.7695034,0.000154921,0.2290822,0.00002955303,0.000156492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03973243,0.00000965422,0.9593709,0.0002078061,0.0001388279,0.0002855261,0.00006064388,0.000184385,0.000009832706],"genre_scores_gemma":[0.6759962,3.503624e-7,0.3237405,0.00002861027,0.00001194723,0.00004864584,0.00001523368,0.000008082505,0.0001503231],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6362638,"threshold_uncertainty_score":0.4856294,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1503528175","doi":"10.1145/2964377","title":"Algorithm 965","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Air Force Office of Scientific Research; Michigan Technological University","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.07490965693553323,"gpt":0.3521181140104761,"spread":0.2772084570749429,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003142788,0.0002882954,0.0004193551,0.0001330514,0.0002308403,0.00003659389,0.0005052246,0.0001703661,0.004550764],"category_scores_gemma":[0.003193075,0.0001795426,0.0002984167,0.0003081627,0.0001592326,0.0001716256,0.00001758897,0.0002347186,0.001548914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001054249,"about_ca_system_score_gemma":0.0000307142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002160166,"about_ca_topic_score_gemma":0.000001818919,"domain_scores_codex":[0.9979824,0.0001567551,0.0005190498,0.0003935409,0.0005105166,0.0004377332],"domain_scores_gemma":[0.9935426,0.004898029,0.0001038124,0.001098273,0.0001011551,0.0002560997],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001057276,0.0004826051,0.000004019323,0.00004805269,0.00006438224,0.000003440615,0.00007049531,7.578395e-7,0.0002453953,0.002230081,0.000009194922,0.996831],"study_design_scores_gemma":[0.000505472,0.0001247783,0.00003212412,0.0001668086,0.0001066998,0.00001648719,0.0000271792,0.00001014934,0.00332363,0.9946457,0.0007689772,0.0002719849],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001162553,0.000005743717,0.9958503,0.00160705,0.0001954165,0.000358809,0.00008950584,0.0006713659,0.0000592767],"genre_scores_gemma":[0.0009217047,0.000008642667,0.9957883,0.0001221914,0.00005925515,0.0001677336,0.000001566456,0.00007395251,0.002856679],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.996559,"threshold_uncertainty_score":0.9992285,"prediction_status":"machine_predicted_unvalidated"},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"gpt","categories":[],"domain":null,"study_design":"design_other","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"split"},{"id":"W1990576050","doi":"10.1145/1186785.1186786","title":"Inverting the symmetrical beta distribution","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Beta distribution; Inversion (geology); BETA (programming language); Inverse; Inverse-gamma distribution; Inverse transform sampling; Algorithm; Mathematics; Applied mathematics; Distribution (mathematics); Gamma distribution; Computer science; Mathematical optimization; Mathematical analysis; Probability distribution; Distribution fitting; Geometry; Inverse-chi-squared distribution; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04376148357159772,"gpt":0.2937572659650554,"spread":0.2499957823934577,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006366875,0.0002952936,0.0003615201,0.00008741842,0.0005270379,0.000137695,0.0004980005,0.0001863835,0.001368139],"category_scores_gemma":[0.002391257,0.0001820445,0.000286756,0.0006488157,0.0001632792,0.0001856672,0.00001731145,0.0004897367,0.0005823625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001329046,"about_ca_system_score_gemma":0.00002790728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001013677,"about_ca_topic_score_gemma":0.000009844649,"domain_scores_codex":[0.9976425,0.0001396641,0.0008055919,0.0003268396,0.0006949606,0.0003905104],"domain_scores_gemma":[0.9953447,0.003350572,0.0001723575,0.0008701538,0.0001516929,0.0001105535],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002549948,0.001222141,0.00002290641,0.0002853881,0.00005116708,0.000002842887,0.0001900654,0.00003461006,0.00003381394,0.936879,0.003053939,0.0581986],"study_design_scores_gemma":[0.0002885835,0.00006427165,0.00008065245,0.0001033995,0.00009477618,0.00002257238,0.0001059608,0.001921019,0.002279049,0.9932742,0.001541188,0.0002243156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008902868,0.00001341677,0.9851673,0.003290604,0.00007894971,0.0005643665,0.00004898903,0.0004841424,0.001449423],"genre_scores_gemma":[0.2132626,0.000006174523,0.7823805,0.0005515888,0.0002049603,0.0004082328,0.00009369693,0.0000943147,0.002997942],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2043597,"threshold_uncertainty_score":0.9995447,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965507121","doi":"10.1145/1644001.1644004","title":"Design patterns for multiphysics modeling in Fortran 2003 and C++","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"IBM (Canada)","funders":"Office of Naval Research; University of Oregon; City University of New York","keywords":"Computer science; Fortran; Multiphysics; Solver; Programming language; Compiler; Software; Computational science; Theoretical computer science; Parallel computing; Finite element method","retraction":null,"screen_n_in":null,"score":{"opus":0.04853626080753119,"gpt":0.2707800425952326,"spread":0.2222437817877015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002831697,0.0001435708,0.0001957896,0.00006199389,0.000133431,0.0001074355,0.0004675541,0.00009584814,0.000006973468],"category_scores_gemma":[0.0001430239,0.0001282552,0.00005143503,0.0002089099,0.00001873877,0.0001753013,0.00001041621,0.0002458119,0.00001086501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001234014,"about_ca_system_score_gemma":0.00003201126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009111106,"about_ca_topic_score_gemma":0.00001079079,"domain_scores_codex":[0.9990118,0.00003119351,0.0002562958,0.000297974,0.0001434848,0.0002592479],"domain_scores_gemma":[0.9987899,0.0005155241,0.00003410805,0.0004945937,0.00007409204,0.00009179219],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004933333,0.001160793,0.000310944,0.0007337484,0.00007554512,0.00001336419,0.003729869,0.2281728,0.0004251751,0.01139944,0.00003014791,0.7538988],"study_design_scores_gemma":[0.0004354391,0.00006160132,0.00002964746,0.00008179912,0.000007559141,0.00001199191,0.0000203842,0.8370557,0.0001711834,0.161924,0.00003750204,0.0001632266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01625227,0.000005943596,0.9827628,0.0001594996,0.0001690875,0.0004565546,0.0000183509,0.0001707597,0.000004708331],"genre_scores_gemma":[0.4753115,0.0000012284,0.5245493,0.00003570711,0.00001304657,0.00006156423,0.000002163814,0.000008703997,0.00001676782],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7537356,"threshold_uncertainty_score":0.5230094,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2604879335","doi":"10.1145/3291042","title":"A Unified 2D/3D Large-Scale Software Environment for Nonlinear Inverse Problems","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Seismic Imaging and Inversion Techniques","field":"Earth and Planetary Sciences","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scalability; Modular design; Flexibility (engineering); Nonlinear system; Software; Scale (ratio); Source lines of code; Preconditioner; Variety (cybernetics); Computer engineering; Inverse problem; Inverse; Theoretical computer science; Mathematical optimization; Computational science; Algorithm; Programming language; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01710165495037125,"gpt":0.2207946301367992,"spread":0.2036929751864279,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000287453,0.0002250305,0.0002781204,0.0001017955,0.000240547,0.00004736902,0.0003748868,0.000146672,0.008820531],"category_scores_gemma":[0.00009517501,0.000184936,0.000177742,0.0001321754,0.00007885729,0.0001937126,0.000006167328,0.0002591676,0.002679911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001888614,"about_ca_system_score_gemma":0.00003305436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006412166,"about_ca_topic_score_gemma":0.00001824818,"domain_scores_codex":[0.9985132,0.00004045391,0.000306229,0.0003997176,0.000320193,0.0004202389],"domain_scores_gemma":[0.9985997,0.0005208171,0.00007074233,0.0006095229,0.00003251575,0.0001666676],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002262318,0.0009734873,0.006791502,0.001151994,0.0001498691,0.000007223234,0.001909927,0.01293117,0.00004361267,0.00003341081,0.003086108,0.9726955],"study_design_scores_gemma":[0.004214295,0.002222458,0.001157171,0.0007460671,0.0003325266,0.00006644162,0.001895735,0.1871868,0.003643018,0.2071978,0.5894085,0.001929293],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01612377,0.00003083912,0.9811158,0.0006106134,0.0001538983,0.0008488556,0.0005201617,0.0004596599,0.0001363793],"genre_scores_gemma":[0.01000054,0.00004257804,0.9849913,0.001743981,0.00003643545,0.00003807629,0.0001992537,0.0000223361,0.002925505],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9707662,"threshold_uncertainty_score":0.9980966,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007194272","doi":"10.1145/2700586","title":"Algorithm 948","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Modeling and Simulation Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Leverhulme Trust; McMaster University","keywords":"MATLAB; Block (permutation group theory); Algebraic equation; Nonlinear system; Computer science; Degrees of freedom (physics and chemistry); Differential algebraic equation; Set (abstract data type); Algorithm; Scheme (mathematics); Translation (biology); Differential equation; Differential (mechanical device); Mathematics; Ordinary differential equation; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.07005107154270766,"gpt":0.292271326274682,"spread":0.2222202547319743,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003250983,0.0001263094,0.0001780581,0.00008130614,0.0001168284,0.0001129118,0.0006717237,0.00008219683,0.00006133394],"category_scores_gemma":[0.000163648,0.0001043415,0.00008847109,0.0002543803,0.00002353677,0.0002412121,0.00001345728,0.0001512282,0.001153119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005580358,"about_ca_system_score_gemma":0.00005709758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005566026,"about_ca_topic_score_gemma":6.207396e-7,"domain_scores_codex":[0.9987546,0.00005771196,0.0002705846,0.0002690701,0.000448069,0.0001999889],"domain_scores_gemma":[0.9983921,0.0002804172,0.00003977751,0.0009232113,0.000126965,0.0002375042],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003433255,0.0002228651,0.00001005004,0.00002499109,0.00002386204,0.000007956054,0.001479845,0.01474822,0.000002525551,0.002447784,0.00009652261,0.9809319],"study_design_scores_gemma":[0.0004737448,0.0001004254,0.000009816932,0.00005229583,0.00001045698,0.0000406455,0.00009072383,0.2783843,0.0001475933,0.718168,0.002295416,0.0002265504],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004144466,0.00001794644,0.9978679,0.0005992443,0.0002406851,0.000127332,0.000004934804,0.0005800544,0.0001473933],"genre_scores_gemma":[0.04830557,0.000001015107,0.9504092,0.0002086578,0.00003550352,0.00003006177,0.000001251627,0.00001214751,0.0009966041],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9807054,"threshold_uncertainty_score":0.9996246,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964248269","doi":"10.1145/3054948","title":"SYM-ILDL","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"University of British Columbia; University of Pennsylvania","keywords":"Preconditioner; Factorization; Mathematical software; Computer science; Code (set theory); Positive-definite matrix; Symmetric matrix; Incomplete LU factorization; Matching (statistics); Skew; Mathematics; Iterative method; Applied mathematics; Parallel computing; Computational science; Algorithm; Software; Matrix decomposition; Set (abstract data type); Physics; Eigenvalues and eigenvectors","retraction":null,"screen_n_in":null,"score":{"opus":0.02624809734640182,"gpt":0.2798962179493537,"spread":0.2536481206029519,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002474677,0.0001537685,0.0001872427,0.0000529422,0.0009292421,0.0003842426,0.002371279,0.0000834179,0.0004762507],"category_scores_gemma":[0.0003751356,0.0001260911,0.0001405352,0.00007240269,0.0001062588,0.0005245541,0.00004802397,0.0002272287,0.0012738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002086588,"about_ca_system_score_gemma":0.00002412447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003023886,"about_ca_topic_score_gemma":0.000001096953,"domain_scores_codex":[0.9989256,0.00003697084,0.0001955534,0.000311462,0.0002649821,0.0002654211],"domain_scores_gemma":[0.9969164,0.0003749021,0.0000780975,0.002442477,0.00004049631,0.0001476387],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008294524,0.0003505749,0.00001634204,0.00008309571,0.00004062636,0.00003148475,0.0003087881,0.00007767892,0.00002511118,0.08689392,0.00005515453,0.912109],"study_design_scores_gemma":[0.0002445033,0.00006610672,0.0001748801,0.00006588456,0.00001400299,0.00003236444,0.00001179618,0.001353365,0.001394009,0.9952208,0.001226149,0.0001961744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00102002,0.00001020704,0.9951737,0.002122347,0.000253199,0.0001291677,0.000007321411,0.0003820427,0.0009019897],"genre_scores_gemma":[0.1166471,0.000008552192,0.8803095,0.0002915073,0.00005543793,0.00004224182,6.106955e-7,0.00001722713,0.002627755],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9119127,"threshold_uncertainty_score":0.9995039,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049367060","doi":"10.1145/1356052.1356056","title":"Algorithm 874","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University; Saint Mary's University; University of Saskatchewan","funders":"","keywords":"Computer science; Solver; Discretization; Algorithm; Method of lines; Source lines of code; Runge–Kutta methods; Software; Mathematical optimization; Numerical analysis; Applied mathematics; Mathematics; Differential equation; Differential algebraic equation; Ordinary differential equation","retraction":null,"screen_n_in":null,"score":{"opus":0.03781258348387305,"gpt":0.2837174151770318,"spread":0.2459048316931587,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008511252,0.0002199059,0.0002820936,0.00008603121,0.0001725069,0.00001211762,0.0003011005,0.0001010593,0.0005846539],"category_scores_gemma":[0.0003624236,0.0002036704,0.0001285149,0.0003085057,0.0001120318,0.0001157803,0.00000650932,0.0003335395,0.0007418647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007444729,"about_ca_system_score_gemma":0.00001247101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.975906e-7,"about_ca_topic_score_gemma":5.504392e-8,"domain_scores_codex":[0.9988256,0.00002831558,0.0003408295,0.0001951889,0.0003397815,0.000270342],"domain_scores_gemma":[0.9977354,0.001528745,0.00002618615,0.0005070593,0.00005621961,0.0001463441],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003638866,0.0002308224,0.00000200043,0.0001425424,0.00006023407,0.00002432263,0.0004560428,0.07352518,0.00002319155,0.0003221669,0.00005909383,0.9251508],"study_design_scores_gemma":[0.0002482578,0.00006423674,0.00002953913,0.00006860606,0.00002661646,0.0001809093,0.00007273077,0.03420364,0.001089341,0.9626414,0.001029769,0.0003449155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009417463,0.00006485202,0.9971432,0.00007669172,0.0001552903,0.0001728542,0.00002305724,0.00123067,0.0001916461],"genre_scores_gemma":[0.004583769,0.00005290641,0.9948574,0.00007715682,0.00004618507,0.00007416929,0.000002571659,0.00006950006,0.0002363901],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9623193,"threshold_uncertainty_score":0.9535417,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0228653889092917,"gpt":0.283043403121976,"spread":0.2601780142126843,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002200737,0.0001454547,0.000208979,0.00006844023,0.000250872,0.0001294679,0.0004900673,0.0001001924,0.0001114705],"category_scores_gemma":[0.0003673411,0.0001149166,0.00008928344,0.0001714302,0.0001091872,0.0002100858,0.00002312387,0.0002403853,0.00002211516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006647992,"about_ca_system_score_gemma":0.00001953396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007489289,"about_ca_topic_score_gemma":0.000004375715,"domain_scores_codex":[0.9990359,0.00002949276,0.0001986255,0.0003178104,0.0001708491,0.0002473481],"domain_scores_gemma":[0.9979934,0.001223588,0.00003536508,0.0005503125,0.00005493586,0.0001424723],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007654014,0.0001760592,0.000003896909,0.00005555066,0.00001787344,0.000001807994,0.0001504381,0.000009516129,0.0009216097,0.01762901,0.00001187249,0.9810147],"study_design_scores_gemma":[0.0004465417,0.0001632684,0.0000769178,0.00002397001,0.00002334309,0.00002584226,0.00005263569,0.006575899,0.004920575,0.9836329,0.003830434,0.0002276914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002408301,0.00001051181,0.9958107,0.0009749006,0.000304377,0.0002298597,0.00002795311,0.000208527,0.00002480029],"genre_scores_gemma":[0.006380799,0.000009314732,0.9931008,0.000151666,0.00004095221,0.00008918159,0.000001775836,0.00001315255,0.0002123085],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.980787,"threshold_uncertainty_score":0.4686162,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976233365","doi":"10.1145/1377603.1377608","title":"Evaluating exact VARMA likelihood and its gradient when data are incomplete","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Cholesky decomposition; Rank (graph theory); Missing data; Likelihood function; Applied mathematics; Mathematics; Function (biology); Maximum likelihood; Computer science; Decomposition; Algorithm; Statistics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.3993076438415141,"gpt":0.4568650447477248,"spread":0.0575574009062107,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007051911,0.000347554,0.0005977401,0.00009317723,0.0005552814,0.00003523775,0.0006556499,0.0001346268,0.0005499799],"category_scores_gemma":[0.00571306,0.000290143,0.00009299549,0.0001559207,0.0001292782,0.0002990756,0.00009389046,0.000466633,0.00008584269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005847935,"about_ca_system_score_gemma":0.00004448737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003401952,"about_ca_topic_score_gemma":0.000006132579,"domain_scores_codex":[0.9973766,0.0002161032,0.0006215435,0.0006903177,0.0005929701,0.0005024475],"domain_scores_gemma":[0.9927558,0.005145586,0.0001736738,0.001447243,0.0001384097,0.000339309],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002441678,0.003279167,0.00006848795,0.002807519,0.0005236641,0.0002220419,0.004896453,0.0003725019,0.0004222382,0.03454097,0.0005094192,0.9521134],"study_design_scores_gemma":[0.0006802561,0.0002007168,0.00009519072,0.0002697823,0.000172098,0.0001290065,0.0001189708,0.01277651,0.000202612,0.9848513,0.0001548991,0.0003486463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0191947,0.00008748134,0.9788836,0.0004384967,0.00007570641,0.000555049,0.0004237969,0.0002877495,0.00005340584],"genre_scores_gemma":[0.03884085,0.00006265807,0.9604774,0.0001730528,0.00004648228,0.00008796417,0.00001599191,0.00007047298,0.0002251695],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9517647,"threshold_uncertainty_score":0.9999551,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2602778734","doi":"10.1145/3145573","title":"Simultaneous Conversions with the Residue Number System Using Linear Algebra","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Agence Nationale de la Recherche","keywords":"Residue number system; Linear algebra; Matrix multiplication; Multiplication (music); Residue (chemistry); Mathematics; Algorithm; Matrix (chemical analysis); Computer science; Arithmetic; Algebra over a field; Combinatorics; Pure mathematics; Chemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.01572939922200747,"gpt":0.2522958969816194,"spread":0.2365664977596119,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000183394,0.0001998883,0.000205979,0.00007303964,0.0008996797,0.0001126165,0.0009814418,0.0001028235,0.000167775],"category_scores_gemma":[0.00009166119,0.0001163854,0.0001287469,0.00071238,0.0003556267,0.0001726606,0.00003108046,0.0002830983,0.000522105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004478652,"about_ca_system_score_gemma":0.00005950522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002082151,"about_ca_topic_score_gemma":0.00001251097,"domain_scores_codex":[0.998592,0.00009577699,0.0002171257,0.0003564449,0.0004074319,0.0003311921],"domain_scores_gemma":[0.9970139,0.001434057,0.00006511343,0.00118792,0.0001593719,0.0001396995],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001227611,0.007506228,0.001354231,0.004317286,0.004181476,0.002353985,0.05159634,0.06478869,0.001521751,0.3848861,0.001673824,0.4745925],"study_design_scores_gemma":[0.005837732,0.003266528,0.0005340512,0.003880843,0.001602418,0.006361894,0.007682299,0.6371627,0.02698068,0.2944157,0.008132004,0.004143118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02188093,0.000009851106,0.9759408,0.001187748,0.000116111,0.0002716793,0.000008006294,0.0004350803,0.0001497772],"genre_scores_gemma":[0.5219353,0.000001501954,0.4776559,0.0002193951,0.00004573575,0.0000144711,4.386511e-7,0.00001657219,0.0001106196],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.572374,"threshold_uncertainty_score":0.69197,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3011875640","doi":"10.1145/3337792","title":"Algorithm 1003","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Office of Naval Research; National Science Foundation","keywords":"Computer science; Graph partition; Theoretical computer science; Parallel computing; Mathematical optimization; Algorithm; Graph; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02343922253111681,"gpt":0.2277170211211739,"spread":0.2042777985900571,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00004061313,0.0001509118,0.0001796674,0.00003612231,0.00006118241,0.00002685291,0.0002307665,0.000100807,0.001046101],"category_scores_gemma":[0.0000615838,0.0001385688,0.00009831117,0.0001804495,0.00002677984,0.0000847848,0.000003188735,0.0002510074,0.0008113807],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002502682,"about_ca_system_score_gemma":0.000005994097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.072395e-7,"about_ca_topic_score_gemma":1.233989e-7,"domain_scores_codex":[0.9993153,0.00001142149,0.0001837599,0.0001438254,0.0001570876,0.0001886465],"domain_scores_gemma":[0.9993954,0.0001358789,0.000009365257,0.0002808819,0.00001808439,0.0001603724],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002663761,0.0000536576,0.000001458717,0.0001456835,0.00004018532,0.000009971264,0.0002800542,0.0007956332,0.0003406297,0.00006861285,0.0003990309,0.9978624],"study_design_scores_gemma":[0.001055031,0.0006969913,0.0000597113,0.0002911343,0.0002229128,0.00007235457,0.0002709095,0.06565605,0.09553608,0.8110074,0.02351232,0.001619035],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001990782,0.00003684811,0.9962664,0.0003936291,0.00004447603,0.0001588697,0.00002880891,0.002571166,0.0003006993],"genre_scores_gemma":[0.03028547,0.00003318143,0.9689809,0.0004354248,0.00005033266,0.00007119907,0.000003866862,0.0000579089,0.00008168253],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9962434,"threshold_uncertainty_score":0.9999666,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077355347","doi":"10.1145/2427023.2427028","title":"A Runge-Kutta BVODE Solver with Global Error and Defect Control","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Solver; Discretization; Extrapolation; Ordinary differential equation; Ode; Boundary value problem; Runge–Kutta methods; Mathematics; Applied mathematics; A priori and a posteriori; Exact solutions in general relativity; Numerical analysis; Differential equation; Mathematical analysis; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.04279397292169582,"gpt":0.3221246364846401,"spread":0.2793306635629442,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002085553,0.0003711474,0.0005730451,0.00007071104,0.0002809826,0.0001208881,0.0003237137,0.000178321,0.001795746],"category_scores_gemma":[0.001049805,0.0002647343,0.0002285661,0.0003174877,0.0002340056,0.0002432904,0.00001539209,0.0003425316,0.0004003303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009748645,"about_ca_system_score_gemma":0.00003969259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003246603,"about_ca_topic_score_gemma":0.00002828305,"domain_scores_codex":[0.9979934,0.0001663409,0.0004476362,0.0004400698,0.0004696691,0.0004829282],"domain_scores_gemma":[0.9960248,0.002560928,0.0001172522,0.0008224481,0.0001364585,0.0003380841],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002866751,0.003119631,0.0009902947,0.001062395,0.001385207,0.00002011539,0.00080579,0.0001121539,0.0003540483,0.02030309,0.0001581704,0.9714024],"study_design_scores_gemma":[0.001220973,0.0003192906,0.0009097393,0.0001375254,0.0004639931,0.00004908444,0.0001075004,0.0005522168,0.0001199437,0.9957349,0.00004524745,0.0003396198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03812047,0.0000222245,0.9591363,0.001035532,0.00005590359,0.001030186,0.00007539922,0.0004252857,0.00009869155],"genre_scores_gemma":[0.1491297,0.000003027421,0.8499005,0.0002308424,0.00002343689,0.0004154107,0.000002772698,0.0000551677,0.0002391915],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9754318,"threshold_uncertainty_score":0.9999805,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069615772","doi":"10.1145/358407.358410","title":"Superconvergent interpolants for collocation methods applied to mixed-order BVODEs","year":2000,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Electromagnetic Simulation and Numerical Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Superconvergence; Collocation (remote sensing); Orthogonal collocation; Ordinary differential equation; Applied mathematics; Collocation method; Mathematics; Boundary (topology); Boundary value problem; Gauss; Partial differential equation; Computer science; Algorithm; Differential equation; Mathematical analysis; Finite element method","retraction":null,"screen_n_in":null,"score":{"opus":0.02355942709452166,"gpt":0.322293708373678,"spread":0.2987342812791564,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002389196,0.0001935265,0.0002680076,0.00009284836,0.0001031563,0.00003004206,0.0002041552,0.0001107166,0.003546406],"category_scores_gemma":[0.000229319,0.0001805923,0.00009786258,0.0003720577,0.00002410053,0.00004982392,0.000002509952,0.0001401038,0.0003329047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006779533,"about_ca_system_score_gemma":0.0000109885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001496243,"about_ca_topic_score_gemma":0.000001772759,"domain_scores_codex":[0.99897,0.00005460021,0.0003177249,0.0002281662,0.0001425626,0.0002868996],"domain_scores_gemma":[0.9982438,0.001136171,0.00001072227,0.0003832006,0.00004746511,0.0001786033],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005128256,0.0001124428,0.000001529983,0.000101651,0.0000458835,1.645077e-7,0.000280641,0.0232272,0.002422451,0.0001750553,0.00008227218,0.9734994],"study_design_scores_gemma":[0.003628316,0.001630355,0.0009410701,0.0003315131,0.0004766124,0.00003127808,0.0004831665,0.203214,0.1936134,0.544994,0.04827113,0.002385103],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01384059,0.00002229848,0.9843409,0.0002308481,0.0001406434,0.0006175865,0.00001826873,0.0004972496,0.0002915841],"genre_scores_gemma":[0.05455294,0.00001550719,0.944074,0.000272961,0.00002603625,0.0004444832,0.000007396879,0.00005199964,0.0005546387],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9711143,"threshold_uncertainty_score":0.9973645,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113152333","doi":"10.1145/353474.353482","title":"Accurate approximate solution of partial differential equations at off-mesh points","year":2000,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Collocation (remote sensing); Partial differential equation; Interpolation (computer graphics); Polygon mesh; Collocation method; Computer science; Domain (mathematical analysis); Mathematics; Set (abstract data type); Applied mathematics; Elliptic partial differential equation; Order of accuracy; Numerical analysis; Orthogonal collocation; Differential equation; Mathematical optimization; Algorithm; Numerical partial differential equations; Ordinary differential equation; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01871754576201084,"gpt":0.2583963857301192,"spread":0.2396788399681083,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006168894,0.0002197964,0.0003535425,0.00009109807,0.0001403638,0.00001601041,0.0002482359,0.0001227461,0.006055696],"category_scores_gemma":[0.00009706805,0.0001983691,0.0002192214,0.0002985831,0.00009684273,0.0001701292,0.000008437478,0.0002065655,0.000331089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001018448,"about_ca_system_score_gemma":0.000006217801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002274154,"about_ca_topic_score_gemma":0.00000308045,"domain_scores_codex":[0.998678,0.00003500771,0.00048613,0.0002193234,0.0002887185,0.0002928289],"domain_scores_gemma":[0.9989554,0.0003137181,0.00004821539,0.0005299714,0.00003964354,0.0001129991],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001553857,0.001178389,0.0000134968,0.0005136582,0.0004239717,0.000005687655,0.0005081936,0.08699412,0.00688119,0.0008081634,0.0001337284,0.902384],"study_design_scores_gemma":[0.001292547,0.000323756,0.0001987116,0.0003584879,0.0006642478,0.00002183577,0.00004703202,0.6156104,0.1418565,0.2370306,0.001379525,0.001216318],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02158413,0.00002515653,0.977031,0.00009770379,0.00003347347,0.0002185179,0.00006152394,0.000847113,0.0001014114],"genre_scores_gemma":[0.8212459,0.00009965399,0.1779049,0.00002429243,0.00002463133,0.0001441027,0.00003130049,0.00005346321,0.0004717661],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9011677,"threshold_uncertainty_score":0.9948529,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068957851","doi":"10.1145/1268769.1268770","title":"An accurate nonuniform fourier transform for SPRITE magnetic resonance imaging data","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Advanced MRI Techniques and Applications","field":"Medicine","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Algorithm; Fourier transform; Computer science; Interpolation (computer graphics); Discrete Fourier transform (general); Fast Fourier transform; k-space; Phase correlation; Sprite (computer graphics); Fourier analysis; Fractional Fourier transform; Computer vision; Mathematics; Mathematical analysis; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.04584140490333391,"gpt":0.3693807065983583,"spread":0.3235393016950244,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000396364,0.0002145873,0.0002832302,0.00009844427,0.0002635951,0.00002993157,0.0005070692,0.0001026231,0.0002872174],"category_scores_gemma":[0.0001457387,0.0001848556,0.0001122788,0.0002468387,0.0001083478,0.0003314073,0.000009377702,0.0002819386,0.00003996489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006444539,"about_ca_system_score_gemma":0.00004347198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004115439,"about_ca_topic_score_gemma":0.00001548955,"domain_scores_codex":[0.998434,0.000006531216,0.0004285947,0.0004574082,0.0002530832,0.0004204017],"domain_scores_gemma":[0.9972916,0.0004249961,0.00005078928,0.001861086,0.0001139836,0.0002575296],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001566667,0.0004807883,0.00001487312,0.0001035179,0.000005010375,0.000008007508,0.00007719951,0.00001603914,0.0002360679,0.0005655154,0.00006693417,0.9982694],"study_design_scores_gemma":[0.004350725,0.001514732,0.001325153,0.0008216832,0.0007061526,0.0004199668,0.0006113337,0.02398062,0.020634,0.7399618,0.20454,0.001133783],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004519203,0.0002073319,0.9947722,0.002181427,0.00002737762,0.001326937,0.0003361448,0.0004836295,0.0002130616],"genre_scores_gemma":[0.01731658,0.00008484611,0.9809247,0.000624348,0.00007076016,0.0002156887,0.0001368241,0.00006502782,0.0005612728],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9971356,"threshold_uncertainty_score":0.7538191,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2291318941","doi":"10.1145/2714570","title":"Algorithm 956","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Computation; Computer science; Redundancy (engineering); Algorithm; Convergence (economics); Continuation; Predictor–corrector method; Nonlinear system; Mathematical optimization; Iterative method; Underdetermined system; Speedup; Mathematics; Applied mathematics; Parallel computing","retraction":null,"screen_n_in":null,"score":{"opus":0.01937358525776292,"gpt":0.2579117629212377,"spread":0.2385381776634748,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00005096735,0.0001389631,0.0001496583,0.00003760347,0.0001370586,0.00002150134,0.0001804376,0.00004568238,0.00938587],"category_scores_gemma":[0.0000138934,0.00008576531,0.0001483386,0.0001000869,0.00005729153,0.0001069066,0.000005091697,0.0001309126,0.001135621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001681718,"about_ca_system_score_gemma":0.0000128222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002467111,"about_ca_topic_score_gemma":1.297347e-7,"domain_scores_codex":[0.9992006,0.00002388022,0.000183002,0.0002103132,0.0001608368,0.0002213498],"domain_scores_gemma":[0.9990981,0.0003052731,0.0000326036,0.0004016912,0.00003104303,0.000131294],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005194292,0.000156322,0.00001735821,0.000004351281,0.00002855018,5.865179e-7,0.00002626243,0.00003781125,0.0000520034,0.001156937,0.0001094048,0.9984052],"study_design_scores_gemma":[0.000575438,0.00006777089,0.00003636116,0.0001005157,0.0000392982,0.000005927682,0.00006107927,0.0003066469,0.004212361,0.9893798,0.004955087,0.0002597597],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00215225,0.000004228374,0.9958811,0.001099109,0.0001383013,0.0001186187,0.00004319422,0.000145219,0.000417966],"genre_scores_gemma":[0.3924529,0.00001082754,0.5918292,0.0002580338,0.0003972227,0.0001589705,0.000007284639,0.00006243988,0.01482315],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9981455,"threshold_uncertainty_score":0.9996421,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2401714080","doi":"10.1145/2818312","title":"Algorithm 962","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fortran; Computer science; Collocation (remote sensing); Interpolation (computer graphics); Algorithm; Partial differential equation; Software; Order of accuracy; Applied mathematics; Mathematical optimization; Mathematics; Method of characteristics; Mathematical analysis; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02474964844562203,"gpt":0.2834860973538823,"spread":0.2587364489082603,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001176881,0.0002087589,0.0002483937,0.00007840976,0.00008162152,0.0000166559,0.0003032439,0.00009510393,0.0008840888],"category_scores_gemma":[0.0005514797,0.0001421869,0.0001160462,0.0002144466,0.00008095668,0.0001356751,0.000006961728,0.0001682475,0.001092686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001012998,"about_ca_system_score_gemma":0.000008641848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.491668e-8,"about_ca_topic_score_gemma":7.586579e-8,"domain_scores_codex":[0.9988754,0.00002992358,0.0003220306,0.0001955473,0.0002925635,0.0002844895],"domain_scores_gemma":[0.9964725,0.002793208,0.00002627794,0.0005133359,0.00004737509,0.000147281],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002394794,0.00007326984,9.568109e-7,0.0000675045,0.00003377548,0.000003346087,0.00003811241,0.003606061,0.000122788,0.0004672707,0.00001818025,0.9955664],"study_design_scores_gemma":[0.0002387892,0.00004731525,0.00001418701,0.0001462891,0.00002136803,0.00002254037,0.0000133687,0.003761139,0.003069088,0.9914392,0.0009921265,0.0002345953],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002625044,0.00002296721,0.9977282,0.0002736663,0.0002052639,0.0001600339,0.00004072578,0.00115237,0.0001543156],"genre_scores_gemma":[0.003183035,0.000022217,0.9962119,0.00007742423,0.00004477611,0.00008049618,8.016347e-7,0.00006759913,0.0003116766],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9953318,"threshold_uncertainty_score":0.999685,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029379189","doi":"10.1145/1377596.1377599","title":"Efficient Contouring on Unstructured Meshes for Partial Differential Equations","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Contouring; Piecewise; Polygon mesh; Partial differential equation; Computer science; Isosurface; Algorithm; Interpolation (computer graphics); Intersection (aeronautics); Mathematics; Mathematical analysis; Computer graphics (images); Artificial intelligence; Animation; Visualization","retraction":null,"screen_n_in":null,"score":{"opus":0.02407487978704351,"gpt":0.2576306473575818,"spread":0.2335557675705383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003594501,0.0002254782,0.0003151284,0.0001031011,0.0002720964,0.00001692231,0.0002092005,0.0001049712,0.0003521405],"category_scores_gemma":[0.000248409,0.0001915893,0.0002431473,0.0001796605,0.00007908353,0.00003768062,0.000004256708,0.0002140856,0.00005144016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008683444,"about_ca_system_score_gemma":0.000007862503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001218934,"about_ca_topic_score_gemma":0.000001148364,"domain_scores_codex":[0.9988839,0.0000168633,0.0003242529,0.0002307875,0.0002542523,0.0002899659],"domain_scores_gemma":[0.9986055,0.0007810466,0.00003177386,0.0004210369,0.00004223954,0.0001183975],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000969559,0.0006359771,0.000005768981,0.0002199592,0.0002932673,0.000007827751,0.0005059334,0.8974699,0.002332555,0.002196497,0.00009476218,0.09614054],"study_design_scores_gemma":[0.001989133,0.0005674562,0.0001846854,0.0002795599,0.0004563098,0.00003010061,0.00009446382,0.6508965,0.1416026,0.2016227,0.0009305057,0.001346017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02540719,0.00001256911,0.972876,0.00007829357,0.00008652842,0.000356109,0.00004804846,0.001104941,0.00003030634],"genre_scores_gemma":[0.7688874,0.000006001268,0.2306622,0.00002847681,0.00004603783,0.0002465532,0.000008982272,0.00004202095,0.00007237123],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7434802,"threshold_uncertainty_score":0.7812786,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052461502","doi":"10.1145/962437.962441","title":"Fast contouring of solutions to partial differential equations","year":2003,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Contouring; Rendering (computer graphics); Contour line; Partial differential equation; Mesh generation; Visualization; Computer science; T-vertices; Surface (topology); Algorithm; Mathematics; Finite element method; Mathematical analysis; Geometry; Computer graphics (images); Artificial intelligence; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02324671594733029,"gpt":0.2589778862786515,"spread":0.2357311703313212,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006260385,0.0001632243,0.0002836712,0.0001284332,0.0001220682,0.0000145971,0.0001855681,0.00007449686,0.0008517455],"category_scores_gemma":[0.0003970215,0.0001541534,0.0001647203,0.0003531324,0.00004931848,0.00008805065,0.000005574335,0.0001792081,0.0001125749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006197016,"about_ca_system_score_gemma":0.000008823618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002191835,"about_ca_topic_score_gemma":0.000004941217,"domain_scores_codex":[0.9989484,0.00002979477,0.0003636466,0.0001641372,0.0002164695,0.0002775708],"domain_scores_gemma":[0.9989471,0.0003834552,0.00002739548,0.0004432538,0.00005046675,0.0001483203],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004175197,0.001932644,0.00003938945,0.0005320141,0.0006911944,0.000007016672,0.001302254,0.6233668,0.02606906,0.03202561,0.0001491694,0.3138431],"study_design_scores_gemma":[0.001286955,0.0005274842,0.0001952279,0.0005306646,0.0007670139,0.00001892859,0.0004626696,0.04521394,0.3643112,0.5823677,0.002608586,0.001709531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003413331,0.00001554994,0.9955023,0.00005849833,0.00005265384,0.0001983006,0.00003080509,0.0005770985,0.000151441],"genre_scores_gemma":[0.684296,0.000005093695,0.3154489,0.00001592074,0.00001106494,0.0001087122,0.000002453421,0.00002661944,0.00008527124],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6808826,"threshold_uncertainty_score":0.9326016,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2921471216","doi":"10.1145/3301320","title":"Extended BACOLI","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Advanced Mathematical Modeling in Engineering","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Partial differential equation; Fortran; Ordinary differential equation; Parabolic partial differential equation; Applied mathematics; Computer science; Mathematics; Elliptic partial differential equation; Polygon mesh; Boundary value problem; Software; Distributed parameter system; Differential equation; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01625295321662902,"gpt":0.2546218933925768,"spread":0.2383689401759478,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001484995,0.0002144833,0.0002769151,0.0001000388,0.00008914033,0.00007297946,0.00111024,0.00009930001,0.0004800581],"category_scores_gemma":[0.000255599,0.0001862294,0.0001389291,0.0003155606,0.00002953369,0.0003887644,0.00003591285,0.0003100907,0.002655834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006409984,"about_ca_system_score_gemma":0.00002246942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.095075e-7,"about_ca_topic_score_gemma":1.026763e-7,"domain_scores_codex":[0.9985006,0.00002051124,0.0003145666,0.0004088821,0.0003888952,0.0003664878],"domain_scores_gemma":[0.9974514,0.0007933548,0.00004168376,0.001498358,0.00005504361,0.0001601463],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002357294,0.001419481,0.00001077739,0.0009504174,0.0001382969,0.00002896142,0.001016183,0.1497801,0.001160826,0.243306,0.00003511296,0.6021303],"study_design_scores_gemma":[0.0002747644,0.00009719293,0.00002565445,0.0001336759,0.0000111291,0.00002755641,0.0000171636,0.07868022,0.001489184,0.9187858,0.0001800791,0.0002776448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001885909,0.00001316612,0.9958528,0.0003299562,0.0002116578,0.0003070042,0.000002623479,0.0009805984,0.0004163258],"genre_scores_gemma":[0.09045357,0.000003095242,0.9085116,0.0001911967,0.00001373512,0.00005830793,4.921516e-7,0.00002952251,0.0007385117],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6754798,"threshold_uncertainty_score":0.9981207,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2469157933","doi":"10.1145/2834115","title":"Algorithm 963","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Financial Risk and Volatility Modeling","field":"Economics, Econometrics and Finance","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Generalized method of moments; Applied mathematics; Stochastic volatility; Affine transformation; Covariance; Mathematics; Wishart distribution; Covariance function; Moment (physics); Method of moments (probability theory); Computer science; Mathematical optimization; Algorithm; Volatility (finance); Estimator; Econometrics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04339972791434208,"gpt":0.2401658334216432,"spread":0.1967661055073012,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002444611,0.0001461091,0.0002974141,0.0001098676,0.0001515414,0.00002761585,0.0002666696,0.0001238608,0.002319757],"category_scores_gemma":[0.0004259931,0.0001164772,0.0001698363,0.0001466892,0.00006317959,0.0001754182,0.000007718801,0.0001318562,0.00451742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007310834,"about_ca_system_score_gemma":0.00001187085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001307533,"about_ca_topic_score_gemma":0.000002676676,"domain_scores_codex":[0.9988596,0.000008711597,0.0004665301,0.0003350529,0.00005537996,0.0002747705],"domain_scores_gemma":[0.9988927,0.0003193308,0.0000789909,0.0005790928,0.00002716678,0.0001027403],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001128121,0.0002494059,0.0004572918,0.00003293006,0.0000301185,0.000002418659,0.0001635213,0.00002691674,0.00000782682,0.01867496,0.00003895872,0.9803044],"study_design_scores_gemma":[0.0003319249,0.00005835739,0.0004691293,0.00004916353,0.000006269205,0.000003419208,0.00001094086,0.0006217119,0.0001351703,0.9928389,0.005284575,0.0001904105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00559891,0.00008766539,0.9919708,0.001347501,0.0001585835,0.0001348906,0.0001839534,0.0001640316,0.0003536451],"genre_scores_gemma":[0.2146527,0.0001179153,0.7810964,0.0002626665,0.0000797883,0.00007370575,0.000002660437,0.00004967091,0.003664447],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.980114,"threshold_uncertainty_score":0.9985923,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03807129413798471,"gpt":0.3171835573263141,"spread":0.2791122631883294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002546892,0.0001791041,0.0002535416,0.00005277083,0.0008483757,0.0004229041,0.002288891,0.00008999793,0.0002454222],"category_scores_gemma":[0.0005166916,0.0001411138,0.0001685023,0.0001079041,0.0001230979,0.0004755974,0.00005986345,0.0002791682,0.0006649459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002764618,"about_ca_system_score_gemma":0.00002752522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008392471,"about_ca_topic_score_gemma":4.250246e-7,"domain_scores_codex":[0.9986566,0.00005142341,0.0002316538,0.0003899566,0.0003455904,0.0003247186],"domain_scores_gemma":[0.9968107,0.000491326,0.00009230201,0.002339144,0.00005587587,0.0002106753],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001094055,0.0001592474,0.000003424187,0.00001326009,0.00001566493,0.00001341434,0.00005348876,0.000007513904,0.000009708085,0.002253177,0.000009198859,0.9974608],"study_design_scores_gemma":[0.0002476184,0.000109565,0.0003065543,0.00004954757,0.00001362745,0.00002749754,0.000009455413,0.006306299,0.001080002,0.9897822,0.001836952,0.0002307391],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005723694,0.00001312048,0.9962893,0.002534941,0.0003333296,0.0001340911,0.000009845497,0.0003500638,0.0002780363],"genre_scores_gemma":[0.001077229,0.000009403409,0.9977043,0.0002733623,0.0000516187,0.00004209418,3.660444e-7,0.00001573517,0.0008259283],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9972301,"threshold_uncertainty_score":0.8546756,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020488675","doi":"10.1145/365723.365728","title":"An observation on bisection software for the symmetric tridiagonal eigenvalue problem","year":2000,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada)","funders":"","keywords":"Tridiagonal matrix; Bisection; Eigenvalues and eigenvectors; Bisection method; Mathematics; Computation; Tridiagonal matrix algorithm; Matrix (chemical analysis); Symmetric matrix; Applied mathematics; Yield (engineering); Reduction (mathematics); Minor (academic); Algebra over a field; Algorithm; Pure mathematics; Geometry; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.033292121472528,"gpt":0.2746854954116306,"spread":0.2413933739391026,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006495872,0.0002592359,0.0002329712,0.0001661323,0.0008429514,0.0002240372,0.001195641,0.0001447781,0.0006061429],"category_scores_gemma":[0.0003231639,0.0001808395,0.0002094357,0.001103593,0.00006146736,0.0005509349,0.000007547631,0.0003075589,0.0003002471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007777839,"about_ca_system_score_gemma":0.00006312579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006362937,"about_ca_topic_score_gemma":0.000002378612,"domain_scores_codex":[0.9981305,0.0001328123,0.0003897785,0.0005111687,0.0004657235,0.0003700438],"domain_scores_gemma":[0.9957829,0.002687623,0.00007848064,0.00117473,0.0001282813,0.000147982],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007204417,0.0006040399,0.000005580575,0.00007402702,0.00003989995,0.000001439569,0.0002525556,0.0108947,0.00001057503,0.01612124,0.00004061521,0.9718833],"study_design_scores_gemma":[0.0008484035,0.001040429,0.0004014276,0.00009470616,0.00008170478,0.00003053304,0.00003791945,0.04724874,0.001515263,0.9452388,0.003053112,0.0004090074],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00398127,0.00003050456,0.9930387,0.001126497,0.0001948924,0.0009188993,0.0000452627,0.000621525,0.00004247499],"genre_scores_gemma":[0.02903558,0.00003816719,0.967941,0.0007896082,0.000161318,0.0006933401,0.00001845095,0.00004413039,0.001278394],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9714743,"threshold_uncertainty_score":0.7374423,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4312080145","doi":"10.1145/3577194","title":"FastSpline: Automatic Generation of Interpolants for Lattice Samplings","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Implementation; Lattice (music); Interpolation (computer graphics); Voronoi diagram; Theoretical computer science; Algorithm; Computational science; Mathematics; Computer graphics (images); Programming language; Geometry; Animation","retraction":null,"screen_n_in":null,"score":{"opus":0.03551512802266583,"gpt":0.286194457159078,"spread":0.2506793291364122,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001216893,0.0001344571,0.0002644036,0.0001117231,0.0001384843,0.000009704601,0.000245815,0.00004043712,0.0005666428],"category_scores_gemma":[0.0001547111,0.0001311582,0.0001526041,0.0002576692,0.00002766415,0.00007672032,0.00001066622,0.0001850118,0.00001163412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009170816,"about_ca_system_score_gemma":0.000007141279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001307896,"about_ca_topic_score_gemma":0.000001049744,"domain_scores_codex":[0.9990902,0.0000193754,0.0003666477,0.0001513061,0.0002087647,0.0001637339],"domain_scores_gemma":[0.9990463,0.0004654914,0.00004982663,0.0003484514,0.00003963415,0.00005029576],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003908316,0.0007875066,0.00001905551,0.001234543,0.0003605342,0.000002269581,0.0008560159,0.2326289,0.01245886,0.0009289973,0.0002192592,0.750465],"study_design_scores_gemma":[0.0004988022,0.0004105101,0.00002472894,0.00009035601,0.0002559925,0.00001860752,0.0002121341,0.6735363,0.03385894,0.2894879,0.00114314,0.0004626318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01850947,0.00002353394,0.9803024,0.00007688979,0.00005476173,0.0002901647,0.00009837848,0.0006332711,0.00001115048],"genre_scores_gemma":[0.2931294,0.000005466151,0.7062824,0.00004924495,0.00001468738,0.0004061961,0.00001993961,0.00003609995,0.00005659311],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7500024,"threshold_uncertainty_score":0.6204342,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4396716948","doi":"10.1145/3748815","title":"A Massively Parallel Performance Portable Free-Space Spectral Poisson Solver","year":2025,"lang":"en","type":"preprint","venue":"ACM Transactions on Mathematical Software","topic":"Electromagnetic Scattering and Analysis","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"E-One Moli Energy (Canada)","funders":"Oak Ridge National Laboratory; Office of Science; National Supercomputing Centre Singapore; Centro Svizzero di Calcolo Scientifico; Paul Scherrer Institut; National Energy Research Scientific Computing Center; China Scholarship Council; U.S. Department of Energy","keywords":"Massively parallel; Parallel computing; Computer science; Space (punctuation); Solver; Poisson distribution; Computational science; Mathematics; Operating system; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01301427718076436,"gpt":0.246950607760724,"spread":0.2339363305799596,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001337523,0.0004977678,0.0006710561,0.0001756952,0.0002811128,0.0001377442,0.0009457643,0.0002144742,0.00430054],"category_scores_gemma":[0.0000331126,0.0004607819,0.0005914236,0.0002558784,0.00007662295,0.00007771607,0.00008561945,0.001111654,0.0001880899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007830461,"about_ca_system_score_gemma":0.000160707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001113985,"about_ca_topic_score_gemma":0.000005465697,"domain_scores_codex":[0.9978623,0.000046056,0.0004929025,0.0006582977,0.0003761091,0.0005642843],"domain_scores_gemma":[0.9977491,0.0002487953,0.0001716437,0.001581504,0.0000830815,0.0001658377],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005992509,0.01155274,0.01821991,0.009615787,0.01186256,0.0000752577,0.004362151,0.1860942,0.0006482002,0.0161534,0.01157085,0.7292457],"study_design_scores_gemma":[0.001235827,0.0002885206,0.001404324,0.001833002,0.001585643,0.000005635071,0.0002085987,0.005663949,0.003370842,0.9819293,0.001000614,0.001473763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04266359,0.0000456386,0.9517725,0.002390656,0.0001456881,0.0003419206,0.0002971478,0.0002366717,0.002106224],"genre_scores_gemma":[0.4128398,0.00004962839,0.5416662,0.0002222215,0.0002789639,0.0005537592,0.0001608162,0.00008789221,0.04414077],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9657759,"threshold_uncertainty_score":0.9997844,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4410120922","doi":"10.1145/3734692","title":"Algorithm 1057: FunC: A Minimally Invasive C++ Library for the Generation and Analysis of Univariate Lookup Tables","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Data Analysis with R","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Univariate; Lookup table; Computer science; Univariate analysis; Algorithm; Multivariate analysis; Programming language; Multivariate statistics; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.0205650784979438,"gpt":0.2561840371626686,"spread":0.2356189586647248,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002325602,0.0001498789,0.0003493557,0.0003706231,0.0002377102,0.0001876603,0.0008610651,0.0000738828,0.0001012241],"category_scores_gemma":[0.0002849546,0.0001050425,0.0002124215,0.001673602,0.00008797448,0.0005171272,0.00005317276,0.0000993113,0.000005338038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001743025,"about_ca_system_score_gemma":0.0001050794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001256253,"about_ca_topic_score_gemma":0.00003428824,"domain_scores_codex":[0.9988339,0.00006378629,0.0003697384,0.0003527426,0.000209665,0.0001701679],"domain_scores_gemma":[0.9962294,0.002509694,0.0001002367,0.001012932,0.00009174618,0.00005606481],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002729629,0.0004424665,0.00013743,0.0002251138,0.004378999,0.000003048623,0.0007237584,0.004371347,0.0003369737,0.02222878,0.0005006808,0.9666241],"study_design_scores_gemma":[0.0006886129,0.0001745958,0.001106487,0.0001247816,0.004990777,0.000003260151,0.0001950907,0.7165084,0.006245546,0.2683584,0.001271503,0.0003324693],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008546201,0.0001314788,0.9962726,0.002023171,0.00004697661,0.0002894384,0.0002659094,0.00009750256,0.0000183689],"genre_scores_gemma":[0.006786493,0.00007875802,0.9917975,0.0004320462,0.00001194142,0.0001084455,0.00007226736,0.0000105872,0.0007019347],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9662917,"threshold_uncertainty_score":0.4283507,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4414210256","doi":"10.1145/3766904","title":"Parsimonious Simplicial Intersection Algorithm","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Intersection (aeronautics); Efficient algorithm; Tetrahedron; Combinatorial algorithms; Approximation algorithm; Algorithm design","retraction":null,"screen_n_in":null,"score":{"opus":0.007580389898299423,"gpt":0.2573248389011466,"spread":0.2497444490028472,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005086434,0.0001785537,0.0002463624,0.0001653943,0.0001097697,0.00002540951,0.0002295803,0.0001158002,0.0002434241],"category_scores_gemma":[0.00008995109,0.0001665751,0.0001583772,0.0004861675,0.00004922179,0.00009903182,0.000006840311,0.000300045,0.0001302871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001499769,"about_ca_system_score_gemma":0.000007216599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003378923,"about_ca_topic_score_gemma":0.000003726688,"domain_scores_codex":[0.9991629,0.00001607804,0.0002718855,0.000191305,0.0001401741,0.0002177214],"domain_scores_gemma":[0.999204,0.0002618208,0.00001675465,0.0004188217,0.00003419847,0.00006438814],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005514473,0.0001109609,0.000003576112,0.00006437091,0.0000927222,0.000002413455,0.00004240591,0.006460739,0.0001595973,0.0001564201,0.0001098495,0.9927914],"study_design_scores_gemma":[0.0002565168,0.00008878644,0.00005008983,0.0001611723,0.0001540898,0.000007469485,0.0000980122,0.02631417,0.0219312,0.9469951,0.003577572,0.0003657784],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001032887,0.00002503038,0.9962176,0.0001450539,0.00012053,0.0001571888,0.00001292905,0.001907271,0.000381506],"genre_scores_gemma":[0.1628539,0.00003523313,0.8362774,0.0001876857,0.00003083815,0.0001611277,0.000006182613,0.00004153866,0.0004061311],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9924257,"threshold_uncertainty_score":0.6792737,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4417382663","doi":"10.1145/3785134","title":"Algorithm 1060: EDOLAB, a Platform for Research and Education in Evolutionary Dynamic Optimization","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"National Natural Science Foundation of China","keywords":"Benchmark (surveying); Suite; Consistency (knowledge bases); MATLAB; Evolutionary algorithm; Optimization problem; Genetic algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.03034314955807717,"gpt":0.3628512883966522,"spread":0.3325081388385751,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003763629,0.0001689572,0.0002043983,0.0006614736,0.0003849524,0.0001039477,0.0004974168,0.0001426173,0.00002760425],"category_scores_gemma":[0.0006183657,0.0001714286,0.00005088605,0.001193387,0.0001222218,0.0006708481,0.00004251557,0.00031322,0.00001369355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004047281,"about_ca_system_score_gemma":0.0003752039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005632461,"about_ca_topic_score_gemma":0.0000067084,"domain_scores_codex":[0.9984527,0.00005781496,0.0003447133,0.0005215249,0.0002891292,0.0003341059],"domain_scores_gemma":[0.99754,0.001301931,0.00005001109,0.0005926279,0.0004242662,0.0000911813],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002101853,0.0007647101,0.000008895286,0.0001045882,0.00001683316,8.508791e-7,0.0002229494,0.0705459,0.00000589872,0.00523277,0.00002209259,0.9230535],"study_design_scores_gemma":[0.0004665351,0.00007900271,0.0001047628,0.0001315849,0.00000534931,0.000006232621,0.0001278263,0.5486184,0.00004931325,0.4502072,0.00009077297,0.0001130111],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009419607,0.0001137915,0.9973306,0.0009449519,0.0001820452,0.00104764,0.0000204212,0.0001859563,0.00008036982],"genre_scores_gemma":[0.0008403427,0.00006451058,0.9964931,0.000117467,0.00001057323,0.0005928086,0.00001836813,0.00001806377,0.001844783],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9229405,"threshold_uncertainty_score":0.6990655,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4405758514","doi":"10.1145/3709136","title":"Algorithm 1054: <tt>ellipFor</tt> , a Fortran Software Library for Legendre Elliptic Integrals and Jacobi Elliptic Functions with Generalized Input Arguments","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fortran; Legendre polynomials; Jacobi elliptic functions; Elliptic integral; Elliptic function; Mathematics; Software; Quarter period; Algebra over a field; Computer science; Applied mathematics; Elliptic curve; Pure mathematics; Programming language; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01600986065039452,"gpt":0.2414653685601844,"spread":0.2254555079097899,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001760832,0.0004670758,0.0004709814,0.0003187536,0.0004785056,0.0006947156,0.0006826932,0.0001790387,0.0002097798],"category_scores_gemma":[0.00005544155,0.0003612841,0.0002754022,0.0007187426,0.0001370969,0.001273091,0.00004814105,0.0003996269,0.0001813049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007161048,"about_ca_system_score_gemma":0.000169857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005954997,"about_ca_topic_score_gemma":0.000004380242,"domain_scores_codex":[0.9975344,0.0000653009,0.0005525718,0.0008609025,0.0004114852,0.0005753555],"domain_scores_gemma":[0.9977323,0.001053985,0.00007972968,0.0007354717,0.00006870223,0.0003297881],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005526866,0.0003719369,0.00001434912,0.0006411396,0.0003085751,0.00003169563,0.0008709572,0.0009683715,0.00004481654,0.006560056,0.0004057091,0.9897271],"study_design_scores_gemma":[0.002201698,0.001454071,0.0001161532,0.001322184,0.0005062104,0.0004096132,0.0001866541,0.1580492,0.002411838,0.8171589,0.01480349,0.001379955],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008141632,0.0004778189,0.986634,0.001575604,0.0004548965,0.0009568612,0.0002024666,0.001535898,0.00002080192],"genre_scores_gemma":[0.01994645,0.00008265735,0.975437,0.0004392408,0.0001485801,0.0005189318,0.00008014511,0.000100074,0.003246855],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9883472,"threshold_uncertainty_score":0.9998839,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4413134912","doi":"10.1145/3759245","title":"Extending <tt>Irksome</tt> : Improvements in Automated Runge–Kutta Time Stepping for Finite Element Methods","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Runge–Kutta methods; Solver; Computer science; Finite element method; Partial differential equation; Applied mathematics; Diagonal; Computational science; Mathematical optimization; Algorithm; Differential equation; Mathematics; Programming language; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02712013469491828,"gpt":0.3757368847493364,"spread":0.3486167500544181,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007373398,0.0003669054,0.0005848384,0.0003868216,0.0001696023,0.0000560473,0.0004458818,0.0001679217,0.0001949154],"category_scores_gemma":[0.00160851,0.0003669358,0.0001855894,0.0007760918,0.00005163337,0.000176751,0.00002817842,0.0003792513,0.00006410303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000363733,"about_ca_system_score_gemma":0.00003150121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.307986e-7,"about_ca_topic_score_gemma":4.546995e-7,"domain_scores_codex":[0.9977978,0.0001175191,0.0008944306,0.0003931158,0.0002751327,0.0005219517],"domain_scores_gemma":[0.9912186,0.007926399,0.00008234235,0.00057944,0.0000845566,0.0001086924],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003297071,0.0003677768,0.000006522514,0.001640926,0.0002308396,0.000003155725,0.0002445475,0.2762809,0.001543844,0.00123831,0.00004264934,0.7183676],"study_design_scores_gemma":[0.0005681858,0.00005968618,0.00003079759,0.0004783276,0.00006344148,0.000001584355,0.00005539383,0.5281353,0.002949763,0.4670613,0.0003379201,0.0002583493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007200663,0.00008705335,0.9959109,0.0001536415,0.0002929824,0.00106277,0.00005387111,0.001604756,0.0001138891],"genre_scores_gemma":[0.003376197,0.0000171359,0.9953809,0.0001470585,0.00002010668,0.0006789793,0.00001317649,0.00008152903,0.0002849408],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7181092,"threshold_uncertainty_score":0.9998783,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2268217912","doi":"10.1145/2641563","title":"odeToJava","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Interpolation (computer graphics); Ode; Flexibility (engineering); Visualization; Initial value problem; Ordinary differential equation; Programming language; Algorithm; Theoretical computer science; Differential equation; Artificial intelligence; Computer graphics (images); Mathematics; Applied mathematics; Animation","retraction":null,"screen_n_in":null,"score":{"opus":0.1981350427459732,"gpt":0.3901694659703671,"spread":0.192034423224394,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004795921,0.0002687576,0.0004208552,0.0001284142,0.0001663571,0.00005540857,0.0005039511,0.0001619922,0.001291667],"category_scores_gemma":[0.005984256,0.0002217662,0.0002286584,0.0003945712,0.0001159944,0.000153193,0.00001802108,0.0003799819,0.001364172],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001245431,"about_ca_system_score_gemma":0.00006454746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005259019,"about_ca_topic_score_gemma":0.000004011892,"domain_scores_codex":[0.9979804,0.000173459,0.0004978606,0.0003359779,0.0006288061,0.0003835087],"domain_scores_gemma":[0.9958923,0.002353371,0.00009597438,0.001063235,0.0001572608,0.0004377869],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009087924,0.00221189,0.00002998431,0.0002296945,0.000187484,0.00001487577,0.001282054,0.0001354542,0.00009482332,0.02944431,0.0003454898,0.9659331],"study_design_scores_gemma":[0.000484705,0.0001635825,0.00001402393,0.00006104801,0.0001144738,0.00001912035,0.0001645864,0.00008639353,0.0009946658,0.9967402,0.0009033162,0.0002538421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004840282,0.00001055131,0.9925374,0.0008417711,0.0002369748,0.0003623763,0.00002702885,0.0006903819,0.0004532082],"genre_scores_gemma":[0.01096795,0.00000205335,0.986862,0.000169921,0.00005430299,0.0001253865,0.000003851605,0.00006892651,0.001745607],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9672959,"threshold_uncertainty_score":0.9996213,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4409477976","doi":"10.1145/3729532","title":"Intersection of Tetrahedra","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Intersection (aeronautics); Tetrahedron; Computer science; Mathematics; Geometry; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01417256748525749,"gpt":0.2701240396092887,"spread":0.2559514721240312,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001254358,0.00008354136,0.0001251064,0.0002209903,0.00009561901,0.00003303449,0.0003865036,0.00005296548,0.00009297572],"category_scores_gemma":[0.0001812525,0.00007638348,0.00009090494,0.0006554739,0.00002971798,0.0001800416,0.00001324499,0.0001077179,0.00004589153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003910158,"about_ca_system_score_gemma":0.00004976886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001799447,"about_ca_topic_score_gemma":0.000001455214,"domain_scores_codex":[0.9992762,0.00003045183,0.0002347218,0.0001855207,0.0001735009,0.00009966602],"domain_scores_gemma":[0.9989857,0.0004259437,0.00003897014,0.0004249691,0.000089685,0.00003472461],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001339135,0.0004007984,0.00001718341,0.0001272057,0.00005202393,0.000001107763,0.0002502186,0.006709256,0.00047657,0.07212465,0.00007907608,0.9197485],"study_design_scores_gemma":[0.0002614979,0.0001082212,0.0004432171,0.0001137879,0.00001969729,0.000007264615,0.00003316952,0.008400252,0.01902818,0.9708926,0.00058625,0.0001058603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005119902,0.00001782025,0.993307,0.0006277612,0.0002570834,0.0001123793,0.000002772945,0.0001452497,0.0004100632],"genre_scores_gemma":[0.4539708,0.000002618099,0.5451771,0.0001564638,0.000008652222,0.00001927456,0.000001524781,0.000003209705,0.0006603575],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9196426,"threshold_uncertainty_score":0.3114828,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}