{"meta":{"query_hash":"be689f0a511f","filters":{"venue":"Numerical Algorithms"},"cohort_total":74,"direct_labels_cover":0,"predictions_cover":74,"exported":74,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/be689f0a511f","api":"https://metacan.xera.ac/api/v1/cohort?venue=Numerical+Algorithms"},"results":[{"id":"W1606462009","doi":"10.1023/a:1016030016985","title":"Block Orderings for Tensor-Product Grids in Two and Three Dimensions","year":2002,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Numerical analysis; Mathematics; Theory of computation; Diagonal; Applied mathematics; Convergence (economics); Lexicographical order; Mathematical optimization; Iterative method; Algorithm; Mathematical analysis; Combinatorics; Geometry","score_opus":0.022956990962696152,"score_gpt":0.26152199159602724,"score_spread":0.23856500063333108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606462009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03068651,0.0014787038,0.95933115,0.005414812,0.00084213493,0.00075133244,0.000014582487,0.00038794044,0.0010928393],"genre_scores_gemma":[0.5931096,0.00008289616,0.40470275,0.0007621105,0.00043801422,0.0001179742,0.0000023526022,0.00003417638,0.0007501215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828595,0.000057454392,0.00029169655,0.00066034985,0.00021682962,0.00048769274],"domain_scores_gemma":[0.998962,0.00026841564,0.00006237161,0.00046897956,0.000064599335,0.00017367529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035822685,0.00021624354,0.00030168958,0.000115296105,0.00017180963,0.000099201796,0.0004894606,0.0000441145,0.000039260332],"category_scores_gemma":[0.00013736529,0.00018545231,0.00007376147,0.00058760616,0.00008659865,0.00029283165,0.00024915845,0.00021517236,0.000052101626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021386953,0.00052258896,0.0020338104,0.000052032225,0.000043263684,0.00009485368,0.0008110309,0.0005887314,0.0007394117,0.068203345,0.0014313392,0.9254582],"study_design_scores_gemma":[0.0011879813,0.00018482537,0.0013028055,0.000022449189,0.000009903543,0.00011261125,0.000015993854,0.9494797,0.0005894774,0.031824067,0.014832255,0.00043790461],"about_ca_topic_score_codex":0.00005966428,"about_ca_topic_score_gemma":0.0000057625316,"teacher_disagreement_score":0.948891,"about_ca_system_score_codex":0.000025459272,"about_ca_system_score_gemma":0.000012794575,"threshold_uncertainty_score":0.7562526},"labels":[],"label_agreement":null},{"id":"W1620056035","doi":"10.1023/a:1019147900265","title":"Birkhoff interpolation on unity and on Möbius transform of the roots of unity","year":2000,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Interpolation (computer graphics); Theory of computation; Combinatorics; Root of unity; Type (biology); Pure mathematics; Mathematical analysis; Discrete mathematics; Algebra over a field; Algorithm; Computer science; Physics","score_opus":0.03466162384952067,"score_gpt":0.29472631578613484,"score_spread":0.2600646919366142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1620056035","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9212461,0.0000211181,0.008617432,0.0015309337,0.00023622642,0.00062698324,0.00009656961,0.00006112327,0.067563504],"genre_scores_gemma":[0.9947861,0.000011347429,0.0034135687,0.00011957053,0.000049091344,0.000008482839,0.0000019861677,0.000013155394,0.0015967203],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990331,0.00010496727,0.00036858566,0.00012564707,0.00023858344,0.00012910695],"domain_scores_gemma":[0.9988702,0.0006311682,0.000098377335,0.00028921542,0.000046561472,0.000064461514],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024056269,0.00012527917,0.00029464322,0.000041910156,0.000072382645,0.0000075692838,0.0001221574,0.00008265356,0.0010581666],"category_scores_gemma":[0.00021712246,0.000075832184,0.000100881865,0.00024214051,0.000105618456,0.000036125606,0.00001482668,0.00018962836,0.000015980495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006543675,0.003631377,0.00050995103,0.0006715275,0.00020429712,0.00000206265,0.0025164448,0.00007456023,0.0015561922,0.19310068,0.0047177137,0.79236084],"study_design_scores_gemma":[0.0035964586,0.0045062145,0.024006793,0.0011566065,0.0004080118,0.000037969672,0.00060583494,0.0698935,0.05308059,0.8071903,0.03450785,0.0010098981],"about_ca_topic_score_codex":0.00009273723,"about_ca_topic_score_gemma":0.000005436428,"teacher_disagreement_score":0.7913509,"about_ca_system_score_codex":0.000019026324,"about_ca_system_score_gemma":0.00002007088,"threshold_uncertainty_score":0.999855},"labels":[],"label_agreement":null},{"id":"W1630012462","doi":"10.1023/a:1025516122243","title":"Galerkin Methods for Nonlinear Ordinary Differential Equation with Impulses","year":2003,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Ordinary differential equation; Uniqueness; Theory of computation; Simple (philosophy); Mathematical analysis; Applied mathematics; Numerical analysis; Differential equation; Algorithm","score_opus":0.04149493161548064,"score_gpt":0.3580176124486658,"score_spread":0.3165226808331852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1630012462","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052185415,0.00014869992,0.9974298,0.000036280147,0.00047978348,0.0003740646,0.000015402062,0.00034746775,0.00064663583],"genre_scores_gemma":[0.008103194,0.000010337907,0.99133265,0.000046692985,0.0001839131,0.00016031454,0.000022919503,0.00008878787,0.000051163337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986685,0.00013610568,0.00034718442,0.00028098433,0.00021333437,0.00035390529],"domain_scores_gemma":[0.9979043,0.0015772955,0.00006779111,0.00020721441,0.000109729895,0.00013364933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023285508,0.00026308562,0.00037681495,0.000070562135,0.000087877226,0.00003157516,0.0001433798,0.00008941221,0.00008643465],"category_scores_gemma":[0.00047348608,0.00021620914,0.000098985656,0.00037969532,0.000058790927,0.00011834942,0.00001916637,0.00019800532,0.000015064589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047024827,0.00019724782,0.000025215824,0.00016759596,0.00013181283,0.0000044234434,0.00009417314,0.08663412,0.0015667093,0.0063078785,0.000120387005,0.9047034],"study_design_scores_gemma":[0.00053551915,0.0002615014,0.00004617038,0.000022564138,0.000042219544,0.00002788663,0.000024865476,0.93686986,0.0061267843,0.04433864,0.0113516,0.00035240798],"about_ca_topic_score_codex":8.171621e-7,"about_ca_topic_score_gemma":4.290671e-8,"teacher_disagreement_score":0.904351,"about_ca_system_score_codex":0.00008086842,"about_ca_system_score_gemma":0.000024581794,"threshold_uncertainty_score":0.8816753},"labels":[],"label_agreement":null},{"id":"W1645461841","doi":"10.1023/a:1016652822276","title":"Birkhoff interpolation on non-uniformly distributed roots of unity","year":2000,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Maple; Interpolation (computer graphics); Theory of computation; Linear interpolation; Combinatorics; Pure mathematics; Discrete mathematics; Applied mathematics; Mathematical analysis; Algorithm; Computer science; Motion (physics)","score_opus":0.00658792249143084,"score_gpt":0.23754368707295415,"score_spread":0.2309557645815233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1645461841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058259413,0.0000364304,0.9346524,0.000089700785,0.000074528936,0.00017327361,0.00008383219,0.00077672815,0.005853703],"genre_scores_gemma":[0.9726951,0.0000449342,0.026896767,0.00005817914,0.000063314794,0.000019760775,0.00009316027,0.000035566703,0.00009320138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988535,0.000025809719,0.00038374375,0.00020595656,0.00025810627,0.00027288785],"domain_scores_gemma":[0.99939835,0.000073477866,0.000050950923,0.00029823981,0.00005233995,0.00012666738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006680041,0.00021219683,0.0003617715,0.00009742391,0.00004314646,0.000011992978,0.00021097802,0.000104104816,0.0006249192],"category_scores_gemma":[0.000029371939,0.00018776931,0.00013169827,0.0007979103,0.00006038292,0.00014797715,0.000020989712,0.0002787944,0.00013172366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007609692,0.00033079612,0.00052022503,0.000045590114,0.00012590729,0.00001158208,0.00007272346,0.05476648,0.005424648,0.00017275718,0.0015078261,0.9369454],"study_design_scores_gemma":[0.00030224922,0.00032608872,0.009280138,0.000050577877,0.00003394262,0.0000041803264,0.00001872656,0.9539709,0.01968524,0.0015897747,0.01434632,0.00039185683],"about_ca_topic_score_codex":0.000056864177,"about_ca_topic_score_gemma":0.0000013206827,"teacher_disagreement_score":0.93655354,"about_ca_system_score_codex":0.00008924932,"about_ca_system_score_gemma":0.0000074034133,"threshold_uncertainty_score":0.765701},"labels":[],"label_agreement":null},{"id":"W1655710639","doi":"10.1023/a:1021190918665","title":"Global Error Estimators for Order 7, 8 Runge–Kutta Pairs","year":2002,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Estimator; Runge–Kutta methods; Theory of computation; Initial value problem; Applied mathematics; Approximation error; Quadrature (astronomy); Sequence (biology); Differential equation; Mathematical analysis; Algorithm; Statistics","score_opus":0.12715866096387993,"score_gpt":0.3883227309792588,"score_spread":0.2611640700153789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1655710639","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001801983,0.0000967349,0.9929257,0.0015939791,0.00075549167,0.00072574185,0.00013072387,0.00046239648,0.0015072238],"genre_scores_gemma":[0.022844128,0.000005060004,0.975095,0.00028771677,0.00031166812,0.00027271514,0.00001906261,0.00007665579,0.0010880076],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974365,0.00015208064,0.0006108044,0.00056561193,0.00051677454,0.0007182309],"domain_scores_gemma":[0.99765295,0.0010315715,0.00019817795,0.00053277356,0.0002168309,0.00036772582],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026581096,0.00037490294,0.0006060477,0.00006614944,0.00024664277,0.00007153303,0.00041439114,0.00020106728,0.001407961],"category_scores_gemma":[0.002310132,0.00032296713,0.0003167496,0.0009526599,0.00013648727,0.00015129644,0.00010412522,0.00020079652,0.00026183567],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058024776,0.002060979,0.0012774434,0.00018159345,0.00032752778,0.00001837163,0.0003574033,0.0001080763,0.000066015986,0.06439268,0.02438311,0.9067688],"study_design_scores_gemma":[0.0013208773,0.00041120852,0.0006870755,0.00003427025,0.00023525044,0.000028443972,0.00008230339,0.29139417,0.00009681002,0.68329525,0.02167875,0.00073558063],"about_ca_topic_score_codex":0.00004369141,"about_ca_topic_score_gemma":0.000004381188,"teacher_disagreement_score":0.9060332,"about_ca_system_score_codex":0.00017294502,"about_ca_system_score_gemma":0.000031659718,"threshold_uncertainty_score":0.9999222},"labels":[],"label_agreement":null},{"id":"W1667785455","doi":"10.1023/a:1021108323034","title":"A New View of the Computational Complexity of IVP for ODE","year":2002,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics","score_opus":0.21892451338000948,"score_gpt":0.3802055099552841,"score_spread":0.16128099657527464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1667785455","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008213082,0.00007149657,0.9965477,0.0014984667,0.00018716147,0.0004479748,0.00008078438,0.00003167907,0.00031340402],"genre_scores_gemma":[0.047264934,0.0000028587178,0.9521841,0.00010462952,0.000077140736,0.000022466918,0.0000050876433,0.00002130514,0.00031751883],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985649,0.00013738795,0.0005408388,0.00017740477,0.00039108712,0.00018837431],"domain_scores_gemma":[0.9979633,0.001193473,0.0003092532,0.00028135168,0.00016063474,0.00009195383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016108145,0.00013447441,0.00043946516,0.000034517714,0.000074573894,0.0000074417994,0.00031436785,0.000059262165,0.00062022],"category_scores_gemma":[0.0006740064,0.00009331381,0.00029244757,0.00039919,0.00019815806,0.000041148636,0.000077041,0.00011863266,0.000009128099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000296514,0.0010843842,0.00017166747,0.00031878383,0.00018718658,3.0336696e-7,0.0006653734,0.00027441935,0.0005286719,0.31801617,0.0044885217,0.67423487],"study_design_scores_gemma":[0.0005324201,0.000114565526,0.0010200364,0.000038981696,0.00007155668,0.0000028209531,0.000015381449,0.09592858,0.0008650635,0.89917827,0.0021205049,0.00011184192],"about_ca_topic_score_codex":0.00006004723,"about_ca_topic_score_gemma":0.0000018699892,"teacher_disagreement_score":0.674123,"about_ca_system_score_codex":0.000027947437,"about_ca_system_score_gemma":0.000033013963,"threshold_uncertainty_score":0.67909735},"labels":[],"label_agreement":null},{"id":"W1964064560","doi":"10.1007/s11075-008-9158-y","title":"Closed-form evaluations of certain definite integrals by employing the Cauchy integral theorem","year":2008,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Cauchy's integral formula; Methods of contour integration; Cauchy's integral theorem; Cauchy distribution; Residue theorem; Computation; Pure mathematics; Theory of computation; Function (biology); Improper integral; Cauchy principal value; Mathematical analysis; Integral equation; Cauchy problem; Initial value problem; Singular integral; Cauchy boundary condition; Boundary value problem","score_opus":0.08544542573919696,"score_gpt":0.3618550979825634,"score_spread":0.27640967224336643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964064560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17433737,0.0006767653,0.8062523,0.0016538162,0.00040749967,0.001283205,0.00016336418,0.00046904036,0.014756613],"genre_scores_gemma":[0.8198752,0.00012487533,0.17205247,0.00028918122,0.00016654802,0.00022419085,0.000033724133,0.00012120625,0.007112618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974859,0.00018776533,0.00080466486,0.00030026524,0.0007636362,0.00045776903],"domain_scores_gemma":[0.99615574,0.0025646514,0.0003114102,0.0005839723,0.0002579317,0.00012626858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057320314,0.00030611345,0.0005809472,0.00008695087,0.0003138365,0.000031149833,0.00053136406,0.000120160985,0.00034477175],"category_scores_gemma":[0.002577628,0.00019040715,0.0002739091,0.0004941389,0.0006173035,0.00022172193,0.00015293925,0.00046029198,0.000093912546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070649796,0.0012599739,0.00069145643,0.00024804857,0.000361732,0.000029457226,0.012582317,0.000044160395,0.001197444,0.91581357,0.024926266,0.04277494],"study_design_scores_gemma":[0.00040283063,0.00013728616,0.00015533535,0.00008648191,0.00009151779,0.00005412667,0.0016180518,0.00560995,0.003704226,0.98661345,0.0012358397,0.00029090323],"about_ca_topic_score_codex":0.0001204369,"about_ca_topic_score_gemma":0.000008277488,"teacher_disagreement_score":0.6455378,"about_ca_system_score_codex":0.00011082037,"about_ca_system_score_gemma":0.00008364869,"threshold_uncertainty_score":0.77645785},"labels":[],"label_agreement":null},{"id":"W1969652671","doi":"10.1007/s11075-013-9770-3","title":"Stability of rootfinding for barycentric Lagrange interpolants","year":2013,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Barycentric coordinate system; Companion matrix; Lagrange polynomial; Basis (linear algebra); Condition number; Monomial basis; Polynomial basis; Matrix (chemical analysis); Monomial; Polynomial; Theory of computation; Computation; Applied mathematics; Univariate; Matrix polynomial; Polynomial matrix; Combinatorics; Mathematical analysis; Algorithm; Geometry","score_opus":0.020313011535163076,"score_gpt":0.2514376002324644,"score_spread":0.23112458869730135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969652671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008358293,0.00013124243,0.9889482,0.0003812963,0.0005034547,0.0005349444,0.000020393285,0.00014009436,0.0009820445],"genre_scores_gemma":[0.82813793,0.0000064942715,0.17134266,0.00014444314,0.00013753932,0.00010012759,0.0000056077256,0.000013614611,0.000111595495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984272,0.000086623346,0.00039057268,0.00041334555,0.00026020253,0.0004220309],"domain_scores_gemma":[0.99857277,0.00048017153,0.00014354746,0.0004726974,0.00015799513,0.00017284465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048551767,0.00017191451,0.000323013,0.000091288515,0.00009480916,0.00007940566,0.0008694389,0.00007593737,0.000256847],"category_scores_gemma":[0.00016385663,0.0001408424,0.00016592989,0.00052654557,0.00006396354,0.0004969521,0.00021871373,0.00013386279,0.00009855084],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020547297,0.0004228717,0.0015652857,0.00011630747,0.00004924308,0.0000041876515,0.0006823967,0.0000067919996,0.0013317964,0.030234732,0.00082746043,0.96473837],"study_design_scores_gemma":[0.0015744207,0.00064841623,0.007880232,0.00005890821,0.000026342568,0.000028475855,0.00016550868,0.8964114,0.029132865,0.05658785,0.0067337924,0.0007517827],"about_ca_topic_score_codex":0.0000831055,"about_ca_topic_score_gemma":4.4564516e-7,"teacher_disagreement_score":0.9639866,"about_ca_system_score_codex":0.000039724775,"about_ca_system_score_gemma":0.000039360555,"threshold_uncertainty_score":0.5743386},"labels":[],"label_agreement":null},{"id":"W1974529128","doi":"10.1007/s11075-014-9901-5","title":"A simple moving mesh method for blowup problems","year":2014,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Computational Fluid Dynamics and Aerodynamics","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Cape Breton University","funders":"","keywords":"Mathematics; Diagonal; Nonlinear system; Simple (philosophy); Generator (circuit theory); Mathematical analysis; Space (punctuation); Partial differential equation; Infinity; Theory of computation; Applied mathematics; Geometry; Algorithm; Computer science; Physics","score_opus":0.008022311898380478,"score_gpt":0.24659954403469952,"score_spread":0.23857723213631904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974529128","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023511385,0.000042628162,0.9960558,0.000101925434,0.00028180834,0.00020578591,0.000030453506,0.00030003622,0.00063046836],"genre_scores_gemma":[0.23523255,0.000008786074,0.76376665,0.00018866954,0.00036505453,0.00010821665,0.00010573299,0.000078110716,0.00014624419],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907285,0.000021246762,0.00023191085,0.00021708872,0.00015760065,0.00029931898],"domain_scores_gemma":[0.9993554,0.00031309878,0.000023046137,0.00014206376,0.000060801645,0.000105627354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021763453,0.00015915476,0.00021989529,0.000048278744,0.000073061165,0.000047249076,0.00014451948,0.00006472867,0.000021008598],"category_scores_gemma":[0.000057091627,0.00015547482,0.00010806288,0.00018163353,0.0000114778795,0.0000603537,0.000033445107,0.00011944029,0.000018184735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030715553,0.00003372189,0.000058120688,0.00006754325,0.000045665733,7.2722173e-7,0.000059150858,0.66408485,0.0010420278,0.011850675,0.00063639454,0.32211804],"study_design_scores_gemma":[0.00026966535,0.000055058117,0.00034208962,0.0000071675954,0.000012529927,0.0000045366733,0.000005068439,0.96624714,0.000036858808,0.014116843,0.018696234,0.00020679881],"about_ca_topic_score_codex":0.0000227279,"about_ca_topic_score_gemma":0.0000041056146,"teacher_disagreement_score":0.32191125,"about_ca_system_score_codex":0.000053676195,"about_ca_system_score_gemma":0.000011102808,"threshold_uncertainty_score":0.6340079},"labels":[],"label_agreement":null},{"id":"W1975156486","doi":"10.1023/b:numa.0000049464.45146.88","title":"Exact Solutions of Extended Boussinesq Equations","year":2004,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Coastal and Marine Dynamics","field":"Earth and Planetary Sciences","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; University of Toronto; Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Mathematics; Boussinesq approximation (buoyancy); Numerical analysis; Nonlinear system; Range (aeronautics); Exact solutions in general relativity; Theory of computation; Applied mathematics; Mathematical analysis; Algorithm; Physics; Mechanics","score_opus":0.017844142765923447,"score_gpt":0.23016135479353395,"score_spread":0.2123172120276105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975156486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0287036,0.00030978618,0.9442241,0.0028718472,0.0007049949,0.00025979924,0.0003402678,0.0001751075,0.02241045],"genre_scores_gemma":[0.98484004,0.000015109191,0.014467303,0.00008219141,0.00007863186,0.000001139528,0.00014039419,0.0000028196562,0.0003723757],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99920374,0.000017320592,0.00018844292,0.00015427971,0.00019552861,0.00024067242],"domain_scores_gemma":[0.999588,0.00006985191,0.0000540179,0.00013373369,0.000044517732,0.00010987376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000077509,0.00008977643,0.00013767104,0.00005173691,0.00011755655,0.000016340315,0.00012653651,0.00003844213,0.00087323674],"category_scores_gemma":[0.00006138442,0.00007170807,0.0000727044,0.00034256934,0.00007142127,0.00011851029,0.000022526008,0.000094842224,0.00015331141],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020794392,0.00021864293,0.004063898,0.000014114066,0.000026333593,0.000015834534,0.00013212227,0.0208633,0.000065485736,0.0049393442,0.00008553057,0.9695546],"study_design_scores_gemma":[0.001262113,0.0006753557,0.49628377,0.000029013556,0.000057137466,0.000058959846,0.00017866436,0.4271269,0.00009806895,0.06754538,0.006147057,0.0005375722],"about_ca_topic_score_codex":0.0068876287,"about_ca_topic_score_gemma":0.00082070794,"teacher_disagreement_score":0.969017,"about_ca_system_score_codex":0.000008333549,"about_ca_system_score_gemma":0.00008459263,"threshold_uncertainty_score":0.9997256},"labels":[],"label_agreement":null},{"id":"W1975654827","doi":"10.1007/s11075-009-9317-9","title":"Quadratic spline collocation for one-dimensional linear parabolic partial differential equations","year":2009,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Differential Equations and Numerical Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Discretization; Partial differential equation; Applied mathematics; Collocation (remote sensing); Spline (mechanical); Orthogonal collocation; Parabolic partial differential equation; Tridiagonal matrix; Collocation method; Dimension (graph theory); Quadratic equation; Mathematical optimization; Mathematical analysis; Ordinary differential equation; Differential equation; Computer science; Geometry","score_opus":0.10306374602243626,"score_gpt":0.3891902368052939,"score_spread":0.2861264907828577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975654827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011522379,0.000037623835,0.98502606,0.0017526268,0.00046866556,0.00081678055,0.000051266623,0.00020144986,0.0001231733],"genre_scores_gemma":[0.542267,0.000003567674,0.45548555,0.00032660304,0.00094106403,0.00020502965,0.0001591079,0.000038836446,0.0005731841],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997511,0.00019117916,0.000768041,0.00048341183,0.0005458448,0.00050048257],"domain_scores_gemma":[0.99749315,0.0013529059,0.00024142321,0.00038711447,0.00026193933,0.00026344863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031197758,0.00030599552,0.0005883388,0.00011903644,0.0003261489,0.00007026211,0.00023134785,0.00017436036,0.0004097618],"category_scores_gemma":[0.0014218575,0.00027062633,0.00027295304,0.0004925474,0.00007125235,0.00014490746,0.000037672,0.0002256729,0.000070316186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053564255,0.00804471,0.000034708413,0.00011084197,0.0002946915,0.0000046671344,0.00044756185,0.0010242854,0.010248989,0.4666141,0.0024940039,0.5101458],"study_design_scores_gemma":[0.0016145464,0.00082681305,0.0008513115,0.00003967866,0.00024907888,0.0000032508235,0.000019819468,0.8142634,0.0033900265,0.17653011,0.0017270171,0.00048495634],"about_ca_topic_score_codex":0.000021070964,"about_ca_topic_score_gemma":0.0000018786255,"teacher_disagreement_score":0.8132391,"about_ca_system_score_codex":0.00007099575,"about_ca_system_score_gemma":0.00009654148,"threshold_uncertainty_score":0.9999746},"labels":[],"label_agreement":null},{"id":"W1981707982","doi":"10.1023/b:numa.0000005350.20098.b1","title":"Characterization of Trimmed NURBS Surface Boundaries Using Topological Criteria","year":2003,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Mathematics; Trimming; Topology (electrical circuits); Boundary (topology); Surface (topology); Gravitational singularity; Parametric surface; Parametric statistics; Point (geometry); Mathematical analysis; Geometry; Computer science; Combinatorics","score_opus":0.036045262179647666,"score_gpt":0.3065788427422236,"score_spread":0.2705335805625759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981707982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08279225,0.000049900347,0.9152702,0.00024778844,0.00029057614,0.00010679046,0.000005524977,0.00029547347,0.0009415017],"genre_scores_gemma":[0.5542658,0.0000026699229,0.44551763,0.00012306114,0.000015970141,0.000002913285,0.000003537949,0.000008443366,0.00005998273],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986071,0.00011606457,0.00034645988,0.00035717853,0.0002857427,0.000287482],"domain_scores_gemma":[0.9991994,0.00004960294,0.00016192369,0.00033096317,0.00016911067,0.00008903491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023599304,0.00016293478,0.00029033658,0.000054577595,0.00012349627,0.0005316615,0.000503997,0.000090274436,0.00003526713],"category_scores_gemma":[0.00021586273,0.00014355843,0.00006586893,0.00058007264,0.00028279718,0.0009951191,0.00013403039,0.00011293325,0.00000832593],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028453276,0.0008038733,0.00070012483,0.00007727966,0.000038695096,0.00005098521,0.0011626285,0.000011810673,0.8108838,0.057832245,0.00012786119,0.12828222],"study_design_scores_gemma":[0.0003897677,0.0003210335,0.0011534451,0.000055824414,0.000013950902,0.00010808584,0.00002829452,0.103776254,0.85288036,0.03083386,0.009876987,0.00056211825],"about_ca_topic_score_codex":0.000018606052,"about_ca_topic_score_gemma":5.9023318e-8,"teacher_disagreement_score":0.47147354,"about_ca_system_score_codex":0.000046569618,"about_ca_system_score_gemma":0.00015585528,"threshold_uncertainty_score":0.5854143},"labels":[],"label_agreement":null},{"id":"W1982479999","doi":"10.1007/s11075-009-9288-x","title":"The reliability/cost trade-off for a class of ODE solvers","year":2009,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ode; Piecewise; Estimator; Runge–Kutta methods; Residual; Mathematics; Reliability (semiconductor); Mathematical optimization; Theory of computation; Applied mathematics; Polynomial; Piecewise linear function; Numerical analysis; Order of accuracy; Class (philosophy); Ordinary differential equation; Computer science; Algorithm; Differential equation; Mathematical analysis; Statistics","score_opus":0.05893164806147973,"score_gpt":0.36830830092482825,"score_spread":0.30937665286334853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982479999","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027513942,0.000078692414,0.9882747,0.006555967,0.0003828852,0.0010808385,0.000046277677,0.00013117558,0.00069810066],"genre_scores_gemma":[0.12985557,0.000038018512,0.8688697,0.00034267295,0.0002548318,0.00020433796,0.0000117802865,0.000049563536,0.00037350808],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791616,0.00019783321,0.00065219676,0.0003374968,0.00042029723,0.00047598872],"domain_scores_gemma":[0.9951869,0.0037320517,0.00024801705,0.00055879174,0.00011015204,0.00016405902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006679611,0.00022003289,0.00047155845,0.00004452154,0.0002577349,0.00003638876,0.0004178695,0.00012843963,0.00003270596],"category_scores_gemma":[0.003066515,0.00014735802,0.00037632737,0.00040811987,0.0001833894,0.000081275306,0.000034589,0.00025773188,0.0000081414155],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100613775,0.000533406,0.000023240313,0.000030391133,0.00005008834,7.178328e-7,0.00024550225,0.000034110086,0.00075584993,0.035556924,0.0014999106,0.96116924],"study_design_scores_gemma":[0.0008810939,0.0007093461,0.0009021892,0.000024430305,0.00012902248,0.000004035154,0.00014611678,0.04092597,0.0027813767,0.90669715,0.046505835,0.0002934294],"about_ca_topic_score_codex":0.000012598875,"about_ca_topic_score_gemma":0.0000018958109,"teacher_disagreement_score":0.9608758,"about_ca_system_score_codex":0.00009105914,"about_ca_system_score_gemma":0.000062739666,"threshold_uncertainty_score":0.6009086},"labels":[],"label_agreement":null},{"id":"W1991794829","doi":"10.1007/s11075-012-9574-x","title":"A comparative study of numerical steepest descent, extrapolation, and sequence transformation methods in computing semi-infinite integrals","year":2012,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Electromagnetic Scattering and Analysis","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Extrapolation; Theory of computation; Mathematics; Descent (aeronautics); Sequence (biology); Method of steepest descent; Numerical analysis; Applied mathematics; Transformation (genetics); Richardson extrapolation; Mathematical analysis; Algorithm; Physics","score_opus":0.04929126396213066,"score_gpt":0.3769092674746912,"score_spread":0.32761800351256054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991794829","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5963769,0.000071838345,0.4030701,0.000030690455,0.000025322763,0.00013944787,0.0000047209373,0.000012784547,0.00026819584],"genre_scores_gemma":[0.96561074,0.0000018747476,0.03426297,0.000013627388,0.00006987678,0.00001290254,0.000010258956,0.0000079499005,0.000009795079],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986163,0.0003039802,0.0004501955,0.00018705192,0.00015440186,0.0002880789],"domain_scores_gemma":[0.9993746,0.00021498285,0.00014482354,0.000111434325,0.00005076106,0.00010339847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030806605,0.00016019502,0.00042346737,0.00010498056,0.00006805724,0.000024674418,0.000090015084,0.000029211918,0.00006587044],"category_scores_gemma":[0.0000065750583,0.00014015153,0.00005883247,0.000554684,0.00004349127,0.000180201,0.000024498266,0.00021095063,0.0000030808458],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001842875,0.0015165702,0.46246743,0.000020717998,0.00015882133,5.143822e-7,0.030240376,0.00074328453,0.0042798733,0.000597647,0.000006653646,0.4999497],"study_design_scores_gemma":[0.0018480299,0.0008232426,0.39596742,0.00010330928,0.00015836254,0.0000070888027,0.014104427,0.5803091,0.00544362,0.00054239854,0.00011073752,0.00058228977],"about_ca_topic_score_codex":0.00069790136,"about_ca_topic_score_gemma":0.0000017993268,"teacher_disagreement_score":0.57956576,"about_ca_system_score_codex":0.00002335857,"about_ca_system_score_gemma":0.00001462528,"threshold_uncertainty_score":0.57152134},"labels":[],"label_agreement":null},{"id":"W1993293547","doi":"10.1007/s11075-014-9910-4","title":"Some new periodic Golay pairs","year":2014,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Binary Golay code; Mathematics; Hadamard transform; Ternary Golay code; Combinatorics; Statistics; Mathematical analysis; Hamming code","score_opus":0.007193687431960727,"score_gpt":0.19346671730521492,"score_spread":0.1862730298732542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993293547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14984201,0.0060119973,0.78619933,0.0010993531,0.010736305,0.00074944197,0.000026952373,0.005914544,0.039420087],"genre_scores_gemma":[0.9952722,0.000019905146,0.0023476614,0.00017388503,0.0012902495,0.000016153854,0.000006071376,0.000048119684,0.0008257495],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990179,0.000054436714,0.00021118924,0.00019627428,0.00017879119,0.0003413846],"domain_scores_gemma":[0.9993904,0.000056979126,0.000020457155,0.00026898755,0.000011954213,0.00025122316],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015308849,0.0001838605,0.0002481778,0.000053295502,0.000067995126,0.000046732086,0.000199552,0.00009798856,0.00019716696],"category_scores_gemma":[0.000024410556,0.00016415889,0.00011534593,0.0002047748,0.000035881985,0.00013063202,0.000019947616,0.00019544073,0.00088002323],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030194427,0.00014600337,0.0020408642,0.00021821845,0.00025582014,0.000039805767,0.001983652,0.012786037,0.005265993,0.06129381,0.05119794,0.8647417],"study_design_scores_gemma":[0.0010049698,0.0002469178,0.0036666002,0.000054469558,0.00003808443,0.00006024084,0.00015838748,0.29480284,0.0022066804,0.022248276,0.6745493,0.00096322404],"about_ca_topic_score_codex":0.00003937122,"about_ca_topic_score_gemma":6.990631e-7,"teacher_disagreement_score":0.8637784,"about_ca_system_score_codex":0.00002786422,"about_ca_system_score_gemma":0.000011072138,"threshold_uncertainty_score":0.9998979},"labels":[],"label_agreement":null},{"id":"W2002504778","doi":"10.1007/s11075-014-9884-2","title":"Optimized Schwarz methods for a diffusion problem with discontinuous coefficient","year":2014,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"John Abbott College","funders":"","keywords":"Mathematics; Theory of computation; Convergence (economics); Jump; Diffusion; Applied mathematics; Schwarz alternating method; Numerical analysis; Jump diffusion; Mathematical optimization; Mathematical analysis; Algorithm; Domain decomposition methods; Finite element method","score_opus":0.016313802514560806,"score_gpt":0.323244523130922,"score_spread":0.3069307206163612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002504778","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000180068,0.00009006477,0.99713874,0.00013633979,0.0002699932,0.00066116074,0.000008537148,0.00058944646,0.0009256295],"genre_scores_gemma":[0.003398521,0.000005946372,0.99582946,0.00008944447,0.0001539051,0.0003246023,0.000012521615,0.00010078822,0.000084797255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984378,0.00013665509,0.00040013067,0.0003485857,0.00024912597,0.0004276981],"domain_scores_gemma":[0.99744236,0.0019028445,0.000088968925,0.00027097808,0.00011414288,0.00018069566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046600014,0.00029400468,0.00052815885,0.00007061674,0.00010852596,0.00004646522,0.00023404935,0.000084128,0.000019611316],"category_scores_gemma":[0.0003700729,0.0002185159,0.000109172244,0.0003812955,0.00008244325,0.00008616277,0.000057340836,0.0002169276,0.00001335098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003985656,0.00010467948,0.000002723037,0.00009408674,0.00003691274,8.4815167e-7,0.000092057475,0.40730867,0.0004105206,0.0022154134,0.000061776045,0.58963245],"study_design_scores_gemma":[0.0009810077,0.00029818283,0.000019538902,0.000049877486,0.000034134653,0.00001567506,0.00002419889,0.9635486,0.0009267357,0.021298448,0.012461758,0.00034184867],"about_ca_topic_score_codex":0.0000015394355,"about_ca_topic_score_gemma":4.2328093e-8,"teacher_disagreement_score":0.5892906,"about_ca_system_score_codex":0.00007442214,"about_ca_system_score_gemma":0.000013387883,"threshold_uncertainty_score":0.891082},"labels":[],"label_agreement":null},{"id":"W2012227840","doi":"10.1007/s11075-009-9266-3","title":"New interpolants for asymptotically correct defect control of BVODEs","year":2009,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; University of Toronto","funders":"","keywords":"Ode; Mathematics; Bounded function; Asymptotically optimal algorithm; Applied mathematics; Ordinary differential equation; Context (archaeology); Polygon mesh; Numerical analysis; Pointwise; Mathematical optimization; Differential equation; Mathematical analysis; Geometry","score_opus":0.015372535639660975,"score_gpt":0.29551999686660413,"score_spread":0.2801474612269432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012227840","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026638058,0.0002326073,0.99777496,0.00010711091,0.00039898258,0.00029258744,0.00002306859,0.00025493448,0.00064936146],"genre_scores_gemma":[0.34383082,0.000005715564,0.65583605,0.00013000764,0.0001371288,0.000010001866,0.0000029825098,0.000024479436,0.00002281224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988334,0.000035263296,0.00042188473,0.00019171962,0.00022248454,0.00029520234],"domain_scores_gemma":[0.9979521,0.0015537699,0.00007073509,0.00017181395,0.00008576593,0.00016581175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014086897,0.00020093334,0.00046996886,0.0000613047,0.00002719897,0.000014195925,0.00021014946,0.00008346068,0.000031855412],"category_scores_gemma":[0.00060368446,0.00018097177,0.00020237008,0.0002328833,0.000031926284,0.000074648146,0.000012436965,0.00015955206,0.000015461861],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068620495,0.00009112133,0.0000427956,0.00006263635,0.00009628366,0.000002670514,0.00008380733,0.050323356,0.0019195114,0.0047201905,0.000622094,0.9419669],"study_design_scores_gemma":[0.00087306165,0.0005421259,0.00045711713,0.00005598303,0.00004884515,0.000015192861,0.000009977864,0.88509053,0.0027568229,0.10887704,0.0010034877,0.00026982496],"about_ca_topic_score_codex":0.000001433869,"about_ca_topic_score_gemma":5.6273475e-8,"teacher_disagreement_score":0.94169706,"about_ca_system_score_codex":0.000051288804,"about_ca_system_score_gemma":0.00002589801,"threshold_uncertainty_score":0.73798144},"labels":[],"label_agreement":null},{"id":"W2018029404","doi":"10.1007/s11075-013-9743-6","title":"Useful properties of the coefficients of the Slevinsky-Safouhi formula for differentiation","year":2013,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Theory of computation; Orthogonality; Numerical differentiation; Recurrence relation; Characterization (materials science); Applied mathematics; Matrix (chemical analysis); Numerical analysis; Algebra over a field; Pure mathematics; Mathematical analysis; Algorithm; Geometry","score_opus":0.056245417150584204,"score_gpt":0.2699535389593699,"score_spread":0.2137081218087857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018029404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82853633,0.000057658493,0.16637665,0.0011651247,0.00073284574,0.0024130347,0.000050926796,0.000038678623,0.00062873645],"genre_scores_gemma":[0.99206585,0.0000015897659,0.0060692118,0.0000694318,0.000062214036,0.00014851666,0.0000011156628,0.000018700459,0.0015633779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99884814,0.00006689263,0.00047697258,0.00012519141,0.00030295367,0.00017982934],"domain_scores_gemma":[0.9987459,0.00032607108,0.00027087663,0.00043056897,0.00018913,0.000037458594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015802162,0.00012298167,0.00029203613,0.000021670754,0.000119301636,0.000018585766,0.00031937397,0.00006935102,0.00019378781],"category_scores_gemma":[0.0007110699,0.00005377177,0.000245136,0.00019734098,0.00010716544,0.00005853158,0.00011155521,0.00008440658,0.0000115417615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039176762,0.014484761,0.019145846,0.011487602,0.0017210273,3.1329137e-7,0.017349994,0.00047433813,0.19960609,0.4494833,0.079938784,0.20591617],"study_design_scores_gemma":[0.0029325946,0.00060316647,0.025594387,0.0010909827,0.0006532382,0.000011087198,0.000738747,0.22275148,0.45294625,0.28200278,0.009819972,0.00085531763],"about_ca_topic_score_codex":0.00005284589,"about_ca_topic_score_gemma":0.0000018662805,"teacher_disagreement_score":0.25334015,"about_ca_system_score_codex":0.000021314876,"about_ca_system_score_gemma":0.000029074816,"threshold_uncertainty_score":0.21927492},"labels":[],"label_agreement":null},{"id":"W2024861657","doi":"10.1023/a:1024077930017","title":"Fourth-Order Symmetric DIRK Methods for Periodic Stiff Problems","year":2003,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universidad de Zaragoza; Ryerson University","keywords":"Mathematics; Symplectic geometry; Numerical analysis; Homogeneous; Ode; Applied mathematics; Mathematical analysis; Runge–Kutta methods; Dispersion (optics); Nonlinear system; Stability (learning theory); Numerical integration; Theory of computation; Combinatorics; Algorithm; Physics; Computer science","score_opus":0.09974512545404286,"score_gpt":0.416837690776917,"score_spread":0.31709256532287416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024861657","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004170408,0.0003264914,0.9943936,0.00037273837,0.00095446483,0.0013462467,0.0000299741,0.0003263207,0.001833154],"genre_scores_gemma":[0.0021364894,0.000019381656,0.9951712,0.0001399496,0.00018577425,0.0007432167,0.000017142838,0.00013628126,0.0014505825],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960593,0.0009566268,0.000853969,0.0007628933,0.0004732713,0.00089397025],"domain_scores_gemma":[0.99368936,0.0045199343,0.0003117736,0.0006741469,0.0003895131,0.00041527158],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016047598,0.00047338285,0.0008904864,0.00029121296,0.00037219102,0.0001270724,0.00040545533,0.00025225835,0.0005963783],"category_scores_gemma":[0.013522316,0.00039720393,0.00042409103,0.0021262849,0.00014736682,0.00016272563,0.000081378304,0.00043825776,0.000085999156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002254931,0.00089386187,0.00012045515,0.00018971047,0.0002093675,0.0000028345075,0.00041032565,0.000048620885,0.001084648,0.091120936,0.00040417883,0.9054925],"study_design_scores_gemma":[0.0013887988,0.0004836744,0.00017412796,0.000037238242,0.0002886936,0.00003199215,0.0001070936,0.04087647,0.0023098195,0.87037903,0.08313122,0.00079186517],"about_ca_topic_score_codex":0.000037720387,"about_ca_topic_score_gemma":0.0000015424569,"teacher_disagreement_score":0.90470064,"about_ca_system_score_codex":0.00015246378,"about_ca_system_score_gemma":0.00013485721,"threshold_uncertainty_score":0.999848},"labels":[],"label_agreement":null},{"id":"W2027133122","doi":"10.1007/s11075-010-9375-z","title":"An analytical approach for solving nonlinear boundary value problems in finite domains","year":2010,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Fractional Differential Equations Solutions","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Homotopy analysis method; Theory of computation; Nonlinear system; Boundary value problem; Shooting method; Galerkin method; Homotopy; Numerical analysis; Applied mathematics; Sinc function; Mathematical analysis; Mathematical optimization; Algorithm","score_opus":0.05418572371415838,"score_gpt":0.34612915790283255,"score_spread":0.2919434341886742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027133122","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017405545,0.000009063111,0.9800207,0.0003035685,0.00029303832,0.000641503,0.00010565468,0.0001425694,0.0010783297],"genre_scores_gemma":[0.28666353,0.0000015637672,0.7121427,0.000077823555,0.00045730075,0.00023455675,0.00021486222,0.00004734622,0.00016033222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981878,0.00006185509,0.00049071474,0.00043586598,0.00037447622,0.00044931535],"domain_scores_gemma":[0.9982652,0.0008848423,0.000106045234,0.00040525376,0.00013839666,0.00020027348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045726032,0.00020983227,0.00032997486,0.00018264494,0.00025783925,0.000106658874,0.00027282734,0.00020951542,0.00011781956],"category_scores_gemma":[0.0010510739,0.00019627687,0.0001565776,0.00045826615,0.00015372002,0.00027485145,0.00004823601,0.00063839625,0.000024899684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017889729,0.021049647,0.0041943532,0.0004990945,0.0004039423,0.000019256477,0.0022365558,0.026823614,0.009708203,0.8770243,0.0025364466,0.055325706],"study_design_scores_gemma":[0.00058373396,0.00011627558,0.0013667517,0.000009556776,0.000041610303,0.000009294153,0.000056662822,0.9222314,0.000042398664,0.07318015,0.0021254339,0.00023678089],"about_ca_topic_score_codex":0.00009441207,"about_ca_topic_score_gemma":0.000042519823,"teacher_disagreement_score":0.89540774,"about_ca_system_score_codex":0.00009342077,"about_ca_system_score_gemma":0.0001565713,"threshold_uncertainty_score":0.8003939},"labels":[],"label_agreement":null},{"id":"W2037586972","doi":"10.1007/s11075-013-9767-y","title":"On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians","year":2013,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; University of Ottawa","funders":"","keywords":"Theory of computation; Mathematics; Chebyshev filter; Applied mathematics; Order (exchange); Chebyshev iteration; Numerical analysis; Chebyshev polynomials; Mathematical optimization; Algorithm; Mathematical analysis","score_opus":0.09780373790638307,"score_gpt":0.403758183934134,"score_spread":0.3059544460277509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037586972","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001143403,0.000013677358,0.995588,0.0010298773,0.00011959234,0.0012681851,0.00005195505,0.00012917517,0.0006561532],"genre_scores_gemma":[0.019801712,0.0000039566776,0.9776044,0.00012998872,0.00008015421,0.0005543291,0.00010289485,0.00006615067,0.0016564479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804765,0.00021113335,0.00048295746,0.00043171673,0.00042262656,0.00040388785],"domain_scores_gemma":[0.99701923,0.001079903,0.00021117582,0.00045709315,0.001053332,0.00017926781],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031114687,0.00025707568,0.0005001399,0.00014682463,0.00021049382,0.00006411684,0.00020422669,0.00012182815,0.0017950961],"category_scores_gemma":[0.0007121759,0.00019359298,0.000085572115,0.00066493015,0.00025717175,0.0002588564,0.000047994294,0.0002705756,0.000069176334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066995615,0.004349098,0.00014331473,0.00047973485,0.0006059564,0.000005281267,0.0013837311,0.028474785,0.002224591,0.16612169,0.007011369,0.78853047],"study_design_scores_gemma":[0.0024362085,0.0011760107,0.0010459309,0.000050355713,0.0000636706,0.000013011158,0.00017849344,0.82122016,0.0032200837,0.16874148,0.0013887563,0.0004658283],"about_ca_topic_score_codex":0.00015532893,"about_ca_topic_score_gemma":0.000006530152,"teacher_disagreement_score":0.7927454,"about_ca_system_score_codex":0.00010292736,"about_ca_system_score_gemma":0.00009385847,"threshold_uncertainty_score":0.9991174},"labels":[],"label_agreement":null},{"id":"W2038852905","doi":"10.1007/s11075-014-9930-0","title":"A fast SVD for multilevel block Hankel matrices with minimal memory storage","year":2014,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Statistical and numerical algorithms","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Hankel matrix; Singular value decomposition; Lanczos resampling; Tridiagonal matrix; Mathematics; Multiplication (music); Matrix (chemical analysis); Algorithm; Matrix decomposition; Matrix multiplication; Block (permutation group theory); Lanczos algorithm; Fast Fourier transform; Applied mathematics; Eigenvalues and eigenvectors; Mathematical analysis; Combinatorics; Physics","score_opus":0.03218140093965833,"score_gpt":0.29783910160945387,"score_spread":0.26565770066979555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038852905","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008103993,0.00007482664,0.98777604,0.0006168676,0.0003319656,0.00081375614,0.00023600856,0.00038116868,0.0016653684],"genre_scores_gemma":[0.09806176,0.000008588287,0.8962288,0.00052394596,0.0010391329,0.00041211882,0.000035763605,0.00015666202,0.0035332344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965716,0.00013235678,0.00067571364,0.0008837968,0.0007642303,0.00097230915],"domain_scores_gemma":[0.9955368,0.0028517742,0.0002756626,0.000526177,0.00026471808,0.0005448917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039352948,0.00056597753,0.0009318917,0.00012011236,0.0002922508,0.00013623456,0.00053619687,0.00020844273,0.00019804502],"category_scores_gemma":[0.0009505315,0.00040263473,0.0002469378,0.0004492475,0.00025792173,0.000263933,0.00013122492,0.0003826138,0.00013681607],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001207987,0.003236876,0.00028414646,0.0008826074,0.0005262094,0.00012356746,0.0011205743,0.00018854543,0.0004872131,0.03760325,0.016292002,0.938047],"study_design_scores_gemma":[0.008744218,0.0054665776,0.0026382394,0.00024096963,0.000649346,0.0002314939,0.0006016436,0.85096693,0.0018089833,0.070012756,0.05577261,0.0028662535],"about_ca_topic_score_codex":0.000077444405,"about_ca_topic_score_gemma":0.000003460913,"teacher_disagreement_score":0.9351808,"about_ca_system_score_codex":0.00007870756,"about_ca_system_score_gemma":0.000063172214,"threshold_uncertainty_score":0.9998425},"labels":[],"label_agreement":null},{"id":"W2042560167","doi":"10.1007/s11075-009-9268-1","title":"Convergence estimates for an optimized Schwarz method for PDEs with discontinuous coefficients","year":2009,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Domain decomposition methods; Mathematics; Rate of convergence; Partial differential equation; Schwarz alternating method; Mathematical analysis; Differential operator; Boundary value problem; Convergence (economics); Jump; Operator (biology); Spectral radius; Additive Schwarz method; Applied mathematics; Numerical analysis; Finite element method; Eigenvalues and eigenvectors; Computer science","score_opus":0.03137423783720586,"score_gpt":0.3528893357103434,"score_spread":0.3215150978731376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042560167","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023956376,0.00015281598,0.99766636,0.000098561584,0.00026499596,0.0008916141,0.00006385542,0.00052972964,0.00009247515],"genre_scores_gemma":[0.009195424,0.0000056227955,0.9901429,0.00013820577,0.00012947018,0.00024788594,0.00003926535,0.000069182104,0.00003205572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852306,0.000036146484,0.00037167157,0.00037720817,0.00024026353,0.00045165262],"domain_scores_gemma":[0.9977835,0.0015297733,0.00008364017,0.00023822796,0.00017183536,0.00019304517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025054213,0.00029959634,0.00052177405,0.00005990646,0.00012145264,0.000053076026,0.00027228316,0.00007991569,0.000011936589],"category_scores_gemma":[0.0004019534,0.00024236202,0.00010318623,0.00029167125,0.00005705963,0.00019933478,0.000015158849,0.00012959691,0.000004877941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013981159,0.00019901589,0.0000060480697,0.00007814641,0.000057858375,0.000001988202,0.00011460117,0.6300607,0.0007505377,0.0018491019,0.000095781485,0.3666464],"study_design_scores_gemma":[0.001002968,0.00084074365,0.000046299123,0.00003318755,0.000053284264,0.000014653336,0.000040327956,0.9566973,0.0030083298,0.036896735,0.0010029479,0.00036322165],"about_ca_topic_score_codex":0.0000015098025,"about_ca_topic_score_gemma":7.566914e-8,"teacher_disagreement_score":0.36628318,"about_ca_system_score_codex":0.0000562175,"about_ca_system_score_gemma":0.000019658793,"threshold_uncertainty_score":0.9883236},"labels":[],"label_agreement":null},{"id":"W2052261993","doi":"10.1007/s11075-009-9269-0","title":"Perturbation analysis and condition numbers of scaled total least squares problems","year":2009,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Statistical and numerical algorithms","field":"Mathematics","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Overdetermined system; Uniqueness; Mathematics; Condition number; Perturbation (astronomy); Least-squares function approximation; Applied mathematics; Mathematical optimization; Statistics; Mathematical analysis","score_opus":0.020343842231753406,"score_gpt":0.302818244369146,"score_spread":0.2824744021373926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052261993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102528915,0.00013835155,0.89379025,0.0009365731,0.00010429374,0.0003933852,0.00012780855,0.00017109106,0.0018093529],"genre_scores_gemma":[0.8978479,0.000021842174,0.10119664,0.00012475133,0.000108905944,0.000019825831,0.00006770794,0.000017529412,0.00059492025],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803036,0.000099877034,0.0005852531,0.00043253065,0.0005101471,0.00034180694],"domain_scores_gemma":[0.9986286,0.00052559207,0.00021831918,0.00023144268,0.00015892347,0.00023711073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018348308,0.0002514718,0.0006748012,0.00017094659,0.000103413055,0.000052082083,0.00012897335,0.0001299553,0.00030915],"category_scores_gemma":[0.00037354944,0.00020186837,0.00021166123,0.0011165948,0.00017589673,0.00025524697,0.000034777662,0.00019767469,0.000013828093],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035965035,0.0038599474,0.0075315465,0.00040774513,0.0017292734,0.00006286889,0.0022682012,0.00034207417,0.0038185604,0.16449109,0.0015563901,0.81357265],"study_design_scores_gemma":[0.0024694593,0.0022678962,0.17141633,0.00011108046,0.0020657794,0.00008969782,0.00037469857,0.22687447,0.0023939388,0.59028137,0.00041101975,0.0012442399],"about_ca_topic_score_codex":0.00008973489,"about_ca_topic_score_gemma":0.0000023363557,"teacher_disagreement_score":0.8123284,"about_ca_system_score_codex":0.00004157542,"about_ca_system_score_gemma":0.00001848741,"threshold_uncertainty_score":0.82319534},"labels":[],"label_agreement":null},{"id":"W2052743064","doi":"10.1007/s11075-008-9199-2","title":"Numerical treatment of a twisted tail using extrapolation methods","year":2008,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods in engineering","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Extrapolation; Mathematics; Theory of computation; Numerical analysis; Applied mathematics; Mathematical analysis; Calculus (dental); Algorithm; Medicine","score_opus":0.07707987753617833,"score_gpt":0.35086455226571717,"score_spread":0.2737846747295388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052743064","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019537268,0.0010710532,0.9771018,0.000015146969,0.00072504807,0.00022559061,0.00000897038,0.0005603101,0.0007548317],"genre_scores_gemma":[0.2783303,0.00009053467,0.7212253,0.000010111942,0.00019536141,0.000029419536,0.000005591543,0.000082445025,0.000030922925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979731,0.00017762554,0.0006465159,0.00035165803,0.00032724734,0.00052389526],"domain_scores_gemma":[0.9987904,0.0003942225,0.0000881724,0.0004046197,0.000070163565,0.00025242078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016137556,0.00039253948,0.00074541406,0.00018074928,0.00008366351,0.000013402319,0.00018997071,0.0001792311,0.00012205306],"category_scores_gemma":[0.00011542634,0.00036524818,0.000250935,0.0010003911,0.00010996734,0.00015333507,0.00002285831,0.00020511626,0.000018533936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003134734,0.0003682442,0.0009741268,0.000078317644,0.00025464516,0.00006769273,0.00080968696,0.31108755,0.064633,0.00010702907,0.00004018687,0.6215482],"study_design_scores_gemma":[0.00051492115,0.0002493564,0.001530467,0.000017628496,0.00004757251,0.00014960574,0.000021438362,0.9580063,0.032311834,0.00014959564,0.0065953108,0.00040591872],"about_ca_topic_score_codex":0.00009350557,"about_ca_topic_score_gemma":6.6488305e-8,"teacher_disagreement_score":0.6469188,"about_ca_system_score_codex":0.0003501684,"about_ca_system_score_gemma":0.00003536272,"threshold_uncertainty_score":0.99987996},"labels":[],"label_agreement":null},{"id":"W2056712685","doi":"10.1007/s11075-008-9189-4","title":"Monotonic sequences related to zeros of Bessel functions","year":2008,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Bessel function; Monotonic function; Function (biology); Modulo; Theory of computation; Mathematical analysis; Pure mathematics; Discrete mathematics; Algorithm","score_opus":0.058871834842480576,"score_gpt":0.31934872909018736,"score_spread":0.26047689424770676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056712685","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7144961,0.000119473014,0.26379588,0.0016071382,0.00091125356,0.0010303893,0.00009557897,0.00045021574,0.017494006],"genre_scores_gemma":[0.84989834,0.000030028288,0.13689718,0.00019217232,0.000119576536,0.00013322869,0.000008209608,0.000048932085,0.012672361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850506,0.00006103674,0.0005931207,0.0002541376,0.00030541862,0.00028120424],"domain_scores_gemma":[0.9986176,0.00056294235,0.00012519,0.00037642856,0.00011552156,0.000202338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019978378,0.00016402932,0.00043854988,0.00009894131,0.00016964371,0.000009978112,0.00018359149,0.00011596904,0.00088114315],"category_scores_gemma":[0.0004874268,0.0001357803,0.00016085865,0.00060550566,0.00010955049,0.00007710759,0.000057028006,0.00017754736,0.00057039346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033233894,0.010268024,0.0071662096,0.0011684711,0.0019116101,0.0002484293,0.018712265,0.00155364,0.038314115,0.5591451,0.24154831,0.1196315],"study_design_scores_gemma":[0.0033851017,0.0036301748,0.004942824,0.00045910233,0.0006289794,0.0010715869,0.0025745113,0.028898554,0.040114433,0.7959932,0.11540383,0.0028976644],"about_ca_topic_score_codex":0.00007715867,"about_ca_topic_score_gemma":0.0000016429452,"teacher_disagreement_score":0.23684816,"about_ca_system_score_codex":0.00004054279,"about_ca_system_score_gemma":0.00007337164,"threshold_uncertainty_score":0.96479},"labels":[],"label_agreement":null},{"id":"W2066648277","doi":"10.1007/s11075-014-9872-6","title":"Adaptive time-stepping for the strong numerical solution of stochastic differential equations","year":2014,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Toronto Metropolitan University","funders":"","keywords":"Adaptive stepsize; Mathematics; Stochastic differential equation; Richardson extrapolation; Numerical analysis; Brownian motion; Theory of computation; Extrapolation; Applied mathematics; Differential equation; Backward differentiation formula; Mathematical optimization; Ordinary differential equation; Differential algebraic equation; Algorithm; Mathematical analysis","score_opus":0.03719747129132631,"score_gpt":0.2419152012457536,"score_spread":0.2047177299544273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066648277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005805942,0.00028346476,0.9978338,0.00053588854,0.00023538464,0.00043483736,0.00019134014,0.00003539535,0.0003918326],"genre_scores_gemma":[0.98040867,0.0000020469465,0.018653408,0.0000621896,0.0003873213,0.00032096173,0.000029863517,0.000022957083,0.0001125601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878407,0.000006810738,0.00052084355,0.00032919267,0.00006707143,0.000292018],"domain_scores_gemma":[0.99857634,0.00067419105,0.00034309673,0.00024944483,0.0000869999,0.00006989481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019476049,0.00014440386,0.00036666848,0.00006859016,0.00027109962,0.000026543927,0.0002716463,0.00008092552,0.000083085],"category_scores_gemma":[0.0004323181,0.00012779936,0.0001618621,0.0003037347,0.000099952296,0.000079710815,0.000060587405,0.00012771641,0.00015345399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032415195,0.00016793952,0.000015030683,0.000011988758,0.000058923044,3.5374807e-8,0.00013373264,0.0026464092,0.000042938194,0.9618152,0.00010639958,0.034969013],"study_design_scores_gemma":[0.00037498918,0.00017828603,0.00093789544,0.000008402072,0.000027035981,7.4868154e-7,0.000023597837,0.92684233,0.000012604159,0.07057795,0.0008610786,0.00015511314],"about_ca_topic_score_codex":0.00016734612,"about_ca_topic_score_gemma":0.0000011406347,"teacher_disagreement_score":0.9803506,"about_ca_system_score_codex":0.000052209212,"about_ca_system_score_gemma":0.000024501676,"threshold_uncertainty_score":0.5211507},"labels":[],"label_agreement":null},{"id":"W2067877923","doi":"10.1007/s11075-005-9010-6","title":"Extrapolation algorithm for affine-convex feasibility problems","year":2005,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"","keywords":"Mathematics; Subgradient method; Linear subspace; Theory of computation; Hilbert space; Affine transformation; Countable set; Algorithm; Mathematical optimization; Regular polygon; Convex optimization; Applied mathematics; Discrete mathematics; Pure mathematics; Geometry","score_opus":0.02880830279725132,"score_gpt":0.27998542352186695,"score_spread":0.2511771207246156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067877923","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032498698,0.00006159984,0.99321926,0.005350889,0.00017174492,0.0003540905,0.000015924503,0.00023111422,0.00056285673],"genre_scores_gemma":[0.024952644,0.00000930301,0.97253287,0.0007924158,0.0004192393,0.00008165993,0.000053629858,0.000012263834,0.0011459737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841917,0.000053540913,0.00037259277,0.0005173286,0.00034784607,0.0002894968],"domain_scores_gemma":[0.998977,0.00012648028,0.00012657662,0.0003504736,0.0002683872,0.00015109191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003174885,0.00016349275,0.00022762505,0.00010475637,0.00018200174,0.00015310023,0.00045218258,0.00008541828,0.00016687831],"category_scores_gemma":[0.000055951674,0.00014573665,0.00017421793,0.00069753354,0.00002567539,0.0006677893,0.000073279014,0.000100303325,0.000097716525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030695319,0.00030556624,0.00019040323,0.0000060263606,0.00003743724,3.8332917e-7,0.00017194422,0.01291383,0.000054664288,0.011901525,0.00076079514,0.9736543],"study_design_scores_gemma":[0.000506713,0.00006394319,0.0012411121,0.000002726933,0.000013416523,0.0000036284998,0.0000040249506,0.97278833,0.00014077674,0.0029378077,0.022102838,0.00019469987],"about_ca_topic_score_codex":0.000022744141,"about_ca_topic_score_gemma":0.000002451447,"teacher_disagreement_score":0.97345966,"about_ca_system_score_codex":0.00010724288,"about_ca_system_score_gemma":0.00006990253,"threshold_uncertainty_score":0.5942968},"labels":[],"label_agreement":null},{"id":"W2068424476","doi":"10.1007/s11075-010-9385-x","title":"Polynomial algebra for Birkhoff interpolants","year":2010,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Birkhoff interpolation; Lagrange polynomial; Quadrature (astronomy); Hermite interpolation; Interpolation (computer graphics); Hermite polynomials; Polynomial interpolation; Rational function; Clenshaw–Curtis quadrature; Polynomial; Applied mathematics; Numerical integration; Theory of computation; Gauss–Jacobi quadrature; Gauss–Kronrod quadrature formula; Mathematical analysis; Linear interpolation; Gaussian quadrature; Nyström method; Frame (networking); Algorithm; Integral equation","score_opus":0.006695384604352538,"score_gpt":0.2500003093397013,"score_spread":0.24330492473534876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068424476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015140204,0.0000740403,0.9798829,0.00021969929,0.00093546975,0.00030226196,0.00004913289,0.0017974898,0.0015988124],"genre_scores_gemma":[0.7205711,0.000014981442,0.27803174,0.00020862844,0.00069594424,0.00016288456,0.000027930482,0.00009072173,0.00019605053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874365,0.000010050207,0.000317898,0.00030094426,0.00017236693,0.0004550681],"domain_scores_gemma":[0.99926287,0.0001239163,0.00004005963,0.0003137861,0.000051212286,0.0002081451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000084767875,0.0002482545,0.00035635094,0.00010779634,0.000069178,0.000037633636,0.0003254203,0.00015709986,0.0001824023],"category_scores_gemma":[0.000087941036,0.0002221995,0.00020178469,0.00032284975,0.00007488053,0.00015884444,0.00005172652,0.0004351977,0.000109821085],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004472818,0.0001600562,0.00039293055,0.00004293359,0.00016317442,0.000011657568,0.000089238594,0.00032706241,0.10658257,0.00036090022,0.03438283,0.8574419],"study_design_scores_gemma":[0.000595115,0.00019777812,0.0006705251,0.0000125896,0.0000563588,0.00002835706,0.000019311312,0.46578512,0.069083735,0.0020222955,0.46071228,0.00081653835],"about_ca_topic_score_codex":0.000020176796,"about_ca_topic_score_gemma":0.0000045837555,"teacher_disagreement_score":0.8566254,"about_ca_system_score_codex":0.00004172927,"about_ca_system_score_gemma":0.00001125924,"threshold_uncertainty_score":0.90610325},"labels":[],"label_agreement":null},{"id":"W2071465526","doi":"10.1007/s11075-009-9331-y","title":"An efficient unified approach for the numerical solution of delay differential equations","year":2009,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Solver; Classification of discontinuities; Theory of computation; Runge–Kutta methods; Mathematics; Applied mathematics; Numerical analysis; Modular design; Initial value problem; Ordinary differential equation; Differential equation; Computer science; Mathematical optimization; Algorithm; Mathematical analysis","score_opus":0.08175538393039966,"score_gpt":0.366052991347989,"score_spread":0.28429760741758936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071465526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022766981,0.0000483632,0.9953714,0.00050001,0.00030495357,0.001105351,0.00006179475,0.00017841911,0.0001529944],"genre_scores_gemma":[0.535663,0.0000017996549,0.46383536,0.000055339744,0.00019844282,0.00011633535,0.00005458255,0.00002695902,0.00004816118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971403,0.00035242006,0.000791607,0.00050093984,0.0006658146,0.00054895406],"domain_scores_gemma":[0.99635994,0.0020678497,0.0003494351,0.0007241746,0.00026798804,0.0002306213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005075486,0.00032110937,0.0005830367,0.00011319797,0.0004138337,0.000057083707,0.0005951713,0.00017789964,0.00009513111],"category_scores_gemma":[0.0011172962,0.00022017793,0.00038198664,0.0006885071,0.00016679308,0.000097544544,0.00005153378,0.0003196905,0.0000068718164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043013357,0.010585498,0.00003424894,0.00009852175,0.00034908927,0.0000018202882,0.0013704457,0.017633758,0.012755534,0.3186201,0.00038327195,0.6377376],"study_design_scores_gemma":[0.0007556455,0.0006469366,0.0008117161,0.000008700884,0.00026583654,0.0000044841445,0.00010409407,0.9277958,0.0010165268,0.06819004,0.00011838394,0.0002818042],"about_ca_topic_score_codex":0.000054661487,"about_ca_topic_score_gemma":5.2268945e-7,"teacher_disagreement_score":0.9101621,"about_ca_system_score_codex":0.00009085009,"about_ca_system_score_gemma":0.00006853562,"threshold_uncertainty_score":0.8978596},"labels":[],"label_agreement":null},{"id":"W2075200087","doi":"10.1007/s11075-009-9286-z","title":"Rayleigh quotient algorithms for nonsymmetric matrix pencils","year":2009,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rayleigh quotient iteration; Mathematics; Eigenvalues and eigenvectors; Rayleigh quotient; Convergence (economics); Matrix (chemical analysis); Theory of computation; Iterative method; Quotient; Algorithm; Mathematical analysis; Applied mathematics; Algebra over a field; Pure mathematics; Preconditioner","score_opus":0.021588814093993998,"score_gpt":0.29193035395969674,"score_spread":0.27034153986570275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075200087","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038366232,0.0006816627,0.9910551,0.0025661385,0.0013980455,0.0008485468,0.00003954191,0.00070290774,0.0023244217],"genre_scores_gemma":[0.121811785,0.00006883313,0.87237537,0.0017322607,0.0012632195,0.00015977063,0.00003490518,0.000052222986,0.0025016074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955958,0.00026916378,0.0007817264,0.0012271891,0.00088415504,0.0012419322],"domain_scores_gemma":[0.99696857,0.00073932606,0.00026978352,0.0011203204,0.0002998307,0.000602156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014804648,0.0005538646,0.00070354453,0.00044945476,0.00055823004,0.0003804518,0.002129242,0.0002442963,0.00009667371],"category_scores_gemma":[0.0003760053,0.00048519767,0.00047775498,0.0023110346,0.00008451858,0.0007898011,0.0002378768,0.00051020907,0.0003924973],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040082246,0.00069343223,0.000027251672,0.000024632744,0.000048073358,0.00006405847,0.0002955928,0.00020936887,0.00028666083,0.09652146,0.004158094,0.8976313],"study_design_scores_gemma":[0.00277062,0.0021553158,0.0013069392,0.00004671595,0.000067452165,0.00020009781,0.00009728172,0.78585166,0.005816136,0.089911744,0.11003133,0.0017447216],"about_ca_topic_score_codex":0.000022806664,"about_ca_topic_score_gemma":2.8178974e-7,"teacher_disagreement_score":0.8958866,"about_ca_system_score_codex":0.0001650544,"about_ca_system_score_gemma":0.00016588191,"threshold_uncertainty_score":0.99976},"labels":[],"label_agreement":null},{"id":"W2078578895","doi":"10.1007/s11075-005-9007-1","title":"Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time","year":2005,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Differential algebraic equation; Numerical partial differential equations; Exponential integrator; Ordinary differential equation; Polynomial; Differential algebraic geometry; Differential equation; Backward differentiation formula; Applied mathematics; Mathematical analysis; Exponential function; Algebraic equation; Nonlinear system","score_opus":0.06072766935198908,"score_gpt":0.3282124186020278,"score_spread":0.26748474925003873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078578895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023563562,0.000034734414,0.97110504,0.0035612404,0.0003417989,0.00059469807,0.00014786898,0.0002445368,0.0004065326],"genre_scores_gemma":[0.7700606,0.0000023732637,0.22883992,0.00016659984,0.0004155209,0.000086725115,0.000087889144,0.000072218,0.00026816866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957833,0.00056459615,0.0013296194,0.0006288921,0.0008076476,0.00088589126],"domain_scores_gemma":[0.9965161,0.0019383272,0.0003914313,0.0006102039,0.00017069574,0.00037322543],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00037949768,0.00044560363,0.0010131516,0.0004248546,0.00021427203,0.000048144506,0.00055878545,0.00028985078,0.0013992516],"category_scores_gemma":[0.0012455689,0.00043074932,0.00037066767,0.0014083127,0.0002675918,0.00019107027,0.00022689298,0.00066488324,0.00010738979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003963028,0.015011552,0.0020153772,0.00019494428,0.0008661897,0.000031153388,0.0035608846,0.004417693,0.018044924,0.06943313,0.0048308424,0.88119704],"study_design_scores_gemma":[0.0035580278,0.00045042706,0.008983833,0.00009078342,0.00022166212,0.000021449656,0.0000859148,0.9061705,0.002309727,0.07517923,0.0017693508,0.0011591173],"about_ca_topic_score_codex":0.0005640377,"about_ca_topic_score_gemma":0.000062855885,"teacher_disagreement_score":0.90175277,"about_ca_system_score_codex":0.0003223192,"about_ca_system_score_gemma":0.00019776174,"threshold_uncertainty_score":0.99981445},"labels":[],"label_agreement":null},{"id":"W2085969366","doi":"10.1023/b:numa.0000049478.42605.cf","title":"Interval Arithmetic, Affine Arithmetic, Taylor Series Methods: Why, What Next?","year":2004,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Affine arithmetic; Interval arithmetic; Mathematics; Taylor series; Interval (graph theory); Arithmetic; Affine transformation; Theory of computation; Arbitrary-precision arithmetic; Computation; Series (stratigraphy); Range (aeronautics); Saturation arithmetic; Discrete mathematics; Algebra over a field; Pure mathematics; Algorithm; Combinatorics; Mathematical analysis","score_opus":0.03378618326497619,"score_gpt":0.32408456002474917,"score_spread":0.290298376759773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085969366","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010879361,0.0023237334,0.97340244,0.018366454,0.0037743733,0.00047836752,0.000007801528,0.00091392983,0.00062413426],"genre_scores_gemma":[0.0013578013,0.00059020636,0.992246,0.004336316,0.00086858094,0.00014885564,0.000011062318,0.00009322807,0.00034797762],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9935613,0.00082725193,0.001162349,0.0017895148,0.0011035413,0.001556022],"domain_scores_gemma":[0.9961096,0.00064382143,0.00035425578,0.0016186669,0.00035284515,0.000920783],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001591251,0.0008856406,0.0013148857,0.00034767506,0.00043896952,0.002886455,0.0027195977,0.00033311904,0.00024836732],"category_scores_gemma":[0.00059835915,0.00074542384,0.0005861482,0.002452269,0.0004517789,0.0067482092,0.0013286468,0.001041623,0.00041737733],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025065568,0.00051221944,0.0000051917855,0.000025975613,0.00009315046,0.00018068959,0.0004295864,0.00018140725,0.0014613374,0.020145958,0.00016057638,0.97677886],"study_design_scores_gemma":[0.0047848676,0.004047797,0.0006438384,0.00040526883,0.00019134374,0.001776326,0.0016726826,0.19050181,0.058460258,0.31617266,0.4169583,0.0043848264],"about_ca_topic_score_codex":0.00027651613,"about_ca_topic_score_gemma":0.0000038989015,"teacher_disagreement_score":0.972394,"about_ca_system_score_codex":0.00028555232,"about_ca_system_score_gemma":0.00016968319,"threshold_uncertainty_score":0.9994997},"labels":[],"label_agreement":null},{"id":"W2091752560","doi":"10.1007/s11075-011-9500-7","title":"Subquadrature expansions for TSRK methods","year":2011,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Recursion (computer science); Theory of computation; Ordinary differential equation; Maple; Algebra over a field; Applied mathematics; Series (stratigraphy); Representation (politics); Computation; Differential equation; Algorithm; Pure mathematics; Mathematical analysis","score_opus":0.2567141205711308,"score_gpt":0.4576120013893258,"score_spread":0.20089788081819498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091752560","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004502143,0.00007121242,0.994827,0.00026738652,0.000852477,0.0006550839,0.00004596023,0.000348285,0.0024824108],"genre_scores_gemma":[0.0040169284,0.0000054854036,0.9940403,0.00022520579,0.00026655206,0.00037762002,0.00001720288,0.00008716741,0.00096350786],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976907,0.00040378928,0.00054750516,0.0005039347,0.00028355815,0.0005705498],"domain_scores_gemma":[0.9967385,0.0019683074,0.0001899667,0.0005831851,0.00019801171,0.0003220585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006762982,0.0003126487,0.0005740861,0.00010981655,0.0002405399,0.0000318355,0.00040893102,0.00023740774,0.0008418142],"category_scores_gemma":[0.0025615473,0.00025254636,0.00038511262,0.0005618029,0.00011251798,0.00013827637,0.00010131658,0.00035574735,0.00006403046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009416138,0.0010800118,0.0000633259,0.00008027941,0.00018417135,0.0000067346914,0.0017666968,8.620683e-7,0.003705606,0.17543174,0.0021936775,0.81539273],"study_design_scores_gemma":[0.0005061583,0.0002929133,0.0003988259,0.000019358455,0.0001663854,0.000010868317,0.00016942216,0.0036315708,0.009673439,0.9719558,0.012757851,0.00041740364],"about_ca_topic_score_codex":0.00004251946,"about_ca_topic_score_gemma":0.0000016796151,"teacher_disagreement_score":0.8149753,"about_ca_system_score_codex":0.000054574473,"about_ca_system_score_gemma":0.00005438968,"threshold_uncertainty_score":0.99999267},"labels":[],"label_agreement":null},{"id":"W2131222327","doi":"10.1023/a:1022268319273","title":"Adaptive Monotone Rational Approximation on Finite Sets","year":2003,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Monotonic function; Monotone polygon; Mathematics; Theory of computation; Interval (graph theory); Code (set theory); Set (abstract data type); Applied mathematics; Discrete mathematics; Algorithm; Combinatorics; Computer science; Mathematical analysis","score_opus":0.03546421941878482,"score_gpt":0.2899272823238965,"score_spread":0.25446306290511167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131222327","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010330816,0.000055865516,0.99058086,0.0008419561,0.00059263443,0.00025124295,0.00000794891,0.00021712878,0.007349051],"genre_scores_gemma":[0.046834257,0.000008902005,0.95132786,0.0012189378,0.00012475134,0.00008845508,0.000007582264,0.00002058943,0.0003686618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974906,0.00036845682,0.00036401436,0.00067686505,0.00064096064,0.00045912847],"domain_scores_gemma":[0.998415,0.00057904917,0.00014045417,0.00048459697,0.00012217708,0.00025874903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004419088,0.00027261704,0.00031510153,0.00011386897,0.00021270246,0.0001409888,0.0005009248,0.00010650045,0.0000853757],"category_scores_gemma":[0.00033430106,0.00022876037,0.00013575434,0.0008793721,0.000065292275,0.0004260815,0.00008132615,0.00032865338,0.00036689235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017319288,0.0004707191,0.0000342667,0.000004961416,0.000034698107,0.000030085896,0.00018696494,0.0020369745,0.00013357896,0.30830446,0.0005629438,0.688183],"study_design_scores_gemma":[0.00058027095,0.0005581035,0.0005509815,0.000014554199,0.0000067169203,0.000022308775,0.000024991507,0.8994955,0.0030690818,0.07848873,0.016741985,0.00044679167],"about_ca_topic_score_codex":0.000011650144,"about_ca_topic_score_gemma":8.064721e-8,"teacher_disagreement_score":0.8974585,"about_ca_system_score_codex":0.00008288283,"about_ca_system_score_gemma":0.000083577695,"threshold_uncertainty_score":0.93285775},"labels":[],"label_agreement":null},{"id":"W2234351191","doi":"10.1007/s11075-015-0095-2","title":"Software for the Gale transform of fewnomial systems and a Descartes rule for fewnomials","year":2016,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Fields Institute for Research in Mathematical Sciences","funders":"National Key Research and Development Program of China; Directorate for Mathematical and Physical Sciences; Defense Advanced Research Projects Agency; National Natural Science Foundation of China; National Science Foundation","keywords":"Theory of computation; Software; Mathematics; Rule-based system; Computer science; Algorithm; Artificial intelligence; Programming language","score_opus":0.01946746877301521,"score_gpt":0.2497056394969522,"score_spread":0.23023817072393699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2234351191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003640739,0.00043007353,0.9920244,0.0024619603,0.00054127275,0.00074236275,0.000070522,0.00007109237,0.000017531898],"genre_scores_gemma":[0.85925734,0.000037904745,0.13914493,0.00013668754,0.00058341376,0.00048503382,0.000003845881,0.000021387497,0.00032943915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899745,0.000025165475,0.00029107617,0.000285392,0.00013891027,0.00026198803],"domain_scores_gemma":[0.9979896,0.0015113105,0.00010500321,0.00019489776,0.00011692342,0.000082286075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027283435,0.00012816626,0.0002546085,0.00003602106,0.00015532463,0.0000740399,0.00038297306,0.000054876084,0.0000023459727],"category_scores_gemma":[0.00012525059,0.000068694935,0.00011094026,0.00013468586,0.00008275701,0.00022100829,0.00005430579,0.00003253888,0.000002697533],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004174935,0.000036103615,0.000048775382,0.00004196654,0.000033529333,2.6759008e-7,0.00018107735,0.00004003898,0.0010820354,0.004686266,0.0008327087,0.9929755],"study_design_scores_gemma":[0.009097582,0.00223167,0.0064325794,0.00025676057,0.00015172786,0.0000766263,0.0001488755,0.80985844,0.027464869,0.06581843,0.07734007,0.0011223506],"about_ca_topic_score_codex":0.000049670474,"about_ca_topic_score_gemma":0.0000014984961,"teacher_disagreement_score":0.9918531,"about_ca_system_score_codex":0.000027655567,"about_ca_system_score_gemma":0.000074225696,"threshold_uncertainty_score":0.28012982},"labels":[],"label_agreement":null},{"id":"W2287475882","doi":"10.1007/s11075-015-0085-4","title":"Optimal Rates of Linear Convergence of Relaxed Alternating Projections and Generalized Douglas-Rachford Methods for Two Subspaces","year":2015,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Linear subspace; Rate of convergence; Mathematics; Projection (relational algebra); Eigenvalues and eigenvectors; Theory of computation; Convergence (economics); Applied mathematics; Nonlinear system; Projection method; Intersection (aeronautics); Matrix (chemical analysis); Dykstra's projection algorithm; Mathematical optimization; Algorithm; Pure mathematics; Computer science","score_opus":0.06371311389702866,"score_gpt":0.39677105204245355,"score_spread":0.3330579381454249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287475882","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029236106,0.0005197507,0.9688386,0.00019699548,0.00070406374,0.00032603004,0.0000136130075,0.0000699167,0.00009498001],"genre_scores_gemma":[0.031718526,0.000034525918,0.96776986,0.000030820294,0.00017631883,0.00005347558,0.000004097637,0.000013838029,0.00019850806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829596,0.00032532518,0.00048433506,0.00039028123,0.00022505205,0.00027906222],"domain_scores_gemma":[0.99824905,0.00059988926,0.00032341245,0.000319241,0.0003406905,0.000167718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015105383,0.00018090564,0.0004370513,0.00010623457,0.00010633321,0.000036737583,0.0005053462,0.00006428166,0.000008502606],"category_scores_gemma":[0.00043636007,0.00015151461,0.000110628396,0.0005170224,0.00015810714,0.00033681124,0.0002299334,0.00013242228,0.0000017580995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061070616,0.0011860315,0.00348259,0.0005020819,0.00058406586,0.000020420932,0.011509667,0.023101829,0.0267431,0.16612452,0.00070070353,0.76543427],"study_design_scores_gemma":[0.001174366,0.0004011901,0.000043167987,0.00001917378,0.000021300708,0.000023506745,0.00014420185,0.9285871,0.063849255,0.003975532,0.0015750187,0.0001861948],"about_ca_topic_score_codex":0.00021499443,"about_ca_topic_score_gemma":8.366147e-7,"teacher_disagreement_score":0.9054853,"about_ca_system_score_codex":0.000018242356,"about_ca_system_score_gemma":0.00010347323,"threshold_uncertainty_score":0.61785865},"labels":[],"label_agreement":null},{"id":"W2470937552","doi":"10.1007/s11075-016-0166-z","title":"A new high-order energy-preserving scheme for the modified Korteweg-de Vries equation","year":2016,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Korteweg–de Vries equation; Theory of computation; Order (exchange); Scheme (mathematics); Applied mathematics; Energy (signal processing); Mathematical physics; Mathematical analysis; Nonlinear system; Physics; Algorithm; Statistics","score_opus":0.10161440348105644,"score_gpt":0.351534477393832,"score_spread":0.24992007391277554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2470937552","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041455263,0.00008575151,0.9898794,0.008359236,0.00043275056,0.00039085757,0.00003032985,0.0002290878,0.00017802118],"genre_scores_gemma":[0.037440073,0.000025536103,0.9563974,0.00028605922,0.00075495,0.0003321986,0.000009559574,0.00007895396,0.0046752277],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978779,0.00018678262,0.0004894202,0.00040259428,0.00047132725,0.0005719501],"domain_scores_gemma":[0.99366575,0.0050298544,0.00022231387,0.00062901946,0.00022326269,0.00022977118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047843638,0.0002731108,0.0003816537,0.00006920928,0.00029975342,0.00008626292,0.0005638941,0.00015662059,0.00046069978],"category_scores_gemma":[0.004197462,0.00015250068,0.00020669993,0.00048947654,0.00009171744,0.00021825956,0.00017481652,0.00014522167,0.000028194332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052979176,0.00012682966,0.000024320467,0.000021573585,0.00014330678,8.7455044e-7,0.0001728122,0.000030288686,0.006502514,0.2995099,0.002428582,0.69098604],"study_design_scores_gemma":[0.000983093,0.0001201434,0.00024133416,0.000038989765,0.00011266057,0.0000026926566,0.00004556751,0.08040199,0.004669107,0.9067209,0.006369808,0.00029376877],"about_ca_topic_score_codex":0.00065993133,"about_ca_topic_score_gemma":0.000016087319,"teacher_disagreement_score":0.69069225,"about_ca_system_score_codex":0.00013224075,"about_ca_system_score_gemma":0.00014734338,"threshold_uncertainty_score":0.62187976},"labels":[],"label_agreement":null},{"id":"W2523344345","doi":"10.1007/s11075-016-0188-6","title":"Numerical methods for computing sensitivities for ODEs and DDEs","year":2016,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Fractional Differential Equations Solutions","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adjoint equation; Mathematics; Ode; Ordinary differential equation; Applied mathematics; Classification of discontinuities; Computation; Discontinuity (linguistics); Delay differential equation; Numerical analysis; Differential equation; Mathematical optimization; Mathematical analysis; Algorithm","score_opus":0.11068662376741367,"score_gpt":0.43701573968860685,"score_spread":0.3263291159211932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523344345","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012157878,0.000060098188,0.9956722,0.0019283599,0.00026896884,0.00046702084,0.000079545236,0.00014494752,0.00016302308],"genre_scores_gemma":[0.16087256,0.000005325873,0.83812773,0.00008613447,0.00030886888,0.0001136555,0.00000928884,0.000033701785,0.0004427204],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988075,0.00012969175,0.00030459036,0.0003043973,0.00013228734,0.0003215446],"domain_scores_gemma":[0.99023813,0.009215873,0.000111819536,0.00014760302,0.00018064733,0.00010593367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039347942,0.0001697827,0.00032699553,0.00006814777,0.0003029886,0.000041378185,0.00007616496,0.00008827188,0.0000296337],"category_scores_gemma":[0.0021885738,0.00012059182,0.00014676971,0.00011040226,0.00012585356,0.00012775524,0.00004336113,0.000068956164,0.0000065493596],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049378436,0.00019504578,0.00003966139,0.00007346651,0.00011462908,4.7477715e-7,0.00019537412,0.000010504537,0.003428839,0.1658201,0.0016319957,0.82844055],"study_design_scores_gemma":[0.0015023361,0.00033905942,0.0012497677,0.00009796056,0.0001553234,0.00004059573,0.00022204072,0.34401837,0.0057787043,0.6315031,0.0145688765,0.0005238289],"about_ca_topic_score_codex":0.000017288412,"about_ca_topic_score_gemma":8.0102683e-7,"teacher_disagreement_score":0.8279167,"about_ca_system_score_codex":0.00007050736,"about_ca_system_score_gemma":0.00003781144,"threshold_uncertainty_score":0.49175918},"labels":[],"label_agreement":null},{"id":"W2763895446","doi":"10.1007/s11075-017-0424-8","title":"Matrix-free monolithic homotopy continuation with application to computational aerodynamics","year":2017,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; Canada Excellence Research Chairs, Government of Canada","keywords":"Theory of computation; Mathematics; Aerodynamics; Continuation; Homotopy; Homotopy analysis method; Matrix (chemical analysis); Algebra over a field; Applied mathematics; Calculus (dental); Topology (electrical circuits); Pure mathematics; Algorithm; Computer science; Combinatorics; Aerospace engineering; Engineering","score_opus":0.005511948689517506,"score_gpt":0.263346850406424,"score_spread":0.25783490171690654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763895446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011282599,0.000027059428,0.9860336,0.00071526336,0.000049868915,0.00036061468,0.000023429822,0.0007018684,0.000805697],"genre_scores_gemma":[0.62457085,0.0000071306654,0.37495837,0.00007397982,0.0000866442,0.00015290399,0.000037535752,0.000039039045,0.00007353631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987348,0.000016534605,0.0002762379,0.00033129475,0.00035934412,0.00028181646],"domain_scores_gemma":[0.99872863,0.000054088738,0.00010962845,0.0007916352,0.00014444781,0.00017156973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000096802425,0.00021873238,0.00030032915,0.0000893496,0.000233367,0.0001181037,0.0005954531,0.00008836395,0.00001524645],"category_scores_gemma":[0.00007891644,0.00019562908,0.00006485964,0.00023717248,0.00007542262,0.00026960135,0.00010115963,0.00021155235,0.00010096929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005248803,0.00013920933,0.0030709605,0.000039834624,0.00014066916,0.000012827718,0.00013460367,0.5877184,0.0015878616,0.0048705908,0.00071661297,0.4015159],"study_design_scores_gemma":[0.0003390885,0.00010292441,0.016876915,0.000014702462,0.000033745702,0.0000081808375,0.00001160177,0.9657126,0.00074051315,0.012658103,0.0031484216,0.00035316692],"about_ca_topic_score_codex":0.000070669135,"about_ca_topic_score_gemma":0.000011602463,"teacher_disagreement_score":0.6132883,"about_ca_system_score_codex":0.00013637055,"about_ca_system_score_gemma":0.000013390017,"threshold_uncertainty_score":0.7977522},"labels":[],"label_agreement":null},{"id":"W2767825672","doi":"10.1007/s11075-017-0437-3","title":"Boundary layer preconditioners for finite-element discretizations of singularly perturbed reaction-diffusion problems","year":2017,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Differential Equations and Numerical Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Irish Research Council","keywords":"Preconditioner; Mathematics; Discretization; Finite element method; Polygon mesh; Boundary layer; Singular perturbation; Numerical analysis; Applied mathematics; Mathematical analysis; Multigrid method; Boundary value problem; Linear system; Partial differential equation; Geometry","score_opus":0.09395097368211223,"score_gpt":0.3795944641367546,"score_spread":0.2856434904546423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767825672","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007148876,0.000027836071,0.988914,0.0010893216,0.0004954038,0.0007424765,0.00015316135,0.00007154412,0.0013573389],"genre_scores_gemma":[0.45886698,0.000021943524,0.53811556,0.00008217033,0.0003014406,0.00039475647,0.00019538002,0.000065659806,0.0019561439],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838734,0.000093847484,0.0005568484,0.00033509286,0.00034176323,0.00028512816],"domain_scores_gemma":[0.99771494,0.0007939303,0.0005407431,0.00058697216,0.00022899797,0.0001344185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034734167,0.00020322912,0.00040874197,0.00008592701,0.00076374394,0.00015904366,0.0003112944,0.00011617874,0.00024894084],"category_scores_gemma":[0.0020568157,0.00016757491,0.00022440245,0.00012022357,0.00017551071,0.00027967928,0.0000924274,0.00014707808,0.000007898416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035937605,0.0065783327,0.0023261737,0.0011185156,0.0008587872,0.0000054923244,0.0035443772,0.00030044912,0.045563746,0.15395808,0.005403887,0.7799828],"study_design_scores_gemma":[0.0033557345,0.0012397269,0.0121515,0.00031759022,0.0004841491,0.000007021425,0.00038228507,0.22039305,0.0064927908,0.7037535,0.050413717,0.0010089912],"about_ca_topic_score_codex":0.0000945685,"about_ca_topic_score_gemma":0.0000058890973,"teacher_disagreement_score":0.7789738,"about_ca_system_score_codex":0.000059286805,"about_ca_system_score_gemma":0.00006511816,"threshold_uncertainty_score":0.6833506},"labels":[],"label_agreement":null},{"id":"W2771401084","doi":"10.1007/s11075-017-0450-6","title":"Preconditioning of spectral methods via Birkhoff interpolation","year":2017,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Preconditioner; Birkhoff interpolation; Interpolation (computer graphics); Matrix (chemical analysis); Identity matrix; Condition number; Applied mathematics; Collocation (remote sensing); Mathematical analysis; Eigenvalues and eigenvectors; Linear interpolation; Polynomial interpolation; Linear system","score_opus":0.10801369033901004,"score_gpt":0.45752378758049156,"score_spread":0.3495100972414815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771401084","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067222295,0.000017138274,0.9887839,0.00027159142,0.0006394584,0.00022947823,0.000015793546,0.0001043301,0.003216106],"genre_scores_gemma":[0.18391365,0.0000021174085,0.81557804,0.000018358389,0.00018505692,0.000026941134,0.0000075829976,0.000032895703,0.00023533539],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821544,0.0003140332,0.00057245244,0.00031183963,0.0002868192,0.00029943002],"domain_scores_gemma":[0.9975169,0.0008508408,0.00064884004,0.00072107796,0.000122875,0.00013950752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006328661,0.00019695717,0.0004889311,0.00010155679,0.00033778377,0.00008393392,0.00047719432,0.00011688706,0.00082529336],"category_scores_gemma":[0.0024874688,0.00017645738,0.00023035286,0.00013608184,0.0001991425,0.00031395428,0.00014867824,0.00027012193,0.000036556452],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030620453,0.0003708691,0.0010606871,0.00006681561,0.0001488113,0.000002213533,0.00038276374,0.0000076161677,0.015323679,0.024440398,0.00010336689,0.9580622],"study_design_scores_gemma":[0.0004237496,0.00019130427,0.016150141,0.000051794923,0.00010470573,0.000011437405,0.000040375544,0.04864247,0.022467252,0.9113327,0.00030865727,0.00027540527],"about_ca_topic_score_codex":0.00013194387,"about_ca_topic_score_gemma":0.0000030708227,"teacher_disagreement_score":0.95778674,"about_ca_system_score_codex":0.000051351228,"about_ca_system_score_gemma":0.000029699557,"threshold_uncertainty_score":0.90363836},"labels":[],"label_agreement":null},{"id":"W2911603412","doi":"10.1007/s11075-019-00669-y","title":"Gating-enhanced IMEX splitting methods for cardiac monodomain simulation","year":2019,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Cardiac electrophysiology and arrhythmias","field":"Medicine","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Gating; Integrator; Mathematics; Ordinary differential equation; Scale (ratio); Partial differential equation; Exponential integrator; Biological system; Stability (learning theory); Exponential function; Mathematical analysis; Applied mathematics; Differential equation; Numerical stability; Mechanics; Numerical analysis; Computer science; Physics; Voltage; Differential algebraic equation; Biophysics","score_opus":0.015103069894293952,"score_gpt":0.362093451082811,"score_spread":0.34699038118851705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911603412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23063025,0.00035780796,0.76476556,0.00031487187,0.000708233,0.0010978553,0.000008949649,0.0001595535,0.0019569409],"genre_scores_gemma":[0.690839,0.00000856157,0.30702382,0.0003715775,0.0007716736,0.00007352624,0.00005245295,0.00003717316,0.00082220434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859035,0.0001552652,0.0002949672,0.0004215437,0.00013412883,0.0004037559],"domain_scores_gemma":[0.9983951,0.00096939784,0.00010705017,0.00028667832,0.0001192183,0.00012258356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004322809,0.00018342506,0.00060757535,0.000051360894,0.00009768039,0.000012158587,0.000053203476,0.00015916467,0.00009779903],"category_scores_gemma":[0.00033629412,0.0001595869,0.00039040876,0.0002289706,0.00003831987,0.00006720083,0.00003424054,0.0002593251,0.00012897696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000501138,0.000078417615,0.0004565139,0.00009412652,0.00024590964,0.0000064209144,0.00022260654,0.0071176705,0.21836849,0.00028865412,0.00012197356,0.7724981],"study_design_scores_gemma":[0.003338391,0.0016963403,0.009780132,0.00009478095,0.00031623023,0.000030563922,0.00016635255,0.8702429,0.09537197,0.0028905442,0.0154321045,0.000639698],"about_ca_topic_score_codex":0.000008882399,"about_ca_topic_score_gemma":1.5144776e-8,"teacher_disagreement_score":0.8631252,"about_ca_system_score_codex":0.00007552346,"about_ca_system_score_gemma":0.000057065736,"threshold_uncertainty_score":0.6507765},"labels":[],"label_agreement":null},{"id":"W2963660587","doi":"10.1007/s11075-019-00681-2","title":"A study of Schröder’s method for the matrix pth root using power series expansions","year":2019,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Iterative Methods for Nonlinear Equations","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Invertible matrix; Diagonal matrix; Convergent matrix; Matrix (chemical analysis); Power series; Scalar (mathematics); Band matrix; Nonnegative matrix; Symmetric matrix; Eigenvalues and eigenvectors; Matrix splitting; Convergence (economics); Mathematical analysis; Pure mathematics; Square matrix; Diagonal; Geometry; Physics","score_opus":0.12291952836220321,"score_gpt":0.4592171687068867,"score_spread":0.3362976403446835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963660587","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10491677,0.000055102915,0.89251715,0.000256924,0.0003548582,0.0016646106,0.00004519265,0.000055467994,0.0001339598],"genre_scores_gemma":[0.07985345,6.571247e-7,0.91873085,0.000027570924,0.0000968274,0.00009812872,0.000003633083,0.00005259639,0.0011362593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812806,0.00041406433,0.00050355686,0.00030236947,0.00037390945,0.0002780253],"domain_scores_gemma":[0.9959884,0.002860261,0.0002368416,0.00057123264,0.0002848328,0.000058384998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000987808,0.00020749778,0.00047864745,0.00008673228,0.00021612385,0.00004061616,0.0002801007,0.000072544375,0.0002171236],"category_scores_gemma":[0.00085782714,0.00013408609,0.00018202551,0.0004497903,0.00005086274,0.00015504856,0.00011952919,0.00020869584,0.000020012394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023204058,0.03465346,0.024216602,0.001515226,0.008138231,0.00007864901,0.20785245,0.017874021,0.08023089,0.42508996,0.004251497,0.19377862],"study_design_scores_gemma":[0.0062158518,0.0054598497,0.0029171035,0.00016354906,0.0012399364,0.00011036655,0.045649003,0.7783784,0.009922819,0.13866185,0.009897828,0.0013834384],"about_ca_topic_score_codex":0.000071242896,"about_ca_topic_score_gemma":0.000011482426,"teacher_disagreement_score":0.76050436,"about_ca_system_score_codex":0.000043106545,"about_ca_system_score_gemma":0.00007579523,"threshold_uncertainty_score":0.5467872},"labels":[],"label_agreement":null},{"id":"W3000683368","doi":"10.1007/s11075-019-00853-0","title":"Computation of energy eigenvalues of the anharmonic Coulombic potential with irregular singularities","year":2020,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Quantum Mechanics and Non-Hermitian Physics","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eigenvalues and eigenvectors; Computation; Theory of computation; Anharmonicity; Gravitational singularity; Transformation (genetics); Mathematics; Applied mathematics; Numerical analysis; Exponential function; Mathematical analysis; Algorithm; Physics; Quantum mechanics","score_opus":0.010705311175364269,"score_gpt":0.21802839245716604,"score_spread":0.20732308128180177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000683368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20132436,0.00015473487,0.79716146,0.00044638672,0.0001623148,0.00013892411,0.00007877942,0.000024131581,0.0005088929],"genre_scores_gemma":[0.9976528,0.000002064071,0.0020022846,0.000083888335,0.00019076353,0.0000050300882,0.000021260908,0.000020840926,0.000021042577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999033,0.000060173345,0.00024495067,0.00018803321,0.00031043956,0.00016342702],"domain_scores_gemma":[0.9994566,0.000021129645,0.00020186385,0.00013956254,0.00011224197,0.000068635556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000040974286,0.00013941983,0.00027448093,0.000014336428,0.00006723518,0.0000151667855,0.00018582033,0.00002930722,0.000049485774],"category_scores_gemma":[0.0000019679426,0.00009906818,0.00014752634,0.0002715239,0.000107816966,0.000060364426,0.000064011656,0.00010575338,0.0000023025325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004857811,0.0023674227,0.0067371684,0.00040607722,0.0016937813,0.000020975373,0.002921723,0.021123316,0.070331015,0.51207113,0.0015816173,0.38026002],"study_design_scores_gemma":[0.0017811025,0.0010133182,0.0033264782,0.000134618,0.00026363542,0.0000040751147,0.0007608489,0.70762485,0.1995019,0.08418592,0.00081774534,0.0005854873],"about_ca_topic_score_codex":0.00012094542,"about_ca_topic_score_gemma":1.7835829e-7,"teacher_disagreement_score":0.7963285,"about_ca_system_score_codex":0.0000076080687,"about_ca_system_score_gemma":0.00008262687,"threshold_uncertainty_score":0.4039883},"labels":[],"label_agreement":null},{"id":"W3001281533","doi":"10.1007/s11075-020-00879-9","title":"Mixed finite element methods for the Oseen problem","year":2020,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Mathematics; Piecewise; Finite element method; Theory of computation; Mathematical analysis; Galerkin method; Discontinuous Galerkin method; Tensor (intrinsic definition); Mixed finite element method; Pressure gradient; Applied mathematics; Geometry; Algorithm; Mechanics; Physics","score_opus":0.08276352994104468,"score_gpt":0.3634561516944471,"score_spread":0.2806926217534024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3001281533","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004597699,0.0004325277,0.99544513,0.002362527,0.00034520708,0.00060032425,0.000019056006,0.00041313886,0.00037746283],"genre_scores_gemma":[0.0015814569,0.00002809167,0.9967419,0.000847048,0.0003720202,0.00032836088,0.000007633593,0.000066478315,0.000027035183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873686,0.000095382486,0.00039648602,0.00024339854,0.00020349874,0.0003243639],"domain_scores_gemma":[0.9948279,0.004694085,0.00006093298,0.00018462549,0.00007109213,0.0001613671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033708516,0.00021215244,0.00030510843,0.000020182475,0.00010410185,0.00003399485,0.00034359025,0.0000576144,0.000055832235],"category_scores_gemma":[0.0007131527,0.00015177068,0.00013517754,0.0004031027,0.000047706206,0.00006618506,0.00007665444,0.0002446786,0.00004342524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000767027,0.000017923585,0.0000017632733,0.0000742949,0.00006713006,6.627484e-7,0.00017968181,0.26586697,0.00017181422,0.0019711459,0.00074346975,0.7308975],"study_design_scores_gemma":[0.00020959874,0.000091943024,0.000014836369,0.0000065112163,0.000029600178,0.0000015791737,0.00004562004,0.82717806,0.0012142677,0.033271722,0.13776076,0.00017548724],"about_ca_topic_score_codex":9.5307973e-7,"about_ca_topic_score_gemma":3.2041076e-8,"teacher_disagreement_score":0.730722,"about_ca_system_score_codex":0.000048091435,"about_ca_system_score_gemma":0.000013868673,"threshold_uncertainty_score":0.6189029},"labels":[],"label_agreement":null},{"id":"W3009848594","doi":"10.1007/s11075-020-00892-y","title":"Superconvergence in H1-norm of a difference finite element method for the heat equation in a 3D spatial domain with almost-uniform mesh","year":2020,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Superconvergence; Mathematics; Finite element method; Norm (philosophy); Bounded function; Heat equation; Interpolation (computer graphics); Mathematical analysis; Convergence (economics); Domain (mathematical analysis); Geometry; Applied mathematics; Computer science","score_opus":0.039020625340264535,"score_gpt":0.30238439732226696,"score_spread":0.26336377198200245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009848594","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027460163,0.00007998655,0.9956965,0.0005920165,0.00009180174,0.00067712174,0.000025356649,0.000054749387,0.000036483354],"genre_scores_gemma":[0.18265268,0.000023054274,0.81685215,0.00015861308,0.00005596836,0.00022282456,0.000007908859,0.00002494165,0.0000018386138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998476,0.000085405125,0.00054677366,0.0002538746,0.0003440378,0.00029387497],"domain_scores_gemma":[0.9968764,0.002753698,0.000057445483,0.00016522667,0.000062787105,0.0000844219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034372098,0.00020890126,0.0004045306,0.00006114367,0.000031799187,0.000011510249,0.0002556074,0.000060408656,0.00003518407],"category_scores_gemma":[0.0004005914,0.0001499976,0.000056815952,0.0006732806,0.00005136318,0.00008962801,0.000054490443,0.00025176373,0.000003075952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108575194,0.0000909687,0.00049045024,0.00018598232,0.000034376328,0.000005191751,0.0020859998,0.7582097,0.0006875705,0.0010480628,0.0000050450853,0.23704807],"study_design_scores_gemma":[0.00068468123,0.00028676837,0.0009514473,0.000050396597,0.000012777239,0.0000022903016,0.00025987742,0.9858263,0.0011352955,0.010424684,0.00017639494,0.00018908222],"about_ca_topic_score_codex":0.000089099965,"about_ca_topic_score_gemma":0.000016339449,"teacher_disagreement_score":0.236859,"about_ca_system_score_codex":0.00010781788,"about_ca_system_score_gemma":0.000032708278,"threshold_uncertainty_score":0.6116725},"labels":[],"label_agreement":null},{"id":"W3022521945","doi":"10.1007/s11075-020-00926-5","title":"An optimal 13-point finite difference scheme for a 2D Helmholtz equation with a perfectly matched layer boundary condition","year":2020,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Electromagnetic Simulation and Numerical Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Helmholtz equation; Theory of computation; Mathematical analysis; Perfectly matched layer; Scheme (mathematics); Boundary layer; Finite difference method; Layer (electronics); Finite difference; Blasius boundary layer; Finite difference scheme; Point (geometry); Boundary (topology); Boundary value problem; Geometry; Boundary layer thickness; Mechanics; Algorithm; Physics","score_opus":0.03341095265633933,"score_gpt":0.2884768538702902,"score_spread":0.2550659012139509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022521945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1305379,0.00009446406,0.8676816,0.00054451666,0.00008318823,0.00039784523,0.000027611033,0.00048736032,0.0001454824],"genre_scores_gemma":[0.7066328,0.0000064592273,0.29220912,0.00063363725,0.00020275622,0.00013885088,0.000100597565,0.00005394992,0.000021821728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985588,0.000085334796,0.00030435395,0.00038426497,0.00027274617,0.00039449774],"domain_scores_gemma":[0.99901515,0.0003241578,0.0000575967,0.00018561297,0.00009579162,0.0003217025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001257212,0.00026967155,0.00035794056,0.000050219118,0.00010984596,0.00009621244,0.00015575117,0.000118607815,0.0003194843],"category_scores_gemma":[0.00012541944,0.00023703162,0.00008432881,0.00040420343,0.000063310705,0.00019334798,0.000016390368,0.00027254078,0.00004163147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014408126,0.0005698997,0.0009105272,0.00041228603,0.00028856963,0.00003787569,0.0038908008,0.27775162,0.2715056,0.0005318439,0.0005827221,0.44207743],"study_design_scores_gemma":[0.0011063847,0.0020299726,0.0027265858,0.000016437953,0.000033932793,0.000006364743,0.00006638935,0.9835693,0.008736719,0.00028803636,0.0010578916,0.00036196335],"about_ca_topic_score_codex":0.000008333012,"about_ca_topic_score_gemma":4.4495616e-7,"teacher_disagreement_score":0.7058177,"about_ca_system_score_codex":0.000059606366,"about_ca_system_score_gemma":0.000037466383,"threshold_uncertainty_score":0.9665869},"labels":[],"label_agreement":null},{"id":"W3036170074","doi":"10.1007/s11075-021-01108-7","title":"A simple extrapolation method for clustered eigenvalues","year":2021,"lang":"en","type":"preprint","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Directorate for Mathematical and Physical Sciences; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Extrapolation; Eigenvalues and eigenvectors; Simple (philosophy); Convergence (economics); Power iteration; Mathematics; Applied mathematics; Inverse iteration; Mathematical optimization; Mathematical analysis; Iterative method; Physics","score_opus":0.034278272300960505,"score_gpt":0.3303777501401693,"score_spread":0.29609947783920876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036170074","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011259146,0.00075757276,0.9946634,0.0007628098,0.001898855,0.00084560196,0.000083037594,0.0004678581,0.0004082793],"genre_scores_gemma":[0.009074679,0.00003939975,0.9882261,0.0005962812,0.00093811745,0.00035667454,0.0002744549,0.000052830244,0.00044142827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597013,0.0006290824,0.0007048662,0.0014890814,0.0005463997,0.00066042633],"domain_scores_gemma":[0.99685365,0.00080258714,0.00037826528,0.0013672217,0.00032267597,0.00027557078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013599474,0.0005280823,0.0008222667,0.00016493745,0.00026356525,0.0007155771,0.0016991398,0.00049161044,0.00011257792],"category_scores_gemma":[0.00025135794,0.00051075773,0.0006234777,0.00047630418,0.000046077188,0.00036097798,0.0016917372,0.0006901638,0.000023503891],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029934148,0.00031242057,0.00001855469,0.00030682102,0.00021543574,0.000045373796,0.0011902621,0.0046835584,0.00028748333,0.018192647,0.0010577556,0.97365975],"study_design_scores_gemma":[0.00040650906,0.00009732802,0.00008759735,0.000048231705,0.00004745004,0.00002617008,0.000052681135,0.8954176,0.0016426159,0.09185169,0.009722607,0.000599544],"about_ca_topic_score_codex":0.000107823995,"about_ca_topic_score_gemma":0.000002116615,"teacher_disagreement_score":0.9730602,"about_ca_system_score_codex":0.00011858774,"about_ca_system_score_gemma":0.00033402868,"threshold_uncertainty_score":0.9997344},"labels":[],"label_agreement":null},{"id":"W3048289368","doi":"10.1007/s11075-020-00972-z","title":"Derivation and analysis of computational methods for fractional Laplacian equations with absorbing layers","year":2020,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods in engineering","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; Division of Mathematical Sciences; National University of Singapore; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Université de Lorraine","keywords":"Mathematics; Theory of computation; Computation; Fractional Laplacian; Boundary value problem; Applied mathematics; Numerical analysis; Laplace operator; Space (punctuation); Fourier transform; Mathematical analysis; Computer science; Algorithm","score_opus":0.034736681001411494,"score_gpt":0.32924018598363247,"score_spread":0.294503504982221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048289368","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013885407,0.00008560538,0.9977614,0.00026908194,0.00006763452,0.0001408694,0.000035125744,0.0001593177,0.00009237294],"genre_scores_gemma":[0.20929772,0.000003841437,0.79045093,0.0000887055,0.00005056654,0.000035171895,0.00004777422,0.000023779121,0.0000015367981],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999172,0.000039647693,0.00027054662,0.00019715793,0.00016153911,0.00015916336],"domain_scores_gemma":[0.99850374,0.0011557776,0.00005619346,0.00007168021,0.00008732819,0.00012528875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015985883,0.00013562848,0.00033245643,0.00014837238,0.00004981419,0.000018290739,0.0000716428,0.000054876673,0.000032466072],"category_scores_gemma":[0.00027356658,0.00013053606,0.00007947444,0.0011440504,0.000039513456,0.000119026125,0.000015316044,0.00013121843,9.901307e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000125230645,0.000010773219,0.00022737645,0.000035806457,0.00049892615,3.1739398e-7,0.00017489547,0.86663854,0.0010775804,0.0006881402,0.00001061298,0.13062453],"study_design_scores_gemma":[0.00024474185,0.000069936585,0.003419179,0.0000057663633,0.00025594534,0.0000010125713,0.000047200283,0.9937448,0.0006608094,0.0005593116,0.00083747634,0.00015384395],"about_ca_topic_score_codex":0.000004950229,"about_ca_topic_score_gemma":1.9732084e-7,"teacher_disagreement_score":0.20790917,"about_ca_system_score_codex":0.000036239962,"about_ca_system_score_gemma":0.00001338707,"threshold_uncertainty_score":0.53231066},"labels":[],"label_agreement":null},{"id":"W3207349189","doi":"10.1007/s11075-022-01429-1","title":"A closest point method library for PDEs on surfaces with parallel domain decomposition solvers and preconditioners","year":2022,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Memorial University of Newfoundland","funders":"","keywords":"Domain decomposition methods; Theory of computation; Discretization; Partial differential equation; Parallel computing; Scalability; Computer science; Elliptic partial differential equation; Domain (mathematical analysis); Computational science; Software; Mathematics; Algorithm; Finite element method; Mathematical analysis","score_opus":0.014925595232159807,"score_gpt":0.2953748768807683,"score_spread":0.2804492816486085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207349189","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004816417,0.000093230425,0.9930579,0.00046670449,0.00015805838,0.00043540102,0.00013871648,0.0003734504,0.0004601258],"genre_scores_gemma":[0.018597601,0.000011426637,0.980439,0.00029971072,0.000061508516,0.00040441396,0.00008186519,0.000072085146,0.000032408523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886215,0.00011974551,0.00024202271,0.00028678938,0.00024692237,0.00024237762],"domain_scores_gemma":[0.99821454,0.0014600416,0.00006844497,0.00012676329,0.000017394286,0.00011282799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017061761,0.00020227219,0.0002778843,0.000079877245,0.00022136497,0.000038115788,0.00012560794,0.000036242458,0.00009461073],"category_scores_gemma":[0.000025964526,0.00018393855,0.00005924524,0.00025267756,0.000051788924,0.0002100129,0.00005539479,0.00023086669,0.000003524199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014652775,0.0001255457,0.000025898178,0.00008957548,0.000095772666,0.000009871968,0.0003270852,0.9448029,0.00017878086,0.0061304197,0.00084253575,0.0472251],"study_design_scores_gemma":[0.00085857033,0.00085571693,0.0002015664,0.000024314095,0.0000278802,0.00006987542,0.00040240944,0.813847,0.0005987541,0.17691788,0.0058049103,0.00039110277],"about_ca_topic_score_codex":0.0000011198113,"about_ca_topic_score_gemma":6.302433e-8,"teacher_disagreement_score":0.17078745,"about_ca_system_score_codex":0.00007913112,"about_ca_system_score_gemma":0.000016792395,"threshold_uncertainty_score":0.75007963},"labels":[],"label_agreement":null},{"id":"W4220881341","doi":"10.1007/s11075-022-01277-z","title":"Mixed formulation of a stationary seawater intrusion problem in confined aquifers","year":2022,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Seawater intrusion; Mathematics; Partial differential equation; Aquifer; Theory of computation; Matrix (chemical analysis); Saltwater intrusion; Seawater; Hydraulic head; Partial derivative; Variable (mathematics); Finite element method; Norm (philosophy); Mathematical analysis; Applied mathematics; Groundwater; Geology; Thermodynamics; Physics; Geotechnical engineering; Chemistry","score_opus":0.02746399166153105,"score_gpt":0.275678627043386,"score_spread":0.24821463538185498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220881341","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025576094,0.000048916452,0.9730704,0.00010486116,0.00023308025,0.00029454156,0.000020233196,0.00013131011,0.00052057387],"genre_scores_gemma":[0.4423678,0.0000027512351,0.55741584,0.000030254385,0.00001952601,0.000088912115,0.000033318065,0.000023314204,0.000018279974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873006,0.00009474395,0.00045188537,0.00015796955,0.0003729185,0.00019242273],"domain_scores_gemma":[0.99932617,0.00039135694,0.000075392716,0.00011351235,0.000044812197,0.00004877303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021476012,0.00012633564,0.00024305211,0.00014223387,0.000052118103,0.0000052460355,0.00013032643,0.000032724514,0.00019261372],"category_scores_gemma":[0.000059394795,0.00012882466,0.000046445937,0.0005762582,0.000023386141,0.0000999099,0.000090080524,0.00022784677,0.000005799012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029709885,0.00010803626,0.00019970105,0.000078110825,0.000015517246,0.000006008421,0.00045034065,0.8560335,0.0014349255,0.0031733706,0.00008106407,0.13838969],"study_design_scores_gemma":[0.0004137113,0.000110496905,0.001199341,0.000011460584,0.0000049748314,0.0000081003345,0.00014917037,0.93572587,0.0009772256,0.060131412,0.0011114804,0.00015677045],"about_ca_topic_score_codex":0.000010557939,"about_ca_topic_score_gemma":2.443856e-7,"teacher_disagreement_score":0.41679168,"about_ca_system_score_codex":0.00016560317,"about_ca_system_score_gemma":0.000020305088,"threshold_uncertainty_score":0.5253317},"labels":[],"label_agreement":null},{"id":"W4221125596","doi":"10.1007/s11075-021-01242-2","title":"Discrete mollification in Bernstein basis and space marching scheme for numerical solution of an inverse two-phase one-dimensional Stefan problem","year":2022,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Differential Equations and Numerical Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Capilano University","funders":"","keywords":"Mathematics; Numerical integration; Convergence (economics); Applied mathematics; Numerical stability; Numerical analysis; Stability (learning theory); Basis (linear algebra); Basis function; Mathematical analysis; Geometry; Computer science","score_opus":0.07146243302512412,"score_gpt":0.37825916394814363,"score_spread":0.3067967309230195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221125596","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26402277,0.00003298806,0.7338865,0.00086048676,0.00009814523,0.00083152996,0.00012998882,0.000058782494,0.00007884145],"genre_scores_gemma":[0.34844285,0.000001818876,0.6509891,0.000045898665,0.000051396182,0.00028403214,0.000087667286,0.00003438733,0.000062848696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973537,0.0005626667,0.000652553,0.0005138891,0.00054648024,0.0003707529],"domain_scores_gemma":[0.9984194,0.00069008954,0.00030661275,0.00030254427,0.000083023515,0.00019834517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010033039,0.00022173792,0.0005165242,0.00019787873,0.00025587878,0.00002931314,0.00020072321,0.000065176544,0.00013493194],"category_scores_gemma":[0.0003541906,0.00022009687,0.00012259767,0.00058551703,0.000096721815,0.00021388175,0.00021201074,0.0003320065,0.0000013705115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021256297,0.010345342,0.0013133383,0.0005372588,0.0002566537,0.000016932052,0.0029422338,0.0025850162,0.052179597,0.07857105,0.00028360102,0.84884334],"study_design_scores_gemma":[0.003088839,0.001144755,0.00043934974,0.000036741974,0.00006979253,0.000009459111,0.00030819565,0.92679864,0.0016160681,0.06571408,0.0004366786,0.00033739672],"about_ca_topic_score_codex":0.0004010476,"about_ca_topic_score_gemma":0.000010731593,"teacher_disagreement_score":0.92421365,"about_ca_system_score_codex":0.00014231178,"about_ca_system_score_gemma":0.00006926554,"threshold_uncertainty_score":0.897529},"labels":[],"label_agreement":null},{"id":"W4226026780","doi":"10.1007/s11075-022-01304-z","title":"Approximating the diagonal of a Hessian: which sample set of points should be used","year":2022,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Hessian matrix; Mathematics; Diagonal; Diagonal matrix; Matrix (chemical analysis); Main diagonal; Simplex; Combinatorics; Sample (material); Band matrix; Set (abstract data type); Block matrix; Applied mathematics; Mathematical analysis; Symmetric matrix; Square matrix; Geometry; Eigenvalues and eigenvectors; Computer science","score_opus":0.04604667643643701,"score_gpt":0.2855975527531398,"score_spread":0.2395508763167028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226026780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067286496,0.00010615245,0.9854491,0.0061813765,0.00040341605,0.00029526808,0.00019586891,0.00009733509,0.0005428776],"genre_scores_gemma":[0.72828084,0.0000033478286,0.27063927,0.00068623456,0.00016072932,0.00011078606,0.000026558011,0.000023506467,0.00006873416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971985,0.00054436305,0.0005615368,0.00039399197,0.0009424715,0.00035910064],"domain_scores_gemma":[0.9974886,0.0012896371,0.00035487048,0.00067243556,0.00009843288,0.000096002754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016608031,0.00018248138,0.00039715908,0.0000819643,0.0003227069,0.0000405915,0.0016307082,0.00004567817,0.00035614587],"category_scores_gemma":[0.00031110435,0.00013429689,0.00015991477,0.0013656942,0.000114127266,0.00018808228,0.00095483597,0.00042535318,0.0000042695597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011367826,0.0014139521,0.0018782917,0.00025041902,0.00031714444,0.00004328491,0.018112868,0.0050713597,0.0019494223,0.47633633,0.0018626325,0.49265063],"study_design_scores_gemma":[0.0007144202,0.00042097532,0.0005676628,0.000019292533,0.000024022116,0.000058789807,0.00086820236,0.93535876,0.004394911,0.045969974,0.0112379985,0.00036497338],"about_ca_topic_score_codex":0.00012874881,"about_ca_topic_score_gemma":0.0000010725518,"teacher_disagreement_score":0.9302874,"about_ca_system_score_codex":0.00003661431,"about_ca_system_score_gemma":0.00011994835,"threshold_uncertainty_score":0.5476468},"labels":[],"label_agreement":null},{"id":"W4313401694","doi":"10.1007/s11075-022-01462-0","title":"Extrapolation quadrature from equispaced samples of functions with jumps","year":2022,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Fribourg","keywords":"Extrapolation; Quadrature (astronomy); Mathematics; Theory of computation; Numerical integration; Gauss–Kronrod quadrature formula; Applied mathematics; Richardson extrapolation; Clenshaw–Curtis quadrature; Gaussian quadrature; Euler's formula; Mathematical analysis; Nyström method; Algorithm; Integral equation","score_opus":0.0537033626567663,"score_gpt":0.29212690046311557,"score_spread":0.23842353780634928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313401694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096755125,0.00025524682,0.89269906,0.0015428842,0.00065636984,0.0006454735,0.0009215101,0.00027046303,0.0062538576],"genre_scores_gemma":[0.7560027,0.0000048186616,0.23896074,0.00020962008,0.0003729374,0.00024540897,0.00020353551,0.00006989979,0.003930344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985924,0.0001281316,0.0003653594,0.00025478067,0.00044596783,0.00021340958],"domain_scores_gemma":[0.9983733,0.0008982762,0.00019607513,0.00036556835,0.000069815906,0.000096923744],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019656077,0.000164137,0.00036741217,0.0000798734,0.00026028408,0.000021051244,0.00015349989,0.000060679948,0.0064071272],"category_scores_gemma":[0.00015196581,0.00012643993,0.0001167257,0.00047599064,0.000056180757,0.00007174723,0.0000810455,0.00029086226,0.000023546143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022363302,0.009572536,0.010522463,0.00068189384,0.0023876224,0.000070839145,0.011988329,0.0030170246,0.02663799,0.56626713,0.2607682,0.10584966],"study_design_scores_gemma":[0.0051125837,0.003844417,0.00750651,0.00017188584,0.0011964238,0.00013702083,0.008792661,0.046256296,0.004636099,0.6540623,0.2660922,0.002191613],"about_ca_topic_score_codex":0.00028981888,"about_ca_topic_score_gemma":0.000013551461,"teacher_disagreement_score":0.6592476,"about_ca_system_score_codex":0.00005218342,"about_ca_system_score_gemma":0.000058269296,"threshold_uncertainty_score":0.9945012},"labels":[],"label_agreement":null},{"id":"W4381489648","doi":"10.1007/s11075-023-01589-8","title":"Alternated inertial algorithms for split feasibility problems","year":2023,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Deblurring; Monotonic function; Algorithm; Mathematics; Theory of computation; Convergence (economics); Inertial frame of reference; Subsequence; Set (abstract data type); Hilbert space; Mathematical optimization; Image (mathematics); Image processing; Computer science; Image restoration; Artificial intelligence; Mathematical analysis","score_opus":0.06135734977768593,"score_gpt":0.31752046410624785,"score_spread":0.2561631143285619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381489648","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063124683,0.00001876576,0.9925344,0.0048907204,0.000506205,0.00039999807,0.00003481274,0.0006978126,0.00028604822],"genre_scores_gemma":[0.12286262,0.00004270592,0.86883795,0.0016141512,0.0008592333,0.00040580236,0.00043059047,0.000056127854,0.0048908405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791986,0.00007052419,0.0004203829,0.0006722125,0.00048162622,0.00043537255],"domain_scores_gemma":[0.99875444,0.00017614645,0.00012261746,0.00044807876,0.00029728736,0.00020140392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044537237,0.00019253338,0.00028360228,0.00018296552,0.00020807967,0.0001949077,0.0007407455,0.00009012114,0.00008310557],"category_scores_gemma":[0.00016280707,0.00016601039,0.00020885236,0.0020528913,0.000035304096,0.00037544986,0.00021981656,0.00012339732,0.00031744785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010321259,0.0018670629,0.0066215075,0.00017361714,0.00072743057,0.00005698841,0.0017873456,0.21267349,0.0014458928,0.13219108,0.023129217,0.6192232],"study_design_scores_gemma":[0.00061081036,0.000094387,0.0041960916,0.0000048301245,0.000014176886,0.0000034720892,0.000006567715,0.9809114,0.00015010315,0.0057936735,0.0079878,0.0002267072],"about_ca_topic_score_codex":0.000101447746,"about_ca_topic_score_gemma":0.0000021122548,"teacher_disagreement_score":0.7682379,"about_ca_system_score_codex":0.00007897458,"about_ca_system_score_gemma":0.00008321895,"threshold_uncertainty_score":0.67697066},"labels":[],"label_agreement":null},{"id":"W4383373599","doi":"10.1007/s11075-023-01594-x","title":"The Szegö kernel and oblique projections: conformal mapping of non-smooth regions","year":2023,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Algebraic and Geometric Analysis","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conformal map; Kernel (algebra); Connection (principal bundle); Regular polygon; Mathematical analysis; Domain (mathematical analysis); Function (biology); Oblique case; Pure mathematics; Geometry","score_opus":0.04173483078334084,"score_gpt":0.3091659705346947,"score_spread":0.26743113975135385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383373599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078214034,0.0005803831,0.90012693,0.0051802243,0.0004231767,0.001048196,0.000037863723,0.0005692465,0.013819943],"genre_scores_gemma":[0.94989955,0.001145526,0.031570874,0.00023078114,0.00033637555,0.00018666644,0.000021361871,0.00006183568,0.016547013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987895,0.00004293034,0.00038342006,0.00019265797,0.00029483868,0.00029669268],"domain_scores_gemma":[0.998426,0.0009344699,0.00017269536,0.00026616908,0.00011534565,0.000085290376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046095075,0.00013241656,0.00028602767,0.00022754873,0.00031786438,0.000036024318,0.00017450438,0.000085164625,0.000032048414],"category_scores_gemma":[0.0005447462,0.00008679274,0.00012596809,0.0023810125,0.00018417722,0.000087882814,0.000117002506,0.00019274825,0.000039185565],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007369993,0.00050986564,0.0056621903,0.00043865095,0.0015843449,0.000053698222,0.008282756,0.000095253046,0.00012520168,0.25908625,0.0868048,0.63728327],"study_design_scores_gemma":[0.0020506014,0.000588277,0.045204714,0.0002067523,0.0004796345,0.00010649863,0.02596208,0.42018896,0.00021180573,0.3783237,0.12548742,0.001189548],"about_ca_topic_score_codex":0.00012145568,"about_ca_topic_score_gemma":0.0000057434263,"teacher_disagreement_score":0.87168556,"about_ca_system_score_codex":0.000023702345,"about_ca_system_score_gemma":0.00006089983,"threshold_uncertainty_score":0.35393053},"labels":[],"label_agreement":null},{"id":"W4385552099","doi":"10.1007/s11075-023-01612-y","title":"Incomplete double-cone factorizations of centrosymmetric matrices arising in spectral methods","year":2023,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Biharmonic equation; Cone (formal languages); Theory of computation; Type (biology); Helmholtz equation; Helmholtz free energy; Partial differential equation; Mathematical analysis; Numerical analysis; Applied mathematics; Pure mathematics; Algorithm; Boundary value problem; Physics","score_opus":0.03775475680054412,"score_gpt":0.3341415677504152,"score_spread":0.29638681094987107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385552099","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056674876,0.00021005087,0.9914749,0.00041277707,0.0007454669,0.0002103962,0.000014148583,0.00033513294,0.0009296093],"genre_scores_gemma":[0.30340642,0.00011399752,0.6958686,0.00007309997,0.00023231651,0.000036862428,0.000019947967,0.000028283219,0.00022045278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756646,0.0003304223,0.0005984353,0.0005089747,0.00041839544,0.0005772881],"domain_scores_gemma":[0.99833196,0.00075972243,0.00020503413,0.00046894845,0.00007636966,0.00015798425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011247433,0.00021786813,0.0004611366,0.00087280606,0.00011861463,0.00010828344,0.00095017237,0.00009883637,0.000067803245],"category_scores_gemma":[0.00014626913,0.00020026402,0.00014064567,0.008209005,0.00006585711,0.00045582067,0.00035288278,0.00028402757,0.00009434869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005393984,0.000569114,0.0065089804,0.00012321216,0.00009832003,0.00013648986,0.0020956397,0.0037799317,0.0041141007,0.1919053,0.0003003176,0.7903147],"study_design_scores_gemma":[0.0018304348,0.00021184774,0.022146728,0.000047822883,0.000020744315,0.000027067208,0.00015563707,0.9181881,0.012983242,0.038323507,0.0054268027,0.00063804793],"about_ca_topic_score_codex":0.00017721472,"about_ca_topic_score_gemma":0.000001263175,"teacher_disagreement_score":0.9144082,"about_ca_system_score_codex":0.000072059556,"about_ca_system_score_gemma":0.00007008552,"threshold_uncertainty_score":0.81665295},"labels":[],"label_agreement":null},{"id":"W4385685797","doi":"10.1007/s11075-023-01635-5","title":"Adaptive discontinuous Galerkin finite element methods for the Allen-Cahn equation on polygonal meshes","year":2023,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China; China Postdoctoral Science Foundation; CMG Reservoir Simulation Foundation","keywords":"Polygon mesh; Discretization; Finite element method; Mathematics; Discontinuous Galerkin method; Allen–Cahn equation; Curvature; Galerkin method; Backward Euler method; Mesh generation; Applied mathematics; Algorithm; Mathematical analysis; Geometry","score_opus":0.09488628490794512,"score_gpt":0.38305056011149025,"score_spread":0.28816427520354515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385685797","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003874632,0.00023196207,0.9965027,0.0007990176,0.0008079091,0.0006080299,0.0000466759,0.00053747604,0.00042748684],"genre_scores_gemma":[0.01062755,0.0000664699,0.98773247,0.00022821872,0.00041167103,0.00059185206,0.000031818305,0.00008552291,0.00022441843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982615,0.00015866468,0.00044333367,0.000314932,0.00037426304,0.0004472799],"domain_scores_gemma":[0.9884107,0.011052435,0.00008949122,0.000268339,0.00007882183,0.00010020616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007470268,0.00027634477,0.00033792458,0.00009507748,0.00017393385,0.00004137538,0.00030176566,0.00007889535,0.000053189513],"category_scores_gemma":[0.00091801176,0.0002002832,0.00017390423,0.0004936941,0.00007054955,0.00008633996,0.00007183996,0.000276136,0.000118437456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022394248,0.000033945787,0.0000014597018,0.000019090307,0.00008847713,0.0000014372515,0.00020156687,0.40733868,0.00007125028,0.0035534846,0.0005300882,0.5881381],"study_design_scores_gemma":[0.0002682878,0.00019721147,0.00017211285,0.0000239349,0.000032092823,0.000001815309,0.0001759137,0.9119121,0.0006132553,0.07096893,0.015394481,0.00023989759],"about_ca_topic_score_codex":0.0000033390388,"about_ca_topic_score_gemma":2.3765861e-7,"teacher_disagreement_score":0.5878982,"about_ca_system_score_codex":0.00011448506,"about_ca_system_score_gemma":0.000018631783,"threshold_uncertainty_score":0.8167312},"labels":[],"label_agreement":null},{"id":"W4387530586","doi":"10.1007/s11075-023-01668-w","title":"Max-convolution through numerics and tropical geometry","year":2023,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Science Foundation","keywords":"Differentiable function; Mathematics; Convolution (computer science); Function (biology); Integer (computer science); Convergence (economics); Salient; Theory of computation; Algorithm; Applied mathematics; Mathematical analysis; Geometry; Computer science","score_opus":0.019586466382910547,"score_gpt":0.2573348117555992,"score_spread":0.23774834537268863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387530586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043241587,0.0001424824,0.95168597,0.0031849633,0.0006856284,0.00009514559,0.0000031075313,0.00061055104,0.00035055424],"genre_scores_gemma":[0.8658785,0.000107753105,0.1316286,0.001223244,0.00050204166,0.000028285962,0.000016852438,0.000021282332,0.0005934383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862504,0.0000516768,0.00021635338,0.00043629558,0.00029713247,0.00037348352],"domain_scores_gemma":[0.99940413,0.00013740413,0.000056190504,0.00023284336,0.00003592439,0.0001335335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008994005,0.00014532375,0.00019449233,0.00009662098,0.000157023,0.00011771871,0.00033740606,0.00007463474,0.00001581392],"category_scores_gemma":[0.000055828885,0.00012931804,0.00006140905,0.0013883612,0.000068454734,0.0004309553,0.00031154716,0.00016312451,0.00038125864],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006782519,0.00007294776,0.0014913431,0.000014930479,0.000021948732,0.000048394864,0.00044823546,0.00016170942,0.0001790474,0.04084928,0.0033313162,0.9533741],"study_design_scores_gemma":[0.00051593536,0.0001936701,0.10746189,0.000010804413,0.000007848779,0.000058280355,0.000036569723,0.8169653,0.00028686202,0.045733187,0.028375128,0.00035455567],"about_ca_topic_score_codex":0.000054461612,"about_ca_topic_score_gemma":3.2350127e-7,"teacher_disagreement_score":0.9530195,"about_ca_system_score_codex":0.000037503658,"about_ca_system_score_gemma":0.00003742204,"threshold_uncertainty_score":0.52734363},"labels":[],"label_agreement":null},{"id":"W4388551341","doi":"10.1007/s11075-023-01698-4","title":"Second-order Rosenbrock-exponential (ROSEXP) methods for partitioned differential equations","year":2023,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Environment and Climate Change Canada","funders":"National Science Foundation","keywords":"Exponential integrator; Mathematics; Integrator; Solver; Ordinary differential equation; Applied mathematics; Nonlinear system; Matrix exponential; Exponential function; Stability (learning theory); Differential equation; Linear system; Convergence (economics); Exponential stability; Numerical stability; Theory of computation; Numerical analysis; Differential algebraic equation; Mathematical optimization; Computer science; Algorithm; Mathematical analysis","score_opus":0.13472116942511272,"score_gpt":0.4522147365095032,"score_spread":0.31749356708439047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388551341","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018761082,0.000026431127,0.992796,0.0007316072,0.0018588057,0.0011388046,0.00022924521,0.0010813226,0.0002616827],"genre_scores_gemma":[0.018009285,0.000008750176,0.97439194,0.00014899317,0.00087181746,0.0014765472,0.00046518765,0.0001627329,0.0044647343],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99603134,0.00065847975,0.0009945508,0.0007899803,0.0005389832,0.0009866805],"domain_scores_gemma":[0.99304485,0.005250254,0.00031102155,0.00064454915,0.00036078782,0.0003885212],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007438833,0.00046250247,0.00080755836,0.0003164997,0.00062296767,0.00015398969,0.00044943506,0.00027885145,0.0026514595],"category_scores_gemma":[0.0045444537,0.00043048224,0.00052752305,0.0016610163,0.00015527559,0.0002350264,0.00022424299,0.00038251735,0.0004065856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025629692,0.002294418,0.00004321871,0.00039271725,0.0008577153,0.000011112291,0.001518664,0.00020003908,0.066509634,0.13783547,0.012199586,0.77788115],"study_design_scores_gemma":[0.0018813375,0.0003128554,0.00042327648,0.00002581711,0.00027949538,0.0000054080524,0.0001479841,0.2161094,0.008839325,0.74902666,0.02216481,0.00078361854],"about_ca_topic_score_codex":0.000019081222,"about_ca_topic_score_gemma":0.00000636701,"teacher_disagreement_score":0.7770975,"about_ca_system_score_codex":0.00011070011,"about_ca_system_score_gemma":0.00010070103,"threshold_uncertainty_score":0.9998147},"labels":[],"label_agreement":null},{"id":"W4390748235","doi":"10.1007/s11075-023-01730-7","title":"The effect of splitting strategy on qualitative property preservation","year":2024,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Mathematical and Theoretical Epidemiology and Ecology Models","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monotonic function; Property (philosophy); Operator splitting; Operator (biology); Qualitative analysis; Theory of computation; Applied mathematics; Mathematical analysis; Qualitative research; Algorithm; Chemistry","score_opus":0.04609510957583055,"score_gpt":0.3835856230001985,"score_spread":0.3374905134243679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390748235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37519962,0.0021363832,0.41958323,0.05091914,0.0010549205,0.0029039942,0.000026497375,0.00055464945,0.14762159],"genre_scores_gemma":[0.9967547,0.000016806405,0.00066957786,0.00018372553,0.00010901352,0.000063581225,0.000005947247,0.000010309885,0.0021863428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986932,0.0004316978,0.0003228573,0.00019917029,0.00014364772,0.00020942651],"domain_scores_gemma":[0.9939655,0.0057393587,0.00003836951,0.00014303335,0.00003557925,0.00007815137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017012275,0.00011054551,0.00033553015,0.0000211233,0.00009010571,0.000009551847,0.00006884041,0.0001114817,0.00014941893],"category_scores_gemma":[0.0017568714,0.00004030787,0.00011928598,0.00014387479,0.00029506235,0.00004018268,0.00002436387,0.0003257948,0.00010662545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074917247,0.00012257902,0.00013123201,0.00059662806,0.00024285521,0.000026224006,0.0008134971,0.00006993792,0.0001622137,0.8206161,0.0009094788,0.17556003],"study_design_scores_gemma":[0.000674157,0.007731306,0.00062589225,0.00040244235,0.00016369899,0.000030172923,0.00024074987,0.7769995,0.0028074076,0.20657837,0.0035877384,0.00015858853],"about_ca_topic_score_codex":0.000013502316,"about_ca_topic_score_gemma":1.412092e-7,"teacher_disagreement_score":0.77692956,"about_ca_system_score_codex":0.000017046397,"about_ca_system_score_gemma":0.000025389756,"threshold_uncertainty_score":0.2103266},"labels":[],"label_agreement":null},{"id":"W4390775843","doi":"10.1007/s11075-023-01738-z","title":"An Hermite–Obreshkov method for 2nd-order linear initial-value problems for ODE","year":2024,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación","keywords":"Mathematics; Ode; Applied mathematics; Hermite polynomials; Differential equation; Ordinary differential equation; Scalar (mathematics); Theory of computation; Numerical analysis; Initial value problem; Mathematical analysis; Algorithm","score_opus":0.11377890210451447,"score_gpt":0.47447154134948466,"score_spread":0.3606926392449702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390775843","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009848645,0.00018718655,0.9930346,0.0016064952,0.0012652819,0.0022639027,0.00049900083,0.00079819903,0.00024685668],"genre_scores_gemma":[0.0008145519,0.000008659909,0.9941441,0.00048192195,0.0014076362,0.0017588915,0.0001820113,0.00024315336,0.00095908187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655515,0.00038518407,0.00085792533,0.00093039375,0.00047334528,0.00079799746],"domain_scores_gemma":[0.99411833,0.004394234,0.00015294121,0.00060486584,0.0003521357,0.000377495],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012301934,0.0004708673,0.0007815305,0.00019584277,0.00027100084,0.00020670446,0.0004734534,0.00030782376,0.00023176607],"category_scores_gemma":[0.001746885,0.00039561852,0.0004937559,0.0008450909,0.000100973775,0.00031586268,0.000078724195,0.00041834184,0.000049682447],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102020276,0.00093049195,0.0000029124103,0.0009781974,0.0003613279,0.00000852989,0.00089774164,0.00048740106,0.0034075906,0.11217911,0.0021206539,0.878524],"study_design_scores_gemma":[0.00048872107,0.00056483824,0.0000033059869,0.00006487563,0.00021511459,0.000012490889,0.000051889954,0.5258361,0.0022645632,0.41124752,0.058882326,0.00036824282],"about_ca_topic_score_codex":0.00009743089,"about_ca_topic_score_gemma":0.000005414586,"teacher_disagreement_score":0.87815577,"about_ca_system_score_codex":0.00014124147,"about_ca_system_score_gemma":0.00020365429,"threshold_uncertainty_score":0.99984956},"labels":[],"label_agreement":null},{"id":"W4391910002","doi":"10.1007/s11075-023-01731-6","title":"Nullspaces yield new explicit Runge–Kutta pairs","year":2024,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Butcher; Mathematics; Runge–Kutta methods; Applied mathematics; Parametric statistics; Pure mathematics; Isomorphism (crystallography); Algebra over a field; Mathematical analysis; Differential equation; Statistics; Law","score_opus":0.126163194480039,"score_gpt":0.3811040634701919,"score_spread":0.2549408689901529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391910002","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015054899,0.00074653816,0.9870232,0.004673338,0.0014928534,0.00035919444,0.000028726046,0.001130108,0.0030405992],"genre_scores_gemma":[0.04917497,0.00006853883,0.935467,0.00040800322,0.0016821972,0.00011398881,0.000019961884,0.00017965905,0.012885688],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745333,0.00013742255,0.00053582067,0.00064407947,0.000626205,0.00060311885],"domain_scores_gemma":[0.9966276,0.0022286994,0.000084344974,0.00054034527,0.000055721765,0.0004632457],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003162226,0.00037271928,0.0005304372,0.00016464764,0.00013664816,0.00022503751,0.0004073847,0.00019926115,0.0024699033],"category_scores_gemma":[0.0010653464,0.0003028508,0.00034345666,0.00095675135,0.00006551892,0.00023777757,0.00015083338,0.0005582112,0.0010210183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020447178,0.00031915837,0.000064422355,0.00016909432,0.00025322198,0.000073917676,0.0009456054,0.0000076302,0.0018712307,0.10002891,0.04182345,0.8544229],"study_design_scores_gemma":[0.00025297195,0.00026991538,0.00016109495,0.00021506422,0.00021230344,0.00003565926,0.00020087542,0.017962432,0.0025698731,0.8961054,0.0813501,0.00066429534],"about_ca_topic_score_codex":0.00026406447,"about_ca_topic_score_gemma":0.0000071459945,"teacher_disagreement_score":0.85375863,"about_ca_system_score_codex":0.00010987532,"about_ca_system_score_gemma":0.00013768203,"threshold_uncertainty_score":0.99994236},"labels":[],"label_agreement":null},{"id":"W4392239459","doi":"10.1007/s11075-024-01784-1","title":"Differential equation software for the computation of error-controlled continuous approximate solutions","year":2024,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Solver; Computer science; Ode; Computation; Software; Collocation (remote sensing); Focus (optics); Ordinary differential equation; Mathematical optimization; Applied mathematics; Mathematics; Algorithm; Differential equation; Mathematical analysis","score_opus":0.12887983061742095,"score_gpt":0.38104091991114153,"score_spread":0.2521610892937206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392239459","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011165792,0.00028823086,0.99425215,0.00089342747,0.0012164263,0.001718818,0.00011294681,0.00035708456,0.00004434168],"genre_scores_gemma":[0.39113978,0.000010803926,0.60714626,0.00003497374,0.00040066318,0.0008338274,0.0000755221,0.00007621309,0.00028194656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977212,0.00023469917,0.0007981269,0.0003674633,0.0004728963,0.0004056441],"domain_scores_gemma":[0.99328005,0.0057914536,0.00025043293,0.00027367772,0.00031440143,0.000089998575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053593173,0.00025659424,0.0006632848,0.00012570544,0.0002956324,0.00011294784,0.00025149036,0.00012728386,0.00012101218],"category_scores_gemma":[0.002493644,0.0001675343,0.00046751526,0.00057400874,0.0001516976,0.00013188295,0.00007931223,0.00024450538,0.00001731142],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037184835,0.0008400038,0.000026373096,0.0005756325,0.000974061,0.000002604098,0.0009229906,0.0009903787,0.0018609525,0.14951198,0.0009972091,0.84292597],"study_design_scores_gemma":[0.0012844974,0.00015321151,0.000090399626,0.000060652623,0.00045420535,0.0000035583014,0.00007273551,0.6566303,0.0002902931,0.3405439,0.00025216633,0.00016407139],"about_ca_topic_score_codex":0.000038798706,"about_ca_topic_score_gemma":0.0000015361584,"teacher_disagreement_score":0.8427619,"about_ca_system_score_codex":0.00007613908,"about_ca_system_score_gemma":0.00008699694,"threshold_uncertainty_score":0.683185},"labels":[],"label_agreement":null},{"id":"W4393276830","doi":"10.1007/s11075-024-01808-w","title":"Fast and stable rational approximation of generalized hypergeometric functions","year":2024,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Theory of computation; Generalized hypergeometric function; Hypergeometric function; Barnes integral; Basic hypergeometric series; Rational function; Hypergeometric function of a matrix argument; Numerical analysis; Applied mathematics; Pure mathematics; Algebra over a field; Mathematical analysis; Algorithm","score_opus":0.06232660415006911,"score_gpt":0.33940594726468093,"score_spread":0.2770793431146118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393276830","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017026883,0.00037827383,0.9808977,0.0003468655,0.00043043253,0.00022990383,0.00006984102,0.00016963267,0.00045045628],"genre_scores_gemma":[0.1237504,0.000035981095,0.8742885,0.000029049874,0.00021890622,0.00009738779,0.00006639761,0.00004352456,0.0014698508],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985531,0.00012373249,0.0004346544,0.0002957639,0.00038792135,0.00020485306],"domain_scores_gemma":[0.99868053,0.00083281304,0.000083383544,0.00017806332,0.00011350146,0.00011172649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029336888,0.00014941973,0.0003120168,0.0003040845,0.00009870182,0.000065617445,0.00008736917,0.00008240047,0.00046900308],"category_scores_gemma":[0.0006127514,0.00012996807,0.00011034727,0.0013955577,0.00008161091,0.00019697583,0.00005491745,0.00017182382,0.000039589457],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021019578,0.00047667936,0.0002910621,0.0003618547,0.00023598998,0.000003843223,0.0003264451,0.00015932457,0.0074638114,0.14125994,0.001047385,0.8483527],"study_design_scores_gemma":[0.00061934825,0.00023948544,0.0016748711,0.00006962001,0.00026373766,0.000031661115,0.00019001795,0.4032856,0.0027127175,0.5839568,0.006536828,0.0004193126],"about_ca_topic_score_codex":0.000042570922,"about_ca_topic_score_gemma":0.0000011956778,"teacher_disagreement_score":0.84793335,"about_ca_system_score_codex":0.0000513701,"about_ca_system_score_gemma":0.000056542594,"threshold_uncertainty_score":0.5299944},"labels":[],"label_agreement":null},{"id":"W4399442338","doi":"10.1007/s11075-024-01854-4","title":"On solving 2D weakly singular Volterra integral equations of the second kind","year":2024,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Fractional Differential Equations Solutions","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Volterra integral equation; Theory of computation; Integral equation; Volterra equations; Singular integral; Mathematical analysis; Singular solution; Numerical analysis; Applied mathematics; Nonlinear system; Physics; Algorithm","score_opus":0.048315271974520416,"score_gpt":0.3224646853747276,"score_spread":0.2741494134002072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399442338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02249993,0.0001289689,0.9658998,0.002025437,0.001854484,0.0003409755,0.000115040224,0.00019068582,0.00694467],"genre_scores_gemma":[0.9782162,0.0000011869907,0.017004838,0.00010276302,0.0002067114,0.00003904378,0.000015046213,0.000036717498,0.0043775286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857306,0.000100323894,0.000385968,0.0002560862,0.00046256618,0.00022197793],"domain_scores_gemma":[0.99795717,0.0014304373,0.000093074756,0.0003488065,0.00010604806,0.00006444874],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016912387,0.0001643063,0.00020268788,0.00012777207,0.0002123085,0.000073095354,0.00023820173,0.00009378647,0.0017287073],"category_scores_gemma":[0.0009518806,0.000115530056,0.0002513145,0.00055910123,0.0001246647,0.00013674973,0.00007769143,0.00043308892,0.00016489145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008395871,0.0004315987,0.000012173293,0.00008849083,0.00016601985,0.000004263306,0.00070754613,0.0002145537,0.0035431418,0.9653493,0.0074479873,0.02202651],"study_design_scores_gemma":[0.00018937307,0.00012302845,0.00078790117,0.0002892361,0.0001263852,0.0000145902795,0.00014716864,0.50389504,0.002524295,0.4830461,0.008588035,0.00026881474],"about_ca_topic_score_codex":0.000048174436,"about_ca_topic_score_gemma":0.000022033386,"teacher_disagreement_score":0.95571625,"about_ca_system_score_codex":0.00015773812,"about_ca_system_score_gemma":0.00013096751,"threshold_uncertainty_score":0.99918383},"labels":[],"label_agreement":null},{"id":"W4402093168","doi":"10.1007/s11075-024-01919-4","title":"VEMcomp: a Virtual Elements MATLAB package for bulk-surface PDEs in 2D and 3D","year":2024,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Gruppo Nazionale per il Calcolo Scientifico; Regione Puglia; Canada Research Chairs; Engineering and Physical Sciences Research Council; Ministero dell’Istruzione, dell’Università e della Ricerca; British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada; European Commission; UK Research and Innovation; Ministero dell'Università e della Ricerca; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Polygon mesh; Solver; Finite element method; MATLAB; Partial differential equation; Algorithm; Computer science; Surface (topology); Mesh generation; Geometry; Computational science; Mathematics; Mathematical analysis; Physics; Mathematical optimization; Thermodynamics","score_opus":0.022566160245281602,"score_gpt":0.31479458934172877,"score_spread":0.2922284290964472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402093168","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009121934,0.00092309975,0.9883224,0.000120432254,0.0005236912,0.0003082389,0.000049918057,0.0003873153,0.00024298053],"genre_scores_gemma":[0.10023832,0.000056643054,0.89926064,0.00006317522,0.0001367112,0.0000674052,0.0000122716365,0.000072079056,0.00009272318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998738,0.000032425993,0.00038740275,0.00029847588,0.00021269386,0.00033099856],"domain_scores_gemma":[0.99855334,0.0011613029,0.000023764844,0.00013296837,0.000024523044,0.00010412502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020903022,0.00021798747,0.000306353,0.00007262688,0.00003786836,0.0000689556,0.000128286,0.00007628958,0.000033020333],"category_scores_gemma":[0.00014002234,0.00020486112,0.000053888125,0.00035502782,0.000049125818,0.00013714457,0.000057765214,0.0002367616,0.00004183863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002462009,0.00013622642,0.000111546906,0.0007466505,0.0001317188,0.000057003792,0.0006888134,0.139979,0.0024362789,0.008142019,0.00074833893,0.84679776],"study_design_scores_gemma":[0.0002642334,0.00011139061,0.000105064704,0.00009334392,0.000013404645,0.00001505766,0.000048377064,0.9593227,0.00047007692,0.030268412,0.0090350965,0.00025283155],"about_ca_topic_score_codex":0.000002564949,"about_ca_topic_score_gemma":2.2268179e-7,"teacher_disagreement_score":0.8465449,"about_ca_system_score_codex":0.000102188635,"about_ca_system_score_gemma":0.0000134061465,"threshold_uncertainty_score":0.8353994},"labels":[],"label_agreement":null},{"id":"W4404769895","doi":"10.1007/s11075-024-01986-7","title":"Explicit-implicit methods for stochastic susceptible-infected-recovered model","year":2024,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; China Scholarship Council; National Natural Science Foundation of China","keywords":"Theory of computation; Mathematics; Applied mathematics; Calculus (dental); Mathematical economics; Algorithm; Medicine","score_opus":0.11949634076554967,"score_gpt":0.43646319936855477,"score_spread":0.3169668586030051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404769895","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008129114,0.00072067813,0.99555624,0.00047895612,0.0013810378,0.0005346031,0.00010592094,0.00050816627,0.0006331217],"genre_scores_gemma":[0.111850865,0.000009230349,0.88347656,0.00021660693,0.00047537868,0.0003166079,0.00002066517,0.0000809264,0.003553157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967696,0.00014221325,0.0007601978,0.0009925892,0.00070304674,0.0006323699],"domain_scores_gemma":[0.99319214,0.0055144075,0.00008079667,0.0006322007,0.00026956317,0.00031090825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002286933,0.00033368156,0.0005844402,0.0003299882,0.00016334558,0.0004349829,0.0007523659,0.00019441055,0.00025629226],"category_scores_gemma":[0.0038034795,0.00023644176,0.00037102227,0.0013694458,0.0000673959,0.00027988624,0.00013954077,0.0003073637,0.00039487967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003200988,0.000079734535,0.0000021268377,0.00003374945,0.00006249573,0.0000054906563,0.00022753215,0.43507376,0.0033246172,0.024990037,0.010841716,0.5253267],"study_design_scores_gemma":[0.00019693217,0.00018207058,0.000008422852,0.000031433166,0.000037804435,0.00001683861,0.000030625608,0.85214514,0.00015458031,0.13782671,0.009077774,0.0002917049],"about_ca_topic_score_codex":0.000015505593,"about_ca_topic_score_gemma":4.0348047e-7,"teacher_disagreement_score":0.525035,"about_ca_system_score_codex":0.00013124324,"about_ca_system_score_gemma":0.00020646503,"threshold_uncertainty_score":0.9641815},"labels":[],"label_agreement":null},{"id":"W4405648285","doi":"10.1007/s11075-024-01995-6","title":"Optimized Schwarz domain decomposition algorithms for the closest point method on closed manifolds","year":2024,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Additive Schwarz method; Schwarz alternating method; Mathematics; Domain decomposition methods; Embedding; Algorithm; Numerical analysis; Helmholtz equation; Surface (topology); Partial differential equation; Helmholtz free energy; Mathematical analysis; Finite element method; Applied mathematics; Geometry; Boundary value problem; Computer science","score_opus":0.03216924468785796,"score_gpt":0.3656332353149778,"score_spread":0.33346399062711984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405648285","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005965211,0.0008615376,0.9925245,0.0014562731,0.002068292,0.0009149212,0.000087976965,0.0011931749,0.0008336906],"genre_scores_gemma":[0.0035104097,0.00006930386,0.9943909,0.00038503058,0.00084565615,0.0005044769,0.000035852114,0.00017142491,0.00008697005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976207,0.00016661389,0.00061967527,0.00054190157,0.0005123314,0.00053880067],"domain_scores_gemma":[0.9922418,0.0070107807,0.00006396357,0.00041728833,0.0000915769,0.0001745922],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079548813,0.00044362704,0.00050941337,0.00014624381,0.00022249683,0.00017999447,0.00041654255,0.00017011561,0.00009014273],"category_scores_gemma":[0.00021106882,0.00032246608,0.0003479625,0.0006643402,0.00007652047,0.00018391377,0.00006755768,0.00055267045,0.00015291237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006487924,0.0001102415,2.51405e-7,0.00018852534,0.00026329627,0.000034705958,0.00021105648,0.40100121,0.0004733358,0.022760065,0.0014991919,0.5733932],"study_design_scores_gemma":[0.0005142495,0.00020194594,0.000016033524,0.000093948445,0.00007277842,0.00006284294,0.00006547961,0.8495836,0.0015070445,0.13150278,0.016007887,0.0003713849],"about_ca_topic_score_codex":0.0000037875193,"about_ca_topic_score_gemma":8.156939e-8,"teacher_disagreement_score":0.5730218,"about_ca_system_score_codex":0.0002634831,"about_ca_system_score_gemma":0.00003241002,"threshold_uncertainty_score":0.99992275},"labels":[],"label_agreement":null},{"id":"W4408366230","doi":"10.1007/s11075-025-02041-9","title":"Cut-edge centralities in an undirected graph","year":2025,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per il Calcolo Scientifico; NextGenerationEU; Ministero dell'Università e della Ricerca","keywords":"Mathematics; Theory of computation; Undirected graph; Graph; Combinatorics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Algorithm; Artificial intelligence","score_opus":0.0385007283488646,"score_gpt":0.3413768819822541,"score_spread":0.3028761536333895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408366230","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.887568,0.00018835359,0.077921174,0.0020106395,0.0004992713,0.0008844607,0.00006971425,0.00083449844,0.030023867],"genre_scores_gemma":[0.96988225,0.000024886715,0.027638422,0.00031000783,0.000059563154,0.000121018835,0.000028038496,0.000022178143,0.001913645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989782,0.0001230555,0.00025510686,0.00023884774,0.00010598349,0.0002988271],"domain_scores_gemma":[0.9992742,0.00025563233,0.000040088675,0.00030514045,0.000041099665,0.00008386075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016790596,0.00012803823,0.0002149944,0.00013795402,0.00010587083,0.000030227522,0.00021885947,0.00007781082,0.00013620856],"category_scores_gemma":[0.00006800666,0.00011664961,0.00006991169,0.0008767143,0.00008872389,0.00008682975,0.000025136813,0.00017848745,0.000022748703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013247383,0.00050882157,0.002090565,0.00002834902,0.000020615367,0.0000042811685,0.00034831325,0.000004071105,0.00014926233,0.9867088,0.0015063361,0.008617301],"study_design_scores_gemma":[0.00030911254,0.000031266743,0.004841087,0.000029638115,0.000020810128,0.0000011622571,0.00035187902,0.0013943989,0.0010910343,0.98495054,0.006815967,0.00016307898],"about_ca_topic_score_codex":0.000070575865,"about_ca_topic_score_gemma":0.00006572425,"teacher_disagreement_score":0.082314216,"about_ca_system_score_codex":0.00003277581,"about_ca_system_score_gemma":0.000039082614,"threshold_uncertainty_score":0.4756833},"labels":[],"label_agreement":null},{"id":"W4410747868","doi":"10.1007/s11075-025-02109-6","title":"Algebras behind the bispectrality of the Wilson rational functions and their $$ _4\\phi _3$$ limits","year":2025,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Montreal Clinical Research Institute; Université de Montréal","funders":"","keywords":"Mathematics; Theory of computation; Rational function; Algebra over a field; Calculus (dental); Pure mathematics; Mathematical economics; Algorithm","score_opus":0.03497610199176973,"score_gpt":0.2978974493507911,"score_spread":0.2629213473590214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410747868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41280407,0.0012597134,0.45316002,0.07045729,0.003193749,0.0028983688,0.00042069115,0.00033432143,0.05547179],"genre_scores_gemma":[0.97756314,0.00002617733,0.007323462,0.000972666,0.0003371407,0.00012278391,0.0000083456425,0.000027578586,0.013618712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987433,0.000170183,0.00043665277,0.0002226217,0.00021834688,0.00020889542],"domain_scores_gemma":[0.99751264,0.0017235378,0.00013425514,0.00048009143,0.00009003953,0.00005941205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044466145,0.00017826517,0.00030551036,0.00004217588,0.00038049367,0.000049440216,0.00024863443,0.00009765106,0.00035122308],"category_scores_gemma":[0.00063111936,0.00008490254,0.00017628206,0.00036277974,0.0002538044,0.00006446025,0.00010364179,0.00027124368,0.0000138094865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056988076,0.00092452014,0.0019530818,0.00021665382,0.00043022414,7.067668e-7,0.0015900667,0.00002169486,0.001515895,0.9104493,0.04667059,0.036170255],"study_design_scores_gemma":[0.0007228091,0.00014447984,0.013285442,0.00013571752,0.00026110056,0.000026604206,0.0009731906,0.011210315,0.007105164,0.92772025,0.038077444,0.0003375016],"about_ca_topic_score_codex":0.000057780184,"about_ca_topic_score_gemma":0.000020633153,"teacher_disagreement_score":0.5647591,"about_ca_system_score_codex":0.00003032159,"about_ca_system_score_gemma":0.000088784655,"threshold_uncertainty_score":0.38456464},"labels":[],"label_agreement":null},{"id":"W4411857587","doi":"10.1007/s11075-025-02144-3","title":"The CMV bispectrality of the Jacobi polynomials on the unit circle","year":2025,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Mathematics; Theory of computation; Jacobi polynomials; Unit circle; Jacobi operator; Gegenbauer polynomials; Unit (ring theory); Orthogonal polynomials; Classical orthogonal polynomials; Mathematical analysis; Mathematics education; Algorithm","score_opus":0.04905095008506859,"score_gpt":0.330756912285491,"score_spread":0.2817059622004224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411857587","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3640124,0.0008886234,0.07188132,0.2399261,0.0070775887,0.0060115703,0.00030070677,0.00057691184,0.30932477],"genre_scores_gemma":[0.9725441,0.000043247142,0.0025830644,0.0025695176,0.0003436312,0.00016995268,0.0000015245326,0.000041172898,0.021703834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981101,0.00039675325,0.00058023806,0.00021723987,0.00036425923,0.00033136827],"domain_scores_gemma":[0.99266446,0.0059123887,0.00019941348,0.0010812015,0.00008491998,0.000057605896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011147981,0.0001819441,0.00034502737,0.00003170958,0.0006166095,0.00006443819,0.0007483433,0.000098655844,0.00040623348],"category_scores_gemma":[0.001930612,0.00007808089,0.0002894203,0.00065064925,0.00039371022,0.000028512068,0.00016492858,0.00036509018,0.00007511741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047354904,0.00040002176,0.00014184992,0.00006615441,0.00017878479,6.488878e-7,0.00027755534,0.0000076192737,0.00047444773,0.9255624,0.049832914,0.02301024],"study_design_scores_gemma":[0.00054463604,0.00015428547,0.005184273,0.00018276047,0.00018627044,0.0000059454796,0.0007503261,0.0023420283,0.020179633,0.8538919,0.116271056,0.00030689235],"about_ca_topic_score_codex":0.000116275674,"about_ca_topic_score_gemma":0.000011335397,"teacher_disagreement_score":0.60853165,"about_ca_system_score_codex":0.000044565466,"about_ca_system_score_gemma":0.00010050247,"threshold_uncertainty_score":0.47425243},"labels":[],"label_agreement":null},{"id":"W87731125","doi":"10.1023/a:1016658419067","title":"Birkhoff interpolation on some perturbed roots of unity: Revisited","year":2000,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Differential Equations and Numerical Methods","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Lacunary function; Interpolation (computer graphics); Complex plane; Theory of computation; Range (aeronautics); Birkhoff interpolation; Mathematical analysis; Root of unity; Plane (geometry); Pure mathematics; Trilinear interpolation; Applied mathematics; Linear interpolation; Geometry; Algorithm","score_opus":0.05674016216338719,"score_gpt":0.3545631090474876,"score_spread":0.29782294688410044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W87731125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41270337,0.00023842006,0.5577258,0.001999874,0.0007085698,0.0011553917,0.00011238988,0.00064646057,0.024709737],"genre_scores_gemma":[0.76783335,0.00004701387,0.22876017,0.0006257644,0.00030910695,0.00003558576,0.000044424723,0.00007321669,0.0022713933],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982761,0.0002853628,0.00051571865,0.00028410341,0.00038741564,0.00025131006],"domain_scores_gemma":[0.9984807,0.0007639218,0.00015015813,0.00037948485,0.00008807131,0.00013770942],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027947625,0.0002043977,0.00047311513,0.00012252602,0.00007635926,0.000027102891,0.00020260716,0.000116943986,0.0030721715],"category_scores_gemma":[0.00055484637,0.0001612907,0.00017169789,0.00053788937,0.000067629364,0.00012592116,0.000031261705,0.00024257578,0.00014480886],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013780712,0.0008044894,0.00006591615,0.000053711054,0.000066326495,0.000003769769,0.00015858148,0.000013080425,0.0010086093,0.033341162,0.0007815011,0.96356505],"study_design_scores_gemma":[0.0024637964,0.0024503097,0.010765638,0.00048722536,0.00027953958,0.000016212622,0.00013377263,0.27957675,0.0074021914,0.6698474,0.025370665,0.0012064769],"about_ca_topic_score_codex":0.00004469869,"about_ca_topic_score_gemma":2.7480917e-7,"teacher_disagreement_score":0.9623586,"about_ca_system_score_codex":0.000039028157,"about_ca_system_score_gemma":0.00002084187,"threshold_uncertainty_score":0.99783915},"labels":[],"label_agreement":null}]}