{"meta":{"query_hash":"0bce8855159e","filters":{"venue":"SIAM Journal on Matrix Analysis and Applications"},"cohort_total":35,"direct_labels_cover":0,"predictions_cover":35,"exported":35,"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/0bce8855159e","api":"https://metacan.xera.ac/api/v1/cohort?venue=SIAM+Journal+on+Matrix+Analysis+and+Applications"},"results":[{"id":"W1966533816","doi":"10.1137/110843137","title":"A Structure-Preserving Curve for Symplectic Pairs and Its Applications","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and 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":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Symplectic geometry; Parameterized complexity; Monotonic function; Numerical analysis; Fixed-point iteration; Convergence (economics); Newton's method; Hermitian matrix; Positive-definite matrix; Matrix (chemical analysis); Mathematical analysis; Fixed point; Applied mathematics; Eigenvalues and eigenvectors; Pure mathematics; Combinatorics; Nonlinear system","score_opus":0.013262611756757872,"score_gpt":0.2915573135472009,"score_spread":0.278294701790443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966533816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41793826,0.0011701412,0.55496645,0.0007908976,0.00008214622,0.00016194498,0.00011421679,0.0003014244,0.024474509],"genre_scores_gemma":[0.8653609,0.0008297728,0.12604739,0.000069837464,0.00007089315,0.00013370797,0.00011768153,0.00015452816,0.0072152056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969053,0.00008517459,0.00001750793,0.00006884033,0.00010126972,0.00003664799],"domain_scores_gemma":[0.9989579,0.0003580506,0.0001945877,0.00012926832,0.00019153363,0.00016869031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006503462,0.00065565633,0.00051848456,0.001447076,0.0012473488,0.0010606697,0.0006079841,0.0011047049,0.0030944617],"category_scores_gemma":[0.0054379646,0.0003672505,0.00068504823,0.0006406435,0.0021814841,0.0015739301,0.0023978336,0.0012813604,0.0004894651],"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.00007989501,0.000047089798,0.0015009545,0.00017779709,0.0000151743625,0.00022995338,0.00054807373,0.04795787,0.011851179,0.9051963,0.00068900053,0.031706735],"study_design_scores_gemma":[0.00004570228,0.00040132474,0.0011577834,0.00008780233,0.000013438547,0.00077419216,0.00027068864,0.5135351,0.009793879,0.45929956,0.0145683745,0.000052124604],"about_ca_topic_score_codex":0.00050047226,"about_ca_topic_score_gemma":0.00020258054,"teacher_disagreement_score":0.0030944617,"about_ca_system_score_codex":0.0008189849,"about_ca_system_score_gemma":0.00057012006,"threshold_uncertainty_score":0.0103520155},"labels":[],"label_agreement":null},{"id":"W1968250174","doi":"10.1137/040620047","title":"A Multipreconditioned Conjugate Gradient Algorithm","year":2006,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":51,"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":"Conjugate gradient method; Preconditioner; Mathematics; Derivation of the conjugate gradient method; Conjugate residual method; Algorithm; Positive-definite matrix; Generalization; Matrix (chemical analysis); Nonlinear conjugate gradient method; Applied mathematics; Biconjugate gradient method; Linear system; Block (permutation group theory); Cholesky decomposition; Gradient method; Conjugate; Domain decomposition methods; Relation (database); Coefficient matrix; Gradient descent; Computer science; Iterative method; Combinatorics; Mathematical analysis; Eigenvalues and eigenvectors; Finite element method; Artificial intelligence","score_opus":0.005290628705126683,"score_gpt":0.24559488815734168,"score_spread":0.240304259452215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968250174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015788662,0.000050144878,0.99667406,0.00006382449,0.00005309195,0.000038989423,0.00003130412,0.0003713835,0.0011384126],"genre_scores_gemma":[0.039497524,0.000102035105,0.9540662,0.00012417487,0.000056695524,0.00017640463,0.0001604512,0.00018457133,0.005631927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993598,0.000172021,0.000035407997,0.00011056017,0.00026623602,0.000056051937],"domain_scores_gemma":[0.9992982,0.00017556433,0.000044544187,0.00015452638,0.0002681109,0.00005894155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007035067,0.00070503796,0.0010784119,0.0005978958,0.0004491131,0.0009240672,0.0017440586,0.0013707352,0.007382967],"category_scores_gemma":[0.0018111961,0.0005908914,0.0006782389,0.0007016971,0.0006979151,0.0012673252,0.001645596,0.0015151917,0.0031838936],"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.00021591347,0.00015042983,0.00059854117,0.00018987064,0.000094113064,0.00024287474,0.00011538629,0.5225598,0.020760424,0.08305053,0.012694955,0.35932714],"study_design_scores_gemma":[0.000028954737,0.000027383538,0.00005594158,0.0000069358684,0.000006287141,0.00004613339,0.0000047326757,0.98418576,0.0030638468,0.007982844,0.004580189,0.000010921283],"about_ca_topic_score_codex":0.0019585507,"about_ca_topic_score_gemma":0.002571405,"teacher_disagreement_score":0.007382967,"about_ca_system_score_codex":0.0004628482,"about_ca_system_score_gemma":0.0015473658,"threshold_uncertainty_score":0.024698436},"labels":[],"label_agreement":null},{"id":"W1969892577","doi":"10.1137/s0895479898348519","title":"On a Newton-Like Method for Solving Algebraic Riccati Equations","year":2000,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Controllability; Mathematics; Algebraic Riccati equation; Newton's method; Convergence (economics); Algebraic equation; Algebraic number; Applied mathematics; Riccati equation; Conjecture; Rate of convergence; Mathematical analysis; Pure mathematics; Partial differential equation; Computer science; Nonlinear system","score_opus":0.04000195251417463,"score_gpt":0.404159534645647,"score_spread":0.3641575821314724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969892577","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038080914,0.00070487906,0.99101806,0.00016935433,0.000112666254,0.000064815256,0.00003129536,0.00013454302,0.003956216],"genre_scores_gemma":[0.08733795,0.0022457582,0.8960553,0.00025968748,0.00025016713,0.00034444628,0.00013549565,0.00018686349,0.013184441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962807,0.00013292542,0.000013573594,0.000039146136,0.00016937044,0.000016946506],"domain_scores_gemma":[0.9996624,0.00018258503,0.000028688915,0.000024075687,0.000086846434,0.000015311993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007126311,0.00068050704,0.0006814756,0.00056273374,0.00048183382,0.00041379625,0.00068444957,0.0008539342,0.0029556958],"category_scores_gemma":[0.0013377647,0.00035167002,0.0006046353,0.00075945194,0.0011082165,0.000875057,0.0009692785,0.0013003239,0.0010445621],"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.00015047692,0.000112362985,0.000700291,0.00072853063,0.00007486259,0.00036479963,0.000421761,0.43595818,0.01974008,0.25262597,0.008745428,0.2803773],"study_design_scores_gemma":[0.000022955077,0.00008321112,0.00021034041,0.00003161725,0.000012534255,0.00009513,0.00001580096,0.9480091,0.0021337564,0.029581232,0.019774085,0.000030327792],"about_ca_topic_score_codex":0.0031315994,"about_ca_topic_score_gemma":0.0032612279,"teacher_disagreement_score":0.0031315994,"about_ca_system_score_codex":0.00035130762,"about_ca_system_score_gemma":0.0005387125,"threshold_uncertainty_score":0.0098878145},"labels":[],"label_agreement":null},{"id":"W1982059058","doi":"10.1137/080724071","title":"Stopping Criteria for the Iterative Solution of Linear Least Squares Problems","year":2009,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Residual; Least-squares function approximation; Mathematical optimization; Limit (mathematics); Applied mathematics; Iterative method; Numerical analysis; Property (philosophy); Linear least squares; Algorithm; Linear model; Statistics; Mathematical analysis","score_opus":0.02002872561713478,"score_gpt":0.31837690690640064,"score_spread":0.2983481812892659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982059058","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030193045,0.0003051868,0.99495065,0.00020678311,0.000029443961,0.000040738014,0.000018489,0.0001264106,0.0013029713],"genre_scores_gemma":[0.18019553,0.0006065183,0.81341094,0.0003908015,0.00015164808,0.00070634513,0.0002722646,0.0006398609,0.0036261103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9900789,0.0058059725,0.00057657756,0.000619014,0.0025613583,0.00035813847],"domain_scores_gemma":[0.9521485,0.03572194,0.0029995472,0.0016293696,0.0066942,0.0008064768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014991079,0.0015033631,0.0015490944,0.0016699203,0.0009351234,0.0020140624,0.0021844807,0.0022551473,0.0029862754],"category_scores_gemma":[0.0686665,0.00075820927,0.0010373796,0.0011258541,0.002976218,0.0023864326,0.002722976,0.0030849134,0.001259777],"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.0005121968,0.0000912581,0.0037204835,0.00096268347,0.000162551,0.00063195254,0.00084278936,0.44144782,0.019712169,0.43571493,0.0052294987,0.09097162],"study_design_scores_gemma":[0.000031481388,0.00010011035,0.00027378293,0.00009750577,0.00001598012,0.00010672526,0.00003898362,0.9114553,0.006311006,0.0781446,0.0033848311,0.000039745075],"about_ca_topic_score_codex":0.0008871568,"about_ca_topic_score_gemma":0.0006057679,"teacher_disagreement_score":0.014991079,"about_ca_system_score_codex":0.0010307924,"about_ca_system_score_gemma":0.0013671304,"threshold_uncertainty_score":0.07928133},"labels":[],"label_agreement":null},{"id":"W2004529037","doi":"10.1137/s0895479803428230","title":"Block Diagonal and Schur Complement Preconditioners for Block-Toeplitz Systems with Small Size Blocks","year":2007,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and 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":"Toronto Metropolitan University","funders":"","keywords":"Toeplitz matrix; Mathematics; Schur complement; Block matrix; Block (permutation group theory); Levinson recursion; Hermitian matrix; Combinatorics; Eigenvalues and eigenvectors; Pure mathematics","score_opus":0.012849499640514168,"score_gpt":0.2684716224729193,"score_spread":0.2556221228324051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004529037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010040423,0.00012771545,0.98796535,0.000103265884,0.00003555935,0.000032040873,0.000024366647,0.00008232878,0.0015890406],"genre_scores_gemma":[0.322817,0.0006192655,0.66623145,0.00014742315,0.00009860581,0.00023773716,0.00014249973,0.00011754933,0.009588508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962413,0.00015359605,0.000013252106,0.000044796598,0.00012633865,0.000037917933],"domain_scores_gemma":[0.999138,0.0005457168,0.00006888159,0.00007078498,0.00013692942,0.000039655537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005838138,0.00067244866,0.00062770053,0.00023508248,0.00036929498,0.0005446079,0.00048894837,0.0010313179,0.0031256757],"category_scores_gemma":[0.0022066066,0.0002985257,0.00035475413,0.0004118565,0.0009669284,0.0007904017,0.000661888,0.0011020919,0.00064572616],"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.00017408149,0.00008241965,0.00045950478,0.00021811879,0.000041415937,0.0002596014,0.00016150285,0.8079608,0.023330024,0.10751335,0.0026264687,0.05717275],"study_design_scores_gemma":[0.000009611335,0.000022620172,0.000041453375,0.0000033716929,0.0000029948728,0.000016138212,0.00001009087,0.9907941,0.001859755,0.006220474,0.0010151415,0.0000041454496],"about_ca_topic_score_codex":0.0037418425,"about_ca_topic_score_gemma":0.0042414945,"teacher_disagreement_score":0.0037418425,"about_ca_system_score_codex":0.0003458198,"about_ca_system_score_gemma":0.001103561,"threshold_uncertainty_score":0.010456383},"labels":[],"label_agreement":null},{"id":"W2013927575","doi":"10.1137/100812483","title":"Monotonicity of Perturbed Tridiagonal $M$-Matrices","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Molecular spectroscopy and chirality","field":"Chemistry","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":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Tridiagonal matrix; Mathematics; Rank (graph theory); Monotonic function; Toeplitz matrix; Tridiagonal matrix algorithm; Applied mathematics; Matrix (chemical analysis); Inverse; Linear algebra; Combinatorics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.007754189406753544,"score_gpt":0.2929794551796511,"score_spread":0.2852252657728976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013927575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14364475,0.0003802338,0.8265852,0.000788437,0.000119329314,0.0000757859,0.00023314489,0.0003377823,0.02783543],"genre_scores_gemma":[0.87296736,0.0004999501,0.118664354,0.00044452574,0.000086389344,0.00019959791,0.00022725122,0.00019806295,0.006712513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980867,0.0007242081,0.0000940171,0.00031102684,0.000581836,0.0002022416],"domain_scores_gemma":[0.9938736,0.0029360931,0.0008973599,0.0006989176,0.001223609,0.00037039138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021460452,0.00086179737,0.00040866112,0.00083388167,0.0005934259,0.0012465192,0.00092928845,0.00079239527,0.0029238944],"category_scores_gemma":[0.012209213,0.0003791503,0.00047825716,0.0003708242,0.0024045042,0.002276777,0.0016494022,0.0018226539,0.000614836],"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.0002895538,0.00010902732,0.0019204718,0.0002498144,0.00004105705,0.000554183,0.00038213943,0.1223226,0.10846705,0.7334053,0.0034164991,0.02884232],"study_design_scores_gemma":[0.000015347257,0.00013482159,0.00075357716,0.000033819313,0.00000764075,0.0003086974,0.000103512764,0.71180415,0.030340495,0.25340092,0.0030489198,0.000048068356],"about_ca_topic_score_codex":0.0007757583,"about_ca_topic_score_gemma":0.000717832,"teacher_disagreement_score":0.0029238944,"about_ca_system_score_codex":0.0007120625,"about_ca_system_score_gemma":0.0007545933,"threshold_uncertainty_score":0.011349559},"labels":[],"label_agreement":null},{"id":"W2015224767","doi":"10.1137/s0895479802402818","title":"Optimization and Pseudospectra, with Applications to Robust Stability","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Lipschitz continuity; Mathematical analysis; Matrix (chemical analysis); Condition number; Applied mathematics; Complex plane","score_opus":0.01048618722052016,"score_gpt":0.2502751010984845,"score_spread":0.23978891387796433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015224767","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056097857,0.00500494,0.97623867,0.0010343571,0.00016590451,0.00003061307,0.000046150624,0.00014049176,0.011729031],"genre_scores_gemma":[0.5219045,0.020302858,0.41862622,0.001114612,0.0021029147,0.0006188475,0.00029188383,0.0008756644,0.034162506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886274,0.00050706306,0.000068108384,0.00019608883,0.0003200847,0.000045942747],"domain_scores_gemma":[0.99657696,0.0023505366,0.0003983685,0.00017957312,0.0003976232,0.000096938325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021482029,0.0019126456,0.0009729183,0.0018439972,0.00061881775,0.0017424579,0.000936488,0.0017619686,0.0037979109],"category_scores_gemma":[0.0063177855,0.00065178453,0.0012942706,0.0020181513,0.0031040777,0.0022955844,0.002856746,0.0028190985,0.0007027843],"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.0000416513,0.000041053845,0.0005089598,0.00026440853,0.00007100047,0.00015648782,0.00022088955,0.30399072,0.0040110773,0.6370138,0.002760601,0.050919343],"study_design_scores_gemma":[0.0000068040677,0.00003632806,0.00018051817,0.000042961758,0.000010908389,0.00007396082,0.00003293775,0.69328076,0.0007550813,0.29998192,0.005573746,0.000024039058],"about_ca_topic_score_codex":0.0017660427,"about_ca_topic_score_gemma":0.0012852736,"teacher_disagreement_score":0.0037979109,"about_ca_system_score_codex":0.0013974673,"about_ca_system_score_gemma":0.0008182801,"threshold_uncertainty_score":0.012705326},"labels":[],"label_agreement":null},{"id":"W2069382953","doi":"10.1137/s0895479898342432","title":"Convergence of Subdivision Schemes Associated with Nonnegative Masks","year":2000,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","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 Alberta","funders":"","keywords":"Subdivision; Mathematics; Convergence (economics); Sequence (biology); Combinatorics; Euclidean space; Applied mathematics; Matrix (chemical analysis); Discrete mathematics; Pure mathematics","score_opus":0.0040495328849278,"score_gpt":0.24540834543487222,"score_spread":0.24135881254994443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069382953","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20156974,0.000325457,0.7920185,0.00022114269,0.000061560444,0.00008111856,0.000041345458,0.00013107482,0.005550036],"genre_scores_gemma":[0.7327773,0.00035363084,0.25929746,0.00009070413,0.00003736183,0.0001637902,0.00013822659,0.00013853674,0.007002896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897635,0.00034098074,0.000083451814,0.0001342322,0.00035492858,0.00011009612],"domain_scores_gemma":[0.9966012,0.0018948534,0.00053140643,0.0003455192,0.00043538254,0.00019156166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022444169,0.0007074451,0.00054852077,0.00093250093,0.00052329537,0.0011396875,0.0007449946,0.0009966481,0.0015192109],"category_scores_gemma":[0.009581954,0.00037884264,0.0007152369,0.00035150678,0.0021565137,0.0012569394,0.00222069,0.0011560638,0.00025605084],"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.00031298364,0.000048435537,0.0038114362,0.00014128187,0.000035475754,0.0001821753,0.0006473965,0.2582039,0.056966364,0.6391468,0.0005975625,0.039906215],"study_design_scores_gemma":[0.000017575281,0.00005683682,0.00028103724,0.000021503129,0.0000062493227,0.000051502666,0.0000342538,0.9307511,0.008636144,0.058994528,0.0011325337,0.000016771812],"about_ca_topic_score_codex":0.002973077,"about_ca_topic_score_gemma":0.0019805422,"teacher_disagreement_score":0.002973077,"about_ca_system_score_codex":0.001554233,"about_ca_system_score_gemma":0.00091732043,"threshold_uncertainty_score":0.011869729},"labels":[],"label_agreement":null},{"id":"W2118811613","doi":"10.1137/s089547980036838x","title":"Twice Differentiable Spectral Functions","year":2001,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":90,"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; Differentiable function; Hessian matrix; Eigenvalues and eigenvectors; Pure mathematics; Symmetric matrix; Function (biology); Mathematical analysis; Matrix (chemical analysis); Applied mathematics","score_opus":0.007979552960835083,"score_gpt":0.2555741821285429,"score_spread":0.2475946291677078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118811613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12348103,0.00093304046,0.8360401,0.0011073782,0.00029827395,0.000051909166,0.00035785057,0.0005567973,0.037173565],"genre_scores_gemma":[0.8667603,0.001212605,0.09469093,0.00045145283,0.00034411292,0.00013608043,0.0004146569,0.0004868926,0.035502978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993781,0.0001230221,0.000031814106,0.00013098119,0.00022312588,0.000112901325],"domain_scores_gemma":[0.99801826,0.00059276144,0.00020585695,0.0002461479,0.0006656294,0.00027137145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000947605,0.0009845054,0.0005379859,0.0016213238,0.00055496686,0.0016249253,0.00068035885,0.0014107588,0.006295066],"category_scores_gemma":[0.004225913,0.00028962136,0.00051154307,0.00074200565,0.001770443,0.0033594957,0.0011824048,0.0015935972,0.0018484112],"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.00006183396,0.000030364637,0.00070837606,0.00007106004,0.000013097011,0.00038871352,0.00026395312,0.011452433,0.0152882105,0.9336768,0.003508626,0.034536567],"study_design_scores_gemma":[0.000017818222,0.00006912994,0.0010793986,0.00004245468,0.000010163047,0.00067824183,0.00020957438,0.18240446,0.007574796,0.7975833,0.010273838,0.000056808698],"about_ca_topic_score_codex":0.0006488421,"about_ca_topic_score_gemma":0.0004423977,"teacher_disagreement_score":0.006295066,"about_ca_system_score_codex":0.000777539,"about_ca_system_score_gemma":0.0004852578,"threshold_uncertainty_score":0.021059036},"labels":[],"label_agreement":null},{"id":"W2123353000","doi":"10.1137/s0895479803433313","title":"Pseudospectral Components and the Distance to Uncontrollability","year":2004,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Advanced Control Systems Optimization","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Parameterized complexity; Function (biology); Norm (philosophy); Signed distance function; Combinatorics; Discrete mathematics; Algorithm","score_opus":0.0031728319317213664,"score_gpt":0.2245980615940208,"score_spread":0.22142522966229944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123353000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46755305,0.00023156618,0.5173445,0.00029451135,0.000027925835,0.000038147635,0.00012508236,0.00034676478,0.014038461],"genre_scores_gemma":[0.94753224,0.00014807885,0.049551204,0.000053595584,0.000018566387,0.00008394924,0.00015876077,0.000093619914,0.0023600247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999252,0.00015096024,0.000038339276,0.0001408225,0.000325767,0.00009197342],"domain_scores_gemma":[0.994609,0.0027336464,0.0008111527,0.0007285265,0.0007758908,0.0003418448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006943435,0.00068187097,0.00041503517,0.0016763549,0.000726671,0.0014225276,0.0008378653,0.00081861974,0.0045101563],"category_scores_gemma":[0.008466361,0.00041549694,0.00042339912,0.0008487461,0.0020448938,0.0025691688,0.0020662006,0.0009745906,0.00047119326],"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.00050873024,0.00009820963,0.0069346107,0.00017416551,0.00007524746,0.00028015792,0.0006694838,0.24886435,0.025342884,0.61921567,0.0012597223,0.09657682],"study_design_scores_gemma":[0.000021102729,0.00013870315,0.0043553347,0.000034433444,0.000016629661,0.0002567695,0.00013814276,0.6116233,0.013396063,0.367798,0.0021709364,0.000050681167],"about_ca_topic_score_codex":0.00075762026,"about_ca_topic_score_gemma":0.00057966146,"teacher_disagreement_score":0.0045101563,"about_ca_system_score_codex":0.00071294454,"about_ca_system_score_gemma":0.00042393585,"threshold_uncertainty_score":0.015088022},"labels":[],"label_agreement":null},{"id":"W2131237233","doi":"10.1137/080742531","title":"Adaptive First-Order Methods for General Sparse Inverse Covariance Selection","year":2010,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Estimation of covariance matrices; Covariance; Applied mathematics; Gaussian; Inverse; Lasso (programming language); Covariance matrix; Conditional independence; Algorithm; Mathematical optimization; Statistics; Computer science","score_opus":0.06542253355019306,"score_gpt":0.436244996765416,"score_spread":0.37082246321522294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131237233","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012467268,0.00020932686,0.99772173,0.00009341574,0.000024606758,0.000028087974,0.00003299604,0.00018711525,0.00045598348],"genre_scores_gemma":[0.06020716,0.0006684961,0.9338369,0.00023313823,0.00015940821,0.00042757686,0.00036561847,0.0003085012,0.0037933579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985631,0.0006578999,0.000048559254,0.00020623623,0.00043405904,0.00009022984],"domain_scores_gemma":[0.99526453,0.003488709,0.00027205705,0.00037170085,0.0004966787,0.00010635147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029497927,0.0014607975,0.0016417252,0.0012907278,0.00071101345,0.0011909305,0.002161132,0.0021339313,0.0038612445],"category_scores_gemma":[0.010227878,0.0010440268,0.0018386714,0.0014052023,0.0012896064,0.0016049691,0.0018461313,0.0031657561,0.001519138],"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.00009238828,0.000114058836,0.00079470844,0.0003080417,0.00013707556,0.00010894817,0.00015045346,0.8018357,0.0024667778,0.07626228,0.004175019,0.1135546],"study_design_scores_gemma":[0.000011593993,0.000012672597,0.000060975595,0.000008331223,0.000005717737,0.00002007554,0.0000065558247,0.9868608,0.0003120252,0.01150101,0.0011922484,0.000007990922],"about_ca_topic_score_codex":0.007288998,"about_ca_topic_score_gemma":0.009633038,"teacher_disagreement_score":0.007288998,"about_ca_system_score_codex":0.0010319931,"about_ca_system_score_gemma":0.0026011348,"threshold_uncertainty_score":0.015600145},"labels":[],"label_agreement":null},{"id":"W2143526866","doi":"10.1137/120896499","title":"Birkhoff--von Neumann Theorem for Multistochastic Tensors","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Tensor decomposition and applications","field":"Mathematics","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":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Extreme point; Permutation (music); Tensor (intrinsic definition); Class (philosophy); Permutation matrix; Von Neumann architecture; Set (abstract data type); Pure mathematics; Regular polygon; Combinatorics; Algebra over a field; Geometry","score_opus":0.021071244987455683,"score_gpt":0.33686466200191195,"score_spread":0.3157934170144563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143526866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20892167,0.0016853813,0.71234936,0.0023750535,0.00036940773,0.000084784326,0.00049301336,0.00024195366,0.073479414],"genre_scores_gemma":[0.9399772,0.0010990944,0.04575387,0.0004953121,0.00039000667,0.00018205967,0.0004614745,0.000114382055,0.011526598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998207,0.0003605915,0.00010539445,0.0003216025,0.0006853607,0.00031997403],"domain_scores_gemma":[0.99605644,0.0016384295,0.00041963818,0.0003841181,0.0009602756,0.00054118835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028835135,0.00076024886,0.00086194515,0.0021535996,0.0021989995,0.0019604287,0.00093220465,0.0011032835,0.0054657273],"category_scores_gemma":[0.0064224554,0.00037752418,0.001028569,0.00094640814,0.003923489,0.0059446804,0.002462213,0.002721925,0.0010050668],"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.000015120505,0.000008559624,0.00015972638,0.000023071036,0.0000055651494,0.00005886246,0.000057321904,0.0012754144,0.0008077874,0.9953483,0.00040380916,0.0018365388],"study_design_scores_gemma":[0.000005908837,0.000016955108,0.00018202487,0.000012487554,0.0000038318412,0.000094785144,0.000033198863,0.018343069,0.00066740415,0.9794741,0.0011529566,0.000013278537],"about_ca_topic_score_codex":0.0009802646,"about_ca_topic_score_gemma":0.0008495998,"teacher_disagreement_score":0.0054657273,"about_ca_system_score_codex":0.0013897854,"about_ca_system_score_gemma":0.0010723466,"threshold_uncertainty_score":0.018284619},"labels":[],"label_agreement":null},{"id":"W2150327219","doi":"10.1137/100789890","title":"Finite-state Markov Chains Obey Benford’s Law","year":2011,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Benford’s Law and Fraud Detection","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Vrije Universiteit Amsterdam","keywords":"Benford's law; Mathematics; Markov chain; Additive Markov chain; Continuous-time Markov chain; Aperiodic graph; Stochastic matrix; Markov kernel; Probability distribution; Discrete phase-type distribution; Markov property; Balance equation; Markov chain mixing time; Discrete mathematics; Absorbing Markov chain; Variable-order Markov model; Markov model; Combinatorics; Statistics","score_opus":0.036541488764678394,"score_gpt":0.2982677345771709,"score_spread":0.2617262458124925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150327219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12322045,0.0005018122,0.8484331,0.0017658988,0.00012355308,0.00022655731,0.00045196383,0.0005390854,0.024737563],"genre_scores_gemma":[0.9157555,0.0006201338,0.06977621,0.00056582957,0.00018281888,0.00045156226,0.00037752886,0.00011098894,0.012159425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997844,0.00055918685,0.000104457606,0.0004921436,0.00055626815,0.0004439899],"domain_scores_gemma":[0.9864611,0.008945985,0.0011851758,0.0013468241,0.0016484756,0.00041252372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025055872,0.0006578605,0.0015464775,0.0012534036,0.0021535114,0.0028038668,0.0014198945,0.002572868,0.005730203],"category_scores_gemma":[0.014758592,0.0006255717,0.0011325388,0.0010545613,0.00430624,0.004256365,0.0013989526,0.003227524,0.0015831941],"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.00004149752,0.000022317083,0.0012975101,0.000029839042,0.000019733729,0.00020217671,0.00034588226,0.028068185,0.00076129846,0.9644812,0.0010382703,0.0036921508],"study_design_scores_gemma":[0.000034767014,0.000023269587,0.00055448624,0.000035680427,0.00001121614,0.0001672706,0.00007569563,0.2825963,0.0009317176,0.71291184,0.0026119351,0.00004578265],"about_ca_topic_score_codex":0.0059257695,"about_ca_topic_score_gemma":0.005046561,"teacher_disagreement_score":0.0059257695,"about_ca_system_score_codex":0.001928597,"about_ca_system_score_gemma":0.0017873991,"threshold_uncertainty_score":0.01916945},"labels":[],"label_agreement":null},{"id":"W2278832452","doi":"10.1137/16m1062454","title":"Reordering Strategy for Blocking Optimization in Sparse Linear Solvers","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"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":"Direction Générale de l’Armement; Université de Bordeaux; Agence Nationale de la Recherche","keywords":"Granularity; Solver; Computer science; Block (permutation group theory); Kernel (algebra); Sparse matrix; Parallel computing; Linear algebra; LU decomposition; Linear system; Computation; Algorithm; Theoretical computer science; Matrix decomposition; Mathematics; Eigenvalues and eigenvectors","score_opus":0.029945912898479372,"score_gpt":0.33527092304797645,"score_spread":0.3053250101494971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2278832452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020660799,0.00043991138,0.9656839,0.0002079499,0.00015774286,0.000074956115,0.000094322546,0.0020426812,0.010637824],"genre_scores_gemma":[0.20015606,0.00051809644,0.78435344,0.00026379232,0.00010535579,0.00023713331,0.0006000337,0.0018287154,0.0119374255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999416,0.00016540148,0.00003181016,0.00005647448,0.00022341225,0.00010698347],"domain_scores_gemma":[0.9991135,0.0003651344,0.000088485125,0.0001475196,0.0002227896,0.00006252924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006920129,0.0010471656,0.00088450476,0.0005844468,0.00062885234,0.00075541786,0.0009583507,0.0005837565,0.006480933],"category_scores_gemma":[0.0021857095,0.0003923867,0.00053867546,0.00065932865,0.00067701226,0.00081029074,0.00078837556,0.0013230174,0.0022765615],"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.00063488865,0.00033265693,0.0011731627,0.00039776304,0.00007225864,0.0003249988,0.00035197916,0.4855049,0.064114176,0.121575505,0.01935375,0.306164],"study_design_scores_gemma":[0.00004479264,0.00009165033,0.00013334089,0.000023310187,0.000014327638,0.00006428683,0.000036731715,0.9570467,0.017495517,0.014230199,0.010802401,0.000016751665],"about_ca_topic_score_codex":0.005058858,"about_ca_topic_score_gemma":0.0079029165,"teacher_disagreement_score":0.006480933,"about_ca_system_score_codex":0.000712736,"about_ca_system_score_gemma":0.0014609082,"threshold_uncertainty_score":0.021680892},"labels":[],"label_agreement":null},{"id":"W2759845240","doi":"10.1137/16m1084717","title":"Discrete Fourier Transform Tensors and Their Ranks","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Rank (graph theory); Tensor (intrinsic definition); Discrete Fourier transform (general); Dimension (graph theory); Generalization; Tensor contraction; Tensor field; Tensor product; Symmetric tensor; Pure mathematics; Tensor density; Mathematical analysis; Fourier transform; Combinatorics; Fourier analysis; Exact solutions in general relativity; Fractional Fourier transform","score_opus":0.023471862087207213,"score_gpt":0.34247139287467526,"score_spread":0.31899953078746807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759845240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1514228,0.0041123494,0.7792045,0.0020388588,0.0008788813,0.00010094189,0.0010307488,0.0008515255,0.060359344],"genre_scores_gemma":[0.79085445,0.00400864,0.16712575,0.00060845935,0.0015024627,0.00016290075,0.0011041822,0.0007747354,0.03385843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859947,0.0003176255,0.000078955185,0.00020251983,0.0005833497,0.00021817363],"domain_scores_gemma":[0.9951137,0.0015675001,0.0008234072,0.0007569836,0.0011714556,0.000566988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017071457,0.0011438483,0.00061786955,0.003453612,0.0008227387,0.002908018,0.0007567515,0.0010594906,0.0081118],"category_scores_gemma":[0.009903832,0.00043272384,0.0006693425,0.0013600535,0.0033917315,0.004665406,0.002164086,0.0022702278,0.0020744335],"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.000038556598,0.000026150748,0.00051506155,0.00006385941,0.000009893845,0.00011220519,0.00019241417,0.00726078,0.0029484532,0.9697771,0.0020818468,0.016973604],"study_design_scores_gemma":[0.000007872599,0.000051604293,0.0006201483,0.00003838945,0.0000073979077,0.00021541155,0.00011260777,0.05352182,0.0019699018,0.93519455,0.00822247,0.000037918544],"about_ca_topic_score_codex":0.0011337516,"about_ca_topic_score_gemma":0.000887429,"teacher_disagreement_score":0.0081118,"about_ca_system_score_codex":0.00086781435,"about_ca_system_score_gemma":0.0009215947,"threshold_uncertainty_score":0.027136683},"labels":[],"label_agreement":null},{"id":"W2765671816","doi":"10.1137/140986566","title":"On the Symmetric Componentwise Relative Backward Error for Linear Systems of Equations","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and 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":"McGill University","funders":"Fondation Sciences et Technologies pour l’Aéronautique et l’Espace","keywords":"Mathematics; Upper and lower bounds; Order (exchange); Applied mathematics; Mathematical analysis","score_opus":0.034737947332930105,"score_gpt":0.32145655974525583,"score_spread":0.2867186124123257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765671816","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005275692,0.0004969978,0.9891627,0.00041470554,0.00023730923,0.00004682362,0.000057419416,0.00019636682,0.004111994],"genre_scores_gemma":[0.45350578,0.002250807,0.52892894,0.0008394929,0.0004284812,0.00050241046,0.00050850946,0.0008760055,0.012159499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964855,0.0012070766,0.00024935318,0.00035908297,0.0014575386,0.00024150444],"domain_scores_gemma":[0.98177576,0.013234072,0.0008267111,0.00138374,0.002446996,0.00033274322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008389208,0.0023589975,0.0012575585,0.0015934183,0.0009247098,0.0018412706,0.0014622415,0.0017953209,0.008262251],"category_scores_gemma":[0.03452754,0.00060930464,0.00096342753,0.00086075265,0.0029957858,0.003706152,0.004859158,0.004148209,0.0025432936],"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.0004276378,0.000091960035,0.0009496594,0.0008082176,0.000091743495,0.00030254718,0.00038709276,0.48589584,0.015034488,0.40035796,0.0054296134,0.09022308],"study_design_scores_gemma":[0.000016607484,0.00007805824,0.00017139378,0.0000779199,0.000016896049,0.00008644347,0.00003720661,0.8879693,0.005622118,0.103586935,0.0023031873,0.000033926994],"about_ca_topic_score_codex":0.0020587838,"about_ca_topic_score_gemma":0.0019683843,"teacher_disagreement_score":0.008389208,"about_ca_system_score_codex":0.001331038,"about_ca_system_score_gemma":0.002037845,"threshold_uncertainty_score":0.044366896},"labels":[],"label_agreement":null},{"id":"W2792285932","doi":"10.1137/18m1177019","title":"Large-Scale and Global Maximization of the Distance to Instability","year":2018,"lang":"en","type":"preprint","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"École Polytechnique Fédérale de Lausanne; York University","keywords":"Subspace topology; Linear subspace; Instability; Maximization; Matrix (chemical analysis); Convergence (economics); Dimension (graph theory); Mathematical optimization; Rate of convergence; Mathematics; Scale (ratio); Computer science; Applied mathematics; Mathematical analysis; Physics; Key (lock); Combinatorics; Pure mathematics","score_opus":0.008253515633085217,"score_gpt":0.26758897461548176,"score_spread":0.2593354589823965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792285932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054781258,0.0001661785,0.9398754,0.00037947908,0.000020712465,0.000030100122,0.00004492906,0.000084964035,0.004617021],"genre_scores_gemma":[0.8699923,0.0002522349,0.12450134,0.00009273975,0.000050580853,0.00013299643,0.000115280294,0.000111521214,0.004750902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995043,0.00018796655,0.00002172632,0.00012330829,0.00011637532,0.00004626941],"domain_scores_gemma":[0.99708074,0.0018434236,0.00034698664,0.00015745856,0.00038565928,0.00018568711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014001802,0.00070906803,0.00057125743,0.00038909612,0.000320528,0.0009437779,0.00058520463,0.0008506747,0.0015516593],"category_scores_gemma":[0.008055131,0.00028635896,0.00039849008,0.0002715968,0.0011052792,0.0011846845,0.0017756739,0.0011277099,0.0002978883],"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.00011853039,0.000036190086,0.00088903646,0.00013208098,0.000035638084,0.00012444834,0.0001320082,0.88789743,0.019435892,0.068806164,0.0012442206,0.021148441],"study_design_scores_gemma":[0.0000039132074,0.00003709736,0.00020915271,0.000008719528,0.0000031461263,0.000030810686,0.000021036547,0.9820347,0.0032107527,0.014076496,0.00035521374,0.000009111149],"about_ca_topic_score_codex":0.0006554452,"about_ca_topic_score_gemma":0.00065236806,"teacher_disagreement_score":0.0015516593,"about_ca_system_score_codex":0.0006159695,"about_ca_system_score_gemma":0.0006964742,"threshold_uncertainty_score":0.007404983},"labels":[],"label_agreement":null},{"id":"W2803106003","doi":"10.1137/16m1107863","title":"Orthogonal Nonnegative Matrix Factorization by Sparsity and Nuclear Norm Optimization","year":2018,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Hong Kong Baptist University","keywords":"Mathematics; Factorization; Matrix decomposition; Matrix norm; Sparse matrix; Coefficient matrix; Non-negative matrix factorization; Matrix (chemical analysis); Incomplete LU factorization; Norm (philosophy); Algorithm; Applied mathematics; Mathematical optimization","score_opus":0.00649217373800545,"score_gpt":0.2568799767331522,"score_spread":0.2503878029951468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803106003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002046901,0.00020985614,0.99682873,0.00011377768,0.000030828167,0.000018744578,0.000037596405,0.000048345824,0.0006652064],"genre_scores_gemma":[0.23020083,0.0019613463,0.76224947,0.0003095506,0.0003876419,0.0003546887,0.00082302245,0.00016869359,0.0035447986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982255,0.0009139301,0.00006455232,0.000277534,0.0004101362,0.00010833401],"domain_scores_gemma":[0.99679774,0.0019301048,0.00030914426,0.00029037206,0.00059266353,0.00007986123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027379014,0.0013942125,0.0012257057,0.00085674686,0.0004172495,0.0011555915,0.0010701413,0.0009723688,0.001882744],"category_scores_gemma":[0.009920716,0.00048521085,0.0008424573,0.0016413814,0.0017896241,0.0023623337,0.0013920909,0.0017018255,0.00094514305],"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.00014942871,0.00009174037,0.0011845769,0.0005142864,0.000121836,0.00028409366,0.00018514153,0.5537032,0.008793919,0.25512406,0.008803943,0.17104378],"study_design_scores_gemma":[0.000007144735,0.000029848876,0.000105087885,0.000015875461,0.000006811107,0.000048069625,0.000015885762,0.9521193,0.0009109551,0.04512249,0.0016048054,0.000013764904],"about_ca_topic_score_codex":0.0021966603,"about_ca_topic_score_gemma":0.0017033776,"teacher_disagreement_score":0.0027379014,"about_ca_system_score_codex":0.0005325571,"about_ca_system_score_gemma":0.0008363445,"threshold_uncertainty_score":0.014479518},"labels":[],"label_agreement":null},{"id":"W2895568660","doi":"10.1137/18m1207399","title":"The Eigenvalue Distribution of Special 2-by-2 Block Matrix-Sequences with Applications to the Case of Symmetrized Toeplitz Structures","year":2019,"lang":"en","type":"preprint","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Advanced Algebra and Geometry","field":"Mathematics","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":"Toronto Metropolitan University","funders":"Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Toeplitz matrix; Eigenvalues and eigenvectors; Combinatorics; Mathematics; Matrix (chemical analysis); Unitary matrix; Sequence (biology); Character (mathematics); Locally integrable function; Permutation (music); Singular value; Pure mathematics; Integrable system; Unitary state; Physics; Quantum mechanics","score_opus":0.014631113978237964,"score_gpt":0.32983364037749735,"score_spread":0.3152025263992594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895568660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32845303,0.00040901874,0.66229653,0.00037621037,0.00007888589,0.000053299646,0.00014788778,0.00024407187,0.007941064],"genre_scores_gemma":[0.9492881,0.00033284916,0.044608995,0.00007756867,0.000095263444,0.00009823981,0.00019420529,0.00008527217,0.005219525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996413,0.00012301507,0.000017689481,0.00006334399,0.00008222447,0.00007247763],"domain_scores_gemma":[0.9976482,0.0009855798,0.00048093373,0.00026867865,0.00037295508,0.00024366911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009173231,0.0005638277,0.0004176857,0.00067880703,0.00036954434,0.0007288536,0.00062594924,0.00075109483,0.0032927683],"category_scores_gemma":[0.0031879826,0.0002569572,0.0003467316,0.00047018126,0.0015780479,0.0010797221,0.00077728677,0.0007130376,0.00049104245],"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.0002480187,0.00009603811,0.002353183,0.00013097918,0.00003433517,0.0010348186,0.00044789535,0.26351863,0.022551954,0.6897684,0.002428011,0.017387735],"study_design_scores_gemma":[0.000013162489,0.000041407715,0.000726813,0.000012070334,0.000004249266,0.0001503815,0.00006763252,0.8812545,0.0026866016,0.11425016,0.00076916104,0.000023819011],"about_ca_topic_score_codex":0.0012075865,"about_ca_topic_score_gemma":0.0010419853,"teacher_disagreement_score":0.0032927683,"about_ca_system_score_codex":0.0005441798,"about_ca_system_score_gemma":0.0004979479,"threshold_uncertainty_score":0.011015415},"labels":[],"label_agreement":null},{"id":"W2924691308","doi":"10.1137/19m1245505","title":"The Block Rational Arnoldi Method","year":2020,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and 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":"Toronto Metropolitan University","funders":"Engineering and Physical Sciences Research Council","keywords":"Orthonormal basis; Mathematics; Applied mathematics; Eigenvalues and eigenvectors; Block (permutation group theory); Arnoldi iteration; Krylov subspace; MATLAB; Rational function; Stability (learning theory); Generalized minimal residual method; Elliptic rational functions; Mathematical optimization; Pure mathematics; Computer science; Iterative method; Combinatorics","score_opus":0.012178461811036483,"score_gpt":0.2954704634421431,"score_spread":0.2832920016311066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2924691308","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005209646,0.00031217863,0.97212964,0.00015149928,0.0001133776,0.000053321462,0.00015431254,0.00057404535,0.02130186],"genre_scores_gemma":[0.26572743,0.0012851674,0.6789336,0.00026020434,0.00013909093,0.00030204403,0.0005646667,0.001070834,0.051716886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996637,0.000084170555,0.000012889557,0.00003820496,0.00015211928,0.00004896126],"domain_scores_gemma":[0.9996619,0.000089966845,0.000028304788,0.00007892025,0.000113712165,0.00002712695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036960866,0.00040285333,0.0006839076,0.0004345862,0.00036796086,0.0010065559,0.00085453165,0.0007349877,0.011665402],"category_scores_gemma":[0.0012201988,0.00029965033,0.0004651434,0.0003519333,0.000569966,0.000987146,0.0010074127,0.0010291655,0.0053827064],"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.00015542307,0.000049002352,0.0005986692,0.0002721756,0.000038166967,0.00015253383,0.00020129677,0.20113894,0.027982624,0.57504743,0.014581824,0.17978193],"study_design_scores_gemma":[0.000028025233,0.00004554983,0.00019837733,0.000034105487,0.000012280528,0.00012482503,0.000034203953,0.89113307,0.0053461376,0.06658484,0.036430247,0.000028392715],"about_ca_topic_score_codex":0.0019905127,"about_ca_topic_score_gemma":0.0015939379,"teacher_disagreement_score":0.011665402,"about_ca_system_score_codex":0.0004142261,"about_ca_system_score_gemma":0.0009144433,"threshold_uncertainty_score":0.03902465},"labels":[],"label_agreement":null},{"id":"W2979140977","doi":"10.1137/20m1358955","title":"Fast Interpolation-Based Globality Certificates for Computing Kreiss Constants and the Distance to Uncontrollability","year":2021,"lang":"en","type":"preprint","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; York University; Courant Institute of Mathematical Sciences, New York University; National Science Foundation","keywords":"Interpolation (computer graphics); Mathematics; Eigenvalues and eigenvectors; Variable (mathematics); Convergence (economics); Function (biology); State (computer science); Algorithm; Applied mathematics; Computer science; Mathematical analysis; Image (mathematics)","score_opus":0.01250953728077803,"score_gpt":0.29944874033121316,"score_spread":0.28693920305043513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979140977","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014662409,0.000094601644,0.982451,0.000049914837,0.00002408844,0.000037131853,0.000042321306,0.00093243545,0.0017061165],"genre_scores_gemma":[0.43702793,0.00019307277,0.5593011,0.00006491012,0.00003493956,0.0001760769,0.00030861548,0.0006563378,0.002236996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900025,0.000166048,0.000052917123,0.00014100874,0.0005020819,0.00013772717],"domain_scores_gemma":[0.9970247,0.0012621913,0.0003988733,0.00050166686,0.0006711969,0.00014132651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014207351,0.0011597886,0.0012254314,0.0015289852,0.0006552347,0.0014758362,0.0017014511,0.00084522244,0.004053412],"category_scores_gemma":[0.006657421,0.0005160184,0.0010114571,0.0008890489,0.0016689491,0.0021841563,0.002159847,0.002483479,0.0010683398],"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.00032038646,0.00007941571,0.0021662135,0.0002567684,0.00006862849,0.00015353937,0.00026149003,0.74931747,0.017343767,0.09095663,0.0016858901,0.1373899],"study_design_scores_gemma":[0.000016253178,0.000051970655,0.00019327384,0.00001627525,0.0000050464646,0.000026343825,0.00002331333,0.97538996,0.007985148,0.015168213,0.0011030837,0.00002113915],"about_ca_topic_score_codex":0.0026240118,"about_ca_topic_score_gemma":0.0032322262,"teacher_disagreement_score":0.004053412,"about_ca_system_score_codex":0.0011052702,"about_ca_system_score_gemma":0.0019422531,"threshold_uncertainty_score":0.013559997},"labels":[],"label_agreement":null},{"id":"W2988877209","doi":"10.1137/19m1298317","title":"On Fixed-Point, Krylov, and $2\\times 2$ Block Preconditioners for Nonsymmetric Problems","year":2020,"lang":"en","type":"preprint","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy","keywords":"Preconditioner; Schur complement; Mathematics; Generalized minimal residual method; Block (permutation group theory); Applied mathematics; Discretization; Block matrix; Krylov subspace; Convergence (economics); Linear system; Iterative method; Mathematical optimization; Mathematical analysis; Eigenvalues and eigenvectors; Combinatorics","score_opus":0.013297441913497467,"score_gpt":0.2782597135055652,"score_spread":0.26496227159206776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2988877209","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011771248,0.0011701428,0.9720839,0.0004151655,0.0001346428,0.00006980787,0.00006423923,0.0002038886,0.01408707],"genre_scores_gemma":[0.25764555,0.0034423643,0.7180573,0.0003974556,0.00042302816,0.0004257666,0.0002767648,0.0005155971,0.018816156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988199,0.00058027275,0.000036235342,0.00008705183,0.00039932714,0.00007723553],"domain_scores_gemma":[0.99793184,0.0013231041,0.00014207687,0.00021645117,0.00030840083,0.00007822329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020384581,0.001072438,0.0007199775,0.0008719828,0.0006067008,0.0007193431,0.0006458723,0.0009680455,0.003944395],"category_scores_gemma":[0.006719634,0.00036138104,0.00061824213,0.0008101592,0.0025546097,0.0014351658,0.0016845103,0.0025158585,0.0011655526],"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.00014971624,0.00005990652,0.00040671488,0.0002492171,0.00003146266,0.00016930484,0.000344926,0.2972095,0.009390889,0.6248607,0.0038147236,0.063313015],"study_design_scores_gemma":[0.000015124975,0.000051192947,0.00014601438,0.00003686049,0.0000062645404,0.000028293656,0.00002674412,0.8901048,0.0021883515,0.10110399,0.006277893,0.0000145346885],"about_ca_topic_score_codex":0.005804315,"about_ca_topic_score_gemma":0.0054771677,"teacher_disagreement_score":0.005804315,"about_ca_system_score_codex":0.0007789124,"about_ca_system_score_gemma":0.0015869689,"threshold_uncertainty_score":0.013195336},"labels":[],"label_agreement":null},{"id":"W2995137628","doi":"10.1137/19m1240964","title":"A Structured Condition Number for Kemeny's Constant","year":2019,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Mathematics; Markov chain; Constant (computer programming); Combinatorics; Discrete mathematics; Upper and lower bounds; Expected value; Perturbation (astronomy); Markov process; Applied mathematics; Statistics; Mathematical analysis; Computer science","score_opus":0.009487592498764835,"score_gpt":0.33369245791553903,"score_spread":0.3242048654167742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995137628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22063565,0.0010765921,0.74172556,0.0023484444,0.00031772433,0.00022381876,0.0006630825,0.00080107345,0.032208133],"genre_scores_gemma":[0.9171785,0.00050896534,0.07660123,0.00044133645,0.0002335417,0.00036063418,0.00026840164,0.00027331847,0.004133954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783415,0.00052914943,0.00010245662,0.0005923006,0.00068485,0.00025723668],"domain_scores_gemma":[0.9646984,0.02606641,0.002802812,0.0029659206,0.0020002876,0.0014661684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052616536,0.00079149567,0.00074999296,0.0019763778,0.0012808876,0.0017626523,0.0017493922,0.0016456735,0.010015981],"category_scores_gemma":[0.050837137,0.00042083728,0.0008277028,0.00096283667,0.0050465446,0.006352587,0.002144254,0.0039052854,0.00087842735],"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.00014232888,0.000044402084,0.0013256627,0.000112067784,0.000022877277,0.00013149041,0.00020726987,0.05021383,0.008818816,0.92774487,0.001948966,0.00928748],"study_design_scores_gemma":[0.000035401525,0.00008832906,0.0010474646,0.00006462926,0.000014623085,0.00013537389,0.00006817252,0.31343305,0.0070542893,0.6761196,0.001851514,0.00008745915],"about_ca_topic_score_codex":0.0010840611,"about_ca_topic_score_gemma":0.00083240855,"teacher_disagreement_score":0.010015981,"about_ca_system_score_codex":0.0027154994,"about_ca_system_score_gemma":0.0018670887,"threshold_uncertainty_score":0.03350681},"labels":[],"label_agreement":null},{"id":"W3027395381","doi":"10.1137/20m1364485","title":"A Rational Even-IRA Algorithm for the Solution of $T$-Even Polynomial Eigenvalue Problems","year":2021,"lang":"en","type":"preprint","venue":"SIAM Journal on Matrix Analysis and 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University","keywords":"Krylov subspace; Matrix polynomial; Eigenvalues and eigenvectors; Arnoldi iteration; Mathematics; Polynomial; Linearization; Generalized minimal residual method; Block (permutation group theory); Divide-and-conquer eigenvalue algorithm; Applied mathematics; Skew; Algorithm; Iterative method; Computer science; Combinatorics; Mathematical analysis; Nonlinear system","score_opus":0.01656604732290797,"score_gpt":0.28514096886321605,"score_spread":0.2685749215403081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027395381","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003618625,0.00007399566,0.99354845,0.00004373541,0.000023163837,0.000027752238,0.000030040193,0.00086079974,0.0017733742],"genre_scores_gemma":[0.06683179,0.00012695172,0.92948645,0.00006815095,0.000031285566,0.00011507949,0.00022937181,0.0005674057,0.002543467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996234,0.00008960274,0.000019286323,0.000065696084,0.00013569111,0.00006618268],"domain_scores_gemma":[0.9995906,0.00016052667,0.000035744564,0.0000898805,0.000090811984,0.00003253313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005124764,0.0007402745,0.000790146,0.00063196884,0.0004078028,0.00069430843,0.0010594316,0.0005872381,0.008852621],"category_scores_gemma":[0.0015976431,0.00035688814,0.00065999886,0.0004905026,0.0006244197,0.00087511615,0.0014012955,0.0013275904,0.004229464],"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.00031537862,0.00018821203,0.0009574553,0.00045894648,0.000077088545,0.00027625985,0.00032035584,0.2929879,0.021299321,0.12901133,0.010894732,0.543213],"study_design_scores_gemma":[0.000038730934,0.00004436654,0.00008302376,0.0000126196,0.0000068838276,0.00006628677,0.0000374407,0.96817523,0.002895527,0.023016749,0.005607703,0.000015389096],"about_ca_topic_score_codex":0.0015389498,"about_ca_topic_score_gemma":0.0024657443,"teacher_disagreement_score":0.008852621,"about_ca_system_score_codex":0.00033734945,"about_ca_system_score_gemma":0.0010436146,"threshold_uncertainty_score":0.029614985},"labels":[],"label_agreement":null},{"id":"W3047080367","doi":"10.1137/19m1290991","title":"BiLQ: An Iterative Method for Nonsymmetric Linear Systems with a Quasi-Minimum Error Property","year":2020,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lanczos resampling; Mathematics; Residual; Applied mathematics; Tridiagonal matrix; Lanczos algorithm; Linear system; Monotonic function; Norm (philosophy); Eigenvalues and eigenvectors; Mathematical optimization; Mathematical analysis; Algorithm","score_opus":0.027447030609016324,"score_gpt":0.324059853564332,"score_spread":0.29661282295531566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047080367","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015046636,0.000074197866,0.9962483,0.00008548368,0.0000351145,0.000031543626,0.00003348668,0.00089400675,0.0010931413],"genre_scores_gemma":[0.07581807,0.00011911375,0.9181412,0.00023342189,0.00005069431,0.00032769094,0.00027357144,0.0010986901,0.0039376086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929535,0.00024397648,0.00002967407,0.000054317683,0.00031410783,0.000062534884],"domain_scores_gemma":[0.9990134,0.00039298774,0.00012224313,0.00011723695,0.00028890098,0.000065226115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013452587,0.0009612202,0.0010039815,0.00050949195,0.0004913583,0.00074255106,0.001771425,0.0011291843,0.0058813393],"category_scores_gemma":[0.0030304499,0.0006226173,0.0006698814,0.0005010933,0.000933252,0.00097168726,0.0022665714,0.0017641473,0.0025967984],"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.00023793231,0.0001328092,0.0008580402,0.00070184475,0.000101175625,0.00021624536,0.0003257168,0.73968834,0.021612916,0.06132599,0.01436502,0.1604339],"study_design_scores_gemma":[0.000025850095,0.000031695403,0.000047407233,0.000012763427,0.0000033305264,0.000017338041,0.000010006918,0.9908619,0.0017375071,0.0036961394,0.003546482,0.000009530236],"about_ca_topic_score_codex":0.0026730723,"about_ca_topic_score_gemma":0.0031174438,"teacher_disagreement_score":0.0058813393,"about_ca_system_score_codex":0.0004547041,"about_ca_system_score_gemma":0.0015006069,"threshold_uncertainty_score":0.019675016},"labels":[],"label_agreement":null},{"id":"W3083409701","doi":"10.1137/20m1365326","title":"A Multiprecision Derivative-Free Schur--Parlett Algorithm for Computing Matrix Functions","year":2021,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and 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":"Toronto Metropolitan University","funders":"Engineering and Physical Sciences Research Council; Royal Society","keywords":"Schur decomposition; Mathematics; Algebra over a field; Matrix (chemical analysis); Matrix function; Schur product theorem; Schur's theorem; Decomposition; Algorithm; Schur complement; Pure mathematics; Symmetric matrix; Eigenvalues and eigenvectors","score_opus":0.012377535516921378,"score_gpt":0.294455632274379,"score_spread":0.2820780967574576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083409701","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018559052,0.00009317226,0.992833,0.0000712534,0.000050651808,0.0000575603,0.00008754853,0.0023844957,0.002566264],"genre_scores_gemma":[0.03749354,0.00010718842,0.9565713,0.00008899538,0.00004104113,0.00023499677,0.00032196002,0.0007995618,0.0043414314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891186,0.00019468844,0.00006467425,0.00012575868,0.000607758,0.000095309726],"domain_scores_gemma":[0.9981232,0.0005805505,0.000118347285,0.00035402837,0.0007467755,0.000077073375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015180532,0.001458332,0.0010636881,0.0014874529,0.0012332457,0.0017434227,0.0023104674,0.0012217206,0.017397398],"category_scores_gemma":[0.00593974,0.00056911533,0.000902043,0.0014716702,0.00086986006,0.0019074669,0.0014118213,0.0020602334,0.010625775],"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.0004017847,0.00016822445,0.000969152,0.0004619187,0.0001054986,0.00028008025,0.00029766574,0.15281174,0.019331772,0.21422549,0.03279525,0.57815146],"study_design_scores_gemma":[0.00010982099,0.0001041951,0.00021909585,0.000051491555,0.000020974801,0.00018649086,0.000043235123,0.9086466,0.020865919,0.044505153,0.025185922,0.00006119697],"about_ca_topic_score_codex":0.0033902184,"about_ca_topic_score_gemma":0.006395856,"teacher_disagreement_score":0.017397398,"about_ca_system_score_codex":0.001336835,"about_ca_system_score_gemma":0.0024467958,"threshold_uncertainty_score":0.05820012},"labels":[],"label_agreement":null},{"id":"W4249550536","doi":"10.1137/100808885","title":"Convexity Properties of the Condition Number II","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Universitat de Barcelona; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Agencia Nacional de Promoción Científica y Tecnológica; Consejo Nacional de Investigaciones Científicas y Técnicas; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Hessian matrix; Geodesic; Rank (graph theory); Lipschitz continuity; Pure mathematics; Matrix (chemical analysis); Metric (unit); Convex function; Homogeneous space; Convexity; Piecewise linear function; Mathematical analysis; Combinatorics; Applied mathematics; Regular polygon; Geometry","score_opus":0.013409910027748936,"score_gpt":0.26458913892988883,"score_spread":0.2511792289021399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249550536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22267067,0.0019899344,0.57672447,0.0044664964,0.00042218386,0.00039660017,0.0029782492,0.00050532166,0.18984605],"genre_scores_gemma":[0.91222197,0.0012014648,0.053589616,0.0006903914,0.00041310574,0.000541934,0.0029683055,0.000495065,0.027878132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866533,0.00026609315,0.000068986046,0.0003116271,0.0004671973,0.00022090146],"domain_scores_gemma":[0.994076,0.0030897672,0.00058838853,0.00033711095,0.0013477199,0.00056101126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001585475,0.0009641631,0.00088823016,0.0014102363,0.0011095285,0.0026715,0.0010004438,0.0009608975,0.011897878],"category_scores_gemma":[0.010497879,0.0003953454,0.0009036461,0.0007296705,0.0024897512,0.003312533,0.0014141882,0.002408921,0.0015655905],"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.00014612461,0.00003732887,0.00164705,0.00015596134,0.000020367486,0.00018345744,0.0001586481,0.020533167,0.0046216254,0.9498452,0.009842237,0.012808853],"study_design_scores_gemma":[0.000035219666,0.0001337658,0.0024931626,0.00006770264,0.00002085403,0.00033974688,0.00013546398,0.34808105,0.0056746816,0.6298941,0.013044377,0.00007988519],"about_ca_topic_score_codex":0.003673919,"about_ca_topic_score_gemma":0.0019847995,"teacher_disagreement_score":0.011897878,"about_ca_system_score_codex":0.002685863,"about_ca_system_score_gemma":0.0015390905,"threshold_uncertainty_score":0.039802432},"labels":[],"label_agreement":null},{"id":"W4311941380","doi":"10.1137/21m1449579","title":"Linear Asymptotic Convergence of Anderson Acceleration: Fixed-Point Analysis","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and 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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Fixed point; Lipschitz continuity; Differentiable function; Acceleration; Mathematical analysis; Convergence (economics); Applied mathematics; Function (biology); Weak convergence; Physics; Computer science","score_opus":0.011014498051144848,"score_gpt":0.2730494077438461,"score_spread":0.26203490969270127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311941380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16936156,0.0019443247,0.8013602,0.00091928133,0.0002435472,0.00012976135,0.0000835243,0.0006254795,0.025332399],"genre_scores_gemma":[0.91160953,0.00079499814,0.07238403,0.00032734495,0.00013231584,0.00020822893,0.00015252424,0.00029023705,0.014100672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995486,0.0001574239,0.000017628729,0.000053731044,0.00014483991,0.000077714365],"domain_scores_gemma":[0.99680305,0.0015172636,0.00039798184,0.00026177138,0.0007461028,0.00027379667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019461606,0.00084023416,0.0005731685,0.0011360067,0.00064565724,0.00080508145,0.0011112521,0.00087029446,0.0044938126],"category_scores_gemma":[0.010840234,0.00032115658,0.0008379068,0.00035620033,0.0019627486,0.0014509506,0.0016203708,0.0016607519,0.00078941527],"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.00021238107,0.00010077711,0.0042709596,0.0003687792,0.000102252896,0.00035287172,0.00041445292,0.2682447,0.011079079,0.68270355,0.00366605,0.028484091],"study_design_scores_gemma":[0.0000120896,0.0000558229,0.00046358255,0.000040328847,0.000009531646,0.00005492386,0.000031644577,0.9458578,0.0015475588,0.050559495,0.0013516895,0.000015470418],"about_ca_topic_score_codex":0.0035415175,"about_ca_topic_score_gemma":0.0022481647,"teacher_disagreement_score":0.0044938126,"about_ca_system_score_codex":0.001232365,"about_ca_system_score_gemma":0.0011623418,"threshold_uncertainty_score":0.015033245},"labels":[],"label_agreement":null},{"id":"W4318700203","doi":"10.1137/22m1485759","title":"Smoothing Analysis of Two Robust Multigrid Methods for Elliptic Optimal Control Problems","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and 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 British Columbia","funders":"","keywords":"Multigrid method; Smoothing; Schur complement; Relaxation (psychology); Jacobian matrix and determinant; Mathematics; Applied mathematics; Conjugate gradient method; Optimal control; Mathematical optimization; Regularization (linguistics); Computer science; Partial differential equation; Mathematical analysis; Eigenvalues and eigenvectors","score_opus":0.034600024500924365,"score_gpt":0.4013484676564062,"score_spread":0.36674844315548183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318700203","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028041918,0.00044458316,0.9685365,0.0002021647,0.00006771805,0.000040968618,0.000019484856,0.00012705455,0.002519569],"genre_scores_gemma":[0.6635395,0.00043901947,0.3319222,0.00013579828,0.000071683346,0.00017148904,0.00011316533,0.00018933219,0.0034177897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994318,0.00019212185,0.000032079726,0.00008632795,0.0002102437,0.000047382062],"domain_scores_gemma":[0.99874854,0.0006128675,0.0001827207,0.00016425876,0.00022181075,0.000069751804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019098151,0.00079049775,0.00085699547,0.0009478664,0.00046229898,0.00087194284,0.00088370487,0.0013572127,0.0012424339],"category_scores_gemma":[0.0038931726,0.00034789197,0.0011221996,0.00037856246,0.0012755005,0.001033534,0.0011993988,0.0011461546,0.00018919625],"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.0001252165,0.000054815937,0.0008118073,0.0001879437,0.000063028885,0.00006611282,0.00017998856,0.8946568,0.009432522,0.057793573,0.0004279711,0.0362002],"study_design_scores_gemma":[0.0000051908632,0.000021633632,0.00008354874,0.0000058641294,0.0000043224945,0.0000075918883,0.0000067885753,0.9965224,0.00083931757,0.0020595195,0.00043802636,0.0000057629936],"about_ca_topic_score_codex":0.0019801832,"about_ca_topic_score_gemma":0.001050645,"teacher_disagreement_score":0.0019801832,"about_ca_system_score_codex":0.00066779,"about_ca_system_score_gemma":0.00091135554,"threshold_uncertainty_score":0.0101002455},"labels":[],"label_agreement":null},{"id":"W4323825473","doi":"10.1137/21m1459265","title":"GPMR: An Iterative Method for Unsymmetric Partitioned Linear Systems","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Generalized minimal residual method; Mathematics; Linear system; Block (permutation group theory); Residual; Iterative method; Applied mathematics; Matrix (chemical analysis); Iterative and incremental development; Algorithm; Computer science; Combinatorics; Mathematical analysis","score_opus":0.022835013793807476,"score_gpt":0.35252663118409694,"score_spread":0.32969161739028946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323825473","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010701289,0.00007689535,0.99724317,0.00006369458,0.000031035743,0.000022867896,0.000043578122,0.0008009665,0.0006475123],"genre_scores_gemma":[0.034545466,0.00016930571,0.9610434,0.000113521106,0.000043100696,0.00015999732,0.0002674444,0.00078548404,0.0028722961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993771,0.00022466689,0.000024370398,0.00007363583,0.0002603943,0.0000398279],"domain_scores_gemma":[0.9992422,0.0003447661,0.00008101235,0.0001136487,0.00017804396,0.00004033966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007565478,0.001022021,0.000852606,0.00041570555,0.00032574407,0.0005924327,0.0015442359,0.0011497736,0.0057310397],"category_scores_gemma":[0.0027037093,0.00054346863,0.0007221193,0.0005003485,0.0006384724,0.00097123324,0.0017587929,0.0020211798,0.0025472522],"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.00019096959,0.00008589552,0.0005182337,0.0006109535,0.000147687,0.00032721605,0.00033974118,0.661333,0.038717445,0.03789809,0.016729716,0.24310109],"study_design_scores_gemma":[0.00003341328,0.00005512534,0.00007329071,0.000022183915,0.000009565773,0.00009355136,0.000015597856,0.97777414,0.0052977875,0.005337327,0.011270736,0.000017207474],"about_ca_topic_score_codex":0.001722536,"about_ca_topic_score_gemma":0.0022611022,"teacher_disagreement_score":0.0057310397,"about_ca_system_score_codex":0.00022574866,"about_ca_system_score_gemma":0.0010611785,"threshold_uncertainty_score":0.019172251},"labels":[],"label_agreement":null},{"id":"W4391141447","doi":"10.1137/22m1540624","title":"Constraint-Satisfying Krylov Solvers for Structure-Preserving Discretizations","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and 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":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; European Research Consortium for Informatics and Mathematics","keywords":"Constraint (computer-aided design); Computer science; Generalized minimal residual method; Parallel computing; Computational science; Mathematics; Mathematical optimization; Algorithm; Iterative method; Geometry","score_opus":0.009056516811855151,"score_gpt":0.28915557816443505,"score_spread":0.2800990613525799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391141447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063892636,0.00010935818,0.9892117,0.00012707202,0.00003924745,0.00006836356,0.00007066326,0.00025803168,0.0037263373],"genre_scores_gemma":[0.18005025,0.00024393649,0.81180423,0.00022124185,0.00005288085,0.00031824998,0.0003949422,0.00036798377,0.0065462617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923515,0.00024262324,0.000043846103,0.00006248385,0.000366613,0.00004929731],"domain_scores_gemma":[0.9991079,0.00037238363,0.00012468817,0.00021507438,0.00013324275,0.0000466251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011331523,0.0006841753,0.0005561538,0.00028035475,0.0003688464,0.00070484885,0.0013098189,0.0007923643,0.0045228056],"category_scores_gemma":[0.0039351345,0.00028283434,0.0005504639,0.0005298768,0.0009439195,0.0009467017,0.0022621502,0.0016482908,0.0014195653],"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.00016122141,0.00010809976,0.0013954021,0.000484513,0.00008184817,0.00021109855,0.00034904885,0.40227395,0.023760904,0.41593158,0.0072571123,0.14798523],"study_design_scores_gemma":[0.000038736147,0.000042423613,0.00008296925,0.000029376311,0.000006485763,0.000060749837,0.000028282868,0.92717576,0.0045775925,0.057868086,0.010078851,0.000010652766],"about_ca_topic_score_codex":0.0010754515,"about_ca_topic_score_gemma":0.0020387473,"teacher_disagreement_score":0.0045228056,"about_ca_system_score_codex":0.0004087593,"about_ca_system_score_gemma":0.0012722675,"threshold_uncertainty_score":0.015130281},"labels":[],"label_agreement":null},{"id":"W4394761142","doi":"10.1137/22m1519523","title":"Analyzing Vector Orthogonalization Algorithms","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and 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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orthogonalization; Lanczos resampling; Rounding; Algorithm; Hermitian matrix; Orthogonality; Mathematics; Conjugate gradient method; Lanczos algorithm; Krylov subspace; Matrix (chemical analysis); Round-off error; Sequence (biology); Stiefel manifold; Machine epsilon; Iterative method; Eigenvalues and eigenvectors; Computer science","score_opus":0.008949164999574367,"score_gpt":0.2848159887379113,"score_spread":0.27586682373833693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394761142","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011154614,0.00058900454,0.98248935,0.0001649597,0.00006337295,0.000088786146,0.000043262287,0.0002161937,0.0051904973],"genre_scores_gemma":[0.3061643,0.002152603,0.6757243,0.00033569816,0.00024170498,0.0005817448,0.0007356491,0.00056135264,0.013502626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972494,0.0007725434,0.00014103115,0.0003190321,0.0013076835,0.00021033591],"domain_scores_gemma":[0.9954792,0.0019931544,0.00044456997,0.0006992623,0.0013081277,0.00007569074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032231263,0.0007987037,0.0005537687,0.0012447188,0.0006806351,0.0018919692,0.0009140161,0.00078305136,0.0045594843],"category_scores_gemma":[0.013487042,0.00042484573,0.0005757054,0.0014867266,0.0014182208,0.0023993258,0.0020274846,0.0015043096,0.0014244099],"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.00012908122,0.000077049255,0.0026976354,0.00026510056,0.00006440501,0.000058715796,0.0002659822,0.17975767,0.0046021426,0.46252915,0.0043753027,0.34517786],"study_design_scores_gemma":[0.000026779302,0.000107565786,0.00044819596,0.00006358522,0.000016954336,0.00008102204,0.00006987307,0.79796356,0.0066674314,0.18108438,0.013447174,0.000023407272],"about_ca_topic_score_codex":0.0015360211,"about_ca_topic_score_gemma":0.0008684311,"teacher_disagreement_score":0.0045594843,"about_ca_system_score_codex":0.00077249075,"about_ca_system_score_gemma":0.0013656139,"threshold_uncertainty_score":0.017045677},"labels":[],"label_agreement":null},{"id":"W4406090494","doi":"10.1137/24m1630566","title":"Quotient Geometry of Bounded or Fixed-Rank Correlation Matrices","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Quotient; Bounded function; Rank (graph theory); Algebraic geometry; Combinatorics; Geometry; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.006066682395259513,"score_gpt":0.3082913045660522,"score_spread":0.30222462217079266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406090494","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47930366,0.0018921358,0.40570045,0.0032942682,0.00035858917,0.00013386483,0.0013631872,0.00059341115,0.10736043],"genre_scores_gemma":[0.95422,0.0008855851,0.019935757,0.00054912944,0.00047244492,0.000089665875,0.0007341212,0.0002459866,0.022867387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998268,0.0005336659,0.00006634517,0.00037693945,0.00045387234,0.00030108963],"domain_scores_gemma":[0.99485874,0.001788635,0.00086079974,0.0005375788,0.0008743717,0.0010798681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013453574,0.0013269697,0.0011247419,0.0022393388,0.0011855486,0.0035756035,0.0021202797,0.0012702043,0.009554904],"category_scores_gemma":[0.0072931503,0.00062277843,0.0007106693,0.00095525174,0.0035292478,0.0054996735,0.0032207065,0.002365469,0.0015352125],"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.000035979556,0.00000840875,0.00011119516,0.000016327858,0.00000449271,0.00005982156,0.00006169367,0.00093599915,0.00042038638,0.99613523,0.00078283146,0.0014276224],"study_design_scores_gemma":[0.000014411748,0.000021697037,0.00021332757,0.0000074946493,0.0000053789277,0.00013858646,0.000039802966,0.012808355,0.00043763543,0.98492646,0.0013719472,0.000014844644],"about_ca_topic_score_codex":0.0015063558,"about_ca_topic_score_gemma":0.00068994315,"teacher_disagreement_score":0.009554904,"about_ca_system_score_codex":0.0013789311,"about_ca_system_score_gemma":0.000891929,"threshold_uncertainty_score":0.031964302},"labels":[],"label_agreement":null},{"id":"W4407923948","doi":"10.1137/23m1605454","title":"M<scp>in</scp>A<scp>res</scp>: An Iterative Solver for Symmetric Linear Systems","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Solver; Mathematics; Linear system; Iterative method; Applied mathematics; Combinatorics; Mathematical optimization; Algebra over a field; Mathematical analysis; Pure mathematics","score_opus":0.011169576101567925,"score_gpt":0.2962808699257752,"score_spread":0.28511129382420725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407923948","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036993623,0.00008339674,0.96087456,0.0003500654,0.00033107403,0.0001246753,0.00095131365,0.014946468,0.01863912],"genre_scores_gemma":[0.070152834,0.000109923305,0.8864147,0.00045303666,0.00013894375,0.0003131813,0.0020711177,0.010056643,0.030289598],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993579,0.00014799666,0.000039481492,0.000091444745,0.00027705453,0.00008619382],"domain_scores_gemma":[0.9988636,0.00035804563,0.00006995544,0.00020081723,0.00040513347,0.000102611535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080368563,0.0013176893,0.0007539101,0.0009177091,0.0008309674,0.0015217208,0.0022460823,0.0019004615,0.04273115],"category_scores_gemma":[0.0036188269,0.000672705,0.00086411077,0.00097550056,0.0007458918,0.0013984831,0.0025538162,0.0021770576,0.02083356],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051576074,0.00037537908,0.0011939778,0.00072025607,0.00020371185,0.0007644854,0.00030411562,0.14747104,0.022371788,0.09924126,0.27489507,0.45194316],"study_design_scores_gemma":[0.00014439077,0.000051282026,0.00013866101,0.000046796325,0.00001708406,0.00016227836,0.000039307557,0.92175627,0.012500659,0.019434715,0.04567165,0.000036855916],"about_ca_topic_score_codex":0.004133607,"about_ca_topic_score_gemma":0.010189515,"teacher_disagreement_score":0.04273115,"about_ca_system_score_codex":0.00050013943,"about_ca_system_score_gemma":0.002246408,"threshold_uncertainty_score":0.14294988},"labels":[],"label_agreement":null},{"id":"W4407998410","doi":"10.1137/23m1624580","title":"A Stable Matrix Version of the 2D Fast Multipole Method","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Electromagnetic Scattering and Analysis","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Fast multipole method; Matrix (chemical analysis); Multipole expansion; Algebra over a field; Applied mathematics; Algorithm; Pure mathematics","score_opus":0.0036387872302250488,"score_gpt":0.288541207461415,"score_spread":0.28490242023118995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407998410","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028960707,0.00021091879,0.9909759,0.00015305646,0.0003180226,0.00003738682,0.00014597981,0.00029966256,0.004962966],"genre_scores_gemma":[0.11218827,0.0007482713,0.85877043,0.00035546324,0.0005495005,0.00027271837,0.00063596596,0.001000492,0.025478888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994722,0.00015133676,0.000018192712,0.00004584683,0.00027857898,0.00003388557],"domain_scores_gemma":[0.9990503,0.00024540199,0.000043863416,0.0002089416,0.00038130046,0.00007015051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076439686,0.0005922297,0.00061023195,0.00061285216,0.0004892302,0.0011023958,0.0013581882,0.0010459243,0.010443947],"category_scores_gemma":[0.0024525789,0.00031817058,0.00060345075,0.0008131833,0.000488769,0.0011072916,0.0013904228,0.0010877708,0.0047105583],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025755056,0.00013639289,0.00059196725,0.00027451353,0.00010166993,0.00027739655,0.00019005715,0.24103898,0.023824736,0.42335644,0.024863716,0.28508663],"study_design_scores_gemma":[0.000024719837,0.000026371863,0.00012689762,0.000014062685,0.0000068350096,0.00008236253,0.000011615582,0.9422915,0.0018679436,0.04045349,0.015069896,0.000024222347],"about_ca_topic_score_codex":0.0015493747,"about_ca_topic_score_gemma":0.0019201621,"teacher_disagreement_score":0.010443947,"about_ca_system_score_codex":0.00033158768,"about_ca_system_score_gemma":0.0010359732,"threshold_uncertainty_score":0.034938514},"labels":[],"label_agreement":null}]}