{"meta":{"query_hash":"65d2aabcbca5","filters":{"venue":"Numerical Linear Algebra with Applications"},"cohort_total":58,"direct_labels_cover":0,"predictions_cover":58,"exported":58,"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/65d2aabcbca5","api":"https://metacan.xera.ac/api/v1/cohort?venue=Numerical+Linear+Algebra+with+Applications"},"results":[{"id":"W1636009176","doi":"10.1002/nla.800","title":"Fast multilevel methods for Markov chains","year":2011,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Israel Science Foundation","keywords":"Markov chain; Speedup; Residual; Mathematics; Algorithm; Iterative method; Markov process; Applied mathematics; Markov model; Computer science; Mathematical optimization; Parallel computing; Statistics","score_opus":0.02959064902754927,"score_gpt":0.3115063589447691,"score_spread":0.2819157099172198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1636009176","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003415907,0.000039574104,0.99537545,0.00031743848,0.000055136006,0.00079190446,0.000018903902,0.00028625253,0.0030811534],"genre_scores_gemma":[0.013262985,0.0000035042372,0.98395413,0.00041045097,0.00014296963,0.0013913515,0.000012906429,0.000022305729,0.0007994059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876183,0.000076333854,0.00023574944,0.0004867673,0.000118072545,0.00032124086],"domain_scores_gemma":[0.99856484,0.00026596244,0.0001066236,0.0007314705,0.0001309546,0.00020012198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032543845,0.00017371215,0.00020235758,0.00006799194,0.00023460985,0.000037882808,0.00086289673,0.00006799283,0.00007006455],"category_scores_gemma":[0.00003482798,0.00013604733,0.00008627922,0.00047635703,0.00008533807,0.00017969272,0.00012332395,0.00014146848,0.000103434446],"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.00001809201,0.00017879638,0.000024816356,0.000012070609,0.0000223752,5.2307354e-7,0.00027422822,0.000010932836,0.00009875528,0.5249048,0.000076467615,0.47437814],"study_design_scores_gemma":[0.0010038085,0.0003840113,0.0009951349,0.000013961778,0.000048874103,0.000039053815,0.00006487803,0.7733704,0.008127021,0.07050986,0.14473568,0.0007073434],"about_ca_topic_score_codex":0.000010132899,"about_ca_topic_score_gemma":4.781751e-7,"teacher_disagreement_score":0.7733594,"about_ca_system_score_codex":0.000017258608,"about_ca_system_score_gemma":0.000056914745,"threshold_uncertainty_score":0.5547849},"labels":[],"label_agreement":null},{"id":"W1796252776","doi":"10.1002/nla.1977","title":"A generalized predictive analysis tool for multigrid methods","year":2015,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Multigrid method; Discretization; Mathematics; Applied mathematics; Computation; Diffusion; Class (philosophy); Convergence (economics); Partial differential equation; Mathematical optimization; Computer science; Mathematical analysis; Algorithm","score_opus":0.03789095206775524,"score_gpt":0.364729005794814,"score_spread":0.32683805372705876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1796252776","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005329447,0.00014615832,0.9971109,0.000098905184,0.00005481959,0.0010318221,0.00007993812,0.00059057033,0.00035396806],"genre_scores_gemma":[0.013823565,0.0000056222675,0.98263216,0.00011868275,0.00021525628,0.0029756106,0.0001050874,0.00006657899,0.000057418252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864495,0.00008196505,0.00040162064,0.0003368744,0.00025402976,0.00028055054],"domain_scores_gemma":[0.9978269,0.0011124827,0.00009192293,0.000412857,0.00031239694,0.00024344808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003164323,0.00023152203,0.00045144677,0.00014438659,0.00008258287,0.000024075342,0.00023492455,0.00008368375,0.000017525364],"category_scores_gemma":[0.000310594,0.00019518235,0.00015073696,0.0016316556,0.00007705384,0.000099637575,0.00003327908,0.00016960061,0.000027692493],"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.00005907904,0.00010594194,0.00016782637,0.000039821014,0.00067006255,4.103312e-7,0.0001368696,0.9521974,0.00012533908,0.014515729,0.00028588885,0.031695686],"study_design_scores_gemma":[0.00052441185,0.000093180985,0.00014971047,0.0000039132806,0.00043577398,0.0000034952172,0.00003317799,0.9417392,0.0007181966,0.03147586,0.024551963,0.00027112922],"about_ca_topic_score_codex":0.0000018989141,"about_ca_topic_score_gemma":3.3477798e-7,"teacher_disagreement_score":0.031424556,"about_ca_system_score_codex":0.00010615217,"about_ca_system_score_gemma":0.000042540523,"threshold_uncertainty_score":0.7959305},"labels":[],"label_agreement":null},{"id":"W1840032205","doi":"10.1002/nla.1823","title":"On condition numbers for Moore–Penrose inverse and linear least squares problem involving Kronecker products","year":2012,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Kronecker product; Mathematics; Kronecker delta; Combinatorics; Moore–Penrose pseudoinverse; Inverse; Rank (graph theory); Linear least squares; Least-squares function approximation; Product (mathematics); Condition number; Applied mathematics; Upper and lower bounds; Matrix (chemical analysis); Linear model; Statistics; Mathematical analysis; Geometry","score_opus":0.012650691698895641,"score_gpt":0.25487471741778867,"score_spread":0.242224025718893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1840032205","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.013605905,0.0001248629,0.9820059,0.0017899696,0.00007014475,0.0015982287,0.000039082246,0.0002164166,0.0005494903],"genre_scores_gemma":[0.54350823,0.0000092740365,0.45378736,0.00065597927,0.00046045356,0.0011229692,0.00009648554,0.00003407266,0.0003252162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858356,0.00005546886,0.00023999387,0.0004947847,0.00022327113,0.00040292737],"domain_scores_gemma":[0.99875337,0.00020867665,0.00013458777,0.0005004554,0.00014466507,0.00025825872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028401217,0.00020969175,0.00019864981,0.00007839806,0.0003354203,0.000073803814,0.00031952123,0.00007583786,0.000024450806],"category_scores_gemma":[0.000053275337,0.00017065622,0.000041637664,0.0005284875,0.00013510203,0.0005492612,0.00009370284,0.00019024806,0.0001709262],"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.00007128906,0.0006876302,0.001039896,0.00014687244,0.000050479375,0.0000010249084,0.0009125687,0.0005707205,0.0006301033,0.9773323,0.001642078,0.016915014],"study_design_scores_gemma":[0.006366896,0.002467549,0.0053646974,0.00030645408,0.00029617897,0.00022361576,0.0007537159,0.45563403,0.02330247,0.14552207,0.35622805,0.0035342737],"about_ca_topic_score_codex":0.000008707094,"about_ca_topic_score_gemma":0.0000015014508,"teacher_disagreement_score":0.83181024,"about_ca_system_score_codex":0.000034257897,"about_ca_system_score_gemma":0.00005852814,"threshold_uncertainty_score":0.6959158},"labels":[],"label_agreement":null},{"id":"W1919986261","doi":"10.1002/nla.1845","title":"The power and Arnoldi methods in an algebra of circulants","year":2012,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Centre International de Recherche sur le Cancer","keywords":"Mathematics; Circulant matrix; Algebra over a field; Linear algebra; Scalar (mathematics); Dimension (graph theory); Matrix (chemical analysis); Numerical linear algebra; Pure mathematics; Discrete mathematics; Numerical analysis; Mathematical analysis","score_opus":0.03708464711442809,"score_gpt":0.37598441701929824,"score_spread":0.33889976990487014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1919986261","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.242032,0.0004009398,0.75200653,0.0014099258,0.00002797471,0.0013242192,0.00003430971,0.00015772006,0.002606354],"genre_scores_gemma":[0.74908537,0.000015567342,0.25013664,0.00012000615,0.000047192607,0.0005119505,0.000011481376,0.000025347312,0.00004642586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885803,0.00012297905,0.00036401,0.00021451188,0.00016423837,0.0002762274],"domain_scores_gemma":[0.99834436,0.0006514193,0.00015734573,0.0005694801,0.00008783151,0.00018958496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038731046,0.00013864195,0.00021993087,0.000057428613,0.00017978283,0.000023353421,0.00021811934,0.000069797556,0.00004675104],"category_scores_gemma":[0.000052221894,0.00009383253,0.000040115276,0.00047673975,0.00017578992,0.00012074612,0.000043115084,0.00018625858,0.000023272989],"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.000026521804,0.0008466564,0.011723865,0.000022423765,0.000037720183,2.2810802e-7,0.000569194,0.0000057784964,0.0035201549,0.9642148,0.00018425864,0.018848388],"study_design_scores_gemma":[0.002987082,0.0005433368,0.33808476,0.000094276416,0.00036242855,0.00020399732,0.0028493237,0.007678473,0.013651239,0.4646793,0.16716154,0.0017042627],"about_ca_topic_score_codex":0.000008217239,"about_ca_topic_score_gemma":0.000004881106,"teacher_disagreement_score":0.5070534,"about_ca_system_score_codex":0.00001933338,"about_ca_system_score_gemma":0.000022952061,"threshold_uncertainty_score":0.38263795},"labels":[],"label_agreement":null},{"id":"W1976129499","doi":"10.1002/nla.715","title":"Numerical optimization for constrained image registration","year":2010,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Solver; Image registration; Augmented Lagrangian method; Discretization; Multigrid method; Constraint (computer-aided design); Focus (optics); Domain (mathematical analysis); Mathematical optimization; Image (mathematics); Computer science; Matching (statistics); Volume (thermodynamics); Algorithm; Mathematics; Artificial intelligence; Geometry; Partial differential equation","score_opus":0.01219782384400975,"score_gpt":0.2882343383597085,"score_spread":0.27603651451569877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976129499","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025041672,0.000013090838,0.9951151,0.00039178264,0.000108997425,0.001077202,0.000044504355,0.0007139595,0.0022849373],"genre_scores_gemma":[0.09777021,0.0000036087552,0.9002548,0.000109856286,0.0003162925,0.0012872373,0.00014526992,0.000081859616,0.000030914467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869996,0.000019506455,0.00042066217,0.00032848958,0.00024037353,0.00029102876],"domain_scores_gemma":[0.9983589,0.00070495374,0.00011381857,0.0003859229,0.000247316,0.00018908095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013619101,0.00024001642,0.000268598,0.00006823832,0.00016262651,0.000047760463,0.00022472366,0.00012443266,0.00011720658],"category_scores_gemma":[0.00023991702,0.00021959817,0.00007469601,0.0005538598,0.0001639555,0.00017842426,0.000013787119,0.00035192777,0.00004592704],"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.000040770494,0.00019264821,0.000026405382,0.00014392122,0.0000592502,0.0000011032157,0.000050415838,0.86992764,0.004343827,0.0923444,0.0003949758,0.03247464],"study_design_scores_gemma":[0.00038373895,0.00007794253,0.00003069625,0.000007698362,0.00003262957,0.000025798856,0.000015302005,0.9694878,0.0016267268,0.017211879,0.010796569,0.00030322812],"about_ca_topic_score_codex":0.0000010644337,"about_ca_topic_score_gemma":4.4606298e-7,"teacher_disagreement_score":0.09956016,"about_ca_system_score_codex":0.000036478606,"about_ca_system_score_gemma":0.000047665235,"threshold_uncertainty_score":0.8954953},"labels":[],"label_agreement":null},{"id":"W1983085277","doi":"10.1002/nla.642","title":"A twisted factorization method for symmetric SVD of a complex symmetric tridiagonal matrix","year":2009,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Tridiagonal matrix; Orthogonality; Singular value decomposition; Mathematics; Matrix decomposition; QR decomposition; Singular value; Factorization; FLOPS; Matrix (chemical analysis); Divide and conquer algorithms; Symmetric matrix; Applied mathematics; Incomplete LU factorization; Algebra over a field; Algorithm; Pure mathematics; Computer science; Parallel computing; Geometry","score_opus":0.02501987492455005,"score_gpt":0.33267217644731356,"score_spread":0.3076523015227635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983085277","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000118157324,0.00006731683,0.9953083,0.001753257,0.000015603106,0.0014658553,0.000041395073,0.00045165248,0.000778486],"genre_scores_gemma":[0.3175755,0.0000062288177,0.68133324,0.00049293105,0.00005470637,0.00036583294,0.00009566141,0.000014158492,0.00006174118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981656,0.00010870458,0.00052591535,0.0005053128,0.00042243354,0.0002720276],"domain_scores_gemma":[0.9977777,0.0005855852,0.0003635708,0.0006339325,0.00048264526,0.00015656155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036756528,0.00020644687,0.00036950814,0.0006139181,0.00013742979,0.00007510364,0.0007205276,0.0001132266,0.000011337491],"category_scores_gemma":[0.0001399926,0.00017920272,0.00012677845,0.00533415,0.00003976561,0.00025444038,0.000051008377,0.00016511836,0.000016566268],"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.000030295521,0.00040087706,0.000058335383,0.000018795887,0.000026352622,2.5223204e-7,0.00010484367,0.00033709942,0.0014942,0.9176541,0.00038820202,0.079486646],"study_design_scores_gemma":[0.0018404116,0.0017881984,0.008089424,0.000021969574,0.00009815367,0.000032056825,0.000025649217,0.82252276,0.016721614,0.07299253,0.075129904,0.00073729776],"about_ca_topic_score_codex":0.000015564632,"about_ca_topic_score_gemma":6.410773e-7,"teacher_disagreement_score":0.84466153,"about_ca_system_score_codex":0.00005977974,"about_ca_system_score_gemma":0.0001474642,"threshold_uncertainty_score":0.7307675},"labels":[],"label_agreement":null},{"id":"W1984710842","doi":"10.1002/nla.240","title":"Lanczos, Householder transformations, and implicit deflation for fast and reliable dominant singular subspace computation","year":2001,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of California, San Diego; California State University San Marcos; McGill University; University of California Berkeley","keywords":"Lanczos resampling; Lanczos algorithm; Linear subspace; Mathematics; Computation; Krylov subspace; Subspace topology; Matrix (chemical analysis); Singular value; Signal subspace; Algorithm; Numerical linear algebra; Applied mathematics; Algebra over a field; Sparse matrix; Singular spectrum analysis; Singular value decomposition; Eigenvalues and eigenvectors; Pure mathematics; Mathematical analysis; Computer science; Numerical analysis; Iterative method; Noise (video); Artificial intelligence","score_opus":0.009264214916319834,"score_gpt":0.24281266378439495,"score_spread":0.2335484488680751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984710842","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.01042607,0.00018112721,0.986819,0.0013710725,0.000016929707,0.0008147849,0.000011469708,0.00013772064,0.00022182541],"genre_scores_gemma":[0.50234616,0.00007875192,0.49653932,0.00032461362,0.0000957372,0.00045003885,0.000052319498,0.000021872027,0.000091203554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990791,0.00002334288,0.00021665293,0.0003336665,0.00013356237,0.00021367194],"domain_scores_gemma":[0.999326,0.00013708876,0.000090734575,0.00022446478,0.00009763661,0.00012405758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017521944,0.00013912964,0.00016509915,0.000071824106,0.00036544452,0.000117473974,0.00014724387,0.000058724756,0.0000028485763],"category_scores_gemma":[0.000008924587,0.00011694886,0.00002695386,0.00043010592,0.000059413393,0.00037144896,0.0000304352,0.00009099796,0.000008172351],"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.00012958856,0.000323952,0.0022907597,0.00015557936,0.0000625971,0.0000032186806,0.0013456888,0.003923623,0.001040933,0.6521277,0.00039706207,0.33819932],"study_design_scores_gemma":[0.0015122173,0.0002503428,0.0029848735,0.000028570841,0.00005373423,0.00015993303,0.000110984605,0.9023059,0.00090807123,0.039775454,0.05148076,0.00042915504],"about_ca_topic_score_codex":0.0000132504265,"about_ca_topic_score_gemma":0.0000027091676,"teacher_disagreement_score":0.8983823,"about_ca_system_score_codex":0.000016782653,"about_ca_system_score_gemma":0.00002942352,"threshold_uncertainty_score":0.47690362},"labels":[],"label_agreement":null},{"id":"W1992234740","doi":"10.1002/nla.782","title":"Parallel numerical solution of the time‐harmonic Maxwell equations in mixed form","year":2011,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multigrid method; Discretization; Mathematics; Curl (programming language); Solver; Finite element method; Preconditioner; Maxwell's equations; Polygon mesh; Iterative method; Applied mathematics; Electromagnetic field solver; Mathematical analysis; Partial differential equation; Algorithm; Geometry; Computer science; Mathematical optimization; Physics","score_opus":0.030253191888310074,"score_gpt":0.26643519081247596,"score_spread":0.2361819989241659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992234740","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001601731,0.00006808249,0.9950101,0.00014106922,0.0000473978,0.00070832326,0.000017990462,0.00018486407,0.0022204593],"genre_scores_gemma":[0.46260884,0.000006225084,0.5367922,0.000046432295,0.000034267694,0.00041756238,0.000017844597,0.00004032839,0.00003624521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998557,0.00006390029,0.0005369535,0.0002459606,0.00029668314,0.0002995557],"domain_scores_gemma":[0.99866676,0.0005100722,0.00014272542,0.00048149886,0.00009650366,0.0001024522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014510524,0.00020866582,0.00030279334,0.000085390726,0.00008987908,0.0000066180883,0.00040579468,0.00009221591,0.000090430665],"category_scores_gemma":[0.00011444682,0.00015736831,0.000094352305,0.0012043813,0.00014673572,0.00011381649,0.000071449176,0.00032070716,0.00011027667],"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.00022566736,0.0028646314,0.003184434,0.00050391484,0.00038240364,0.0000055328806,0.002409319,0.5307047,0.00519775,0.32914716,0.00062508986,0.1247494],"study_design_scores_gemma":[0.0004805518,0.0000911713,0.0058018453,0.000041901927,0.00005336115,0.000010438343,0.000042864092,0.89250314,0.002304863,0.09662416,0.0016932078,0.00035247317],"about_ca_topic_score_codex":0.000010300601,"about_ca_topic_score_gemma":0.0000016864694,"teacher_disagreement_score":0.46100712,"about_ca_system_score_codex":0.000098965626,"about_ca_system_score_gemma":0.000045442976,"threshold_uncertainty_score":0.64172935},"labels":[],"label_agreement":null},{"id":"W2010972644","doi":"10.1002/nla.701","title":"A simultaneous decomposition of a matrix triplet with applications","year":2010,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Shanghai Municipal Education Commission; McGill University; Natural Science Foundation of Shanghai","keywords":"Hermitian matrix; Mathematics; Matrix (chemical analysis); Decomposition; Matrix function; Matrix decomposition; Pure mathematics; Applied mathematics; Algebra over a field; Symmetric matrix; Eigenvalues and eigenvectors; Physics; Quantum mechanics; Chemistry","score_opus":0.004614076783061271,"score_gpt":0.25739552059739856,"score_spread":0.2527814438143373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010972644","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.00317869,0.00002939705,0.9936545,0.0006671282,0.00002125707,0.0010602884,0.000035050012,0.0002755975,0.0010780738],"genre_scores_gemma":[0.5314837,0.0000030868182,0.46724564,0.00010391847,0.00012038072,0.0008634891,0.000033148943,0.000018397199,0.00012823741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985169,0.00003969587,0.00033697384,0.0005045597,0.00032293942,0.00027892075],"domain_scores_gemma":[0.9979166,0.0003642488,0.00022877747,0.0010262021,0.00024977807,0.00021443385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014948797,0.00020621641,0.00026390856,0.00011379654,0.00023635833,0.000061381135,0.00085624063,0.0000925264,0.000058006055],"category_scores_gemma":[0.000016398617,0.00015547057,0.00006501487,0.0012850354,0.00018612528,0.00019557118,0.000088080415,0.00034862146,0.00013565522],"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.00009456636,0.0008307124,0.00019445796,0.000053977918,0.000063896856,0.0000072699445,0.00015004183,0.0021034444,0.0063448725,0.93281907,0.0000534225,0.057284288],"study_design_scores_gemma":[0.0035385536,0.0015839319,0.00062238734,0.00006037036,0.00024110125,0.00081602,0.00010828212,0.60580224,0.02525229,0.053573646,0.3066118,0.0017893887],"about_ca_topic_score_codex":0.000014270656,"about_ca_topic_score_gemma":0.000006465971,"teacher_disagreement_score":0.8792454,"about_ca_system_score_codex":0.000015348594,"about_ca_system_score_gemma":0.00012013886,"threshold_uncertainty_score":0.6339906},"labels":[],"label_agreement":null},{"id":"W2013095747","doi":"10.1002/nla.242","title":"A divide and conquer approach to computing the mean first passage matrix for Markov chains via Perron complement reductions","year":2001,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Markov chain; FLOPS; Block matrix; Partition (number theory); Matrix multiplication; Combinatorics; Ergodic theory; Complement (music); Matrix (chemical analysis); Divide and conquer algorithms; Diagonal; Discrete mathematics; Computation; Algorithm; Parallel computing; Computer science; Pure mathematics","score_opus":0.015150813886271673,"score_gpt":0.2651078357017424,"score_spread":0.24995702181547072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013095747","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.00076085655,0.000058001795,0.9861799,0.010106561,0.000038329985,0.0017787566,0.000026261298,0.00017952803,0.0008718287],"genre_scores_gemma":[0.6006911,0.000008741616,0.39661592,0.00069243385,0.0003600729,0.0011474924,0.00003903499,0.00002373757,0.00042148452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984779,0.000066347224,0.00028989415,0.0005599739,0.00022625562,0.00037965062],"domain_scores_gemma":[0.9986157,0.00029495117,0.000107596985,0.00065683917,0.00010576033,0.00021917735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003876906,0.0002002266,0.00021242256,0.00006656005,0.0010064333,0.00013758538,0.0006427698,0.000042519536,0.000013819387],"category_scores_gemma":[0.00001641029,0.00013958987,0.000061296596,0.00071331416,0.00012259487,0.00011523574,0.0002366975,0.00016987209,0.00002480541],"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.00005371554,0.00062162534,0.00033586632,0.00006234043,0.00010479608,0.0000014864552,0.0023853036,0.0047820373,0.000087771856,0.9142891,0.0021626088,0.075113334],"study_design_scores_gemma":[0.0006676567,0.0002231466,0.0008331876,0.000017165923,0.000054376993,0.00014568627,0.00027132742,0.6974167,0.00006346448,0.009246784,0.29062596,0.000434514],"about_ca_topic_score_codex":0.00003151655,"about_ca_topic_score_gemma":0.000007996586,"teacher_disagreement_score":0.90504235,"about_ca_system_score_codex":0.000038621034,"about_ca_system_score_gemma":0.000031423813,"threshold_uncertainty_score":0.7740773},"labels":[],"label_agreement":null},{"id":"W2018978449","doi":"10.1002/nla.640","title":"Backward perturbation analysis for scaled total least‐squares problems","year":2009,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Statistical and numerical algorithms","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Ordinary least squares; Mathematics; Perturbation (astronomy); Upper and lower bounds; Least-squares function approximation; Applied mathematics; Mathematical optimization; Statistics; Mathematical analysis","score_opus":0.028432037537596853,"score_gpt":0.302662501843118,"score_spread":0.2742304643055211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018978449","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026837154,0.000048960548,0.99239504,0.0022415728,0.000016570908,0.0013448304,0.00013778292,0.0002710067,0.00086049724],"genre_scores_gemma":[0.4392954,0.000005538763,0.556945,0.0004348287,0.00033044428,0.0013085788,0.00030092866,0.000041030922,0.0013382431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807566,0.000042941803,0.0004956419,0.0005640023,0.0003953582,0.0004263937],"domain_scores_gemma":[0.9980422,0.00075387006,0.00017585818,0.00044849713,0.00028826602,0.00029128743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013610371,0.00027902372,0.0005328856,0.00013312584,0.00025678967,0.000057310495,0.00022702478,0.00011534797,0.00021122351],"category_scores_gemma":[0.0002095654,0.00020434817,0.00024971637,0.0015901355,0.0001045979,0.000102641076,0.000022453729,0.00019429845,0.00009011844],"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.00048640795,0.0034248733,0.0015513923,0.00019971027,0.0012019566,0.000003858985,0.00046596414,0.0025457912,0.00045261593,0.823788,0.0030440378,0.16283539],"study_design_scores_gemma":[0.0020710202,0.0018460378,0.0140081,0.000037408066,0.00227307,0.000025126017,0.00011224881,0.29328367,0.00047520403,0.66308194,0.021567635,0.0012185277],"about_ca_topic_score_codex":0.000009526064,"about_ca_topic_score_gemma":0.0000026701068,"teacher_disagreement_score":0.43661168,"about_ca_system_score_codex":0.00005065145,"about_ca_system_score_gemma":0.00004016497,"threshold_uncertainty_score":0.8333076},"labels":[],"label_agreement":null},{"id":"W2056707245","doi":"10.1002/nla.258","title":"On the growth factor in Gaussian elimination for generalized Higham matrices","year":2002,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Gaussian elimination; Hermitian matrix; Mathematics; Positive-definite matrix; Matrix (chemical analysis); Gaussian; Combinatorics; Class (philosophy); Factor (programming language); Upper and lower bounds; Pure mathematics; Mathematical analysis; Physics; Computer science; Chemistry; Computational chemistry","score_opus":0.01661374818348609,"score_gpt":0.2450198333137332,"score_spread":0.2284060851302471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056707245","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.0033053958,0.0000593501,0.98454875,0.009927425,0.00003338033,0.0009015914,0.00001836191,0.00013671366,0.0010690505],"genre_scores_gemma":[0.8873215,0.00002574186,0.10934124,0.0010923396,0.00017151104,0.0016088473,0.000013939015,0.000019857454,0.0004050274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989392,0.000063353946,0.00020916182,0.0003482011,0.00020633981,0.00023374862],"domain_scores_gemma":[0.99884874,0.00047020087,0.00009908132,0.0004350247,0.000068428104,0.000078556164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013044363,0.00014023844,0.00013881647,0.00009320819,0.00020817286,0.000082753184,0.0006317405,0.000051186,0.00010809554],"category_scores_gemma":[0.000043406177,0.00008679354,0.000052884458,0.0008296615,0.000043594988,0.00015880005,0.00004146391,0.00013826275,0.00014545543],"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.000009372258,0.00016129616,0.000029617204,0.000009124406,0.000007005121,5.728335e-7,0.00012359806,0.00009221931,0.00003405858,0.9865963,0.00041774375,0.012519131],"study_design_scores_gemma":[0.001472485,0.00047755693,0.0020222827,0.0000276199,0.00002684389,0.000012487646,0.000039267336,0.80545056,0.0025729123,0.14981095,0.03747532,0.00061173656],"about_ca_topic_score_codex":0.000008931739,"about_ca_topic_score_gemma":0.000001535676,"teacher_disagreement_score":0.8840161,"about_ca_system_score_codex":0.000030174038,"about_ca_system_score_gemma":0.000013450309,"threshold_uncertainty_score":0.35393375},"labels":[],"label_agreement":null},{"id":"W2063957170","doi":"10.1002/nla.521","title":"Mathematical Modelling and Mathematical Methods in Energy","year":2006,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Fundação Araucária","keywords":"Library science; Bachelor; Mathematics; Operations research; Geography; Computer science; Archaeology","score_opus":0.013189107157339524,"score_gpt":0.2776829384344822,"score_spread":0.2644938312771427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063957170","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024142655,0.0001183477,0.9942882,0.00056821486,0.000007000414,0.00019592066,0.000001705006,0.00014494639,0.0044342414],"genre_scores_gemma":[0.04181817,0.000007020457,0.9574242,0.00015626618,0.000079345715,0.00027814155,0.000004442754,0.0000163215,0.00021605482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986691,0.00009653496,0.00034846162,0.00041708647,0.00018853204,0.00028032425],"domain_scores_gemma":[0.99888945,0.00041202502,0.000068980175,0.00046713112,0.000039358772,0.00012305976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033057533,0.00016500567,0.00026008056,0.00009264321,0.00010344447,0.00007522156,0.00038265574,0.00007530382,0.000038808834],"category_scores_gemma":[0.000010665018,0.00012764074,0.000038777966,0.00064008054,0.00010242017,0.0001643655,0.00011932706,0.0001642599,0.000050461],"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.000003407523,0.00017366327,0.000010892352,0.000016905335,0.0000045457286,0.0000028407524,0.00003625156,0.0060507962,0.00003937361,0.9802117,0.000013255276,0.013436421],"study_design_scores_gemma":[0.00011568011,0.00001780614,0.000008517883,0.000008054924,0.0000048239212,0.00002897173,0.0000056425015,0.5356194,0.00032137704,0.46084794,0.0029141991,0.000107614316],"about_ca_topic_score_codex":0.000015597394,"about_ca_topic_score_gemma":6.7848606e-7,"teacher_disagreement_score":0.52956855,"about_ca_system_score_codex":0.000018305758,"about_ca_system_score_gemma":0.0000295553,"threshold_uncertainty_score":0.5205038},"labels":[],"label_agreement":null},{"id":"W2067594519","doi":"10.1002/nla.428","title":"Asymptotic properties of the <i>QR</i> factorization of banded Hessenberg–Toeplitz matrices","year":2005,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Toeplitz matrix; Mathematics; QR decomposition; Factorization; Diagonal; Matrix decomposition; Matrix (chemical analysis); Combinatorics; Applied mathematics; Algebra over a field; Pure mathematics; Algorithm; Eigenvalues and eigenvectors; Geometry","score_opus":0.008905594285361623,"score_gpt":0.21267136045333165,"score_spread":0.20376576616797004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067594519","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.01022198,0.00021607375,0.987137,0.0011376007,0.00003337149,0.0004852232,0.000008571285,0.0000853865,0.00067477603],"genre_scores_gemma":[0.957874,0.000012128202,0.04164734,0.00010501668,0.00009497768,0.0000905513,0.0000029010591,0.000010240425,0.00016282526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989065,0.000060389684,0.00032523484,0.00024690074,0.00030358555,0.00015738908],"domain_scores_gemma":[0.998812,0.00007238123,0.00024487122,0.00064915273,0.00016074756,0.0000608285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119804645,0.00012320893,0.00018855833,0.000046803023,0.00012470142,0.000024151404,0.0007844951,0.000047954938,0.0000179099],"category_scores_gemma":[0.000021104162,0.00007249413,0.00006723402,0.0009535705,0.00013279027,0.00021839348,0.000114743336,0.00010786986,0.000022834283],"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.00006196437,0.0011288241,0.0029802204,0.00029056548,0.00012651728,3.6656152e-7,0.0013247894,0.007301954,0.022466384,0.90195215,0.00017480754,0.062191457],"study_design_scores_gemma":[0.0016623407,0.00042989675,0.006127289,0.00024018656,0.0001780333,0.00004186799,0.00015249614,0.18434416,0.7130809,0.023389421,0.06934007,0.0010133567],"about_ca_topic_score_codex":0.000013372547,"about_ca_topic_score_gemma":0.0000015380077,"teacher_disagreement_score":0.94765204,"about_ca_system_score_codex":0.000017609165,"about_ca_system_score_gemma":0.00008516853,"threshold_uncertainty_score":0.29562247},"labels":[],"label_agreement":null},{"id":"W2099359799","doi":"10.1002/nla.515","title":"Preconditioners for the discretized time‐harmonic Maxwell equations in mixed form","year":2007,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Electromagnetic Scattering and Analysis","field":"Physics and Astronomy","cited_by":106,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Discretization; Schur complement; Eigenvalues and eigenvectors; Finite element method; Applied mathematics; Maxwell's equations; Saddle point; Saddle; Mathematical analysis; Mathematical optimization; Geometry; Physics","score_opus":0.006816845117285113,"score_gpt":0.24769655799835003,"score_spread":0.2408797128810649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099359799","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.010269653,0.000030483545,0.9851048,0.002013191,0.0000102174145,0.00073445874,0.00005239845,0.00004132807,0.0017434922],"genre_scores_gemma":[0.9846844,0.0000014197454,0.0120149935,0.00013539441,0.00020897831,0.0013374699,0.0005526612,0.000022963493,0.0010416933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907434,0.000014297706,0.0002563388,0.00023904187,0.00011694591,0.00029903124],"domain_scores_gemma":[0.9989317,0.0005601726,0.00009268005,0.0002867673,0.00004922624,0.000079473866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020225135,0.00012583763,0.00015381843,0.0000649938,0.00022905646,0.000031189655,0.00019404592,0.000027779144,0.00031800286],"category_scores_gemma":[0.000007672471,0.00008716616,0.000101075995,0.0005614321,0.00006950387,0.000050006034,0.000017504386,0.0001369445,0.00008039531],"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.00048410703,0.0028181854,0.017667431,0.0000697932,0.0014612887,0.0000016205573,0.0012102183,0.0067972196,0.019977374,0.41559333,0.006537739,0.5273817],"study_design_scores_gemma":[0.010403514,0.001258962,0.0541955,0.000109325956,0.001947411,0.000009776922,0.002650129,0.532367,0.025457054,0.12987447,0.23883672,0.0028901722],"about_ca_topic_score_codex":0.000070857874,"about_ca_topic_score_gemma":0.000017373104,"teacher_disagreement_score":0.97441477,"about_ca_system_score_codex":0.000025732055,"about_ca_system_score_gemma":0.000041313433,"threshold_uncertainty_score":0.35545328},"labels":[],"label_agreement":null},{"id":"W2104744926","doi":"10.1002/nla.622","title":"Numerical solution of large‐scale Lyapunov equations, Riccati equations, and linear‐quadratic optimal control problems","year":2008,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":344,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Algebraic Riccati equation; Mathematics; Cholesky decomposition; Linear-quadratic regulator; Riccati equation; Lyapunov equation; Linear-quadratic-Gaussian control; Linear system; Applied mathematics; Lyapunov function; Optimal control; Mathematical optimization; Differential equation; Mathematical analysis; Nonlinear system","score_opus":0.014646296012564404,"score_gpt":0.2505833551941164,"score_spread":0.235937059181552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104744926","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.011328332,0.00017826897,0.9858865,0.0009566158,0.00002904279,0.0009770945,0.00007594128,0.00008783016,0.00048035837],"genre_scores_gemma":[0.9670925,0.000021064898,0.031114561,0.00012744556,0.00033723997,0.000779829,0.000249752,0.000035667228,0.00024194315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982565,0.00008741492,0.0005498402,0.00044986658,0.00029798792,0.0003583776],"domain_scores_gemma":[0.9986252,0.00024741507,0.00028970075,0.00038146545,0.00022318403,0.00023298929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012872621,0.00024680432,0.00037917987,0.000086750224,0.00047763414,0.000018924628,0.00016513924,0.000081485385,0.00022011352],"category_scores_gemma":[0.000016310223,0.00021087023,0.000101091835,0.00065332383,0.00020694047,0.00018483002,0.00003580463,0.00029999556,0.00006986359],"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.0006199517,0.009695048,0.07125976,0.00027885908,0.0010800508,0.000004237592,0.003812341,0.5084563,0.003976566,0.33566055,0.0036123882,0.061543968],"study_design_scores_gemma":[0.0014102914,0.00018715634,0.0011101324,0.00002167028,0.0001059147,0.000008141072,0.00013108013,0.9899899,0.0004135699,0.00088999467,0.0053871367,0.00034500603],"about_ca_topic_score_codex":0.00008205155,"about_ca_topic_score_gemma":0.0000014360367,"teacher_disagreement_score":0.9557642,"about_ca_system_score_codex":0.000023523018,"about_ca_system_score_gemma":0.00012221684,"threshold_uncertainty_score":0.8599039},"labels":[],"label_agreement":null},{"id":"W2105813930","doi":"10.1002/nla.730","title":"A note on simultaneous preconditioning and symmetrization of non-symmetric linear systems","year":2010,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts","keywords":"Symmetrization; Mathematics; Duality (order theory); Applied mathematics; Partial differential equation; Linear system; Scheme (mathematics); Iterative method; Mathematical optimization; Mathematical analysis; Pure mathematics","score_opus":0.008644112826970859,"score_gpt":0.2754375070949733,"score_spread":0.2667933942680024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105813930","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.015807841,0.00004565699,0.9821517,0.00003420548,0.00010276822,0.00064220553,0.00004083368,0.00022502932,0.0009497605],"genre_scores_gemma":[0.57900393,0.000008682203,0.42059636,0.000021429178,0.00011777199,0.00017544178,0.00002429455,0.000040797608,0.000011283396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988359,0.000022838633,0.00040501764,0.0002656973,0.00027544983,0.0001950514],"domain_scores_gemma":[0.9971131,0.0020896934,0.00014166362,0.00031198037,0.00019922304,0.00014434523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012017648,0.00019949279,0.00030624942,0.00017228165,0.000097432494,0.000020839818,0.00015232163,0.000114373426,0.000011624381],"category_scores_gemma":[0.00044424087,0.00017748013,0.000035732537,0.0012847445,0.00009965731,0.00008241067,0.000024644964,0.00039397037,0.000036447225],"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.00001846027,0.00014819292,0.00011809421,0.00024196779,0.00004688016,0.0000012326003,0.000073023424,0.91023123,0.0022439456,0.025214836,0.000011390709,0.061650716],"study_design_scores_gemma":[0.00025888896,0.00014376848,0.00029241497,0.000038179307,0.000032818745,0.000020526024,0.000015872827,0.9928413,0.0020935424,0.0024376924,0.0016050506,0.00021994908],"about_ca_topic_score_codex":0.0000034020115,"about_ca_topic_score_gemma":4.140443e-7,"teacher_disagreement_score":0.5631961,"about_ca_system_score_codex":0.000029321376,"about_ca_system_score_gemma":0.00001770311,"threshold_uncertainty_score":0.72374296},"labels":[],"label_agreement":null},{"id":"W2108510172","doi":"10.1002/nla.1995","title":"Spectral recycling strategies for the solution of nonlinear eigenproblems in thermoacoustics","year":2015,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Combustion and flame dynamics","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Krylov subspace; Solver; Nonlinear system; Generalized minimal residual method; Eigenvalues and eigenvectors; Block (permutation group theory); Chebyshev filter; Arnoldi iteration; Mathematics; Stability (learning theory); Computer science; Applied mathematics; Integrator; Mathematical optimization; Iterative method; Algorithm; Mathematical analysis","score_opus":0.019942057817476946,"score_gpt":0.24856257842710666,"score_spread":0.22862052060962973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108510172","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.00764129,0.0001741388,0.9905128,0.00018169063,0.000047891117,0.00059155835,0.000038610335,0.000116478965,0.00069556566],"genre_scores_gemma":[0.9263999,0.00004043036,0.07297503,0.000027573498,0.00012109924,0.00031568218,0.000060250884,0.000032414577,0.000027638565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993291,0.000009287093,0.0002437846,0.0001210243,0.00012127263,0.00017552952],"domain_scores_gemma":[0.9994522,0.00012399816,0.000044237568,0.0002228163,0.00009578807,0.000060964696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013548277,0.00010540135,0.00013734186,0.00004580526,0.000046151734,0.000018118433,0.00015245202,0.000057260662,0.0000061184687],"category_scores_gemma":[0.000017317747,0.00007723008,0.00003768214,0.00038176315,0.00006694923,0.000057587775,0.000012596098,0.00016361721,0.000008276928],"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.00003657582,0.0000852808,0.000262273,0.000042827527,0.00003032546,2.4300041e-7,0.0003087036,0.9752405,0.0006253529,0.014948468,0.00015923487,0.008260175],"study_design_scores_gemma":[0.00033734608,0.000052114232,0.0003017031,0.000009362933,0.000024475217,0.0000024317858,0.00043883582,0.9918647,0.00012281189,0.0026951437,0.0040440545,0.00010701813],"about_ca_topic_score_codex":0.00002483551,"about_ca_topic_score_gemma":0.000048548998,"teacher_disagreement_score":0.9187586,"about_ca_system_score_codex":0.000049144666,"about_ca_system_score_gemma":0.00007112605,"threshold_uncertainty_score":0.31493512},"labels":[],"label_agreement":null},{"id":"W2111507332","doi":"10.1002/nla.1837","title":"Steepest descent preconditioning for nonlinear GMRES optimization","year":2012,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Generalized minimal residual method; Mathematics; Gradient descent; Method of steepest descent; Nonlinear conjugate gradient method; Mathematical optimization; Conjugate gradient method; Optimization problem; Line search; Convergence (economics); Nonlinear system; Applied mathematics; Iterative method; Computer science; Artificial neural network","score_opus":0.04170620897805142,"score_gpt":0.35198990765666077,"score_spread":0.31028369867860933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111507332","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029565336,0.00006831001,0.9961181,0.0003816674,0.00003710671,0.0019963388,0.000116737305,0.00027094348,0.0007151336],"genre_scores_gemma":[0.01178745,0.000023468452,0.9833593,0.00013751174,0.0005581589,0.0028483463,0.0004822027,0.00009843528,0.0007051202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831086,0.000049202194,0.0003951069,0.00034713352,0.0003565834,0.00054110884],"domain_scores_gemma":[0.99799746,0.00059683435,0.00019699216,0.000460731,0.00043050217,0.00031749453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024654734,0.00021696546,0.0002536621,0.00011582225,0.00038711895,0.00006541651,0.00024866188,0.0001043963,0.00026322991],"category_scores_gemma":[0.00032831533,0.00018959405,0.000074191084,0.0006316193,0.00010225128,0.00064563105,0.00005592491,0.00020992695,0.00006505623],"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.0003097042,0.0040544327,0.002777867,0.00046555971,0.00033912528,9.215976e-7,0.00073409826,0.5936372,0.00012356322,0.36541003,0.0026916275,0.02945586],"study_design_scores_gemma":[0.0019661325,0.00029451016,0.00028289665,0.000056895176,0.00016897613,0.000035736284,0.00029592947,0.914285,0.002033533,0.0066419505,0.073089495,0.00084896246],"about_ca_topic_score_codex":0.000002050919,"about_ca_topic_score_gemma":0.0000011327633,"teacher_disagreement_score":0.35876808,"about_ca_system_score_codex":0.00011112079,"about_ca_system_score_gemma":0.000080180056,"threshold_uncertainty_score":0.7731421},"labels":[],"label_agreement":null},{"id":"W2113559515","doi":"10.1002/nla.757","title":"An efficient hierarchical preconditioner for quadratic discretizations of finite element problems","year":2010,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Preconditioner; Multigrid method; Krylov subspace; Finite element method; Discretization; Solver; Mathematics; Applied mathematics; Mathematical optimization; Robustness (evolution); Iterative method; Linear system; Polygon mesh; Computer science; Quadratic equation; Algorithm; Partial differential equation; Mathematical analysis","score_opus":0.011515731695473921,"score_gpt":0.2890850281962522,"score_spread":0.2775692965007783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113559515","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040946137,0.000012246101,0.99369824,0.00014313552,0.000056546665,0.001331916,0.00015504676,0.00024731745,0.00026096014],"genre_scores_gemma":[0.39141634,0.0000013227983,0.6066944,0.000028006554,0.00009086659,0.0015690277,0.00015066002,0.0000409464,0.00000845007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878526,0.000026943751,0.00046521818,0.00026114009,0.00023321803,0.00022821911],"domain_scores_gemma":[0.99824303,0.00087651133,0.000107363914,0.0004130918,0.000185154,0.0001748382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001366575,0.00017942699,0.00024785777,0.00008453638,0.00012617532,0.000018527144,0.00023202361,0.00007305757,0.00007617597],"category_scores_gemma":[0.0001174834,0.00015094415,0.000060559596,0.00048402234,0.00015294003,0.000090019574,0.000017497934,0.0002612528,0.0000156231],"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.000007924898,0.0003071057,0.00005564941,0.000120709985,0.000030114017,6.7320265e-8,0.00011129415,0.8713083,0.0019353622,0.12189597,0.000014694907,0.004212759],"study_design_scores_gemma":[0.00026204303,0.00014533498,0.00019995547,0.000014787747,0.000037605685,0.0000031739537,0.000021763482,0.9438078,0.0013456838,0.05115677,0.0028024756,0.00020262766],"about_ca_topic_score_codex":7.2524836e-7,"about_ca_topic_score_gemma":0.0000016719773,"teacher_disagreement_score":0.3873217,"about_ca_system_score_codex":0.000021523261,"about_ca_system_score_gemma":0.000036391004,"threshold_uncertainty_score":0.61553234},"labels":[],"label_agreement":null},{"id":"W2121096325","doi":"10.1002/nla.567","title":"Efficiency‐based <i>h</i>‐ and <i>hp</i>‐refinement strategies for finite element methods","year":2008,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dimension (graph theory); Finite element method; Grid; Work (physics); Mathematical optimization; Mathematics; Reduction (mathematics); Partial differential equation; Singularity; Applied mathematics; Computer science; Algorithm; Geometry; Mathematical analysis","score_opus":0.030861724529350744,"score_gpt":0.3294186889575105,"score_spread":0.2985569644281597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121096325","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037076644,0.0002159606,0.99712074,0.00019419381,0.00003614247,0.0009512929,0.000034882007,0.00037713177,0.0006988894],"genre_scores_gemma":[0.04957208,0.000024915427,0.9480747,0.0003088075,0.00008716404,0.0018207486,0.00003508586,0.000057683035,0.000018811354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987301,0.000041256775,0.00038177252,0.00032072386,0.00022390718,0.00030220725],"domain_scores_gemma":[0.99779564,0.0015527374,0.000078272154,0.00029860827,0.00012123332,0.00015352905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018218305,0.00024271668,0.00029628526,0.00007242045,0.00022640434,0.000023512675,0.00017242917,0.000057030484,0.000021321124],"category_scores_gemma":[0.00006956782,0.00020656602,0.000056532015,0.00048401806,0.0001550387,0.000081488724,0.000028698223,0.00016133784,0.000012231381],"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.000032783697,0.00022984472,0.000052698735,0.00022917958,0.00006514586,0.0000014895555,0.00014880618,0.90451103,0.0007432157,0.04105252,0.00021476833,0.052718483],"study_design_scores_gemma":[0.0005698942,0.00019034896,0.00006400896,0.000014963495,0.000040473784,0.000011244043,0.000067172696,0.9137015,0.0020641887,0.02212395,0.060814578,0.000337706],"about_ca_topic_score_codex":0.0000012935703,"about_ca_topic_score_gemma":2.8929864e-7,"teacher_disagreement_score":0.060599808,"about_ca_system_score_codex":0.00004446477,"about_ca_system_score_gemma":0.00006459786,"threshold_uncertainty_score":0.8423518},"labels":[],"label_agreement":null},{"id":"W2122266675","doi":"10.1002/nla.547","title":"An efficient linear programming solver for optimal filter synthesis","year":2007,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Sun Microsystems; Intel Corporation","keywords":"Solver; Linear programming; Deconvolution; Mathematics; Linear system; Mathematical optimization; Filter (signal processing); Algorithm; Point (geometry); Block (permutation group theory); System of linear equations; Applied mathematics; Computer science","score_opus":0.011562888039975466,"score_gpt":0.2707725232927044,"score_spread":0.25920963525272894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122266675","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027738132,0.000024155548,0.9951846,0.00036903305,0.000043216536,0.00097505574,0.00001593779,0.0003753484,0.00023883734],"genre_scores_gemma":[0.2162343,7.237355e-7,0.78231025,0.00021214414,0.00033391593,0.0007885004,0.000018016335,0.000025479056,0.00007669556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825835,0.00003313034,0.00031156093,0.0006012416,0.00027676765,0.0005189741],"domain_scores_gemma":[0.9982077,0.00042259815,0.00011500356,0.0007857848,0.00016451886,0.00030440235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005700638,0.00020545431,0.00021109359,0.0000932308,0.00035239576,0.00009979151,0.0008225828,0.000086074884,0.000031964722],"category_scores_gemma":[0.00003846343,0.00016282022,0.00009824732,0.00066723884,0.00010019272,0.00017872646,0.00008075069,0.00016352454,0.00009898704],"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.00019281678,0.0019357721,0.00015628565,0.000071286304,0.00009077487,0.000011272339,0.00056143745,0.019660318,0.00066628313,0.3749789,0.00015159267,0.6015233],"study_design_scores_gemma":[0.00043355837,0.000385023,0.00018932774,0.000016390755,0.00004542754,0.000029581926,0.000074004514,0.88029844,0.010482028,0.00079643633,0.10674202,0.00050777505],"about_ca_topic_score_codex":0.0000049948403,"about_ca_topic_score_gemma":7.8169575e-7,"teacher_disagreement_score":0.86063814,"about_ca_system_score_codex":0.000030895957,"about_ca_system_score_gemma":0.000058979793,"threshold_uncertainty_score":0.6639615},"labels":[],"label_agreement":null},{"id":"W2128985516","doi":"10.1002/nla.1826","title":"Finding off‐diagonal entries of the inverse of a large symmetric sparse matrix","year":2012,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Diagonal; Inverse; Mathematics; Diagonal matrix; Node (physics); Matrix (chemical analysis); Combinatorics; Vertex (graph theory); Algorithm; Block matrix; Band matrix; Square matrix; Symmetric matrix; Eigenvalues and eigenvectors; Geometry; Graph","score_opus":0.012424760643217217,"score_gpt":0.2608739387652651,"score_spread":0.2484491781220479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128985516","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.03665892,0.0003538045,0.9608626,0.00048679145,0.00009410202,0.000505873,0.0000527679,0.000069784415,0.0009153955],"genre_scores_gemma":[0.9201736,0.0000135006585,0.07926497,0.00012816492,0.00011854681,0.00008645309,0.000005487735,0.000010413287,0.00019888271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988113,0.000078817866,0.00029703352,0.00019368783,0.0003190793,0.00030009818],"domain_scores_gemma":[0.99863446,0.00026528336,0.00025356186,0.0006247237,0.00009602439,0.00012592417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003327007,0.00012314552,0.00020616128,0.00011180196,0.00014229974,0.000014429951,0.00075582933,0.000053273707,0.000058842725],"category_scores_gemma":[0.0000673292,0.0000810329,0.000097782235,0.0019571315,0.00013174799,0.00022156019,0.00024524596,0.00015754651,0.00005995221],"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.000013448173,0.00048775537,0.01023492,0.000042229807,0.00003954156,3.1485908e-7,0.00040138743,0.000113762326,0.00023857802,0.9822902,0.00026487702,0.0058729616],"study_design_scores_gemma":[0.00493291,0.00073021953,0.0680006,0.00023846391,0.00050326256,0.00019933135,0.0008157172,0.27495122,0.10164351,0.048018057,0.49784276,0.0021239633],"about_ca_topic_score_codex":0.0000069483935,"about_ca_topic_score_gemma":8.821312e-7,"teacher_disagreement_score":0.93427217,"about_ca_system_score_codex":0.0000181699,"about_ca_system_score_gemma":0.00007814502,"threshold_uncertainty_score":0.33044258},"labels":[],"label_agreement":null},{"id":"W2141654299","doi":"10.1002/nla.318","title":"Consistency adjustments for pairwise comparison matrices","year":2002,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Consistency (knowledge bases); Rank (graph theory); Pairwise comparison; Transitive relation; Matrix (chemical analysis); Applied mathematics; Low-rank approximation; Linear least squares; Least-squares function approximation; Mathematical optimization; Linear model; Combinatorics; Discrete mathematics; Statistics; Mathematical analysis","score_opus":0.0225620477831706,"score_gpt":0.26577950657403887,"score_spread":0.24321745879086826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141654299","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002851773,0.00056064426,0.99396265,0.0012157491,0.00004832766,0.00085697393,0.00002265224,0.00031675957,0.0027310427],"genre_scores_gemma":[0.35111922,0.000034483994,0.64535505,0.0007130075,0.00023601948,0.0015711193,0.000028079096,0.000026460055,0.00091658114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986916,0.00003829801,0.00029940452,0.00044633128,0.00022079937,0.00030356293],"domain_scores_gemma":[0.9986995,0.00024587708,0.00014581408,0.00061036693,0.000114900446,0.00018357583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011165036,0.00016991213,0.00023448499,0.000067422814,0.00030697137,0.00007810808,0.0006747645,0.000058179532,0.00011086814],"category_scores_gemma":[0.000019717689,0.00013565745,0.000081239144,0.0006559338,0.00007777636,0.00020865185,0.000076906406,0.00012284346,0.00041439533],"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.000023776225,0.001144559,0.0009131056,0.00007043934,0.00007882342,0.000002984412,0.00031220607,0.00034326073,0.000044986056,0.7635603,0.006065694,0.22743988],"study_design_scores_gemma":[0.0010208405,0.0003916497,0.0003755413,0.000016781758,0.00006083898,0.000024380633,0.000053771808,0.6616463,0.0005210453,0.013818304,0.3215867,0.0004838395],"about_ca_topic_score_codex":0.0000041425146,"about_ca_topic_score_gemma":5.1168206e-7,"teacher_disagreement_score":0.749742,"about_ca_system_score_codex":0.000023339739,"about_ca_system_score_gemma":0.000022448163,"threshold_uncertainty_score":0.553195},"labels":[],"label_agreement":null},{"id":"W2146675507","doi":"10.1002/nla.1999","title":"A cyclic algorithm for maximum likelihood estimation using Schur complement","year":2015,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport","keywords":"Hessian matrix; Schur complement; Coordinate descent; Mathematics; Complement (music); Algorithm; Mathematical optimization; Matrix (chemical analysis); Block (permutation group theory); Schur decomposition; System of linear equations; Hessian equation; Transformation (genetics); Applied mathematics; Linear system; Descent (aeronautics); Eigenvalues and eigenvectors; Partial differential equation","score_opus":0.023181486069593273,"score_gpt":0.2715561412659055,"score_spread":0.24837465519631222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146675507","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020072001,0.000049549402,0.994582,0.00016751932,0.00005194277,0.0012248438,0.000053292613,0.0031015414,0.0005685643],"genre_scores_gemma":[0.14963005,0.000007182986,0.8484943,0.00013996343,0.00013609233,0.0013491233,0.00018767673,0.000045060013,0.000010537911],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999125,0.000011435548,0.00023135672,0.0002056756,0.00018420501,0.00024234822],"domain_scores_gemma":[0.9994124,0.000025999663,0.000043530636,0.00025026326,0.00008727189,0.00018050738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011352928,0.00015173806,0.00015077325,0.00009284569,0.00009249099,0.000035625093,0.00014205676,0.000051177503,0.000008653998],"category_scores_gemma":[0.0000070577303,0.00014303827,0.00004063653,0.00032852043,0.000030773255,0.000116522235,0.00002657064,0.0000985077,0.0000424822],"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.00001184653,0.00017913005,0.000025265614,0.000050586925,0.00009696132,8.8207383e-7,0.00007453291,0.0555977,0.00014176033,0.0044452455,0.014701404,0.9246747],"study_design_scores_gemma":[0.00045209526,0.00006465995,0.000024274199,0.000009110931,0.000043472504,0.0000056568383,0.000034434845,0.8601547,0.00026586183,0.0011733375,0.13761957,0.00015284405],"about_ca_topic_score_codex":0.000010563928,"about_ca_topic_score_gemma":0.0000018962411,"teacher_disagreement_score":0.92452186,"about_ca_system_score_codex":0.000103657156,"about_ca_system_score_gemma":0.000028808381,"threshold_uncertainty_score":0.5832931},"labels":[],"label_agreement":null},{"id":"W2154024134","doi":"10.1002/nla.337","title":"Irreversible Markov processes for phylogenetic models","year":2003,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Evolution and Paleontology Studies","field":"Earth and Planetary Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Markov chain; Markov process; Time reversibility; Markov model; Mathematics; Diversification (marketing strategy); Process (computing); Computer science; Algorithm; Statistical physics; Theoretical computer science; Applied mathematics; Mathematical economics; Markov property; Statistics; Programming language","score_opus":0.02116604428217539,"score_gpt":0.23628030653393445,"score_spread":0.21511426225175906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154024134","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.004505946,0.0040934635,0.9274021,0.0012084547,0.000065332475,0.0014013256,0.00020916849,0.00016233393,0.060951866],"genre_scores_gemma":[0.89479774,0.00011020435,0.103480905,0.00051408925,0.00007332672,0.00019649255,0.00010407303,0.00000648942,0.0007166813],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991808,0.000028922563,0.00014508642,0.0002837478,0.00010172488,0.00025971778],"domain_scores_gemma":[0.99929065,0.00023145354,0.00005781689,0.00017266926,0.00013036843,0.00011705716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007798847,0.00012416115,0.00015441206,0.000038589842,0.00031996364,0.000014503855,0.00013291472,0.00005420811,0.00023721374],"category_scores_gemma":[0.00004400098,0.00009415966,0.000035037014,0.00043705528,0.00012249882,0.00007468702,0.0000031436246,0.00007474054,0.00012305903],"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.00018913807,0.0002806408,0.9044575,0.000258321,0.00021364201,0.0000015723355,0.00027289553,0.022373207,0.000015085726,0.040069602,0.005456716,0.026411666],"study_design_scores_gemma":[0.0020883814,0.0008289705,0.19396716,0.000028441265,0.000259805,0.00007327571,0.00056379655,0.053823143,0.0002188424,0.056281645,0.6906929,0.0011736365],"about_ca_topic_score_codex":0.000039094382,"about_ca_topic_score_gemma":0.0008425224,"teacher_disagreement_score":0.8902918,"about_ca_system_score_codex":0.0000030612146,"about_ca_system_score_gemma":0.000103237755,"threshold_uncertainty_score":0.38397196},"labels":[],"label_agreement":null},{"id":"W2162069340","doi":"10.1002/nla.468","title":"Analysis of a novel preconditioner for a class of <i>p</i>‐level lower rank extracted systems","year":2006,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Electromagnetic Scattering and Analysis","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Preconditioner; Toeplitz matrix; Mathematics; Conjugate gradient method; Circulant matrix; Positive-definite matrix; Rank (graph theory); Matrix (chemical analysis); Convolution (computer science); Conjugate residual method; Applied mathematics; Coefficient matrix; Linear system; Combinatorics; Mathematical analysis; Algorithm; Pure mathematics; Eigenvalues and eigenvectors; Computer science; Gradient descent","score_opus":0.010424466624073552,"score_gpt":0.24218569892566855,"score_spread":0.23176123230159498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162069340","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.09839654,0.000030015362,0.89935666,0.000093141505,0.00000848813,0.00039198904,0.00082195556,0.000021022333,0.00088020915],"genre_scores_gemma":[0.98307854,3.80424e-7,0.014699661,0.0000131217275,0.00012595604,0.00071378046,0.00080669293,0.000017443543,0.000544408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896073,0.000014081528,0.000430996,0.00025879356,0.00015887746,0.00017654162],"domain_scores_gemma":[0.9989072,0.00015219572,0.0003073463,0.00033110045,0.0002497708,0.00005238827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000070764916,0.00013125139,0.0004222007,0.00016654686,0.00006195492,0.00001376546,0.00014035322,0.00003831463,0.00011852225],"category_scores_gemma":[0.0000027945118,0.000109298184,0.0002472358,0.001288493,0.000070573966,0.000037948033,0.0000108115855,0.00006922379,0.0000032670966],"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.0004995702,0.015028864,0.13058023,0.0004021699,0.016928105,5.515863e-7,0.00021563222,0.26048005,0.20316271,0.3547585,0.002769161,0.015174432],"study_design_scores_gemma":[0.0051836576,0.0008431891,0.07948269,0.00009705785,0.014484016,0.0000030868555,0.0002504082,0.86223125,0.015699862,0.0017857134,0.018674934,0.0012641117],"about_ca_topic_score_codex":0.00048343345,"about_ca_topic_score_gemma":0.000006622972,"teacher_disagreement_score":0.884682,"about_ca_system_score_codex":0.000009669159,"about_ca_system_score_gemma":0.00004222002,"threshold_uncertainty_score":0.44570506},"labels":[],"label_agreement":null},{"id":"W2163749311","doi":"10.1002/nla.811","title":"A Markov‐modulated fluid flow queueing model under <i>D</i>‐policy","year":2011,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Idle; Markov chain; Queueing theory; Markov process; Fluid queue; Mathematical optimization; Mathematics; Flow (mathematics); Computer science; Applied mathematics; Statistics; Operating system","score_opus":0.017080964280070325,"score_gpt":0.23537497000156704,"score_spread":0.2182940057214967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163749311","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.0073834085,0.0000293686,0.9677684,0.0008619266,0.000017961687,0.0004719717,0.000010134078,0.00062681624,0.022830041],"genre_scores_gemma":[0.9169233,0.0000043856026,0.0769925,0.0040732957,0.00071562926,0.00037590796,0.00013712213,0.000096247415,0.000681633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998431,0.000015141139,0.00034725366,0.0005267732,0.00025597625,0.00042380166],"domain_scores_gemma":[0.9987833,0.0000549152,0.00020495364,0.00066814513,0.00023251494,0.000056180095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001584591,0.00028384823,0.00029600973,0.00027820063,0.00034788792,0.00007014702,0.00041007652,0.000092917115,0.00031272156],"category_scores_gemma":[0.00007628465,0.00024395101,0.00010474525,0.0021222744,0.00011530646,0.0006561439,0.00014935604,0.00022616798,0.0007085124],"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.00026934777,0.00065066,0.0006603024,0.00008741179,0.0002739322,0.0000070414235,0.00015724315,0.22411779,0.0013859307,0.76028913,0.0009150389,0.011186186],"study_design_scores_gemma":[0.00032955033,0.000010838417,0.0003098279,0.00001556929,0.00016332325,0.0000032569938,0.000050295694,0.8980036,0.00011973787,0.088413574,0.012183659,0.00039680838],"about_ca_topic_score_codex":0.0002851071,"about_ca_topic_score_gemma":0.000022272077,"teacher_disagreement_score":0.9095399,"about_ca_system_score_codex":0.000056247114,"about_ca_system_score_gemma":0.00006497523,"threshold_uncertainty_score":0.99480337},"labels":[],"label_agreement":null},{"id":"W2165397333","doi":"10.1002/nla.2017","title":"A family of constrained pressure residual preconditioners for parallel reservoir simulations","year":2015,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Western Canada Research Grid; CMG Reservoir Simulation Foundation; University of Calgary","keywords":"Preconditioner; Residual; Newton's method; Scalability; Scale (ratio); Reservoir simulation; Applied mathematics; Mathematics; Residual oil; Mathematical optimization; Computer science; Algorithm; Iterative method; Nonlinear system; Petroleum engineering; Geology","score_opus":0.04498031905365354,"score_gpt":0.3201237360138019,"score_spread":0.2751434169601484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165397333","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020518843,0.00012999075,0.994801,0.0002173892,0.000039140137,0.0011449066,0.00039341184,0.00028766532,0.00093460456],"genre_scores_gemma":[0.289744,0.000002321443,0.7092124,0.00004357867,0.00010908308,0.00066206197,0.00013410668,0.000043322998,0.000049103768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880487,0.000035737692,0.0004367073,0.00023194065,0.00027292292,0.00021781669],"domain_scores_gemma":[0.998015,0.0010179026,0.000119176,0.0003299937,0.00032716861,0.00019079944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001290057,0.00017918632,0.00030159246,0.00007863233,0.00007210971,0.000012314915,0.00020979901,0.000085667394,0.000015137949],"category_scores_gemma":[0.00025289066,0.00016338141,0.000054596614,0.00048848015,0.00016009722,0.00011757712,0.00002440523,0.00015114743,0.000011700877],"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.000042846925,0.0000879128,0.00004720181,0.000101997764,0.00009116024,1.8165709e-7,0.000093705916,0.9695163,0.00028156483,0.027769666,0.00085220987,0.0011152615],"study_design_scores_gemma":[0.001010538,0.00018888185,0.00015419525,0.000026649963,0.000103575345,0.00000565739,0.00012753473,0.8768577,0.0005155364,0.09605393,0.024661787,0.0002940412],"about_ca_topic_score_codex":0.0000020446328,"about_ca_topic_score_gemma":5.967454e-7,"teacher_disagreement_score":0.2876921,"about_ca_system_score_codex":0.000034203782,"about_ca_system_score_gemma":0.00008643659,"threshold_uncertainty_score":0.66625005},"labels":[],"label_agreement":null},{"id":"W2166356498","doi":"10.1002/nla.787","title":"On the perturbation of the Q‐factor of the QR factorization","year":2011,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Perturbation (astronomy); Mathematics; Invertible matrix; Factorization; Applied mathematics; Combinatorics; Pure mathematics; Algorithm; Physics; Quantum mechanics","score_opus":0.016871562044017387,"score_gpt":0.21272173993302815,"score_spread":0.19585017788901077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166356498","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.013472318,0.00001051597,0.9824405,0.0012411819,0.00007834666,0.0005869971,0.000015432952,0.00003596675,0.0021187635],"genre_scores_gemma":[0.99399465,0.0000013909141,0.005437082,0.00023739199,0.000037111273,0.000082491955,0.000001355895,0.000006906141,0.00020159798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991726,0.0001005979,0.00019104361,0.00016854085,0.00026807882,0.00009911849],"domain_scores_gemma":[0.9985486,0.00022898325,0.00022131533,0.00086050987,0.00011096974,0.00002960198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010227702,0.00008922376,0.000093141054,0.00001858464,0.00018526842,0.000011636814,0.0010343554,0.000037656893,0.00006347882],"category_scores_gemma":[0.00006422613,0.000036195666,0.000070965376,0.0007303793,0.00013916242,0.00007719571,0.0001071746,0.00013628768,0.000014986617],"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.0000066735397,0.0001070035,0.00053067715,0.0000056731465,0.000011721436,1.7767706e-8,0.00059157005,0.000049566614,0.00039907475,0.995233,0.000034168123,0.0030308305],"study_design_scores_gemma":[0.00084772275,0.0005835417,0.12602903,0.00011619901,0.00010500239,0.000012292695,0.00022402868,0.096441396,0.2708145,0.4907951,0.013361632,0.0006695416],"about_ca_topic_score_codex":0.000011603426,"about_ca_topic_score_gemma":6.787318e-7,"teacher_disagreement_score":0.98052233,"about_ca_system_score_codex":0.000011893776,"about_ca_system_score_gemma":0.000051819217,"threshold_uncertainty_score":0.19221069},"labels":[],"label_agreement":null},{"id":"W2170774163","doi":"10.1002/nla.1825","title":"Hermitian‐type generalized singular value decomposition with applications","year":2012,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Shanghai Municipal Education Commission; National Natural Science Foundation of China; McGill University; Natural Science Foundation of Shanghai","keywords":"Hermitian matrix; Mathematics; Hermitian function; Singular value decomposition; Matrix (chemical analysis); Matrix function; Rank (graph theory); Pure mathematics; Algebra over a field; Applied mathematics; Symmetric matrix; Mathematical analysis; Combinatorics; Algorithm; Physics","score_opus":0.009507974454374934,"score_gpt":0.26415630785386945,"score_spread":0.2546483333994945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170774163","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019779254,0.00027356923,0.9933146,0.0008153757,0.000043902186,0.00094723515,0.000010377169,0.00045103888,0.002165923],"genre_scores_gemma":[0.2907889,0.000013375214,0.7063423,0.00082230184,0.0005314156,0.0011152494,0.000111478985,0.000040478124,0.00023454924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99824256,0.00010281625,0.0002940314,0.0005047872,0.00035428477,0.0005015443],"domain_scores_gemma":[0.9981669,0.00011810551,0.00016128748,0.000979836,0.0001861858,0.00038768706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021469146,0.0002594363,0.00025835712,0.000093726754,0.00045855978,0.000107225016,0.00069078046,0.00009017427,0.00006369594],"category_scores_gemma":[0.000006598801,0.00020085988,0.000062880994,0.001424311,0.00012699665,0.00049255,0.000103377504,0.00023233962,0.00046855325],"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.00003828603,0.0005794837,0.0005090151,0.0000209191,0.00006380944,0.0000021750188,0.00013652939,0.0008543854,0.0006614615,0.97279096,0.00014411325,0.024198886],"study_design_scores_gemma":[0.0033218272,0.0010138202,0.004368764,0.000087104236,0.0003891496,0.0007657743,0.00009284598,0.14230229,0.017706586,0.048505846,0.77860236,0.0028436345],"about_ca_topic_score_codex":0.000014519756,"about_ca_topic_score_gemma":6.331073e-7,"teacher_disagreement_score":0.9242851,"about_ca_system_score_codex":0.000054018215,"about_ca_system_score_gemma":0.00009408587,"threshold_uncertainty_score":0.8190828},"labels":[],"label_agreement":null},{"id":"W2336877474","doi":"10.1002/nla.2047","title":"Preconditioning a mass‐conserving discontinuous Galerkin discretization of the Stokes equations","year":2016,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Preconditioner; Multigrid method; Discretization; Mathematics; Saddle point; Discontinuous Galerkin method; Finite element method; Applied mathematics; Navier–Stokes equations; Linear system; Galerkin method; Saddle; Relaxation (psychology); Block (permutation group theory); Mathematical analysis; Mathematical optimization; Compressibility; Partial differential equation; Geometry; Physics","score_opus":0.011276630321847815,"score_gpt":0.2477752979146314,"score_spread":0.2364986675927836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336877474","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.0028620332,0.00005090224,0.99441564,0.0005865361,0.00005340543,0.0005212525,0.000063912266,0.00021911527,0.00122718],"genre_scores_gemma":[0.6240941,0.0000066604553,0.3752613,0.000034784956,0.00007133715,0.00039252426,0.000010876554,0.00003960597,0.00008876882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988979,0.00005805972,0.00039385026,0.0002009085,0.0002562158,0.00019304027],"domain_scores_gemma":[0.99814963,0.001088854,0.00015878835,0.00040657105,0.00012293198,0.00007319948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009620425,0.00016162754,0.00020353505,0.000053417996,0.00014466842,0.000015353764,0.00028074704,0.000051367515,0.000057480538],"category_scores_gemma":[0.0002419882,0.000093775234,0.00006967812,0.00062550703,0.00017017564,0.00015771086,0.000038011323,0.0001237136,0.000029033747],"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.000028085537,0.00024499427,0.0045860303,0.0002705575,0.00023461843,5.7929276e-7,0.00037136464,0.38849995,0.02473424,0.48415282,0.00018029397,0.096696444],"study_design_scores_gemma":[0.0015528514,0.00018221547,0.015483085,0.00082516467,0.00028920124,0.000032253523,0.0002724971,0.5798756,0.03119323,0.360018,0.008955019,0.0013209396],"about_ca_topic_score_codex":0.0000014215029,"about_ca_topic_score_gemma":0.0000012674502,"teacher_disagreement_score":0.6212321,"about_ca_system_score_codex":0.000060585364,"about_ca_system_score_gemma":0.000032043547,"threshold_uncertainty_score":0.38240433},"labels":[],"label_agreement":null},{"id":"W2338260032","doi":"10.1002/nla.2050","title":"Towards an optimal condition number of certain augmented Lagrangian‐type saddle‐point matrices","year":2016,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Invertible matrix; Saddle point; Eigenvalues and eigenvectors; Augmented Lagrangian method; Rank (graph theory); Block (permutation group theory); Matrix (chemical analysis); Saddle; Applied mathematics; Type (biology); Singular value decomposition; Combinatorics; Block matrix; Lagrangian; Singular value; Pure mathematics; Mathematical optimization; Algorithm; Geometry","score_opus":0.009549939276433841,"score_gpt":0.2723625157209429,"score_spread":0.26281257644450906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338260032","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.014967477,0.00003197958,0.9820624,0.0010512174,0.000048267502,0.00034873324,0.000044709042,0.00021940231,0.0012258122],"genre_scores_gemma":[0.7118313,0.000018503728,0.28732964,0.00015760459,0.00015601373,0.00017276793,0.000044655917,0.000021526255,0.0002680106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99859244,0.00009122934,0.00031576722,0.0004318551,0.00030155946,0.00026714508],"domain_scores_gemma":[0.9985677,0.00016457433,0.00018619782,0.0006589258,0.00022228318,0.00020032442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020182089,0.0001740152,0.00022415943,0.00006873751,0.00012536669,0.000041139585,0.00066072866,0.00007494752,0.00052044465],"category_scores_gemma":[0.000027293638,0.000112272195,0.000063405365,0.0007843094,0.00013039191,0.00047221934,0.00009674564,0.000097928074,0.00039006342],"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.00019081206,0.000931918,0.00069610396,0.0000543867,0.00010796475,0.000007827032,0.00031724045,0.00021864811,0.0034913386,0.79436976,0.00040507436,0.19920895],"study_design_scores_gemma":[0.01280144,0.0059306826,0.01613641,0.0005732731,0.0006043768,0.0008399537,0.00078183226,0.26286483,0.1805145,0.21706466,0.29617614,0.00571191],"about_ca_topic_score_codex":0.000021482692,"about_ca_topic_score_gemma":7.44764e-7,"teacher_disagreement_score":0.6968638,"about_ca_system_score_codex":0.000032173495,"about_ca_system_score_gemma":0.00008966559,"threshold_uncertainty_score":0.56985044},"labels":[],"label_agreement":null},{"id":"W2605276264","doi":"10.1002/nla.2095","title":"A stabilized multigrid solver for hyperelastic image registration","year":2017,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","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":"University of British Columbia","funders":"","keywords":"Multigrid method; Discretization; Mathematics; Hyperelastic material; Hessian matrix; Solver; Applied mathematics; Mathematical optimization; Regularization (linguistics); Partial differential equation; Finite element method; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.02607809847944596,"score_gpt":0.3188376433450104,"score_spread":0.29275954486556444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605276264","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001059916,0.000033156106,0.99549913,0.00028576242,0.00007202355,0.0010450518,0.000052568637,0.00037646553,0.0015759474],"genre_scores_gemma":[0.15403365,0.0000072487064,0.8440808,0.000042283245,0.00021055578,0.0014551448,0.000034747893,0.000065072934,0.00007049792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891424,0.000014881111,0.00031960598,0.00029192324,0.00020392319,0.00025544476],"domain_scores_gemma":[0.99811816,0.0007151106,0.00015529276,0.0006948163,0.00017894254,0.00013770348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011240312,0.0002029523,0.00026210243,0.000036534373,0.00040100442,0.00008587804,0.00035112342,0.00007217741,0.000028700273],"category_scores_gemma":[0.00045430372,0.00017621159,0.000074416355,0.00011767684,0.00017598909,0.00021943837,0.00003368462,0.00017799702,0.00007305981],"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.0006172622,0.0015693944,0.0009781534,0.0020024746,0.0006870834,0.0000115313105,0.0006345133,0.3487495,0.027979631,0.31386104,0.003617127,0.2992923],"study_design_scores_gemma":[0.0010656702,0.000106576226,0.00078288664,0.00003267607,0.00007835233,0.000012189173,0.000031869768,0.9111336,0.0018528237,0.055795092,0.02864572,0.00046252864],"about_ca_topic_score_codex":0.0000021268334,"about_ca_topic_score_gemma":0.00000121198,"teacher_disagreement_score":0.5623841,"about_ca_system_score_codex":0.000056492365,"about_ca_system_score_gemma":0.00003008782,"threshold_uncertainty_score":0.71857},"labels":[],"label_agreement":null},{"id":"W2741505342","doi":"10.1002/nla.2115","title":"Composite‐grid multigrid for diffusion on the sphere","year":2017,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","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":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Multigrid method; Grid; Discretization; Mathematics; Partial differential equation; Finite element method; Surface (topology); Applied mathematics; Laplace transform; Coupling (piping); Field (mathematics); Algorithm; Mathematical optimization; Computer science; Geometry; Mathematical analysis; Pure mathematics","score_opus":0.028362760675690452,"score_gpt":0.3072370678725068,"score_spread":0.2788743071968164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741505342","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032015496,0.000030992,0.9918863,0.001191916,0.00010625751,0.0010448705,0.000055174736,0.0002706053,0.0022123074],"genre_scores_gemma":[0.20697464,0.000010972324,0.79054123,0.00030388375,0.00048831955,0.0014941943,0.000027715101,0.00007451433,0.00008453764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907,0.000020020365,0.00022733901,0.00024050378,0.00021351392,0.00022863797],"domain_scores_gemma":[0.997615,0.0012854675,0.000115302995,0.0007859269,0.00009182966,0.000106474305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009696013,0.00019734037,0.00021098688,0.00002065648,0.00069709576,0.00007081242,0.00053624145,0.000058414615,0.000034150216],"category_scores_gemma":[0.00017533988,0.00012716782,0.00007315632,0.000114156646,0.00014323165,0.00007044976,0.00005310806,0.00023360306,0.00011391622],"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.00021687023,0.0008645692,0.00075455726,0.00035240082,0.0002910451,0.0000035377266,0.00025883448,0.3118771,0.0040917816,0.3383283,0.005083939,0.33787706],"study_design_scores_gemma":[0.0006388771,0.00015926755,0.0021882202,0.000063440864,0.000050927378,0.000008102661,0.00004041062,0.82528853,0.0030623358,0.04674923,0.12129346,0.00045721704],"about_ca_topic_score_codex":0.000001887724,"about_ca_topic_score_gemma":5.8986336e-7,"teacher_disagreement_score":0.5134114,"about_ca_system_score_codex":0.000040004874,"about_ca_system_score_gemma":0.000012080441,"threshold_uncertainty_score":0.5361568},"labels":[],"label_agreement":null},{"id":"W2779052738","doi":"10.1002/nla.2206","title":"A multigrid solver to the Helmholtz equation with a point source based on travel time and amplitude","year":2018,"lang":"en","type":"preprint","venue":"Numerical Linear Algebra with Applications","topic":"Seismic Imaging and Inversion Techniques","field":"Earth and Planetary Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Seventh Framework Programme","keywords":"Helmholtz equation; Discretization; Multigrid method; Solver; Wave equation; Mathematical analysis; Eikonal equation; Mathematics; Amplitude; Applied mathematics; Partial differential equation; Physics; Mathematical optimization; Boundary value problem","score_opus":0.013857533789645021,"score_gpt":0.22456116861458858,"score_spread":0.21070363482494356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2779052738","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.0064278455,0.000045501598,0.9804632,0.00906142,0.000031076226,0.0017313138,0.00024255754,0.0002636122,0.0017334896],"genre_scores_gemma":[0.8138107,0.0000124270955,0.16577223,0.017800074,0.0005092994,0.00037826854,0.0011023945,0.000038625905,0.0005759882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983005,0.000078135985,0.00023070844,0.0006762086,0.00042141473,0.00029302062],"domain_scores_gemma":[0.9985687,0.00023602111,0.00015230216,0.00069023104,0.00012378789,0.00022894205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002831622,0.0002978902,0.00026684976,0.00011836021,0.00032673005,0.0001309184,0.00039089975,0.00012442419,0.00040495445],"category_scores_gemma":[0.000032217296,0.00017323188,0.000053715343,0.00032260746,0.00024278766,0.00005087926,0.000050455816,0.00046059012,0.00069409993],"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.0029378615,0.0011461618,0.028704634,0.00036037937,0.00048060773,0.000015252327,0.0036655127,0.27926993,0.00016266514,0.0005952385,0.08603374,0.596628],"study_design_scores_gemma":[0.0003031527,0.0005864431,0.008524162,0.000110791545,0.00006947916,0.00000996883,0.000058530302,0.92358005,0.00034340957,0.0003414211,0.06565847,0.0004141422],"about_ca_topic_score_codex":0.0016502413,"about_ca_topic_score_gemma":0.000027831544,"teacher_disagreement_score":0.81469095,"about_ca_system_score_codex":0.000014652116,"about_ca_system_score_gemma":0.00012425003,"threshold_uncertainty_score":0.8921482},"labels":[],"label_agreement":null},{"id":"W2790987616","doi":"10.1002/nla.2202","title":"Nonlinearly preconditioned L‐BFGS as an acceleration mechanism for alternating least squares with application to tensor decomposition","year":2018,"lang":"en","type":"preprint","venue":"Numerical Linear Algebra with Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Broyden–Fletcher–Goldfarb–Shanno algorithm; Nonlinear system; Tensor (intrinsic definition); Acceleration; Nonlinear conjugate gradient method; Robustness (evolution); Mathematics; Conjugate gradient method; Quasi-Newton method; Applied mathematics; Mathematical optimization; Computer science; Newton's method; Geometry; Gradient descent; Physics; Artificial intelligence","score_opus":0.030350149289128103,"score_gpt":0.3549142863738016,"score_spread":0.3245641370846735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790987616","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10638217,0.0000061627825,0.87960213,0.002592034,0.000057756104,0.008965252,0.001027447,0.00086260505,0.00050444657],"genre_scores_gemma":[0.433711,0.0000040558416,0.53280705,0.00094864384,0.0011779271,0.026494836,0.0044665607,0.00021228596,0.00017763673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99578935,0.00011309483,0.001037302,0.0017569122,0.0007034454,0.00059990276],"domain_scores_gemma":[0.9944063,0.00037457581,0.00093173096,0.0017183657,0.0019700606,0.0005989793],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002803679,0.0007651781,0.00075673993,0.00034515938,0.00092278176,0.00040165387,0.00087435055,0.0004469214,0.00013898835],"category_scores_gemma":[0.00007908484,0.0006852209,0.00019630766,0.0006681595,0.0001459379,0.0003395679,0.00019305182,0.00061777513,0.00037319877],"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.0013767823,0.0044595497,0.00023645154,0.0007718762,0.00066638447,0.0000033206074,0.0012863381,0.005356652,0.011452295,0.95847636,0.002036799,0.013877191],"study_design_scores_gemma":[0.0035506398,0.0036120485,0.0009747469,0.00053586776,0.0012892014,0.00018499886,0.00053970783,0.21083222,0.031245489,0.7340007,0.009903446,0.0033309404],"about_ca_topic_score_codex":0.0001016674,"about_ca_topic_score_gemma":0.00010790531,"teacher_disagreement_score":0.34679508,"about_ca_system_score_codex":0.00025171405,"about_ca_system_score_gemma":0.00026519087,"threshold_uncertainty_score":0.9995599},"labels":[],"label_agreement":null},{"id":"W2806424598","doi":"10.1002/nla.2147","title":"Local Fourier analysis of block‐structured multigrid relaxation schemes for the Stokes equations","year":2018,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multigrid method; Discretization; Relaxation (psychology); Mathematics; Block (permutation group theory); Convergence (economics); Applied mathematics; Saddle point; Fourier transform; Saddle; Finite element method; Mathematical optimization; Algorithm; Partial differential equation; Mathematical analysis; Geometry; Physics","score_opus":0.01966037727123458,"score_gpt":0.3040190220013343,"score_spread":0.2843586447300997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806424598","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011978685,0.00010249563,0.9973372,0.00020440994,0.00004951309,0.0007335054,0.00008230109,0.00017978647,0.00011289226],"genre_scores_gemma":[0.45657945,0.000004419084,0.5426867,0.000045920402,0.00011382485,0.0004899792,0.00004028894,0.000026106636,0.000013329253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998855,0.000027081283,0.00041630713,0.00022693662,0.0002768368,0.00019781367],"domain_scores_gemma":[0.996681,0.0022285697,0.000164481,0.000454486,0.0003921055,0.000079398225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014509694,0.00017178092,0.00029756976,0.00014140429,0.00021615885,0.000014717979,0.00025586467,0.000072196126,0.000040028157],"category_scores_gemma":[0.00028620937,0.000120877754,0.00012731706,0.0018376214,0.00033129402,0.00007355287,0.00002620855,0.00014588647,0.000013026831],"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.000036312496,0.0000864599,0.00013096399,0.00005162676,0.0011331979,8.153981e-8,0.0002535584,0.85735714,0.0005098738,0.05597107,0.00010655533,0.084363155],"study_design_scores_gemma":[0.00018873118,0.00006276621,0.00058524637,0.000006596396,0.000646755,9.4626654e-7,0.000070320224,0.976424,0.0021555896,0.0075016683,0.012204167,0.00015320473],"about_ca_topic_score_codex":0.000003292195,"about_ca_topic_score_gemma":0.0000053209137,"teacher_disagreement_score":0.45538157,"about_ca_system_score_codex":0.000047187543,"about_ca_system_score_gemma":0.000028446531,"threshold_uncertainty_score":0.49292517},"labels":[],"label_agreement":null},{"id":"W2945154147","doi":"10.1002/nla.559","title":"Distance‐two interpolation for parallel algebraic multigrid","year":2007,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Multigrid method; Scalability; Interpolation (computer graphics); Parallel computing; Convergence (economics); Computer science; Mathematics; Algorithm; Computational science; Partial differential equation","score_opus":0.012678977756962645,"score_gpt":0.28310248324648124,"score_spread":0.2704235054895186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945154147","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010214596,0.00007874627,0.9964535,0.0008213416,0.0000869726,0.000890103,0.000008910748,0.0001979663,0.0004409669],"genre_scores_gemma":[0.39807963,0.0000024267486,0.6004215,0.00044291024,0.00033323522,0.000392397,0.00012645946,0.000013158932,0.00018829995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863166,0.000020119845,0.00032188857,0.00047243564,0.000259705,0.0002942121],"domain_scores_gemma":[0.99876475,0.00027924665,0.00013579047,0.00041433214,0.00023765877,0.00016821414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028635768,0.0001595212,0.00014608547,0.000121879835,0.00026502428,0.00007593315,0.00040910018,0.00004985603,0.000011449465],"category_scores_gemma":[0.000036320343,0.00014081474,0.00007079913,0.0008615214,0.000046549965,0.00023321294,0.000058188285,0.00011110409,0.000060625305],"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.00011831963,0.0003076294,0.0006893945,0.00002046286,0.0000439732,0.0000012731444,0.00018248013,0.011445663,0.0011630383,0.85338604,0.00087126635,0.13177046],"study_design_scores_gemma":[0.0014699927,0.0002835989,0.0056925905,0.000013417635,0.000023806988,0.000022921344,0.000028196631,0.80687386,0.0016740926,0.020682987,0.16277121,0.00046334197],"about_ca_topic_score_codex":0.000008648601,"about_ca_topic_score_gemma":0.000017554716,"teacher_disagreement_score":0.83270305,"about_ca_system_score_codex":0.000039239792,"about_ca_system_score_gemma":0.00007194395,"threshold_uncertainty_score":0.5742258},"labels":[],"label_agreement":null},{"id":"W2945974182","doi":"10.1002/nla.2271","title":"Convergence analysis for parallel‐in‐time solution of hyperbolic systems","year":2019,"lang":"en","type":"preprint","venue":"Numerical Linear Algebra with Applications","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":"Memorial University of Newfoundland; Verafin (Canada); University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multigrid method; Partial differential equation; Applied mathematics; Mathematics; Fourier analysis; Convergence (economics); Spacetime; Algebraic number; Fourier transform; Dimension (graph theory); Computer science; Mathematical optimization; Mathematical analysis; Physics","score_opus":0.0241027217736144,"score_gpt":0.2951315000422264,"score_spread":0.271028778268612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945974182","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020060863,0.00048373867,0.9945943,0.0000422299,0.000107974585,0.0021504166,0.00021623707,0.00021126478,0.00018778165],"genre_scores_gemma":[0.351238,0.000047137695,0.64589673,0.0000136212375,0.000101029764,0.0023268436,0.0002559628,0.00006850112,0.000052129835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980157,0.000054083725,0.000790048,0.0004784968,0.0003640216,0.0002976635],"domain_scores_gemma":[0.99774444,0.0009165651,0.00030333956,0.0007043339,0.00022635648,0.000104944644],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021659536,0.00032657807,0.0009782229,0.00028711476,0.00003505989,0.000020770087,0.0004969154,0.00024398357,0.000019697156],"category_scores_gemma":[0.00007289708,0.0003109093,0.00022198279,0.0011909629,0.0000835465,0.000049045837,0.00012052489,0.00039112466,0.000057784466],"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.000018378018,0.000091217305,0.00083533133,0.00066180906,0.0003722087,1.928985e-7,0.00003340611,0.9935317,0.00007690622,0.0036765982,0.000027156342,0.0006751185],"study_design_scores_gemma":[0.0002246269,0.000040095274,0.00082869694,0.00007409791,0.00034695183,0.0000015129815,0.000010105601,0.9885278,0.00007453246,0.00851259,0.0010232398,0.000335793],"about_ca_topic_score_codex":0.00001430342,"about_ca_topic_score_gemma":6.628857e-7,"teacher_disagreement_score":0.34923193,"about_ca_system_score_codex":0.00013190183,"about_ca_system_score_gemma":0.00006487951,"threshold_uncertainty_score":0.9999343},"labels":[],"label_agreement":null},{"id":"W2963626304","doi":"10.1002/nla.1963","title":"A nonlinearly preconditioned conjugate gradient algorithm for rank‐<i>R</i> canonical tensor approximation","year":2014,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Laboratory Directed Research and Development; Natural Sciences and Engineering Research Council of Canada; Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Preconditioner; Conjugate gradient method; Convergence (economics); Mathematics; Rank (graph theory); Tensor (intrinsic definition); Acceleration; Nonlinear conjugate gradient method; Nonlinear system; Algorithm; Applied mathematics; Mathematical optimization; Computer science; Iterative method; Pure mathematics; Gradient descent; Combinatorics; Artificial intelligence; Artificial neural network","score_opus":0.019395089764698913,"score_gpt":0.28877605997942274,"score_spread":0.26938097021472385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963626304","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035434929,0.000012879973,0.9888576,0.002449051,0.00003648563,0.0029399106,0.0004105985,0.0005051383,0.0012448414],"genre_scores_gemma":[0.09040556,0.000005400363,0.8969364,0.001060035,0.0005748688,0.009291874,0.00096027873,0.00010858155,0.00065699103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978486,0.00008082278,0.00064935215,0.0006505525,0.00033108745,0.00043961668],"domain_scores_gemma":[0.9974237,0.00077324436,0.00031709878,0.00072566513,0.0004347567,0.00032554474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002754039,0.00031796718,0.00045492803,0.00010788038,0.00048603013,0.0000792795,0.0003293302,0.0001492975,0.00011335323],"category_scores_gemma":[0.00009527326,0.00026994382,0.0001799606,0.00052433915,0.00017397695,0.00014271076,0.00003612998,0.00025420336,0.00021711407],"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.00013296871,0.0028479712,0.00010681717,0.00015419356,0.00022043168,7.9293494e-7,0.00022550802,0.00017098051,0.0012235354,0.9156867,0.006253873,0.07297618],"study_design_scores_gemma":[0.005686503,0.0010002371,0.0006781157,0.000066034656,0.00052449893,0.00011162271,0.0001226045,0.41768643,0.0042586518,0.22748362,0.34104988,0.0013317959],"about_ca_topic_score_codex":0.000012028534,"about_ca_topic_score_gemma":0.000007916099,"teacher_disagreement_score":0.68820316,"about_ca_system_score_codex":0.00007521245,"about_ca_system_score_gemma":0.000082864535,"threshold_uncertainty_score":0.99997526},"labels":[],"label_agreement":null},{"id":"W2970518087","doi":"10.1002/nla.2306","title":"A local Fourier analysis of additive Vanka relaxation for the Stokes equations","year":2020,"lang":"en","type":"preprint","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Multigrid method; Discretization; Relaxation (psychology); Convergence (economics); Grid; Applied mathematics; Finite element method; Mathematical optimization; Computer science; Fourier transform; Fourier analysis; Partial differential equation; Algorithm; Mathematics; Mathematical analysis; Geometry; Physics","score_opus":0.034105986348677286,"score_gpt":0.31636636466945295,"score_spread":0.28226037832077566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970518087","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043534605,0.00023893536,0.9953238,0.0009070934,0.00007036934,0.0018338594,0.0010760749,0.00028999697,0.00021633095],"genre_scores_gemma":[0.20852853,0.000041033953,0.78600544,0.00011593817,0.00017848631,0.0042432896,0.00079044537,0.00008121486,0.000015602387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981247,0.000056135323,0.0007088553,0.00044633666,0.00043461862,0.0002293585],"domain_scores_gemma":[0.9931839,0.0051892055,0.00040032945,0.0006698598,0.0004255737,0.0001311293],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017855548,0.00033169377,0.0006788041,0.000187953,0.00015424854,0.000027381948,0.00047582164,0.00018372489,0.000046751404],"category_scores_gemma":[0.00048968947,0.00025339067,0.00033395248,0.0018255283,0.00022743832,0.000057304893,0.00013998631,0.0005859173,0.000016214672],"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.000020987422,0.00006043633,0.0000058947817,0.00012392242,0.0016424595,1.7277351e-7,0.00021309202,0.91643006,0.000012804519,0.04248243,0.00013720473,0.038870547],"study_design_scores_gemma":[0.0001386807,0.000049294948,0.00018412046,0.000025767238,0.0022246323,5.0238066e-7,0.00010998303,0.92676854,0.00014124761,0.06458561,0.0055139833,0.00025766063],"about_ca_topic_score_codex":0.00000574772,"about_ca_topic_score_gemma":0.0000030149547,"teacher_disagreement_score":0.20931835,"about_ca_system_score_codex":0.00011840083,"about_ca_system_score_gemma":0.00010016522,"threshold_uncertainty_score":0.99999183},"labels":[],"label_agreement":null},{"id":"W2988137070","doi":"10.1002/nla.2297","title":"Nesterov acceleration of alternating least squares for canonical tensor decomposition: Momentum step size selection and restart mechanisms","year":2020,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Acceleration; Mathematics; Gradient descent; Nonlinear system; Conjugate gradient method; Robustness (evolution); Tensor (intrinsic definition); Nonlinear conjugate gradient method; Mathematical optimization; Line search; Applied mathematics; Algorithm; Rate of convergence; Computer science; Artificial intelligence; Geometry; Key (lock)","score_opus":0.03470059674419496,"score_gpt":0.3201134359785043,"score_spread":0.2854128392343093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2988137070","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.07140324,0.000012469339,0.9209508,0.0056696017,0.00001216917,0.0015581966,0.00008107878,0.00018514058,0.00012734282],"genre_scores_gemma":[0.6196093,0.000004266674,0.378618,0.00041165145,0.0001424894,0.0010783939,0.00006400765,0.000035478886,0.00003643614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855477,0.000045908746,0.00050351,0.0004360024,0.00024559407,0.00021422846],"domain_scores_gemma":[0.9984966,0.00052985665,0.0002810334,0.00022063602,0.00028591062,0.00018597045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009352371,0.00019734683,0.00031233797,0.000043191492,0.00028585555,0.00005549329,0.00016096442,0.00008499203,0.0000605116],"category_scores_gemma":[0.00008398619,0.0001790603,0.00007333384,0.00038337227,0.00006323574,0.00013049944,0.000040131683,0.00016190842,0.000011001994],"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.0004849272,0.0009270637,0.00084863143,0.00042059398,0.00018772575,0.0000010679479,0.00049323036,0.0007946434,0.07734317,0.9106843,0.0016280526,0.0061865984],"study_design_scores_gemma":[0.008351467,0.0037818174,0.006013777,0.00021764859,0.0009811107,0.00018327875,0.0012319435,0.70110786,0.07738822,0.16837822,0.03034116,0.0020235002],"about_ca_topic_score_codex":0.000014361781,"about_ca_topic_score_gemma":0.000010177507,"teacher_disagreement_score":0.74230605,"about_ca_system_score_codex":0.00003854425,"about_ca_system_score_gemma":0.000055443244,"threshold_uncertainty_score":0.7301867},"labels":[],"label_agreement":null},{"id":"W3006898615","doi":"10.1002/nla.2285","title":"Two‐level Fourier analysis of multigrid for higher‐order finite‐element discretizations of the Laplacian","year":2020,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multigrid method; Smoothing; Finite element method; Applied mathematics; Relaxation (psychology); Mathematics; Grid; Convergence (economics); Mathematical optimization; Laplace operator; Fourier analysis; Fourier transform; Partial differential equation; Computer science; Algorithm; Mathematical analysis; Geometry","score_opus":0.037532764155874566,"score_gpt":0.30650913640149274,"score_spread":0.26897637224561816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006898615","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035319471,0.00003336043,0.99709827,0.00087995443,0.000026075651,0.00071209343,0.00053359097,0.00007967356,0.00028376433],"genre_scores_gemma":[0.24247016,0.000003591141,0.7567598,0.00017311012,0.00006199897,0.00039784072,0.00008310694,0.000031905867,0.000018487875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887097,0.000030371688,0.0004748551,0.00020228316,0.0002654165,0.00015610078],"domain_scores_gemma":[0.9981952,0.0009278907,0.00017715294,0.0003442627,0.00025417696,0.000101360296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006384995,0.00015364488,0.00036276045,0.00006730784,0.00007611507,0.0000063328253,0.0002918782,0.00004067443,0.000063229825],"category_scores_gemma":[0.00021812032,0.000111448746,0.00014851514,0.0025249529,0.0001180444,0.00004248932,0.000048439128,0.00012068585,0.0000038004387],"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.000013441337,0.00007938621,0.00054454285,0.000084607644,0.0004393392,4.1167727e-8,0.00013920438,0.95979345,0.0002113643,0.03471054,0.000047684094,0.0039364165],"study_design_scores_gemma":[0.00032118623,0.000056418798,0.0011273857,0.000011328689,0.00053461705,1.5588758e-7,0.000040714902,0.98567057,0.0010920893,0.0044257483,0.006567805,0.00015201017],"about_ca_topic_score_codex":0.0000024702836,"about_ca_topic_score_gemma":0.0000018288481,"teacher_disagreement_score":0.24211696,"about_ca_system_score_codex":0.0000228103,"about_ca_system_score_gemma":0.000029082874,"threshold_uncertainty_score":0.45447478},"labels":[],"label_agreement":null},{"id":"W3092221604","doi":"10.1002/nla.2337","title":"Minimizing convex quadratics with variable precision conjugate gradients","year":2020,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Conjugate gradient method; Context (archaeology); Computation; Conjugate; Quadratic equation; Matrix (chemical analysis); Mathematical optimization; Regular polygon; Variable (mathematics); Convex optimization; Applied mathematics; Algorithm; Mathematical analysis; Geometry","score_opus":0.04017474802119845,"score_gpt":0.3171565609560845,"score_spread":0.27698181293488605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092221604","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072335487,0.000027220118,0.993748,0.0015476509,0.000012049419,0.0014032451,0.0000431618,0.0003148106,0.0021805193],"genre_scores_gemma":[0.030250322,0.000016960035,0.96763134,0.00072574924,0.00015461263,0.00064963236,0.00008699677,0.00010455451,0.0003798315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783045,0.0000741492,0.000446742,0.00057741307,0.0006406161,0.00043060022],"domain_scores_gemma":[0.9977249,0.0005869236,0.00021942412,0.0005374837,0.000443676,0.00048757315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001335431,0.00027335837,0.00040174875,0.00006590605,0.00028097036,0.00007033332,0.0003841364,0.00009717705,0.00029215345],"category_scores_gemma":[0.00032271008,0.00020637427,0.00004179769,0.0013940324,0.00017923742,0.00020634719,0.000101708094,0.00040188365,0.00022146573],"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.0028712838,0.00428339,0.00416737,0.0012413526,0.0011962082,0.00008678935,0.0056145764,0.10910493,0.002021238,0.817503,0.01094401,0.040965866],"study_design_scores_gemma":[0.0041213194,0.0013672456,0.00009601033,0.00012171592,0.00022403948,0.00005444948,0.00065632415,0.8558584,0.002668119,0.026770804,0.106864266,0.001197341],"about_ca_topic_score_codex":0.000005036683,"about_ca_topic_score_gemma":0.00000117902,"teacher_disagreement_score":0.7907322,"about_ca_system_score_codex":0.000055618304,"about_ca_system_score_gemma":0.00016415666,"threshold_uncertainty_score":0.8415699},"labels":[],"label_agreement":null},{"id":"W3135361124","doi":"10.1002/nla.2367","title":"Optimizing multigrid reduction‐in‐time and Parareal coarse‐grid operators for linear advection","year":2021,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Australian Research Council Centre of Excellence for Mathematical and Statistical Frontiers; Australian Government; Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Multigrid method; Partial differential equation; Advection; Convergence (economics); Mathematics; Applied mathematics; Reduction (mathematics); Grid; Elliptic partial differential equation; Upwind scheme; Polygon mesh; Mathematical optimization; Hyperbolic partial differential equation; Computer science; Mathematical analysis; Geometry; Discretization","score_opus":0.015482306554258552,"score_gpt":0.28666895587730923,"score_spread":0.2711866493230507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135361124","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008005765,0.00024706573,0.99024254,0.00019471913,0.00009944667,0.00068118493,0.000053475636,0.00030761244,0.00016820947],"genre_scores_gemma":[0.024852978,0.000059712605,0.97350883,0.00006377329,0.00037156086,0.00088598905,0.000120029166,0.00007291359,0.00006421403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875623,0.000038468374,0.00037714292,0.00038022656,0.00018515227,0.00026279502],"domain_scores_gemma":[0.9989109,0.00046241967,0.000058671223,0.000253641,0.0001648303,0.00014955262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011665289,0.00021236841,0.00031016598,0.000078368736,0.00013603097,0.00003229207,0.0001163736,0.0000939539,0.000022549408],"category_scores_gemma":[0.00011596391,0.00020763723,0.000050711147,0.0006902927,0.00007729865,0.00014258952,0.000036936886,0.00024835052,0.000026745653],"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.00004534957,0.0002238094,0.000107033615,0.00014894968,0.00007049034,0.0000039888187,0.00021354978,0.96598727,0.0033156567,0.0028577393,0.00013008958,0.026896069],"study_design_scores_gemma":[0.00065463985,0.00007299856,0.00014233106,0.000046752546,0.0000396812,0.00008145472,0.00008828777,0.9795169,0.0060743797,0.0030274051,0.009896004,0.00035911656],"about_ca_topic_score_codex":0.0000024770209,"about_ca_topic_score_gemma":8.624237e-7,"teacher_disagreement_score":0.026536953,"about_ca_system_score_codex":0.00008035599,"about_ca_system_score_gemma":0.00004194678,"threshold_uncertainty_score":0.8467201},"labels":[],"label_agreement":null},{"id":"W3137409987","doi":"10.1002/nla.2426","title":"Low‐order preconditioning of the Stokes equations","year":2021,"lang":"en","type":"preprint","venue":"Numerical Linear Algebra with Applications","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":"Memorial University of Newfoundland; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Nuclear Security Administration; Office of Science; Advanced Scientific Computing Research; Sandia National Laboratories; U.S. Department of Energy","keywords":"Multigrid method; Discretization; Preconditioner; Order (exchange); Mathematics; Stokes flow; Mathematical analysis; Geometry; Partial differential equation; Linear system; Flow (mathematics)","score_opus":0.01827425167728905,"score_gpt":0.28514586803453845,"score_spread":0.26687161635724943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137409987","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024202599,0.0002520455,0.9945396,0.0002248874,0.00018287772,0.00089518406,0.00011251459,0.00027819874,0.0010944257],"genre_scores_gemma":[0.29270968,0.00002105574,0.7055672,0.00007674762,0.00015929069,0.0011837243,0.00015210084,0.00008345655,0.00004674133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983063,0.000082216044,0.00059501344,0.00036944106,0.00041686755,0.0002301707],"domain_scores_gemma":[0.9973488,0.0009936804,0.00027027423,0.0008779111,0.00041155078,0.00009779782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010366923,0.0003055806,0.00044463447,0.00007051309,0.00015000258,0.000042600048,0.00052736147,0.00018334617,0.000112978356],"category_scores_gemma":[0.0002701079,0.00024082151,0.00015376454,0.00092478696,0.00018344169,0.00007490058,0.0002856235,0.00081546156,0.00001901379],"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.0000019924998,0.00011951496,0.000039170267,0.00036648122,0.00011926982,2.5691412e-7,0.00015051768,0.9837541,0.00013949712,0.008339353,0.000040642324,0.00692923],"study_design_scores_gemma":[0.00029242152,0.000036857793,0.0010684896,0.0005572346,0.00025110468,0.00001366186,0.00020019646,0.9219814,0.007207948,0.06601663,0.0016107952,0.0007632544],"about_ca_topic_score_codex":0.0000032062576,"about_ca_topic_score_gemma":0.0000018404169,"teacher_disagreement_score":0.2902894,"about_ca_system_score_codex":0.00009392322,"about_ca_system_score_gemma":0.00019265719,"threshold_uncertainty_score":0.98204166},"labels":[],"label_agreement":null},{"id":"W3158295436","doi":"10.1002/nla.2388","title":"Independence of placement for local Fourier analysis","year":2021,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Discretization; Multigrid method; Simple (philosophy); Representation (politics); Degrees of freedom (physics and chemistry); Operator (biology); Grid; Transfer operator; Applied mathematics; Partial differential equation; Mathematical optimization; Mathematical analysis; Geometry","score_opus":0.01588623537346656,"score_gpt":0.2975203733635784,"score_spread":0.28163413799011183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158295436","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042594573,0.00010938784,0.9984166,0.00008481345,0.000020256068,0.00033181283,0.000050290015,0.000113525006,0.00044735393],"genre_scores_gemma":[0.20874527,0.0000067216724,0.79056776,0.000052348616,0.000043333093,0.00046306304,0.000050269387,0.000026045112,0.000045172448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989514,0.000020396834,0.00033402172,0.00022905067,0.00028996356,0.00017517983],"domain_scores_gemma":[0.9985321,0.0006662103,0.000074642485,0.00034149192,0.00028616405,0.00009937092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009707221,0.00013284391,0.00031198707,0.000073501185,0.000050474566,0.0000081999115,0.00014268613,0.0000610702,0.00006862346],"category_scores_gemma":[0.00007633731,0.00012137478,0.000108330634,0.0013722214,0.00007697553,0.000045777546,0.00003001827,0.00013156087,0.000011659141],"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.0000135258,0.00010863031,0.00013790617,0.00009242627,0.00038194057,8.4274836e-7,0.000037022077,0.9508794,0.00015421066,0.026135359,0.000037990096,0.022020724],"study_design_scores_gemma":[0.00025815913,0.000051652325,0.00018193127,0.00001013034,0.00031771619,0.0000051489455,0.00008238727,0.9669135,0.005328772,0.021682385,0.0049737925,0.00019441184],"about_ca_topic_score_codex":7.586454e-7,"about_ca_topic_score_gemma":9.773354e-7,"teacher_disagreement_score":0.20831932,"about_ca_system_score_codex":0.000045601282,"about_ca_system_score_gemma":0.00004642404,"threshold_uncertainty_score":0.494952},"labels":[],"label_agreement":null},{"id":"W3183856668","doi":"10.1002/nla.2399","title":"ODE‐based double‐preconditioning for solving linear systems Aαx=b and f(A)x=b","year":2021,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Carleton University; Statistics Canada","funders":"","keywords":"Ode; Mathematics; Linear system; Computation; Applied mathematics; Ordinary differential equation; Extension (predicate logic); Matrix (chemical analysis); Linear differential equation; System of linear equations; Coefficient matrix; Algebraic number; Algebra over a field; Algorithm; Differential equation; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.016190170580138406,"score_gpt":0.2607405617680234,"score_spread":0.244550391187885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183856668","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010682928,0.0003344435,0.99610585,0.0009586565,0.0000787434,0.00061597483,0.000032127224,0.00024421155,0.00056172797],"genre_scores_gemma":[0.34344038,0.000011988002,0.6530371,0.0006180779,0.00048342207,0.0016302448,0.0001415936,0.000038555267,0.0005986315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986359,0.000036624988,0.00027789988,0.0005661092,0.00018530941,0.00029816388],"domain_scores_gemma":[0.998534,0.00035422758,0.00012057666,0.00055954506,0.00024191606,0.00018971134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020964288,0.0001717693,0.0002371668,0.0000611527,0.00043657786,0.0002099624,0.00034162254,0.00007576134,0.000023663664],"category_scores_gemma":[0.000026143309,0.00015305344,0.00006290384,0.0006313941,0.000067914116,0.0002518118,0.000091454334,0.00016223197,0.0000397948],"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.00004484386,0.00026817212,0.00020840121,0.00020112748,0.00007389757,0.000008030979,0.00014844016,0.010868408,0.0006381813,0.97288835,0.00028610876,0.014366032],"study_design_scores_gemma":[0.0013417889,0.000117096,0.00011615649,0.00005343169,0.000041331892,0.00007556566,0.00006619158,0.9377169,0.0050017578,0.0050661736,0.05000401,0.0003995766],"about_ca_topic_score_codex":0.000009057616,"about_ca_topic_score_gemma":0.0000012454555,"teacher_disagreement_score":0.9678222,"about_ca_system_score_codex":0.000024099472,"about_ca_system_score_gemma":0.00015518727,"threshold_uncertainty_score":0.6241338},"labels":[],"label_agreement":null},{"id":"W4243141097","doi":"10.1002/1099-1506(200010/12)7:7/8<489::aid-nla208>3.0.co;2-w","title":"Editorial","year":2000,"lang":"en","type":"editorial","venue":"Numerical Linear Algebra with Applications","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Applied mathematics; Calculus (dental); Orthodontics; Medicine","score_opus":0.02443248650506864,"score_gpt":0.36559506042489415,"score_spread":0.3411625739198255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243141097","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000027283327,0.00008746465,0.23227969,0.0006592548,0.7472914,0.0016980784,0.0009696808,0.00068823644,0.016323505],"genre_scores_gemma":[0.00019546958,0.00006068903,0.015380106,0.0001417995,0.9714566,0.0027741923,0.001244091,0.00012218508,0.0086248815],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9914507,0.00014935172,0.0013719765,0.0016589528,0.0048259967,0.0005429679],"domain_scores_gemma":[0.9898807,0.0045709144,0.0006948618,0.0026670396,0.001737076,0.00044943485],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00094767543,0.0005732561,0.0008582718,0.00037721437,0.0005455386,0.00045032916,0.0023594145,0.0012675545,0.0023276],"category_scores_gemma":[0.0011171945,0.0004181907,0.00030941708,0.0026712073,0.00028477883,0.00022721475,0.00017300587,0.0015259638,0.0062080026],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053559957,0.00015506675,0.0000088163515,0.000004262463,0.00002497072,4.9365497e-7,0.00001574785,0.00021341511,0.0000024851888,0.0018242694,0.97643334,0.021263553],"study_design_scores_gemma":[0.0003527636,0.00011339135,0.000008109973,0.000013901002,0.000066683606,0.0000013526234,0.000012719501,0.00072810554,0.000017037148,0.016281117,0.9818851,0.00051973027],"about_ca_topic_score_codex":0.00006292201,"about_ca_topic_score_gemma":0.000007092752,"teacher_disagreement_score":0.22416522,"about_ca_system_score_codex":0.00012170045,"about_ca_system_score_gemma":0.0007318241,"threshold_uncertainty_score":0.99982697},"labels":[],"label_agreement":null},{"id":"W4253510993","doi":"10.1002/nla.258.abs","title":"On the growth factor in Gaussian elimination for generalized Higham matrices","year":2002,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Gaussian elimination; Positive-definite matrix; Hermitian matrix; Mathematics; Gaussian; Matrix (chemical analysis); Class (philosophy); Factor (programming language); Combinatorics; Pure mathematics; Computer science; Physics; Chemistry","score_opus":0.01661374818348609,"score_gpt":0.2450198333137332,"score_spread":0.2284060851302471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253510993","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.0033053958,0.0000593501,0.98454875,0.009927425,0.00003338033,0.0009015914,0.00001836191,0.00013671366,0.0010690505],"genre_scores_gemma":[0.8873215,0.00002574186,0.10934124,0.0010923396,0.00017151104,0.0016088473,0.000013939015,0.000019857454,0.0004050274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989392,0.000063353946,0.00020916182,0.0003482011,0.00020633981,0.00023374862],"domain_scores_gemma":[0.99884874,0.00047020087,0.00009908132,0.0004350247,0.000068428104,0.000078556164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013044363,0.00014023844,0.00013881647,0.00009320819,0.00020817286,0.000082753184,0.0006317405,0.000051186,0.00010809554],"category_scores_gemma":[0.000043406177,0.00008679354,0.000052884458,0.0008296615,0.000043594988,0.00015880005,0.00004146391,0.00013826275,0.00014545543],"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.000009372258,0.00016129616,0.000029617204,0.000009124406,0.000007005121,5.728335e-7,0.00012359806,0.00009221931,0.00003405858,0.9865963,0.00041774375,0.012519131],"study_design_scores_gemma":[0.001472485,0.00047755693,0.0020222827,0.0000276199,0.00002684389,0.000012487646,0.000039267336,0.80545056,0.0025729123,0.14981095,0.03747532,0.00061173656],"about_ca_topic_score_codex":0.000008931739,"about_ca_topic_score_gemma":0.000001535676,"teacher_disagreement_score":0.8840161,"about_ca_system_score_codex":0.000030174038,"about_ca_system_score_gemma":0.000013450309,"threshold_uncertainty_score":0.35393375},"labels":[],"label_agreement":null},{"id":"W4366774998","doi":"10.1002/nla.2500","title":"A closed‐form multigrid smoothing factor for an additive Vanka‐type smoother applied to the Poisson equation","year":2023,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Numerical methods in engineering","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Poisson's equation; Smoothing; Finite element method; Mathematical analysis; Multigrid method; Applied mathematics; Discretization; Discrete Poisson equation; Partial differential equation; Mixed finite element method; Mass matrix; Laplace's equation","score_opus":0.03566184032007813,"score_gpt":0.29838171194535634,"score_spread":0.2627198716252782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366774998","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.0065374454,0.000024706993,0.9881756,0.00041348994,0.0001763573,0.002256298,0.00019925815,0.0016183014,0.0005985495],"genre_scores_gemma":[0.64797485,0.000015800038,0.3455301,0.00036986388,0.0007764697,0.0047889,0.00022351199,0.00022855953,0.000091984846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983354,0.00002789662,0.00034058696,0.000447055,0.00030620425,0.00054284773],"domain_scores_gemma":[0.99832433,0.00062279205,0.000060074355,0.0006097758,0.0001202056,0.00026282822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002285334,0.0003132108,0.00029497148,0.00015045487,0.00023620126,0.00006185732,0.00042461825,0.00012385218,0.000049502352],"category_scores_gemma":[0.0001445504,0.00023812107,0.00007114072,0.0017083832,0.000043119104,0.00013336434,0.00004858831,0.00032876385,0.0003913331],"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.00013834848,0.00013642373,0.00005580768,0.00011252915,0.00020632308,0.0000010574539,0.003409732,0.47242033,0.016434705,0.011079045,0.0017853484,0.49422035],"study_design_scores_gemma":[0.0005265484,0.00025753418,0.0022457312,0.000024378975,0.000058551967,0.0000021507176,0.0003312006,0.71512395,0.0058384263,0.0020134961,0.27289233,0.0006857419],"about_ca_topic_score_codex":0.000013704071,"about_ca_topic_score_gemma":0.0000071731674,"teacher_disagreement_score":0.6426455,"about_ca_system_score_codex":0.0001171466,"about_ca_system_score_gemma":0.000026947984,"threshold_uncertainty_score":0.9710295},"labels":[],"label_agreement":null},{"id":"W4379648388","doi":"10.1002/nla.2514","title":"A Vanka‐based parameter‐robust multigrid relaxation for the Stokes–Darcy Brinkman problems","year":2023,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"University of British Columbia","keywords":"Mathematics; Multigrid method; Discretization; Mathematical analysis; Applied mathematics; Relaxation (psychology); Stokes flow; Darcy number; Partial differential equation; Geometry; Physics; Flow (mathematics); Mechanics; Reynolds number","score_opus":0.0439613445610292,"score_gpt":0.2994658209317939,"score_spread":0.25550447637076473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379648388","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005138355,0.000080159574,0.99480945,0.001032842,0.000084620384,0.0020434102,0.00007138308,0.0012090006,0.00015529055],"genre_scores_gemma":[0.0889541,0.000022508257,0.904202,0.00021128225,0.0002310939,0.005974335,0.00017090942,0.00012059445,0.00011317814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851406,0.000038371734,0.00040750846,0.00033955707,0.0003282384,0.00037226873],"domain_scores_gemma":[0.99522066,0.0038576215,0.00012196532,0.0005098268,0.00016170274,0.00012819983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025086376,0.00024375612,0.00025074225,0.00010238462,0.00028799326,0.00006375361,0.00034992676,0.00008517078,0.00001546501],"category_scores_gemma":[0.00032438445,0.00017793413,0.00010045048,0.0013772191,0.00011910178,0.00014890317,0.00003559399,0.00029535877,0.00017235377],"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.000013567174,0.000057261423,0.00005238258,0.00012463074,0.000048625276,4.6876644e-7,0.00006648421,0.96303797,0.000112249196,0.006559282,0.00037566974,0.02955142],"study_design_scores_gemma":[0.0003923897,0.00007258743,0.00043970937,0.000024614306,0.000051035546,0.0000050055864,0.000033586683,0.9500084,0.00022681031,0.016864643,0.031633794,0.0002474024],"about_ca_topic_score_codex":0.0000032958928,"about_ca_topic_score_gemma":0.0000012071248,"teacher_disagreement_score":0.09060746,"about_ca_system_score_codex":0.000072999544,"about_ca_system_score_gemma":0.00003498117,"threshold_uncertainty_score":0.7255943},"labels":[],"label_agreement":null},{"id":"W4385694302","doi":"10.1002/nla.2529","title":"Impact of correlated observation errors on the conditioning of variational data assimilation problems","year":2023,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Meteorological Phenomena and Simulations","field":"Earth and Planetary Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"European Commission; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Data assimilation; Mathematics; Covariance; Weighting; Applied mathematics; Covariance matrix; Condition number; Rate of convergence; Non-linear least squares; Matrix (chemical analysis); Convergence (economics); Diagonal; Conjugate gradient method; Algorithm; Mathematical optimization; Eigenvalues and eigenvectors; Statistics; Computer science; Estimation theory; Key (lock)","score_opus":0.07422935551257316,"score_gpt":0.2880792033795224,"score_spread":0.21384984786694927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385694302","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.8606648,0.000020112017,0.1322317,0.0012877104,0.00004209121,0.001181125,0.001612743,0.00013358258,0.0028261594],"genre_scores_gemma":[0.9904286,0.0000040981586,0.0028734626,0.00006423844,0.00004207791,0.000023319544,0.0065207356,0.0000045039956,0.00003896153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99887615,0.00008253437,0.00034167618,0.00023501889,0.00031875545,0.00014583748],"domain_scores_gemma":[0.9980804,0.0010223226,0.00026422224,0.0004341022,0.00013660583,0.00006236709],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032046542,0.00009974738,0.0001548468,0.000079612895,0.000196825,0.000012712707,0.0003038975,0.000057839254,0.0012654244],"category_scores_gemma":[0.0001627246,0.000057409914,0.000044469816,0.001350878,0.000108244516,0.00014530848,0.000017685945,0.0001377032,0.00013578129],"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.000038399274,0.00006225963,0.26316637,0.000006872926,0.000057816214,1.2447089e-7,0.00006802156,0.724949,0.00006360073,0.009525431,0.00026838406,0.0017937446],"study_design_scores_gemma":[0.00010094783,0.0001324504,0.55461854,0.0000050632943,0.000015552569,3.2438214e-7,0.000012820751,0.44154838,0.0000040651544,0.0033704895,0.00014768839,0.00004370265],"about_ca_topic_score_codex":0.00018763445,"about_ca_topic_score_gemma":0.000017375174,"teacher_disagreement_score":0.29145214,"about_ca_system_score_codex":0.0000060630564,"about_ca_system_score_gemma":0.00007801412,"threshold_uncertainty_score":0.99964756},"labels":[],"label_agreement":null},{"id":"W4389941500","doi":"10.1002/nla.2543","title":"Generalizing reduction‐based algebraic multigrid","year":2023,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Diagonally dominant matrix; Multigrid method; Applied mathematics; Robustness (evolution); Discretization; Condition number; Mathematical optimization; Bounded function; Algorithm; Mathematical analysis; Pure mathematics; Partial differential equation","score_opus":0.01617655189294508,"score_gpt":0.2601246523332715,"score_spread":0.2439481004403264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389941500","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00258726,0.000036922844,0.9926158,0.0025618412,0.000105621584,0.000433019,0.0000094253755,0.0011455702,0.000504523],"genre_scores_gemma":[0.25951847,0.00001703384,0.73563606,0.00092611776,0.00085686153,0.0013410196,0.00014020626,0.000058286467,0.0015059592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998438,0.000068193665,0.00024324514,0.00056689023,0.00031096724,0.00037272353],"domain_scores_gemma":[0.99864775,0.00009842219,0.00009378208,0.000854372,0.00009877303,0.00020687422],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022211969,0.00018232343,0.00017078794,0.00017668455,0.0003708526,0.000091652764,0.00075464457,0.00006361598,0.00004863426],"category_scores_gemma":[0.00002094545,0.00015415552,0.000078293575,0.0025052165,0.00008805054,0.00017426646,0.00012412618,0.00018406089,0.0011637058],"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.00004183141,0.00050116703,0.0003323967,0.00006935837,0.000100521494,0.000024569432,0.00035714195,0.034499623,0.006619319,0.80193347,0.007828075,0.14769253],"study_design_scores_gemma":[0.00079487683,0.00016336273,0.0010406992,0.000020940139,0.000026210895,0.000056468583,0.000040321447,0.8211432,0.010349191,0.018346809,0.14735733,0.0006605668],"about_ca_topic_score_codex":0.00001111231,"about_ca_topic_score_gemma":4.47677e-7,"teacher_disagreement_score":0.7866436,"about_ca_system_score_codex":0.000024320849,"about_ca_system_score_gemma":0.00009465099,"threshold_uncertainty_score":0.999614},"labels":[],"label_agreement":null},{"id":"W4403584193","doi":"10.1002/nla.2593","title":"Multigrid Reduction‐In‐Time Convergence for Advection Problems: A Fourier Analysis Perspective","year":2024,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multigrid method; Mathematics; Reduction (mathematics); Advection; Convergence (economics); Perspective (graphical); Fourier transform; Fourier analysis; Applied mathematics; Mathematical optimization; Partial differential equation; Mathematical analysis; Geometry","score_opus":0.013279353579700478,"score_gpt":0.3005640920308566,"score_spread":0.2872847384511561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403584193","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080758415,0.00036870711,0.99634,0.00027372566,0.00008111288,0.0010438502,0.000045658584,0.0006424809,0.00039688146],"genre_scores_gemma":[0.1707853,0.000027769038,0.8257255,0.00001969917,0.0002465509,0.0028595899,0.000048670954,0.000069084184,0.00021784905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874204,0.000027041735,0.00033932822,0.00041958006,0.00023133979,0.00024067047],"domain_scores_gemma":[0.998937,0.0004976166,0.000042206848,0.0002539623,0.00016744467,0.00010177299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015207841,0.00019616405,0.00029139538,0.00028301394,0.00007940425,0.000039969487,0.00016004445,0.00007369404,0.000064702195],"category_scores_gemma":[0.000074882526,0.00017693815,0.00013033164,0.0027981943,0.000075445634,0.00015622882,0.000017898155,0.000236722,0.000102133185],"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.000021975704,0.00013090431,0.000106054904,0.0001860066,0.0005086726,0.000001251999,0.00042834802,0.9622602,0.00044300806,0.02814838,0.00011105391,0.007654178],"study_design_scores_gemma":[0.0001396324,0.000051776293,0.00017766394,0.000030523242,0.00022288127,0.00001101407,0.00008299205,0.94815505,0.00028410568,0.04518395,0.005427528,0.00023289377],"about_ca_topic_score_codex":0.000009965635,"about_ca_topic_score_gemma":0.0000019323318,"teacher_disagreement_score":0.17061451,"about_ca_system_score_codex":0.00023932225,"about_ca_system_score_gemma":0.000035470992,"threshold_uncertainty_score":0.7215328},"labels":[],"label_agreement":null},{"id":"W4405384795","doi":"10.1002/nla.2608","title":"Quaternion Tensor Completion via <scp>QR</scp> Decomposition and Nuclear Norm Minimization","year":2024,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Tensor decomposition and applications","field":"Mathematics","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 Manitoba","funders":"Fundo para o Desenvolvimento das Ciências e da Tecnologia; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Quaternion; Singular value decomposition; Robustness (evolution); Mathematics; Tensor (intrinsic definition); Matrix completion; Matrix norm; Mathematical optimization; Matrix decomposition; Minification; Singular value; Generalization; Algorithm; Computer science; Artificial intelligence; Mathematical analysis; Pure mathematics; Geometry; Eigenvalues and eigenvectors","score_opus":0.01797523011889221,"score_gpt":0.2937145160819113,"score_spread":0.2757392859630191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405384795","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.06792718,0.00012003804,0.92536753,0.00199936,0.000047355465,0.0012136148,0.00009180335,0.0010491301,0.0021840066],"genre_scores_gemma":[0.84154314,0.000053131087,0.15584956,0.00046438945,0.00031668955,0.00075326505,0.0005036327,0.00011861032,0.00039760812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99832344,0.00006123161,0.00044258233,0.0005778738,0.00031055333,0.0002842998],"domain_scores_gemma":[0.9985835,0.00048129674,0.00013263847,0.00040953673,0.00017099852,0.00022202608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000120008204,0.0002668258,0.00027873085,0.00016751798,0.00038849137,0.00018120512,0.00017093406,0.00013569105,0.00009740958],"category_scores_gemma":[0.000030999432,0.00023260547,0.00008183876,0.0006863258,0.00013381572,0.00021686734,0.000051173054,0.00026770498,0.00058547466],"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.000041510102,0.0010806768,0.0006663635,0.00043881987,0.00021582635,0.000009483281,0.0012043143,0.00022242378,0.011310773,0.9484992,0.013549696,0.022760894],"study_design_scores_gemma":[0.0012990411,0.00045676943,0.0072750812,0.00023743084,0.00054837327,0.00052370655,0.00048577442,0.36682606,0.0015567457,0.11322842,0.50690365,0.0006589673],"about_ca_topic_score_codex":0.000017473925,"about_ca_topic_score_gemma":0.0000043836653,"teacher_disagreement_score":0.8352708,"about_ca_system_score_codex":0.00007571246,"about_ca_system_score_gemma":0.000027427512,"threshold_uncertainty_score":0.9485376},"labels":[],"label_agreement":null},{"id":"W4410907582","doi":"10.1002/nla.70023","title":"Achieving h‐ and p‐Robust Monolithic Multigrid Solvers for the Stokes Equations","year":2025,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multigrid method; Mathematics; Applied mathematics; Computational science; Mathematical analysis; Partial differential equation","score_opus":0.022889541384707345,"score_gpt":0.2948772371208755,"score_spread":0.27198769573616816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410907582","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031984338,0.0005120662,0.9962705,0.0011503688,0.000057157922,0.0009797795,0.000024906532,0.00029331233,0.00039206425],"genre_scores_gemma":[0.11502811,0.00005177177,0.8826353,0.00025899548,0.000096455944,0.0018040907,0.000014447666,0.000035746867,0.00007510076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917746,0.000020759053,0.0002544764,0.00021857985,0.00012355765,0.0002051423],"domain_scores_gemma":[0.9957352,0.0037574696,0.000048740054,0.00029252042,0.00009746752,0.000068594054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013270094,0.00016234956,0.00018241693,0.000063946034,0.00034235,0.00003681928,0.0002021423,0.000055908095,0.000005907569],"category_scores_gemma":[0.00023535742,0.000117481046,0.000045707042,0.00052789226,0.00013692418,0.00007678802,0.000040069655,0.00021748513,0.000008482558],"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.000013050641,0.00005302517,0.00011668777,0.00014018033,0.00012464057,1.1801358e-7,0.00012560714,0.77683127,0.00018949586,0.13710284,0.00019177819,0.085111305],"study_design_scores_gemma":[0.00021667071,0.000023258179,0.000409705,0.000026635607,0.00008267847,0.0000018418611,0.0001267076,0.9664419,0.00016608935,0.016229182,0.01611404,0.00016128892],"about_ca_topic_score_codex":0.000002456835,"about_ca_topic_score_gemma":0.0000010676241,"teacher_disagreement_score":0.18961063,"about_ca_system_score_codex":0.00004452325,"about_ca_system_score_gemma":0.000029798286,"threshold_uncertainty_score":0.4790738},"labels":[],"label_agreement":null}]}