{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007442884,0.0024489046,0.98855734,0.000776403,0.000030430876,0.00045408946,0.000037577636,0.00004507239,0.00020728078],"genre_scores_gemma":[0.97684336,0.00033749704,0.021688506,0.00013345687,0.00047921503,0.00024935388,0.000011226517,0.000010906495,0.00024650028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886143,0.000076098586,0.00031053674,0.0002783415,0.00017517371,0.00029843548],"domain_scores_gemma":[0.9986518,0.00034968715,0.00022467591,0.00035814635,0.00012892376,0.00028676033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006057557,0.00015114414,0.00024496412,0.00034313035,0.0007914503,0.00030677055,0.00041755088,0.000057504818,0.000036115525],"category_scores_gemma":[0.00003266885,0.00012461157,0.00015454492,0.0011045444,0.000027605274,0.0004117453,0.00010326096,0.00018260985,0.000007661529],"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.000006229448,0.00011294015,0.0020617356,0.000050698323,0.00042744933,3.19246e-7,0.00019518446,0.00044727215,0.0007291321,0.9691995,0.00012117523,0.02664841],"study_design_scores_gemma":[0.0017346932,0.00029078318,0.016537694,0.000050675295,0.0031150002,0.0004140358,0.00046870092,0.2521156,0.002853247,0.50201494,0.2188733,0.001531353],"about_ca_topic_score_codex":0.0000017786692,"about_ca_topic_score_gemma":0.0000030394222,"teacher_disagreement_score":0.96940047,"about_ca_system_score_codex":0.00002407508,"about_ca_system_score_gemma":0.000023968802,"threshold_uncertainty_score":0.60872763},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003140372,0.00030969433,0.9943689,0.00083438697,0.00004692952,0.00014147312,0.000025537911,0.00006568181,0.0010670238],"genre_scores_gemma":[0.81659716,0.0003718216,0.17845944,0.0004021448,0.0009424608,0.00014518546,0.00006646567,0.000019725538,0.0029956007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998769,0.000082945626,0.00038607148,0.00031238413,0.00022770902,0.00022192177],"domain_scores_gemma":[0.9990438,0.00010157603,0.00024133633,0.0003540169,0.00010368969,0.00015558144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041970896,0.00014705524,0.0002470867,0.0004485634,0.0005822123,0.0003833156,0.0003790319,0.00004586129,0.00007775429],"category_scores_gemma":[0.000004423522,0.00012116263,0.0002435546,0.001167454,0.000050682767,0.0002429827,0.000050947383,0.00019484866,0.00007469094],"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.000005210492,0.00047380105,0.0003316345,0.000007967594,0.0004579575,0.000021771273,0.000058672824,0.003935085,0.0003247855,0.8631027,0.0006388948,0.13064155],"study_design_scores_gemma":[0.0016959287,0.00028034433,0.009227598,0.00002525827,0.0010341435,0.00037748567,0.00010347276,0.42000368,0.0018021209,0.4193366,0.14519262,0.0009207429],"about_ca_topic_score_codex":0.000020679077,"about_ca_topic_score_gemma":0.0000061143896,"teacher_disagreement_score":0.81590945,"about_ca_system_score_codex":0.000029451168,"about_ca_system_score_gemma":0.000021879387,"threshold_uncertainty_score":0.49408686},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030463361,0.0000862105,0.9938089,0.0016271414,0.000032696367,0.0005751345,0.00005494593,0.000061824154,0.0007068031],"genre_scores_gemma":[0.051963087,0.00019597575,0.9398946,0.0005150593,0.00041245093,0.0006866514,0.000063496474,0.00006566007,0.006203014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806345,0.00018597613,0.000700806,0.00038389262,0.00035185847,0.0003140166],"domain_scores_gemma":[0.99501187,0.0037136925,0.00036846782,0.00047414194,0.00017053992,0.00026127588],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000932282,0.00023675562,0.00051427836,0.0005607303,0.0009093241,0.00021110613,0.0002580302,0.00009731252,0.0010627231],"category_scores_gemma":[0.0004107148,0.00019618336,0.0005556766,0.0015157425,0.00004504679,0.000104128616,0.000018976065,0.00032036088,0.000067023466],"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.000041653642,0.00057819043,0.000025598174,0.000030055995,0.0011843119,6.478658e-7,0.0001540863,0.0024868704,0.0006657148,0.71493536,0.0010455264,0.278852],"study_design_scores_gemma":[0.0004934565,0.00014917829,0.00024089837,0.000021686095,0.0024394116,0.0000082099195,0.000068434885,0.03800646,0.00011754216,0.9425359,0.015650602,0.0002682733],"about_ca_topic_score_codex":0.000012799293,"about_ca_topic_score_gemma":0.000015799127,"teacher_disagreement_score":0.2785837,"about_ca_system_score_codex":0.00007449572,"about_ca_system_score_gemma":0.000047595604,"threshold_uncertainty_score":0.99985045},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013103856,0.0006592368,0.9945986,0.003044383,0.000022639728,0.00023450627,0.0000120334535,0.000015428895,0.000102780235],"genre_scores_gemma":[0.96919096,0.0002227708,0.029901098,0.00015483597,0.00026842346,0.000041924282,0.0000052323003,0.0000035509256,0.0002112356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991792,0.000063734944,0.00030789492,0.00017137303,0.00014622824,0.00013158345],"domain_scores_gemma":[0.99909085,0.00017348217,0.0002541675,0.00025194295,0.00017032721,0.00005924565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006263161,0.00009148915,0.00018595434,0.00019653508,0.0006087608,0.00017973906,0.00034293346,0.00002926304,0.000012336614],"category_scores_gemma":[0.000015721225,0.000058849888,0.0001941581,0.0007266751,0.000036383517,0.00018450795,0.000024114994,0.00011734063,0.0000021458306],"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.000035159217,0.00031280948,0.0001230883,0.000038176862,0.00061851897,9.777868e-7,0.0012264261,0.02052702,0.0072303643,0.74386996,0.00037557873,0.22564194],"study_design_scores_gemma":[0.0005444872,0.0004337561,0.0028449341,0.00004846774,0.000618149,0.000033364726,0.00023554421,0.88945884,0.0015085324,0.083767936,0.020243004,0.00026298812],"about_ca_topic_score_codex":0.0000022454997,"about_ca_topic_score_gemma":0.0000014797176,"teacher_disagreement_score":0.96788055,"about_ca_system_score_codex":0.000012403508,"about_ca_system_score_gemma":0.000020829017,"threshold_uncertainty_score":0.46821576},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035147026,0.00057774753,0.9623553,0.00080374366,0.00004295777,0.00057713356,0.000069635586,0.000048379385,0.00037803702],"genre_scores_gemma":[0.9483733,0.00016023125,0.049856503,0.00020264169,0.00041187467,0.00015857263,0.000020377322,0.000015117514,0.0008013929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984521,0.00005265496,0.00048943836,0.00040843047,0.0002598887,0.0003374544],"domain_scores_gemma":[0.99828357,0.0005528121,0.000347105,0.00033825007,0.00017275919,0.00030552744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012608474,0.00019774235,0.00033941268,0.00033192703,0.00073617266,0.00045503862,0.00033849705,0.000055413875,0.000017367067],"category_scores_gemma":[0.000013981257,0.00015011837,0.00014814387,0.00077390875,0.00007203174,0.0001318132,0.000058443835,0.00019701182,0.0000033173255],"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.00022454468,0.0010142105,0.007017212,0.00023049663,0.0047950884,0.000040434657,0.0006409839,0.024279954,0.0011188552,0.89884496,0.0012688441,0.060524397],"study_design_scores_gemma":[0.012336245,0.0033828248,0.038195208,0.0004044612,0.008286498,0.0032031122,0.00338805,0.26214653,0.0027088195,0.07410045,0.5877017,0.004146136],"about_ca_topic_score_codex":0.00000947766,"about_ca_topic_score_gemma":0.000017048922,"teacher_disagreement_score":0.91322625,"about_ca_system_score_codex":0.000036652054,"about_ca_system_score_gemma":0.00004320411,"threshold_uncertainty_score":0.612165},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96329254,0.004394961,0.0248179,0.0003005626,0.000017737135,0.00007666896,0.000058097732,0.00002326247,0.007018269],"genre_scores_gemma":[0.99730843,0.00089662225,0.0011608154,0.000042593103,0.00026330864,0.000019608902,0.00001720062,0.000007503833,0.0002839026],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990208,0.000028551303,0.00036840016,0.00014213238,0.00023750887,0.00020259692],"domain_scores_gemma":[0.9990985,0.000073459676,0.0003208023,0.00025210012,0.00006262861,0.00019254645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002780511,0.000120621866,0.00028992599,0.00015791679,0.00020113328,0.000043090364,0.00015725724,0.00007069033,0.00077298994],"category_scores_gemma":[0.000016477445,0.000097067285,0.0003316881,0.00049594574,0.00004678197,0.00008248312,0.000025037822,0.00023928485,0.00001009217],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003201183,0.0036188054,0.35521168,0.00039521008,0.0074890708,0.0000075848225,0.00079636386,0.0014001853,0.442523,0.1606469,0.0009135281,0.026677556],"study_design_scores_gemma":[0.0033184953,0.0002272664,0.15852086,0.00010954503,0.014662282,0.000215421,0.0010899142,0.004297015,0.57606435,0.013615461,0.22603738,0.0018420358],"about_ca_topic_score_codex":0.000013475455,"about_ca_topic_score_gemma":0.000002805688,"teacher_disagreement_score":0.22512385,"about_ca_system_score_codex":0.000030546642,"about_ca_system_score_gemma":0.000023808687,"threshold_uncertainty_score":0.8463698},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002468778,0.00021090834,0.9952355,0.0006974926,0.000008187165,0.00034834337,0.0000071515105,0.000047206668,0.0009764178],"genre_scores_gemma":[0.4616334,0.00037888216,0.5370938,0.00024638604,0.00010636527,0.000255074,0.000006862601,0.000013305094,0.00026588538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882716,0.000092333124,0.00027949474,0.0003986604,0.00021471632,0.00018765681],"domain_scores_gemma":[0.9988646,0.000101573394,0.00014885672,0.00045941593,0.00013986914,0.0002857153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005699379,0.00014477737,0.00022238851,0.000325798,0.0005704287,0.0003652015,0.00025613708,0.00003985632,0.00007645282],"category_scores_gemma":[0.00001223299,0.00011262964,0.00007363052,0.002047468,0.000050236224,0.00020517068,0.000034280314,0.00016929439,0.000010692185],"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.000009447264,0.0002169055,0.002161225,0.000014434399,0.00025219563,0.0000019289273,0.00012204012,0.16526382,0.00014160894,0.82068413,0.000046638717,0.011085645],"study_design_scores_gemma":[0.0038783224,0.0014161876,0.016744334,0.00009061617,0.0040448294,0.0010185821,0.0015820588,0.6106639,0.0055042324,0.21088168,0.14047123,0.003704023],"about_ca_topic_score_codex":0.0000025332604,"about_ca_topic_score_gemma":0.0000049709774,"teacher_disagreement_score":0.6098024,"about_ca_system_score_codex":0.000030876094,"about_ca_system_score_gemma":0.0000412873,"threshold_uncertainty_score":0.45929033},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41415578,0.00056346756,0.5833031,0.000084015206,0.000003981557,0.00015436656,0.000028520812,0.00013337997,0.0015733956],"genre_scores_gemma":[0.9945294,0.0011346033,0.004044908,0.000015355043,0.000021006499,0.000021926198,0.000014036202,0.00001204051,0.00020671867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919754,0.000024580957,0.00030814897,0.00013747907,0.0002038208,0.0001284065],"domain_scores_gemma":[0.99944353,0.000080682104,0.00012611423,0.00016168857,0.0000956602,0.000092338116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012125523,0.0001231476,0.00031917947,0.00023097992,0.00011198999,0.000024659856,0.00011506006,0.000044640314,0.00040622838],"category_scores_gemma":[0.000009726799,0.00009225106,0.00013818865,0.0015546466,0.00006425348,0.00009487047,0.0000069938237,0.00018457723,0.000009400558],"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.00017746631,0.0011993585,0.06375211,0.00011287504,0.01841803,0.000024734805,0.0005738574,0.5320824,0.020222021,0.020414755,0.0008016106,0.34222078],"study_design_scores_gemma":[0.0027553749,0.001329101,0.1307527,0.00049293827,0.015137616,0.000057431753,0.0007491691,0.6650146,0.09884798,0.030025382,0.051916037,0.00292166],"about_ca_topic_score_codex":0.0000036464612,"about_ca_topic_score_gemma":0.0000058733945,"teacher_disagreement_score":0.58037364,"about_ca_system_score_codex":0.00003445438,"about_ca_system_score_gemma":0.0000065750573,"threshold_uncertainty_score":0.44479162},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017431684,0.00029162792,0.9764917,0.0011858307,0.00004677095,0.000090357,0.000005180834,0.00006477467,0.004392113],"genre_scores_gemma":[0.97480875,0.0007760816,0.012518055,0.00024975798,0.0006194842,0.000043148615,0.000011457333,0.000010732664,0.01096254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989212,0.00006465918,0.00028018892,0.0002810516,0.00021939256,0.00023348308],"domain_scores_gemma":[0.9990737,0.000083431856,0.0001513463,0.00041059358,0.00007438856,0.0002065678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030726969,0.00013047502,0.00021342697,0.00041384622,0.0006573855,0.00042484162,0.00041841043,0.00004083329,0.00029865257],"category_scores_gemma":[0.0000065756594,0.00010432177,0.00023297004,0.0018028766,0.000034212277,0.00025252646,0.000057922185,0.0002446789,0.00013235296],"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.00002389501,0.0005601052,0.005420151,0.000010706678,0.001120663,0.000027336948,0.00011575897,0.003420671,0.00090525224,0.9247822,0.0018779323,0.061735302],"study_design_scores_gemma":[0.0013498303,0.00043221362,0.035952095,0.00002832256,0.0022101586,0.0008565624,0.00032090818,0.12975688,0.00054319587,0.19432239,0.63311684,0.001110599],"about_ca_topic_score_codex":0.000005772965,"about_ca_topic_score_gemma":0.0000047665644,"teacher_disagreement_score":0.9639736,"about_ca_system_score_codex":0.000024711051,"about_ca_system_score_gemma":0.00002293997,"threshold_uncertainty_score":0.5056144},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047923412,0.00082906254,0.9491205,0.001481627,0.000020026671,0.00033283693,0.000011158434,0.000039366405,0.00024198121],"genre_scores_gemma":[0.9965279,0.00023534114,0.0029657495,0.000057243236,0.00009713803,0.00007228919,0.0000031789752,0.000008679772,0.00003245972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993346,0.000027700264,0.0002634399,0.00012788207,0.00012388692,0.00012252101],"domain_scores_gemma":[0.99952984,0.00006572031,0.00006411968,0.00018267722,0.00004761161,0.000110030465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023023246,0.00009929594,0.00024474444,0.00010150736,0.00022528027,0.00010136483,0.00008759845,0.000024131732,0.0000046276878],"category_scores_gemma":[0.000013354243,0.000067344525,0.00008595251,0.00052490056,0.000042589014,0.00006610597,0.000009395731,0.00012671293,0.000005986706],"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.000033254648,0.000016014397,0.0008193292,0.0000061534215,0.00027915684,4.6707544e-7,0.000071932416,0.9606013,0.0004941928,0.036160894,0.000007181763,0.0015101465],"study_design_scores_gemma":[0.020859528,0.00020018774,0.1264075,0.00011023274,0.0043879133,0.0001448126,0.0006672671,0.6728905,0.00035289183,0.14328723,0.029214762,0.0014771743],"about_ca_topic_score_codex":0.000010187972,"about_ca_topic_score_gemma":0.000035657275,"teacher_disagreement_score":0.9486045,"about_ca_system_score_codex":0.00007399766,"about_ca_system_score_gemma":0.0000053275007,"threshold_uncertainty_score":0.27462298},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028389408,0.000025645902,0.99590397,0.00043274325,0.00005522994,0.00028391785,0.000033587537,0.000021716749,0.0004042612],"genre_scores_gemma":[0.008129201,0.000077305114,0.9905891,0.00011156174,0.0003424488,0.00016441429,0.000004946935,0.000014627651,0.00056642527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989261,0.00012213175,0.00038356413,0.00024842515,0.00012638027,0.00019338953],"domain_scores_gemma":[0.9976384,0.0013514295,0.00028198308,0.00020135596,0.00035489385,0.00017194997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001089782,0.00014431935,0.00033585736,0.00021391764,0.00047800803,0.000105145096,0.0001266481,0.00009535426,0.00028371185],"category_scores_gemma":[0.0006679343,0.000115062365,0.00017883265,0.0008526211,0.000065434404,0.000060076767,0.000018969698,0.00037466214,0.000007447794],"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.000034335695,0.0001318388,0.0003501166,0.000017181095,0.0004343089,3.7558715e-7,0.000046337937,0.00030359023,0.0022382792,0.9469227,0.00081218884,0.048708756],"study_design_scores_gemma":[0.00039464087,0.00013178083,0.0013645331,0.000008054965,0.0013972524,0.000023361774,0.000051045456,0.23992842,0.00048698828,0.71655196,0.039435036,0.00022693044],"about_ca_topic_score_codex":0.000013468156,"about_ca_topic_score_gemma":0.00008366936,"teacher_disagreement_score":0.23962483,"about_ca_system_score_codex":0.000023356488,"about_ca_system_score_gemma":0.00004494503,"threshold_uncertainty_score":0.4692107},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023801574,0.00006203527,0.97255605,0.0017126604,0.000021307427,0.0005326898,0.000063200365,0.000085892825,0.0011645956],"genre_scores_gemma":[0.95973414,0.00007031726,0.03746924,0.00031992214,0.00043184336,0.00041830694,0.00004378123,0.000037646194,0.0014747911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868894,0.00006696872,0.00050495553,0.00030385482,0.00020577291,0.00022950763],"domain_scores_gemma":[0.99802744,0.0007808588,0.00035812968,0.00040832788,0.00021100813,0.00021421004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050331437,0.00018720307,0.00037947108,0.0004047823,0.00071288826,0.00015856395,0.00021708873,0.00007591106,0.00010072539],"category_scores_gemma":[0.00010221078,0.00015121853,0.00037300793,0.00064046355,0.000073760035,0.00005998466,0.00002110881,0.00020423102,0.000054478714],"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.000019651432,0.00023483012,0.00016438753,0.000025244537,0.00035757924,2.7194088e-7,0.0000542964,0.00081888644,0.000851252,0.9855895,0.0016095026,0.010274585],"study_design_scores_gemma":[0.001402127,0.00021536037,0.0034872054,0.000034287576,0.003201572,0.00006784959,0.00023857056,0.054611843,0.0003359724,0.794996,0.14082548,0.0005837081],"about_ca_topic_score_codex":0.0000023287473,"about_ca_topic_score_gemma":0.000007216137,"teacher_disagreement_score":0.9359326,"about_ca_system_score_codex":0.000032542343,"about_ca_system_score_gemma":0.00001378252,"threshold_uncertainty_score":0.61665124},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036491025,0.0002885133,0.9009734,0.00032564098,0.00010289895,0.0005551809,0.000089033114,0.00016090681,0.061013393],"genre_scores_gemma":[0.985828,0.0003988674,0.009940553,0.0002069261,0.00020978748,0.00007294364,0.000012880178,0.000027822967,0.0033022154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986316,0.000056226305,0.0005425812,0.000245919,0.00025959694,0.0002640736],"domain_scores_gemma":[0.9986944,0.00017465727,0.0003718812,0.00039377657,0.00014182484,0.0002234526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004903166,0.0001954199,0.00035887142,0.00035977105,0.0005770719,0.00012344457,0.00019461624,0.00009295524,0.00044669188],"category_scores_gemma":[0.000029385796,0.00015903909,0.00034450536,0.0008363771,0.000077848854,0.00014870791,0.00003585914,0.00034424118,0.00005635308],"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.00006330089,0.00039159224,0.00082149386,0.00003975848,0.0011730695,0.000014375589,0.0004713003,0.00014731516,0.00011540122,0.9709245,0.0005175792,0.02532032],"study_design_scores_gemma":[0.0016630286,0.0005534489,0.0052298172,0.00006439447,0.005593221,0.00021387824,0.00080148486,0.012338542,0.0018572457,0.8315787,0.13888781,0.0012184556],"about_ca_topic_score_codex":0.000074231284,"about_ca_topic_score_gemma":0.00026161099,"teacher_disagreement_score":0.949337,"about_ca_system_score_codex":0.0000399534,"about_ca_system_score_gemma":0.000022279295,"threshold_uncertainty_score":0.6485426},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001170638,0.00008370503,0.99745774,0.00057420926,0.000017591838,0.00015737455,0.0000017747587,0.000049442137,0.00048753442],"genre_scores_gemma":[0.58130807,0.0004529239,0.41791907,0.000046919416,0.00009778023,0.000035914167,0.000005150851,0.000006704683,0.00012748278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916697,0.000026690379,0.00029061484,0.00024092091,0.000118871016,0.00015590762],"domain_scores_gemma":[0.9989897,0.00005709235,0.00035219296,0.00041086425,0.000115524905,0.000074635325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047286588,0.00009642101,0.00018569751,0.00037878164,0.00083142193,0.0005961254,0.00050638214,0.000048187343,0.000004189311],"category_scores_gemma":[0.00003446622,0.00009024924,0.000109739834,0.00036956475,0.000025808384,0.00026746833,0.00006750945,0.00013525042,0.0000011569499],"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.0000029471607,0.000030981224,0.0009182658,0.000003761826,0.000047187867,9.422243e-7,0.00002722824,0.9761435,0.000015977732,0.012501208,0.000035324534,0.0102727255],"study_design_scores_gemma":[0.00022101561,0.000032441036,0.00091706665,0.000014164621,0.000052387913,0.0000045870606,0.000013892077,0.9951832,0.00009141928,0.0021209093,0.001241762,0.00010713378],"about_ca_topic_score_codex":0.000012424378,"about_ca_topic_score_gemma":0.00000935288,"teacher_disagreement_score":0.58013743,"about_ca_system_score_codex":0.000027110254,"about_ca_system_score_gemma":0.00003305243,"threshold_uncertainty_score":0.63947093},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.292552,0.0006684331,0.66237277,0.025766013,0.00004053365,0.0011115026,0.00028631566,0.0001407217,0.017061725],"genre_scores_gemma":[0.98906237,0.0008371786,0.008072356,0.00012528499,0.00019642919,0.00010173154,0.000011570435,0.000020724627,0.0015723404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897724,0.0000339698,0.00038103198,0.0002572234,0.00016294743,0.00018757215],"domain_scores_gemma":[0.9985343,0.00017114118,0.0003526005,0.00061093026,0.000099537094,0.00023148487],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00034374092,0.00018252275,0.00036098028,0.00022137597,0.0018012812,0.0004897289,0.0002699101,0.00007439448,0.00012589115],"category_scores_gemma":[0.00002903598,0.00012765756,0.00027063987,0.00020338345,0.00015424826,0.00015304085,0.000032734544,0.00027278275,0.000015316378],"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.000071353184,0.0004946745,0.005184141,0.000073988136,0.0027574268,0.0000067969586,0.0008038488,0.000110484674,0.0017435256,0.8453682,0.0027060516,0.1406795],"study_design_scores_gemma":[0.0018848734,0.00012270622,0.03418575,0.00005827173,0.0032507062,0.00021658829,0.0009950834,0.009621623,0.000836645,0.7890844,0.15893656,0.00080682634],"about_ca_topic_score_codex":0.000006536867,"about_ca_topic_score_gemma":0.000021061822,"teacher_disagreement_score":0.6965104,"about_ca_system_score_codex":0.000017565691,"about_ca_system_score_gemma":0.0000135920145,"threshold_uncertainty_score":0.99949825},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003936555,0.00022817434,0.9920432,0.0024486457,0.00006505183,0.00039490502,0.000044286742,0.000013907573,0.0008252607],"genre_scores_gemma":[0.9920871,0.00008795539,0.0068608327,0.000050206225,0.00015331242,0.00009508694,0.000005358958,0.000006438009,0.0006536847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988625,0.000116967865,0.0003920313,0.00022220903,0.00025974525,0.00014655452],"domain_scores_gemma":[0.99689305,0.0012397433,0.00074901263,0.00079129776,0.000225945,0.00010092405],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011058816,0.00011800702,0.0002806498,0.00039232522,0.001474946,0.0003425058,0.00087031355,0.000044940665,0.000011469638],"category_scores_gemma":[0.0001962984,0.00007480011,0.00028733897,0.0006849046,0.00008763461,0.00021164381,0.00007411919,0.00019359365,0.00002099023],"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.000007644047,0.000083020226,0.00007608614,0.000009245312,0.00030915235,4.3567343e-7,0.00004659151,0.004495625,0.000041674764,0.9927825,0.00009704652,0.0020509893],"study_design_scores_gemma":[0.0006888795,0.0002661932,0.0022379882,0.00006451296,0.0009226763,0.000012029007,0.00015718798,0.85030794,0.00023661491,0.13542224,0.009406458,0.00027724658],"about_ca_topic_score_codex":0.0000097681495,"about_ca_topic_score_gemma":0.0000015491005,"teacher_disagreement_score":0.9881506,"about_ca_system_score_codex":0.000022273369,"about_ca_system_score_gemma":0.000031714666,"threshold_uncertainty_score":0.999825},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23961844,0.0005834282,0.75855964,0.00020786413,0.00004243636,0.0002398545,0.00014628164,0.000050676375,0.0005513874],"genre_scores_gemma":[0.99431986,0.0004967606,0.005002016,0.000031673797,0.000094281655,0.00002109549,0.000009002192,0.000008164483,0.000017146662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992555,0.00003310465,0.00028346578,0.00018270372,0.00014454301,0.00010070628],"domain_scores_gemma":[0.9992279,0.000016929218,0.00013991892,0.000412334,0.00013026355,0.000072659685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016094984,0.00012777685,0.00025974936,0.00009179032,0.00013715064,0.00007621689,0.00017723936,0.00008662675,0.00001005306],"category_scores_gemma":[0.000009541024,0.00009533593,0.0001373978,0.00051392755,0.00004994055,0.00002218906,0.00014788641,0.00020650233,9.1597656e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010593381,0.0006138555,0.22672504,0.0005591969,0.004294317,0.0000028113504,0.0014280642,0.6818332,0.0021765598,0.028705042,0.0077701434,0.045785815],"study_design_scores_gemma":[0.00057608134,0.00011777462,0.3744801,0.00063124986,0.004645781,0.000035571356,0.00042951765,0.40592977,0.005436327,0.1447491,0.061716657,0.0012520644],"about_ca_topic_score_codex":0.000008669202,"about_ca_topic_score_gemma":0.00008614407,"teacher_disagreement_score":0.75470144,"about_ca_system_score_codex":0.00005081269,"about_ca_system_score_gemma":0.000014832754,"threshold_uncertainty_score":0.3887686},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026368234,0.00009049835,0.9720471,0.00076738617,0.000032228818,0.00012439553,0.000025249805,0.000040442304,0.0005044906],"genre_scores_gemma":[0.955633,0.0007272834,0.04289777,0.0002221676,0.00020996152,0.000012016778,0.000054783624,0.0000097211205,0.00023331503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990088,0.000058161753,0.00025433782,0.0002956934,0.00023661759,0.0001463854],"domain_scores_gemma":[0.9991288,0.00005238201,0.00023930043,0.00018887025,0.00022576725,0.0001648467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020028497,0.00012283662,0.00017594938,0.0002794837,0.00073126133,0.00037429697,0.0001917974,0.00006972597,0.00010618408],"category_scores_gemma":[0.000013403182,0.00010369879,0.000077809855,0.00092586514,0.00006697565,0.00045414205,0.00006991322,0.00014482882,0.000038096583],"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.00039725038,0.002861125,0.048334923,0.00016068672,0.004882317,0.000023068322,0.0077426806,0.053512767,0.042691723,0.46356347,0.037622675,0.33820733],"study_design_scores_gemma":[0.0017132569,0.0006979564,0.015410966,0.00007678289,0.0011679357,0.000098880984,0.0006449197,0.8909832,0.002111832,0.012853906,0.07312102,0.0011193004],"about_ca_topic_score_codex":0.00000755107,"about_ca_topic_score_gemma":0.000004797838,"teacher_disagreement_score":0.9292647,"about_ca_system_score_codex":0.000025370764,"about_ca_system_score_gemma":0.000018819504,"threshold_uncertainty_score":0.5624345},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23917954,0.002992451,0.75042266,0.0017789382,0.00008639178,0.0027891204,0.0024327405,0.000028413917,0.00028977304],"genre_scores_gemma":[0.9931171,0.0011330997,0.0042023542,0.000021185919,0.0006914235,0.0003266824,0.0001366633,0.000026750184,0.0003447275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765235,0.000152159,0.0010171501,0.0004298918,0.00048566854,0.00026279796],"domain_scores_gemma":[0.9955333,0.001083423,0.0016016113,0.0011094483,0.0005196271,0.00015261503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000822623,0.0003256236,0.00077608076,0.00034176937,0.00073103106,0.00016961504,0.0006714241,0.00016574371,0.000030287292],"category_scores_gemma":[0.00011807326,0.00017479765,0.00044865828,0.0020515602,0.00021913601,0.00004509685,0.0001991926,0.0006762784,0.0000055864175],"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.00023440506,0.00043749704,0.0010146861,0.00045312496,0.005104794,0.000011498906,0.00033898736,0.042337574,0.00039424308,0.9216593,0.0039332304,0.024080696],"study_design_scores_gemma":[0.001124896,0.00040353576,0.0015540966,0.00018737082,0.011601246,0.0005955535,0.004006714,0.0015936814,0.0025309443,0.9220144,0.053341404,0.0010461564],"about_ca_topic_score_codex":0.000035541572,"about_ca_topic_score_gemma":0.00010285116,"teacher_disagreement_score":0.7539376,"about_ca_system_score_codex":0.00008191895,"about_ca_system_score_gemma":0.00013389418,"threshold_uncertainty_score":0.71280414},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025517208,0.00043012394,0.97944236,0.018963633,0.000022599379,0.00009346482,0.000004636927,0.00003390849,0.00075412827],"genre_scores_gemma":[0.6176237,0.0019797788,0.36979428,0.005262974,0.0025240928,0.00015581987,0.000014338658,0.00002765381,0.0026173599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99890274,0.00015189058,0.00029314472,0.00023629925,0.00026341146,0.00015249252],"domain_scores_gemma":[0.99890465,0.00033941263,0.00018747833,0.000271069,0.00009477781,0.00020263513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007041113,0.00010175285,0.00016408137,0.000099916164,0.00095998513,0.00053001684,0.00059317553,0.000030285759,0.000029040335],"category_scores_gemma":[0.000030121932,0.00006469802,0.0001999127,0.0012869707,0.00003439772,0.00013588188,0.00007734959,0.00024215512,0.000048945152],"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.000006556877,0.00003308352,0.000082552644,0.000003015875,0.00032679198,0.0000028177951,0.00009385565,0.0062126843,0.00023967573,0.9355275,0.0007595952,0.056711897],"study_design_scores_gemma":[0.00041239217,0.00011652728,0.0010004278,0.0000044976705,0.00047866593,0.00008890524,0.00013663154,0.42073652,0.0006009565,0.08819294,0.48792705,0.00030450083],"about_ca_topic_score_codex":8.782352e-7,"about_ca_topic_score_gemma":8.589042e-7,"teacher_disagreement_score":0.8473345,"about_ca_system_score_codex":0.000010795466,"about_ca_system_score_gemma":0.00003927402,"threshold_uncertainty_score":0.73835266},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064798538,0.0008655424,0.9838156,0.007639786,0.00009007284,0.0008269306,0.00014707039,0.000037326365,0.00009782213],"genre_scores_gemma":[0.9584227,0.000062520456,0.04078837,0.0003681363,0.00016314427,0.00011838072,0.000030526186,0.000007643065,0.000038529404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768126,0.00036316455,0.0007388863,0.00070071843,0.0002738127,0.0002421485],"domain_scores_gemma":[0.9966878,0.0012366553,0.0005950507,0.00082841294,0.00043367286,0.00021839782],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021640498,0.00026329313,0.00068825466,0.00018800233,0.00081366434,0.0014856494,0.0007572412,0.00009906422,0.000011136434],"category_scores_gemma":[0.00014875783,0.0001835631,0.00043275498,0.00089985784,0.00019529693,0.000084216124,0.0003495618,0.00041699552,0.0000014419317],"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.0004896226,0.0005481028,0.0080833575,0.0004245271,0.0030146255,0.0000060785032,0.0012015976,0.13498908,0.00016377654,0.70673585,0.00021795412,0.1441254],"study_design_scores_gemma":[0.0009992806,0.00003261928,0.002425079,0.00008797421,0.0007348514,0.00000828048,0.00027910856,0.9366169,0.00006648712,0.056562155,0.0018517831,0.0003355101],"about_ca_topic_score_codex":0.000024514591,"about_ca_topic_score_gemma":0.000036169567,"teacher_disagreement_score":0.9519429,"about_ca_system_score_codex":0.00006779501,"about_ca_system_score_gemma":0.0001417587,"threshold_uncertainty_score":0.9995509},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001721204,0.0009420846,0.9899232,0.004989024,0.00010477895,0.0009856541,0.00022120625,0.00009401178,0.0010188532],"genre_scores_gemma":[0.87884444,0.0038278785,0.110253945,0.0013323189,0.0015514917,0.0014524937,0.00029193383,0.00008427453,0.0023612187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780375,0.00012074068,0.0006276633,0.0008403337,0.00032195658,0.00028557068],"domain_scores_gemma":[0.9976537,0.0005474659,0.00067299826,0.000606945,0.00016021858,0.00035863096],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000678935,0.00035457578,0.00063557987,0.0011024864,0.0006151549,0.0008564848,0.00073537236,0.00018427317,0.000041979813],"category_scores_gemma":[0.000063751606,0.00030093605,0.0004847805,0.0014808822,0.00006871016,0.00015555264,0.00032175254,0.00073951593,0.000024002438],"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.000053662112,0.0006270035,0.00024642024,0.00048207713,0.0038104027,0.000010958579,0.00040095331,0.040411286,0.00013174226,0.8758471,0.006981868,0.070996515],"study_design_scores_gemma":[0.001108718,0.00056829146,0.0010437742,0.00015825579,0.0024514368,0.0000912215,0.00007750016,0.18984859,0.0002656054,0.77924067,0.02407681,0.0010691439],"about_ca_topic_score_codex":0.0000040725718,"about_ca_topic_score_gemma":0.0000018890247,"teacher_disagreement_score":0.87966925,"about_ca_system_score_codex":0.000048493734,"about_ca_system_score_gemma":0.000090579015,"threshold_uncertainty_score":0.99994427},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0234746,0.00008213897,0.9744053,0.0005725276,0.000026826528,0.0003944976,0.000032116197,0.000026008649,0.0009860238],"genre_scores_gemma":[0.9716929,0.000087628585,0.027272724,0.00013224078,0.00006931813,0.00008137262,0.000016426982,0.000007039374,0.00064034475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999014,0.00005097056,0.00023831303,0.00026605724,0.00023442914,0.00019622828],"domain_scores_gemma":[0.9989677,0.00018782417,0.00017110548,0.00036191352,0.0001812729,0.00013018015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036864757,0.00009679761,0.00020400264,0.00028064984,0.00029010783,0.00022162918,0.0003398914,0.00003768403,0.00015986661],"category_scores_gemma":[0.000012007178,0.0000777633,0.00017983366,0.0010003261,0.000045301374,0.00020748237,0.000043957858,0.00016290063,0.000058222387],"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.000016240814,0.000037010985,0.0028056768,0.000009192815,0.0003000269,9.71787e-7,0.000032275882,0.0009873242,0.001883299,0.9843957,0.00016567104,0.009366603],"study_design_scores_gemma":[0.0014192509,0.00018930504,0.004833825,0.000016036418,0.0003512662,0.00009066869,0.00020115901,0.03521685,0.0012423338,0.9037775,0.05227611,0.00038569028],"about_ca_topic_score_codex":8.797297e-7,"about_ca_topic_score_gemma":0.000002224604,"teacher_disagreement_score":0.9482183,"about_ca_system_score_codex":0.000032129068,"about_ca_system_score_gemma":0.00003726745,"threshold_uncertainty_score":0.31710956},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000614286,0.002641843,0.99373126,0.0019025587,0.00017677444,0.0007066875,0.00014256807,0.000023980996,0.000060050043],"genre_scores_gemma":[0.38804612,0.0049752737,0.59801906,0.0003906318,0.003969251,0.0019167364,0.00050577224,0.000066159,0.0021110012],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780715,0.00018997522,0.0007684323,0.00052352704,0.0004616017,0.00024934692],"domain_scores_gemma":[0.99737334,0.00041834227,0.00090069673,0.00073665025,0.00043893312,0.0001320301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014291742,0.000256548,0.0005297162,0.00038952008,0.00072968437,0.0005431767,0.0009917113,0.00017287713,0.000045457873],"category_scores_gemma":[0.000024689401,0.00018908233,0.0007911691,0.0009099514,0.00009013318,0.00016211992,0.0003827902,0.00055579614,0.0000037389414],"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.000035811772,0.0009225326,0.00016118321,0.0002658272,0.0070339763,0.0000058728033,0.0009877683,0.15654694,0.0013113423,0.11136753,0.0018293797,0.71953183],"study_design_scores_gemma":[0.00055511564,0.00010329571,0.00082193146,0.00008047606,0.0019092085,0.000056892324,0.0001517175,0.95700276,0.0005295706,0.02695206,0.011412476,0.00042451313],"about_ca_topic_score_codex":0.000024803261,"about_ca_topic_score_gemma":0.00000909081,"teacher_disagreement_score":0.8004558,"about_ca_system_score_codex":0.00006486028,"about_ca_system_score_gemma":0.00034616713,"threshold_uncertainty_score":0.77105534},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069049903,0.00025136975,0.99570847,0.0025431649,0.000018089566,0.0005512249,0.000034966906,0.00005742458,0.00014477239],"genre_scores_gemma":[0.39353436,0.00009924828,0.6030144,0.00082491926,0.00094565394,0.0004284604,0.0000282517,0.000031218347,0.0010934785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983449,0.00023866448,0.000417155,0.00048977684,0.0002792584,0.0002302684],"domain_scores_gemma":[0.9983839,0.0002501376,0.00033156725,0.00036742736,0.00028461532,0.00038235646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008067212,0.00019689169,0.0004354041,0.00044257,0.0005386605,0.0005244629,0.0005448784,0.000056000263,0.000010684769],"category_scores_gemma":[0.000033961307,0.0001110006,0.00019411164,0.003021003,0.000033521497,0.00036323504,0.000049283753,0.0002363708,0.000012930032],"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.0005918288,0.0023678248,0.0012120121,0.00041817903,0.0053747357,0.000059455,0.004777213,0.07624877,0.0022066233,0.6807339,0.001507637,0.2245018],"study_design_scores_gemma":[0.00049627904,0.0009052787,0.00005765232,0.000013229304,0.0004703382,0.00005172504,0.0003023289,0.9711969,0.00015078312,0.0010052626,0.025111029,0.00023921735],"about_ca_topic_score_codex":0.000008765438,"about_ca_topic_score_gemma":0.0000022303566,"teacher_disagreement_score":0.8949481,"about_ca_system_score_codex":0.000022276598,"about_ca_system_score_gemma":0.00007696867,"threshold_uncertainty_score":0.5057408},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012020943,0.00088838197,0.9954353,0.0016934844,0.000113563634,0.000262011,0.00009888017,0.00008260498,0.00022365357],"genre_scores_gemma":[0.044313036,0.00039486494,0.95163685,0.00038667716,0.0009464692,0.00010992606,0.00013654945,0.000027934406,0.002047706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979822,0.00016065591,0.00059018057,0.00056977605,0.0003570453,0.00034011368],"domain_scores_gemma":[0.99745727,0.0006427314,0.00035897802,0.0008057098,0.00047880018,0.0002564906],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008325085,0.00022665237,0.00042309827,0.00048663974,0.0013227607,0.00068611844,0.00071854034,0.00009034459,0.00007592186],"category_scores_gemma":[0.00010351437,0.00019941007,0.00047650703,0.0023475057,0.00005360443,0.00033235046,0.00026818548,0.0003339223,0.000028154413],"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.00001574105,0.0004808613,0.00025561755,0.000028891816,0.0011858899,0.000024877589,0.00019766281,0.007215196,0.001524116,0.18775181,0.0017144232,0.7996049],"study_design_scores_gemma":[0.0017257127,0.00015398802,0.00097654224,0.000048616686,0.0008499829,0.0002594492,0.0003921672,0.80920744,0.001363266,0.06104666,0.12338016,0.0005960328],"about_ca_topic_score_codex":0.000005331716,"about_ca_topic_score_gemma":0.0000052860337,"teacher_disagreement_score":0.80199224,"about_ca_system_score_codex":0.00005032127,"about_ca_system_score_gemma":0.000095969,"threshold_uncertainty_score":0.9999774},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6208347,0.0003259348,0.3759553,0.0019176617,0.000082551094,0.00014072217,0.0000049685814,0.00002019817,0.0007179176],"genre_scores_gemma":[0.9987401,0.000029604675,0.0007676449,0.00011241067,0.0001278473,0.000011224073,0.0000010892512,0.0000018648278,0.00020826649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993854,0.000051372986,0.00020693727,0.00008655587,0.00016374953,0.000105939114],"domain_scores_gemma":[0.99944085,0.000024005976,0.00020412137,0.00018718731,0.00007216103,0.00007165367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023827683,0.00006030569,0.00012006075,0.00007469098,0.00040279527,0.000057648293,0.00023046693,0.000022284023,0.000022918233],"category_scores_gemma":[0.000007971768,0.00003586404,0.00011753159,0.0007011496,0.00005099745,0.00021454022,0.000080298494,0.00009989866,0.000011209004],"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.0000120578225,0.0006659173,0.046217445,0.00003423739,0.0008060485,2.9478676e-7,0.001268843,0.0015508028,0.010873689,0.8797851,0.0011590088,0.057626523],"study_design_scores_gemma":[0.0015216112,0.00019521524,0.69898576,0.00012818442,0.0021372256,0.00025353726,0.0004028776,0.06618833,0.05862723,0.08852511,0.08204438,0.0009905323],"about_ca_topic_score_codex":0.000007743708,"about_ca_topic_score_gemma":0.0000015430086,"teacher_disagreement_score":0.79126,"about_ca_system_score_codex":0.000014421552,"about_ca_system_score_gemma":0.000024935389,"threshold_uncertainty_score":0.3098016},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01597344,0.00034679126,0.9820613,0.0010543767,0.000045906523,0.00013444496,0.000024479044,0.000029380451,0.00032983738],"genre_scores_gemma":[0.9898725,0.00018558506,0.009180836,0.0001570821,0.00009693984,0.000046131125,0.000019084448,0.000005290294,0.00043653414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833566,0.00019749394,0.00050994306,0.00033590826,0.0004449994,0.00017597513],"domain_scores_gemma":[0.9986357,0.00014091366,0.000446072,0.00049684994,0.000136087,0.00014435423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090175774,0.00013489326,0.00039039354,0.00089970086,0.00079464604,0.00013371273,0.0006304181,0.000029615725,0.0007071853],"category_scores_gemma":[0.000011589757,0.00012067967,0.0004410986,0.00508551,0.00004599364,0.00021296041,0.0001646296,0.00027602952,0.0000094201605],"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.000049941213,0.0008961497,0.014630306,0.00004424829,0.008248585,0.00002500867,0.00095859246,0.38946688,0.001292951,0.55881965,0.0006010412,0.024966633],"study_design_scores_gemma":[0.000725823,0.00040267696,0.009714008,0.0000068850068,0.0052352347,0.00008713783,0.00077653484,0.9489883,0.0014101389,0.019852253,0.012223948,0.00057704496],"about_ca_topic_score_codex":0.000008924472,"about_ca_topic_score_gemma":0.00000374601,"teacher_disagreement_score":0.97389907,"about_ca_system_score_codex":0.00004104925,"about_ca_system_score_gemma":0.000054364336,"threshold_uncertainty_score":0.77431834},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038454842,0.00037554235,0.9951533,0.000090038426,0.000031557825,0.00030964066,0.000050393475,0.000099223245,0.00004479464],"genre_scores_gemma":[0.113687485,0.00027274527,0.8856647,0.00001931815,0.00009466261,0.00016956436,0.000027867176,0.000027283813,0.000036395784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985966,0.00009712017,0.0006888722,0.00020565088,0.0001936166,0.00021815437],"domain_scores_gemma":[0.99682754,0.0023583127,0.00027744073,0.00022683741,0.00018497361,0.00012486505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011570514,0.00016765916,0.0006719628,0.0012048726,0.00018289642,0.000060339156,0.00017886457,0.000050927865,0.00002017219],"category_scores_gemma":[0.00013969565,0.00014709253,0.00050914066,0.0044095293,0.00004431632,0.000075313765,0.000018130359,0.00020447024,0.0000038779745],"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.000004480432,0.0000302563,0.00019424729,0.000055160293,0.003792452,2.7214983e-7,0.000060941842,0.9662272,0.0012457436,0.0052768462,0.000012466992,0.023099957],"study_design_scores_gemma":[0.0003147209,0.000026601478,0.0006031188,0.00001166485,0.0056311386,0.0000019687554,0.000059486734,0.9803634,0.00017886331,0.011645127,0.0010201489,0.00014375593],"about_ca_topic_score_codex":0.0000012351763,"about_ca_topic_score_gemma":9.340002e-7,"teacher_disagreement_score":0.109842,"about_ca_system_score_codex":0.000042761618,"about_ca_system_score_gemma":0.000010607279,"threshold_uncertainty_score":0.5998259},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009263974,0.00019764631,0.99750507,0.00070682913,0.000053442083,0.00029401566,0.000044638342,0.000105867504,0.00016608619],"genre_scores_gemma":[0.563834,0.0009813933,0.42468652,0.0005115402,0.0022759084,0.0011350531,0.0002409213,0.000049769154,0.006284914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859166,0.00021305226,0.0003886911,0.00034657496,0.00023028541,0.00022975136],"domain_scores_gemma":[0.998529,0.00042774188,0.0002401889,0.00038078986,0.00021005233,0.00021220553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014946081,0.00013467499,0.0002966057,0.000994644,0.00069780176,0.00048543463,0.00040156825,0.000054413755,0.000013810204],"category_scores_gemma":[0.00003165966,0.000107285916,0.00022210082,0.0043853675,0.000020493268,0.00031709214,0.00004453015,0.00015116644,0.000050375325],"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.0000144601445,0.00016263907,0.00013137764,0.000031569038,0.0006263854,0.0000059955505,0.00025043587,0.04961716,0.00032332022,0.91267824,0.00079108233,0.035367336],"study_design_scores_gemma":[0.00030240728,0.00014872372,0.0003564448,0.000008381664,0.00030567092,0.00002467715,0.00016102601,0.9355074,0.00020725682,0.028442929,0.034348153,0.00018694266],"about_ca_topic_score_codex":0.000004933996,"about_ca_topic_score_gemma":0.0000014631482,"teacher_disagreement_score":0.88589025,"about_ca_system_score_codex":0.000023127479,"about_ca_system_score_gemma":0.00003158789,"threshold_uncertainty_score":0.5366998},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015519194,0.00068014796,0.9951617,0.0016654875,0.000089008194,0.00021263528,0.00008459464,0.000084826184,0.00046966976],"genre_scores_gemma":[0.9148282,0.00025062653,0.083712384,0.00012411884,0.00041854486,0.000060169183,0.00003321573,0.00001473814,0.0005579904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988778,0.000049518432,0.00032552355,0.00034008583,0.00019440304,0.00021262544],"domain_scores_gemma":[0.9989938,0.0003251577,0.000109729175,0.0003216686,0.00009361521,0.00015603862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038226857,0.00014011581,0.00020768367,0.00048496047,0.00067102653,0.0010294983,0.00044762553,0.00005159444,0.000110880916],"category_scores_gemma":[0.000026444517,0.00011246558,0.00025253778,0.0013767589,0.000057053676,0.0003405088,0.00007252721,0.00021681027,0.0000082330325],"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.0000021822414,0.000020481042,0.00020623597,0.00003519339,0.00047327587,0.0000034681552,0.00015382709,0.0040349765,0.0005382143,0.94671446,0.00030397376,0.047513686],"study_design_scores_gemma":[0.00033516446,0.00008008267,0.00075556454,0.00006944732,0.0010100038,0.000104563725,0.00025804163,0.6294876,0.0003574957,0.31334093,0.053757794,0.00044332517],"about_ca_topic_score_codex":0.00000285519,"about_ca_topic_score_gemma":0.0000060850803,"teacher_disagreement_score":0.9132763,"about_ca_system_score_codex":0.000029497123,"about_ca_system_score_gemma":0.00006216169,"threshold_uncertainty_score":0.9927476},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00096454244,0.002474272,0.9944291,0.0012025307,0.00009425513,0.000096320175,0.000009973546,0.00012736332,0.0006016256],"genre_scores_gemma":[0.9406193,0.0021739497,0.052779697,0.00023361878,0.0013311284,0.00007652581,0.000038377133,0.000028958204,0.0027184777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874204,0.00008660628,0.00035137823,0.00037197143,0.00025199555,0.00019601265],"domain_scores_gemma":[0.99915516,0.00014710834,0.00011102993,0.00032117055,0.00009154498,0.00017397733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065675314,0.00014643863,0.000220461,0.0007315191,0.0004283472,0.000982504,0.0003771935,0.00005161805,0.000102536884],"category_scores_gemma":[0.000011323372,0.00011606232,0.00026850385,0.0030734583,0.0000317743,0.0003753404,0.000060773764,0.00025202884,0.00007998763],"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.0000020147725,0.000051257954,0.00025846384,0.000021771386,0.0005703077,0.00002085817,0.000083559884,0.002149596,0.00020163026,0.84857124,0.00021743694,0.14785185],"study_design_scores_gemma":[0.00024224969,0.00010643673,0.0026274193,0.00006672487,0.0011766554,0.00021788562,0.000059100348,0.7482098,0.00039600703,0.08692167,0.15943308,0.0005429904],"about_ca_topic_score_codex":0.0000026635896,"about_ca_topic_score_gemma":0.0000015591228,"teacher_disagreement_score":0.94164944,"about_ca_system_score_codex":0.0000353499,"about_ca_system_score_gemma":0.00005184674,"threshold_uncertainty_score":0.9474309},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022359297,0.00023105132,0.9703455,0.0004159414,0.000021631718,0.00024412303,0.000054309083,0.000014605098,0.006313519],"genre_scores_gemma":[0.98955786,0.0001433282,0.0074743554,0.000038242713,0.00011649101,0.000090781374,0.00003339154,0.000007951667,0.0025376247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900055,0.000026406136,0.0004918632,0.00018569296,0.00015304168,0.00014244202],"domain_scores_gemma":[0.9988899,0.0002841787,0.00034710695,0.0002614162,0.00013344365,0.00008395179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018966266,0.00012691306,0.00032217524,0.00036748673,0.0003710973,0.00007173752,0.00015186632,0.000035311376,0.00045418125],"category_scores_gemma":[0.000011663424,0.000092773764,0.00022201665,0.0018743473,0.00009320292,0.00007899542,0.000036050853,0.00016973932,0.000014118438],"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.00002117351,0.00022177747,0.0027424444,0.000023058494,0.0005203678,1.11865305e-7,0.000027817528,0.003136485,0.00010686099,0.97856826,0.00016020749,0.014471449],"study_design_scores_gemma":[0.0009617854,0.00010606665,0.004463165,0.000094215924,0.0030222533,0.0000032580865,0.001992888,0.0099204015,0.00094475894,0.903296,0.07481539,0.00037982824],"about_ca_topic_score_codex":0.000010794372,"about_ca_topic_score_gemma":0.0000015610062,"teacher_disagreement_score":0.96719855,"about_ca_system_score_codex":0.000019999394,"about_ca_system_score_gemma":0.000041041327,"threshold_uncertainty_score":0.4972966},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013693043,0.0020403801,0.98072594,0.00026895117,0.00013696564,0.0005369951,0.000042624524,0.000059413927,0.00249566],"genre_scores_gemma":[0.93150455,0.001433274,0.04474098,0.00066578604,0.001226919,0.0007273019,0.00007379672,0.000042791013,0.019584574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790347,0.0002043569,0.00065407174,0.00055299245,0.0002949599,0.0003901644],"domain_scores_gemma":[0.99697,0.00157555,0.0003552037,0.0005788683,0.00028512045,0.00023525882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001243426,0.00024412175,0.0005128321,0.001768257,0.0006170097,0.00076954917,0.000779409,0.000118695934,0.0000029163864],"category_scores_gemma":[0.00019996322,0.000203363,0.00032198,0.0046791746,0.000048788173,0.00044622607,0.000097721786,0.00035588266,0.000018808043],"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.0000044936583,0.0004986431,0.0011715977,0.00008586474,0.0007950345,0.000010971859,0.0005405093,0.018743532,0.00025080232,0.9619828,0.0019694942,0.013946261],"study_design_scores_gemma":[0.0012140552,0.0002765767,0.0022869136,0.00008701239,0.00078825647,0.00003746421,0.0015006813,0.7343164,0.0006142805,0.03948359,0.21922879,0.00016593987],"about_ca_topic_score_codex":0.000013556679,"about_ca_topic_score_gemma":0.000008202394,"teacher_disagreement_score":0.93598497,"about_ca_system_score_codex":0.00006400248,"about_ca_system_score_gemma":0.00009350084,"threshold_uncertainty_score":0.8292903},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16036984,0.0005918673,0.8299479,0.0022077102,0.000037674734,0.0002524908,0.000079263526,0.00001651254,0.006496728],"genre_scores_gemma":[0.98919857,0.00004027196,0.004468696,0.00004129692,0.00009259764,0.000024069133,0.0000103515595,0.00000577739,0.006118369],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991109,0.000084410574,0.0003134115,0.0001790136,0.00016033459,0.00015193452],"domain_scores_gemma":[0.9992032,0.000100784455,0.00023356135,0.00030925137,0.00009477714,0.00005841239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002757374,0.00011104122,0.0002757351,0.00028973378,0.0004006409,0.00007722724,0.0002231076,0.00002715223,0.0002692039],"category_scores_gemma":[0.0000038014068,0.00007571669,0.0004040142,0.0015898359,0.000038014005,0.000035468587,0.000052651987,0.0001945136,0.000007825763],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009440789,0.0015081323,0.350954,0.000119221404,0.012852133,0.0000011007606,0.00037501022,0.064063616,0.10341228,0.18198009,0.0068728016,0.2777672],"study_design_scores_gemma":[0.0074715097,0.00054347294,0.20973286,0.0005805518,0.05006968,0.000021448857,0.00797653,0.19854727,0.117680505,0.09595065,0.30915928,0.002266236],"about_ca_topic_score_codex":0.00013803518,"about_ca_topic_score_gemma":0.0000055799583,"teacher_disagreement_score":0.82882875,"about_ca_system_score_codex":0.00001777691,"about_ca_system_score_gemma":0.000043061984,"threshold_uncertainty_score":0.3087637},"labels":[],"label_agreement":null}]}