{"meta":{"query_hash":"0c47454b68fe","filters":{"topic":"Matrix Theory and Algorithms"},"cohort_total":1077,"direct_labels_cover":1,"predictions_cover":1077,"exported":1077,"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/0c47454b68fe","api":"https://metacan.xera.ac/api/v1/cohort?topic=Matrix+Theory+and+Algorithms"},"results":[{"id":"W100304864","doi":"10.1007/978-1-4939-0832-5_9","title":"The Schneider–Lang Theorem","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematical economics; History; Mathematics","score_opus":0.010707838842369435,"score_gpt":0.21108355143702454,"score_spread":0.2003757125946551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W100304864","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004328459,0.016280046,0.06676099,0.0066646654,0.002477121,0.000019134588,0.00028832818,0.00028642343,0.9028949],"genre_scores_gemma":[0.21224128,0.028966371,0.045899376,0.0045417757,0.00513727,0.00015203188,0.00079408544,0.00087238516,0.7013956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997032,0.00007963542,0.000013446747,0.00005939754,0.00011118881,0.0000330645],"domain_scores_gemma":[0.9997749,0.000092914226,0.000014880588,0.000051736515,0.00004981287,0.000015736818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046481943,0.0007398253,0.00041374142,0.0010717512,0.000851023,0.0022434324,0.0004679657,0.00091799727,0.017441446],"category_scores_gemma":[0.0012187643,0.00033873794,0.00047283436,0.0010095749,0.002983419,0.003946359,0.0010491243,0.0025006118,0.008421203],"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.000006075779,0.000004993216,0.000027923295,0.00003300486,0.0000034313846,0.000014139831,0.000054943845,0.00016951324,0.00019325723,0.9468799,0.027965628,0.024647262],"study_design_scores_gemma":[0.0000039391484,0.0000039727893,0.00007447918,0.000031661744,0.0000031983693,0.000056990262,0.000025219699,0.00046529365,0.000268476,0.8516766,0.14738311,0.000007113576],"about_ca_topic_score_codex":0.0008469594,"about_ca_topic_score_gemma":0.0011146612,"teacher_disagreement_score":0.017441446,"about_ca_system_score_codex":0.0011124914,"about_ca_system_score_gemma":0.00076720864,"threshold_uncertainty_score":0.058347464},"labels":[],"label_agreement":null},{"id":"W105974654","doi":"","title":"Optimal Spherical Triangulation for Global Multiresolution Analysis and Synthesis","year":2007,"lang":"en","type":"article","venue":"AGU Fall Meeting Abstracts","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Physics","score_opus":0.015839724991205253,"score_gpt":0.2692871344817381,"score_spread":0.25344740949053285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W105974654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004063519,0.00012974319,0.9939678,0.00006148192,0.000025930132,0.00001357851,0.000052525975,0.0002282188,0.001457282],"genre_scores_gemma":[0.19839016,0.00045662106,0.7962593,0.00008160908,0.00005105481,0.00008400641,0.00033722116,0.00040956607,0.003930498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99952865,0.00012875267,0.00002528409,0.00008522182,0.00018823304,0.00004382971],"domain_scores_gemma":[0.999603,0.00015049122,0.000035376914,0.000115662275,0.00007543275,0.000020132951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052780256,0.0008677834,0.0010618004,0.0010099545,0.0003498017,0.0012359716,0.0006141555,0.0012415827,0.0042709894],"category_scores_gemma":[0.0020214259,0.0007191121,0.0012852632,0.0012294041,0.0006142345,0.0010465303,0.0015685585,0.0010069631,0.0013644944],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020805918,0.000048891325,0.00033314907,0.00021893992,0.00011330515,0.00013872416,0.00022413375,0.55637497,0.04391327,0.075967535,0.00406758,0.31839138],"study_design_scores_gemma":[0.00000835329,0.000016966556,0.00008472484,0.000009282031,0.000011257336,0.00004001954,0.000024680894,0.9780532,0.0049497816,0.013965703,0.0028256055,0.000010422282],"about_ca_topic_score_codex":0.0018393077,"about_ca_topic_score_gemma":0.0021271128,"teacher_disagreement_score":0.0042709894,"about_ca_system_score_codex":0.0005705772,"about_ca_system_score_gemma":0.0006876581,"threshold_uncertainty_score":0.014287949},"labels":[],"label_agreement":null},{"id":"W1121207097","doi":"","title":"Static Analysis for Efficient Affine Arithmetic on GPUs","year":2008,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","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":"Natural Sciences and Engineering Research Council of Canada; Ontario Centres of Excellence","keywords":"Affine transformation; Arithmetic; Computer science; Parallel computing; Affine arithmetic; Mathematics; Pure mathematics","score_opus":0.01008470538257326,"score_gpt":0.2087577755978822,"score_spread":0.19867307021530894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1121207097","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06430334,0.0015714186,0.88509995,0.0006792107,0.00038026576,0.0001246561,0.00039682593,0.0041341833,0.04331015],"genre_scores_gemma":[0.70445365,0.0013077754,0.26607102,0.0004756279,0.0004081285,0.00022948442,0.0010858079,0.0017925444,0.024176002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989693,0.00015288185,0.000052795465,0.000119890006,0.00054616947,0.00015906371],"domain_scores_gemma":[0.9989349,0.0003721967,0.00009310101,0.00022225642,0.00034343722,0.000034011846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005960035,0.0006868695,0.0006201214,0.0012737778,0.0008252803,0.0017701067,0.0010177584,0.00037711282,0.00923108],"category_scores_gemma":[0.003907872,0.00037802244,0.0007482351,0.0014568688,0.00088834524,0.0019728034,0.0012519332,0.0010868665,0.0017170559],"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.0004204533,0.00011289991,0.004492444,0.00042459255,0.000063999214,0.0003706993,0.000409471,0.18055074,0.028027928,0.47106442,0.027993983,0.2860684],"study_design_scores_gemma":[0.000026853348,0.00007166919,0.0008572409,0.000062983294,0.000029750352,0.000091449925,0.00007436556,0.8547826,0.010370242,0.11347847,0.020130357,0.0000240615],"about_ca_topic_score_codex":0.0043621897,"about_ca_topic_score_gemma":0.005913115,"teacher_disagreement_score":0.00923108,"about_ca_system_score_codex":0.0013008335,"about_ca_system_score_gemma":0.0014821169,"threshold_uncertainty_score":0.030881047},"labels":[],"label_agreement":null},{"id":"W115527520","doi":"10.1007/978-0-387-48807-3_3","title":"The Factorial Function n!","year":2008,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Factorial; Factorial experiment; Function (biology); Factorial analysis; Fractional factorial design; Mathematics; Statistics; Mathematical analysis; Biology; Evolutionary biology","score_opus":0.016040760881636137,"score_gpt":0.20245355432840545,"score_spread":0.1864127934467693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W115527520","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006077323,0.0045356937,0.13488147,0.0023232764,0.0032935042,0.000038789443,0.0002839866,0.0011639714,0.8474019],"genre_scores_gemma":[0.100754485,0.0049726954,0.050802458,0.0014693906,0.0019493067,0.00016823357,0.0003199829,0.0015905265,0.83797294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996276,0.000082360835,0.000011265592,0.00009888684,0.00013046952,0.00004928056],"domain_scores_gemma":[0.99961877,0.00013900292,0.0000242318,0.00009276569,0.00009661038,0.00002862388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048406635,0.00089727994,0.00056132115,0.0011394889,0.0011257918,0.0024501602,0.00065934594,0.00086696557,0.029491577],"category_scores_gemma":[0.0018144085,0.0003299482,0.0003779923,0.0009719011,0.0022960335,0.0032325506,0.001056641,0.001984298,0.020067396],"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.000018247658,0.000005706082,0.000026861922,0.00005345372,0.0000025917977,0.00003055185,0.00006234611,0.00025964662,0.00084612094,0.88189834,0.03872644,0.07806964],"study_design_scores_gemma":[0.0000057590405,0.000012460198,0.000112659,0.000042276304,0.0000059979648,0.0002522963,0.000030406602,0.001356298,0.0015495903,0.53343076,0.4631831,0.000018378978],"about_ca_topic_score_codex":0.0009404868,"about_ca_topic_score_gemma":0.0010471431,"teacher_disagreement_score":0.029491577,"about_ca_system_score_codex":0.0012293649,"about_ca_system_score_gemma":0.0006191526,"threshold_uncertainty_score":0.09865916},"labels":[],"label_agreement":null},{"id":"W116296291","doi":"10.1023/a:1022380116022","title":"A Relation Between the Weighted Logarithmic Norm of a Matrix and the Lyapunov Equation","year":2000,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":26,"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; Canada Research Chairs; Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Logarithm; Eigenvalues and eigenvectors; Norm (philosophy); Positive-definite matrix; Matrix (chemical analysis); Applied mathematics; Pure mathematics; Mathematical analysis; Physics","score_opus":0.015426329057278391,"score_gpt":0.2456220619465703,"score_spread":0.2301957328892919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116296291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03869453,0.0009812004,0.94554496,0.0009582785,0.00035684914,0.000021454616,0.000076479206,0.00012529013,0.0132409455],"genre_scores_gemma":[0.78963786,0.0020164999,0.18331334,0.0006777102,0.00060198153,0.00011311837,0.00023241347,0.00024987935,0.023157218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948573,0.00018091736,0.000029571826,0.0001098008,0.00016268663,0.000031397103],"domain_scores_gemma":[0.9963253,0.0018704976,0.00044070344,0.0002134942,0.0009182084,0.00023169407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012773004,0.0005964331,0.00040005447,0.00089969835,0.0003654886,0.00113909,0.00085108576,0.00091683114,0.0036722054],"category_scores_gemma":[0.010345577,0.0001939069,0.00030822813,0.000768843,0.0018719103,0.0035146468,0.0013274539,0.0017190138,0.0006224431],"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.000066830384,0.000032115087,0.00063301105,0.0001057198,0.00001940599,0.00009617868,0.00015315904,0.034611713,0.0073264064,0.9222938,0.00169399,0.0329676],"study_design_scores_gemma":[0.000009015271,0.00007549359,0.0004863657,0.000032491876,0.000010129232,0.00016656375,0.00004174873,0.34345865,0.0016895769,0.650293,0.0037024773,0.000034441407],"about_ca_topic_score_codex":0.0005493066,"about_ca_topic_score_gemma":0.0005791186,"teacher_disagreement_score":0.0036722054,"about_ca_system_score_codex":0.0004721536,"about_ca_system_score_gemma":0.0005007056,"threshold_uncertainty_score":0.012284756},"labels":[],"label_agreement":null},{"id":"W1170355282","doi":"10.1016/j.jcp.2015.08.016","title":"A scalable parallel black oil simulator on distributed memory parallel computers","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":60,"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; Western Canada Research Grid; CMG Reservoir Simulation Foundation; University of Calgary","keywords":"Computer science; Scalability; Multigrid method; Parallel computing; Workstation; Discretization; Preconditioner; Grid; Computational science; Simulation; Black box; Iterative method; Algorithm; Partial differential equation","score_opus":0.024217342901058373,"score_gpt":0.2633747208807521,"score_spread":0.23915737797969372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1170355282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3840276,0.00092277915,0.52410597,0.0017830307,0.0010552872,0.000660538,0.0029169887,0.02486563,0.059662204],"genre_scores_gemma":[0.7257326,0.00035077683,0.2561899,0.00033861032,0.000083366875,0.00047474727,0.002245823,0.0021266127,0.012457515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996213,0.0001052579,0.000016331676,0.000047327765,0.00013817508,0.00007159916],"domain_scores_gemma":[0.99896646,0.0003744952,0.000042890984,0.00019037961,0.00026398766,0.00016182027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068973936,0.0008850038,0.0011760079,0.0005196257,0.0010773091,0.00089164654,0.0030987374,0.0012155807,0.008922079],"category_scores_gemma":[0.0029213086,0.0006250068,0.00072595634,0.000766962,0.00085396465,0.0017612752,0.001820826,0.001465288,0.0013938899],"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.0007618181,0.0002669425,0.0015885559,0.00017688434,0.000116687734,0.0001897938,0.00012569106,0.93610966,0.00711642,0.017143123,0.010430958,0.025973389],"study_design_scores_gemma":[0.00012461789,0.000038578208,0.00006515685,0.000004256429,0.000009312691,0.000008176478,0.000014913747,0.992834,0.0014512865,0.0037904289,0.0016511999,0.0000080225],"about_ca_topic_score_codex":0.013029588,"about_ca_topic_score_gemma":0.010343112,"teacher_disagreement_score":0.013029588,"about_ca_system_score_codex":0.0008482686,"about_ca_system_score_gemma":0.002621462,"threshold_uncertainty_score":0.029847324},"labels":[],"label_agreement":null},{"id":"W1258012211","doi":"10.1016/j.laa.2015.08.014","title":"The enhanced principal rank characteristic sequence for skew-symmetric matrices","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria","keywords":"Mathematics; Hermitian matrix; Skew-symmetric matrix; Combinatorics; Sequence (biology); Rank (graph theory); Symmetric matrix; Matrix (chemical analysis); Skew; Pure mathematics; Square matrix; Physics; Eigenvalues and eigenvectors","score_opus":0.030813143287631822,"score_gpt":0.28938391372332367,"score_spread":0.2585707704356919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1258012211","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25898,0.0011945385,0.7044476,0.0011918116,0.0004120352,0.00006438667,0.00037714507,0.00041357963,0.032918956],"genre_scores_gemma":[0.9093409,0.0011862087,0.06840779,0.0003497771,0.00055391644,0.00007609029,0.0003844009,0.0001436508,0.01955735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935704,0.00017175692,0.0000279848,0.00011152481,0.0002372152,0.00009451079],"domain_scores_gemma":[0.9965759,0.0012633812,0.0006118813,0.00033834315,0.0007711968,0.000439439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010713475,0.0005312296,0.0004889234,0.0017208682,0.00047942039,0.0017752589,0.0007778095,0.0006585989,0.0052143154],"category_scores_gemma":[0.007149363,0.0002554951,0.00030083596,0.0012064581,0.0015025502,0.0036997332,0.0011977662,0.0016192842,0.0012454344],"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.00021003277,0.000053185035,0.0010504342,0.0000935958,0.000011600764,0.0001742969,0.0001982542,0.01544926,0.0066330386,0.9268395,0.003472775,0.04581406],"study_design_scores_gemma":[0.000020659785,0.00009189481,0.0005554072,0.000022809947,0.0000075219004,0.0003252636,0.00006929106,0.095730774,0.003300159,0.89544296,0.0043986137,0.000034647266],"about_ca_topic_score_codex":0.00046111245,"about_ca_topic_score_gemma":0.0004353522,"teacher_disagreement_score":0.0052143154,"about_ca_system_score_codex":0.0006840432,"about_ca_system_score_gemma":0.0010324734,"threshold_uncertainty_score":0.017443597},"labels":[],"label_agreement":null},{"id":"W134793575","doi":"10.1007/3-540-28438-9_7","title":"Computing Sparse Jacobian Matrices Optimally","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Jacobian matrix and determinant; Row; Matrix (chemical analysis); Sparse matrix; Computation; A priori and a posteriori; Row and column spaces; Algorithm; Mathematics; Computer science; Mathematical optimization; Applied mathematics","score_opus":0.008076137272474655,"score_gpt":0.2140298548552145,"score_spread":0.20595371758273984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W134793575","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020109955,0.00026189836,0.9619767,0.00032360153,0.00018903145,0.00008528558,0.00033068119,0.0041979337,0.012524866],"genre_scores_gemma":[0.18149525,0.0004378853,0.7967408,0.00022567587,0.00027533344,0.00014390859,0.001818333,0.0013035977,0.017559169],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994318,0.000083964005,0.000031909043,0.00013704624,0.00023065398,0.00008462416],"domain_scores_gemma":[0.9989114,0.00049753266,0.000057016365,0.00026240112,0.00021050508,0.00006108155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044166873,0.001475152,0.0015010529,0.0010380533,0.0007103511,0.0017005841,0.001244432,0.0011254315,0.021921907],"category_scores_gemma":[0.004533114,0.0007945843,0.0007329275,0.0018209802,0.0006596209,0.002549308,0.001673142,0.0015090477,0.0069222786],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038056888,0.00021805622,0.00083096145,0.00039315096,0.00009099884,0.00031220756,0.00019168005,0.17851925,0.025583524,0.04800237,0.04313764,0.70233953],"study_design_scores_gemma":[0.00012257774,0.00013382628,0.00039550013,0.00002872347,0.000040924115,0.00022395511,0.00013447182,0.8878559,0.01554853,0.08242023,0.013069835,0.000025559175],"about_ca_topic_score_codex":0.003530001,"about_ca_topic_score_gemma":0.010020352,"teacher_disagreement_score":0.021921907,"about_ca_system_score_codex":0.0005265649,"about_ca_system_score_gemma":0.0012030074,"threshold_uncertainty_score":0.073336065},"labels":[],"label_agreement":null},{"id":"W140815609","doi":"10.1007/978-0-387-68276-1_5","title":"Preservation and Generation of Majorization","year":2010,"lang":"en","type":"book-chapter","venue":"Springer series in statistics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Majorization; Section (typography); Integer (computer science); Mathematics; Combinatorics; Computer science","score_opus":0.024376266291228788,"score_gpt":0.241767385077321,"score_spread":0.2173911187860922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W140815609","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056939695,0.0023985736,0.8392814,0.0012170122,0.0005555877,0.00008195297,0.00035347816,0.0015982471,0.097574115],"genre_scores_gemma":[0.7716083,0.0021665,0.14080827,0.00071306643,0.0013933989,0.00020824422,0.0007374497,0.0026011134,0.07976372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991596,0.00023689796,0.00004592503,0.00024084965,0.00019952499,0.000117187585],"domain_scores_gemma":[0.9972886,0.0010015283,0.00023893219,0.00086346647,0.00040566677,0.00020180026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013616425,0.0007606524,0.00077307766,0.0017797871,0.0010017772,0.0029282991,0.001279174,0.00073932775,0.010756107],"category_scores_gemma":[0.006180635,0.00072586123,0.0012673868,0.0010504413,0.002821934,0.0034684008,0.002460802,0.0024711676,0.0031190596],"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.000048026952,0.000014509835,0.00017326965,0.000059462523,0.0000138073265,0.00006353442,0.000198566,0.0018519456,0.002816876,0.9550008,0.0066158534,0.033143446],"study_design_scores_gemma":[0.000010517375,0.000027829348,0.00020999995,0.000011326255,0.000008756058,0.00023274645,0.00003306645,0.010269496,0.0027676225,0.9766475,0.009765845,0.000015301786],"about_ca_topic_score_codex":0.00022477099,"about_ca_topic_score_gemma":0.00021748905,"teacher_disagreement_score":0.010756107,"about_ca_system_score_codex":0.0007315814,"about_ca_system_score_gemma":0.0005348761,"threshold_uncertainty_score":0.035982728},"labels":[],"label_agreement":null},{"id":"W1414602992","doi":"10.1016/j.jmaa.2015.08.029","title":"Derivatives of compound matrix valued functions","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Office of Naval Research; California Institute of Technology; National Science Foundation","keywords":"Mathematics; Differentiable function; Multiplicative function; Matrix function; Generalization; Invariant (physics); Matrix (chemical analysis); Pure mathematics; Algebra over a field; Symmetric matrix; Mathematical analysis; Eigenvalues and eigenvectors","score_opus":0.025314765468374006,"score_gpt":0.2939239115119389,"score_spread":0.2686091460435649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1414602992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12987472,0.0034019158,0.82858676,0.0015429445,0.00090968463,0.000036031328,0.00026460964,0.00030747935,0.03507595],"genre_scores_gemma":[0.8424404,0.0034966017,0.1027984,0.00049785146,0.00073431485,0.000057246634,0.00022472745,0.00036970284,0.04938074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961877,0.0001287471,0.000024587705,0.000067666995,0.0001181114,0.000042138505],"domain_scores_gemma":[0.99676573,0.0016113406,0.0003988747,0.00024094702,0.0006739486,0.00030910544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001333965,0.0007777446,0.0007083674,0.0019392273,0.0006094484,0.002718511,0.0007902706,0.001294683,0.005636427],"category_scores_gemma":[0.0064198393,0.00042198217,0.00044058464,0.0013315476,0.0021395262,0.0045409743,0.0010290296,0.001752396,0.0007895119],"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.000046054243,0.000021488204,0.0002520535,0.00005981641,0.000013282228,0.00012702167,0.0001273477,0.00955594,0.0025133134,0.9753219,0.0016315365,0.010330315],"study_design_scores_gemma":[0.000009639246,0.000029401728,0.00040159622,0.00002534377,0.0000126375435,0.00023218931,0.00006221491,0.14343348,0.0012898374,0.84946775,0.005003048,0.000032904045],"about_ca_topic_score_codex":0.0009879491,"about_ca_topic_score_gemma":0.0011336667,"teacher_disagreement_score":0.005636427,"about_ca_system_score_codex":0.0011760627,"about_ca_system_score_gemma":0.0008341435,"threshold_uncertainty_score":0.018855691},"labels":[],"label_agreement":null},{"id":"W142439544","doi":"10.1007/978-1-4614-0776-8_2","title":"Review of Linear Algebra","year":2011,"lang":"en","type":"book-chapter","venue":"Universitext","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Linear algebra; Algebra over a field; Mathematical proof; Vector space; Field (mathematics); Mathematics; Pure mathematics; Geometry","score_opus":0.01856658097800414,"score_gpt":0.20597634508108184,"score_spread":0.1874097641030777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W142439544","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026013394,0.8982157,0.0043756454,0.00933508,0.008479544,0.000016964723,0.00022663789,0.00018032857,0.07891002],"genre_scores_gemma":[0.0058763823,0.8172984,0.0040553105,0.007573984,0.021344094,0.00006052973,0.00055832387,0.0001493922,0.14308366],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99931324,0.000150434,0.000035169494,0.00010869,0.00033412944,0.000058301528],"domain_scores_gemma":[0.9990538,0.00040746146,0.000055949335,0.000089406785,0.00029947565,0.00009385132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000776138,0.0011365148,0.0011442809,0.0040494194,0.0011065629,0.0032395443,0.0011599703,0.0012762205,0.041091144],"category_scores_gemma":[0.0023366984,0.00057028636,0.0004943169,0.008153861,0.002097593,0.004265139,0.0014972757,0.0030310997,0.028270459],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021322485,0.000034765155,0.000098382836,0.0013180247,0.00002219286,0.000022271988,0.000103763254,0.00025618955,0.00022798424,0.05002689,0.7045497,0.24331857],"study_design_scores_gemma":[0.0000035808712,0.000007865099,0.00016420885,0.0003745972,0.00000612867,0.000055535904,0.000027527789,0.000070955335,0.000034869245,0.020492392,0.9787553,0.0000071153713],"about_ca_topic_score_codex":0.0021078174,"about_ca_topic_score_gemma":0.004357505,"teacher_disagreement_score":0.041091144,"about_ca_system_score_codex":0.0016505553,"about_ca_system_score_gemma":0.0032262849,"threshold_uncertainty_score":0.13746357},"labels":[],"label_agreement":null},{"id":"W1469905851","doi":"10.1016/j.laa.2015.07.031","title":"Characterization of a family of generalized companion matrices","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monomial; Matrix (chemical analysis); Field (mathematics); Combinatorics; Order (exchange); Characterization (materials science); Algebraically closed field; Pure mathematics; Algebra over a field; Discrete mathematics","score_opus":0.02606064043126053,"score_gpt":0.263592704994818,"score_spread":0.2375320645635575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1469905851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45325565,0.0005542099,0.5167549,0.0008590863,0.00016480515,0.00009765881,0.0004623294,0.00054465875,0.027306711],"genre_scores_gemma":[0.9512277,0.00033575908,0.038069755,0.0002969165,0.00026064715,0.000096676944,0.0006021092,0.000115944196,0.00899454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993729,0.00014704208,0.000025846799,0.00016739185,0.0002021046,0.00008479722],"domain_scores_gemma":[0.9962035,0.0014106858,0.00065301056,0.0004232701,0.0007816296,0.0005278259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006157356,0.000766077,0.0005961324,0.0017953125,0.00091390626,0.0015947782,0.00078540953,0.0009596152,0.005042937],"category_scores_gemma":[0.006075607,0.00032908178,0.0006479112,0.0011141967,0.0015139544,0.0017058493,0.0013364549,0.0015219244,0.0006288005],"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.00014124883,0.00006931468,0.0018942849,0.000070972914,0.00003826037,0.0006712116,0.00047879157,0.0062551005,0.009492622,0.9551435,0.0038806128,0.021864017],"study_design_scores_gemma":[0.00004078765,0.00017188051,0.001712528,0.000029792427,0.000024730278,0.001659407,0.00021231436,0.10604361,0.0031950222,0.87815046,0.008703013,0.000056412864],"about_ca_topic_score_codex":0.000438254,"about_ca_topic_score_gemma":0.00034684714,"teacher_disagreement_score":0.005042937,"about_ca_system_score_codex":0.0005077784,"about_ca_system_score_gemma":0.0005912227,"threshold_uncertainty_score":0.01687032},"labels":[],"label_agreement":null},{"id":"W1482736558","doi":"10.1090/s0002-9939-05-07752-x","title":"The Lax conjecture is true","year":2005,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":105,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Minnesota","keywords":"Conjecture; Lax pair; Counterexample; Class (philosophy); Generalization","score_opus":0.006701122251497698,"score_gpt":0.23469750510722423,"score_spread":0.22799638285572654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482736558","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3148532,0.013777616,0.084474176,0.12136202,0.008608962,0.00005563643,0.0011039535,0.00097223616,0.45479217],"genre_scores_gemma":[0.9603646,0.0023274934,0.0047674333,0.0059322785,0.0025265594,0.00004247285,0.00064700487,0.00009969015,0.023292482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881494,0.00021416327,0.00006325754,0.00032926467,0.00029771306,0.00028075196],"domain_scores_gemma":[0.9958269,0.0018522552,0.0004428943,0.0006191484,0.00079665147,0.000462123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016676767,0.00055147486,0.0011349602,0.0009833726,0.004722007,0.0065183695,0.00078035303,0.0028889272,0.01342677],"category_scores_gemma":[0.008230374,0.00054888293,0.0005988717,0.0012859667,0.00884414,0.011900748,0.0036386305,0.004582822,0.004978118],"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.00010583303,0.000019202733,0.0007787989,0.00007058059,0.000012508858,0.00016031737,0.00055288605,0.00032393553,0.00049243105,0.97911876,0.009378407,0.008986212],"study_design_scores_gemma":[0.000024730236,0.000021186932,0.00022871698,0.000053683845,0.0000073571737,0.000114787734,0.00030508847,0.0008169642,0.0005449932,0.97807765,0.019782582,0.000022246144],"about_ca_topic_score_codex":0.000798671,"about_ca_topic_score_gemma":0.0007017576,"teacher_disagreement_score":0.01342677,"about_ca_system_score_codex":0.001311689,"about_ca_system_score_gemma":0.00091075787,"threshold_uncertainty_score":0.044917047},"labels":[],"label_agreement":null},{"id":"W148427603","doi":"10.1007/978-0-387-68276-1_2","title":"Doubly Stochastic Matrices","year":2010,"lang":"en","type":"book-chapter","venue":"Springer series in statistics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematical economics; Computer science; Applied mathematics; Mathematics","score_opus":0.01338111550333466,"score_gpt":0.2432656931751293,"score_spread":0.22988457767179465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W148427603","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010847152,0.012551729,0.5499044,0.0027001018,0.003571644,0.00007022264,0.0014305043,0.0011077165,0.4178165],"genre_scores_gemma":[0.2073224,0.014073479,0.09640426,0.0014185791,0.00411878,0.00025684992,0.0027255064,0.0008698755,0.67281026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997118,0.00006367304,0.000011592739,0.00006130926,0.00013141989,0.000020178335],"domain_scores_gemma":[0.9995851,0.00014326329,0.000032432188,0.00009801259,0.00010769403,0.000033538847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000279778,0.0007031192,0.0005327988,0.00087594544,0.00041155823,0.0012321672,0.00042114107,0.00070815545,0.028096188],"category_scores_gemma":[0.0017565441,0.00029901936,0.0002947969,0.0011604555,0.0006426264,0.0011009092,0.0007813251,0.0013114479,0.012095455],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014921953,0.000025886471,0.00012266944,0.0000790686,0.000012171244,0.000063398074,0.000065672,0.006252772,0.0017149554,0.79330254,0.07595257,0.12239333],"study_design_scores_gemma":[0.000006663461,0.000024091527,0.00040997393,0.000052493022,0.000009640384,0.0003372572,0.000026955202,0.029951863,0.00115055,0.7573009,0.2107077,0.000021845482],"about_ca_topic_score_codex":0.00043840753,"about_ca_topic_score_gemma":0.000762141,"teacher_disagreement_score":0.028096188,"about_ca_system_score_codex":0.0004164492,"about_ca_system_score_gemma":0.0004137304,"threshold_uncertainty_score":0.09399116},"labels":[],"label_agreement":null},{"id":"W1488440181","doi":"10.13001/1081-3810.1352","title":"Sign patterns that require or allow power-positivity","year":2009,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; American Institute of Mathematics; National Science Foundation","keywords":"Digraph; Sign (mathematics); Mathematics; Power (physics); Integer (computer science); Combinatorics; Matrix (chemical analysis); Nonnegative matrix; Pure mathematics; Discrete mathematics; Mathematical analysis; Computer science; Symmetric matrix; Chemistry; Physics; Eigenvalues and eigenvectors","score_opus":0.011711444163003456,"score_gpt":0.25350927364926945,"score_spread":0.241797829486266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488440181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26784527,0.00059484015,0.5010159,0.0019325186,0.0013593336,0.0006117591,0.0013485532,0.0022257857,0.22306615],"genre_scores_gemma":[0.89712906,0.0005583015,0.07507687,0.0010111881,0.00030105686,0.00040201694,0.00076564046,0.00041183672,0.024344027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845755,0.00024745497,0.00018925755,0.00029285342,0.00039306923,0.00041990008],"domain_scores_gemma":[0.9950504,0.0015292448,0.00064141594,0.001221496,0.0010641675,0.0004933728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011293709,0.0008553516,0.00061467197,0.00054805516,0.0010657645,0.0030157405,0.0008250594,0.0010776089,0.017118646],"category_scores_gemma":[0.009570607,0.00041446168,0.0007104909,0.00085121026,0.0023432071,0.0049301917,0.002137718,0.0016501334,0.0039013843],"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.0007010246,0.00012298994,0.0024656507,0.00027327763,0.000032899145,0.0022222684,0.00038547604,0.0037725947,0.02535605,0.8822946,0.010706514,0.0716667],"study_design_scores_gemma":[0.0001130481,0.00019655375,0.0007758284,0.000078459074,0.000040914078,0.0015569478,0.00031447402,0.015305515,0.018292839,0.92798525,0.03527738,0.00006275038],"about_ca_topic_score_codex":0.00042414665,"about_ca_topic_score_gemma":0.0006981887,"teacher_disagreement_score":0.017118646,"about_ca_system_score_codex":0.00041072324,"about_ca_system_score_gemma":0.00078947545,"threshold_uncertainty_score":0.057267547},"labels":[],"label_agreement":null},{"id":"W148978679","doi":"10.1007/978-3-642-10473-2_6","title":"Rank of the Partitioned Matrix and the Matrix Product","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Rank (graph theory); Matrix (chemical analysis); Mathematics; Product (mathematics); Combinatorics; Algebra over a field; Pure mathematics; Chemistry; Geometry","score_opus":0.0143559567890163,"score_gpt":0.22206623422046906,"score_spread":0.20771027743145276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W148978679","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062232995,0.03739742,0.6094288,0.0032001396,0.004199097,0.000077377714,0.0011291482,0.0013305276,0.33701417],"genre_scores_gemma":[0.15321904,0.0494387,0.38899627,0.0022738976,0.007764944,0.0002632893,0.0023272731,0.0019606056,0.39375594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940217,0.00012254555,0.000031118423,0.00014378862,0.00026279083,0.000037616293],"domain_scores_gemma":[0.99921775,0.00033428654,0.000051201863,0.0001697274,0.00019213164,0.000034848374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064965646,0.001250447,0.00089690124,0.0012415444,0.00054159074,0.0031395152,0.00078675564,0.0006928959,0.022567697],"category_scores_gemma":[0.0030059402,0.00055826444,0.0005071157,0.0022268149,0.0019860107,0.0033336498,0.0009127563,0.0023581223,0.011469467],"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.00004215729,0.000023843713,0.00009438954,0.000326865,0.00001981237,0.00009518022,0.0001738621,0.0036986154,0.002190161,0.7569024,0.078024745,0.1584079],"study_design_scores_gemma":[0.000010513969,0.000041235402,0.00020809611,0.00008643876,0.000015536134,0.0004124416,0.00007646009,0.0077796336,0.0016533181,0.78583103,0.2038509,0.000034382112],"about_ca_topic_score_codex":0.0007325833,"about_ca_topic_score_gemma":0.0009570194,"teacher_disagreement_score":0.022567697,"about_ca_system_score_codex":0.0005856273,"about_ca_system_score_gemma":0.00077780837,"threshold_uncertainty_score":0.075496435},"labels":[],"label_agreement":null},{"id":"W1496490193","doi":"10.1090/conm/323/05702","title":"A fast singular value algorithm for Hankel matrices","year":2003,"lang":"en","type":"other","venue":"Contemporary mathematics - American Mathematical Society","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Singular value; Hankel matrix; Value (mathematics); Algorithm; Singular value decomposition; Algebra over a field; Pure mathematics; Mathematical analysis; Statistics; Eigenvalues and eigenvectors","score_opus":0.019519224768066654,"score_gpt":0.2678077523105488,"score_spread":0.24828852754248215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496490193","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015730368,0.00013582906,0.9952245,0.000053199237,0.000060511473,0.000043475557,0.00006296694,0.001633387,0.001213075],"genre_scores_gemma":[0.018386023,0.00015706696,0.9766966,0.000054349937,0.00007134224,0.00011851661,0.00029848085,0.00029175822,0.003925746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991345,0.00011689733,0.000054348522,0.00014974442,0.0004601368,0.000084511084],"domain_scores_gemma":[0.99872977,0.00039188564,0.00007368034,0.00026757587,0.00046506425,0.00007206419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072339486,0.0015235976,0.0010024933,0.0017686347,0.000961451,0.0015984046,0.0013786146,0.0010222279,0.012116824],"category_scores_gemma":[0.0039883535,0.000632509,0.00069673185,0.0019465421,0.0006292219,0.0021089893,0.0018228333,0.0015308041,0.010317274],"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.0002541921,0.000112976726,0.00034898854,0.00015767934,0.000057568806,0.00015605502,0.00014438758,0.024608888,0.028601343,0.02696029,0.014853443,0.9037442],"study_design_scores_gemma":[0.00020341373,0.0002105835,0.0005154086,0.00006325536,0.000042418822,0.0007159712,0.000119977136,0.8028718,0.04131736,0.11751674,0.036325727,0.0000972347],"about_ca_topic_score_codex":0.0015103804,"about_ca_topic_score_gemma":0.002762644,"teacher_disagreement_score":0.012116824,"about_ca_system_score_codex":0.0004218531,"about_ca_system_score_gemma":0.0011837927,"threshold_uncertainty_score":0.040534794},"labels":[],"label_agreement":null},{"id":"W1496747661","doi":"10.1109/acc.1994.735062","title":"Consistency of experimental frequency-response data with coprime factor plant models","year":2005,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Coprime integers; Consistency (knowledge bases); Interpolation (computer graphics); Boundary (topology); Mathematics; Function (biology); Unit circle; Applied mathematics; Data point; Factor (programming language); Mathematical analysis; Computer science; Algorithm; Discrete mathematics; Artificial intelligence","score_opus":0.04251069804726561,"score_gpt":0.26896811874717025,"score_spread":0.22645742069990465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496747661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098573565,0.00014386389,0.8985096,0.00016553611,0.000030417828,0.00005163161,0.00020396952,0.0007593949,0.0015620472],"genre_scores_gemma":[0.7845172,0.000119398894,0.21347953,0.00013837022,0.000015510619,0.000110174,0.0007063071,0.00027162483,0.0006418464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920814,0.0028512995,0.0005534825,0.0018890456,0.0023364504,0.0002883347],"domain_scores_gemma":[0.9789202,0.011038623,0.001765224,0.00644648,0.0016719501,0.00015752277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073660943,0.00070786494,0.0009525742,0.0007585573,0.00036583966,0.0016470859,0.0019567236,0.0015430613,0.0023747527],"category_scores_gemma":[0.046181146,0.0006602653,0.000760117,0.0009498834,0.0019331228,0.0027810559,0.0013691462,0.0018008976,0.0006348548],"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.003967201,0.0005450627,0.019154113,0.001085468,0.0003790551,0.0007328929,0.0010407979,0.3991012,0.30034894,0.09062388,0.0018869058,0.1811345],"study_design_scores_gemma":[0.00009175469,0.00042858045,0.004517662,0.00007076371,0.00004078663,0.0005529807,0.00017481663,0.71825534,0.20439517,0.06819908,0.00317576,0.0000972745],"about_ca_topic_score_codex":0.0007771882,"about_ca_topic_score_gemma":0.00036977077,"teacher_disagreement_score":0.0073660943,"about_ca_system_score_codex":0.00076237053,"about_ca_system_score_gemma":0.0005870151,"threshold_uncertainty_score":0.038956106},"labels":[],"label_agreement":null},{"id":"W1497193031","doi":"10.1007/11538363_34","title":"Feasible Proofs of Matrix Properties with Csanky’s Algorithm","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Mathematical proof; Algorithm; Matrix (chemical analysis); Mathematics","score_opus":0.014853706494562842,"score_gpt":0.23270092467214054,"score_spread":0.2178472181775777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497193031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023027804,0.00074093894,0.91068643,0.002102754,0.00028322605,0.0001816977,0.00043829987,0.0011352805,0.061403565],"genre_scores_gemma":[0.5049774,0.0014487338,0.46554714,0.0008596317,0.00062552,0.0008868677,0.001044855,0.0011683222,0.023441521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99495345,0.0017203182,0.00027107244,0.0006542338,0.0019427235,0.00045831574],"domain_scores_gemma":[0.98371625,0.011774989,0.0005865184,0.0021331888,0.0013759143,0.00041305114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032460745,0.0018388202,0.0013673316,0.0018212821,0.0026582617,0.005491105,0.0035238941,0.0019386858,0.0148902815],"category_scores_gemma":[0.015301324,0.0018061376,0.0024461162,0.003524336,0.004160436,0.011506908,0.0051112385,0.0069913142,0.0035837914],"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.0002716305,0.000082134306,0.00012451447,0.00025424728,0.000047052592,0.00008065314,0.0002408754,0.0066434103,0.0024718104,0.9555794,0.007189699,0.02701458],"study_design_scores_gemma":[0.00012002004,0.00003071738,0.00006307559,0.00004211497,0.000028205572,0.000052758205,0.000030690437,0.019263485,0.003004888,0.96959966,0.007736926,0.000027390703],"about_ca_topic_score_codex":0.0011766539,"about_ca_topic_score_gemma":0.0013838889,"teacher_disagreement_score":0.0148902815,"about_ca_system_score_codex":0.0023424793,"about_ca_system_score_gemma":0.002579714,"threshold_uncertainty_score":0.049812973},"labels":[],"label_agreement":null},{"id":"W1504728223","doi":"","title":"An analysis of low-rank modifications of preconditioners for saddle point systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Saddle point; Eigenvalues and eigenvectors; Preconditioner; Schur complement; Rank (graph theory); Interlacing; Applied mathematics; Positive-definite matrix; Matrix (chemical analysis); Block matrix; Interior point method; Diagonal; Linear system; Mathematical analysis; Mathematical optimization; Combinatorics; Geometry; Computer science","score_opus":0.01227790520710513,"score_gpt":0.2643106023718689,"score_spread":0.25203269716476373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504728223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18261713,0.0003531637,0.80286616,0.00083902094,0.00006552558,0.00014398129,0.0000614765,0.00046108212,0.012592513],"genre_scores_gemma":[0.9385184,0.00026242292,0.055225126,0.00014170972,0.000066081004,0.00016514919,0.000083655075,0.00022579549,0.0053115184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991967,0.00041774975,0.000028110968,0.00007020826,0.0002133069,0.0000738844],"domain_scores_gemma":[0.99561334,0.002420712,0.0007284447,0.00042031042,0.00059401896,0.00022315983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020649906,0.0009456114,0.00065122166,0.00057239353,0.0005235693,0.0009500979,0.0007854552,0.0011531146,0.0034774179],"category_scores_gemma":[0.011468716,0.0004679793,0.00043687713,0.0002845806,0.0019222221,0.0014282472,0.0009521269,0.0010410561,0.00042194902],"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.00031944003,0.00012238703,0.0010917177,0.00019592265,0.00005830738,0.00035708727,0.0003215502,0.751316,0.03225146,0.19190492,0.0020817765,0.019979414],"study_design_scores_gemma":[0.000008108175,0.00005730209,0.00011513817,0.0000065860427,0.000003958307,0.000021149714,0.000014894964,0.98887897,0.001646982,0.008940688,0.00030008232,0.0000061882065],"about_ca_topic_score_codex":0.0010633123,"about_ca_topic_score_gemma":0.00092914636,"teacher_disagreement_score":0.0034774179,"about_ca_system_score_codex":0.0006473107,"about_ca_system_score_gemma":0.00073327654,"threshold_uncertainty_score":0.011633158},"labels":[],"label_agreement":null},{"id":"W1508580143","doi":"10.1002/9781118884003.ch18","title":"Tuning and terminating methods","year":2014,"lang":"en","type":"other","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Ottawa","funders":"","keywords":"Compiler; Byte; Computer science; Profiling (computer programming); Parallel computing; Normalization property; Algorithm; Set (abstract data type); Minification; Eigenvalues and eigenvectors; Quotient; Theoretical computer science; Programming language; Mathematics; Combinatorics","score_opus":0.013117788099570928,"score_gpt":0.3103442851770554,"score_spread":0.2972264970774845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508580143","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032403134,0.0006433939,0.9736181,0.0005493214,0.00045985956,0.00025136038,0.00015821564,0.0028118026,0.018267615],"genre_scores_gemma":[0.08766468,0.00095369195,0.8817653,0.0013772463,0.00051473145,0.0012448182,0.0008863909,0.007273328,0.018319767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9773047,0.00890025,0.0016625199,0.0033170443,0.007085241,0.0017302391],"domain_scores_gemma":[0.95688957,0.024070162,0.001191373,0.011884028,0.0051449845,0.00081986026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018950287,0.002084706,0.0023110195,0.0018807864,0.0029550495,0.0064588767,0.005959885,0.003064231,0.028216463],"category_scores_gemma":[0.089309566,0.0016468068,0.0030184228,0.0014295528,0.005812088,0.0076729483,0.009590026,0.007351565,0.013207065],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029703556,0.00015650524,0.002188209,0.000898989,0.00014555847,0.00021383306,0.0009657087,0.03781719,0.0052240184,0.75891834,0.017945478,0.17522906],"study_design_scores_gemma":[0.00010013349,0.00007333032,0.00027577803,0.0004616453,0.00007941528,0.0001837309,0.00019552383,0.19979292,0.006728533,0.71864074,0.07340021,0.00006795717],"about_ca_topic_score_codex":0.0015152509,"about_ca_topic_score_gemma":0.0017455335,"teacher_disagreement_score":0.028216463,"about_ca_system_score_codex":0.002621572,"about_ca_system_score_gemma":0.0043762806,"threshold_uncertainty_score":0.100219905},"labels":[],"label_agreement":null},{"id":"W1517511137","doi":"10.37236/1590","title":"A Note on the Ranks of Set-Inclusion Matrices","year":2001,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Rank (graph theory); Combinatorics; Set (abstract data type); Inclusion (mineral); Relation (database); Finite set; Mathematical analysis; Computer science; Data mining","score_opus":0.008505119402307144,"score_gpt":0.24364521393337032,"score_spread":0.2351400945310632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517511137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15755557,0.014360938,0.62367666,0.010373619,0.003901547,0.00016291179,0.0017147155,0.0014233744,0.18683067],"genre_scores_gemma":[0.84457636,0.008605287,0.10546378,0.0016637276,0.006017539,0.00020455779,0.0008691422,0.00071372424,0.031885855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843794,0.00031921046,0.00013873493,0.0003378243,0.000515754,0.00025053511],"domain_scores_gemma":[0.9901579,0.00614695,0.001116099,0.0009347276,0.0009956602,0.0006486251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018557963,0.001261103,0.0010865575,0.0034808728,0.0021347732,0.0047512115,0.0016258268,0.0011167864,0.01060963],"category_scores_gemma":[0.013112543,0.00059919484,0.0009325542,0.0038459639,0.003718584,0.01022517,0.0037116478,0.005596338,0.002908535],"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.000058835012,0.000035957095,0.0006872061,0.0001591035,0.000011399902,0.00024353502,0.00063684466,0.0018658594,0.0023510428,0.9656413,0.00650375,0.0218051],"study_design_scores_gemma":[0.000008691885,0.00006291111,0.00047180994,0.000041675517,0.000018296256,0.00039716912,0.00014438243,0.0040682238,0.0018249989,0.98000324,0.012910935,0.000047545574],"about_ca_topic_score_codex":0.00093375717,"about_ca_topic_score_gemma":0.0014535472,"teacher_disagreement_score":0.01060963,"about_ca_system_score_codex":0.0009603351,"about_ca_system_score_gemma":0.0006867658,"threshold_uncertainty_score":0.03549272},"labels":[],"label_agreement":null},{"id":"W1525217187","doi":"10.1090/s0002-9947-01-02785-4","title":"Induced operators on symmetry classes of tensors","year":2001,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":22,"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 Toronto","funders":"University of Toronto; National Science Foundation","keywords":"Mathematics; Hilbert space; Combinatorics; Space (punctuation); Degree (music); Sigma; Mathematical physics; Symmetry (geometry); Operator (biology); Pure mathematics; Physics; Quantum mechanics; Geometry","score_opus":0.0172274744594629,"score_gpt":0.266949358480824,"score_spread":0.2497218840213611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525217187","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27598044,0.00065197237,0.28032103,0.0036057392,0.001718214,0.0002336761,0.0018052422,0.0013692945,0.43431434],"genre_scores_gemma":[0.82086015,0.0006578868,0.05205419,0.0012269313,0.0010498734,0.00029533237,0.0017448007,0.0012769887,0.12083382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977519,0.0004660365,0.0001250367,0.00039437087,0.0007988467,0.0004638554],"domain_scores_gemma":[0.9984281,0.00026346295,0.00021151036,0.00029201125,0.00045327502,0.00035173428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013731564,0.0009095637,0.0006098883,0.0022082985,0.0016480342,0.0032057865,0.0010589119,0.0010743053,0.02327296],"category_scores_gemma":[0.0027850962,0.0004467821,0.0015705873,0.00095326744,0.0022964398,0.005340758,0.002762782,0.002592737,0.004094967],"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.000013818957,0.000015423837,0.000067612884,0.000013671307,0.0000028806385,0.00003908039,0.000112103466,0.00017634149,0.0005914383,0.9937836,0.002254671,0.002929329],"study_design_scores_gemma":[0.000020092508,0.00002675456,0.00026262476,0.000012669141,0.000004518989,0.00011233538,0.00011876505,0.004039647,0.0011865593,0.9853786,0.0088213,0.00001616333],"about_ca_topic_score_codex":0.0015339521,"about_ca_topic_score_gemma":0.0013082854,"teacher_disagreement_score":0.02327296,"about_ca_system_score_codex":0.0025265648,"about_ca_system_score_gemma":0.0011843944,"threshold_uncertainty_score":0.077855825},"labels":[],"label_agreement":null},{"id":"W1530437546","doi":"10.1090/fic/037/07","title":"Positive eigenvalues of generalized words in two Hermitian positive definite matrices","year":2003,"lang":"en","type":"preprint","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Positive-definite matrix; Hermitian matrix; Eigenvalues and eigenvectors; Mathematics; Pure mathematics; Combinatorics; Algebra over a field; Physics; Quantum mechanics","score_opus":0.01577065712183683,"score_gpt":0.28467111912185195,"score_spread":0.2689004620000151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530437546","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8383725,0.0006869259,0.14028549,0.0006439986,0.00029052162,0.00007935832,0.0001462171,0.00020736839,0.019287612],"genre_scores_gemma":[0.96784157,0.00013608095,0.02511714,0.00019453141,0.000095373274,0.00009422682,0.00009177383,0.00006841856,0.0063608633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879056,0.0003510971,0.00012001818,0.00026239944,0.00030031955,0.00017569416],"domain_scores_gemma":[0.9968213,0.0012981629,0.0006953921,0.00023630525,0.000555707,0.00039316824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008191859,0.0006105824,0.0005315345,0.0010959123,0.0009440482,0.0019161461,0.00046153943,0.0010900305,0.0049655754],"category_scores_gemma":[0.0046962034,0.0003624306,0.00036608873,0.00059780467,0.0027298348,0.0033286044,0.0013740814,0.00078390137,0.0007279058],"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.00028555453,0.000054660086,0.0012164973,0.00016428712,0.000023819268,0.00087743264,0.0013109877,0.003812592,0.013623403,0.9650091,0.001510461,0.012111349],"study_design_scores_gemma":[0.000047070753,0.0001103163,0.0005290478,0.00006484506,0.000014394731,0.00059184356,0.00051769393,0.021088138,0.00474467,0.9679225,0.00432541,0.00004411535],"about_ca_topic_score_codex":0.00017082652,"about_ca_topic_score_gemma":0.00021750502,"teacher_disagreement_score":0.0049655754,"about_ca_system_score_codex":0.0005283572,"about_ca_system_score_gemma":0.00023785811,"threshold_uncertainty_score":0.016611516},"labels":[],"label_agreement":null},{"id":"W1540559428","doi":"10.1007/s00208-015-1233-9","title":"Power series with positive coefficients arising from the characteristic polynomials of positive matrices","year":2015,"lang":"en","type":"article","venue":"Mathematische Annalen","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Science Foundation Ireland","keywords":"Mathematics; Formal power series; Power series; Integer (computer science); Combinatorics; Series (stratigraphy); Matrix (chemical analysis); Positive-definite matrix; Pure mathematics; Mathematical analysis; Eigenvalues and eigenvectors","score_opus":0.016015567582248705,"score_gpt":0.240216718897086,"score_spread":0.2242011513148373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540559428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24762106,0.0033312375,0.6110314,0.0033320987,0.0011898663,0.00007624544,0.00028700376,0.00040399432,0.13272709],"genre_scores_gemma":[0.90574247,0.0028298267,0.045177065,0.000494332,0.001565204,0.0000982203,0.0001552309,0.00025402074,0.043683685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921584,0.0002232029,0.000024872015,0.00010856814,0.00032803882,0.00009944785],"domain_scores_gemma":[0.996345,0.0023788132,0.00040184875,0.0002053578,0.0004018608,0.0002671835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010853688,0.0013140223,0.00071655127,0.0026130602,0.0009312162,0.0028967217,0.0013010572,0.001190715,0.009367211],"category_scores_gemma":[0.010918932,0.00050998223,0.0005822573,0.0024597582,0.003416094,0.005293299,0.001634984,0.003190646,0.0016132708],"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.000019352896,0.000016451522,0.00014942932,0.00005272546,0.000004979676,0.00013270849,0.00020968867,0.0019397853,0.00093484856,0.9864553,0.0013782766,0.00870635],"study_design_scores_gemma":[0.000009883908,0.0000103350985,0.00010152104,0.000016695145,0.000005066558,0.0001975229,0.000053844706,0.0147979865,0.0005305873,0.98205686,0.0022073402,0.000012392611],"about_ca_topic_score_codex":0.00044625835,"about_ca_topic_score_gemma":0.0006703665,"teacher_disagreement_score":0.009367211,"about_ca_system_score_codex":0.0010769468,"about_ca_system_score_gemma":0.0006263398,"threshold_uncertainty_score":0.031336427},"labels":[],"label_agreement":null},{"id":"W1544671383","doi":"10.1023/a:1009942122633","title":"Effective Computation of Rational Approximants and Interpolants","year":2000,"lang":"en","type":"article","venue":"Reliable Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computation; Symbolic computation; Mathematics; Path (computing); Vandermonde matrix; Toeplitz matrix; Polynomial; Algorithm; Computer science; Pure mathematics","score_opus":0.006351138298687647,"score_gpt":0.23888611231838525,"score_spread":0.2325349740196976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544671383","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032694373,0.0011571029,0.95158195,0.0003220589,0.00033125022,0.000028613495,0.000051155606,0.00044725498,0.01338626],"genre_scores_gemma":[0.69946146,0.0014952354,0.2876559,0.00014765968,0.00034486168,0.00008672406,0.00013373862,0.0005463609,0.010128067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998828,0.00036534242,0.00004663997,0.00009962858,0.0005550634,0.00010530997],"domain_scores_gemma":[0.9979469,0.0009994111,0.000110631525,0.00048602888,0.0003546176,0.000102353544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00190304,0.00096846116,0.0012852638,0.0016064835,0.000842591,0.002512362,0.0015369158,0.0009904904,0.00412814],"category_scores_gemma":[0.009361921,0.0005016061,0.00054273766,0.0014876937,0.0024749718,0.0032166939,0.0017279489,0.0022484171,0.0010083028],"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.00008255195,0.000020401732,0.00014901614,0.00010244434,0.000020031086,0.00006596338,0.00013091801,0.045063652,0.0018046487,0.9163501,0.0014725174,0.034737736],"study_design_scores_gemma":[0.000019872365,0.000028460687,0.00008035048,0.000034386798,0.000017162969,0.00004831161,0.000044454817,0.4171368,0.0039959177,0.5742763,0.0042985617,0.000019412611],"about_ca_topic_score_codex":0.0008457341,"about_ca_topic_score_gemma":0.0011950566,"teacher_disagreement_score":0.00412814,"about_ca_system_score_codex":0.0009883567,"about_ca_system_score_gemma":0.00074385846,"threshold_uncertainty_score":0.013809979},"labels":[],"label_agreement":null},{"id":"W1545041631","doi":"10.1002/0471469882.biblio","title":"Bibliography and References","year":2003,"lang":"en","type":"other","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Library science; Citation; Mathematics; Computer science","score_opus":0.012404863671057122,"score_gpt":0.23229384800256367,"score_spread":0.21988898433150655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545041631","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007654873,0.040829077,0.01973638,0.0027464835,0.010806447,0.00017296986,0.010953968,0.0031144808,0.91087466],"genre_scores_gemma":[0.0056992825,0.03910196,0.018006733,0.0016235814,0.0034679833,0.00021427077,0.02157056,0.0024162426,0.9078994],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903345,0.0001172734,0.00006252362,0.0001494675,0.00056809094,0.00006920127],"domain_scores_gemma":[0.9978916,0.00048680487,0.00007581877,0.0003661211,0.0010079518,0.00017182317],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006061222,0.0014292587,0.0016872261,0.0121640945,0.0016247148,0.0035840964,0.0018778703,0.00094106805,0.39746046],"category_scores_gemma":[0.0051960093,0.00040733773,0.0007732397,0.023639305,0.0006911607,0.0030920927,0.001581799,0.0013370133,0.3533032],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012792733,0.000026801668,0.000050413357,0.00037087977,0.000005257568,0.000023017963,0.000019674004,0.00028939842,0.00014841153,0.0064734756,0.8674588,0.12512097],"study_design_scores_gemma":[0.0000041484395,0.0000056584145,0.00012673643,0.00025200774,0.0000129184145,0.00005313802,0.000023609105,0.00021581756,0.0002042706,0.0054114247,0.99368215,0.000008132932],"about_ca_topic_score_codex":0.006420983,"about_ca_topic_score_gemma":0.0130302925,"teacher_disagreement_score":0.60253954,"about_ca_system_score_codex":0.0012303038,"about_ca_system_score_gemma":0.0021434422,"threshold_uncertainty_score":0.8594495},"labels":[],"label_agreement":null},{"id":"W1545257582","doi":"10.1090/s0002-9939-05-08039-1","title":"Extension of a generalized Pexider equation","year":2005,"lang":"lv","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":28,"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":"Extension (predicate logic); Mathematics; Calculus (dental); Computer science; Programming language; Medicine","score_opus":0.02349681766570671,"score_gpt":0.26725729932326564,"score_spread":0.24376048165755893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545257582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026125425,0.0012710744,0.6169127,0.0029930687,0.0024805674,0.0001676968,0.0009997102,0.00066928647,0.34838036],"genre_scores_gemma":[0.41259852,0.0021882888,0.26266178,0.0022227748,0.001801101,0.0003293381,0.0017023437,0.001421964,0.31507397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992643,0.00016107238,0.000049096667,0.00020288574,0.00022279836,0.00009989763],"domain_scores_gemma":[0.9991511,0.00019855562,0.00005604162,0.00017231605,0.0003589016,0.000063017455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010766402,0.00096093223,0.0006544131,0.0013853492,0.0011364234,0.001739371,0.0015395903,0.0012932996,0.039682664],"category_scores_gemma":[0.0036560406,0.00036632002,0.00200238,0.0009528184,0.0017797388,0.004350688,0.0027756288,0.0027397429,0.0086946655],"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.000025966112,0.000018748726,0.00016697097,0.00006719007,0.000010414808,0.0001796843,0.00014181621,0.0026524272,0.00067341496,0.9725513,0.008044871,0.015467046],"study_design_scores_gemma":[0.000043772074,0.000042393156,0.00026676222,0.00006501936,0.000023713688,0.00039133054,0.0000757197,0.047310434,0.001186711,0.85802495,0.09253716,0.000032074644],"about_ca_topic_score_codex":0.0032375383,"about_ca_topic_score_gemma":0.0026378904,"teacher_disagreement_score":0.039682664,"about_ca_system_score_codex":0.0014590118,"about_ca_system_score_gemma":0.0011485683,"threshold_uncertainty_score":0.1327517},"labels":[],"label_agreement":null},{"id":"W1558501364","doi":"10.21314/jcf.2004.116","title":"Analysis of the stability of the linear boundary condition for the Black–Scholes equation","year":2004,"lang":"en","type":"article","venue":"The Journal of Computational Finance","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":116,"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":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Boundary value problem; Mathematics; Discretization; Stability (learning theory); Applied mathematics; Derivative (finance); Boundary (topology); Black–Scholes model; Mixed boundary condition; Finite difference method; Mathematical analysis; Computer science; Finance; Economics; Econometrics","score_opus":0.021050744498140886,"score_gpt":0.27455637134968836,"score_spread":0.2535056268515475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558501364","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5153573,0.0006585936,0.4649532,0.0021413516,0.00013324532,0.00014091856,0.00014152017,0.0003218985,0.01615192],"genre_scores_gemma":[0.98109025,0.00014852721,0.015259928,0.00010830077,0.000051808594,0.00008066825,0.00007366956,0.000056399796,0.0031304038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993573,0.00030422054,0.00002577978,0.00006190525,0.00018426377,0.000066614084],"domain_scores_gemma":[0.9884531,0.008536601,0.0011049096,0.00033015708,0.0012022577,0.0003729283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025273087,0.0005649318,0.00076839916,0.00084474543,0.0007351604,0.0015139031,0.0007148672,0.0013538289,0.0032550818],"category_scores_gemma":[0.016499043,0.00029700718,0.00057129253,0.00024374475,0.0031571863,0.001396778,0.001676236,0.0017285371,0.00028388744],"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.00051588163,0.00016059079,0.004325851,0.00022902548,0.0000950319,0.00050405,0.00039931934,0.6662417,0.02650681,0.2858145,0.001793608,0.013413605],"study_design_scores_gemma":[0.000018653898,0.000019573668,0.0001653701,0.000007013281,0.0000036769768,0.000011157006,0.000013948479,0.99149674,0.00096432446,0.007188322,0.00010343584,0.000007730288],"about_ca_topic_score_codex":0.0042296993,"about_ca_topic_score_gemma":0.0013046762,"teacher_disagreement_score":0.0042296993,"about_ca_system_score_codex":0.00095456705,"about_ca_system_score_gemma":0.001225498,"threshold_uncertainty_score":0.013365865},"labels":[],"label_agreement":null},{"id":"W1573410078","doi":"10.1109/iscas.1999.777576","title":"Sensitivity analysis of periodically switched linear circuits using an adjoint network technique","year":2003,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Phasor; Sensitivity (control systems); Electronic circuit; Baseband; PSL; Frequency domain; RLC circuit; Mathematics; Network analysis; Linear circuit; Topology (electrical circuits); Electronic engineering; Computer science; Equivalent circuit; Bandwidth (computing); Engineering; Telecommunications; Mathematical analysis; Physics; Electrical engineering","score_opus":0.024622013983807367,"score_gpt":0.2666303843000376,"score_spread":0.24200837031623024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573410078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022131572,0.00007617075,0.9757564,0.0000488717,0.000012261569,0.00001646182,0.00001364984,0.00014494409,0.00179972],"genre_scores_gemma":[0.89296407,0.00016179607,0.10503726,0.00003947239,0.000012758119,0.000074355914,0.00003631529,0.000031194486,0.001642857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997819,0.000075379154,0.0000054891116,0.000023645294,0.00009967857,0.00001393154],"domain_scores_gemma":[0.9995425,0.000338244,0.0000352837,0.000024662479,0.000051632425,0.000007766538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044290695,0.00035131516,0.000314047,0.00039350582,0.00018351612,0.0004074014,0.00029528886,0.0003730685,0.0012008018],"category_scores_gemma":[0.0011538502,0.00021380438,0.00031039648,0.0002006392,0.0004248923,0.00042152827,0.00037576034,0.0004183137,0.00007673435],"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.000029930703,0.00002033946,0.00033842248,0.000056609548,0.000024623941,0.00006149294,0.00005441772,0.926583,0.02280944,0.021672972,0.00022003602,0.028128654],"study_design_scores_gemma":[0.0000015273896,0.000009467408,0.00005212053,0.0000020936177,0.0000021013568,0.000011196601,0.0000029379837,0.9964399,0.0011373108,0.00214095,0.00019783713,0.0000025183551],"about_ca_topic_score_codex":0.0009707753,"about_ca_topic_score_gemma":0.00080747623,"teacher_disagreement_score":0.0012008018,"about_ca_system_score_codex":0.00041838328,"about_ca_system_score_gemma":0.0002981963,"threshold_uncertainty_score":0.004017055},"labels":[],"label_agreement":null},{"id":"W1574303133","doi":"10.1109/iacc.1995.465831","title":"Parallel structured network for solving balanced realization problems","year":2002,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"McMaster University","funders":"","keywords":"Realization (probability); Matrix similarity; Diagonal; Transformation (genetics); Computer science; Similarity (geometry); State space; Matrix (chemical analysis); Theoretical computer science; State (computer science); Algebra over a field; Algorithm; Mathematics; Pure mathematics; Artificial intelligence","score_opus":0.018598551695907767,"score_gpt":0.22727346380523852,"score_spread":0.20867491210933076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574303133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006195537,0.00006529873,0.9908522,0.000112805006,0.000020098305,0.000027033311,0.00003438108,0.00011352084,0.0025791049],"genre_scores_gemma":[0.48935398,0.00042449715,0.4987127,0.0002114227,0.00009961375,0.0006569833,0.0005991859,0.00012238442,0.00981923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995974,0.0001407389,0.000020868121,0.00009123761,0.000102806756,0.000046983063],"domain_scores_gemma":[0.9994684,0.00029951677,0.00005389382,0.00005933937,0.00009443185,0.000024445697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008264116,0.0006657953,0.00061017787,0.00048043273,0.00046790348,0.0007096643,0.0006975237,0.0008193568,0.0054345825],"category_scores_gemma":[0.0026989202,0.0003316104,0.00047623526,0.0005407806,0.0007603104,0.0016422216,0.001048231,0.0012016131,0.0006036216],"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.00010071265,0.000050655217,0.000309065,0.00012141131,0.00004103789,0.0001080619,0.00008915212,0.7047056,0.00225646,0.2301981,0.002647311,0.059372384],"study_design_scores_gemma":[0.00001575553,0.00001954803,0.000022632965,0.0000055793125,0.000003993386,0.000015122857,0.000010874806,0.9096729,0.00035847625,0.08886757,0.0010036046,0.000003905838],"about_ca_topic_score_codex":0.0017098581,"about_ca_topic_score_gemma":0.0023963114,"teacher_disagreement_score":0.0054345825,"about_ca_system_score_codex":0.0006260375,"about_ca_system_score_gemma":0.0008540501,"threshold_uncertainty_score":0.01818043},"labels":[],"label_agreement":null},{"id":"W1575990399","doi":"10.1002/9780470141731.ch4","title":"Discrete‐Variable Representations and their Utilization","year":2000,"lang":"en","type":"other","venue":"Advances in chemical physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":623,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Variable (mathematics); Discrete variable; Mathematics; Computer science; Environmental science; Applied mathematics; Mathematical analysis","score_opus":0.012057788623365692,"score_gpt":0.2828537447927245,"score_spread":0.2707959561693588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575990399","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015565251,0.0040931045,0.9217408,0.0012238908,0.000624075,0.000033902536,0.00016906128,0.00033170084,0.056218285],"genre_scores_gemma":[0.50235546,0.009370156,0.4466786,0.0007470522,0.0013174884,0.00019986651,0.00048212844,0.0005286598,0.038320553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988764,0.00051060703,0.00006773783,0.0001681305,0.00029705523,0.00008004387],"domain_scores_gemma":[0.99804425,0.0010130713,0.00012297103,0.00051775674,0.00024063335,0.00006124274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001308769,0.0005096928,0.00055064756,0.0012587875,0.00049872434,0.0034480055,0.0011483282,0.00067188364,0.0084233545],"category_scores_gemma":[0.006025152,0.00034187097,0.0005480489,0.0021829074,0.0021172795,0.0043188054,0.0017793492,0.0018288923,0.0016009466],"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.0000065742656,0.0000050927865,0.00004020357,0.000021703738,0.0000026384444,0.000008615303,0.00005561272,0.0013494954,0.00021848893,0.96990055,0.00083287375,0.027557982],"study_design_scores_gemma":[0.000006832819,0.0000169397,0.00010337829,0.00004052744,0.000005859287,0.00006924411,0.000055212957,0.047033276,0.0007262377,0.93605316,0.015871357,0.00001790681],"about_ca_topic_score_codex":0.0008026766,"about_ca_topic_score_gemma":0.00044027227,"teacher_disagreement_score":0.0084233545,"about_ca_system_score_codex":0.0006222243,"about_ca_system_score_gemma":0.0004375623,"threshold_uncertainty_score":0.02817893},"labels":[],"label_agreement":null},{"id":"W1584631835","doi":"10.37236/1832","title":"Pólya's Permanent Problem","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":137,"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":"Invertible matrix; Mathematics; Sign (mathematics); Square (algebra); Combinatorics; Square matrix; Matrix (chemical analysis); Zero (linguistics); Polynomial; Discrete mathematics; Pure mathematics; Symmetric matrix; Mathematical analysis; Geometry","score_opus":0.0050381919843198895,"score_gpt":0.21421194865763105,"score_spread":0.20917375667331115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584631835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15590861,0.00233223,0.53299725,0.020096295,0.0015136008,0.00024176284,0.0048701838,0.002014332,0.28002575],"genre_scores_gemma":[0.79851776,0.0018176464,0.09164168,0.0018467422,0.00088300684,0.00038347382,0.0034752758,0.00075710827,0.10067729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889284,0.00020825263,0.00005313413,0.00041520345,0.00017869077,0.000251923],"domain_scores_gemma":[0.9964485,0.0020303703,0.00022150243,0.00075537805,0.00031198954,0.00023223952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010512072,0.00055192737,0.00135781,0.00061452115,0.0023994949,0.0041106557,0.0015565495,0.001987115,0.029762061],"category_scores_gemma":[0.007964662,0.0005742397,0.00089120405,0.0012919189,0.0022623183,0.00618673,0.0025426198,0.0036881051,0.00480897],"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.00017103908,0.000065076805,0.00033643396,0.00013577238,0.000022451582,0.00009211453,0.00012057295,0.010962621,0.0005224669,0.9223806,0.027594669,0.03759609],"study_design_scores_gemma":[0.00005406238,0.000020601983,0.00013787065,0.000022063194,0.000010273213,0.000063747546,0.000080985374,0.022583174,0.00055268273,0.96441,0.012051399,0.000013141132],"about_ca_topic_score_codex":0.0016938185,"about_ca_topic_score_gemma":0.0017382883,"teacher_disagreement_score":0.029762061,"about_ca_system_score_codex":0.0014318383,"about_ca_system_score_gemma":0.0021579207,"threshold_uncertainty_score":0.099564016},"labels":[],"label_agreement":null},{"id":"W1593884873","doi":"10.1090/crmm/002","title":"Applied Integral Transforms","year":2007,"lang":"en","type":"book","venue":"CRM monograph series","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":36,"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 Ottawa","funders":"","keywords":"Computer science","score_opus":0.009551133250191005,"score_gpt":0.21475326409221726,"score_spread":0.20520213084202626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593884873","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030839,0.020984685,0.1909802,0.0016115422,0.0042287908,0.000041346004,0.000301597,0.0014223959,0.77734554],"genre_scores_gemma":[0.048815727,0.01707311,0.06294785,0.000567799,0.0027991405,0.00007776136,0.0005721432,0.0012658203,0.86588067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996431,0.000038069567,0.000012289655,0.000065247186,0.00021707598,0.000024183077],"domain_scores_gemma":[0.9997961,0.000045174354,0.000010406543,0.00006008609,0.00006790884,0.00002030186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034644332,0.0010998186,0.0010435202,0.0021321347,0.00068244204,0.0024065592,0.000873094,0.0007549296,0.03935521],"category_scores_gemma":[0.0009317629,0.00042550394,0.0004991243,0.0025828555,0.0013871209,0.0028466256,0.001460525,0.0027877183,0.01930039],"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.000016449849,0.0000317833,0.00005100732,0.00013850676,0.0000122289675,0.000042129206,0.000098376586,0.001573221,0.002193371,0.59456664,0.10843093,0.29284534],"study_design_scores_gemma":[0.0000065144186,0.000024469653,0.00021796799,0.000092574475,0.000015228658,0.00036531428,0.00005420894,0.010565051,0.0031800442,0.39227918,0.5931812,0.00001821391],"about_ca_topic_score_codex":0.0005945219,"about_ca_topic_score_gemma":0.0010388438,"teacher_disagreement_score":0.03935521,"about_ca_system_score_codex":0.0011709906,"about_ca_system_score_gemma":0.0006663834,"threshold_uncertainty_score":0.13165635},"labels":[],"label_agreement":null},{"id":"W1600081688","doi":"10.1103/physrevlett.116.170501","title":"Achievable Polarization for Heat-Bath Algorithmic Cooling","year":2016,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología; Canadian Institute for Advanced Research","keywords":"Polarization (electrochemistry); Physics; Materials science; Chemistry; Physical chemistry","score_opus":0.013679461104189695,"score_gpt":0.27460866116615756,"score_spread":0.26092920006196785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600081688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33707076,0.0009426048,0.58425313,0.0018026243,0.000110672285,0.00017075505,0.00042783914,0.0007310964,0.07449058],"genre_scores_gemma":[0.9627156,0.00040326675,0.033911545,0.00014249602,0.00003342486,0.0001872189,0.0001541308,0.00014570699,0.0023066676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909866,0.0002707132,0.000030982523,0.0001225102,0.00020797794,0.00026918095],"domain_scores_gemma":[0.99703085,0.0020311396,0.00016232558,0.0003161165,0.0002845183,0.00017499784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015105364,0.00068311003,0.0006106613,0.00045556226,0.0014023434,0.0019879492,0.0006405358,0.0010208898,0.004637818],"category_scores_gemma":[0.0063115647,0.00037805393,0.00045629565,0.000386022,0.0025764094,0.0025468222,0.0023892405,0.001823119,0.00091299124],"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.00052141235,0.00015067947,0.0012218984,0.0003176027,0.00003557282,0.00021362814,0.0004190805,0.13876109,0.08160932,0.7572653,0.0022412625,0.01724318],"study_design_scores_gemma":[0.000048227514,0.00011710165,0.00052923616,0.00009149208,0.000026244239,0.0001744144,0.00018263696,0.54876494,0.07635867,0.37019652,0.003460505,0.000050037797],"about_ca_topic_score_codex":0.00026123764,"about_ca_topic_score_gemma":0.0002475985,"teacher_disagreement_score":0.004637818,"about_ca_system_score_codex":0.00084553706,"about_ca_system_score_gemma":0.00094176724,"threshold_uncertainty_score":0.015515029},"labels":[],"label_agreement":null},{"id":"W1601203605","doi":"10.1002/9780470171455.app3","title":"Appendix C: Primer on Linear Algebra","year":2007,"lang":"en","type":"other","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Calgary; McMaster University","funders":"","keywords":"Cholesky decomposition; Orthogonalization; Mathematics; Linear algebra; Singular value decomposition; Factorization; QR decomposition; Eigenvalues and eigenvectors; Algebra over a field; Principal (computer security); Combinatorics; Computer science; Algorithm; Pure mathematics; Physics; Geometry","score_opus":0.012729371128119829,"score_gpt":0.26075776881637863,"score_spread":0.2480283976882588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601203605","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006217726,0.003014711,0.15031943,0.007750792,0.0099325245,0.0010420221,0.06441724,0.013885098,0.7490164],"genre_scores_gemma":[0.005559465,0.0045022094,0.10182572,0.004878699,0.00451961,0.001369921,0.04781228,0.011528728,0.81800336],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875224,0.0003331009,0.000108618624,0.0001409119,0.0005962328,0.00006892588],"domain_scores_gemma":[0.991863,0.0037162912,0.00022208062,0.0008010628,0.00321194,0.00018565833],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011528537,0.0015117439,0.0009328964,0.0028498296,0.0008624184,0.0023400802,0.0013797573,0.0012231331,0.65938616],"category_scores_gemma":[0.012475356,0.00061229925,0.0007190124,0.003699777,0.0005369431,0.0029166872,0.0014501619,0.0018192476,0.5483299],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070508495,0.000013856412,0.000024685547,0.000091475005,0.000001525048,0.0000151346785,0.000011080553,0.00018018864,0.00007225076,0.0067789583,0.9630558,0.029747931],"study_design_scores_gemma":[0.000007840097,0.000008280107,0.0001385312,0.00014414474,0.0000024984151,0.000083805666,0.000021024052,0.00050876563,0.0002559347,0.012912159,0.98590463,0.000012266191],"about_ca_topic_score_codex":0.002781975,"about_ca_topic_score_gemma":0.0038004282,"teacher_disagreement_score":0.65938616,"about_ca_system_score_codex":0.00095174374,"about_ca_system_score_gemma":0.0020300904,"threshold_uncertainty_score":0.4858443},"labels":[],"label_agreement":null},{"id":"W1606462009","doi":"10.1023/a:1016030016985","title":"Block Orderings for Tensor-Product Grids in Two and Three Dimensions","year":2002,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Numerical analysis; Mathematics; Theory of computation; Diagonal; Applied mathematics; Convergence (economics); Lexicographical order; Mathematical optimization; Iterative method; Algorithm; Mathematical analysis; Combinatorics; Geometry","score_opus":0.022956990962696152,"score_gpt":0.26152199159602724,"score_spread":0.23856500063333108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606462009","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020637091,0.0005956485,0.96672165,0.0002910692,0.0002463793,0.00007975395,0.00035296075,0.0009101948,0.010165231],"genre_scores_gemma":[0.176577,0.00089609955,0.80701905,0.00019603762,0.00010445135,0.00033455537,0.0009468525,0.001077133,0.012848858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994855,0.00018469278,0.000040257426,0.000032241,0.00019708276,0.000060241706],"domain_scores_gemma":[0.99822754,0.00053303206,0.00012938636,0.00045271488,0.0004743859,0.00018287393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085122365,0.00054330134,0.0006205512,0.0008731313,0.000820584,0.0012624022,0.0009588493,0.00048006405,0.008160492],"category_scores_gemma":[0.0039581847,0.00037891883,0.00037901473,0.0014927428,0.00084865635,0.0016698979,0.0010233106,0.0012747913,0.002056616],"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.00026288893,0.00010594394,0.00071559264,0.00022119076,0.000022312264,0.00008229193,0.0002596846,0.08576814,0.007590092,0.7352653,0.020472022,0.14923456],"study_design_scores_gemma":[0.000064728345,0.000072939874,0.0002738358,0.00003549223,0.000013634976,0.000046657704,0.000080894155,0.54359835,0.0048738034,0.4183208,0.032586593,0.000032233555],"about_ca_topic_score_codex":0.0034828351,"about_ca_topic_score_gemma":0.008099482,"teacher_disagreement_score":0.008160492,"about_ca_system_score_codex":0.0007131677,"about_ca_system_score_gemma":0.0010265816,"threshold_uncertainty_score":0.027299583},"labels":[],"label_agreement":null},{"id":"W1612003494","doi":"10.48550/arxiv.1105.1185","title":"Iterative Methods for Computing Eigenvalues and Eigenvectors","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":56,"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":"Power iteration; Rayleigh quotient iteration; Eigenvalues and eigenvectors; Inverse iteration; Iterative method; Mathematics; Matrix-free methods; Applied mathematics; Linear algebra; Eigenvalues and eigenvectors of the second derivative; Modal matrix; Polynomial; Eigenvalue perturbation; Eigenvalue algorithm; Matrix (chemical analysis); Algorithm; Symmetric matrix; Diagonalizable matrix; Mathematical analysis; Sparse matrix; Square matrix; Geometry","score_opus":0.109061577959315,"score_gpt":0.25525660032613096,"score_spread":0.14619502236681597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1612003494","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006144951,0.0003015939,0.9966516,0.000086546235,0.000055285465,0.000030046636,0.00001536385,0.0001212658,0.0021238965],"genre_scores_gemma":[0.028028255,0.0011429657,0.9661294,0.0001222333,0.00012932849,0.00027234832,0.00007453233,0.00025622066,0.003844639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727696,0.0011995711,0.00015731108,0.00023325688,0.0010126382,0.0001203254],"domain_scores_gemma":[0.9944323,0.0030289835,0.00032368753,0.000668365,0.0014483059,0.00009845727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004038191,0.0014355881,0.00097620336,0.0015684293,0.0010310654,0.0013466175,0.0019785066,0.0014117176,0.005388642],"category_scores_gemma":[0.018490309,0.0005620396,0.0013261518,0.0020985084,0.0019149109,0.0020704758,0.001691353,0.0023190328,0.0027572513],"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.000071368355,0.000103770566,0.0008462979,0.0005738679,0.00011503806,0.00016836607,0.00044832192,0.21267585,0.00724263,0.570886,0.0070574107,0.199811],"study_design_scores_gemma":[0.000046489713,0.00006688329,0.00025888765,0.00011532901,0.000031514133,0.0002102593,0.00006885683,0.682702,0.0054736002,0.28875074,0.022214364,0.00006111698],"about_ca_topic_score_codex":0.0014262247,"about_ca_topic_score_gemma":0.0017549285,"teacher_disagreement_score":0.005388642,"about_ca_system_score_codex":0.0005938955,"about_ca_system_score_gemma":0.0011352596,"threshold_uncertainty_score":0.021356225},"labels":[],"label_agreement":null},{"id":"W1612117521","doi":"10.37236/1967","title":"Permanents of Hessenberg (0,1)-matrices","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Matrix (chemical analysis); Chemistry","score_opus":0.005077674926159721,"score_gpt":0.22489663216416333,"score_spread":0.21981895723800363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1612117521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3710953,0.00049777614,0.53940296,0.001046148,0.0003945097,0.00016249379,0.0021713288,0.0019422597,0.08328723],"genre_scores_gemma":[0.8599669,0.00034606227,0.08978869,0.00031477163,0.0002620029,0.00029690433,0.0017947234,0.00038364384,0.046846274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993143,0.0001171798,0.00004163076,0.00014448428,0.0001795682,0.00020296345],"domain_scores_gemma":[0.99829,0.0005819789,0.0003114865,0.0002729575,0.00030494135,0.00023866606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066673255,0.00056827196,0.00032226686,0.0017019472,0.001032928,0.0022277897,0.0008932601,0.00069976883,0.018397415],"category_scores_gemma":[0.0038032546,0.00039903104,0.0005693905,0.000987862,0.0018637327,0.0025027643,0.0013610732,0.0012084323,0.0037874777],"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.00027789024,0.00009067171,0.0007818727,0.00013863281,0.000018622153,0.00021244961,0.00029193776,0.021409899,0.00933906,0.9158249,0.008753862,0.042860143],"study_design_scores_gemma":[0.000040808143,0.00018467364,0.00083833036,0.000027889419,0.000008293256,0.00027315074,0.00011868052,0.047588855,0.010769473,0.9323493,0.007733173,0.00006726599],"about_ca_topic_score_codex":0.00044038956,"about_ca_topic_score_gemma":0.0009180488,"teacher_disagreement_score":0.018397415,"about_ca_system_score_codex":0.0007610215,"about_ca_system_score_gemma":0.00070871273,"threshold_uncertainty_score":0.06154549},"labels":[],"label_agreement":null},{"id":"W1625049850","doi":"10.1109/mwscas.1990.140779","title":"A Schur algorithm for strongly regular Toeplitz-plus-Hankel matrices","year":2002,"lang":"en","type":"article","venue":"","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":"Queen's University","funders":"","keywords":"Toeplitz matrix; Type (biology); Hankel matrix; Algorithm; Mathematics; Computer science; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.018272987940841888,"score_gpt":0.23782946862282034,"score_spread":0.21955648068197844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1625049850","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019978085,0.000028941418,0.9959651,0.00003232068,0.000022184126,0.00004322709,0.00003521544,0.00043303132,0.0014421238],"genre_scores_gemma":[0.05147647,0.00009312156,0.93959415,0.000073640775,0.000040717045,0.00016006827,0.00031586824,0.00035666657,0.007889416],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935335,0.00015675889,0.00004567725,0.00013216646,0.00023245209,0.00007964522],"domain_scores_gemma":[0.99890816,0.00036753394,0.000054030304,0.00017306753,0.00043614133,0.000060987055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000867816,0.0009789789,0.0006764883,0.0010069578,0.0009146752,0.0012435818,0.0013610292,0.0009283473,0.011728484],"category_scores_gemma":[0.0036463784,0.00041389692,0.0007510014,0.0009323557,0.0007481976,0.0013836602,0.0017469865,0.0013761406,0.0061412374],"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.00020060099,0.00014523332,0.0005473378,0.00018709697,0.00006816485,0.00024307235,0.0003490472,0.11731845,0.02065587,0.30410254,0.010954054,0.5452285],"study_design_scores_gemma":[0.00006507344,0.00010657625,0.00014504849,0.00002739107,0.000017655448,0.0001744216,0.0000615956,0.8025389,0.011268946,0.17158924,0.013963195,0.000041955387],"about_ca_topic_score_codex":0.0023086106,"about_ca_topic_score_gemma":0.00447269,"teacher_disagreement_score":0.011728484,"about_ca_system_score_codex":0.00063144503,"about_ca_system_score_gemma":0.0014624575,"threshold_uncertainty_score":0.03923571},"labels":[],"label_agreement":null},{"id":"W1633818566","doi":"10.48550/arxiv.math/0404349","title":"On the Higher-Order Derivatives of Spectral Functions: Two Special Cases","year":2004,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Order (exchange); Mathematics; Applied mathematics; Chemistry; Pure mathematics; Business","score_opus":0.04617836536023865,"score_gpt":0.2763489779066143,"score_spread":0.23017061254637564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1633818566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10910492,0.0022074832,0.8162796,0.002444067,0.00040235487,0.000042959557,0.00009728639,0.00035929415,0.06906209],"genre_scores_gemma":[0.83233786,0.0017305578,0.1472105,0.0008792122,0.00088217785,0.00005991045,0.00009402919,0.0005134017,0.016292466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987447,0.00028629316,0.00012860092,0.00020399546,0.0004636112,0.00017276584],"domain_scores_gemma":[0.9975074,0.0012021933,0.0002816343,0.00043811256,0.0003498102,0.00022087566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027632115,0.0010568757,0.00084959733,0.0019922594,0.0017852639,0.0032555782,0.0014720353,0.0023475585,0.003779799],"category_scores_gemma":[0.0061666067,0.0005079236,0.0011454348,0.0016477786,0.005461284,0.0078005358,0.002792116,0.003911378,0.0009880201],"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.0000064237756,0.000009853805,0.0001262275,0.000018329727,0.0000022156974,0.00032785602,0.00030143544,0.0008578019,0.0006772095,0.99325365,0.00048476004,0.003934297],"study_design_scores_gemma":[0.0000053811686,0.000010886796,0.00014639724,0.000021191794,0.0000052966197,0.0005782094,0.00010754735,0.023114383,0.0012749986,0.96900004,0.005712865,0.000022700335],"about_ca_topic_score_codex":0.0012494803,"about_ca_topic_score_gemma":0.0011058142,"teacher_disagreement_score":0.003779799,"about_ca_system_score_codex":0.0013438227,"about_ca_system_score_gemma":0.0005694803,"threshold_uncertainty_score":0.01461345},"labels":[],"label_agreement":null},{"id":"W1636009176","doi":"10.1002/nla.800","title":"Fast multilevel methods for Markov chains","year":2011,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Israel Science Foundation","keywords":"Markov chain; Speedup; Residual; Mathematics; Algorithm; Iterative method; Markov process; Applied mathematics; Markov model; Computer science; Mathematical optimization; Parallel computing; Statistics","score_opus":0.02959064902754927,"score_gpt":0.3115063589447691,"score_spread":0.2819157099172198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1636009176","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004528983,0.0003587512,0.9907041,0.00019185599,0.000064278844,0.00004191505,0.0001103607,0.00031569652,0.0036841233],"genre_scores_gemma":[0.23717389,0.0009540973,0.7521833,0.00017595045,0.00015763586,0.0004803585,0.0004021294,0.00043982227,0.008032754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993363,0.0002524014,0.000026387906,0.000048498146,0.0002796724,0.000056571043],"domain_scores_gemma":[0.9984363,0.00084030215,0.000113652924,0.00021786022,0.00031315885,0.00007878193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090607314,0.00045533915,0.00075358833,0.0007289519,0.00062472327,0.0008108701,0.00094164425,0.0007493626,0.0056310096],"category_scores_gemma":[0.0038370392,0.00034685177,0.0009088529,0.0007933197,0.0005555101,0.00081204466,0.0014598353,0.0015096011,0.0013840061],"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.00006838573,0.000041630497,0.00076349295,0.00027341774,0.00009681033,0.00011657893,0.00021580416,0.5838642,0.0044429693,0.29549065,0.0062660687,0.10836002],"study_design_scores_gemma":[0.000009919888,0.000007157071,0.00006530813,0.000013512538,0.000003979197,0.000012132122,0.000009062066,0.96455693,0.0004125836,0.03198172,0.002921365,0.000006211379],"about_ca_topic_score_codex":0.004073597,"about_ca_topic_score_gemma":0.004204821,"teacher_disagreement_score":0.0056310096,"about_ca_system_score_codex":0.0006700098,"about_ca_system_score_gemma":0.001210728,"threshold_uncertainty_score":0.018837571},"labels":[],"label_agreement":null},{"id":"W1659235135","doi":"10.48550/arxiv.0801.3865","title":"Simultaneous preconditioning and symmetrization of non-symmetric linear systems","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Symmetrization; Duality (order theory); Mathematics; Applied mathematics; Linear system; Scheme (mathematics); System of linear equations; Mathematical optimization; Computer science; Mathematical analysis; Pure mathematics","score_opus":0.02164926509811681,"score_gpt":0.24977731202845244,"score_spread":0.22812804693033562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1659235135","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030753963,0.00006873795,0.9668328,0.00012029443,0.00005898625,0.000041426683,0.000020148667,0.00030355112,0.0018001152],"genre_scores_gemma":[0.39370707,0.00017731573,0.60188496,0.00012253464,0.00009675795,0.00014049094,0.000110161396,0.00023767304,0.003523074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942386,0.00024083204,0.00003599634,0.00007545175,0.0001645312,0.00005932117],"domain_scores_gemma":[0.99888676,0.00042104255,0.00014104167,0.00033407,0.0001335757,0.000083541956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008341165,0.000690733,0.00072717643,0.00031417128,0.00032363422,0.0005151677,0.00068731845,0.0005857959,0.0025393772],"category_scores_gemma":[0.0025112962,0.00029291896,0.0004491298,0.0003360174,0.0011022887,0.0009933118,0.0018296351,0.0014185268,0.0006319031],"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.00044927743,0.00023995411,0.001314321,0.00046296697,0.000093865594,0.0006238385,0.00082377956,0.3673363,0.18354057,0.23008993,0.005259591,0.20976555],"study_design_scores_gemma":[0.000033599175,0.00005719513,0.00013183484,0.0000068049953,0.0000066927946,0.000074475814,0.000023769418,0.9490648,0.01942196,0.029425848,0.0017426006,0.000010540647],"about_ca_topic_score_codex":0.0005671419,"about_ca_topic_score_gemma":0.0011434463,"teacher_disagreement_score":0.0025393772,"about_ca_system_score_codex":0.00021978567,"about_ca_system_score_gemma":0.0008071636,"threshold_uncertainty_score":0.008495033},"labels":[],"label_agreement":null},{"id":"W167692240","doi":"10.1017/s0266466604212087","title":"04.2.1. A Range Equality for Block Matrices with Orthogonal Projectors","year":2004,"lang":"en","type":"article","venue":"Econometric Theory","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Queen's University","funders":"","keywords":"Mathematics; Block (permutation group theory); Range (aeronautics); Pure mathematics; Algebra over a field; Combinatorics","score_opus":0.019101138909786916,"score_gpt":0.2457079868010114,"score_spread":0.22660684789122448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167692240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018988531,0.0011176952,0.92003495,0.0015961133,0.0002857103,0.000042459837,0.0008024437,0.00029258084,0.056839492],"genre_scores_gemma":[0.706652,0.0029954587,0.24174634,0.0024380046,0.0019393438,0.00032782904,0.002820839,0.00093013106,0.040150024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99454015,0.0021266516,0.00032108615,0.0010493668,0.0015229702,0.00043979907],"domain_scores_gemma":[0.9867048,0.0074458933,0.00094145053,0.0019300738,0.0025008759,0.00047684874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050495616,0.0006211459,0.0010892127,0.0011221761,0.0009548527,0.003003706,0.0014712099,0.0013983226,0.021725804],"category_scores_gemma":[0.020232124,0.00057464757,0.0013189607,0.0013123557,0.0026566668,0.008945992,0.0034419321,0.0046290634,0.0064018066],"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.000116344316,0.00003645433,0.0010546037,0.00017641186,0.000027618444,0.00018043749,0.00018879812,0.0048729116,0.0023937677,0.9526316,0.004952118,0.033368897],"study_design_scores_gemma":[0.00001622821,0.00007887835,0.0008280018,0.000067874425,0.000015461661,0.00037138505,0.00007625746,0.036074325,0.003579447,0.9497468,0.009111987,0.000033472726],"about_ca_topic_score_codex":0.00093656126,"about_ca_topic_score_gemma":0.00073354767,"teacher_disagreement_score":0.021725804,"about_ca_system_score_codex":0.00063691864,"about_ca_system_score_gemma":0.0007415946,"threshold_uncertainty_score":0.072680056},"labels":[],"label_agreement":null},{"id":"W1750995033","doi":"10.1080/03081087.2015.1082960","title":"Preservers of completely positive matrix rank","year":2015,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Rank (graph theory); Mathematics; Combinatorics; Matrix (chemical analysis); Set (abstract data type); Function (biology); Computer science","score_opus":0.026791615168919446,"score_gpt":0.28576724963328287,"score_spread":0.25897563446436345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1750995033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46945775,0.0007295625,0.47529787,0.00061015796,0.0002720911,0.000120242825,0.0009157852,0.00088528893,0.051711325],"genre_scores_gemma":[0.9456371,0.00036749008,0.041269794,0.0003500711,0.000322885,0.00014486848,0.00059396075,0.00026933782,0.01104452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666613,0.0007288924,0.0001939405,0.0007027269,0.0012464456,0.00046183873],"domain_scores_gemma":[0.9897747,0.003345303,0.0017509223,0.0020424977,0.0019378457,0.0011485965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022570416,0.0008235525,0.0008330973,0.0014410898,0.0009458678,0.002959674,0.0008962584,0.0006286534,0.00422424],"category_scores_gemma":[0.010044595,0.00032031417,0.00083409186,0.0008349129,0.0027079054,0.003243371,0.0023149312,0.0014656424,0.00072165875],"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.00019115042,0.00009804922,0.0013222818,0.00010743162,0.000055171047,0.0003221452,0.00041157068,0.009077138,0.013243982,0.93489134,0.002917142,0.037362415],"study_design_scores_gemma":[0.00004523745,0.00040242795,0.0021216345,0.000041520616,0.000034363187,0.0010793776,0.00038961196,0.050031487,0.014924705,0.92063785,0.010210448,0.00008133592],"about_ca_topic_score_codex":0.00032342138,"about_ca_topic_score_gemma":0.00024933685,"teacher_disagreement_score":0.00422424,"about_ca_system_score_codex":0.0005311187,"about_ca_system_score_gemma":0.00072992855,"threshold_uncertainty_score":0.014131486},"labels":[],"label_agreement":null},{"id":"W1823963912","doi":"10.1007/978-1-4684-9244-6_8","title":"Using the Picard Contraction Mapping to Solve Inverse Problems in Ordinary Differential Equations","year":2002,"lang":"en","type":"book-chapter","venue":"˜The œIMA volumes in mathematics and its applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Guelph","funders":"","keywords":"Contraction (grammar); Contraction mapping; Inverse; Mathematics; Ordinary differential equation; Applied mathematics; Mathematical analysis; Computer science; Calculus (dental); Differential equation; Medicine; Fixed point; Geometry; Internal medicine; Orthodontics","score_opus":0.05595085729039391,"score_gpt":0.26382367541320834,"score_spread":0.20787281812281444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1823963912","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025162768,0.0026554763,0.928166,0.00072562485,0.00083439855,0.000049285205,0.000027096512,0.00016711318,0.042212196],"genre_scores_gemma":[0.35639167,0.0049346294,0.5432464,0.0005897554,0.00084157084,0.00025216796,0.00013700154,0.0005396096,0.09306708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979633,0.00007483694,0.000009949409,0.000030282134,0.00007265338,0.000016019927],"domain_scores_gemma":[0.9997532,0.00014156468,0.000015940008,0.000030122153,0.00003871385,0.000020400066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065141753,0.0010054326,0.0011913781,0.000707406,0.0006795002,0.0013081091,0.00083308585,0.0009354977,0.0023186952],"category_scores_gemma":[0.0020747622,0.00050095934,0.0009876173,0.00060789165,0.0021179907,0.0018164183,0.0018943073,0.0025088943,0.0005182481],"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.000025137431,0.000029558827,0.00009425094,0.00013731491,0.0000219942,0.000106627806,0.00026630718,0.017350927,0.0037312487,0.93772644,0.0024357866,0.038074516],"study_design_scores_gemma":[0.000020082121,0.000056450488,0.0001435657,0.000032776803,0.000019068046,0.0002173669,0.000074211195,0.21892536,0.0022025208,0.7611133,0.0171685,0.000026791273],"about_ca_topic_score_codex":0.00095374254,"about_ca_topic_score_gemma":0.0011189661,"teacher_disagreement_score":0.0023186952,"about_ca_system_score_codex":0.00038298842,"about_ca_system_score_gemma":0.0006568537,"threshold_uncertainty_score":0.0077568293},"labels":[],"label_agreement":null},{"id":"W1827514603","doi":"10.5555/2346696.2346726","title":"C-DAC's efforts: application kernels on HPC cluster with GPU accelerators","year":2012,"lang":"en","type":"article","venue":"IEEE International Conference on High Performance Computing, Data, and Analytics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Parallel computing; Computer science; CUDA; GPU cluster; Speedup; Computational science; Scalability; Finite element method; Supercomputer; Computation; General-purpose computing on graphics processing units; Sparse matrix; Algorithm; Graphics; Physics; Computer graphics (images)","score_opus":0.04648544347538451,"score_gpt":0.30330164784212776,"score_spread":0.25681620436674324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1827514603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14546476,0.0023036748,0.6455391,0.0015774975,0.00093656714,0.00055882917,0.0025239564,0.05307194,0.14802375],"genre_scores_gemma":[0.51979756,0.0010266193,0.43893132,0.00036466113,0.00018890102,0.00027942186,0.004571416,0.0026361933,0.032203924],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992712,0.00010246103,0.00003238396,0.000092342576,0.0003736527,0.00012793773],"domain_scores_gemma":[0.9991209,0.00008181803,0.000030837175,0.00028004628,0.00036301318,0.00012337387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074875157,0.0007333667,0.0005118135,0.0007123706,0.0009046368,0.0012190447,0.001509443,0.000551206,0.00861778],"category_scores_gemma":[0.0017266825,0.00024458117,0.00033489233,0.0016444628,0.0003485097,0.0009258665,0.0010906393,0.0007222187,0.0039647343],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008412343,0.0005463793,0.011129637,0.0007157433,0.00012852215,0.0012063319,0.00047707168,0.12078518,0.060720343,0.07829781,0.17156596,0.55358577],"study_design_scores_gemma":[0.000076857825,0.00019631124,0.0031799327,0.0000502123,0.00003362765,0.0006028651,0.0001436022,0.7412297,0.06617022,0.011743536,0.17652507,0.00004797793],"about_ca_topic_score_codex":0.00419243,"about_ca_topic_score_gemma":0.0032561691,"teacher_disagreement_score":0.00861778,"about_ca_system_score_codex":0.0008517977,"about_ca_system_score_gemma":0.0014104504,"threshold_uncertainty_score":0.028829396},"labels":[],"label_agreement":null},{"id":"W1829288337","doi":"10.1109/acc.1995.532303","title":"Direct computation of infinite transmission zeros","year":2005,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computation; Multivariable calculus; Singular value decomposition; Transfer function; Singular value; Pole–zero plot; Algorithm; Mathematics; LTI system theory; Computer science; Linear system; Transmission (telecommunications); Function (biology); Matrix (chemical analysis); Applied mathematics; Control theory (sociology); Mathematical analysis; Eigenvalues and eigenvectors","score_opus":0.011773031686420188,"score_gpt":0.24681985668181491,"score_spread":0.23504682499539473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1829288337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001625117,0.00009144501,0.99612373,0.000039196893,0.0000424005,0.000027770886,0.000012732542,0.00029257376,0.0017450864],"genre_scores_gemma":[0.0522054,0.00029382043,0.9411527,0.000103782215,0.000069071386,0.00016836553,0.00012209934,0.00022140521,0.005663391],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997465,0.00004408507,0.00001662306,0.000032174463,0.00013673515,0.000023982402],"domain_scores_gemma":[0.9995376,0.00022240366,0.000040029663,0.00006210319,0.00011859718,0.000019374624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004671519,0.0010486136,0.00078463234,0.0011010813,0.0006922695,0.0010306294,0.0010449373,0.0011017717,0.007021956],"category_scores_gemma":[0.0022067062,0.00044531285,0.0006420451,0.0008972876,0.0008109253,0.0013935162,0.0016461649,0.00096175884,0.004074336],"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.00022108696,0.000113240574,0.0006059222,0.00045013588,0.00012142708,0.0005623659,0.00042804438,0.18763775,0.0430447,0.11774257,0.009673823,0.6393989],"study_design_scores_gemma":[0.00007031584,0.0001439817,0.00017382023,0.00005753045,0.000020891124,0.00042227845,0.00006789841,0.90978384,0.014759195,0.04780425,0.026639324,0.000056730103],"about_ca_topic_score_codex":0.001810835,"about_ca_topic_score_gemma":0.002912245,"teacher_disagreement_score":0.007021956,"about_ca_system_score_codex":0.00044730373,"about_ca_system_score_gemma":0.00067697454,"threshold_uncertainty_score":0.023490787},"labels":[],"label_agreement":null},{"id":"W1840032205","doi":"10.1002/nla.1823","title":"On condition numbers for Moore–Penrose inverse and linear least squares problem involving Kronecker products","year":2012,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Kronecker product; Mathematics; Kronecker delta; Combinatorics; Moore–Penrose pseudoinverse; Inverse; Rank (graph theory); Linear least squares; Least-squares function approximation; Product (mathematics); Condition number; Applied mathematics; Upper and lower bounds; Matrix (chemical analysis); Linear model; Statistics; Mathematical analysis; Geometry","score_opus":0.012650691698895641,"score_gpt":0.25487471741778867,"score_spread":0.242224025718893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1840032205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022318464,0.0010624613,0.96481264,0.00064354355,0.00012382082,0.00005170833,0.00015539529,0.00021327136,0.010618729],"genre_scores_gemma":[0.45952874,0.0022675938,0.52312523,0.0005322347,0.0004556984,0.0006309741,0.0007714462,0.00057664764,0.012111316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950788,0.0019862494,0.00024360266,0.000586107,0.0017814544,0.00032374726],"domain_scores_gemma":[0.95607674,0.033265356,0.0022466036,0.0020741108,0.0054079876,0.00092906586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00838121,0.0016912936,0.0012094105,0.0023503697,0.001028229,0.0035547123,0.0016829746,0.0018386102,0.0103401635],"category_scores_gemma":[0.047694445,0.00065682025,0.0007478701,0.0016305215,0.004714347,0.00774918,0.0027251341,0.0046936604,0.0024539183],"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.0003731269,0.0000934403,0.001220709,0.00052735576,0.000044060773,0.00023766386,0.00028221938,0.1333966,0.0114688445,0.7967519,0.0053517614,0.050252326],"study_design_scores_gemma":[0.000016305337,0.000076286036,0.000384989,0.00013041291,0.000013145249,0.00010724507,0.000074336305,0.72739154,0.007621608,0.26164064,0.0024768163,0.000066678695],"about_ca_topic_score_codex":0.0012054627,"about_ca_topic_score_gemma":0.0011187221,"teacher_disagreement_score":0.0103401635,"about_ca_system_score_codex":0.0013614583,"about_ca_system_score_gemma":0.001671343,"threshold_uncertainty_score":0.044324577},"labels":[],"label_agreement":null},{"id":"W1856728957","doi":"10.48550/arxiv.1210.2644","title":"Fourier analysis of the CGMN method for solving the Helmholtz equation","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Helmholtz equation; Convergence (economics); Applied mathematics; Expression (computer science); Krylov subspace; Relaxation (psychology); Helmholtz free energy; Matrix (chemical analysis); Computer science; Fourier transform; Wave equation; Mathematics; Wavenumber; Iterative method; Mathematical optimization; Algorithm; Mathematical analysis; Physics","score_opus":0.09527034350524556,"score_gpt":0.22748425064238953,"score_spread":0.13221390713714398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1856728957","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015782692,0.00025540093,0.9793074,0.00018206263,0.000049029168,0.00004002743,0.00003731337,0.0001745669,0.004171527],"genre_scores_gemma":[0.2223818,0.0005851874,0.7668987,0.00013155576,0.000084559804,0.00020240687,0.00018033317,0.00029851228,0.009236934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996275,0.000116054485,0.0000093788285,0.000028319231,0.00019322163,0.000025563832],"domain_scores_gemma":[0.99922955,0.00039905967,0.0000451693,0.000054942706,0.00023943397,0.000031845073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094174343,0.0005184979,0.00034037174,0.00053685455,0.00037421955,0.00045721175,0.0005690579,0.0006250234,0.003420317],"category_scores_gemma":[0.0026961342,0.00016429195,0.00042068504,0.00045545478,0.0006686966,0.00063316437,0.00071319763,0.0010164266,0.00066424184],"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.00032504168,0.00010697915,0.0011869692,0.00026234039,0.000034053435,0.00023403548,0.00041382195,0.5453643,0.04229641,0.26381427,0.006086787,0.13987495],"study_design_scores_gemma":[0.00001036902,0.00002174909,0.00016323272,0.000010631519,0.0000029302275,0.000048903406,0.000020307114,0.98384273,0.002705794,0.010407555,0.0027582732,0.000007542659],"about_ca_topic_score_codex":0.0025896563,"about_ca_topic_score_gemma":0.001984435,"teacher_disagreement_score":0.003420317,"about_ca_system_score_codex":0.0004870916,"about_ca_system_score_gemma":0.0008881519,"threshold_uncertainty_score":0.011442125},"labels":[],"label_agreement":null},{"id":"W1863391138","doi":"10.1007/s11081-015-9285-y","title":"Announcement: Inaugural Howard Rosenbrock Prize","year":2015,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Financial engineering; Computer science; Mathematical economics; Applied mathematics; Mathematics; Economics; Financial economics","score_opus":0.012194430913530322,"score_gpt":0.19757900221927605,"score_spread":0.18538457130574573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1863391138","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003063891,0.017107503,0.0031912734,0.3737829,0.45175233,0.00008409689,0.0018095761,0.00044905627,0.14875934],"genre_scores_gemma":[0.027783893,0.0065858946,0.0017605942,0.028854216,0.101993956,0.00008275188,0.0008739612,0.0003866421,0.83167815],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99835,0.00017027976,0.0000474543,0.00025063875,0.0007876202,0.00039396694],"domain_scores_gemma":[0.9962722,0.00034161273,0.00012966343,0.00017187429,0.0009390903,0.0021455018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025635667,0.001308324,0.0013536331,0.0012366005,0.001955036,0.0043916483,0.00111098,0.004657059,0.05916597],"category_scores_gemma":[0.006756986,0.000359497,0.00062435394,0.0005463218,0.0009587127,0.0024853034,0.0025696836,0.0056929234,0.040716864],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007039367,0.000021206435,0.000070224094,0.000023802822,0.0000063582424,0.00002269008,0.000005017529,0.00007142219,0.00013307547,0.0053607635,0.9842907,0.009924325],"study_design_scores_gemma":[0.000046645306,0.00006782426,0.0012087235,0.000056891742,0.000011989654,0.00005658591,0.00003895585,0.00060233293,0.00047301938,0.014284698,0.98312885,0.000023539751],"about_ca_topic_score_codex":0.0014157196,"about_ca_topic_score_gemma":0.004018226,"teacher_disagreement_score":0.05916597,"about_ca_system_score_codex":0.0029036729,"about_ca_system_score_gemma":0.0025026165,"threshold_uncertainty_score":0.19792986},"labels":[],"label_agreement":null},{"id":"W18702213","doi":"10.1007/978-1-4614-8453-0_8","title":"Polynomial and Rational Interpolation","year":2013,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Interpolation (computer graphics); Mathematics; Polynomial interpolation; Polynomial; Algebra over a field; Applied mathematics; Pure mathematics; Computer science; Linear interpolation; Computer graphics (images); Mathematical analysis","score_opus":0.011362082332562888,"score_gpt":0.2104292380671829,"score_spread":0.19906715573462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W18702213","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015509637,0.019651238,0.026075179,0.0016794092,0.0017389677,0.000027313275,0.00017287712,0.00030830115,0.9487958],"genre_scores_gemma":[0.031291,0.017646512,0.012430387,0.0004862633,0.00165683,0.000043130098,0.00025810895,0.00039959754,0.9357883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997142,0.000045134697,0.000008455919,0.000040960073,0.00015856899,0.000032619617],"domain_scores_gemma":[0.99984777,0.000042387597,0.000008412935,0.00003452785,0.000049484668,0.00001739172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026532033,0.0010177948,0.00068895594,0.0016527498,0.0010391783,0.0023195613,0.0006834861,0.0005788027,0.05215889],"category_scores_gemma":[0.0008673113,0.0003894063,0.00032579064,0.0026308042,0.001671498,0.0025066088,0.0010797925,0.0022523017,0.022304343],"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.000017315006,0.00002594753,0.00005216392,0.00016226288,0.000005214927,0.000022896169,0.00016743345,0.0009933452,0.000503784,0.6923237,0.13980748,0.16591851],"study_design_scores_gemma":[0.0000056410254,0.000012510162,0.00013736196,0.0001147505,0.0000054059315,0.000079885765,0.00006958735,0.0014259239,0.00041329235,0.25634414,0.7413813,0.000010337241],"about_ca_topic_score_codex":0.0021949552,"about_ca_topic_score_gemma":0.0045671156,"teacher_disagreement_score":0.05215889,"about_ca_system_score_codex":0.0017674565,"about_ca_system_score_gemma":0.0011439943,"threshold_uncertainty_score":0.1744889},"labels":[],"label_agreement":null},{"id":"W1887254306","doi":"10.3968/j.sms.1923845220120402.2001","title":"On the Set of Indices of Convergence for Reducible Tournament Matrices","year":2012,"lang":"en","type":"article","venue":"Studies in mathematical sciences","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tournament; Convergence (economics); Mathematics; Set (abstract data type); Matrix (chemical analysis); Index (typography); Combinatorics; Key (lock); Discrete mathematics; Computer science; Chemistry; Economics","score_opus":0.12971983754746155,"score_gpt":0.39118273863094016,"score_spread":0.2614629010834786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1887254306","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8048441,0.00063271716,0.13718426,0.000966778,0.00016560913,0.000093500385,0.0006265337,0.00034158662,0.055144876],"genre_scores_gemma":[0.9754344,0.00031953503,0.019133657,0.00012920123,0.00018512712,0.0001565464,0.00046503445,0.00009316849,0.004083358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982957,0.00044118753,0.000108932174,0.000285391,0.0006467009,0.00022212203],"domain_scores_gemma":[0.9870767,0.007699855,0.0013232215,0.00090990914,0.0017123596,0.0012780403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027837534,0.0007132126,0.0014206059,0.0036037539,0.0017513552,0.004810809,0.0012003828,0.00083715736,0.005155332],"category_scores_gemma":[0.017187474,0.00034389863,0.0007232802,0.0012253433,0.0034941568,0.0038288063,0.0017511218,0.0028482543,0.0006583306],"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.00020290868,0.000063733496,0.001570706,0.00006067265,0.000028888671,0.00017332708,0.00027968088,0.0049432423,0.0030974762,0.9811416,0.0013930881,0.0070446576],"study_design_scores_gemma":[0.00006837957,0.00010270816,0.0013875286,0.000056091252,0.00001754775,0.0003106921,0.00013920582,0.064295836,0.002702058,0.9287694,0.0021086864,0.00004181666],"about_ca_topic_score_codex":0.00043680528,"about_ca_topic_score_gemma":0.00028660588,"teacher_disagreement_score":0.005155332,"about_ca_system_score_codex":0.0014354945,"about_ca_system_score_gemma":0.0007912464,"threshold_uncertainty_score":0.017246306},"labels":[],"label_agreement":null},{"id":"W188851899","doi":"","title":"Parallel implementation of AISM preconditioner for shifted linear systems of equations","year":2008,"lang":"en","type":"article","venue":"Conference on Scientific Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Preconditioner; Computer science; Linear system; Applied mathematics; Parallel computing; Mathematics; Algorithm; Mathematical analysis; Iterative method","score_opus":0.08990246772613014,"score_gpt":0.3351941745953493,"score_spread":0.24529170686921914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188851899","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13426718,0.0004218669,0.82289696,0.0005678529,0.00047185208,0.00015977865,0.000616746,0.013022105,0.027575713],"genre_scores_gemma":[0.41314518,0.00019300435,0.5670986,0.00017661805,0.00012310412,0.00019159426,0.0011330958,0.000732132,0.01720666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996588,0.000057991143,0.000024214776,0.000043010365,0.00014712385,0.00006880841],"domain_scores_gemma":[0.9995363,0.00009261484,0.000029516603,0.00011792844,0.00018196301,0.000041705345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034925126,0.00062698394,0.00072191324,0.0005572973,0.0006248325,0.00061674224,0.0010230849,0.00048783317,0.01687786],"category_scores_gemma":[0.0009999279,0.00029056004,0.00047701056,0.00071417843,0.0003395139,0.00061393867,0.00091742625,0.0008105789,0.0026851515],"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.0022040207,0.0004185525,0.0036166639,0.0005688474,0.00019223799,0.0005816351,0.0006304979,0.18253979,0.072363205,0.04295245,0.035830077,0.65810204],"study_design_scores_gemma":[0.00020662688,0.000150081,0.0009495477,0.000020440633,0.000031747662,0.00011306076,0.00011019931,0.9430344,0.031303264,0.008699673,0.015353626,0.000027377175],"about_ca_topic_score_codex":0.0067410967,"about_ca_topic_score_gemma":0.013258495,"teacher_disagreement_score":0.01687786,"about_ca_system_score_codex":0.0004961849,"about_ca_system_score_gemma":0.0012956613,"threshold_uncertainty_score":0.05646205},"labels":[],"label_agreement":null},{"id":"W1893802408","doi":"","title":"A note on LU decomposition of the Discrete Fourier Transform matrix","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"York University","funders":"","keywords":"Mathematics; Toeplitz matrix; Vandermonde matrix; Matrix (chemical analysis); Inverse; Matrix decomposition; Triangular matrix; Transpose; Combinatorics; Decomposition; Discrete Fourier transform (general); DFT matrix; LU decomposition; Pure mathematics; Fourier transform; Symmetric matrix; Mathematical analysis; Square matrix; Physics; Fourier analysis; Eigenvalues and eigenvectors; Fractional Fourier transform; Geometry; Invertible matrix; Quantum mechanics","score_opus":0.03514681147008313,"score_gpt":0.2185232277862718,"score_spread":0.18337641631618867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1893802408","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03988093,0.003319236,0.8988096,0.0012326832,0.00086178345,0.00004517593,0.0003312047,0.00044965552,0.055069823],"genre_scores_gemma":[0.6274712,0.0047437823,0.32775137,0.001569363,0.0023806829,0.00023802707,0.0007649822,0.00083646574,0.034244113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995277,0.00015011425,0.000023101458,0.000068304485,0.00017077386,0.000060029928],"domain_scores_gemma":[0.99915195,0.0004003569,0.000075410506,0.000104858795,0.00019519877,0.00007218245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069889775,0.0007363605,0.00049088895,0.0010830546,0.00050299795,0.0015678962,0.00045677676,0.0005946417,0.005563951],"category_scores_gemma":[0.0035254867,0.0002622418,0.0004655531,0.0011221247,0.001173744,0.0017812779,0.00077022455,0.001735873,0.0024951096],"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.000050664814,0.00004137627,0.00031640608,0.0000929942,0.000008331357,0.00034848924,0.00038313644,0.009507678,0.010974677,0.9312522,0.008076337,0.038947705],"study_design_scores_gemma":[0.000014558659,0.00013664686,0.00044710917,0.00006613781,0.000010574391,0.00058669166,0.00015288012,0.18259203,0.009024394,0.7737023,0.03320438,0.00006226727],"about_ca_topic_score_codex":0.0009662989,"about_ca_topic_score_gemma":0.00069286156,"teacher_disagreement_score":0.005563951,"about_ca_system_score_codex":0.00046776526,"about_ca_system_score_gemma":0.00036232037,"threshold_uncertainty_score":0.01861322},"labels":[],"label_agreement":null},{"id":"W1902397492","doi":"10.5539/jmr.v7n2p195","title":"A Method to Construct Sets of Commuting Matrices","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Construct (python library); Extension (predicate logic); Applied mathematics; Algebra over a field; Pure mathematics; Computer science","score_opus":0.19098627718133582,"score_gpt":0.47098246526621884,"score_spread":0.279996188084883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1902397492","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010558691,0.00015200839,0.982015,0.0001252718,0.000119031356,0.00007162559,0.000048981266,0.0001723996,0.0067370646],"genre_scores_gemma":[0.18821786,0.00053342513,0.79280764,0.0003188929,0.00022864396,0.00053858926,0.00024268586,0.0003242329,0.01678801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989133,0.00040055107,0.000081858314,0.00017918964,0.00034019368,0.00008495917],"domain_scores_gemma":[0.99832374,0.0006162362,0.00015272171,0.00036602368,0.0003447103,0.00019663715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019027385,0.0011351807,0.00082630606,0.0031431587,0.0018663938,0.0019023899,0.0017750282,0.0009869646,0.009742313],"category_scores_gemma":[0.003991588,0.00069137086,0.0013281963,0.0014500432,0.0019974692,0.0026786458,0.0039961385,0.0032029718,0.002033969],"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.000024899615,0.0000588485,0.00018642307,0.000081116654,0.000020016581,0.00006949361,0.00032851574,0.0033309392,0.0061890115,0.9597448,0.0010912827,0.0288748],"study_design_scores_gemma":[0.000029514564,0.000107241576,0.00012607245,0.0000507003,0.000021818014,0.00019791845,0.00011817934,0.079202555,0.005739503,0.900429,0.013931414,0.000046017398],"about_ca_topic_score_codex":0.0004888039,"about_ca_topic_score_gemma":0.0006224568,"teacher_disagreement_score":0.009742313,"about_ca_system_score_codex":0.00063388585,"about_ca_system_score_gemma":0.00068286597,"threshold_uncertainty_score":0.032591283},"labels":[],"label_agreement":null},{"id":"W1924859287","doi":"10.1007/978-0-387-09724-4_3","title":"Linear Hamiltonian Systems","year":2008,"lang":"en","type":"book-chapter","venue":"Applied mathematical sciences","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Hamiltonian system; Algebra over a field; Symplectic geometry; Multilinear map; Linear algebra; Hamiltonian (control theory); Mathematics; Multilinear algebra; Nonlinear system; Pure mathematics; Jordan algebra; Mathematical analysis; Algebra representation; Mathematical optimization; Geometry; Physics","score_opus":0.0308866189699191,"score_gpt":0.24351847260754766,"score_spread":0.21263185363762857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1924859287","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059987493,0.0095666675,0.09604001,0.0016567572,0.0013773747,0.000054633292,0.0002582973,0.00040169343,0.8846457],"genre_scores_gemma":[0.11968762,0.011879331,0.03297101,0.0010097262,0.001230316,0.00020228891,0.00053511286,0.00034723262,0.8321374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999083,0.00001953196,0.0000025426798,0.000014245232,0.000046581357,0.000008749699],"domain_scores_gemma":[0.99995255,0.000013745209,0.0000033866845,0.0000099441795,0.000014341883,0.000006078588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011738798,0.0005248762,0.0004102069,0.00049416616,0.000553151,0.0008567574,0.00044198925,0.00044844492,0.030904232],"category_scores_gemma":[0.00022404629,0.00025539158,0.00019704839,0.0006855819,0.0008327319,0.0011159834,0.00068504596,0.0010224476,0.0059191016],"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.0000043366576,0.000020055064,0.000031061296,0.00011834571,0.000007792915,0.000024799347,0.0001242446,0.0024433353,0.001215993,0.88126,0.05474541,0.06000456],"study_design_scores_gemma":[0.0000074631357,0.000016320946,0.00015636589,0.00006548606,0.0000057136454,0.00008807913,0.000057561498,0.007361701,0.00081437617,0.6835996,0.30781537,0.000011935513],"about_ca_topic_score_codex":0.0005411211,"about_ca_topic_score_gemma":0.0009868612,"teacher_disagreement_score":0.030904232,"about_ca_system_score_codex":0.00056545244,"about_ca_system_score_gemma":0.00043271563,"threshold_uncertainty_score":0.10338497},"labels":[],"label_agreement":null},{"id":"W1925194265","doi":"10.11650/tjm.10.2006.872","title":"Elliptic numerical ranges of 4 × 4 matrices","year":2006,"lang":"en","type":"article","venue":"Taiwanese Journal of Mathematics","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":"","keywords":"Mathematics; Numerical range; Complex matrix; Matrix (chemical analysis); Product (mathematics); Range (aeronautics); Plane (geometry); Set (abstract data type); Numerical analysis; Complex plane; Pure mathematics; Mathematical analysis; Combinatorics; Geometry","score_opus":0.009255126997750086,"score_gpt":0.23397817766127413,"score_spread":0.22472305066352405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1925194265","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86118144,0.00066575344,0.09369706,0.0002560073,0.000050461476,0.00004902218,0.00032142128,0.00023723027,0.043541588],"genre_scores_gemma":[0.9878351,0.00013391995,0.009896747,0.000039175346,0.00003445659,0.000028977858,0.00022395354,0.000024679674,0.0017829227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852353,0.0004130677,0.00012809559,0.00020746492,0.00056530343,0.00016256025],"domain_scores_gemma":[0.99239993,0.0040466823,0.0014731628,0.0005643299,0.0009866109,0.00052921905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001415994,0.00038438002,0.00027513612,0.0019993912,0.00046849417,0.0013961976,0.00046626967,0.00042062893,0.0047182706],"category_scores_gemma":[0.012783289,0.00019319216,0.0002516895,0.0005743297,0.001921056,0.0022880505,0.0017454278,0.0007306402,0.000846379],"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.0035633508,0.00015938151,0.024641303,0.00053765514,0.000074716285,0.0019914075,0.002010302,0.061933596,0.09131921,0.715333,0.0031739164,0.09526222],"study_design_scores_gemma":[0.00016913992,0.0009166563,0.014648029,0.00030040715,0.000035259636,0.0028710684,0.0019534384,0.20431541,0.12863962,0.6242609,0.0216788,0.00021126143],"about_ca_topic_score_codex":0.00020571456,"about_ca_topic_score_gemma":0.0000955535,"teacher_disagreement_score":0.0047182706,"about_ca_system_score_codex":0.00028989042,"about_ca_system_score_gemma":0.00017105584,"threshold_uncertainty_score":0.015784204},"labels":[],"label_agreement":null},{"id":"W1934623130","doi":"10.1007/s10878-017-0184-3","title":"A characterization of linearizable instances of the quadratic minimum spanning tree problem","year":2017,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Optimization","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Characterization (materials science); Bipartite graph; Minimum spanning tree; Combinatorics; Mathematics; Spanning tree; Discrete mathematics; Quadratic equation; Graph","score_opus":0.01362348622236394,"score_gpt":0.24508003233905526,"score_spread":0.2314565461166913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1934623130","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65764666,0.00073070306,0.263505,0.005040442,0.00018122945,0.00037984445,0.0029462108,0.0009130871,0.0686568],"genre_scores_gemma":[0.96127725,0.0004347275,0.024136225,0.0005505093,0.0003350451,0.00018712398,0.004062824,0.00028660742,0.008729541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824023,0.00036432536,0.000101196514,0.0005044463,0.0004238088,0.00036613535],"domain_scores_gemma":[0.98852587,0.006815827,0.0019602464,0.00089964276,0.00095029466,0.00084811234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010752912,0.0011911052,0.0012590715,0.0015139283,0.0009782028,0.0042454638,0.0029502022,0.0020377114,0.014032751],"category_scores_gemma":[0.017355258,0.00073920656,0.000701295,0.0033105828,0.0012661604,0.0057677124,0.0019010765,0.0039705667,0.00086711184],"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.001653946,0.0019721214,0.012087587,0.0011456555,0.00020463983,0.0015265424,0.0011670021,0.1786722,0.022374151,0.64181644,0.045286536,0.092093155],"study_design_scores_gemma":[0.0001944266,0.00028207115,0.0029729004,0.00007445564,0.00005993586,0.0011138963,0.0005405662,0.46566302,0.0031434125,0.51951265,0.0064013214,0.000041302792],"about_ca_topic_score_codex":0.0011565319,"about_ca_topic_score_gemma":0.0013607176,"teacher_disagreement_score":0.014032751,"about_ca_system_score_codex":0.0013217373,"about_ca_system_score_gemma":0.0009165193,"threshold_uncertainty_score":0.0469442},"labels":[],"label_agreement":null},{"id":"W1938615502","doi":"10.3233/jcm-2006-61-407","title":"O(n3) g-inversion-free noniterative near-consistent linear system solver for minimum-norm least-squares and nonnegative solutions","year":2006,"lang":"en","type":"article","venue":"Journal of Computational Methods in Sciences and Engineering","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Inversion (geology); Solver; Norm (philosophy); Least-squares function approximation; Applied mathematics; Mathematical optimization; Statistics; Law; Geology; Political science","score_opus":0.028176145752144173,"score_gpt":0.3109989599341049,"score_spread":0.28282281418196076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1938615502","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002512625,0.000033019736,0.99185,0.00013236997,0.000029567693,0.00005944329,0.00006889758,0.0016004515,0.0037136476],"genre_scores_gemma":[0.04091929,0.000036253707,0.9523049,0.00013761857,0.000025570725,0.00027888222,0.0002083996,0.00052470656,0.0055643436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995122,0.0001427797,0.000029008865,0.00008012347,0.00018920358,0.000046705172],"domain_scores_gemma":[0.99803525,0.0012005455,0.000121230274,0.00027176898,0.00031634836,0.00005487348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081724534,0.0014877144,0.0007041349,0.0004477877,0.0006336923,0.0009802637,0.0023883497,0.0012903105,0.029237904],"category_scores_gemma":[0.004156297,0.00046448415,0.00055753643,0.00068041554,0.00073912664,0.0010791508,0.001911459,0.0019293535,0.009131305],"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.00062380865,0.00023124303,0.00097420864,0.0007357009,0.00012257637,0.0003607526,0.0005615261,0.181512,0.020073341,0.07530869,0.030867359,0.68862873],"study_design_scores_gemma":[0.0002010068,0.00007940354,0.00023722705,0.000032121297,0.00002506524,0.00017263129,0.00011529944,0.94981056,0.008737556,0.02913295,0.011425111,0.000031032538],"about_ca_topic_score_codex":0.003194397,"about_ca_topic_score_gemma":0.010399904,"teacher_disagreement_score":0.029237904,"about_ca_system_score_codex":0.00063982746,"about_ca_system_score_gemma":0.0015716921,"threshold_uncertainty_score":0.09781051},"labels":[],"label_agreement":null},{"id":"W1943663045","doi":"","title":"Characterizing the Representer Theorem","year":2013,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"","keywords":"Representer theorem; Kernel (algebra); Extension (predicate logic); Simple (philosophy); Mathematics; Computer science; Applied mathematics; Mathematical optimization; Kernel method; Kernel principal component analysis; Discrete mathematics; Support vector machine; Artificial intelligence","score_opus":0.011629919053142403,"score_gpt":0.22455406246905701,"score_spread":0.21292414341591462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1943663045","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039600838,0.00093462126,0.9385788,0.001845881,0.00014762844,0.00008116983,0.0003064606,0.00031970599,0.018184833],"genre_scores_gemma":[0.7427279,0.0026150176,0.2353484,0.0015595078,0.0010589422,0.0005888235,0.00097565824,0.0007441411,0.01438169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950421,0.002047472,0.00028100473,0.0009041398,0.0012843764,0.0004408241],"domain_scores_gemma":[0.9791093,0.013136052,0.0019137857,0.0019197662,0.0033204623,0.0006006614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009632519,0.0011084329,0.0013372393,0.00206079,0.0010932945,0.0032714303,0.001404932,0.0032596258,0.00568526],"category_scores_gemma":[0.043111756,0.00067258393,0.0010645915,0.001008787,0.004535081,0.007143763,0.0036448557,0.004563936,0.0020184221],"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.000061307124,0.000042647465,0.00051041483,0.00010882095,0.000022472905,0.00014077267,0.00015429303,0.016060546,0.005204257,0.9633991,0.0021646451,0.012130637],"study_design_scores_gemma":[0.000041348143,0.00015864987,0.0005018645,0.00007526556,0.000019375491,0.00030007135,0.0000778661,0.16664137,0.006832869,0.8186739,0.006618988,0.000058285095],"about_ca_topic_score_codex":0.00054237543,"about_ca_topic_score_gemma":0.0003780678,"teacher_disagreement_score":0.009632519,"about_ca_system_score_codex":0.0011708088,"about_ca_system_score_gemma":0.0015018607,"threshold_uncertainty_score":0.050942183},"labels":[],"label_agreement":null},{"id":"W195191818","doi":"","title":"Applications Related to the Generalized Seidel Matrix .","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matrix (chemical analysis); Applied mathematics; Chemistry; Chromatography","score_opus":0.007531413510922716,"score_gpt":0.25724883585974734,"score_spread":0.24971742234882463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195191818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07273354,0.02988951,0.5093397,0.0061115157,0.004663869,0.00011492274,0.00050811894,0.0013461757,0.37529263],"genre_scores_gemma":[0.7041817,0.019248381,0.17267127,0.001638913,0.003828682,0.00015307791,0.0005428134,0.0003925896,0.09734264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995372,0.00014020184,0.000021263844,0.00008172701,0.0001642404,0.000055429147],"domain_scores_gemma":[0.99908626,0.00038581507,0.000083617626,0.00015984073,0.00017518127,0.00010931431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040475087,0.0008201243,0.0006414421,0.0018391152,0.0011175547,0.001810722,0.0006530129,0.0009117664,0.011564182],"category_scores_gemma":[0.0027555355,0.0002884953,0.0006079009,0.00217779,0.0014449051,0.0019261469,0.0017373519,0.0022704613,0.0031186948],"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.00002726969,0.000032143376,0.0002670375,0.000125515,0.000015534273,0.00016364295,0.00013557734,0.003628487,0.001475215,0.950584,0.009759451,0.03378617],"study_design_scores_gemma":[0.000005127876,0.000016386823,0.00012594211,0.00002759877,0.0000053691165,0.0002822615,0.00006434868,0.01331497,0.00071009377,0.96510524,0.020332191,0.000010484766],"about_ca_topic_score_codex":0.0008671527,"about_ca_topic_score_gemma":0.0015809768,"teacher_disagreement_score":0.011564182,"about_ca_system_score_codex":0.0008407203,"about_ca_system_score_gemma":0.0005907915,"threshold_uncertainty_score":0.038686097},"labels":[],"label_agreement":null},{"id":"W1959145981","doi":"10.1090/s0002-9947-02-03078-7","title":"Inverse spectral theory of finite Jacobi matrices","year":2002,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Technische Universität Darmstadt","keywords":"Mathematics; Scalar (mathematics); Inverse; Orthogonal polynomials; Finite set; Combinatorics; Pure mathematics; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.016329855787402273,"score_gpt":0.2323530823231753,"score_spread":0.21602322653577305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1959145981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060385454,0.00072996225,0.85892475,0.001744244,0.00047694374,0.00004731175,0.00020022273,0.0004010673,0.07709009],"genre_scores_gemma":[0.72886395,0.0012756556,0.21753986,0.000966715,0.00048897706,0.00019506225,0.00050588255,0.00067313964,0.049490783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995041,0.00011624208,0.00001767412,0.00011141863,0.00016854481,0.000082063256],"domain_scores_gemma":[0.9993383,0.0002471669,0.000071063325,0.00010962694,0.00014507027,0.000088656765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008410267,0.00087160023,0.0007539022,0.001384165,0.00095035555,0.0019872682,0.0016510685,0.0013497537,0.007821386],"category_scores_gemma":[0.0028687625,0.00043632815,0.0009530158,0.00064306875,0.0026032163,0.0032791875,0.0014911011,0.0022888985,0.002092682],"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.000010386716,0.00001961594,0.00008234899,0.000057356825,0.000005716463,0.000039043443,0.000102624144,0.009667116,0.0009674978,0.98223776,0.0017299149,0.0050806026],"study_design_scores_gemma":[0.0000054369425,0.000010231434,0.000058310055,0.000021180402,0.0000024916933,0.00004310377,0.000077154546,0.09309043,0.00077635486,0.90341944,0.0024825654,0.000013358007],"about_ca_topic_score_codex":0.0015889367,"about_ca_topic_score_gemma":0.0013104273,"teacher_disagreement_score":0.007821386,"about_ca_system_score_codex":0.0009059954,"about_ca_system_score_gemma":0.0011203208,"threshold_uncertainty_score":0.026165128},"labels":[],"label_agreement":null},{"id":"W1963699159","doi":"10.1016/s0024-3795(00)00084-7","title":"A fast eigenvalue algorithm for Hankel matrices","year":2000,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Lanczos resampling; Hankel matrix; Lanczos algorithm; Matrix (chemical analysis); Type (biology); Combinatorics; Scheme (mathematics); Algorithm; Applied mathematics; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.010154857934816401,"score_gpt":0.2504637713931257,"score_spread":0.2403089134583093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963699159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020537477,0.000080011756,0.9953088,0.00007295679,0.00009687464,0.000035762012,0.000052176434,0.001287117,0.0010124644],"genre_scores_gemma":[0.030670064,0.00015730217,0.9620131,0.000109734436,0.00011938284,0.00017098163,0.00027448146,0.000579245,0.005905826],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988926,0.00022598296,0.000057875,0.00017604118,0.00053734327,0.00011010779],"domain_scores_gemma":[0.9978265,0.0007639106,0.000087284236,0.00043137537,0.00075743475,0.00013338926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009840764,0.0012801565,0.0011874695,0.0011984993,0.0011808256,0.0016314167,0.0015074076,0.0013315951,0.012203171],"category_scores_gemma":[0.0047484753,0.00078324694,0.00073009834,0.0015411063,0.00061223324,0.0025243305,0.0022199252,0.0020758682,0.007684356],"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.00051984645,0.00022663157,0.00043565058,0.00024104015,0.000117143456,0.0002240141,0.000264112,0.06549943,0.034761705,0.07831996,0.023864355,0.795526],"study_design_scores_gemma":[0.00018615722,0.00013590087,0.0003009439,0.000037728634,0.000030348207,0.00029576276,0.000089456975,0.84630454,0.01921752,0.11438458,0.01893039,0.00008667507],"about_ca_topic_score_codex":0.001756538,"about_ca_topic_score_gemma":0.0033859725,"teacher_disagreement_score":0.012203171,"about_ca_system_score_codex":0.00048365173,"about_ca_system_score_gemma":0.0014158504,"threshold_uncertainty_score":0.04082364},"labels":[],"label_agreement":null},{"id":"W1963899424","doi":"10.1016/j.cam.2003.09.050","title":"Displacement rank of the Drazin inverse","year":2004,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Drazin inverse; Rank (graph theory); Displacement (psychology); Inverse; Algebra over a field; Mathematical analysis; Geometry; Pure mathematics; Combinatorics","score_opus":0.00970314809131112,"score_gpt":0.22880365565421507,"score_spread":0.21910050756290395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963899424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40294012,0.0012828456,0.51709634,0.0028518937,0.00056481635,0.00007202376,0.001441937,0.00060134707,0.07314861],"genre_scores_gemma":[0.9262547,0.00074218254,0.042705443,0.00045824968,0.00028708958,0.000045255103,0.0007830272,0.00023959157,0.028484458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936837,0.00016205282,0.000035256468,0.00011174091,0.00023423095,0.00008835405],"domain_scores_gemma":[0.99717546,0.0010632027,0.00031781595,0.00043356107,0.0007098378,0.00030011398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008964242,0.00054505817,0.000494197,0.001289494,0.00054428796,0.0025154732,0.0005555151,0.00069407886,0.016686918],"category_scores_gemma":[0.004647028,0.00029682575,0.0002528992,0.0005944799,0.0015060266,0.0022330806,0.0014300245,0.0013138127,0.0027191548],"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.00046948533,0.00008442321,0.0017220217,0.00020573728,0.00002840592,0.00025347518,0.00040848606,0.015058911,0.022765638,0.86125946,0.009608775,0.08813511],"study_design_scores_gemma":[0.000055938937,0.00026053187,0.0020583842,0.000056272012,0.000021723241,0.00090800156,0.00051633845,0.122099265,0.017403658,0.83994573,0.016553184,0.00012102278],"about_ca_topic_score_codex":0.0006389895,"about_ca_topic_score_gemma":0.00080901664,"teacher_disagreement_score":0.016686918,"about_ca_system_score_codex":0.000311406,"about_ca_system_score_gemma":0.00077831594,"threshold_uncertainty_score":0.055823326},"labels":[],"label_agreement":null},{"id":"W1963930734","doi":"10.1016/s0024-3795(00)00062-8","title":"Modifying the power method in max algebra","year":2001,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Linear algebra; Matrix (chemical analysis); Algebra over a field; Matrix algebra; Power (physics); Power iteration; Combinatorics; Algorithm; Pure mathematics; Iterative method; Geometry","score_opus":0.017395894687048764,"score_gpt":0.28526135258479535,"score_spread":0.2678654578977466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963930734","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066756704,0.0006219617,0.9556805,0.0014244778,0.0010995099,0.000039952974,0.00013091159,0.0006254891,0.033701524],"genre_scores_gemma":[0.28620005,0.0017542064,0.6318653,0.0026649786,0.003388431,0.00022443906,0.00035814932,0.0029279438,0.070616454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733716,0.0012492771,0.00011007261,0.0004550648,0.000667799,0.0001805286],"domain_scores_gemma":[0.9957546,0.0017460732,0.0001549892,0.0014849472,0.0006581494,0.00020128704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032112065,0.0011204275,0.0012271835,0.0018765186,0.0017000304,0.002393371,0.0022194309,0.00091044075,0.015414534],"category_scores_gemma":[0.011705939,0.00064048544,0.001491768,0.0024817917,0.0046201474,0.010782359,0.003937688,0.004313029,0.0064854757],"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.00006670761,0.000041132775,0.00013887676,0.000062557505,0.000017894863,0.000035334175,0.00015414505,0.0027686306,0.0009519342,0.9366578,0.0065132137,0.052591827],"study_design_scores_gemma":[0.000011690091,0.000018146764,0.000045859524,0.000013771838,0.00000864161,0.00003835589,0.000018683333,0.013517251,0.0011123775,0.96863323,0.01656552,0.000016451871],"about_ca_topic_score_codex":0.0011046187,"about_ca_topic_score_gemma":0.0015206401,"teacher_disagreement_score":0.015414534,"about_ca_system_score_codex":0.001092137,"about_ca_system_score_gemma":0.0010842811,"threshold_uncertainty_score":0.05156678},"labels":[],"label_agreement":null},{"id":"W1964848847","doi":"10.1080/03081080008818648","title":"Eigenvalues of products of matrices and submatrices in certain positivity classes","year":2000,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Converse; Eigenvalues and eigenvectors; Combinatorics; Positive-definite matrix; Block matrix; Product (mathematics); Matrix (chemical analysis); Matrix analysis; Pure mathematics","score_opus":0.010016224445870915,"score_gpt":0.24921141558118665,"score_spread":0.23919519113531573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964848847","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5321228,0.00037442398,0.40715516,0.00071354175,0.00009475073,0.00009058379,0.00065042404,0.00042088347,0.058377467],"genre_scores_gemma":[0.9664413,0.00025302908,0.024423134,0.00012795342,0.00012515398,0.00012236432,0.00030220402,0.00013776252,0.008067121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988881,0.0002482035,0.000064230335,0.00032228723,0.0003011132,0.0001761734],"domain_scores_gemma":[0.995488,0.0022415165,0.00089561526,0.0003654117,0.0006091127,0.00040032473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001520504,0.0006866542,0.00043096876,0.0016553813,0.0010317989,0.0022091821,0.000567067,0.0006338526,0.011464413],"category_scores_gemma":[0.0085009355,0.0005095068,0.00040946266,0.0008712909,0.0023390641,0.003024017,0.0011216775,0.00086137326,0.0012482491],"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.00043119822,0.00009665449,0.005105392,0.00020930098,0.0000537472,0.00071067724,0.00086976064,0.013444126,0.019120552,0.9034676,0.0067611206,0.04972994],"study_design_scores_gemma":[0.000033568307,0.00009349276,0.004845396,0.000056075198,0.000016967942,0.0010289085,0.00043264887,0.07327595,0.005299601,0.90922403,0.0056358757,0.000057455258],"about_ca_topic_score_codex":0.00034732115,"about_ca_topic_score_gemma":0.00040027854,"teacher_disagreement_score":0.011464413,"about_ca_system_score_codex":0.00048706628,"about_ca_system_score_gemma":0.0003568701,"threshold_uncertainty_score":0.03835231},"labels":[],"label_agreement":null},{"id":"W1965418516","doi":"10.1063/1.4821348","title":"Solving the Schroedinger equation using Smolyak interpolants","year":2013,"lang":"en","type":"article","venue":"The Journal of Chemical Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Collocation (remote sensing); Eigenvalues and eigenvectors; Schrödinger equation; Applied mathematics; Mathematics; Collocation method; Grid; Matrix (chemical analysis); Wave function; Sparse grid; Mathematical analysis; Computer science; Differential equation; Physics; Ordinary differential equation; Geometry; Quantum mechanics","score_opus":0.030933479462752243,"score_gpt":0.2565574113274161,"score_spread":0.22562393186466387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965418516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011086831,0.00009180267,0.9868255,0.00007751341,0.00004294264,0.000019463496,0.000018087658,0.00007541672,0.0017623785],"genre_scores_gemma":[0.25470316,0.0003726386,0.73959106,0.00012894376,0.000063516396,0.00015895697,0.0001237571,0.0001630428,0.00469497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996221,0.0001233474,0.000025247033,0.000035643498,0.00015939535,0.000034130382],"domain_scores_gemma":[0.9994505,0.00031478758,0.000043603366,0.00007866126,0.00008921023,0.00002325422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008797626,0.00036061154,0.0005935868,0.00054327777,0.0005716624,0.00058230915,0.00094363,0.0009773476,0.001605673],"category_scores_gemma":[0.0015156094,0.00028494388,0.0005675163,0.0004923897,0.0007783229,0.001193372,0.00094774907,0.0010929519,0.0006021113],"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.00012932543,0.00010890416,0.0010599274,0.00020692156,0.000051617142,0.00023068582,0.0002501753,0.51398855,0.021270277,0.4003714,0.0015971096,0.060735177],"study_design_scores_gemma":[0.000010656381,0.000020057501,0.000054955854,0.0000065356203,0.0000025193121,0.000015802716,0.000011095454,0.97368085,0.001675673,0.02327444,0.001239202,0.000008227548],"about_ca_topic_score_codex":0.0017289888,"about_ca_topic_score_gemma":0.0019701116,"teacher_disagreement_score":0.0017289888,"about_ca_system_score_codex":0.00038323537,"about_ca_system_score_gemma":0.00076741306,"threshold_uncertainty_score":0.0053714514},"labels":[],"label_agreement":null},{"id":"W1966269284","doi":"10.1007/s11854-015-0005-5","title":"Vector energy and large deviation","year":2015,"lang":"fr","type":"article","venue":"Journal d Analyse Mathématique","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Measure (data warehouse); Probability measure; Type (biology); Positive-definite matrix; Discretization; Zero (linguistics); Energy (signal processing); Markov chain; Sequence (biology); Physics; Mathematical analysis; Quantum mechanics; Statistics; Eigenvalues and eigenvectors","score_opus":0.025933272769144502,"score_gpt":0.2675394655212217,"score_spread":0.2416061927520772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966269284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31058928,0.012464176,0.5012781,0.034019273,0.0035425646,0.000067594716,0.0004204232,0.00091024797,0.13670835],"genre_scores_gemma":[0.93402725,0.0029164278,0.015919482,0.0014017175,0.0020113327,0.000086718166,0.00023217988,0.00042551194,0.042979352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887294,0.00047369726,0.000055709115,0.00015082714,0.00034523066,0.000101600766],"domain_scores_gemma":[0.99152815,0.005381262,0.00072643533,0.00076068816,0.0008818996,0.00072158314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034041589,0.0010889294,0.0019378591,0.0025067304,0.0012761647,0.0032971075,0.0019152517,0.002729888,0.008493519],"category_scores_gemma":[0.015379458,0.0006239262,0.00086291856,0.0016809994,0.004801151,0.0070865136,0.003606525,0.004057701,0.0009129246],"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.000021816915,0.000015008223,0.00015384317,0.00002683089,0.00001816941,0.000031078314,0.0000334005,0.003752026,0.00019989241,0.9930647,0.0009088718,0.0017743474],"study_design_scores_gemma":[0.000007376499,0.0000074745276,0.00017923799,0.00000806456,0.0000049659866,0.000034596094,0.000015347297,0.03009601,0.00007729904,0.9690242,0.00053519284,0.000010167257],"about_ca_topic_score_codex":0.00072385353,"about_ca_topic_score_gemma":0.00047740358,"teacher_disagreement_score":0.008493519,"about_ca_system_score_codex":0.0013403505,"about_ca_system_score_gemma":0.00082813326,"threshold_uncertainty_score":0.028413653},"labels":[],"label_agreement":null},{"id":"W1966533816","doi":"10.1137/110843137","title":"A Structure-Preserving Curve for Symplectic Pairs and Its Applications","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Symplectic geometry; Parameterized complexity; Monotonic function; Numerical analysis; Fixed-point iteration; Convergence (economics); Newton's method; Hermitian matrix; Positive-definite matrix; Matrix (chemical analysis); Mathematical analysis; Fixed point; Applied mathematics; Eigenvalues and eigenvectors; Pure mathematics; Combinatorics; Nonlinear system","score_opus":0.013262611756757872,"score_gpt":0.2915573135472009,"score_spread":0.278294701790443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966533816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41793826,0.0011701412,0.55496645,0.0007908976,0.00008214622,0.00016194498,0.00011421679,0.0003014244,0.024474509],"genre_scores_gemma":[0.8653609,0.0008297728,0.12604739,0.000069837464,0.00007089315,0.00013370797,0.00011768153,0.00015452816,0.0072152056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969053,0.00008517459,0.00001750793,0.00006884033,0.00010126972,0.00003664799],"domain_scores_gemma":[0.9989579,0.0003580506,0.0001945877,0.00012926832,0.00019153363,0.00016869031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006503462,0.00065565633,0.00051848456,0.001447076,0.0012473488,0.0010606697,0.0006079841,0.0011047049,0.0030944617],"category_scores_gemma":[0.0054379646,0.0003672505,0.00068504823,0.0006406435,0.0021814841,0.0015739301,0.0023978336,0.0012813604,0.0004894651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007989501,0.000047089798,0.0015009545,0.00017779709,0.0000151743625,0.00022995338,0.00054807373,0.04795787,0.011851179,0.9051963,0.00068900053,0.031706735],"study_design_scores_gemma":[0.00004570228,0.00040132474,0.0011577834,0.00008780233,0.000013438547,0.00077419216,0.00027068864,0.5135351,0.009793879,0.45929956,0.0145683745,0.000052124604],"about_ca_topic_score_codex":0.00050047226,"about_ca_topic_score_gemma":0.00020258054,"teacher_disagreement_score":0.0030944617,"about_ca_system_score_codex":0.0008189849,"about_ca_system_score_gemma":0.00057012006,"threshold_uncertainty_score":0.0103520155},"labels":[],"label_agreement":null},{"id":"W1966982704","doi":"10.1016/j.laa.2007.02.023","title":"A class of oscillatory matrices with exponent n−1","year":2007,"lang":"en","type":"article","venue":"Linear Algebra and its 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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Exponent; Class (philosophy); Integer (computer science); Matrix (chemical analysis); Combinatorics; Pure mathematics; Chemistry","score_opus":0.008657953101112932,"score_gpt":0.23699880422820482,"score_spread":0.2283408511270919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966982704","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6303622,0.0012816124,0.31146505,0.00089076144,0.00045662583,0.000098466844,0.00033819958,0.00041679552,0.054690268],"genre_scores_gemma":[0.960291,0.0006678236,0.0201011,0.00024119318,0.00040455326,0.0000774213,0.00025294453,0.00008684511,0.017877124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997435,0.000037481153,0.000011634096,0.00006476274,0.00009669932,0.00004588329],"domain_scores_gemma":[0.9988288,0.0003654326,0.00030262655,0.00013196086,0.00021254337,0.00015851138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032550658,0.0007547274,0.00030265382,0.0017935452,0.00073156995,0.0013221534,0.0005359879,0.0006383354,0.0041301968],"category_scores_gemma":[0.002785973,0.00021117582,0.00026723964,0.0009682375,0.00088248815,0.0012345844,0.0008456712,0.00078094366,0.00058214075],"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.00027976595,0.00012192894,0.0048686257,0.0001457265,0.00003497009,0.0011567347,0.0006845199,0.0043733553,0.028910622,0.88359296,0.0056930184,0.070137784],"study_design_scores_gemma":[0.000104210754,0.00018919395,0.005930979,0.00009497804,0.000044164342,0.0036276646,0.0004956085,0.11232536,0.0091617135,0.840067,0.027873263,0.00008582899],"about_ca_topic_score_codex":0.00029443734,"about_ca_topic_score_gemma":0.00032755057,"teacher_disagreement_score":0.0041301968,"about_ca_system_score_codex":0.00030150037,"about_ca_system_score_gemma":0.00027977265,"threshold_uncertainty_score":0.0138168335},"labels":[],"label_agreement":null},{"id":"W1966987559","doi":"10.1016/s0096-3003(03)00203-0","title":"Rank equalities and inequalities for Kronecker products of matrices with applications","year":2003,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Kronecker delta; Rank (graph theory); Mathematics; Kronecker product; Inequality; Algebra over a field; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.022644885784818193,"score_gpt":0.2561129767535826,"score_spread":0.2334680909687644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966987559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048968304,0.0070562297,0.87954,0.002570674,0.00074154016,0.00009362447,0.0008849917,0.00020823105,0.059936386],"genre_scores_gemma":[0.6806462,0.011886742,0.25785735,0.0017772053,0.0032140608,0.00045610144,0.0017592462,0.00048050532,0.04192256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962656,0.0013418733,0.00033168934,0.0005661722,0.0010510007,0.00044369916],"domain_scores_gemma":[0.97328794,0.019191986,0.0018043418,0.0014433048,0.003367794,0.0009047424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049210344,0.0017164528,0.0010785732,0.0028790832,0.0013822103,0.0054476624,0.0018524606,0.0012738573,0.011271849],"category_scores_gemma":[0.021796126,0.00078450487,0.0012176649,0.0036173156,0.004246258,0.009435207,0.0028476408,0.00579882,0.0020714803],"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.00013464168,0.000054141216,0.00042139355,0.00024527265,0.00003069034,0.00016545723,0.00041178355,0.005580937,0.0016577019,0.9564924,0.0046597715,0.030145828],"study_design_scores_gemma":[0.0000114561,0.000046800324,0.00028074894,0.000046284382,0.000019164494,0.0001888085,0.00013168844,0.02087566,0.001010314,0.9732405,0.004118967,0.000029742732],"about_ca_topic_score_codex":0.0011851839,"about_ca_topic_score_gemma":0.0021689178,"teacher_disagreement_score":0.011271849,"about_ca_system_score_codex":0.0011752896,"about_ca_system_score_gemma":0.0011354598,"threshold_uncertainty_score":0.037708163},"labels":[],"label_agreement":null},{"id":"W1967985444","doi":"10.1016/j.laa.2013.05.009","title":"An augmented analysis of the perturbed two-sided Lanczos tridiagonalization process","year":2013,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Lanczos resampling; Mathematics; Lanczos algorithm; Process (computing); Applied mathematics; Eigenvalues and eigenvectors; Computer science; Quantum mechanics; Physics","score_opus":0.008376904718365082,"score_gpt":0.26709523199772434,"score_spread":0.25871832727935923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967985444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03024871,0.0003971324,0.9548456,0.00034609513,0.00017514694,0.000046923917,0.00010955252,0.000272451,0.013558459],"genre_scores_gemma":[0.7934533,0.0008340788,0.166142,0.00032025602,0.0003234485,0.0001325124,0.00040311553,0.00044743545,0.03794389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995245,0.00014938856,0.000014322461,0.000054111508,0.00019584558,0.00006181331],"domain_scores_gemma":[0.9988663,0.00051203504,0.00011641178,0.00011660878,0.00031199076,0.00007664871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007503586,0.000711254,0.0007103461,0.0004942938,0.00045343375,0.0014628884,0.001076975,0.000933288,0.008035255],"category_scores_gemma":[0.0031427448,0.0002768053,0.0005776919,0.00064024836,0.0011479099,0.0015774235,0.0008399332,0.0010653767,0.00092881883],"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.00028135363,0.000099178396,0.000605156,0.00021763779,0.00006646937,0.00032137186,0.00019557387,0.61534667,0.009980225,0.33893126,0.0041333362,0.029821785],"study_design_scores_gemma":[0.0000045019424,0.000010823064,0.00005564724,0.000004708165,0.0000031636569,0.000014958366,0.000009596471,0.98248106,0.0005789991,0.0162232,0.0006073758,0.00000595542],"about_ca_topic_score_codex":0.0037813308,"about_ca_topic_score_gemma":0.0026105312,"teacher_disagreement_score":0.008035255,"about_ca_system_score_codex":0.0005345537,"about_ca_system_score_gemma":0.00143398,"threshold_uncertainty_score":0.026880562},"labels":[],"label_agreement":null},{"id":"W1968238539","doi":"10.1016/j.laa.2006.12.010","title":"Isospectral flows preserving some centrosymmetric structures","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Isospectral; Combinatorics; Centrosymmetric matrix; Skew-symmetric matrix; Diagonal matrix; Diagonal; Matrix (chemical analysis); Graph; Symmetric matrix; Pure mathematics; Nonnegative matrix; Eigenvalues and eigenvectors; Square matrix; Physics; Geometry","score_opus":0.006877994144015026,"score_gpt":0.22490723821913083,"score_spread":0.2180292440751158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968238539","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7508793,0.00031115641,0.18229055,0.00094680116,0.00034245604,0.000061612314,0.00015719728,0.00024384186,0.0647671],"genre_scores_gemma":[0.93765545,0.00047073734,0.027881209,0.0003814138,0.0004219831,0.00006231487,0.00015979452,0.00021891433,0.032748133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997631,0.000047717967,0.000010559374,0.00004306386,0.000083730716,0.000051752777],"domain_scores_gemma":[0.9992631,0.00016006948,0.00017234737,0.000104076986,0.00013271428,0.00016768707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004941009,0.00058556785,0.00041623056,0.001713616,0.0014240667,0.0015222505,0.0005811069,0.0007928665,0.0057186685],"category_scores_gemma":[0.0015664353,0.0002875611,0.0005690934,0.00089532346,0.0013532953,0.0031890902,0.0011877838,0.0017236663,0.0005698856],"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.000032354325,0.00003945717,0.00013919528,0.00001378517,0.0000041402195,0.00008315457,0.00010480651,0.001432467,0.0024791276,0.98865545,0.00073681754,0.0062790965],"study_design_scores_gemma":[0.000017411683,0.000030458195,0.0002873639,0.000005607274,0.000006375495,0.000183071,0.00010984349,0.016987113,0.0016950655,0.9789531,0.0017119179,0.000012613854],"about_ca_topic_score_codex":0.00041040016,"about_ca_topic_score_gemma":0.00045783384,"teacher_disagreement_score":0.0057186685,"about_ca_system_score_codex":0.00054300914,"about_ca_system_score_gemma":0.0005122279,"threshold_uncertainty_score":0.019130886},"labels":[],"label_agreement":null},{"id":"W1968250174","doi":"10.1137/040620047","title":"A Multipreconditioned Conjugate Gradient Algorithm","year":2006,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjugate gradient method; Preconditioner; Mathematics; Derivation of the conjugate gradient method; Conjugate residual method; Algorithm; Positive-definite matrix; Generalization; Matrix (chemical analysis); Nonlinear conjugate gradient method; Applied mathematics; Biconjugate gradient method; Linear system; Block (permutation group theory); Cholesky decomposition; Gradient method; Conjugate; Domain decomposition methods; Relation (database); Coefficient matrix; Gradient descent; Computer science; Iterative method; Combinatorics; Mathematical analysis; Eigenvalues and eigenvectors; Finite element method; Artificial intelligence","score_opus":0.005290628705126683,"score_gpt":0.24559488815734168,"score_spread":0.240304259452215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968250174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015788662,0.000050144878,0.99667406,0.00006382449,0.00005309195,0.000038989423,0.00003130412,0.0003713835,0.0011384126],"genre_scores_gemma":[0.039497524,0.000102035105,0.9540662,0.00012417487,0.000056695524,0.00017640463,0.0001604512,0.00018457133,0.005631927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993598,0.000172021,0.000035407997,0.00011056017,0.00026623602,0.000056051937],"domain_scores_gemma":[0.9992982,0.00017556433,0.000044544187,0.00015452638,0.0002681109,0.00005894155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007035067,0.00070503796,0.0010784119,0.0005978958,0.0004491131,0.0009240672,0.0017440586,0.0013707352,0.007382967],"category_scores_gemma":[0.0018111961,0.0005908914,0.0006782389,0.0007016971,0.0006979151,0.0012673252,0.001645596,0.0015151917,0.0031838936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021591347,0.00015042983,0.00059854117,0.00018987064,0.000094113064,0.00024287474,0.00011538629,0.5225598,0.020760424,0.08305053,0.012694955,0.35932714],"study_design_scores_gemma":[0.000028954737,0.000027383538,0.00005594158,0.0000069358684,0.000006287141,0.00004613339,0.0000047326757,0.98418576,0.0030638468,0.007982844,0.004580189,0.000010921283],"about_ca_topic_score_codex":0.0019585507,"about_ca_topic_score_gemma":0.002571405,"teacher_disagreement_score":0.007382967,"about_ca_system_score_codex":0.0004628482,"about_ca_system_score_gemma":0.0015473658,"threshold_uncertainty_score":0.024698436},"labels":[],"label_agreement":null},{"id":"W1968522278","doi":"10.1016/j.laa.2012.09.021","title":"Factorizing matrices by Dirichlet multiplication","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Multiplication (music); Combinatorics; Pure mathematics; Arithmetic; Algebra over a field","score_opus":0.01262299008997625,"score_gpt":0.25524749425921434,"score_spread":0.2426245041692381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968522278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031065779,0.0010642721,0.93629396,0.000876392,0.00078458636,0.00004156269,0.00013440239,0.0007176462,0.029021423],"genre_scores_gemma":[0.58040303,0.0022499633,0.34941652,0.0010665867,0.0025218732,0.00018968058,0.0005432515,0.0011659655,0.06244304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783933,0.0008524075,0.00008567247,0.00041715126,0.00055359513,0.00025178137],"domain_scores_gemma":[0.9970741,0.0011933725,0.00018612096,0.0007676117,0.00056360016,0.00021510871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017852129,0.0013887634,0.0012694987,0.0022775668,0.0013675966,0.0025817058,0.0011823243,0.0010404924,0.010974266],"category_scores_gemma":[0.0074639274,0.0006990863,0.0011783275,0.002263665,0.0036536371,0.0052332757,0.002962464,0.002765709,0.0037967146],"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.000058832557,0.00003485614,0.00013516881,0.000058559453,0.00001564548,0.00004454195,0.00025556065,0.0037130013,0.0018564997,0.947258,0.0046399324,0.041929398],"study_design_scores_gemma":[0.000007157252,0.000021013115,0.000055038905,0.000014233488,0.000007085075,0.00008432986,0.00004406998,0.01722723,0.0016366664,0.9740806,0.0068017473,0.000020817344],"about_ca_topic_score_codex":0.0009176872,"about_ca_topic_score_gemma":0.00093944115,"teacher_disagreement_score":0.010974266,"about_ca_system_score_codex":0.00075111305,"about_ca_system_score_gemma":0.00060528715,"threshold_uncertainty_score":0.036712527},"labels":[],"label_agreement":null},{"id":"W1969123878","doi":"10.1007/s11228-004-7198-6","title":"Nonsmooth Analysis of Singular Values. Part II: Applications","year":2005,"lang":"en","type":"article","venue":"Set-Valued Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Mathematics; Subderivative; Lipschitz continuity; Pure mathematics; Absolute continuity; Singular value; Invariant (physics); Sign (mathematics); Mathematical analysis; Applied mathematics; Regular polygon; Convex optimization; Geometry; Eigenvalues and eigenvectors","score_opus":0.011909300688031869,"score_gpt":0.26564623321773617,"score_spread":0.2537369325297043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969123878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010819473,0.03725551,0.93304664,0.0009888936,0.0015784114,0.0000492974,0.00018622483,0.00025680775,0.0158187],"genre_scores_gemma":[0.5584821,0.079726234,0.2994338,0.0014856963,0.0070114434,0.00032024973,0.00078324036,0.00072063337,0.052036606],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996698,0.00008190094,0.000022102298,0.000068132416,0.0001385415,0.000019546418],"domain_scores_gemma":[0.9990702,0.000493431,0.00008795958,0.000133261,0.00017032461,0.000044829365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052486896,0.0006542871,0.0007012141,0.0012151558,0.0002725298,0.0010871078,0.0004972033,0.00062120653,0.005927157],"category_scores_gemma":[0.0026544388,0.00023152963,0.0006296004,0.0011595141,0.0010173905,0.0008903578,0.0007761114,0.0012644436,0.001550971],"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.000120363184,0.00014662433,0.0011384499,0.0014366438,0.00019674898,0.00037096202,0.00047040105,0.04327855,0.029351233,0.38891286,0.03557294,0.49900416],"study_design_scores_gemma":[0.000014587088,0.0001178451,0.0022775629,0.00024425294,0.000068425674,0.00066713896,0.00013378507,0.2344044,0.007776843,0.70158,0.052674964,0.000040216557],"about_ca_topic_score_codex":0.0005201334,"about_ca_topic_score_gemma":0.00037688785,"teacher_disagreement_score":0.005927157,"about_ca_system_score_codex":0.00032378573,"about_ca_system_score_gemma":0.00032021248,"threshold_uncertainty_score":0.01982826},"labels":[],"label_agreement":null},{"id":"W1969255113","doi":"10.1016/j.jpdc.2013.10.002","title":"Research on the conjugate gradient algorithm with a modified incomplete Cholesky preconditioner on GPU","year":2013,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":27,"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":"Arctic Goose Joint Venture","keywords":"Cholesky decomposition; Preconditioner; Computer science; Conjugate gradient method; Incomplete Cholesky factorization; Kernel (algebra); Parallel computing; Algorithm; Multiplication (music); Matrix (chemical analysis); Sparse matrix; Mathematics; Iterative method; Eigenvalues and eigenvectors; Combinatorics","score_opus":0.04024971374101494,"score_gpt":0.28791589224487785,"score_spread":0.2476661785038629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969255113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045502856,0.0038846028,0.9298332,0.0014609917,0.00074080244,0.00010800271,0.00011020347,0.0008930446,0.01746634],"genre_scores_gemma":[0.3800877,0.0039763036,0.59523135,0.00043483183,0.0005943013,0.00014869992,0.0003316446,0.00057750446,0.01861765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943703,0.0001597097,0.000023213779,0.00010083674,0.00023155288,0.00004756245],"domain_scores_gemma":[0.9991222,0.000219345,0.00004211026,0.0001390029,0.0004186189,0.000058610352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005801014,0.0005682064,0.000793255,0.00065008254,0.0005291072,0.00090034324,0.00095615274,0.00084784563,0.004040418],"category_scores_gemma":[0.0024726114,0.00037855812,0.0006444471,0.001479449,0.0006550312,0.0017922241,0.0005849434,0.0011866998,0.0008126542],"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.0005964934,0.0003138962,0.0051028985,0.0008569549,0.0003121031,0.00031720795,0.00036201935,0.31074625,0.05578336,0.18269674,0.018888596,0.4240235],"study_design_scores_gemma":[0.00006150844,0.00007955086,0.0007375827,0.000028254852,0.00003297963,0.00007773113,0.000035675268,0.9648211,0.008838184,0.012756509,0.012501254,0.000029622553],"about_ca_topic_score_codex":0.008556231,"about_ca_topic_score_gemma":0.00492163,"teacher_disagreement_score":0.008556231,"about_ca_system_score_codex":0.0004789239,"about_ca_system_score_gemma":0.001669734,"threshold_uncertainty_score":0.017012835},"labels":[],"label_agreement":null},{"id":"W1969527806","doi":"10.1016/j.laa.2007.05.027","title":"A fast symmetric SVD algorithm for square Hankel matrices","year":2007,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Tridiagonal matrix; Singular value decomposition; Mathematics; Singular value; Square matrix; Hankel matrix; Matrix (chemical analysis); Lanczos resampling; Lanczos algorithm; Algorithm; Orthogonal matrix; Symmetric matrix; Unitary matrix; Matrix decomposition; Algebra over a field; Pure mathematics; Eigenvalues and eigenvectors; Mathematical analysis; Unitary state","score_opus":0.011671352227756074,"score_gpt":0.26471877377154573,"score_spread":0.2530474215437897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969527806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015824425,0.000213709,0.9952118,0.00007486147,0.0002100451,0.00005325607,0.00013038678,0.0015409214,0.0009826424],"genre_scores_gemma":[0.015105674,0.00023938411,0.9789001,0.00009913366,0.00014752091,0.00010846331,0.00057494635,0.00036931597,0.004455515],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986111,0.00019726784,0.000078728124,0.00020765454,0.0007966147,0.00010857614],"domain_scores_gemma":[0.99783033,0.0005285952,0.000085454325,0.00048018462,0.0009655082,0.000109921384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011011196,0.001485965,0.0013698355,0.0014609777,0.000995102,0.0018652022,0.0014372577,0.0012126081,0.01179556],"category_scores_gemma":[0.0052789296,0.0007543679,0.0010374537,0.0020750752,0.0005945712,0.002148848,0.0019522867,0.002117346,0.009718847],"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.00031252595,0.00012350349,0.00025986592,0.00021642921,0.00010747159,0.00013843969,0.000114024304,0.023320317,0.024314653,0.026420385,0.023795413,0.900877],"study_design_scores_gemma":[0.000209244,0.00025314733,0.0005752501,0.00006164588,0.0000708006,0.0007366221,0.00013547119,0.8461757,0.0425031,0.06350622,0.04564936,0.00012358223],"about_ca_topic_score_codex":0.002609022,"about_ca_topic_score_gemma":0.0045147724,"teacher_disagreement_score":0.01179556,"about_ca_system_score_codex":0.00044750076,"about_ca_system_score_gemma":0.0017851144,"threshold_uncertainty_score":0.039460063},"labels":[],"label_agreement":null},{"id":"W1969579322","doi":"10.1142/s0129626405002374","title":"THE IMPROVED PARALLEL ICGS METHOD FOR LARGE AND SPARSE UNSYMMETRIC LINEAR SYSTEMS","year":2005,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Conjugate gradient method; Computation; Parallel computing; Sparse matrix; Algorithm; Matrix (chemical analysis); Parallel algorithm; Coefficient matrix; Scheme (mathematics); Distributed memory; Linear system; Mathematical optimization; Shared memory; Mathematics","score_opus":0.016758634540363967,"score_gpt":0.2780497384753776,"score_spread":0.26129110393501365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969579322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050117956,0.00016137936,0.9919614,0.00014717026,0.00009392757,0.000043318843,0.000037610767,0.00039280203,0.002150687],"genre_scores_gemma":[0.08228246,0.00024328394,0.9117288,0.000115427865,0.00008732642,0.00017342968,0.00015837523,0.0001826692,0.0050282655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997297,0.000069190886,0.000009997251,0.000032427073,0.00013967189,0.000019040943],"domain_scores_gemma":[0.9997129,0.00007455189,0.000025622936,0.00005115849,0.00011106748,0.000024719386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044624007,0.000626319,0.00054608047,0.00044188916,0.0003590377,0.00041050813,0.0010314093,0.0005381025,0.0021724158],"category_scores_gemma":[0.00091371953,0.00024537885,0.00037997382,0.0007963637,0.00056372426,0.00064725295,0.00063181797,0.0007457073,0.0006517249],"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.00019308244,0.000098060365,0.00090784073,0.0002667978,0.000058368078,0.00026132615,0.00015575408,0.6404199,0.030021198,0.07055564,0.012322276,0.24473968],"study_design_scores_gemma":[0.000025715946,0.00002885314,0.00008842543,0.0000047493877,0.0000054073353,0.00005089238,0.000007377107,0.9847333,0.0031758286,0.005466583,0.006403743,0.000009267714],"about_ca_topic_score_codex":0.0034656147,"about_ca_topic_score_gemma":0.0031698714,"teacher_disagreement_score":0.0034656147,"about_ca_system_score_codex":0.0003470742,"about_ca_system_score_gemma":0.0015252387,"threshold_uncertainty_score":0.0072674155},"labels":[],"label_agreement":null},{"id":"W1969652671","doi":"10.1007/s11075-013-9770-3","title":"Stability of rootfinding for barycentric Lagrange interpolants","year":2013,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Barycentric coordinate system; Companion matrix; Lagrange polynomial; Basis (linear algebra); Condition number; Monomial basis; Polynomial basis; Matrix (chemical analysis); Monomial; Polynomial; Theory of computation; Computation; Applied mathematics; Univariate; Matrix polynomial; Polynomial matrix; Combinatorics; Mathematical analysis; Algorithm; Geometry","score_opus":0.020313011535163076,"score_gpt":0.2514376002324644,"score_spread":0.23112458869730135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969652671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09984847,0.00033840237,0.8910086,0.00033354046,0.0000803324,0.00005401596,0.00008977193,0.0002929665,0.0079539735],"genre_scores_gemma":[0.79722506,0.00028065903,0.19338423,0.00011650185,0.00006209552,0.00014213669,0.00023274288,0.00046608516,0.008090453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985973,0.0005602747,0.000046954687,0.0001877326,0.00048145372,0.00012635207],"domain_scores_gemma":[0.99031234,0.0071171937,0.00061410625,0.0005837793,0.0011113613,0.00026119707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030003195,0.0006906781,0.0008701738,0.0013564987,0.001184914,0.0025097057,0.0018669846,0.0012699649,0.0047131544],"category_scores_gemma":[0.026511278,0.00059070764,0.00047903598,0.001040268,0.0024035985,0.0022150984,0.0030638187,0.0018805884,0.0009482892],"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.00081005436,0.00009321086,0.002093912,0.00020580222,0.000043842145,0.00012642532,0.0006321454,0.31653607,0.009468251,0.57871205,0.0029261063,0.08835219],"study_design_scores_gemma":[0.000021973474,0.000038152888,0.00014462412,0.000026602107,0.0000054640304,0.000029055704,0.0000671013,0.8536024,0.003264333,0.14193381,0.00084856915,0.000017816685],"about_ca_topic_score_codex":0.0027224843,"about_ca_topic_score_gemma":0.0024256953,"teacher_disagreement_score":0.0047131544,"about_ca_system_score_codex":0.0013372819,"about_ca_system_score_gemma":0.0014166753,"threshold_uncertainty_score":0.015867412},"labels":[],"label_agreement":null},{"id":"W1970070655","doi":"10.5539/jmr.v1n2p119","title":"Some Operation Properties of Adjoint Matrices for Block Matrices","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Algebra over a field; Pure mathematics; Combinatorics","score_opus":0.10056348869350826,"score_gpt":0.365960446508163,"score_spread":0.2653969578146548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970070655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07330201,0.0013821552,0.8992241,0.00042740922,0.00027549308,0.00004550322,0.00021189328,0.000197966,0.024933496],"genre_scores_gemma":[0.84958917,0.002117235,0.12714095,0.0006122468,0.00079693494,0.00016286017,0.0006360085,0.00032065262,0.018624004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936694,0.00015895459,0.00004125589,0.000120378456,0.0002378473,0.00007470769],"domain_scores_gemma":[0.9983429,0.00062922185,0.00024592306,0.00014782576,0.0005145847,0.000119629636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073683995,0.0005286847,0.00030625623,0.0008715031,0.0004764169,0.0010928893,0.00035492514,0.0005628877,0.006259083],"category_scores_gemma":[0.0032597557,0.00018287663,0.00046939577,0.00080152275,0.0013045532,0.0022889748,0.00069738214,0.0012636201,0.0011190211],"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.000093494804,0.000048748672,0.0008798211,0.00016704647,0.000022380194,0.00027803043,0.0004476178,0.0063903653,0.026214773,0.9166479,0.0032397725,0.045570057],"study_design_scores_gemma":[0.000028445076,0.0002364466,0.001370888,0.000036691672,0.00002757838,0.0013035364,0.00028875627,0.07789536,0.015630357,0.88687366,0.016233658,0.00007460891],"about_ca_topic_score_codex":0.00042987938,"about_ca_topic_score_gemma":0.00029938333,"teacher_disagreement_score":0.006259083,"about_ca_system_score_codex":0.00023180309,"about_ca_system_score_gemma":0.00034978322,"threshold_uncertainty_score":0.020938694},"labels":[],"label_agreement":null},{"id":"W1970201668","doi":"10.3103/s106345411304002x","title":"Remark on the norm of random Hankel matrices","year":2013,"lang":"en","type":"article","venue":"Vestnik St Petersburg University Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"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":"Research Nova Scotia","keywords":"Hankel matrix; Mathematics; Random matrix; Matrix norm; Independent and identically distributed random variables; Series (stratigraphy); Norm (philosophy); Matrix (chemical analysis); Pure mathematics; Combinatorics; Eigenvalues and eigenvectors; Applied mathematics; Random variable; Mathematical analysis; Statistics","score_opus":0.010517007951934172,"score_gpt":0.18314315025875114,"score_spread":0.17262614230681697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970201668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033258606,0.007947823,0.89292413,0.0074080736,0.0018703489,0.000052231175,0.00083708187,0.00059664896,0.055105098],"genre_scores_gemma":[0.7415577,0.01038892,0.20429152,0.0072798827,0.0054623,0.00034013658,0.00090405403,0.0008965496,0.028878912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722606,0.00085899985,0.000124096,0.0005834818,0.0010304268,0.0001769044],"domain_scores_gemma":[0.9832614,0.012589969,0.0008603227,0.0012906471,0.0015897971,0.00040787744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043621045,0.00094972685,0.00074083346,0.0015876732,0.0007181242,0.0014928622,0.0013878563,0.0013859213,0.007377392],"category_scores_gemma":[0.02358693,0.00031851657,0.0009455204,0.0012093679,0.0042931605,0.004128777,0.0019949812,0.0049042325,0.0016780723],"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.00008356281,0.000023033244,0.0006605053,0.00029384193,0.000029094183,0.00040048495,0.00033438514,0.008141755,0.0059754457,0.95875084,0.00815721,0.017149797],"study_design_scores_gemma":[0.000026030324,0.00015070105,0.002091813,0.00013269219,0.000029781282,0.0013888641,0.00013832205,0.0810459,0.005666622,0.8820833,0.027162451,0.00008345225],"about_ca_topic_score_codex":0.0009545734,"about_ca_topic_score_gemma":0.00039215633,"teacher_disagreement_score":0.007377392,"about_ca_system_score_codex":0.00050169096,"about_ca_system_score_gemma":0.00035335874,"threshold_uncertainty_score":0.02467984},"labels":[],"label_agreement":null},{"id":"W1971294299","doi":"10.1080/03081087.2012.743024","title":"On the continuity of Birkhoff–James -orthogonality sets","year":2012,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"University of Calgary","funders":"","keywords":"Mathematics; Orthogonality; Generalization; Numerical range; Regular polygon; Matrix (chemical analysis); Square matrix; Norm (philosophy); Pure mathematics; Combinatorics; Discrete mathematics; Mathematical analysis; Symmetric matrix; Geometry; Eigenvalues and eigenvectors","score_opus":0.01860193897786738,"score_gpt":0.27079724147893747,"score_spread":0.2521953025010701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971294299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18729506,0.0025969802,0.7516856,0.0018397846,0.00018158785,0.00006661749,0.00024835244,0.00013370957,0.055952244],"genre_scores_gemma":[0.8993987,0.002229856,0.09142735,0.00062381173,0.0003324623,0.00015595114,0.00030839967,0.000107656015,0.005415743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764556,0.0009085107,0.00013086491,0.0003883542,0.0006500798,0.00027667926],"domain_scores_gemma":[0.9889416,0.007801625,0.0007357958,0.0005862193,0.0012950668,0.00063972914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005427893,0.000589674,0.00080035697,0.002265347,0.0013920319,0.0029598481,0.0013409384,0.0009400696,0.0035073361],"category_scores_gemma":[0.019403389,0.00051298813,0.0006795362,0.0014981799,0.0053605647,0.0067036794,0.004256751,0.0036824292,0.00048767624],"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.000035326313,0.00002227064,0.0004950544,0.00003631225,0.000010251965,0.00010148517,0.00031511777,0.0023523436,0.0010550328,0.98871815,0.00044121046,0.006417502],"study_design_scores_gemma":[0.000016653568,0.000063601314,0.0010238916,0.000072693394,0.00001115069,0.00025424155,0.00025916996,0.04304563,0.0016063626,0.9501057,0.00350021,0.000040636613],"about_ca_topic_score_codex":0.00077674957,"about_ca_topic_score_gemma":0.0003991113,"teacher_disagreement_score":0.005427893,"about_ca_system_score_codex":0.00090143306,"about_ca_system_score_gemma":0.0005517905,"threshold_uncertainty_score":0.028705835},"labels":[],"label_agreement":null},{"id":"W1971332901","doi":"10.5539/jmr.v6n1p33","title":"Some Bounds of the Zeros of Polynomials Based on the QR-Decomposition and the LU-Decomposition of the Frobenius Companion Matrix","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Monic polynomial; Companion matrix; Decomposition; QR decomposition; Polynomial matrix; Matrix (chemical analysis); Matrix decomposition; Order (exchange); Polynomial; Pure mathematics; Algebra over a field; Matrix polynomial; Combinatorics; Mathematical analysis; Eigenvalues and eigenvectors","score_opus":0.033780000133490216,"score_gpt":0.3427461906201496,"score_spread":0.3089661904866594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971332901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023721468,0.0029609215,0.9592564,0.00052790326,0.000269426,0.000025916508,0.00017991546,0.00018292622,0.01287512],"genre_scores_gemma":[0.7131553,0.0068732165,0.26439297,0.0006018306,0.0012089952,0.00024796434,0.0006980458,0.00061620196,0.012205495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988426,0.00034157748,0.00005201791,0.00023977968,0.00035988467,0.00016412028],"domain_scores_gemma":[0.9955968,0.0023439536,0.00039833417,0.00034681734,0.0009871793,0.0003269405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015316257,0.0016305713,0.00072318775,0.002039806,0.0006686603,0.0013211947,0.0009875637,0.0007170987,0.004774298],"category_scores_gemma":[0.012174877,0.00031952024,0.0006595235,0.0011489809,0.0023241409,0.0042542843,0.00184541,0.0034943528,0.0012313847],"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.0003108385,0.00005306806,0.000888533,0.0004955281,0.000046474237,0.00022092006,0.0005716952,0.035785142,0.022647852,0.87811774,0.004631571,0.056230582],"study_design_scores_gemma":[0.00002608509,0.00022303282,0.0013041539,0.0002616131,0.00005813212,0.00045836964,0.00031072082,0.33158788,0.020186642,0.63070184,0.014718799,0.00016272906],"about_ca_topic_score_codex":0.0010021195,"about_ca_topic_score_gemma":0.00090635027,"teacher_disagreement_score":0.004774298,"about_ca_system_score_codex":0.0008668008,"about_ca_system_score_gemma":0.00057383865,"threshold_uncertainty_score":0.01597166},"labels":[],"label_agreement":null},{"id":"W1971521186","doi":"10.5539/jmr.v1n1p65","title":"Some Properties and Determination of Complex Metapositive Subdefinite Matrix","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matrix (chemical analysis); Positive definiteness; Complex matrix; Matrix function; Pure mathematics; Definiteness; Algebra over a field; Symmetric matrix; Positive-definite matrix; Eigenvalues and eigenvectors; Linguistics","score_opus":0.1631211386969842,"score_gpt":0.3871938616531849,"score_spread":0.22407272295620073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971521186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3090109,0.0009103744,0.65275544,0.00046246537,0.00012093227,0.00006488112,0.0001726081,0.0002151913,0.036287174],"genre_scores_gemma":[0.94287217,0.00036526864,0.048955835,0.0001155664,0.00010665967,0.000057419897,0.00017123461,0.00006368156,0.007292179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994394,0.00009985646,0.00004626252,0.00014722628,0.00019728109,0.00006994252],"domain_scores_gemma":[0.99880135,0.00036941038,0.0001659559,0.00014677268,0.0004127787,0.000103724466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006275824,0.00042878828,0.00026422626,0.0012636923,0.0007158311,0.0012471665,0.00042636594,0.00053450075,0.0041651325],"category_scores_gemma":[0.0025123046,0.00022756914,0.00044026726,0.0004781473,0.0013350098,0.0027864645,0.0007562588,0.0010850809,0.0005010955],"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.00006537224,0.000025851115,0.0011855352,0.00009408495,0.0000103608345,0.0004919416,0.00048516257,0.0019714714,0.027360987,0.95303833,0.0006300101,0.014640885],"study_design_scores_gemma":[0.000026924283,0.00013763762,0.0015577589,0.00004431057,0.000024339008,0.0032184778,0.0005006933,0.040456876,0.037518438,0.9023588,0.01407601,0.00007959566],"about_ca_topic_score_codex":0.0003006433,"about_ca_topic_score_gemma":0.0002828597,"teacher_disagreement_score":0.0041651325,"about_ca_system_score_codex":0.00041574458,"about_ca_system_score_gemma":0.0002692868,"threshold_uncertainty_score":0.013933778},"labels":[],"label_agreement":null},{"id":"W1971934936","doi":"10.5539/jmr.v1n1p97","title":"Bounds for the Perron Root of Irreducible Nonnegative Matrices","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; BETA (programming language); Product (mathematics); Root (linguistics); Matrix (chemical analysis); Geometry; Chemistry","score_opus":0.18933174995066837,"score_gpt":0.42699518501686484,"score_spread":0.23766343506619647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971934936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036764808,0.0068599638,0.89325315,0.0029178082,0.0010579661,0.0000735454,0.00041940314,0.0007700109,0.057883266],"genre_scores_gemma":[0.67055386,0.007490455,0.28515968,0.0021644048,0.002065515,0.00056791806,0.00081385736,0.0010822394,0.0301021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976585,0.0007273283,0.00010827475,0.0004821658,0.0006681364,0.0003556034],"domain_scores_gemma":[0.9883973,0.0071794055,0.0007186831,0.0010865014,0.0017838312,0.0008341072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034408432,0.0025339276,0.0011978272,0.0037088557,0.0012476423,0.0022183731,0.002219472,0.0019128297,0.010915731],"category_scores_gemma":[0.022054695,0.0006215213,0.0014851056,0.0019104023,0.0039119446,0.0069581955,0.0032767665,0.0063515212,0.0043114154],"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.00017320979,0.000090960064,0.0010545441,0.00046744396,0.00006194673,0.00026650846,0.00045050986,0.02247792,0.009452597,0.91026556,0.012219891,0.043018933],"study_design_scores_gemma":[0.000016970016,0.000096996235,0.00089161075,0.00024112438,0.00006423275,0.00034211448,0.00013920263,0.1774106,0.0061912723,0.7985911,0.015893033,0.00012173342],"about_ca_topic_score_codex":0.000892938,"about_ca_topic_score_gemma":0.0015000419,"teacher_disagreement_score":0.010915731,"about_ca_system_score_codex":0.00185307,"about_ca_system_score_gemma":0.0010788105,"threshold_uncertainty_score":0.036516726},"labels":[],"label_agreement":null},{"id":"W1972195411","doi":"10.1016/j.laa.2006.12.006","title":"Persistently positive inverses of perturbed M-matrices","year":2007,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tridiagonal matrix; Mathematics; Inverse; Rank (graph theory); Matrix (chemical analysis); Diagonally dominant matrix; Block matrix; Diagonal; Pure mathematics; Combinatorics; Invertible matrix; Eigenvalues and eigenvectors; Geometry; Physics; Chemistry","score_opus":0.010137880128745938,"score_gpt":0.24583476505634827,"score_spread":0.23569688492760232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972195411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30685046,0.00030589456,0.6696835,0.0006867217,0.0002700615,0.000056943143,0.00024406944,0.00040459167,0.021497712],"genre_scores_gemma":[0.93422127,0.00020852874,0.051662162,0.00020452606,0.00011288928,0.00005004442,0.00016550394,0.0001012016,0.013273814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999373,0.00016749102,0.000028390894,0.00012991054,0.00023001745,0.00007122422],"domain_scores_gemma":[0.99760926,0.0009787667,0.00042854392,0.0003865462,0.0003937045,0.00020304114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007152832,0.00068803475,0.00040456848,0.0006607868,0.0005303404,0.0014979943,0.00082654826,0.001007918,0.004864365],"category_scores_gemma":[0.0068543223,0.0003648486,0.00033200582,0.00044187295,0.0018141313,0.0017987782,0.0014177536,0.0011914059,0.0007971316],"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.00061607215,0.00013579386,0.0012551785,0.00016777053,0.0000434135,0.0006883244,0.0005755171,0.067768864,0.038910978,0.8426602,0.003613982,0.043563932],"study_design_scores_gemma":[0.00003907426,0.0001395477,0.0006271869,0.000023380106,0.000012567704,0.0006407573,0.00028272846,0.29655924,0.014943796,0.68359256,0.0030893018,0.00004989426],"about_ca_topic_score_codex":0.00034760553,"about_ca_topic_score_gemma":0.00031814934,"teacher_disagreement_score":0.004864365,"about_ca_system_score_codex":0.00034144183,"about_ca_system_score_gemma":0.0003730651,"threshold_uncertainty_score":0.016272902},"labels":[],"label_agreement":null},{"id":"W1972602556","doi":"10.1016/s0024-3795(02)00331-2","title":"Total positivity and Toda flow","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Matrix (chemical analysis); Flow (mathematics); Pure mathematics; Complex matrix; Combinatorics; Chemistry; Geometry; Chromatography","score_opus":0.010613289361682269,"score_gpt":0.2203973586136223,"score_spread":0.20978406925194004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972602556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28088602,0.0031385946,0.39808217,0.005806318,0.0013928227,0.0000901256,0.0005717267,0.0006787358,0.30935347],"genre_scores_gemma":[0.8968906,0.00199117,0.033523098,0.0010185217,0.00096070586,0.00013875555,0.00034919602,0.00040237067,0.06472557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947804,0.00014372688,0.00002239762,0.00010302492,0.00015839159,0.000094429066],"domain_scores_gemma":[0.99867487,0.00045883385,0.00014693952,0.00014412576,0.0002917666,0.0002834841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010120947,0.000706548,0.0012049634,0.00209156,0.003266985,0.003071114,0.0010970586,0.0011658369,0.01154714],"category_scores_gemma":[0.0033524083,0.00058825716,0.0010629517,0.0018614616,0.0036463316,0.0056545115,0.002547119,0.0024617082,0.0010858948],"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.00001046977,0.0000060489065,0.000034780118,0.0000140066,0.0000023181583,0.000015986903,0.000060491748,0.00031723018,0.00018695765,0.9966807,0.0010189168,0.0016519855],"study_design_scores_gemma":[0.0000034532936,0.0000027389171,0.000034250428,0.0000037678003,0.000002079198,0.000033036307,0.000020428452,0.0016582339,0.00008660034,0.9970692,0.0010821904,0.0000040243353],"about_ca_topic_score_codex":0.00092656707,"about_ca_topic_score_gemma":0.0010205037,"teacher_disagreement_score":0.01154714,"about_ca_system_score_codex":0.0011030198,"about_ca_system_score_gemma":0.00080996036,"threshold_uncertainty_score":0.038629055},"labels":[],"label_agreement":null},{"id":"W1972887674","doi":"10.1016/s0024-3795(02)00365-8","title":"Exponents of tuples of nonnegative matrices","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Irreducibility; Mathematics; Tuple; Exponent; Integer (computer science); Combinatorics; Matrix (chemical analysis); Order (exchange); Discrete mathematics; Pure mathematics; Chemistry","score_opus":0.017106819295210494,"score_gpt":0.2381653158025709,"score_spread":0.2210584965073604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972887674","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49386913,0.0041446732,0.44451812,0.0024334763,0.0022759167,0.00019006884,0.0017431687,0.00067840423,0.05014712],"genre_scores_gemma":[0.9126377,0.002313584,0.060968794,0.00041554894,0.001755936,0.00022585066,0.0009630148,0.0003472482,0.020372268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835616,0.00050744676,0.00017598056,0.00029152582,0.00044030967,0.0002285046],"domain_scores_gemma":[0.9919647,0.0041852,0.0013595313,0.0005054705,0.0009346154,0.0010504046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018508284,0.0013126656,0.0010369992,0.0031731382,0.0014507531,0.005325755,0.0008435871,0.0007190473,0.00757405],"category_scores_gemma":[0.0126357125,0.00070121983,0.0006623164,0.0018296402,0.0021347164,0.0070669227,0.0023244915,0.0022844046,0.0015807404],"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.00027173487,0.000038882314,0.0014046088,0.00010640306,0.000015957301,0.00047029907,0.0005007979,0.0013062855,0.0038088982,0.971648,0.0038619635,0.01656623],"study_design_scores_gemma":[0.000035092235,0.0000851449,0.00076289155,0.00007344871,0.00001602982,0.0005431112,0.00023090657,0.011734408,0.0018962339,0.9776922,0.0068896804,0.000040762832],"about_ca_topic_score_codex":0.0001675313,"about_ca_topic_score_gemma":0.00021114018,"teacher_disagreement_score":0.00757405,"about_ca_system_score_codex":0.0006030661,"about_ca_system_score_gemma":0.0003989599,"threshold_uncertainty_score":0.025337756},"labels":[],"label_agreement":null},{"id":"W1973465423","doi":"10.1090/s0025-5718-07-02005-4","title":"On pseudospectra of matrix polynomials and their boundaries","year":2007,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Leverhulme Trust","keywords":"Mathematics; Eigenvalues and eigenvectors; Smoothness; Boundary (topology); Polynomial matrix; Matrix (chemical analysis); Polynomial; Boundary value problem; Matrix polynomial; Orthogonal polynomials; Pure mathematics; Mathematical analysis","score_opus":0.010126585259753617,"score_gpt":0.26624446897916476,"score_spread":0.25611788371941113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973465423","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.621,0.002805113,0.33152056,0.0009968985,0.00015222313,0.00007290169,0.0002496013,0.00034045143,0.042862255],"genre_scores_gemma":[0.9635069,0.0013235135,0.02953489,0.00018047962,0.00043378398,0.00007220517,0.0002387082,0.000108955355,0.004600451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982829,0.00046971292,0.000078404846,0.00031828484,0.00062469,0.00022606073],"domain_scores_gemma":[0.98555946,0.008865674,0.0019664716,0.00090876094,0.0012406177,0.0014588846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001610993,0.00085472135,0.00077921647,0.0033940857,0.0014163468,0.0021008113,0.00096214423,0.0013509227,0.0059749917],"category_scores_gemma":[0.014372341,0.0003997878,0.00048837217,0.0015571929,0.003847612,0.006574011,0.0028209733,0.0025471249,0.0007467947],"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.00010478454,0.00004520226,0.0011740077,0.000120687844,0.000007640644,0.00024698913,0.0005787556,0.0035364754,0.007279662,0.9722787,0.0006068589,0.014020145],"study_design_scores_gemma":[0.000019209805,0.0001298557,0.0019664657,0.000056911234,0.0000092432665,0.0004587415,0.00027404542,0.032843094,0.0027552738,0.95880646,0.0026436101,0.00003707946],"about_ca_topic_score_codex":0.0003224771,"about_ca_topic_score_gemma":0.00021235317,"teacher_disagreement_score":0.0059749917,"about_ca_system_score_codex":0.0006180321,"about_ca_system_score_gemma":0.0003108407,"threshold_uncertainty_score":0.019988298},"labels":[],"label_agreement":null},{"id":"W1973642390","doi":"10.1016/j.laa.2011.12.010","title":"Every invertible matrix is diagonally equivalent to a matrix with distinct eigenvalues","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Invertible matrix; Diagonally dominant matrix; Eigenvalues and eigenvectors; Matrix (chemical analysis); Pure mathematics; Conjecture; Diagonal; Combinatorics; Eigendecomposition of a matrix; Diagonal matrix; Geometry; Physics","score_opus":0.01626442222791432,"score_gpt":0.28253315587815825,"score_spread":0.26626873365024395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973642390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19973487,0.00046708042,0.65104836,0.001905838,0.0020367526,0.00021674139,0.00071821694,0.0013904726,0.14248167],"genre_scores_gemma":[0.8476235,0.00071935594,0.1141914,0.0016669539,0.0011408086,0.00031374916,0.00073244923,0.00045894156,0.03315285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835914,0.0002532579,0.00009554896,0.0005407732,0.000495381,0.00025591205],"domain_scores_gemma":[0.99762493,0.0008197774,0.0003232563,0.00048618193,0.00057767256,0.00016823354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006489172,0.0009377716,0.0006182277,0.0014043736,0.0013465656,0.002589787,0.0007572121,0.0012369921,0.013172075],"category_scores_gemma":[0.0034471883,0.00044996393,0.000669945,0.0012482586,0.003553946,0.002524974,0.0021130864,0.002084968,0.0033073828],"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.00010798809,0.00017583414,0.00039388885,0.00012864474,0.000046432433,0.00020652024,0.00032829505,0.001216806,0.01482453,0.9339302,0.004416751,0.0442241],"study_design_scores_gemma":[0.000042872565,0.000116106086,0.00060507,0.000027976841,0.00002136317,0.00039667758,0.0002611951,0.005086473,0.0073767146,0.9746551,0.01136237,0.000048121212],"about_ca_topic_score_codex":0.00025382827,"about_ca_topic_score_gemma":0.00033153582,"teacher_disagreement_score":0.013172075,"about_ca_system_score_codex":0.00032064933,"about_ca_system_score_gemma":0.0006856253,"threshold_uncertainty_score":0.04406494},"labels":[],"label_agreement":null},{"id":"W1974087087","doi":"10.1016/j.laa.2011.03.040","title":"Filters connecting isospectral quadratic systems","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Engineering and Physical Sciences Research Council","keywords":"Isospectral; Mathematics; Invertible matrix; Constructive; Matrix (chemical analysis); Pure mathematics; Coprime integers; Constructive proof; Diagonal; Quadratic equation; Discrete mathematics; Algebra over a field","score_opus":0.023896018426541807,"score_gpt":0.23802212883515098,"score_spread":0.21412611040860918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974087087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23651873,0.0005616895,0.6750983,0.0010994037,0.00067251845,0.00008871019,0.00023187409,0.000821643,0.0849072],"genre_scores_gemma":[0.8480312,0.00076360913,0.06884935,0.0009185712,0.0007778602,0.00014428301,0.000336319,0.00056238,0.07961649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993268,0.00016151101,0.000027227188,0.00015683039,0.00020593233,0.000121604295],"domain_scores_gemma":[0.99824035,0.00059983553,0.00025182636,0.00020867266,0.0004427267,0.00025666028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065285544,0.00073881715,0.00068361795,0.002653827,0.0013631735,0.0023551704,0.00072324846,0.0012818206,0.01829301],"category_scores_gemma":[0.0033131673,0.00048984314,0.0005814119,0.0011609935,0.0013542533,0.003963268,0.00206594,0.0020523486,0.0025004703],"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.0000616895,0.0000417631,0.0001599762,0.000036678808,0.000009017059,0.000060210947,0.00015674559,0.002073776,0.0038708246,0.9764297,0.0017199146,0.015379788],"study_design_scores_gemma":[0.00002082615,0.000066107146,0.00027013067,0.000018274932,0.000009588021,0.00015681807,0.00014930814,0.030677013,0.0031631603,0.95960325,0.0058384575,0.000027006925],"about_ca_topic_score_codex":0.00057185336,"about_ca_topic_score_gemma":0.00062584603,"teacher_disagreement_score":0.01829301,"about_ca_system_score_codex":0.00079705985,"about_ca_system_score_gemma":0.0003921083,"threshold_uncertainty_score":0.061196268},"labels":[],"label_agreement":null},{"id":"W1974332196","doi":"10.1007/s11006-005-0077-0","title":"On the Properties of Accretive-Dissipative Matrices","year":2005,"lang":"en","type":"article","venue":"Mathematical Notes","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":36,"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 Waterloo","funders":"","keywords":"Mathematics; Dissipative system; Pure mathematics; Physics; Thermodynamics","score_opus":0.030308342739040272,"score_gpt":0.25266497504724844,"score_spread":0.22235663230820818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974332196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3502464,0.003350069,0.55276525,0.002719616,0.0004519239,0.00006747162,0.00032231884,0.00021821729,0.08985882],"genre_scores_gemma":[0.95040303,0.0022804632,0.023401657,0.00044787372,0.00063188333,0.00008633864,0.00025107784,0.000102628874,0.022395017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944514,0.00017742612,0.000033193952,0.000103510494,0.0001633348,0.00007729066],"domain_scores_gemma":[0.99292797,0.004494844,0.00073419366,0.00042971966,0.0008456547,0.0005676185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001589054,0.00090217544,0.00072325015,0.0016337918,0.0012106202,0.0026110178,0.0010459627,0.0010403433,0.0062318793],"category_scores_gemma":[0.011522847,0.00039979676,0.0005047635,0.0012251192,0.003951154,0.005129882,0.002087415,0.0021857761,0.00076222996],"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.000042927546,0.000018080558,0.00026351237,0.000038975126,0.000007850665,0.00006575839,0.00024125236,0.0044776197,0.001385269,0.9877891,0.00068982167,0.0049798847],"study_design_scores_gemma":[0.000008314585,0.000030206698,0.00020054383,0.000014705545,0.0000050011818,0.00009080986,0.000069306225,0.024584148,0.00047305084,0.97298133,0.0015298013,0.000012873658],"about_ca_topic_score_codex":0.0007437206,"about_ca_topic_score_gemma":0.0006268934,"teacher_disagreement_score":0.0062318793,"about_ca_system_score_codex":0.00080445956,"about_ca_system_score_gemma":0.0005963862,"threshold_uncertainty_score":0.020847678},"labels":[],"label_agreement":null},{"id":"W1974712349","doi":"10.1016/j.disc.2012.11.001","title":"Corrigendum to “A criterion for the half-plane property” [Discrete Math. 309 (2008) 1385–1390]","year":2012,"lang":"en","type":"erratum","venue":"Discrete Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Property (philosophy); Plane (geometry); Discrete mathematics; Combinatorics; Pure mathematics; Applied mathematics; Geometry","score_opus":0.03259908505706661,"score_gpt":0.27105931372479103,"score_spread":0.23846022866772443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974712349","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037105748,0.005335979,0.0034210142,0.08221719,0.87549293,0.00009130908,0.0017031936,0.0006465007,0.030720929],"genre_scores_gemma":[0.021922408,0.017051384,0.010678564,0.115236655,0.24845111,0.00054102094,0.0046965624,0.0022319276,0.5791903],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951251,0.0008685111,0.0005907512,0.0008334638,0.0021172506,0.00046483017],"domain_scores_gemma":[0.9858995,0.002972164,0.0005672537,0.001179729,0.008820022,0.00056123204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028043545,0.0027544417,0.0028636423,0.0052836114,0.0041704504,0.0039357194,0.0057308963,0.0061352802,0.10601536],"category_scores_gemma":[0.030305518,0.0013328221,0.0028208245,0.0034168162,0.003307312,0.004830164,0.002617172,0.007254044,0.056266267],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034485845,0.000010249016,0.00004147468,0.00014472484,0.000016601942,0.00009140495,0.000019734705,0.00007505992,0.000070802154,0.0047989213,0.9900034,0.0046931133],"study_design_scores_gemma":[0.000058096877,0.000045256333,0.0014870928,0.00028039972,0.00006460994,0.0003310502,0.00008272427,0.00087274984,0.0006499189,0.02189993,0.97413003,0.00009822607],"about_ca_topic_score_codex":0.02126982,"about_ca_topic_score_gemma":0.026670668,"teacher_disagreement_score":0.10601536,"about_ca_system_score_codex":0.0072136014,"about_ca_system_score_gemma":0.0033301564,"threshold_uncertainty_score":0.3546567},"labels":[],"label_agreement":null},{"id":"W1975220724","doi":"10.1016/j.laa.2003.12.025","title":"On polynomial numerical hulls of normal matrices","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Hull; Matrix polynomial; Hermitian matrix; Polynomial; Hyperbola; Numerical range; Numerical analysis; Convergence (economics); Polynomial matrix; Combinatorics; Mathematical analysis; Applied mathematics; Pure mathematics; Geometry","score_opus":0.007320233662388528,"score_gpt":0.23900340023247402,"score_spread":0.23168316657008547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975220724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21662065,0.00089160854,0.7234608,0.001197189,0.00025992587,0.000057177145,0.00041619583,0.0005681511,0.05652827],"genre_scores_gemma":[0.8832197,0.00125093,0.080694124,0.00025221123,0.0005539212,0.00005737559,0.00094803347,0.00032918237,0.032694455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864095,0.00031647092,0.00005060257,0.00022227303,0.00054630265,0.0002233672],"domain_scores_gemma":[0.9935813,0.003672403,0.0006600539,0.00057562144,0.0008793331,0.00063124695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013331654,0.00096150866,0.0010192032,0.0020694772,0.0013331452,0.0029945113,0.0014869806,0.0007078187,0.008006573],"category_scores_gemma":[0.012070929,0.0006107349,0.00078361493,0.0022594312,0.00450633,0.007076774,0.0031958837,0.0035645391,0.0015283761],"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.00014095934,0.000045155382,0.00054267474,0.00005905221,0.000008863708,0.00007797665,0.0003950116,0.01018198,0.0013294498,0.9651532,0.0025928924,0.019472804],"study_design_scores_gemma":[0.000014560995,0.000038660564,0.0002956717,0.000018781933,0.0000068495538,0.00007410921,0.00012973358,0.050800856,0.0010256366,0.9444128,0.0031637393,0.000018658817],"about_ca_topic_score_codex":0.00280482,"about_ca_topic_score_gemma":0.0024225265,"teacher_disagreement_score":0.008006573,"about_ca_system_score_codex":0.0013263103,"about_ca_system_score_gemma":0.00059867563,"threshold_uncertainty_score":0.026784658},"labels":[],"label_agreement":null},{"id":"W1975659366","doi":"10.1016/j.crma.2008.12.019","title":"Ajustement polynomial local de la fonction d'égalisation équipercentile : convergence uniforme presque sûre","year":2009,"lang":"fr","type":"article","venue":"Comptes Rendus Mathématique","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Université Laval","funders":"","keywords":"Mathematics; Combinatorics; Polynomial; Inverse; Estimator; Statistics; Mathematical analysis; Geometry","score_opus":0.014342134945568854,"score_gpt":0.26928676764237,"score_spread":0.2549446326968011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975659366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04520271,0.0027329193,0.8929054,0.0022399256,0.00031993337,0.00008005019,0.00036024392,0.0022669837,0.05389185],"genre_scores_gemma":[0.6887389,0.0037843932,0.17783397,0.0011226498,0.0009456486,0.00048486007,0.0008267092,0.0028538269,0.12340907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996618,0.0007966014,0.00008743129,0.0009310079,0.0009336033,0.0006334106],"domain_scores_gemma":[0.9858074,0.009424359,0.0005647703,0.0010840235,0.0022731156,0.00084631814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004546543,0.0022966103,0.0020843442,0.0021290681,0.0013519485,0.004260079,0.002555138,0.0017492799,0.019970149],"category_scores_gemma":[0.018718215,0.0008860252,0.003326294,0.001091973,0.0041991365,0.006127922,0.005441654,0.008368178,0.0054850825],"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.0010619325,0.00014905754,0.0015357143,0.0010679408,0.00024212636,0.00062650535,0.0013156477,0.06585885,0.013614449,0.8166676,0.016842853,0.08101737],"study_design_scores_gemma":[0.00014446984,0.0003305644,0.0019163922,0.00017902807,0.00021352054,0.0007894356,0.00028808304,0.55911404,0.017373664,0.38995224,0.029565813,0.0001327653],"about_ca_topic_score_codex":0.0064759003,"about_ca_topic_score_gemma":0.005137744,"teacher_disagreement_score":0.019970149,"about_ca_system_score_codex":0.0035933687,"about_ca_system_score_gemma":0.0017959892,"threshold_uncertainty_score":0.06680679},"labels":[],"label_agreement":null},{"id":"W1975863402","doi":"10.4153/cmb-2000-053-3","title":"Nonconvexity of the Generalized Numerical Range Associated with the Principal Character","year":2000,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto; National Science Foundation","keywords":"Mathematics; Combinatorics; Numerical range; Hermitian matrix; Eigenvalues and eigenvectors; Normal matrix; Matrix (chemical analysis); Regular polygon; Pure mathematics; Geometry; Physics","score_opus":0.009515595999882782,"score_gpt":0.196245722809336,"score_spread":0.18673012680945322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975863402","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89712936,0.0001185605,0.08315707,0.00025567363,0.000021352667,0.000020793364,0.00010667875,0.00011852319,0.019071946],"genre_scores_gemma":[0.9919482,0.00006437442,0.0054159868,0.000028517035,0.000034385055,0.000020393,0.00009060258,0.00002915062,0.0023683156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993436,0.00017706091,0.000029039978,0.00011170128,0.00020353151,0.00013504708],"domain_scores_gemma":[0.99731773,0.0010134554,0.0005530936,0.0003234978,0.0003755859,0.0004166275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005992725,0.00037672353,0.0003894468,0.0010896927,0.00068486057,0.0016700028,0.0004488901,0.00034957507,0.003508788],"category_scores_gemma":[0.0044122054,0.00025712335,0.00030354384,0.00044244216,0.0028516662,0.0020200154,0.0014633065,0.0007299616,0.00040435678],"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.00025137246,0.000049489063,0.0070348377,0.000083921455,0.00003149901,0.0010496672,0.0005581404,0.024503363,0.026514448,0.92264336,0.0014988172,0.015781088],"study_design_scores_gemma":[0.000039643703,0.00022383948,0.0078015784,0.000057958103,0.000023436314,0.0021124503,0.00082881644,0.24114929,0.02573141,0.71508074,0.006855811,0.000094908035],"about_ca_topic_score_codex":0.0005770078,"about_ca_topic_score_gemma":0.00048077042,"teacher_disagreement_score":0.003508788,"about_ca_system_score_codex":0.00049699954,"about_ca_system_score_gemma":0.00024932166,"threshold_uncertainty_score":0.011738002},"labels":[],"label_agreement":null},{"id":"W1975995200","doi":"10.1016/s0022-247x(02)00111-7","title":"Riccati differential inequalities and dichotomies for linear systems","year":2002,"lang":"en","type":"article","venue":"Journal of Mathematical 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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Linear subspace; Pure mathematics; Bounded function; Diagonal; Linear system; Diagonally dominant matrix; Dichotomy; Matrix (chemical analysis); Riccati equation; Applied mathematics; Differential equation; Mathematical analysis; Geometry","score_opus":0.025049089670494417,"score_gpt":0.2656101660522384,"score_spread":0.240561076381744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975995200","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16790406,0.0068538296,0.6802466,0.008355927,0.0005975084,0.00014579229,0.0008043031,0.0002182869,0.13487372],"genre_scores_gemma":[0.94447726,0.0024148517,0.028369782,0.001019902,0.0006383193,0.00030190885,0.000563605,0.000064852065,0.022149572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992036,0.00023145265,0.000045149784,0.00016545561,0.00022629923,0.00012798178],"domain_scores_gemma":[0.9972741,0.0018333354,0.00030392795,0.00010165758,0.0003510116,0.00013591086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016308941,0.0009809999,0.0012677592,0.0014405581,0.0013566924,0.0025627047,0.001124992,0.0014693442,0.0068821344],"category_scores_gemma":[0.004625497,0.00056913,0.0009728599,0.001075491,0.002720032,0.0032434093,0.0025002633,0.0051153377,0.00056261604],"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.000053957232,0.000034100147,0.0002030718,0.000088426284,0.000023098897,0.00006988627,0.00028972194,0.009928674,0.001346876,0.97933894,0.0023006792,0.0063225226],"study_design_scores_gemma":[0.000021640475,0.00002240775,0.00033464356,0.000021184058,0.000008708474,0.00004153646,0.00012333105,0.08459393,0.00020574073,0.9128603,0.0017488836,0.000017677505],"about_ca_topic_score_codex":0.0024206825,"about_ca_topic_score_gemma":0.002091136,"teacher_disagreement_score":0.0068821344,"about_ca_system_score_codex":0.0019824924,"about_ca_system_score_gemma":0.0009795546,"threshold_uncertainty_score":0.02302301},"labels":[],"label_agreement":null},{"id":"W1976069054","doi":"10.1007/pl00005447","title":"Componentwise perturbation analyses for the QR factorization","year":2001,"lang":"de","type":"article","venue":"Numerische Mathematik","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Perturbation (astronomy); Triangular matrix; Factorization; Bounded function; QR decomposition; Estimator; Condition number; Combinatorics; Numerical analysis; Applied mathematics; Mathematical analysis; Pure mathematics; Algorithm; Eigenvalues and eigenvectors; Statistics; Physics","score_opus":0.07914751566550819,"score_gpt":0.332675034205905,"score_spread":0.2535275185403968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976069054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005564596,0.00044300058,0.9875108,0.00035810724,0.00014787662,0.000030820327,0.000089142195,0.00018916088,0.0056664636],"genre_scores_gemma":[0.3597855,0.0029113546,0.5972015,0.0007088091,0.00076956797,0.00034806738,0.0006638337,0.0014622858,0.036149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989329,0.0005250809,0.00003651385,0.000090022295,0.00033361232,0.00008173931],"domain_scores_gemma":[0.996837,0.001694907,0.00020842325,0.00041088965,0.0007210558,0.0001276704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016094025,0.0013703417,0.0007638813,0.0013332621,0.0005425052,0.001501005,0.0008490725,0.000840736,0.008895811],"category_scores_gemma":[0.008485661,0.0004224799,0.0007207724,0.0011763872,0.0013569231,0.00242413,0.0018220474,0.0024084866,0.002396244],"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.0001605769,0.00007659633,0.00034002852,0.00021324615,0.000054784905,0.00011564608,0.00015443283,0.107352234,0.008847576,0.819458,0.007920152,0.055306707],"study_design_scores_gemma":[0.0000094003035,0.000023610219,0.0001511278,0.000023127182,0.0000133719595,0.000040202034,0.00002876918,0.69837326,0.0021143656,0.2952457,0.003957878,0.000019129238],"about_ca_topic_score_codex":0.001618045,"about_ca_topic_score_gemma":0.0014381252,"teacher_disagreement_score":0.008895811,"about_ca_system_score_codex":0.00061035465,"about_ca_system_score_gemma":0.0008188612,"threshold_uncertainty_score":0.029759467},"labels":[],"label_agreement":null},{"id":"W1976094079","doi":"10.1016/s0024-3795(01)00606-1","title":"Unitary similarity of matrices with quadratic minimal polynomials","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":17,"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 Waterloo","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Quadratic equation; Similarity (geometry); Unitary state; Unitary matrix; Circular ensemble; Hermitian matrix; Tuple; Combinatorics; Singular value; Canonical form; Pure mathematics; Algebra over a field; Discrete mathematics; Image (mathematics)","score_opus":0.015665610903936058,"score_gpt":0.2305340453147087,"score_spread":0.21486843441077264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976094079","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5917975,0.0006853996,0.35024947,0.0010750772,0.00044611032,0.000101774756,0.00017047283,0.0003170575,0.0551571],"genre_scores_gemma":[0.95858717,0.00026203497,0.02434219,0.0003019049,0.0003530932,0.00005319113,0.00023475116,0.000096904514,0.015768664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990551,0.00025345013,0.000035534045,0.00017824999,0.0003256438,0.00015213704],"domain_scores_gemma":[0.9979723,0.00063105306,0.0003830806,0.00021473753,0.00045015707,0.00034867343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007246679,0.00041900613,0.000698087,0.0014135062,0.0010601574,0.0018498685,0.0012242198,0.0010960741,0.005160191],"category_scores_gemma":[0.005682293,0.0003128114,0.0005075993,0.001096402,0.002183804,0.0025844174,0.00195871,0.0013680467,0.0006538072],"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.00007284316,0.000049720795,0.00029543915,0.000030296938,0.000009098682,0.00007194888,0.0002366926,0.0027997692,0.002619571,0.9812036,0.0010773425,0.011533661],"study_design_scores_gemma":[0.000015560476,0.0000462088,0.0003248091,0.000007691542,0.0000045878737,0.00011668699,0.00012535913,0.024306314,0.0013137223,0.97214884,0.0015722495,0.000017918694],"about_ca_topic_score_codex":0.0009117559,"about_ca_topic_score_gemma":0.0008717402,"teacher_disagreement_score":0.005160191,"about_ca_system_score_codex":0.000699046,"about_ca_system_score_gemma":0.0007173879,"threshold_uncertainty_score":0.017262518},"labels":[],"label_agreement":null},{"id":"W1976521968","doi":"10.1016/j.laa.2011.04.045","title":"Notes on matrices with diagonally dominant properties","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kelowna General Hospital","funders":"","keywords":"Diagonally dominant matrix; Irreducibility; Mathematics; Invertible matrix; Diagonal; Pure mathematics; Matrix (chemical analysis); Combinatorics; Geometry","score_opus":0.024187376971490097,"score_gpt":0.22316519575977475,"score_spread":0.19897781878828466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976521968","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061511125,0.021382941,0.40157282,0.014092999,0.010831315,0.00006909531,0.001143833,0.00066632434,0.4887295],"genre_scores_gemma":[0.6844051,0.025957106,0.0818131,0.0072038616,0.020489996,0.00024747718,0.0010010016,0.00069057086,0.17819181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994784,0.000121708945,0.000029112227,0.0001234199,0.00019544996,0.000052004678],"domain_scores_gemma":[0.9981446,0.0011629735,0.000123945,0.00020402517,0.00024860178,0.000115887524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071485795,0.001418156,0.0008371614,0.0021521028,0.0013108829,0.002154196,0.0010090667,0.001107893,0.012777075],"category_scores_gemma":[0.00368673,0.00041986498,0.00058447523,0.0036890672,0.003490272,0.0039194194,0.0016179811,0.0035039533,0.0026317004],"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.000018488847,0.000017921406,0.000044018198,0.00009085198,0.000005081152,0.000056961064,0.00012923204,0.00068795594,0.00080729247,0.9771195,0.008834254,0.012188358],"study_design_scores_gemma":[0.00000576141,0.000013190527,0.00007998647,0.000015868005,0.0000045849674,0.000069259106,0.00003253665,0.0013977875,0.00032202623,0.985635,0.012414224,0.000009961082],"about_ca_topic_score_codex":0.00081048004,"about_ca_topic_score_gemma":0.0008708054,"teacher_disagreement_score":0.012777075,"about_ca_system_score_codex":0.0006966631,"about_ca_system_score_gemma":0.0005149203,"threshold_uncertainty_score":0.042743504},"labels":[],"label_agreement":null},{"id":"W1977120869","doi":"10.1090/s0025-5718-03-01542-4","title":"A pseudospectral mapping theorem","year":2003,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":13,"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","keywords":"Mathematics; Banach space; Bounded function; Stability (learning theory); Applied mathematics; Spectral theorem; Pure mathematics; Algebra over a field; Mathematical analysis; Operator theory; Computer science","score_opus":0.01641740656565617,"score_gpt":0.24472559911375275,"score_spread":0.2283081925480966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977120869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056426316,0.0010423913,0.89726216,0.0013361765,0.0003995532,0.00006207611,0.00013057962,0.00027997393,0.043060824],"genre_scores_gemma":[0.8863163,0.001004905,0.09644526,0.0009574433,0.00053466717,0.0001418059,0.00013288214,0.00014210984,0.014324671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992619,0.0001309315,0.00003985424,0.00014832507,0.00033698976,0.000081944214],"domain_scores_gemma":[0.99854726,0.0005758793,0.00014715112,0.00020204051,0.000385904,0.00014178362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013204721,0.00064604287,0.00041694078,0.0012482259,0.000892724,0.0013143246,0.0006561777,0.00091018534,0.005311024],"category_scores_gemma":[0.004291972,0.0002555777,0.000712446,0.0005793273,0.0023933107,0.0041865394,0.0019645193,0.0019783182,0.00085606094],"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.000008594162,0.000010556794,0.00017077675,0.000031849922,0.0000069788066,0.00007850028,0.0000978199,0.0025005732,0.0033776867,0.9826293,0.0008669803,0.010220479],"study_design_scores_gemma":[0.000007833947,0.000050341438,0.00030171094,0.000019870637,0.000005667675,0.00035485474,0.000055424985,0.048457988,0.003311399,0.94021064,0.007207689,0.00001655206],"about_ca_topic_score_codex":0.0002690009,"about_ca_topic_score_gemma":0.00011789288,"teacher_disagreement_score":0.005311024,"about_ca_system_score_codex":0.00040874816,"about_ca_system_score_gemma":0.00044593497,"threshold_uncertainty_score":0.017767131},"labels":[],"label_agreement":null},{"id":"W1977219132","doi":"10.1007/s10543-006-0049-0","title":"Condition Numbers for Structured Least Squares Problems","year":2006,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Toeplitz matrix; Total least squares; Least-squares function approximation; Generalized least squares; Non-linear least squares; Linear least squares; Applied mathematics; Algebra over a field; Statistics; Explained sum of squares; Pure mathematics; Regression analysis; Linear model","score_opus":0.011017620092355728,"score_gpt":0.24290098895045403,"score_spread":0.2318833688580983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977219132","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064076437,0.00042834377,0.9831335,0.0007508077,0.00022984862,0.00006495122,0.0002532589,0.000249926,0.008481709],"genre_scores_gemma":[0.26528603,0.0018787383,0.707992,0.00090261985,0.0009844983,0.0012679512,0.0018509893,0.0008350274,0.019002154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966355,0.0013677969,0.00014555186,0.00033546565,0.0013391046,0.00017662994],"domain_scores_gemma":[0.9793682,0.015150779,0.0012622969,0.001375362,0.0022817377,0.0005615653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004074739,0.0013737711,0.00096642086,0.0016058643,0.0009979217,0.0027212116,0.0017733173,0.0018963143,0.016770268],"category_scores_gemma":[0.043509085,0.0006610847,0.00049070513,0.0022381446,0.0027364893,0.0055113644,0.0019895448,0.0042507285,0.0035144163],"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.00012908477,0.000043105247,0.00032054677,0.00022975032,0.000019000643,0.00006761137,0.000097404576,0.06107397,0.0018200574,0.8679586,0.012782247,0.05545863],"study_design_scores_gemma":[0.00002630522,0.00002402729,0.00011378957,0.000046634836,0.0000052272057,0.000029343073,0.000023123683,0.23811464,0.00071803865,0.75803024,0.0028490846,0.000019501791],"about_ca_topic_score_codex":0.0010100915,"about_ca_topic_score_gemma":0.0015125487,"teacher_disagreement_score":0.016770268,"about_ca_system_score_codex":0.0012901974,"about_ca_system_score_gemma":0.0020959547,"threshold_uncertainty_score":0.056102157},"labels":[],"label_agreement":null},{"id":"W1977424948","doi":"10.1093/imanum/drm051","title":"Linearization of matrix polynomials expressed in polynomial bases","year":2008,"lang":"en","type":"article","venue":"IMA Journal of Numerical Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Polynomial matrix; Monomial; Difference polynomials; Polynomial; Matrix polynomial; Degree (music); Linearization; Matrix (chemical analysis); Pure mathematics; Discrete orthogonal polynomials; Class (philosophy); Algebra over a field; Classical orthogonal polynomials; Symmetric polynomial; Orthogonal polynomials; Mathematical analysis; Nonlinear system","score_opus":0.013832887612086802,"score_gpt":0.26450629829156397,"score_spread":0.2506734106794772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977424948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16301289,0.0003634503,0.7946829,0.0004375923,0.00013886357,0.00005882243,0.00016076259,0.0004972403,0.04064745],"genre_scores_gemma":[0.92409194,0.0006265638,0.054503847,0.00021070665,0.00013796556,0.000059474045,0.00019779737,0.00019292263,0.019978756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995833,0.00011321307,0.000014966238,0.00005684025,0.00015741526,0.0000741969],"domain_scores_gemma":[0.99965334,0.000106841035,0.000061383136,0.000058894213,0.00008380772,0.000035783098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005933574,0.00050133956,0.00030395592,0.0005975059,0.0003257186,0.00086938194,0.00058399496,0.0003427493,0.0053818896],"category_scores_gemma":[0.0017494156,0.0002156673,0.00039698882,0.00044744805,0.0010809386,0.0014132155,0.0011322831,0.0010516238,0.0017464976],"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.000048708047,0.00002662851,0.00023005079,0.00007771092,0.000011998667,0.00015663898,0.00043450246,0.021586504,0.016681854,0.9402307,0.0011855069,0.019328984],"study_design_scores_gemma":[0.000020470221,0.00019965207,0.00039253902,0.000049632155,0.0000136203535,0.00030199712,0.00043250446,0.1857262,0.019008959,0.78252625,0.011269085,0.00005912898],"about_ca_topic_score_codex":0.00066500856,"about_ca_topic_score_gemma":0.00041378307,"teacher_disagreement_score":0.0053818896,"about_ca_system_score_codex":0.0005189793,"about_ca_system_score_gemma":0.0004017226,"threshold_uncertainty_score":0.018004179},"labels":[],"label_agreement":null},{"id":"W1977542123","doi":"10.1016/j.laa.2006.11.001","title":"On Cullis’ determinant for rectangular matrices","year":2007,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"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":"University of Calcutta; McGill University","keywords":"Mathematics; Matrix (chemical analysis); Combinatorics; Vector space; Space (punctuation); Basis (linear algebra); Square matrix; Tuple; Value (mathematics); Standard basis; Characterization (materials science); Pure mathematics; Discrete mathematics; Symmetric matrix; Geometry; Eigenvalues and eigenvectors; Physics","score_opus":0.010924970033286798,"score_gpt":0.27221365502568934,"score_spread":0.26128868499240254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977542123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07639901,0.0046022004,0.8038361,0.0028773216,0.0017722202,0.000055546698,0.00031492286,0.00066745415,0.10947518],"genre_scores_gemma":[0.8211394,0.00415765,0.114372574,0.0013406872,0.0016662913,0.00009433047,0.00044869015,0.0006936481,0.056086678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905473,0.000307943,0.000038109294,0.00014348677,0.0003498962,0.00010585662],"domain_scores_gemma":[0.997426,0.0013650731,0.0001707836,0.00032988758,0.00050850835,0.000199691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016614881,0.0008276319,0.0008972474,0.0019234346,0.00092309486,0.0017991979,0.0011760892,0.00085581385,0.008563216],"category_scores_gemma":[0.008393155,0.0004124726,0.0004894879,0.0017996851,0.0035156189,0.0032659105,0.0019526399,0.0022354277,0.0018227579],"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.000023159184,0.000015021915,0.00025025808,0.000045362904,0.000009218565,0.00005184264,0.00015524628,0.004626032,0.0007373319,0.96653664,0.0071395044,0.020410467],"study_design_scores_gemma":[0.000006712886,0.000017217697,0.00021634018,0.00002035308,0.0000071662694,0.00010575713,0.00007490647,0.034406513,0.0008954485,0.9529093,0.011318516,0.000021854836],"about_ca_topic_score_codex":0.0021965068,"about_ca_topic_score_gemma":0.0028764724,"teacher_disagreement_score":0.008563216,"about_ca_system_score_codex":0.0011057531,"about_ca_system_score_gemma":0.0008226376,"threshold_uncertainty_score":0.028646827},"labels":[],"label_agreement":null},{"id":"W1978669999","doi":"10.1016/j.indag.2012.06.005","title":"Inverse problems for Hermitian quadratic matrix polynomials","year":2012,"lang":"en","type":"article","venue":"Indagationes Mathematicae","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Invertible matrix; Hermitian matrix; Positive-definite matrix; Pure mathematics; Eigenvalues and eigenvectors; Factorization; Quadratic equation; Matrix (chemical analysis); Inverse; Quadratic function; Algebra over a field; Mathematical analysis; Algorithm; Geometry","score_opus":0.029252671875136766,"score_gpt":0.28873330934530955,"score_spread":0.2594806374701728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978669999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10828408,0.0023103256,0.8305898,0.003492695,0.00055350654,0.000050558196,0.00014807086,0.00017581267,0.05439527],"genre_scores_gemma":[0.73767257,0.0034639623,0.17943886,0.0009830694,0.0014424721,0.00015578326,0.0005069946,0.0003530939,0.07598324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991136,0.00038623813,0.000031353044,0.00012700199,0.00025365557,0.00008807362],"domain_scores_gemma":[0.9968489,0.0023179294,0.00018736316,0.00018389524,0.00030203417,0.00015978634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001363343,0.0008972705,0.00088022416,0.0011643126,0.00095934194,0.0020195232,0.001030217,0.0016994851,0.007990761],"category_scores_gemma":[0.008301948,0.00052508735,0.00071716704,0.0010468315,0.0029245385,0.004152892,0.0021187086,0.0036386084,0.0010026022],"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.000041213265,0.000047011043,0.00023387393,0.0001003413,0.0000133153235,0.00009771908,0.00023973998,0.011121652,0.00089631794,0.96647525,0.0027328008,0.01800079],"study_design_scores_gemma":[0.000014700705,0.000013006241,0.00009346177,0.000012761904,0.0000035122996,0.000077623576,0.000073122406,0.041232187,0.00033879388,0.9565509,0.0015777422,0.000012179911],"about_ca_topic_score_codex":0.0010889439,"about_ca_topic_score_gemma":0.001226049,"teacher_disagreement_score":0.007990761,"about_ca_system_score_codex":0.00077649974,"about_ca_system_score_gemma":0.0007094452,"threshold_uncertainty_score":0.02673173},"labels":[],"label_agreement":null},{"id":"W1978689577","doi":"10.1016/j.cam.2005.04.023","title":"Rank equalities for idempotent matrices with applications","year":2005,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Idempotence; Idempotent matrix; Rank (graph theory); Variety (cybernetics); Block (permutation group theory); Algebra over a field; Matrix (chemical analysis); Block matrix; Combinatorics; Arithmetic; Pure mathematics; Statistics; Eigenvalues and eigenvectors","score_opus":0.016901157895512362,"score_gpt":0.2615121024575413,"score_spread":0.24461094456202895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978689577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08476902,0.002688192,0.8310396,0.0023850757,0.00078175135,0.00008081887,0.00040317475,0.00048189316,0.07737046],"genre_scores_gemma":[0.7606682,0.0042125047,0.17621233,0.0014842942,0.0032466871,0.00026715576,0.00077904586,0.0005374758,0.052592408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756026,0.00076638185,0.00016155858,0.00041571146,0.000785019,0.0003110695],"domain_scores_gemma":[0.9851746,0.009765672,0.0011326767,0.0013686633,0.0017257262,0.0008326584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028681853,0.0014670513,0.00095325557,0.002612184,0.0014028611,0.0039392784,0.001360547,0.001235745,0.016166344],"category_scores_gemma":[0.02041498,0.00066737266,0.00083331246,0.0026745421,0.0032554052,0.007700484,0.0035792955,0.0036360058,0.0026447189],"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.00011889901,0.00005612184,0.00025074417,0.000105984305,0.000015391437,0.00014690935,0.00026586602,0.003561011,0.0017024499,0.95324194,0.0054548504,0.035079785],"study_design_scores_gemma":[0.000017102604,0.000031191532,0.00009869925,0.000014062249,0.0000070134943,0.0001639402,0.000048453516,0.00968136,0.00083210616,0.98622406,0.0028649846,0.00001714467],"about_ca_topic_score_codex":0.00041901192,"about_ca_topic_score_gemma":0.0005643815,"teacher_disagreement_score":0.016166344,"about_ca_system_score_codex":0.0006434022,"about_ca_system_score_gemma":0.0007519786,"threshold_uncertainty_score":0.054081857},"labels":[],"label_agreement":null},{"id":"W1978948045","doi":"10.1016/j.laa.2011.05.032","title":"Pseudospectra do not determine norm behavior, even for matrices with only simple eigenvalues","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Simple (philosophy); Matrix norm; Norm (philosophy); Novelty; Pure mathematics; Spectrum of a matrix; Applied mathematics; Matrix differential equation; Mathematical analysis; Differential equation","score_opus":0.02413799953575811,"score_gpt":0.2601606689662538,"score_spread":0.23602266943049569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978948045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45390952,0.00035478696,0.50292784,0.00047656876,0.00055126374,0.00008882686,0.00046085555,0.0016019337,0.039628394],"genre_scores_gemma":[0.9486051,0.00036920715,0.0393781,0.00032778736,0.00033052368,0.00008337452,0.00048108274,0.0006979066,0.009726785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982413,0.00038211173,0.000096329975,0.00043423916,0.00067685166,0.00016922245],"domain_scores_gemma":[0.98950434,0.0033270963,0.0016413331,0.0025328926,0.0021295233,0.0008647915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010389918,0.0011796228,0.00058936945,0.0019775182,0.0010808598,0.0026598726,0.0010141578,0.0012194687,0.006704749],"category_scores_gemma":[0.0124183865,0.0005024969,0.00046413008,0.0007647918,0.0038154344,0.007893613,0.0012426717,0.0015871223,0.002040937],"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.00046534877,0.00032014278,0.008645974,0.00033818025,0.00006439183,0.0006341043,0.0009616913,0.0065624504,0.05385458,0.8242836,0.006230646,0.097638875],"study_design_scores_gemma":[0.000021307113,0.00021700552,0.004873072,0.000067943496,0.000022608676,0.0015922254,0.00037086164,0.06167089,0.022644099,0.90460944,0.0037273841,0.00018317107],"about_ca_topic_score_codex":0.00022318281,"about_ca_topic_score_gemma":0.0003569902,"teacher_disagreement_score":0.006704749,"about_ca_system_score_codex":0.00026500179,"about_ca_system_score_gemma":0.0006210148,"threshold_uncertainty_score":0.022429645},"labels":[],"label_agreement":null},{"id":"W1981437408","doi":"10.1016/j.laa.2006.11.022","title":"Alternative characterizations of the extended Wedderburn–Guttman theorem","year":2007,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Rank (graph theory); Guttman scale; Combinatorics; Singular value decomposition; Matrix (chemical analysis); Algebra over a field; Pure mathematics; Statistics; Chemistry; Algorithm","score_opus":0.00952168426645721,"score_gpt":0.2514310791868858,"score_spread":0.24190939492042857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981437408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14498651,0.0033592726,0.6388215,0.005340057,0.0014989756,0.000086139415,0.00066133996,0.00028584234,0.20496038],"genre_scores_gemma":[0.86502326,0.002383844,0.07360498,0.0025349087,0.0021295827,0.0001660145,0.00070107845,0.00022837012,0.05322801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896634,0.00027433882,0.000049317383,0.00024145823,0.00028341246,0.00018518542],"domain_scores_gemma":[0.99747926,0.0010627394,0.00026212487,0.0005075626,0.00046994278,0.00021840763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023133722,0.00083337683,0.00092603004,0.0021499333,0.0013245379,0.0025035383,0.0021922896,0.0013105503,0.014111948],"category_scores_gemma":[0.0061315824,0.0003127798,0.00095419923,0.0021596085,0.0029404198,0.0072935503,0.0031201183,0.003196397,0.0014107568],"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.000027696264,0.000013591199,0.00014523046,0.000026215943,0.0000071492364,0.000047151312,0.00008583081,0.0007518787,0.0003091281,0.992008,0.0014691632,0.005108942],"study_design_scores_gemma":[0.000007819221,0.000012995528,0.00016521142,0.000010605336,0.0000047485346,0.0000606579,0.00004607543,0.0087202815,0.00021649983,0.9870242,0.0037214586,0.000009399454],"about_ca_topic_score_codex":0.00058446545,"about_ca_topic_score_gemma":0.00059006753,"teacher_disagreement_score":0.014111948,"about_ca_system_score_codex":0.0010011842,"about_ca_system_score_gemma":0.0005544622,"threshold_uncertainty_score":0.047209144},"labels":[],"label_agreement":null},{"id":"W1982059058","doi":"10.1137/080724071","title":"Stopping Criteria for the Iterative Solution of Linear Least Squares Problems","year":2009,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Residual; Least-squares function approximation; Mathematical optimization; Limit (mathematics); Applied mathematics; Iterative method; Numerical analysis; Property (philosophy); Linear least squares; Algorithm; Linear model; Statistics; Mathematical analysis","score_opus":0.02002872561713478,"score_gpt":0.31837690690640064,"score_spread":0.2983481812892659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982059058","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030193045,0.0003051868,0.99495065,0.00020678311,0.000029443961,0.000040738014,0.000018489,0.0001264106,0.0013029713],"genre_scores_gemma":[0.18019553,0.0006065183,0.81341094,0.0003908015,0.00015164808,0.00070634513,0.0002722646,0.0006398609,0.0036261103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9900789,0.0058059725,0.00057657756,0.000619014,0.0025613583,0.00035813847],"domain_scores_gemma":[0.9521485,0.03572194,0.0029995472,0.0016293696,0.0066942,0.0008064768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014991079,0.0015033631,0.0015490944,0.0016699203,0.0009351234,0.0020140624,0.0021844807,0.0022551473,0.0029862754],"category_scores_gemma":[0.0686665,0.00075820927,0.0010373796,0.0011258541,0.002976218,0.0023864326,0.002722976,0.0030849134,0.001259777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005121968,0.0000912581,0.0037204835,0.00096268347,0.000162551,0.00063195254,0.00084278936,0.44144782,0.019712169,0.43571493,0.0052294987,0.09097162],"study_design_scores_gemma":[0.000031481388,0.00010011035,0.00027378293,0.00009750577,0.00001598012,0.00010672526,0.00003898362,0.9114553,0.006311006,0.0781446,0.0033848311,0.000039745075],"about_ca_topic_score_codex":0.0008871568,"about_ca_topic_score_gemma":0.0006057679,"teacher_disagreement_score":0.014991079,"about_ca_system_score_codex":0.0010307924,"about_ca_system_score_gemma":0.0013671304,"threshold_uncertainty_score":0.07928133},"labels":[],"label_agreement":null},{"id":"W1982600546","doi":"10.1007/s10596-014-9447-6","title":"Algorithmically scalable block preconditioner for fully implicit shallow-water equations in CAM-SE","year":2014,"lang":"en","type":"article","venue":"Computational Geosciences","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Preconditioner; Solver; Scalability; Computer science; Block (permutation group theory); Shallow water equations; Computational science; Applied mathematics; Linear system; Parallel computing; Multigrid method; Suite; Mathematical optimization; Algorithm; Mathematics; Partial differential equation; Iterative method; Mathematical analysis; Geometry","score_opus":0.01646995249037093,"score_gpt":0.26378786160715173,"score_spread":0.2473179091167808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982600546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06595279,0.00017228161,0.9206915,0.00043871667,0.0001975388,0.00012878855,0.00042616448,0.0021252576,0.009866937],"genre_scores_gemma":[0.37990624,0.00015202354,0.6083544,0.00019084141,0.000105686944,0.00038583425,0.0006974071,0.00066298584,0.0095445365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981064,0.000055610166,0.000010740356,0.000020388692,0.0000702662,0.000032314143],"domain_scores_gemma":[0.99939096,0.0002575572,0.000039338658,0.0001054225,0.00014847783,0.000058272715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038820726,0.00053440215,0.0009639187,0.00027718005,0.0005533232,0.0006885824,0.0013933397,0.0012694956,0.006344579],"category_scores_gemma":[0.0017381476,0.0003793504,0.00043117994,0.00038452735,0.00055302575,0.0008674337,0.0014142771,0.0015769536,0.0013729968],"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.00052437827,0.000267133,0.0014967937,0.0002666091,0.00007531661,0.00025083328,0.0002620218,0.7943149,0.022379898,0.040234458,0.010729673,0.12919796],"study_design_scores_gemma":[0.00003389924,0.000014765483,0.00006534748,0.0000040866958,0.0000024327442,0.0000056307135,0.000012407533,0.9953021,0.001019193,0.0026727237,0.00086406927,0.0000033664237],"about_ca_topic_score_codex":0.009139177,"about_ca_topic_score_gemma":0.018137509,"teacher_disagreement_score":0.009139177,"about_ca_system_score_codex":0.00033325303,"about_ca_system_score_gemma":0.0015810039,"threshold_uncertainty_score":0.021224737},"labels":[],"label_agreement":null},{"id":"W1982695316","doi":"10.1117/12.615410","title":"Block Lanczos tridiagonalization of complex symmetric matrices","year":2005,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lanczos resampling; Lanczos algorithm; Block (permutation group theory); Orthogonality; Symmetric matrix; Mathematics; Algorithm; Computer science; Combinatorics; Physics; Eigenvalues and eigenvectors; Quantum mechanics; Geometry","score_opus":0.013105672448429214,"score_gpt":0.2338872200521105,"score_spread":0.22078154760368127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982695316","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053692353,0.00016403728,0.9903368,0.00009975082,0.000087012835,0.0000614612,0.000076081276,0.0008365123,0.0029691714],"genre_scores_gemma":[0.08655162,0.0004657994,0.9023995,0.00014955779,0.000072532785,0.00019369542,0.0004020864,0.00037529325,0.009389852],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954873,0.00009864941,0.00002881177,0.000049109287,0.00022873131,0.000045835433],"domain_scores_gemma":[0.99933463,0.0001686088,0.00006637787,0.00012300818,0.00027439653,0.000033045377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040535713,0.00078291853,0.0005130989,0.00055115874,0.00041000027,0.00079432083,0.0005614745,0.00051005295,0.0064469483],"category_scores_gemma":[0.0020877756,0.00024726117,0.00042217996,0.00090246723,0.00052356656,0.00087096344,0.0005260321,0.0010001123,0.0022981043],"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.00043530655,0.00009646104,0.0007357384,0.00054650987,0.000086168715,0.00027771256,0.00031790143,0.16262536,0.16699488,0.12824976,0.026898345,0.51273584],"study_design_scores_gemma":[0.000053514108,0.00009739024,0.00030260414,0.000022575954,0.000012755537,0.00011491878,0.000050844854,0.92721075,0.036638726,0.015215849,0.020251421,0.000028636283],"about_ca_topic_score_codex":0.0044921916,"about_ca_topic_score_gemma":0.00722119,"teacher_disagreement_score":0.0064469483,"about_ca_system_score_codex":0.00043001547,"about_ca_system_score_gemma":0.0015641103,"threshold_uncertainty_score":0.021567225},"labels":[],"label_agreement":null},{"id":"W1983086303","doi":"10.1016/j.laa.2008.09.032","title":"A review of infinite matrices and their applications","year":2008,"lang":"en","type":"review","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Diagonally dominant matrix; Partial differential equation; Invertible matrix; Laplace operator; Applied mathematics; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.025939685950276754,"score_gpt":0.2986335630863632,"score_spread":0.27269387713608645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983086303","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021409495,0.99399096,0.001709345,0.0006440464,0.0004798864,0.000006668741,0.000029792547,0.00001799695,0.0029072766],"genre_scores_gemma":[0.0014340745,0.9939634,0.0016437967,0.00054903113,0.0010402568,0.000014570219,0.00005235161,0.00000626778,0.0012962965],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996289,0.00008021073,0.00005087552,0.00006175837,0.00015065282,0.00002759225],"domain_scores_gemma":[0.9989183,0.00059309625,0.00009401927,0.000043744254,0.00029905234,0.000051782285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073055836,0.0009586867,0.0015223107,0.003356221,0.00047166282,0.0014742161,0.0013101477,0.0011872437,0.0050142915],"category_scores_gemma":[0.001933569,0.00047711696,0.0004523762,0.0049687214,0.00094607816,0.0029060731,0.0009935735,0.001746634,0.0031567616],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005255144,0.0000853304,0.00023103367,0.01352223,0.000065378495,0.000115804796,0.0000813994,0.0007636206,0.0015954496,0.029948348,0.06645611,0.8870828],"study_design_scores_gemma":[0.000009791572,0.000060660655,0.00039710064,0.0020935882,0.000047321166,0.0006756677,0.00005134494,0.00025469993,0.00044286155,0.012716628,0.9832265,0.000023782506],"about_ca_topic_score_codex":0.00080553687,"about_ca_topic_score_gemma":0.0015774867,"teacher_disagreement_score":0.0050142915,"about_ca_system_score_codex":0.00066163344,"about_ca_system_score_gemma":0.0015026189,"threshold_uncertainty_score":0.016774535},"labels":[],"label_agreement":null},{"id":"W1983405890","doi":"10.1017/s0266466605050292","title":"THREE RANK FORMULAS ASSOCIATED WITH THE COVARIANCE MATRICES OF THE BLUE AND THE OLSE IN THE GENERAL LINEAR MODEL","year":2005,"lang":"en","type":"article","venue":"Econometric Theory","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":22,"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; McGill University","funders":"","keywords":"Mathematics; Rank (graph theory); Covariance; Best linear unbiased prediction; Estimator; Combinatorics; Ordinary least squares; Applied mathematics; Statistics; Artificial intelligence","score_opus":0.011541924794223814,"score_gpt":0.21412059033721884,"score_spread":0.20257866554299503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983405890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015522648,0.002416753,0.9651823,0.0018170674,0.00018046633,0.00004909152,0.0002515146,0.00021984491,0.014360298],"genre_scores_gemma":[0.5100752,0.0069205086,0.45646784,0.0017075505,0.0017181806,0.00044037844,0.0007620317,0.00055593846,0.021352323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946207,0.0024151078,0.00027996523,0.0006174992,0.0015845734,0.00048226668],"domain_scores_gemma":[0.9853452,0.008127075,0.0024729697,0.0016820251,0.001916025,0.0004566982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008287219,0.0014360764,0.0011418158,0.0026372445,0.00076122425,0.0042970227,0.0016815003,0.0020738947,0.0062958593],"category_scores_gemma":[0.03955899,0.00074907835,0.0010081687,0.0020647666,0.0054249386,0.008068408,0.0033737286,0.0038757627,0.0016316926],"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.00002938617,0.000013664574,0.0007772853,0.00008401165,0.00001924006,0.00009598861,0.0001614525,0.0068266345,0.0004494352,0.96526015,0.0016907494,0.024591975],"study_design_scores_gemma":[0.000017983537,0.00006230003,0.00075780746,0.000069946014,0.000032170912,0.00032082523,0.00012763438,0.058872726,0.001076042,0.93296725,0.005618099,0.00007724433],"about_ca_topic_score_codex":0.0016612746,"about_ca_topic_score_gemma":0.0015182067,"teacher_disagreement_score":0.008287219,"about_ca_system_score_codex":0.0012893007,"about_ca_system_score_gemma":0.0012887224,"threshold_uncertainty_score":0.043827534},"labels":[],"label_agreement":null},{"id":"W1983942331","doi":"10.1016/j.laa.2008.01.012","title":"A Lanczos bidiagonalization algorithm for Hankel matrices","year":2008,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Hankel matrix; Lanczos resampling; Mathematics; Lanczos algorithm; Orthogonalization; FLOPS; Matrix (chemical analysis); Algorithm; Multiplication (music); Matrix multiplication; Hankel transform; Applied mathematics; Combinatorics; Mathematical analysis; Computer science; Eigenvalues and eigenvectors; Parallel computing; Fourier transform","score_opus":0.01735888454936861,"score_gpt":0.2560611687746196,"score_spread":0.23870228422525097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983942331","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006927056,0.00021154976,0.98633444,0.00014634016,0.00013664203,0.00009786539,0.00014244042,0.0028367902,0.0031668285],"genre_scores_gemma":[0.043221977,0.00017072879,0.9465931,0.00015118494,0.000065054104,0.0001347686,0.00048495535,0.00049821445,0.008679904],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993537,0.00011292345,0.00004130475,0.000109757086,0.000307214,0.00007504789],"domain_scores_gemma":[0.999204,0.00016304936,0.000037372534,0.0002195197,0.00031022585,0.00006593107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059720327,0.00082593324,0.0008408229,0.00096938334,0.00090239284,0.0014595697,0.0012637838,0.00069204194,0.012652715],"category_scores_gemma":[0.0024423327,0.000522975,0.00050229195,0.001487137,0.00054648553,0.0013292682,0.0016687901,0.0014554925,0.006682496],"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.0005246607,0.00014954027,0.0004809078,0.00019810036,0.00006290644,0.00010290993,0.00019903698,0.017281136,0.032587197,0.044966836,0.019375892,0.8840709],"study_design_scores_gemma":[0.0005258333,0.00037778754,0.00092152983,0.0000672493,0.00006876119,0.00048175929,0.0002424252,0.7826116,0.05518429,0.0928783,0.06648925,0.00015125825],"about_ca_topic_score_codex":0.0036114345,"about_ca_topic_score_gemma":0.0073469705,"teacher_disagreement_score":0.012652715,"about_ca_system_score_codex":0.00053918787,"about_ca_system_score_gemma":0.001702755,"threshold_uncertainty_score":0.042327583},"labels":[],"label_agreement":null},{"id":"W1983950249","doi":"10.1016/j.laa.2009.11.021","title":"Totally nonnegative <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mrow><mml:mo stretchy=\"false\">(</mml:mo><mml:mn>0</mml:mn><mml:mtext>,</mml:mtext><mml:mn>1</mml:mn><mml:mo stretchy=\"false\">)</mml:mo></mml:mrow></mml:math>-matrices","year":2009,"lang":"lv","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Scroll; Mathematics; Algorithm; Theology; Philosophy","score_opus":0.013861741678362658,"score_gpt":0.24287909892539122,"score_spread":0.22901735724702857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983950249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00913107,0.00085047603,0.65859026,0.0026975477,0.0017559682,0.00020467737,0.031089785,0.013830911,0.28184938],"genre_scores_gemma":[0.19643179,0.0026463796,0.46612036,0.0024189707,0.0015871018,0.000650221,0.06747345,0.019952945,0.24271879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982014,0.000452146,0.00017162866,0.00033816567,0.0006461269,0.00019059917],"domain_scores_gemma":[0.9959133,0.00096432486,0.00034247825,0.00078707404,0.0017235896,0.00026912562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015219135,0.0019533862,0.0008180018,0.0020560005,0.0012477605,0.0061087846,0.0012804205,0.00074258714,0.106289014],"category_scores_gemma":[0.0074282144,0.00097005226,0.0014501363,0.0035267617,0.0012119977,0.0053550103,0.0017532828,0.0022807156,0.050594896],"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.00018708779,0.000043712196,0.0003484307,0.0005187688,0.000028927727,0.00019070174,0.00031024404,0.0022266724,0.006022198,0.57770586,0.31825227,0.09416515],"study_design_scores_gemma":[0.000062959996,0.00006955677,0.0008104765,0.00014803355,0.000034919816,0.00068964844,0.00016254972,0.015152265,0.009565201,0.38339514,0.58975244,0.00015687675],"about_ca_topic_score_codex":0.0033300724,"about_ca_topic_score_gemma":0.004136185,"teacher_disagreement_score":0.106289014,"about_ca_system_score_codex":0.0014388601,"about_ca_system_score_gemma":0.0015658202,"threshold_uncertainty_score":0.35557216},"labels":[],"label_agreement":null},{"id":"W1984231350","doi":"10.1155/s0161171204311063","title":"A formula for the inner spectral radius","year":2004,"lang":"en","type":"article","venue":"International Journal of Mathematics and Mathematical Sciences","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Isfahan University of Technology; University of Regina","keywords":"Mathematics; Spectral radius; RADIUS; Moduli; Bounded function; Bounded operator; Spectrum (functional analysis); Moduli space; Banach space; Linear operators; Asymptotic formula; Operator (biology); Pure mathematics; Mathematical analysis; Eigenvalues and eigenvectors; Quantum mechanics; Physics","score_opus":0.023258326182918985,"score_gpt":0.29855556761952773,"score_spread":0.2752972414366087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984231350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115364864,0.002943224,0.7912917,0.0016562062,0.0004865489,0.00003862299,0.00018089228,0.0007897623,0.0872481],"genre_scores_gemma":[0.8684669,0.0015975506,0.1142414,0.00046574956,0.00089417084,0.000101371115,0.00018695123,0.00069748366,0.013348385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990951,0.00021342622,0.00005724923,0.00019258664,0.00034057957,0.00010097966],"domain_scores_gemma":[0.9969668,0.001435131,0.00031263742,0.00031294348,0.0007296708,0.00024279405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014840001,0.00067834783,0.00078130246,0.002452518,0.0006285168,0.0019070919,0.0012534944,0.0009688492,0.005558709],"category_scores_gemma":[0.011080131,0.00031164067,0.0005196487,0.00059373927,0.0020738947,0.0058628977,0.0018858257,0.00222013,0.0016672347],"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.000033302073,0.000010432675,0.00030435028,0.00008124072,0.0000073520378,0.00008723258,0.00017767331,0.002132171,0.0061951657,0.9734795,0.0013219459,0.016169641],"study_design_scores_gemma":[0.000009478264,0.000060295817,0.0005911203,0.00008505645,0.000015894022,0.00064891874,0.00012828315,0.050740037,0.0059112147,0.93181884,0.009944965,0.00004587515],"about_ca_topic_score_codex":0.00021139742,"about_ca_topic_score_gemma":0.0001244708,"teacher_disagreement_score":0.005558709,"about_ca_system_score_codex":0.0007188918,"about_ca_system_score_gemma":0.00025130896,"threshold_uncertainty_score":0.018595695},"labels":[],"label_agreement":null},{"id":"W1984710842","doi":"10.1002/nla.240","title":"Lanczos, Householder transformations, and implicit deflation for fast and reliable dominant singular subspace computation","year":2001,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of California, San Diego; California State University San Marcos; McGill University; University of California Berkeley","keywords":"Lanczos resampling; Lanczos algorithm; Linear subspace; Mathematics; Computation; Krylov subspace; Subspace topology; Matrix (chemical analysis); Singular value; Signal subspace; Algorithm; Numerical linear algebra; Applied mathematics; Algebra over a field; Sparse matrix; Singular spectrum analysis; Singular value decomposition; Eigenvalues and eigenvectors; Pure mathematics; Mathematical analysis; Computer science; Numerical analysis; Iterative method; Noise (video); Artificial intelligence","score_opus":0.009264214916319834,"score_gpt":0.24281266378439495,"score_spread":0.2335484488680751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984710842","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012883556,0.00022770198,0.98387825,0.00010885553,0.000052069063,0.00003251151,0.000036465444,0.0014362958,0.0013442319],"genre_scores_gemma":[0.15128455,0.0002454309,0.8447849,0.00004929823,0.000039564897,0.000102485435,0.000151334,0.0002130296,0.0031292755],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948573,0.0001868343,0.000034090204,0.00003885027,0.00021693896,0.00003748446],"domain_scores_gemma":[0.9989385,0.00044648984,0.00011125273,0.00023059202,0.00022313434,0.00005004888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084923755,0.0006318812,0.0006224921,0.00046963527,0.00043953196,0.0007287428,0.0006677054,0.0005209873,0.0037297728],"category_scores_gemma":[0.004012063,0.0003087602,0.00031905848,0.00083187176,0.0007053716,0.0011662617,0.0009280651,0.0008507602,0.001541096],"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.00047594708,0.000079652295,0.0009653967,0.00023881212,0.00007484076,0.00029163816,0.0003847297,0.38225672,0.032632012,0.11911534,0.011724137,0.4517608],"study_design_scores_gemma":[0.00003290422,0.00003058044,0.00007774585,0.0000060972134,0.0000039340634,0.000028260392,0.00001112844,0.98329103,0.0045402106,0.009233357,0.0027359494,0.000008815284],"about_ca_topic_score_codex":0.003710185,"about_ca_topic_score_gemma":0.004633211,"teacher_disagreement_score":0.0037297728,"about_ca_system_score_codex":0.00037315174,"about_ca_system_score_gemma":0.0010169647,"threshold_uncertainty_score":0.012477279},"labels":[],"label_agreement":null},{"id":"W1984859145","doi":"10.1115/imece2011-62600","title":"A Variant Algorithm for Solving Eigenvalue Equation in Linear Stability Problems","year":2011,"lang":"en","type":"article","venue":"Volume 6: Fluids and Thermal Systems; Advances for Process Industries, Parts A and B","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Windsor","funders":"","keywords":"Eigenvalues and eigenvectors; Chebyshev filter; Stability (learning theory); Linear stability; Algorithm; Applied mathematics; Mathematics; Linear system; Chebyshev polynomials; Numerical stability; Resolution (logic); Computer science; Numerical analysis; Mathematical optimization; Mathematical analysis; Nonlinear system; Physics","score_opus":0.0502492139094596,"score_gpt":0.25537252741715166,"score_spread":0.20512331350769206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984859145","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087891245,0.000042332802,0.9982211,0.00002766234,0.000030443754,0.000024919442,0.000011210328,0.00015166207,0.00061178306],"genre_scores_gemma":[0.032504667,0.00012848759,0.96364844,0.00007586735,0.000066098124,0.00024001277,0.00009152057,0.00024191804,0.0030029179],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993932,0.00020084555,0.000034898196,0.00008236618,0.0002506187,0.00003801449],"domain_scores_gemma":[0.9992225,0.00033250442,0.000047184527,0.000120568526,0.00024424083,0.00003305661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011488036,0.0008768109,0.0007646275,0.00091891526,0.0005466546,0.0008046013,0.0018401502,0.0010692828,0.004174137],"category_scores_gemma":[0.002596926,0.0003504705,0.00071108365,0.00095844566,0.0008060257,0.0011912028,0.001096589,0.0015212912,0.002120536],"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.00019711675,0.00016912368,0.0013126744,0.0003123483,0.00013414315,0.0002450548,0.0003132897,0.21164389,0.023906158,0.32013026,0.008577469,0.4330585],"study_design_scores_gemma":[0.000041724255,0.000070164046,0.00019357087,0.000014184121,0.000016056107,0.000115485636,0.000019271263,0.9465913,0.0031680611,0.040488977,0.009260859,0.000020317118],"about_ca_topic_score_codex":0.0016611068,"about_ca_topic_score_gemma":0.0017862379,"teacher_disagreement_score":0.004174137,"about_ca_system_score_codex":0.00044000102,"about_ca_system_score_gemma":0.0008455116,"threshold_uncertainty_score":0.013963878},"labels":[],"label_agreement":null},{"id":"W1985312376","doi":"10.4153/cmb-2009-002-1","title":"On the Spectrum of an <i>n</i>! × <i>n</i>! Matrix Originating from Statistical Mechanics","year":2009,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","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":true,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Spectrum (functional analysis); Eigenvalues and eigenvectors; Matrix (chemical analysis); Combinatorics; Pure mathematics; Mathematical physics; Quantum mechanics; Physics","score_opus":0.008096085047989589,"score_gpt":0.22986367016661016,"score_spread":0.22176758511862057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985312376","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6048992,0.000988525,0.3478906,0.0017651985,0.00020321165,0.000038885264,0.00021736718,0.0003514715,0.04364549],"genre_scores_gemma":[0.96509546,0.00046233257,0.028581703,0.00023743798,0.00020860854,0.00006007885,0.00010801392,0.0001669416,0.005079374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995043,0.00014459253,0.00001856813,0.00007019244,0.00019446349,0.00006787329],"domain_scores_gemma":[0.9969337,0.0018547701,0.00030164444,0.00024139705,0.00036610747,0.00030228694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011156587,0.00050387654,0.0004666681,0.001686456,0.00085181673,0.0010461994,0.00078544626,0.0007342842,0.0039209905],"category_scores_gemma":[0.005127036,0.00028396485,0.00030924304,0.0005474725,0.0023788363,0.0018396194,0.0009774291,0.0007687624,0.00059323636],"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.00007652325,0.00003369498,0.0005835659,0.000056284545,0.0000065677123,0.00043884682,0.00029969693,0.008204535,0.010304108,0.96977407,0.001916443,0.008305594],"study_design_scores_gemma":[0.000020186482,0.000053452626,0.0011000355,0.000063205756,0.0000066073226,0.0005260967,0.00012932568,0.18901901,0.0037694473,0.8033356,0.0019311085,0.000045884557],"about_ca_topic_score_codex":0.00070095895,"about_ca_topic_score_gemma":0.0004977996,"teacher_disagreement_score":0.0039209905,"about_ca_system_score_codex":0.00053027296,"about_ca_system_score_gemma":0.00039569382,"threshold_uncertainty_score":0.013117075},"labels":[],"label_agreement":null},{"id":"W1985405042","doi":"10.1016/s0378-3758(00)00076-8","title":"Two matrix-based proofs that the linear estimator Gy is the best linear unbiased estimator","year":2000,"lang":"en","type":"article","venue":"Journal of Statistical Planning and Inference","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Transpose; Best linear unbiased prediction; Matrix (chemical analysis); Bias of an estimator; Combinatorics; Estimator; Minimum-variance unbiased estimator; Applied mathematics; Discrete mathematics; Statistics; Selection (genetic algorithm); Eigenvalues and eigenvectors","score_opus":0.033628930761500364,"score_gpt":0.33684220095441014,"score_spread":0.3032132701929098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985405042","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001357831,0.0008298141,0.9914187,0.0014315181,0.00024470635,0.00005994191,0.00015213084,0.00014098681,0.0043643494],"genre_scores_gemma":[0.17801306,0.004198577,0.792922,0.0041303,0.002515112,0.0010906935,0.00096004276,0.0008425671,0.015327585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9894832,0.004915791,0.00068980304,0.0014623312,0.0026790593,0.0007698195],"domain_scores_gemma":[0.9066384,0.06852968,0.005939837,0.007196984,0.010665443,0.0010297064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016572906,0.0025989905,0.0018486081,0.0038512931,0.0013222665,0.0037103659,0.0033212185,0.0034830817,0.013671385],"category_scores_gemma":[0.13749623,0.0018219115,0.002108661,0.0035168899,0.0052878484,0.00907309,0.0062593524,0.007330675,0.0034699521],"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.00012894098,0.00007249673,0.0009859446,0.00038736212,0.0001670609,0.00019192847,0.0004284125,0.01718972,0.0013118822,0.88581073,0.009999127,0.08332628],"study_design_scores_gemma":[0.00010734062,0.00009731677,0.0009367019,0.00027191243,0.00012620886,0.00054109644,0.0001067362,0.070935085,0.0038598776,0.9098829,0.013038492,0.000096230426],"about_ca_topic_score_codex":0.0017012277,"about_ca_topic_score_gemma":0.002078102,"teacher_disagreement_score":0.016572906,"about_ca_system_score_codex":0.0019781224,"about_ca_system_score_gemma":0.0037371987,"threshold_uncertainty_score":0.08764696},"labels":[],"label_agreement":null},{"id":"W1985687238","doi":"10.1016/j.laa.2005.06.038","title":"An algebraic equation for linear operators","year":2005,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"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 Waterloo","funders":"","keywords":"Mathematics; Linear map; Algebraic number; Nilpotent; Dimension (graph theory); Operator (biology); Vector space; Field (mathematics); Linear operators; Continuous linear operator; Linear space; Pure mathematics; Algebra over a field; Linear equation; Canonical form; Operator theory; Discrete mathematics; Mathematical analysis","score_opus":0.018477441579880252,"score_gpt":0.2820090441791233,"score_spread":0.2635316025992431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985687238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05764155,0.0024479022,0.7694525,0.0076436717,0.0019980175,0.00011374479,0.0006716546,0.00026660846,0.15976445],"genre_scores_gemma":[0.6833593,0.003658683,0.19059564,0.0029091565,0.0022717689,0.00029079695,0.0010761488,0.0003674931,0.11547106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921584,0.00017270513,0.000060901846,0.0001445974,0.00032196805,0.00008405778],"domain_scores_gemma":[0.99902725,0.00044463619,0.00007684823,0.000068131616,0.00032079543,0.000062316685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011372025,0.0006911726,0.00066962803,0.0012979172,0.0010761614,0.0020307812,0.0010710199,0.0012951504,0.008800409],"category_scores_gemma":[0.0034831495,0.000484896,0.000930258,0.0017125559,0.0021115378,0.0048097367,0.0021743309,0.0038476763,0.0015084702],"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.0000060695193,0.000010036373,0.000062157975,0.000030683077,0.0000034286961,0.000038373164,0.00017518198,0.00070242235,0.00049168075,0.9891811,0.0026914123,0.006607539],"study_design_scores_gemma":[0.000008536126,0.000008237148,0.000096333024,0.000012702282,0.0000061774226,0.00009970901,0.00005275162,0.010080891,0.00029708847,0.9800978,0.009225266,0.000014553519],"about_ca_topic_score_codex":0.0021299387,"about_ca_topic_score_gemma":0.0017903595,"teacher_disagreement_score":0.008800409,"about_ca_system_score_codex":0.0014421125,"about_ca_system_score_gemma":0.0011055572,"threshold_uncertainty_score":0.029440343},"labels":[],"label_agreement":null},{"id":"W1986048785","doi":"10.1134/s0081543811080098","title":"The Peano-Baker series","year":2011,"lang":"en","type":"article","venue":"Proceedings of the Steklov Institute of Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":59,"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":"Peano axioms; Series (stratigraphy); Simple (philosophy); Ode; Folklore; Convergence (economics); Calculus (dental); Mathematics; Algebra over a field; Computer science; Applied mathematics; Pure mathematics; Algorithm; Epistemology; Literature; Art; Philosophy","score_opus":0.022360580550568113,"score_gpt":0.2119588416311635,"score_spread":0.18959826108059538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986048785","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012271342,0.04767475,0.29969513,0.00535798,0.003969583,0.00006788175,0.0002600122,0.00044189824,0.6302614],"genre_scores_gemma":[0.5253566,0.078846596,0.19218169,0.0033279655,0.005926236,0.00023235676,0.00041428712,0.0006620838,0.19305229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947006,0.00013490971,0.000023954812,0.0000925763,0.00023472148,0.000043761822],"domain_scores_gemma":[0.999713,0.00013518891,0.000019849085,0.000038143462,0.00006786028,0.000025910194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011852154,0.0007318628,0.00053459837,0.0015669842,0.0009377881,0.0018020982,0.0008092514,0.0007732257,0.008942982],"category_scores_gemma":[0.0029269252,0.00027161234,0.00052359124,0.0012024953,0.0026277907,0.004424688,0.0011904734,0.0023844696,0.003107185],"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.0000026509083,0.0000022383856,0.00001825185,0.00003341624,0.000001268459,0.000017345046,0.00004523037,0.00040404513,0.00013936983,0.988009,0.0026429961,0.008684227],"study_design_scores_gemma":[0.000003886098,0.000010859489,0.00008304867,0.00005027035,0.000002801583,0.00012216074,0.0000377636,0.0030117906,0.00027379714,0.9069097,0.089482516,0.000011470157],"about_ca_topic_score_codex":0.0014478975,"about_ca_topic_score_gemma":0.0010130169,"teacher_disagreement_score":0.008942982,"about_ca_system_score_codex":0.0011652545,"about_ca_system_score_gemma":0.00081217044,"threshold_uncertainty_score":0.0299173},"labels":[],"label_agreement":null},{"id":"W1986211432","doi":"10.1007/s10092-004-0082-9","title":"On the growth factor in Gaussian elimination for matrices with sharp angular field of values","year":2004,"lang":"en","type":"article","venue":"CALCOLO","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hermitian matrix; Mathematics; Positive-definite matrix; Combinatorics; Diagonal; Order (exchange); Theory of computation; Matrix (chemical analysis); Gaussian elimination; Gaussian; Complex matrix; Limit (mathematics); Normal matrix; Upper and lower bounds; Field (mathematics); Mathematical analysis; Pure mathematics; Physics; Eigenvalues and eigenvectors; Geometry; Chemistry; Quantum mechanics; Algorithm","score_opus":0.01235893347209303,"score_gpt":0.2559370755966106,"score_spread":0.2435781421245176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986211432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098454714,0.004737715,0.8237505,0.0068144538,0.0012993525,0.00013780467,0.0003504565,0.0021067965,0.062348284],"genre_scores_gemma":[0.7224017,0.003920433,0.22136259,0.00224309,0.001699556,0.00032459912,0.00061176345,0.0024234464,0.045012835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99617946,0.0013668322,0.00012909087,0.00039552295,0.0014086608,0.00052048377],"domain_scores_gemma":[0.9715854,0.02177969,0.0009776253,0.001999591,0.0025292316,0.0011285164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007091508,0.0021206753,0.0018483388,0.00385725,0.0027994171,0.003808098,0.0034077212,0.0022820726,0.008253764],"category_scores_gemma":[0.045698337,0.0011277641,0.0011922397,0.0037253827,0.008592181,0.01213141,0.003979092,0.007081724,0.0022827392],"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.00018373266,0.000050692994,0.0007977836,0.00012189633,0.000013735378,0.000090729096,0.00029888953,0.008699758,0.00081497524,0.9542595,0.0077311774,0.026937027],"study_design_scores_gemma":[0.000024926308,0.000021952019,0.00016150593,0.000050263097,0.000016430879,0.00011282127,0.000051841263,0.0792824,0.001324824,0.9155404,0.0033760725,0.000036453985],"about_ca_topic_score_codex":0.0067241997,"about_ca_topic_score_gemma":0.007727347,"teacher_disagreement_score":0.008253764,"about_ca_system_score_codex":0.0032218625,"about_ca_system_score_gemma":0.0024354602,"threshold_uncertainty_score":0.0375039},"labels":[],"label_agreement":null},{"id":"W1986508690","doi":"10.1016/s0898-1221(01)00125-0","title":"A parallel method for linear equations with tridiagonal Toeplitz coefficient matrices","year":2001,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":17,"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 New Brunswick","funders":"","keywords":"Toeplitz matrix; Tridiagonal matrix; Mathematics; Circulant matrix; Coefficient matrix; Tridiagonal matrix algorithm; Linear system; Boundary value problem; Levinson recursion; System of linear equations; Applied mathematics; Algebra over a field; Pure mathematics; Mathematical analysis; Discrete mathematics; Eigenvalues and eigenvectors","score_opus":0.02384599077742807,"score_gpt":0.2956138502744811,"score_spread":0.27176785949705307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986508690","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052727684,0.00015214317,0.99028474,0.00012323796,0.00025376776,0.00006019936,0.00007344649,0.00060122367,0.0031783795],"genre_scores_gemma":[0.06255742,0.00033777347,0.92515093,0.00014270715,0.00019336987,0.00033181167,0.00020472465,0.0004847552,0.010596507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967194,0.00009011949,0.000019763367,0.00003733887,0.00014849295,0.000032299922],"domain_scores_gemma":[0.9992248,0.00031954274,0.000036890975,0.00013828503,0.00022956327,0.00005093358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005964001,0.0008484542,0.0007749954,0.00053923775,0.0009974773,0.0007183032,0.0014868525,0.00082142145,0.009940262],"category_scores_gemma":[0.0019816349,0.00047242414,0.00085933733,0.0009425989,0.0006377298,0.0011855643,0.0013911951,0.0014851891,0.002640889],"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.0005225576,0.00042683718,0.0009468668,0.00054648396,0.00020049674,0.0006828854,0.0003488937,0.26637003,0.020445235,0.14418095,0.022120869,0.54320794],"study_design_scores_gemma":[0.00013517229,0.00009615098,0.00014051954,0.000026838632,0.00003790749,0.0001825436,0.000034650715,0.92663664,0.004803967,0.053132277,0.014740459,0.00003293306],"about_ca_topic_score_codex":0.0025312027,"about_ca_topic_score_gemma":0.004595231,"teacher_disagreement_score":0.009940262,"about_ca_system_score_codex":0.00031456328,"about_ca_system_score_gemma":0.0011086821,"threshold_uncertainty_score":0.03325349},"labels":[],"label_agreement":null},{"id":"W1986793884","doi":"10.1080/03081087.2013.865732","title":"Principal powers of matrices with positive definite real part","year":2014,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Positive-definite matrix; Principal (computer security); Numerical range; Context (archaeology); Norm (philosophy); Operator (biology); Complex matrix; Matrix norm; Matrix (chemical analysis); Algebra over a field; Pure mathematics; Combinatorics; Eigenvalues and eigenvectors; Computer science","score_opus":0.007976550912779514,"score_gpt":0.23227301851959412,"score_spread":0.2242964676068146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986793884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3784583,0.00065839,0.57515115,0.00077884976,0.00024638817,0.00004766728,0.00011156379,0.00021261936,0.044335105],"genre_scores_gemma":[0.957666,0.00027417508,0.029473165,0.00011664193,0.00025688318,0.00003520503,0.0000516162,0.00010037754,0.01202605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912554,0.00022693897,0.000034456087,0.00015657542,0.00035145073,0.00010503057],"domain_scores_gemma":[0.9974148,0.0010092724,0.0004955214,0.00027633316,0.0005457298,0.00025818468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001200616,0.0006118305,0.0004000131,0.001044779,0.0005932771,0.0018819056,0.0005879318,0.00044253434,0.008539315],"category_scores_gemma":[0.0049954494,0.0002256901,0.00034827922,0.00058705686,0.003015917,0.003096308,0.0012077666,0.0009460656,0.00078830303],"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.000058713777,0.000023881816,0.00038496644,0.00004534229,0.000008683563,0.00023615462,0.00017025354,0.0044947644,0.0077298055,0.9797141,0.0007544378,0.0063789575],"study_design_scores_gemma":[0.000012965726,0.000068722446,0.00041910892,0.000017942646,0.0000050932513,0.00043264552,0.00011231495,0.053318515,0.0056394665,0.9371558,0.002796155,0.000021266962],"about_ca_topic_score_codex":0.00013634229,"about_ca_topic_score_gemma":0.00019194417,"teacher_disagreement_score":0.008539315,"about_ca_system_score_codex":0.00041503142,"about_ca_system_score_gemma":0.00030668222,"threshold_uncertainty_score":0.028566897},"labels":[],"label_agreement":null},{"id":"W1986973267","doi":"10.1016/s0024-3795(02)00334-8","title":"Generalized inverses of partitioned matrices in Banachiewicz–Schur form","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Generalized inverse; Moore–Penrose pseudoinverse; Inverse; Pure mathematics; Class (philosophy); Matrix (chemical analysis); Schur's theorem; Schur complement; Combinatorics; Algebra over a field; Eigenvalues and eigenvectors; Geometry","score_opus":0.019318283530813652,"score_gpt":0.2413276057472517,"score_spread":0.22200932221643804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986973267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19439025,0.00048096938,0.7786217,0.0003455931,0.00024990443,0.000076646094,0.00015981503,0.0002245354,0.025450582],"genre_scores_gemma":[0.8293315,0.0007332044,0.14069313,0.000326034,0.00030572063,0.00015638927,0.00024294824,0.00020493208,0.028006129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993462,0.00021727121,0.00003553335,0.00013653176,0.00018130003,0.000083220795],"domain_scores_gemma":[0.99879104,0.0004506235,0.00020564339,0.00013097069,0.00029066872,0.0001310864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079311064,0.00091636996,0.00061060017,0.0009025563,0.0005518495,0.0018104885,0.0007330267,0.000664828,0.008150295],"category_scores_gemma":[0.0033754252,0.00042916732,0.0006053166,0.0007962093,0.0020109315,0.002430337,0.0011656138,0.0013152105,0.0011321526],"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.000108601125,0.00004428116,0.0001753361,0.0000701003,0.000022641294,0.00018917283,0.00050669856,0.011224594,0.006836649,0.95930064,0.0012023257,0.020318994],"study_design_scores_gemma":[0.000025548668,0.000079662874,0.00021959576,0.000020993006,0.000010825005,0.00021989082,0.00025079722,0.06628076,0.0030049323,0.92661023,0.0032412792,0.000035450117],"about_ca_topic_score_codex":0.00054707425,"about_ca_topic_score_gemma":0.000722648,"teacher_disagreement_score":0.008150295,"about_ca_system_score_codex":0.00038541987,"about_ca_system_score_gemma":0.0005566587,"threshold_uncertainty_score":0.02726549},"labels":[],"label_agreement":null},{"id":"W1987744915","doi":"10.1007/s002110100289","title":"Entrywise perturbation theory for diagonally dominant M-matrices with applications","year":2002,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":43,"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 Windsor","funders":"","keywords":"Diagonally dominant matrix; Mathematics; Diagonal; Inverse; Tridiagonal matrix; Combinatorics; Eigenvalues and eigenvectors; Electronic circuit; Pure mathematics; Geometry; Invertible matrix; Physics; Quantum mechanics","score_opus":0.012385870409817944,"score_gpt":0.22480176047793815,"score_spread":0.2124158900681202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987744915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032135475,0.0016232464,0.9342743,0.001206078,0.000555335,0.000040825144,0.0000841582,0.00019841532,0.0298821],"genre_scores_gemma":[0.6592242,0.0040842765,0.26861906,0.0013485897,0.0016175972,0.00028368333,0.0002554983,0.00038243723,0.064184606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948573,0.00025106344,0.000018627981,0.000051845902,0.00014442022,0.00004833408],"domain_scores_gemma":[0.998609,0.0007233157,0.00012418623,0.00012921392,0.0002798345,0.00013451085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001001574,0.0013279123,0.00068849156,0.0013746566,0.00067633577,0.0012409313,0.0010084468,0.0010531218,0.0046633184],"category_scores_gemma":[0.003870345,0.00032358238,0.00054000824,0.001153843,0.0017159643,0.0019305577,0.001803096,0.002168738,0.0010524327],"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.000065341264,0.000057095684,0.00013089553,0.000114716,0.000019031831,0.00014842239,0.00015272401,0.0290424,0.0043246844,0.9426929,0.0036885971,0.019563237],"study_design_scores_gemma":[0.000009296189,0.000029143457,0.000086431435,0.000018767325,0.000006586713,0.000077941375,0.000033935466,0.18076466,0.0009468834,0.815466,0.0025448191,0.000015535321],"about_ca_topic_score_codex":0.0005508801,"about_ca_topic_score_gemma":0.0006393946,"teacher_disagreement_score":0.0046633184,"about_ca_system_score_codex":0.00059178984,"about_ca_system_score_gemma":0.0004715426,"threshold_uncertainty_score":0.015600383},"labels":[],"label_agreement":null},{"id":"W1988097699","doi":"10.1007/s00365-012-9164-0","title":"CMV Matrices and Little and Big −1 Jacobi Polynomials","year":2012,"lang":"en","type":"article","venue":"Constructive Approximation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Orthogonal polynomials; Mathematics; Jacobi polynomials; Classical orthogonal polynomials; Gegenbauer polynomials; Discrete orthogonal polynomials; Jacobi operator; Wilson polynomials; Unit circle; Pencil (optics); Difference polynomials; Jacobi method; Hahn polynomials; Pure mathematics; Algebra over a field; Combinatorics; Mathematical analysis","score_opus":0.012792390574038555,"score_gpt":0.2286222069187796,"score_spread":0.21582981634474105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988097699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082622826,0.001648483,0.8662173,0.0017236948,0.0006938403,0.000033234308,0.00008714937,0.00046877522,0.046504762],"genre_scores_gemma":[0.7905218,0.0010812643,0.17438169,0.00070658815,0.00068378105,0.000052716317,0.00015121949,0.0002801424,0.03214071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916935,0.00030219898,0.000021183167,0.00010068981,0.0003055813,0.00010090572],"domain_scores_gemma":[0.9975222,0.0013229597,0.00017259913,0.00041993277,0.00031380355,0.0002485759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00111668,0.00084240426,0.0005459701,0.0011787955,0.0009362458,0.0021713793,0.0015775437,0.0008299335,0.0057917754],"category_scores_gemma":[0.008638843,0.00045675176,0.00043172226,0.0012690411,0.0037929867,0.0039531835,0.002370315,0.0028535475,0.00096312654],"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.000050880855,0.000024424846,0.00016993654,0.000023881288,0.000004617667,0.000026588908,0.00010231176,0.0048502493,0.00080969074,0.97580224,0.001490356,0.016644796],"study_design_scores_gemma":[0.000009654381,0.0000132690275,0.00007223144,0.000010044522,0.0000034504512,0.000053024556,0.00004826988,0.02732705,0.00070301787,0.96940416,0.0023454388,0.00001033258],"about_ca_topic_score_codex":0.0010117177,"about_ca_topic_score_gemma":0.0013196567,"teacher_disagreement_score":0.0057917754,"about_ca_system_score_codex":0.00088500086,"about_ca_system_score_gemma":0.00067142723,"threshold_uncertainty_score":0.019375443},"labels":[],"label_agreement":null},{"id":"W1988228156","doi":"10.1016/j.aam.2004.06.003","title":"Markov's transformation of series and the WZ method","year":2004,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Memoir; Markov chain; Mathematics; Transformation (genetics); Context (archaeology); Series (stratigraphy); Markov process; Convergence (economics); Acceleration; Markov model; Mathematical economics; Applied mathematics; Algorithm; Statistics; Art history; History","score_opus":0.005931039444430894,"score_gpt":0.2574354021965067,"score_spread":0.25150436275207577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988228156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025958274,0.0017058507,0.93828255,0.0010518546,0.00063193723,0.00004357713,0.0001281436,0.00021809353,0.031979788],"genre_scores_gemma":[0.59475195,0.0050963936,0.28862363,0.0009649583,0.0018030623,0.0003043258,0.00034901674,0.0013303387,0.106776305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993042,0.00029398274,0.00002573346,0.00011154443,0.00019310995,0.00007149691],"domain_scores_gemma":[0.9986243,0.00070808193,0.00013867352,0.00019819199,0.0002171211,0.000113588394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016240776,0.0007526517,0.00095120654,0.0020420125,0.00080933084,0.0015370834,0.0014686532,0.00097470527,0.008003782],"category_scores_gemma":[0.0060436507,0.00047725457,0.0011371212,0.0014701658,0.0025432066,0.00355219,0.0015991163,0.0027655698,0.0017126088],"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.000018024524,0.000011912335,0.0000533009,0.000027252607,0.000006943641,0.00002281575,0.00004854139,0.003792322,0.0007078219,0.98288983,0.001093687,0.011327393],"study_design_scores_gemma":[0.000013923022,0.00001850839,0.000118751326,0.000018515222,0.0000058337455,0.00005743025,0.000025588583,0.061698418,0.0007013064,0.9313206,0.0059991437,0.000022026783],"about_ca_topic_score_codex":0.0018942957,"about_ca_topic_score_gemma":0.0015487927,"teacher_disagreement_score":0.008003782,"about_ca_system_score_codex":0.00093090266,"about_ca_system_score_gemma":0.00093052926,"threshold_uncertainty_score":0.0267753},"labels":[],"label_agreement":null},{"id":"W1988452081","doi":"10.1007/s00211-006-0054-x","title":"On the numerical condition of a generalized Hankel eigenvalue problem","year":2006,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":44,"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 Waterloo","funders":"","keywords":"Vandermonde matrix; Mathematics; Eigenvalues and eigenvectors; Hankel matrix; Matrix (chemical analysis); Quadrature (astronomy); Combinatorics; Mathematical analysis; Algebra over a field; Applied mathematics; Pure mathematics","score_opus":0.011183335070874266,"score_gpt":0.2346430918108054,"score_spread":0.22345975673993113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988452081","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2987415,0.0014753223,0.5563976,0.011129704,0.0016409024,0.00018191173,0.00045161715,0.0005763231,0.1294051],"genre_scores_gemma":[0.93509614,0.00058774895,0.03665076,0.00086625,0.0007272336,0.00014746014,0.00031837862,0.00040951426,0.025196467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886084,0.00043526455,0.000046791105,0.00017144914,0.00035028797,0.00013536047],"domain_scores_gemma":[0.992845,0.004301116,0.0006468409,0.0003412131,0.0011950951,0.0006707755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020178182,0.0009703019,0.0010878573,0.0014314074,0.0012337674,0.003127492,0.0011065439,0.002661529,0.012700405],"category_scores_gemma":[0.019068466,0.0004500493,0.00045598915,0.00079790264,0.004373244,0.004564001,0.0033550172,0.0030202472,0.0009838523],"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.00034029924,0.000093882336,0.00070854987,0.00025920878,0.00003376523,0.0005894231,0.0003170299,0.073881514,0.010605932,0.898269,0.0046905414,0.010210911],"study_design_scores_gemma":[0.00008462679,0.00007006239,0.0005831735,0.000054382715,0.0000100369925,0.00023762886,0.0002030515,0.56405926,0.0025770448,0.42999274,0.0020617468,0.00006626507],"about_ca_topic_score_codex":0.0016611147,"about_ca_topic_score_gemma":0.0010960596,"teacher_disagreement_score":0.012700405,"about_ca_system_score_codex":0.0007033659,"about_ca_system_score_gemma":0.0012794427,"threshold_uncertainty_score":0.042487085},"labels":[],"label_agreement":null},{"id":"W1988491659","doi":"10.15352/afa/1391614566","title":"Zero-dilation Indices of KMS Matrices","year":2014,"lang":"en","type":"article","venue":"Annals of Functional Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Ministry of Education, India; National Science Council","keywords":"Mathematics; Zero (linguistics); Dilation (metric space); Matrix (chemical analysis); Rank (graph theory); Mathematical analysis; Combinatorics","score_opus":0.030027216133483817,"score_gpt":0.2686319339210337,"score_spread":0.23860471778754988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988491659","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48214188,0.001574134,0.38907486,0.0025343779,0.0011709362,0.00006997395,0.00044540738,0.00074314495,0.1222452],"genre_scores_gemma":[0.90285724,0.00083300873,0.060426544,0.0005285355,0.00079154427,0.00008019547,0.00032142893,0.00040183484,0.033759713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934405,0.00018377574,0.000039589984,0.00014808976,0.00018037457,0.000104205],"domain_scores_gemma":[0.9969086,0.0011050751,0.0004176956,0.00045193156,0.0005641448,0.00055250205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010044815,0.0007049177,0.0006109713,0.0020937847,0.0011345007,0.0023402013,0.0011752795,0.0010614278,0.009189404],"category_scores_gemma":[0.0063445405,0.00037802567,0.0003877128,0.0008836354,0.0031442975,0.0036967972,0.001594243,0.0017703334,0.0014511385],"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.000044116878,0.000017863153,0.0002458301,0.000026810092,0.0000042206743,0.000053799948,0.00015285936,0.000859977,0.002272524,0.9845785,0.0018305593,0.009912945],"study_design_scores_gemma":[0.000011408635,0.000020670568,0.00035077689,0.000014680207,0.000003900428,0.000111804686,0.00009407117,0.01240479,0.0014599469,0.9823982,0.003112736,0.000016926555],"about_ca_topic_score_codex":0.00039863278,"about_ca_topic_score_gemma":0.0004649402,"teacher_disagreement_score":0.009189404,"about_ca_system_score_codex":0.00084524223,"about_ca_system_score_gemma":0.0006207234,"threshold_uncertainty_score":0.030741572},"labels":[],"label_agreement":null},{"id":"W1989044121","doi":"10.1016/j.laa.2009.07.025","title":"Graphical description of group inverses of certain bipartite matrices","year":2009,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bipartite graph; Block matrix; Inverse; Combinatorics; Complete bipartite graph; Group (periodic table); Matrix (chemical analysis); Edge-transitive graph; Graph; Discrete mathematics; Voltage graph; Line graph; Eigenvalues and eigenvectors","score_opus":0.015023434686829127,"score_gpt":0.24460795654298506,"score_spread":0.22958452185615594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989044121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13805829,0.00032793838,0.79009205,0.0010043752,0.00017815577,0.00015312416,0.0012594144,0.0008314787,0.06809514],"genre_scores_gemma":[0.8875241,0.00031889218,0.08788282,0.00043590154,0.00017621054,0.00020227623,0.0014325153,0.00024562105,0.021781832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960643,0.0001173523,0.000016575696,0.00008222795,0.00010812557,0.0000693766],"domain_scores_gemma":[0.99899024,0.00036086826,0.00017443429,0.00014005924,0.00022719296,0.00010718825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003600612,0.00056173437,0.00048749498,0.0014984288,0.0006496533,0.0013244691,0.0010139501,0.0010236382,0.013858876],"category_scores_gemma":[0.0015874562,0.0003120929,0.00079415506,0.00085461105,0.0009300657,0.0013154311,0.0005816624,0.0011858507,0.0012844078],"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.00006602795,0.000049177426,0.00036334046,0.000069317895,0.000019359786,0.0002642161,0.00023907615,0.012698148,0.0053587584,0.96828777,0.003409858,0.009175037],"study_design_scores_gemma":[0.000025938198,0.000028789244,0.00047298637,0.000019377261,0.000018340827,0.00027718194,0.00010054809,0.12032049,0.0016212411,0.8709568,0.006127232,0.000031114203],"about_ca_topic_score_codex":0.0015209913,"about_ca_topic_score_gemma":0.0015984122,"teacher_disagreement_score":0.013858876,"about_ca_system_score_codex":0.00046201088,"about_ca_system_score_gemma":0.0004237739,"threshold_uncertainty_score":0.04636258},"labels":[],"label_agreement":null},{"id":"W1989189227","doi":"10.1007/s100120200015","title":"The Maximal and Minimal Ranks of Some Expressions of Generalized Inverses of Matrices","year":2002,"lang":"en","type":"article","venue":"Southeast Asian Bulletin of Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Combinatorics; Rank (graph theory); Commutative property; Discrete mathematics","score_opus":0.015950258314133246,"score_gpt":0.21817114895325526,"score_spread":0.20222089063912202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989189227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7479477,0.0010055845,0.1716492,0.001512126,0.00034489998,0.00007663055,0.0007118198,0.00056552753,0.076186486],"genre_scores_gemma":[0.95953035,0.00036551655,0.024798572,0.00015892835,0.000329083,0.000060367798,0.00029893624,0.00017101233,0.014287186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837554,0.00038142543,0.00012635074,0.0002645097,0.00047467984,0.0003774306],"domain_scores_gemma":[0.99589753,0.0018451657,0.0006088861,0.00033162753,0.00076847966,0.000548284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012939126,0.00075595867,0.0006180492,0.0021533177,0.001668756,0.004226798,0.0012033966,0.0008495694,0.008052053],"category_scores_gemma":[0.007675522,0.00042309106,0.00075561117,0.0012510272,0.0026327667,0.0036021615,0.0014518705,0.0018139405,0.0011757733],"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.00019039784,0.000052462474,0.0010907962,0.000109172805,0.000020095573,0.0003596268,0.001280446,0.0016283502,0.0067479727,0.96884984,0.0022606133,0.01741023],"study_design_scores_gemma":[0.000020521926,0.00010041217,0.0013008573,0.000033547694,0.00003000607,0.00071699196,0.000661827,0.009706273,0.00465659,0.97809654,0.004601929,0.00007451617],"about_ca_topic_score_codex":0.0005465796,"about_ca_topic_score_gemma":0.0007042479,"teacher_disagreement_score":0.008052053,"about_ca_system_score_codex":0.00085950154,"about_ca_system_score_gemma":0.00087214727,"threshold_uncertainty_score":0.02693677},"labels":[],"label_agreement":null},{"id":"W1989423797","doi":"10.1016/j.laa.2003.11.021","title":"Eventually nonnegative matrices are similar to seminonnegative matrices","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Nonnegative matrix; Matrix (chemical analysis); Combinatorics; Pure mathematics; Matrix analysis; Algebra over a field; Symmetric matrix; Eigenvalues and eigenvectors","score_opus":0.010388129412851691,"score_gpt":0.2534936828873706,"score_spread":0.24310555347451893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989423797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34594226,0.0009909013,0.5465203,0.0012349149,0.0010779705,0.0001728221,0.00040199395,0.00054280757,0.10311602],"genre_scores_gemma":[0.8474238,0.0010172654,0.065703705,0.0012932646,0.0007574063,0.00020926923,0.00040922512,0.00031486357,0.08287114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995042,0.00013875509,0.000027892807,0.00012698043,0.0001254252,0.00007673387],"domain_scores_gemma":[0.9979473,0.0006395339,0.0003687856,0.000196759,0.00055574084,0.00029193852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007018192,0.0008072759,0.00043582183,0.0013204827,0.0015515316,0.0024073103,0.000641838,0.0007865611,0.0059593823],"category_scores_gemma":[0.0038251395,0.00036113255,0.0005687759,0.0010447645,0.0022497303,0.0030541164,0.0010575091,0.0013560479,0.00089483475],"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.000023338645,0.000009558578,0.00021627755,0.000020074649,0.0000047726007,0.000063916035,0.00016474474,0.0006181697,0.0016157578,0.9917806,0.001024594,0.0044581965],"study_design_scores_gemma":[0.0000059511885,0.000028099108,0.00029335506,0.000010446952,0.0000061087057,0.00015830588,0.00010596183,0.0047448985,0.0013337304,0.988425,0.0048724576,0.000015629787],"about_ca_topic_score_codex":0.00061924936,"about_ca_topic_score_gemma":0.0012561465,"teacher_disagreement_score":0.0059593823,"about_ca_system_score_codex":0.000572787,"about_ca_system_score_gemma":0.00056513696,"threshold_uncertainty_score":0.019936144},"labels":[],"label_agreement":null},{"id":"W1989845368","doi":"10.1002/cjce.21967","title":"An internal model controller design procedure for multivariable system based on the double‐decomposition","year":2014,"lang":"en","type":"article","venue":"The Canadian Journal of Chemical Engineering","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Beijing University of Chemical Technology; Beijing University of Technology; National Natural Science Foundation of China","keywords":"Multivariable calculus; Decomposition; Control theory (sociology); Internal model; Controller (irrigation); Computer science; Control engineering; Mathematics; Engineering; Chemistry; Artificial intelligence; Control (management); Biology","score_opus":0.011475610127336193,"score_gpt":0.2084590928629599,"score_spread":0.19698348273562372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989845368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010602352,0.000048019774,0.9974585,0.000021335976,0.0000264156,0.000024725063,0.000009116389,0.00024195662,0.0011097259],"genre_scores_gemma":[0.429685,0.0004532456,0.5629918,0.00019805801,0.000105181185,0.0005080842,0.00025706325,0.00015262322,0.005648951],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999428,0.000065953645,0.00003762573,0.00016066318,0.00025848727,0.0000491872],"domain_scores_gemma":[0.9997322,0.000040157756,0.00003321717,0.000032606455,0.00015017463,0.000011664304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005075976,0.0010244703,0.000746476,0.0005245023,0.0005927532,0.00076102297,0.0007219613,0.0006499091,0.003320013],"category_scores_gemma":[0.0007538692,0.0003702138,0.00086466223,0.0003845497,0.0005103973,0.0007488254,0.00084419904,0.0011577979,0.00083365676],"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.00016183837,0.00012841671,0.0005873613,0.0006921728,0.00011912996,0.00024562166,0.00038340344,0.31605187,0.1637514,0.047833268,0.00522937,0.46481615],"study_design_scores_gemma":[0.00006135594,0.00034914413,0.00039494623,0.00003253757,0.0000396395,0.0002343514,0.00004386241,0.9589373,0.024566706,0.005634288,0.009651387,0.00005443938],"about_ca_topic_score_codex":0.0023250643,"about_ca_topic_score_gemma":0.0019879937,"teacher_disagreement_score":0.003320013,"about_ca_system_score_codex":0.00037133697,"about_ca_system_score_gemma":0.0010500822,"threshold_uncertainty_score":0.011106551},"labels":[],"label_agreement":null},{"id":"W1991408204","doi":"10.1007/s10955-010-9959-y","title":"Sum-of-Squares Results for Polynomials Related to the Bessis–Moussa–Villani Conjecture","year":2010,"lang":"en","type":"article","venue":"Journal of Statistical Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":15,"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 Ottawa","funders":"","keywords":"Hermitian matrix; Conjecture; Combinatorics; TRACE (psycholinguistics); Mathematics; Polynomial; Explained sum of squares; Positive-definite matrix; Connection (principal bundle); Least-squares function approximation; Pure mathematics; Physics; Mathematical analysis; Statistics; Quantum mechanics; Eigenvalues and eigenvectors","score_opus":0.01107963260776325,"score_gpt":0.2838295189007185,"score_spread":0.27274988629295527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991408204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1937847,0.0063600247,0.6316956,0.015767178,0.00265928,0.00010050394,0.0007755437,0.0008033068,0.14805375],"genre_scores_gemma":[0.85762304,0.0039929166,0.07889262,0.0035976036,0.00613488,0.00024568857,0.0014018292,0.0011415359,0.046970002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99618906,0.0013880184,0.00013416196,0.00066750904,0.00115467,0.0004665329],"domain_scores_gemma":[0.964575,0.025779953,0.0018125664,0.0031014786,0.003196113,0.001534836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004894838,0.0024351198,0.0028425935,0.0038945745,0.0031968304,0.0035675706,0.004287363,0.0025209456,0.0142308725],"category_scores_gemma":[0.039563704,0.0010627168,0.002138123,0.0042203385,0.009485109,0.012005924,0.006262702,0.008386487,0.0031572552],"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.00019765849,0.00006793708,0.00071200874,0.00022085565,0.00005423492,0.00013893915,0.00030025627,0.0066465256,0.0013486062,0.9717748,0.007007502,0.0115306815],"study_design_scores_gemma":[0.000016388423,0.000015869942,0.00017024542,0.0000149200505,0.00001633266,0.000060463448,0.000046807043,0.020869995,0.00041110124,0.97710425,0.0012523361,0.000021351858],"about_ca_topic_score_codex":0.001494029,"about_ca_topic_score_gemma":0.0014750931,"teacher_disagreement_score":0.0142308725,"about_ca_system_score_codex":0.001577067,"about_ca_system_score_gemma":0.0013917934,"threshold_uncertainty_score":0.047607005},"labels":[],"label_agreement":null},{"id":"W1991713476","doi":"10.1016/j.jsc.2013.04.004","title":"Rank-profile revealing Gaussian elimination and the CUP matrix decomposition","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":41,"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 Waterloo","funders":"","keywords":"Gaussian elimination; Mathematics; Matrix (chemical analysis); Block matrix; Rank (graph theory); Algorithm; Matrix decomposition; Gaussian; Inverse; Computation; Transformation (genetics); Matrix multiplication; Transformation matrix; Block (permutation group theory); Algebra over a field; Combinatorics; Pure mathematics; Geometry","score_opus":0.006337541460843982,"score_gpt":0.2679057101270298,"score_spread":0.2615681686661858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991713476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07353813,0.00094100926,0.896601,0.0018743871,0.0003453299,0.00008736021,0.0005272224,0.0004876048,0.025598003],"genre_scores_gemma":[0.8089651,0.0014406542,0.1612571,0.0011286007,0.00074803224,0.00017613696,0.00075555954,0.0004110963,0.025117746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982644,0.00065287296,0.000051556763,0.0001937577,0.0005377823,0.00029967597],"domain_scores_gemma":[0.99668354,0.0013424597,0.000307971,0.00077815,0.0006417375,0.000246218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023600862,0.0012049949,0.0013741172,0.0018270619,0.0016232714,0.0026410136,0.0016141114,0.0011969393,0.005425065],"category_scores_gemma":[0.011146657,0.0005474315,0.00093731104,0.0021373038,0.0035209348,0.0039213556,0.00277418,0.0026033663,0.0013989559],"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.00010912061,0.000035177378,0.00027416204,0.00005209024,0.000017247103,0.00008723257,0.000110242436,0.011312379,0.00072285143,0.9680274,0.005361391,0.013890704],"study_design_scores_gemma":[0.0000144903615,0.000021833665,0.00015345393,0.000022096974,0.000010213947,0.000121043144,0.000045889294,0.12571833,0.0010455222,0.87081593,0.0020001389,0.00003117359],"about_ca_topic_score_codex":0.0019323446,"about_ca_topic_score_gemma":0.002332172,"teacher_disagreement_score":0.005425065,"about_ca_system_score_codex":0.0010223722,"about_ca_system_score_gemma":0.0022107447,"threshold_uncertainty_score":0.01814866},"labels":[],"label_agreement":null},{"id":"W1991824730","doi":"10.1016/j.tcs.2012.10.021","title":"Pseudospectra of exponential matrix polynomials","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; University of Otago; Curtin University of Technology; University of Canberra; University of New South Wales; Australian National University","keywords":"Matrix exponential; Mathematics; Exponential polynomial; Computation; Exponential function; Matrix (chemical analysis); Polynomial matrix; Nonlinear system; Applied mathematics; Polynomial; Matrix polynomial; Mathematical analysis; Algorithm; Differential equation","score_opus":0.008775717508541392,"score_gpt":0.26133501721195834,"score_spread":0.25255929970341695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991824730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3973186,0.001497736,0.4882658,0.0028774098,0.0010324158,0.00009109512,0.0005601113,0.0007144906,0.10764236],"genre_scores_gemma":[0.9330542,0.0011291456,0.028599765,0.0009074511,0.0013805731,0.00009131834,0.00037155318,0.00031568002,0.0341503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998256,0.00046296208,0.00006208037,0.0002897068,0.00066750066,0.00026164544],"domain_scores_gemma":[0.9931676,0.003658596,0.0006944778,0.00071865466,0.0011272391,0.0006334664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011483064,0.0012065443,0.00060411345,0.0024764119,0.0012806992,0.0026887294,0.0011631731,0.001184012,0.011751797],"category_scores_gemma":[0.010461797,0.00060598704,0.0006698926,0.0016329025,0.002999301,0.00569981,0.0024297498,0.0031367242,0.001819626],"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.00004909928,0.000032862874,0.00027882104,0.000028199485,0.0000061746923,0.000110137174,0.00018092484,0.0013862514,0.0011933708,0.9870243,0.0013631055,0.008346877],"study_design_scores_gemma":[0.000011841626,0.000028774808,0.00027278112,0.000014731661,0.0000050806107,0.00022837406,0.000046844452,0.0110981595,0.000789822,0.9853791,0.0021012365,0.000023212764],"about_ca_topic_score_codex":0.00037111927,"about_ca_topic_score_gemma":0.00044329598,"teacher_disagreement_score":0.011751797,"about_ca_system_score_codex":0.0008589281,"about_ca_system_score_gemma":0.0007431329,"threshold_uncertainty_score":0.039313674},"labels":[],"label_agreement":null},{"id":"W1992132942","doi":"10.3934/naco.2011.1.301","title":"Multiplicative perturbation analysis for QR factorizations","year":2011,"lang":"en","type":"article","venue":"Numerical Algebra Control and Optimization","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; McGill University","funders":"","keywords":"Multiplicative function; Mathematics; Perturbation (astronomy); Computation; QR decomposition; Factorization; Norm (philosophy); Pure mathematics; Applied mathematics; Mathematical analysis; Eigenvalues and eigenvectors; Algorithm; Physics","score_opus":0.015206131277076007,"score_gpt":0.22194270535340693,"score_spread":0.20673657407633092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992132942","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027387093,0.0003692085,0.99265623,0.00017201355,0.00009159884,0.000021905995,0.000033455734,0.00011848041,0.0037983637],"genre_scores_gemma":[0.46835864,0.0033650636,0.505036,0.0007799682,0.00085975765,0.0004204196,0.0004803566,0.0009788093,0.019720968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99704903,0.0012318892,0.00010654765,0.00035311776,0.0010857718,0.00017367178],"domain_scores_gemma":[0.99463624,0.0031417876,0.0004223816,0.0006444501,0.0009967512,0.0001584073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033373877,0.001630056,0.00086890446,0.0012816992,0.0006431619,0.0015932278,0.0009746389,0.00095112727,0.0064426884],"category_scores_gemma":[0.013988202,0.0005007865,0.000980345,0.0010404066,0.0024397725,0.0024009394,0.0022154818,0.0024124542,0.0016412047],"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.00011212598,0.000030282981,0.00034761342,0.00024423603,0.0000601951,0.00017083771,0.00019720147,0.25407353,0.006280608,0.6989431,0.0032509074,0.03628943],"study_design_scores_gemma":[0.0000059489917,0.00003453949,0.00012043366,0.00002507334,0.000010399843,0.0000391511,0.000022814647,0.81362313,0.0024421415,0.17982699,0.0038304725,0.000018946323],"about_ca_topic_score_codex":0.0015696684,"about_ca_topic_score_gemma":0.0009652891,"teacher_disagreement_score":0.0064426884,"about_ca_system_score_codex":0.0010411419,"about_ca_system_score_gemma":0.00068188267,"threshold_uncertainty_score":0.02155298},"labels":[],"label_agreement":null},{"id":"W1992262303","doi":"10.1090/s0002-9939-2014-12217-9","title":"Commutators of small rank and reducibility of operator semigroups","year":2014,"lang":"en","type":"preprint","venue":"Proceedings of the American Mathematical Society","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Rank (graph theory); Abelian group; Semigroup; Mathematics; Unitary state; Operator (biology); Group (periodic table); Pure mathematics; Rank of an abelian group; Combinatorics; Discrete mathematics; Elementary abelian group; Physics; Chemistry; Political science; Law","score_opus":0.013147404913515208,"score_gpt":0.24753868999615594,"score_spread":0.23439128508264073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992262303","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84954965,0.00030217972,0.0958866,0.00092926953,0.00015038841,0.000089185414,0.00026003429,0.00048354312,0.052349165],"genre_scores_gemma":[0.9777233,0.000095771735,0.014126623,0.00013922858,0.00020580828,0.00009765434,0.00018619651,0.00006338377,0.0073620174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971445,0.0007942012,0.00025897077,0.00068111427,0.000671771,0.00044938968],"domain_scores_gemma":[0.99142104,0.0047260937,0.0008126135,0.0015246861,0.00060385227,0.0009117336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002169605,0.00045302222,0.00074010383,0.0011093165,0.0014188206,0.0025880495,0.00074521184,0.0007813892,0.007961611],"category_scores_gemma":[0.009390811,0.0005326137,0.00092546555,0.00041329206,0.003805588,0.003304922,0.0021367823,0.0014372962,0.0009381066],"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.00013234942,0.00005188867,0.0008614581,0.000045410372,0.000010964229,0.00033287352,0.0012403139,0.0009206521,0.00435913,0.9874784,0.000842227,0.0037243268],"study_design_scores_gemma":[0.00006359516,0.00007776957,0.000478757,0.000012237641,0.0000134897555,0.00038624002,0.00023186837,0.009407109,0.0033533748,0.9831297,0.0028183092,0.000027551636],"about_ca_topic_score_codex":0.00032670944,"about_ca_topic_score_gemma":0.00030043928,"teacher_disagreement_score":0.007961611,"about_ca_system_score_codex":0.0005091313,"about_ca_system_score_gemma":0.0005163926,"threshold_uncertainty_score":0.026634216},"labels":[],"label_agreement":null},{"id":"W1992760098","doi":"10.1016/s0166-1280(00)00494-2","title":"The lower bound method for reduced density matrices","year":2000,"lang":"en","type":"article","venue":"Journal of Molecular Structure THEOCHEM","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matrix (chemical analysis); Order (exchange); Mathematics; Variational method; Dual (grammatical number); Upper and lower bounds; Variational analysis; Applied mathematics; Mathematical optimization; Mathematical analysis; Materials science","score_opus":0.005274794468549905,"score_gpt":0.25708951591582996,"score_spread":0.25181472144728007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992760098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018222883,0.0006430781,0.9888237,0.0004983855,0.0001971494,0.000036666705,0.00009580076,0.00024933455,0.00763356],"genre_scores_gemma":[0.12011463,0.0022045786,0.84196806,0.0009887093,0.0009401725,0.00078050006,0.0008424772,0.0016706146,0.03049022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983125,0.0007700251,0.00006088992,0.00014352436,0.00058896217,0.00012404875],"domain_scores_gemma":[0.99394184,0.003851246,0.00018500072,0.0009056223,0.0009142994,0.00020210113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031288825,0.0013975145,0.002210667,0.002631594,0.0012760072,0.003026308,0.0045257607,0.0025673565,0.0133538535],"category_scores_gemma":[0.014281907,0.00115892,0.0014297168,0.0024234855,0.0025712594,0.0045314487,0.0038922504,0.0061761467,0.0056215],"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.00008880934,0.000092712165,0.00014086207,0.00027086833,0.000056585457,0.000052545227,0.00009126974,0.090961896,0.0011286911,0.8425471,0.011954959,0.052613698],"study_design_scores_gemma":[0.00002483308,0.0000117423715,0.000042359447,0.00003474173,0.000012910131,0.00002328418,0.0000103864895,0.586483,0.00057188823,0.40729073,0.00547622,0.000017820399],"about_ca_topic_score_codex":0.003134645,"about_ca_topic_score_gemma":0.0031983366,"teacher_disagreement_score":0.0133538535,"about_ca_system_score_codex":0.001329229,"about_ca_system_score_gemma":0.0017149167,"threshold_uncertainty_score":0.044673085},"labels":[],"label_agreement":null},{"id":"W1992829029","doi":"10.2118/163667-ms","title":"An Efficient Multicore Linear Solver for Reservoir Simulation Applications","year":2013,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Preconditioner; Computer science; Parallel computing; Domain decomposition methods; Solver; Linear system; Multi-core processor; Matrix decomposition; Block (permutation group theory); Linear algebra; Iterative method; Schur complement; Sparse matrix; Algorithm; LU decomposition; Computational science; Mathematics; Finite element method; Eigenvalues and eigenvectors","score_opus":0.022145329027699636,"score_gpt":0.30370853477817117,"score_spread":0.28156320575047156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992829029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05209219,0.0010081475,0.8985737,0.00049629604,0.0002735,0.00029103982,0.0021152033,0.011759297,0.033390682],"genre_scores_gemma":[0.23329629,0.00047870737,0.73712075,0.00031459672,0.000092352,0.0005719094,0.0033441957,0.0014200129,0.02336116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999668,0.00006755839,0.000020653366,0.00003996797,0.0001492256,0.000054640474],"domain_scores_gemma":[0.99960214,0.000097374934,0.000032022894,0.00005024474,0.0001794564,0.000038716014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003300577,0.0008552957,0.0005090398,0.00035234622,0.00052271486,0.00068684365,0.001309029,0.00076155586,0.0106858],"category_scores_gemma":[0.0008663054,0.00032278866,0.00062695675,0.0007993837,0.00022229996,0.00055451744,0.0009907,0.000811746,0.0021135572],"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.00028327503,0.00024867203,0.0022701144,0.00054288894,0.00016146837,0.00039174955,0.00017305938,0.7285736,0.027063336,0.016679982,0.03367052,0.18994129],"study_design_scores_gemma":[0.000046557638,0.00003152847,0.00023856739,0.00001370694,0.0000100868065,0.000035281973,0.0000144220585,0.98150384,0.0040710745,0.0017216859,0.012303538,0.000009681644],"about_ca_topic_score_codex":0.0068557314,"about_ca_topic_score_gemma":0.0107363025,"teacher_disagreement_score":0.0106858,"about_ca_system_score_codex":0.0005097392,"about_ca_system_score_gemma":0.001597856,"threshold_uncertainty_score":0.035747588},"labels":[],"label_agreement":null},{"id":"W1994119749","doi":"10.1016/j.sysconle.2013.04.003","title":"On the zeros of blocked time-invariant systems","year":2013,"lang":"en","type":"article","venue":"Systems & Control Letters","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Mathematics; Zero (linguistics); Multiplicity (mathematics); Linear system; LTI system theory; Control theory (sociology); Invariant (physics); Pole–zero plot; Pure mathematics; Mathematical analysis; Computer science; Transfer function; Control (management)","score_opus":0.005176225698439696,"score_gpt":0.1744492400407505,"score_spread":0.1692730143423108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994119749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22270219,0.0010616388,0.7459252,0.00060819316,0.00029861854,0.000047793226,0.0001768003,0.00024411334,0.028935462],"genre_scores_gemma":[0.96482384,0.0008717033,0.018563295,0.000105425264,0.000095110365,0.000047342706,0.00017420488,0.00012371814,0.015195346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999559,0.00015291697,0.000018671964,0.000049125152,0.00014394375,0.00007627434],"domain_scores_gemma":[0.9973236,0.0015578624,0.00031169792,0.00015315095,0.00047176602,0.00018200243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073273724,0.0008263107,0.00059232453,0.0007426943,0.0004388422,0.0011471491,0.0006786162,0.0006520076,0.005877039],"category_scores_gemma":[0.0063586608,0.00032885064,0.00029105743,0.00047442873,0.0013736051,0.001635638,0.0011803107,0.0009937846,0.0008489152],"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.000811026,0.00006138353,0.00077268813,0.0002623289,0.00004257882,0.00032568636,0.0005869865,0.16412492,0.018817598,0.7907567,0.00354998,0.019888122],"study_design_scores_gemma":[0.000058145488,0.00012621492,0.00039614682,0.00006249015,0.000018130533,0.00012172003,0.00021507208,0.6044567,0.003689916,0.38689265,0.0039183586,0.00004443411],"about_ca_topic_score_codex":0.0019194912,"about_ca_topic_score_gemma":0.0009531207,"teacher_disagreement_score":0.005877039,"about_ca_system_score_codex":0.00045971,"about_ca_system_score_gemma":0.00047713058,"threshold_uncertainty_score":0.019660711},"labels":[],"label_agreement":null},{"id":"W1995386581","doi":"10.1016/s0024-3795(00)00108-7","title":"Unifying unitary and hyperbolic transformations","year":2000,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Invertible matrix; Unitary state; Hermitian matrix; Unitary matrix; Matrix (chemical analysis); Pure mathematics; Algebra over a field; Unification; Unitary transformation; Quantum; Computer science","score_opus":0.009928435808095784,"score_gpt":0.23012994194450995,"score_spread":0.22020150613641415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995386581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1334024,0.0017162018,0.7748667,0.0015620419,0.00071742083,0.000082504805,0.00023847958,0.000612291,0.086801924],"genre_scores_gemma":[0.8474127,0.0014357851,0.100589655,0.0006696962,0.0006929088,0.00010352372,0.00035793066,0.00029950982,0.048438296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999271,0.00019274457,0.00004255934,0.00017756462,0.00017998078,0.00013624263],"domain_scores_gemma":[0.99916375,0.00028632098,0.00009714917,0.00026603733,0.00010279558,0.00008392419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009263725,0.0005635631,0.0006888837,0.00085567887,0.0010078009,0.0019587192,0.0008547466,0.00081432593,0.009019849],"category_scores_gemma":[0.002993643,0.00028957304,0.0005864629,0.0014565068,0.0028664568,0.0057493364,0.003459205,0.0020886955,0.0015594667],"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.000015560418,0.000012209366,0.000060102626,0.0000125981105,0.0000023442337,0.000014464992,0.000114980525,0.00096092414,0.00043431288,0.9837744,0.00058106787,0.0140170045],"study_design_scores_gemma":[0.000005204863,0.000010890168,0.00004494978,0.0000052651067,0.0000029056223,0.000017764025,0.0000631046,0.007501851,0.0005246776,0.98819166,0.0036260893,0.000005653097],"about_ca_topic_score_codex":0.0008388902,"about_ca_topic_score_gemma":0.00084050687,"teacher_disagreement_score":0.009019849,"about_ca_system_score_codex":0.0006071803,"about_ca_system_score_gemma":0.0006414934,"threshold_uncertainty_score":0.030174434},"labels":[],"label_agreement":null},{"id":"W1996147419","doi":"10.1016/j.laa.2005.06.018","title":"Principal minor sums of (A+tB)m","year":2005,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Conjecture; Mathematics; Minor (academic); Combinatorics; Principal (computer security); Variety (cybernetics); Positive-definite matrix; Polynomial; Matrix (chemical analysis); Eigenvalues and eigenvectors; Mathematical analysis; Statistics; Law; Physics","score_opus":0.011450781846439885,"score_gpt":0.25142252090322253,"score_spread":0.23997173905678265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996147419","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39832926,0.0008147015,0.42965388,0.0015235906,0.0018367874,0.00025365583,0.0016454371,0.0020411895,0.16390142],"genre_scores_gemma":[0.8035996,0.00036952848,0.075853385,0.00046631013,0.00103182,0.0002019043,0.0011589708,0.0010435756,0.116274916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992513,0.00015088645,0.000050040257,0.00015091969,0.00023882139,0.0001580209],"domain_scores_gemma":[0.9985447,0.00032669556,0.00019565698,0.0002581633,0.0003185199,0.00035629235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048037025,0.00081411365,0.0005254313,0.0013618122,0.00145724,0.0026601017,0.00082462357,0.00067979784,0.020087285],"category_scores_gemma":[0.0020518338,0.00036295943,0.0007043442,0.00088450476,0.0015056769,0.002117079,0.0017577368,0.0015600065,0.005851805],"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.0004275923,0.00013685074,0.00090859894,0.00013487111,0.00003864074,0.00041508974,0.00045219678,0.0015926803,0.026953422,0.9051177,0.01608991,0.0477325],"study_design_scores_gemma":[0.000031457843,0.0001652773,0.0014285157,0.000019084675,0.000024021474,0.001160013,0.00024204809,0.0156309,0.01663102,0.9390262,0.025589708,0.000051843403],"about_ca_topic_score_codex":0.0003277958,"about_ca_topic_score_gemma":0.00042572748,"teacher_disagreement_score":0.020087285,"about_ca_system_score_codex":0.00042958034,"about_ca_system_score_gemma":0.0004984506,"threshold_uncertainty_score":0.067198634},"labels":[],"label_agreement":null},{"id":"W1996236313","doi":"10.1016/s0024-3795(03)00495-6","title":"Digraph-based conditioning for Markov chains","year":2003,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Digraph; Mathematics; Bounded function; Combinatorics; Markov chain; Directed graph; Discrete mathematics; Stationary distribution; Strongly connected component; Graph; Statistics","score_opus":0.01126469366402728,"score_gpt":0.2500672739411244,"score_spread":0.2388025802770971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996236313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011438461,0.00033872522,0.9835059,0.00037359938,0.00007107346,0.00003947388,0.00027980033,0.00028145534,0.0036715262],"genre_scores_gemma":[0.76172894,0.002192409,0.21338962,0.0008344078,0.00052195496,0.00047213037,0.0017857983,0.00041573317,0.01865899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803334,0.000743412,0.00009207378,0.00050720177,0.00037655068,0.0002473871],"domain_scores_gemma":[0.98057497,0.014017516,0.0011437713,0.001715338,0.0015954286,0.0009528865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028404896,0.0009720271,0.0018409375,0.0017697394,0.0013933583,0.0026744085,0.002110234,0.0013110815,0.009724966],"category_scores_gemma":[0.019666161,0.00094647135,0.0010806817,0.0025630032,0.0034356508,0.0047579426,0.0026492781,0.003683619,0.00101994],"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.00011233027,0.000098172066,0.00071245607,0.00010588866,0.00004399664,0.00006234503,0.00011956139,0.09198354,0.00061332213,0.8820977,0.0029191049,0.021131512],"study_design_scores_gemma":[0.000019691239,0.000018425966,0.00014347633,0.000022745111,0.00001472838,0.000022049253,0.000014009664,0.318781,0.00038257835,0.67946744,0.001095944,0.000017968241],"about_ca_topic_score_codex":0.008071973,"about_ca_topic_score_gemma":0.010742138,"teacher_disagreement_score":0.009724966,"about_ca_system_score_codex":0.0028577487,"about_ca_system_score_gemma":0.003075044,"threshold_uncertainty_score":0.032533288},"labels":[],"label_agreement":null},{"id":"W1996358449","doi":"10.1080/03081080600693285","title":"An approximate, multivariable version of Specht's theorem","year":2006,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Waterloo","funders":"","keywords":"Mathematics; Unitary state; Equivalence (formal languages); Combinatorics; Multivariable calculus; Similarity (geometry); Pure mathematics; Algebra over a field; Discrete mathematics; Computer science","score_opus":0.006356393945532133,"score_gpt":0.23361965087733536,"score_spread":0.22726325693180321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996358449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062872306,0.00024026178,0.9107091,0.0004985141,0.00013336843,0.000043609944,0.00024820075,0.00025478212,0.024999939],"genre_scores_gemma":[0.8926577,0.00042699403,0.09463629,0.00080412725,0.00038949947,0.00011855296,0.00038991202,0.00011114082,0.010465686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873763,0.00020487914,0.000072706345,0.00030497747,0.0005406481,0.00013912577],"domain_scores_gemma":[0.99825376,0.0006844261,0.00016631761,0.00038541635,0.00044019145,0.00006984143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015391939,0.00030630003,0.00068985246,0.0007619929,0.00071338867,0.0010941671,0.0010094441,0.0006017189,0.0068602324],"category_scores_gemma":[0.005255774,0.00017534972,0.0006441155,0.00091829465,0.0018838734,0.0046913913,0.0019975805,0.0012169564,0.0008393619],"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.000036065838,0.000018259194,0.0007444172,0.00007640747,0.000022093309,0.00012471137,0.00022746017,0.0066224304,0.0021203046,0.963581,0.0015408591,0.024885887],"study_design_scores_gemma":[0.000011608956,0.000116951036,0.0010416602,0.000018188777,0.000021187227,0.00036783662,0.00010544165,0.07268863,0.0026878158,0.9140946,0.0088232355,0.000022828945],"about_ca_topic_score_codex":0.00054963655,"about_ca_topic_score_gemma":0.00037850635,"teacher_disagreement_score":0.0068602324,"about_ca_system_score_codex":0.0005343647,"about_ca_system_score_gemma":0.00042050504,"threshold_uncertainty_score":0.022949755},"labels":[],"label_agreement":null},{"id":"W1996860297","doi":"10.1016/j.laa.2009.04.013","title":"Spectrum of certain tridiagonal matrices when their dimension goes to infinity","year":2009,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tridiagonal matrix; Mathematics; Spectrum (functional analysis); Toeplitz matrix; Dimension (graph theory); Matrix (chemical analysis); Pure mathematics; Diagonal; Exponential function; Band matrix; Matrix function; Function (biology); Mathematical analysis; Symmetric matrix; Square matrix; Eigenvalues and eigenvectors; Physics","score_opus":0.011723216313807855,"score_gpt":0.24383695093818783,"score_spread":0.23211373462437998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996860297","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83513975,0.0007771669,0.11905138,0.0013472674,0.00023706524,0.000025533842,0.00025886833,0.00044638818,0.042716704],"genre_scores_gemma":[0.98612577,0.00030277632,0.0074384757,0.0001577901,0.00016683448,0.000036961374,0.000119766504,0.00008353797,0.0055681174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965703,0.000082238075,0.000016389697,0.00005948765,0.00010872386,0.00007607818],"domain_scores_gemma":[0.9973008,0.0012626745,0.00038746584,0.00019944766,0.00033065182,0.00051904016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000667062,0.0006035808,0.00044664604,0.0024453925,0.0010704099,0.0017705457,0.00078879076,0.0010758712,0.0064249393],"category_scores_gemma":[0.004014001,0.00034666716,0.00036151992,0.00071551296,0.0020908585,0.002708208,0.0011201794,0.0010394418,0.0005656368],"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.00015385471,0.000059676004,0.00066549936,0.000056841887,0.000012807655,0.00043479833,0.0005012676,0.0034344576,0.008717032,0.9777476,0.0017696413,0.0064465916],"study_design_scores_gemma":[0.00004448574,0.00004983459,0.0012769895,0.000046771267,0.000013205533,0.00067198474,0.00037315293,0.07960416,0.0035569442,0.9125986,0.0017195985,0.00004435425],"about_ca_topic_score_codex":0.00045621608,"about_ca_topic_score_gemma":0.00035366678,"teacher_disagreement_score":0.0064249393,"about_ca_system_score_codex":0.00048643988,"about_ca_system_score_gemma":0.0003311757,"threshold_uncertainty_score":0.021493554},"labels":[],"label_agreement":null},{"id":"W1999166877","doi":"10.1016/j.laa.2014.11.016","title":"Extracting a basis with fixed block inside a matrix","year":2014,"lang":"en","type":"preprint","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Block (permutation group theory); Mathematics; Rank (graph theory); Matrix (chemical analysis); Combinatorics; Inverse; Matrix norm; Basis (linear algebra); Norm (philosophy); Geometry; Physics; Eigenvalues and eigenvectors; Materials science","score_opus":0.013336575937679822,"score_gpt":0.2626618952923058,"score_spread":0.249325319354626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999166877","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025303377,0.00012292387,0.9659345,0.00024348819,0.00020301406,0.000058629746,0.00030959016,0.0010939923,0.006730494],"genre_scores_gemma":[0.1582078,0.00029666937,0.82743067,0.00021138773,0.00015746875,0.00011918977,0.0010171966,0.0008368827,0.011722782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994836,0.00011525385,0.000021786247,0.000107729014,0.00018284141,0.000088694855],"domain_scores_gemma":[0.9994466,0.00011815662,0.00002845818,0.00020082487,0.00012914978,0.00007676904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047693143,0.0010320776,0.0010800682,0.001106917,0.00080228044,0.0010980305,0.0009768482,0.0011974479,0.008655005],"category_scores_gemma":[0.001864107,0.0005923395,0.00095809787,0.0012975328,0.0007549479,0.0015465977,0.0017897205,0.0019552808,0.006762579],"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.00055389915,0.00026648858,0.0010257764,0.00042049913,0.00009473288,0.0005755085,0.0004318591,0.02291716,0.13761021,0.41819105,0.029324356,0.3885885],"study_design_scores_gemma":[0.00014036601,0.00035376113,0.0009042075,0.000101009915,0.000110752386,0.001021565,0.0004249875,0.34738263,0.071948476,0.5206811,0.0568142,0.00011694582],"about_ca_topic_score_codex":0.00074783555,"about_ca_topic_score_gemma":0.0011963882,"teacher_disagreement_score":0.008655005,"about_ca_system_score_codex":0.00024476572,"about_ca_system_score_gemma":0.000767299,"threshold_uncertainty_score":0.02895391},"labels":[],"label_agreement":null},{"id":"W1999708677","doi":"10.1112/jlms/jdn085","title":"Super-identical pseudospectra","year":2009,"lang":"en","type":"article","venue":"Journal of the London Mathematical Society","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Université Laval","keywords":"Integer (computer science); Mathematics; Invariant (physics); Combinatorics; Pure mathematics; Complex matrix; Mathematical physics; Computer science; Chemistry","score_opus":0.009144217660169162,"score_gpt":0.24227459313081778,"score_spread":0.23313037547064863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999708677","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73040843,0.00024163787,0.23213817,0.00025641537,0.00016006098,0.00005759833,0.00020091259,0.0002496309,0.03628716],"genre_scores_gemma":[0.9746866,0.00010503844,0.020345349,0.00018668764,0.00009358122,0.00004314631,0.00017295449,0.00005919004,0.004307539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980763,0.00034590688,0.00013026083,0.000429311,0.0006835322,0.00033460214],"domain_scores_gemma":[0.99635714,0.0007391904,0.0006451964,0.0010807419,0.0007302358,0.00044747576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085345627,0.00048467205,0.00043702082,0.0010603736,0.0008697113,0.0012398391,0.0007283884,0.0007444421,0.006687828],"category_scores_gemma":[0.0053735343,0.00028778982,0.00048151845,0.0006571718,0.0023314273,0.00309336,0.002035833,0.00090676785,0.0008058778],"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.0002611965,0.00005965955,0.0032189165,0.00007846035,0.000029368526,0.001227653,0.0008153432,0.004072492,0.023458831,0.94048154,0.0015023841,0.02479422],"study_design_scores_gemma":[0.000037604124,0.0003610459,0.0045339838,0.000038348433,0.0000283028,0.0027555157,0.0005212545,0.0456378,0.022818401,0.9124538,0.010715203,0.000098722245],"about_ca_topic_score_codex":0.00024601602,"about_ca_topic_score_gemma":0.00020056174,"teacher_disagreement_score":0.006687828,"about_ca_system_score_codex":0.0003007422,"about_ca_system_score_gemma":0.00040307498,"threshold_uncertainty_score":0.022372961},"labels":[],"label_agreement":null},{"id":"W1999875986","doi":"10.1016/j.jmaa.2005.04.006","title":"Fixed points and positive eigenvalues for nonlinear operators","year":2005,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Nonlinear system; Pure mathematics; Fixed point; Mathematical analysis; Applied mathematics","score_opus":0.009802375480768805,"score_gpt":0.2750868583501385,"score_spread":0.26528448286936973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999875986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4577787,0.0018981035,0.49409643,0.0025206315,0.0004720533,0.00009869659,0.00015557792,0.000326979,0.042652972],"genre_scores_gemma":[0.95524335,0.0008370753,0.027870847,0.00021499902,0.00028444198,0.00016528417,0.000120897625,0.00015694389,0.015106002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994307,0.00018168127,0.000026281874,0.00010839946,0.00017550959,0.00007731733],"domain_scores_gemma":[0.9951887,0.0032079981,0.00053224957,0.00023501618,0.0004855236,0.00035050383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014390477,0.001145498,0.0009600373,0.0027243816,0.0016485412,0.0030014478,0.0012738768,0.001903445,0.0059247916],"category_scores_gemma":[0.010871406,0.0007509631,0.0007117711,0.00092959974,0.004049856,0.0031250266,0.0021416508,0.002455073,0.00075033074],"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.0001416016,0.000049278176,0.00048609567,0.000090805835,0.000028042856,0.00034659775,0.0006679162,0.0066276425,0.0055790176,0.9750226,0.0016654439,0.009294879],"study_design_scores_gemma":[0.00004168116,0.00003116578,0.00026397625,0.000022101574,0.0000092567,0.00014186827,0.00020220912,0.040643793,0.00073780335,0.9570085,0.00086849753,0.000029076418],"about_ca_topic_score_codex":0.0007013692,"about_ca_topic_score_gemma":0.00060774334,"teacher_disagreement_score":0.0059247916,"about_ca_system_score_codex":0.0009670006,"about_ca_system_score_gemma":0.000552506,"threshold_uncertainty_score":0.019820392},"labels":[],"label_agreement":null},{"id":"W2000074722","doi":"10.1023/b:supe.0000026847.75355.69","title":"Parallel MCGLS and ICGLS Methods for Least Squares Problems on Distributed Memory Architectures","year":2004,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Bottleneck; Parallel computing; Conjugate gradient method; Synchronization (alternating current); Distributed memory; Parallel algorithm; Least-squares function approximation; Product (mathematics); Algorithm; Shared memory; Mathematics; Telecommunications","score_opus":0.02407950502449638,"score_gpt":0.3036313280909358,"score_spread":0.2795518230664394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000074722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010575981,0.00033088747,0.98138225,0.00043456195,0.00026070297,0.000059174326,0.00012711441,0.0016716613,0.005157646],"genre_scores_gemma":[0.13441098,0.00024591153,0.8509832,0.0003462757,0.00030934418,0.0002924115,0.00039868816,0.00081709214,0.012196013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991819,0.0003068728,0.00004108486,0.00008756457,0.00030676599,0.000075783915],"domain_scores_gemma":[0.9982868,0.0006911972,0.00009536498,0.00038907884,0.00042963214,0.000107976965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010368772,0.00086925935,0.0008725555,0.0008631324,0.0006827566,0.00090921146,0.0020553402,0.0010769387,0.009956676],"category_scores_gemma":[0.005015007,0.0004842671,0.0006761937,0.0012411618,0.0010090013,0.001336793,0.0020143047,0.001713301,0.0022692948],"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.00081597344,0.00020175976,0.001274883,0.0003481081,0.00011789982,0.00017852377,0.00023663674,0.50785136,0.007811792,0.071193084,0.022563733,0.38740623],"study_design_scores_gemma":[0.00007135011,0.000030007204,0.00010883099,0.000009183741,0.000008814693,0.000017387352,0.000021499938,0.97679865,0.0014124142,0.017279916,0.0042334357,0.00000863219],"about_ca_topic_score_codex":0.0073515307,"about_ca_topic_score_gemma":0.01702292,"teacher_disagreement_score":0.009956676,"about_ca_system_score_codex":0.0006823156,"about_ca_system_score_gemma":0.0014710929,"threshold_uncertainty_score":0.033308446},"labels":[],"label_agreement":null},{"id":"W2003292375","doi":"10.1016/j.laa.2004.04.008","title":"Inner totally positive matrices","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Minor (academic); Eigenvalues and eigenvectors; Combinatorics; Matrix (chemical analysis); Inverse; Similarity (geometry); Chemistry; Geometry; Physics; Quantum mechanics","score_opus":0.0067229160182532,"score_gpt":0.23450199651710826,"score_spread":0.22777908049885506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003292375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057468515,0.002569524,0.6402509,0.0018627581,0.002080889,0.00008970774,0.0006292151,0.0013244606,0.293724],"genre_scores_gemma":[0.6590042,0.0028903706,0.08243263,0.001692548,0.001927397,0.00019242665,0.0007803401,0.0009674565,0.2501127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999233,0.00018851954,0.000028828363,0.00015393957,0.00029761734,0.000098082965],"domain_scores_gemma":[0.99846256,0.00038973382,0.0002293315,0.00024100504,0.00047383964,0.00020354862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006319667,0.001270988,0.00059424393,0.0015300573,0.0010242717,0.0031926348,0.00065628026,0.0007581183,0.018892732],"category_scores_gemma":[0.0026602575,0.000421945,0.0005416336,0.0013175431,0.002079654,0.002586803,0.0019875783,0.0024103674,0.005748464],"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.000027681332,0.000021675214,0.00009096124,0.00006332744,0.000010356115,0.00006288408,0.00016733397,0.0010084709,0.0020427986,0.96476674,0.00782739,0.023910396],"study_design_scores_gemma":[0.0000066149723,0.000029439198,0.00018297415,0.000022380575,0.000010247824,0.00032281908,0.00007006043,0.0053943954,0.0033587469,0.9608145,0.029763823,0.000024087914],"about_ca_topic_score_codex":0.00020201209,"about_ca_topic_score_gemma":0.00030359247,"teacher_disagreement_score":0.018892732,"about_ca_system_score_codex":0.00045131685,"about_ca_system_score_gemma":0.0005292648,"threshold_uncertainty_score":0.0632025},"labels":[],"label_agreement":null},{"id":"W2003508782","doi":"10.1090/s0025-5718-03-01591-6","title":"Gaussian elimination is stable for the inverse of a diagonally dominant matrix","year":2003,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":12,"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":"Diagonally dominant matrix; Mathematics; Diagonal; Sigma; Combinatorics; Inverse; Gaussian; Matrix (chemical analysis); Geometry; Pure mathematics; Physics; Invertible matrix; Chemistry","score_opus":0.018001114113116452,"score_gpt":0.2780450630124894,"score_spread":0.26004394889937293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003508782","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04156297,0.00044888866,0.86529976,0.00095147965,0.0005213557,0.00009714028,0.0010303275,0.0046171895,0.08547091],"genre_scores_gemma":[0.6060017,0.0010792967,0.21019427,0.0016042627,0.0007484994,0.0002912941,0.0035493807,0.006350079,0.17018119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980878,0.00020212635,0.00008335788,0.0004286489,0.00081051415,0.0003874674],"domain_scores_gemma":[0.9964038,0.00097610976,0.00027393305,0.00075151725,0.0013873429,0.0002073343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012647393,0.001118809,0.0009177033,0.0015901665,0.0014929716,0.003391193,0.0010757303,0.0009176767,0.027413597],"category_scores_gemma":[0.008777188,0.0005181333,0.0011824578,0.001348323,0.0020803984,0.002727009,0.0023332671,0.002068089,0.02282193],"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.00033081093,0.000106020336,0.0010330037,0.00021973181,0.00006656727,0.00041509868,0.0004524615,0.009050654,0.014961741,0.82616234,0.054421198,0.092780374],"study_design_scores_gemma":[0.00007561651,0.0001210697,0.0011640089,0.000086719476,0.000042429318,0.00063413545,0.00020785096,0.11214335,0.025518518,0.80844647,0.05144699,0.00011284646],"about_ca_topic_score_codex":0.0056191306,"about_ca_topic_score_gemma":0.0069620023,"teacher_disagreement_score":0.027413597,"about_ca_system_score_codex":0.0011422156,"about_ca_system_score_gemma":0.0016258971,"threshold_uncertainty_score":0.09170765},"labels":[],"label_agreement":null},{"id":"W2003785292","doi":"10.1016/j.laa.2008.12.005","title":"On some matrix equalities for generalized inverses with applications","year":2009,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Matrix (chemical analysis); Generalized inverse; Algebra over a field; Pure mathematics; Combinatorics; Inverse; Geometry","score_opus":0.016635733841305015,"score_gpt":0.2794456435038612,"score_spread":0.2628099096625562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003785292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06509368,0.0074552917,0.76610476,0.0057750023,0.0022147864,0.000086938446,0.00027382316,0.00032842738,0.15266731],"genre_scores_gemma":[0.7293965,0.0073917313,0.16731803,0.00324948,0.0049130977,0.00030603778,0.0004656392,0.00060994894,0.08634955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981299,0.0007260437,0.000116368894,0.0003682059,0.00045060122,0.00020884686],"domain_scores_gemma":[0.99549073,0.0030975211,0.00023450868,0.00038662745,0.0005629488,0.00022764632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028424042,0.0019509232,0.0013458123,0.0027251472,0.0023413494,0.0038667875,0.001929214,0.001798559,0.014170028],"category_scores_gemma":[0.011353078,0.0007943984,0.0018618017,0.00454598,0.00487279,0.009346239,0.0041545862,0.00547616,0.0020588366],"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.000020754513,0.000017296483,0.000047331767,0.00004162972,0.0000073636907,0.000050693983,0.0002015363,0.00075929525,0.0002781209,0.9874664,0.0019121732,0.009197379],"study_design_scores_gemma":[0.000004716746,0.000008121588,0.000029732615,0.000012692413,0.0000057686984,0.000055396482,0.000030105795,0.0028893505,0.0001738568,0.9940701,0.002711472,0.000008604808],"about_ca_topic_score_codex":0.0010407735,"about_ca_topic_score_gemma":0.0010791416,"teacher_disagreement_score":0.014170028,"about_ca_system_score_codex":0.001282681,"about_ca_system_score_gemma":0.0007353433,"threshold_uncertainty_score":0.047403455},"labels":[],"label_agreement":null},{"id":"W2004250028","doi":"10.1016/j.laa.2007.04.013","title":"Perturbing non-real eigenvalues of non-negative real matrices","year":2007,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Imperial Bank of Commerce (Canada)","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Rank (graph theory); Perturbation (astronomy); Spectrum (functional analysis); Combinatorics; Linear algebra; Matrix (chemical analysis); Pure mathematics; Algebra over a field; Geometry; Physics; Quantum mechanics","score_opus":0.010923355066189553,"score_gpt":0.27414547451826865,"score_spread":0.2632221194520791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004250028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35742596,0.00043636543,0.6147648,0.00069806905,0.0004419397,0.000067343004,0.00009502348,0.00042551497,0.02564497],"genre_scores_gemma":[0.95206225,0.0003205897,0.0403437,0.00022164709,0.00007355422,0.00004099097,0.000064955835,0.00012687266,0.006745416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955183,0.0001536633,0.000017565553,0.000088772766,0.00013810938,0.00005006858],"domain_scores_gemma":[0.99821633,0.0010247002,0.00021063744,0.00028598623,0.00014888334,0.00011343581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000717109,0.0007307916,0.0004976791,0.00052110676,0.00042299833,0.0008482958,0.0006621134,0.000779606,0.0052469415],"category_scores_gemma":[0.0056493664,0.0003230793,0.00027481758,0.00047533365,0.0013178933,0.0015612163,0.001195524,0.0008137127,0.0007532014],"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.0012802569,0.00037160993,0.0025843966,0.0004761077,0.00022893284,0.0011065429,0.0007154906,0.36220336,0.18932344,0.35332027,0.0037294254,0.08466014],"study_design_scores_gemma":[0.000050096995,0.00019470915,0.00119224,0.000026682928,0.000032270982,0.0005643243,0.0003723777,0.6744479,0.022891043,0.2964843,0.0036864798,0.00005767977],"about_ca_topic_score_codex":0.00025042373,"about_ca_topic_score_gemma":0.00033984665,"teacher_disagreement_score":0.0052469415,"about_ca_system_score_codex":0.00035262815,"about_ca_system_score_gemma":0.0001539609,"threshold_uncertainty_score":0.017552733},"labels":[],"label_agreement":null},{"id":"W2004529037","doi":"10.1137/s0895479803428230","title":"Block Diagonal and Schur Complement Preconditioners for Block-Toeplitz Systems with Small Size Blocks","year":2007,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Toeplitz matrix; Mathematics; Schur complement; Block matrix; Block (permutation group theory); Levinson recursion; Hermitian matrix; Combinatorics; Eigenvalues and eigenvectors; Pure mathematics","score_opus":0.012849499640514168,"score_gpt":0.2684716224729193,"score_spread":0.2556221228324051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004529037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010040423,0.00012771545,0.98796535,0.000103265884,0.00003555935,0.000032040873,0.000024366647,0.00008232878,0.0015890406],"genre_scores_gemma":[0.322817,0.0006192655,0.66623145,0.00014742315,0.00009860581,0.00023773716,0.00014249973,0.00011754933,0.009588508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962413,0.00015359605,0.000013252106,0.000044796598,0.00012633865,0.000037917933],"domain_scores_gemma":[0.999138,0.0005457168,0.00006888159,0.00007078498,0.00013692942,0.000039655537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005838138,0.00067244866,0.00062770053,0.00023508248,0.00036929498,0.0005446079,0.00048894837,0.0010313179,0.0031256757],"category_scores_gemma":[0.0022066066,0.0002985257,0.00035475413,0.0004118565,0.0009669284,0.0007904017,0.000661888,0.0011020919,0.00064572616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017408149,0.00008241965,0.00045950478,0.00021811879,0.000041415937,0.0002596014,0.00016150285,0.8079608,0.023330024,0.10751335,0.0026264687,0.05717275],"study_design_scores_gemma":[0.000009611335,0.000022620172,0.000041453375,0.0000033716929,0.0000029948728,0.000016138212,0.00001009087,0.9907941,0.001859755,0.006220474,0.0010151415,0.0000041454496],"about_ca_topic_score_codex":0.0037418425,"about_ca_topic_score_gemma":0.0042414945,"teacher_disagreement_score":0.0037418425,"about_ca_system_score_codex":0.0003458198,"about_ca_system_score_gemma":0.001103561,"threshold_uncertainty_score":0.010456383},"labels":[],"label_agreement":null},{"id":"W2005391161","doi":"10.1080/02331930903349466","title":"Spectral self-concordant functions in the space of two-by-two symmetric matrices","year":2010,"lang":"en","type":"article","venue":"Optimization","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Space (punctuation); Function (biology); Pure mathematics; Computer science","score_opus":0.005073224888707355,"score_gpt":0.22717383568744726,"score_spread":0.2221006107987399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005391161","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67782795,0.00024759283,0.30379558,0.00037793725,0.00004983477,0.00003572818,0.00009975165,0.0001352953,0.017430324],"genre_scores_gemma":[0.97814333,0.00011369536,0.015777476,0.000054072363,0.000036269626,0.000036897825,0.000077796576,0.00003817681,0.0057222694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993098,0.0002747623,0.000020673016,0.00008027189,0.0002043898,0.000110022855],"domain_scores_gemma":[0.99764293,0.0009473263,0.00036760056,0.00021692985,0.00046971272,0.00035537343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012027795,0.0006778467,0.0004023663,0.0015569571,0.000676702,0.0013075523,0.0006666216,0.00053960795,0.0032237957],"category_scores_gemma":[0.0044054994,0.00021536832,0.00033785184,0.00047355902,0.0020050416,0.0013519304,0.0010758333,0.000659581,0.0004899459],"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.00019238105,0.000075317315,0.0015603366,0.000059085003,0.000024809482,0.0001998107,0.00025242183,0.043396175,0.0063507794,0.93247837,0.0015253728,0.013884996],"study_design_scores_gemma":[0.00003160076,0.00009411312,0.0015424867,0.000023403718,0.000009185783,0.00028509228,0.0001526152,0.49250326,0.005759459,0.49749845,0.0020658998,0.000034489636],"about_ca_topic_score_codex":0.0006918415,"about_ca_topic_score_gemma":0.00043542983,"teacher_disagreement_score":0.0032237957,"about_ca_system_score_codex":0.0007141972,"about_ca_system_score_gemma":0.0004993125,"threshold_uncertainty_score":0.010784686},"labels":[],"label_agreement":null},{"id":"W2005456162","doi":"10.1016/s0024-3795(03)00650-5","title":"Twosetsofnewcharacterizationsfornormaland EP matrices","year":2003,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Combinatorics; Pure mathematics; Matrix (chemical analysis); Normal matrix; Algebra over a field; Eigenvalues and eigenvectors","score_opus":0.009023946820275953,"score_gpt":0.23559717113842263,"score_spread":0.22657322431814667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005456162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07974997,0.0026175494,0.84652174,0.0021632472,0.002710214,0.00023317261,0.0010564595,0.0019175145,0.06303009],"genre_scores_gemma":[0.5636479,0.003625053,0.3373712,0.0027922185,0.0032326605,0.00079986843,0.0042030886,0.0019372051,0.082390755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762887,0.00043961097,0.00021892777,0.00053186493,0.0008099452,0.00037083373],"domain_scores_gemma":[0.9966737,0.0007393427,0.00037983336,0.0008887711,0.00094223185,0.00037619122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014414556,0.0024034863,0.0011113976,0.0038867518,0.003103886,0.0048912046,0.0017222892,0.0017794458,0.020196589],"category_scores_gemma":[0.0043281675,0.0007051354,0.0013498417,0.0035973096,0.0035363096,0.0105047375,0.0053076493,0.004632677,0.0035599356],"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.00013136555,0.00008876676,0.00076487917,0.000163607,0.000014897021,0.00032218575,0.0005124464,0.000553063,0.0048460346,0.91223836,0.009321945,0.07104251],"study_design_scores_gemma":[0.00004245723,0.00011907858,0.0010520043,0.000089312205,0.00003169485,0.0014924593,0.0005292023,0.011923096,0.007526743,0.90458477,0.072505295,0.00010392033],"about_ca_topic_score_codex":0.00034578552,"about_ca_topic_score_gemma":0.0005564157,"teacher_disagreement_score":0.020196589,"about_ca_system_score_codex":0.001347171,"about_ca_system_score_gemma":0.00082871894,"threshold_uncertainty_score":0.06756431},"labels":[],"label_agreement":null},{"id":"W2006251125","doi":"10.4028/www.scientific.net/amm.496-500.2011","title":"A Schur-Type Factorization of Central Extended Matrix","year":2014,"lang":"en","type":"article","venue":"Applied Mechanics and Materials","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":"University of British Columbia","keywords":"Factorization; Mathematics; Schur product theorem; Matrix (chemical analysis); Single-entry matrix; Hollow matrix; Matrix decomposition; Schur complement; Schur's theorem; Class (philosophy); Schur decomposition; Pure mathematics; Nonnegative matrix; Centrosymmetric matrix; Pascal matrix; Matrix function; Symmetric matrix; Algebra over a field; Physics; Computer science; Algorithm; Eigenvalues and eigenvectors; Chemistry","score_opus":0.007717147603499948,"score_gpt":0.22136384752864174,"score_spread":0.2136466999251418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006251125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10085369,0.0010104512,0.8738784,0.00035652512,0.00022721475,0.000056191988,0.00016672954,0.00014726115,0.023303583],"genre_scores_gemma":[0.8400966,0.0013542582,0.13961786,0.00039064742,0.00048848626,0.0000899468,0.00034066325,0.00011657234,0.017504916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996573,0.00007313354,0.000010158512,0.000084249754,0.00011918616,0.000056106277],"domain_scores_gemma":[0.9992066,0.00020636345,0.0001274685,0.000090716436,0.00029027762,0.000078647165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005490941,0.0006160746,0.00043169057,0.0008478351,0.0006211794,0.0007611691,0.0005091924,0.0006328666,0.005539369],"category_scores_gemma":[0.0019414776,0.00018805887,0.00047573503,0.0005516173,0.0012287368,0.001967047,0.00053574407,0.00079046725,0.00092674367],"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.00007184364,0.000035784964,0.0005574951,0.00013798723,0.000019051073,0.000440441,0.00024498798,0.01651668,0.016985008,0.9402925,0.0037468455,0.020951455],"study_design_scores_gemma":[0.000024801493,0.00015242636,0.0006681327,0.00004014209,0.000015996913,0.0009817313,0.00019134766,0.30808127,0.008068962,0.6730812,0.008618627,0.00007540897],"about_ca_topic_score_codex":0.0007968776,"about_ca_topic_score_gemma":0.000851519,"teacher_disagreement_score":0.005539369,"about_ca_system_score_codex":0.0003767016,"about_ca_system_score_gemma":0.00044133162,"threshold_uncertainty_score":0.018531024},"labels":[],"label_agreement":null},{"id":"W2006625641","doi":"10.1016/j.jmaa.2006.11.022","title":"On a result of Cartlidge","year":2007,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Simple (philosophy); Operator (biology); Calculus (dental); Pure mathematics; Combinatorics; Algebra over a field; Epistemology","score_opus":0.010349485921544981,"score_gpt":0.27542306229143576,"score_spread":0.26507357636989076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006625641","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055638418,0.026402574,0.4196824,0.06070923,0.013574692,0.0001097149,0.0013406812,0.001253327,0.421289],"genre_scores_gemma":[0.45399618,0.022335894,0.12283371,0.024792371,0.012715398,0.00029007642,0.0013528637,0.0027793583,0.35890415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988558,0.00034574565,0.000049690487,0.00026778245,0.00027864389,0.0002023334],"domain_scores_gemma":[0.9970553,0.0017462993,0.00012920116,0.00033465598,0.00050329283,0.0002313143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014436981,0.0016560616,0.002430219,0.004623157,0.0038476542,0.002877211,0.0021127919,0.0028052814,0.023927676],"category_scores_gemma":[0.008318504,0.00093118474,0.0026371013,0.005288335,0.0052090613,0.01042817,0.0063512595,0.0068144286,0.004031017],"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.000078915815,0.00003241835,0.00020238894,0.0001701637,0.000035609788,0.00017771152,0.0003716148,0.0013200835,0.0005995688,0.9555466,0.025977718,0.015487169],"study_design_scores_gemma":[0.000015169009,0.000027595628,0.00027107098,0.00006004061,0.00003327316,0.00014089799,0.000072016584,0.003152679,0.00028104946,0.9478816,0.048036095,0.00002852621],"about_ca_topic_score_codex":0.0056196684,"about_ca_topic_score_gemma":0.0035175118,"teacher_disagreement_score":0.023927676,"about_ca_system_score_codex":0.0021642353,"about_ca_system_score_gemma":0.0010956231,"threshold_uncertainty_score":0.08004612},"labels":[],"label_agreement":null},{"id":"W2007649552","doi":"10.4153/cjm-2005-004-0","title":"Jordan Structures of Totally Nonnegative Matrices","year":2005,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":14,"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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Minor (academic); Nonnegative matrix; Matrix (chemical analysis); Pure mathematics; Symmetric matrix; Humanities; Eigenvalues and eigenvectors","score_opus":0.010475012807977684,"score_gpt":0.22459039546421355,"score_spread":0.21411538265623586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007649552","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79885656,0.00025788334,0.15695746,0.0003676392,0.00008076288,0.000056405195,0.00024919104,0.00017433077,0.0429998],"genre_scores_gemma":[0.9736304,0.00015852833,0.017108778,0.000078965946,0.000058743655,0.000040562645,0.00020725741,0.000046708472,0.0086699845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994449,0.00012896296,0.00003190222,0.00009707156,0.0001736502,0.00012348441],"domain_scores_gemma":[0.9990657,0.0001431192,0.0002533779,0.0000815723,0.0002775571,0.00017878202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037089543,0.00042946692,0.0002669908,0.0012963599,0.00084466295,0.0016304913,0.00044561434,0.0004225649,0.0044761715],"category_scores_gemma":[0.0012679663,0.00025102877,0.00037550624,0.00074014155,0.0012067391,0.0015283063,0.00085271656,0.00050252996,0.0005397165],"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.000055508135,0.000024013727,0.0009184117,0.00003954055,0.000009036626,0.00017137903,0.00026800454,0.003648362,0.009621518,0.9755427,0.0010524021,0.008649166],"study_design_scores_gemma":[0.000015864276,0.000051878887,0.00057693257,0.000021273901,0.000008944026,0.0004006037,0.00027529334,0.023076536,0.0053462978,0.96428275,0.005915936,0.000027772528],"about_ca_topic_score_codex":0.00038340673,"about_ca_topic_score_gemma":0.00063739746,"teacher_disagreement_score":0.0044761715,"about_ca_system_score_codex":0.00030500704,"about_ca_system_score_gemma":0.00029605615,"threshold_uncertainty_score":0.0149742365},"labels":[],"label_agreement":null},{"id":"W2007686302","doi":"10.1016/s0024-3795(02)00343-9","title":"Idempotency of linear combinations of an idempotent matrix and a tripotent matrix","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Idempotent matrix; Idempotence; Mathematics; Matrix (chemical analysis); Square root of a 2 by 2 matrix; Involutory matrix; Combinatorics; Matrix function; Symmetric matrix; Eigenvalues and eigenvectors; Composite material","score_opus":0.014942875938440521,"score_gpt":0.26847449799085316,"score_spread":0.25353162205241264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007686302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19509715,0.0011585549,0.63936263,0.0006460403,0.0013680946,0.00011146311,0.0006668273,0.00037995906,0.1612093],"genre_scores_gemma":[0.8027586,0.0015753239,0.1306477,0.000691607,0.0017708144,0.00038292713,0.0008912417,0.00061780243,0.060663935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998002,0.00043006678,0.00014250253,0.00043478454,0.0007109494,0.00027967212],"domain_scores_gemma":[0.996727,0.0012447536,0.0004325234,0.00037102957,0.00083967234,0.00038496952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017911778,0.0011377421,0.00082445424,0.002654738,0.0013037558,0.002703965,0.0012409473,0.00077781576,0.010507642],"category_scores_gemma":[0.0047111106,0.00046184,0.00085215206,0.0018586055,0.0025532271,0.0035781683,0.0015738006,0.0022084191,0.0024805712],"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.00019151482,0.000043599422,0.00020672055,0.00006203895,0.00002398395,0.00035088227,0.0002597361,0.0008481639,0.007432929,0.96036875,0.0024677787,0.027743906],"study_design_scores_gemma":[0.000026709937,0.000096961005,0.00030673144,0.000027520848,0.000024044732,0.0006697091,0.000095172065,0.0058054617,0.0073677637,0.9745096,0.011025365,0.000044855118],"about_ca_topic_score_codex":0.00015107564,"about_ca_topic_score_gemma":0.0001439728,"teacher_disagreement_score":0.010507642,"about_ca_system_score_codex":0.0004160891,"about_ca_system_score_gemma":0.00047159856,"threshold_uncertainty_score":0.03515154},"labels":[],"label_agreement":null},{"id":"W2007879790","doi":"10.48550/arxiv.1601.06471","title":"Bilinear characterizations of companion matrices","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Victoria","funders":"","keywords":"Bilinear interpolation; Mathematics; Type (biology); Bilinear form; Pure mathematics; Algebra over a field; Statistics; Geology","score_opus":0.04720691227420278,"score_gpt":0.18616193242299306,"score_spread":0.13895502014879027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007879790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28761488,0.0007728279,0.6300793,0.000819255,0.0003953016,0.00013764676,0.00057342753,0.0004711307,0.079136245],"genre_scores_gemma":[0.95960546,0.00045669574,0.020749956,0.00028751628,0.00046497368,0.00008881434,0.00038150552,0.0001488788,0.017816111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868196,0.00026808563,0.00006480265,0.0002713751,0.00045630307,0.00025748299],"domain_scores_gemma":[0.9952193,0.0012854569,0.00075880013,0.00083025737,0.0011617754,0.00074449624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009340718,0.00073274213,0.00051136146,0.0021633303,0.00091817434,0.0026277057,0.00057436666,0.0008474152,0.0109445],"category_scores_gemma":[0.006760354,0.00033708583,0.0005473634,0.0012707907,0.0019252313,0.0040684487,0.0025251627,0.0020018313,0.0018064694],"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.00009621101,0.000059337235,0.0009522076,0.00006982159,0.000013816695,0.000232529,0.00060318585,0.0030691267,0.0061885677,0.96993375,0.0024512596,0.016330196],"study_design_scores_gemma":[0.00001458997,0.00011185488,0.00070913916,0.000025136944,0.000008156771,0.00057668553,0.00029985202,0.027597357,0.0043075383,0.9580176,0.008297452,0.000034618955],"about_ca_topic_score_codex":0.000249544,"about_ca_topic_score_gemma":0.00019238298,"teacher_disagreement_score":0.0109445,"about_ca_system_score_codex":0.0005125436,"about_ca_system_score_gemma":0.00045461897,"threshold_uncertainty_score":0.036612928},"labels":[],"label_agreement":null},{"id":"W2007890346","doi":"10.1080/03081080108818684","title":"Linear operators preserving decomposable numerical radii on orthonormal tensors","year":2001,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Mathematics; Orthonormal basis; Matrix (chemical analysis); Degree (music); Combinatorics; Matrix function; Linear operators; Operator (biology); Pure mathematics; Orthonormality; Function (biology); Unitary state; Orthogonal matrix; Symmetric matrix; Mathematical analysis; Eigenvalues and eigenvectors; Orthogonal basis; Physics","score_opus":0.01410259040350412,"score_gpt":0.26301612502424093,"score_spread":0.24891353462073681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007890346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5733182,0.00029276093,0.4120906,0.0002575056,0.000057239802,0.00006979546,0.000110640816,0.00037390133,0.013429387],"genre_scores_gemma":[0.90719324,0.00033807333,0.08021068,0.00015204887,0.0001222508,0.00013841462,0.00015158672,0.00016212923,0.011531681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989504,0.00033461838,0.000050663646,0.00019679774,0.0002943732,0.00017322942],"domain_scores_gemma":[0.9977591,0.00069753744,0.00059083675,0.00030223903,0.0002336333,0.00041665533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013391606,0.0008013303,0.00042057602,0.0009736244,0.00048798573,0.0012674562,0.00067751313,0.0006200602,0.002830257],"category_scores_gemma":[0.0036339746,0.0003065393,0.00048391754,0.00048471967,0.002051137,0.002671645,0.0016986746,0.000856114,0.00056191615],"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.00011612408,0.000046190966,0.0005435841,0.00005825669,0.00001565346,0.00028039346,0.0005188729,0.010540754,0.023722189,0.9436466,0.0007898998,0.01972134],"study_design_scores_gemma":[0.000054890126,0.00029411766,0.0010573021,0.000031062824,0.0000139394,0.0006870724,0.0004599055,0.19089739,0.018807562,0.78310317,0.004538507,0.00005510343],"about_ca_topic_score_codex":0.0002730125,"about_ca_topic_score_gemma":0.00030874842,"teacher_disagreement_score":0.002830257,"about_ca_system_score_codex":0.0005344704,"about_ca_system_score_gemma":0.00033573736,"threshold_uncertainty_score":0.009468198},"labels":[],"label_agreement":null},{"id":"W2008178409","doi":"10.1016/j.mcm.2012.11.017","title":"Finite-element-wise domain decomposition iterative solvers with polynomial preconditioning","year":2012,"lang":"en","type":"article","venue":"Mathematical and Computer Modelling","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Air Force Research Laboratory","keywords":"Preconditioner; Domain decomposition methods; Solver; Finite element method; Generalized minimal residual method; Computer science; Condition number; Iterative method; Polynomial; Degree of a polynomial; Computational science; Parallel computing; Scalability; Computation; Applied mathematics; Algorithm; Mathematical optimization; Mathematics; Mathematical analysis","score_opus":0.015232586838509874,"score_gpt":0.23349558523798902,"score_spread":0.21826299839947916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008178409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00092650665,0.000035364475,0.9974722,0.000044543307,0.000028316526,0.00001946183,0.000019152392,0.00016151505,0.0012928933],"genre_scores_gemma":[0.043323394,0.000118391115,0.95285493,0.000068598965,0.000026508515,0.00013773168,0.0001256289,0.00018925541,0.0031555884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920374,0.0002375947,0.000047474863,0.00007695605,0.00038378016,0.000050454957],"domain_scores_gemma":[0.9983728,0.00058346736,0.00012753121,0.00034920682,0.0004974123,0.000069552225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009413908,0.0008724856,0.0011964947,0.0005191774,0.00049602083,0.0010022355,0.0015367167,0.0014743733,0.0059864447],"category_scores_gemma":[0.0044310214,0.00046518337,0.0007042932,0.0009869129,0.00074494665,0.0010974245,0.0019455807,0.002116535,0.0031420265],"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.00027152486,0.0001711619,0.0006946129,0.0006266493,0.000116382136,0.0001916034,0.00034520298,0.4746934,0.036184944,0.107206605,0.0121392505,0.36735862],"study_design_scores_gemma":[0.000024505653,0.000030817017,0.000057616555,0.000015649359,0.000010405401,0.000069046895,0.00002178134,0.9799815,0.0062428694,0.008155269,0.005379758,0.000010810261],"about_ca_topic_score_codex":0.0015352439,"about_ca_topic_score_gemma":0.0023873127,"teacher_disagreement_score":0.0059864447,"about_ca_system_score_codex":0.00032627836,"about_ca_system_score_gemma":0.0013998096,"threshold_uncertainty_score":0.020026684},"labels":[],"label_agreement":null},{"id":"W2008280494","doi":"10.1145/2331684.2331706","title":"Numerical stability of barycentric Hermite root-finding","year":2012,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hermite polynomials; Properties of polynomial roots; Eigenvalues and eigenvectors; Characteristic polynomial; Mathematics; Matrix polynomial; Companion matrix; Basis (linear algebra); Hermite interpolation; Barycentric coordinate system; Polynomial; Wilkinson's polynomial; Polynomial matrix; Stability (learning theory); Root (linguistics); Vandermonde matrix; Matrix (chemical analysis); Lagrange polynomial; Applied mathematics; Mathematical analysis; Computer science; Geometry; Physics","score_opus":0.021540325871361603,"score_gpt":0.25618144389866515,"score_spread":0.23464111802730356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008280494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09188878,0.0002465833,0.89791477,0.00040762484,0.00009509371,0.000047983223,0.00008459181,0.0010540746,0.008260535],"genre_scores_gemma":[0.77399856,0.00010686874,0.22254185,0.000091215305,0.000042730313,0.00009546508,0.0001326713,0.00027636442,0.0027142318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889624,0.00037851225,0.000032930766,0.00014858293,0.00044523575,0.00009841611],"domain_scores_gemma":[0.9944871,0.003426554,0.00039670066,0.0006303335,0.0009092111,0.00015019412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020877488,0.0004378498,0.0006883991,0.0005653032,0.0006716963,0.0016864047,0.0014570917,0.0009963271,0.002483323],"category_scores_gemma":[0.017032819,0.00040383305,0.00028873413,0.0006897647,0.0013323494,0.0012234715,0.0016477078,0.0011814153,0.0007785299],"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.0007194467,0.00008365086,0.0028286756,0.0001262575,0.000058874597,0.00010510646,0.00023061331,0.82370335,0.011562567,0.09156907,0.002131321,0.066881076],"study_design_scores_gemma":[0.000008612635,0.000010393211,0.00007644732,0.000003946041,0.0000016516951,0.000008778292,0.000009827874,0.99235886,0.0011267477,0.0061558518,0.00023349728,0.0000053543613],"about_ca_topic_score_codex":0.0036859054,"about_ca_topic_score_gemma":0.003666207,"teacher_disagreement_score":0.0036859054,"about_ca_system_score_codex":0.0011041947,"about_ca_system_score_gemma":0.0012616928,"threshold_uncertainty_score":0.011041164},"labels":[],"label_agreement":null},{"id":"W2008280507","doi":"10.1063/1.481492","title":"A new iterative method for calculating energy levels and wave functions","year":2000,"lang":"en","type":"article","venue":"The Journal of Chemical Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Lanczos resampling; Precondition; Iterative method; Lanczos algorithm; Wave function; Mathematics; Applied mathematics; Hamiltonian (control theory); Energy (signal processing); Mathematical analysis; Algorithm; Mathematical optimization; Computer science; Eigenvalues and eigenvectors; Physics; Statistics; Quantum mechanics","score_opus":0.027112379464582205,"score_gpt":0.2796081261269244,"score_spread":0.25249574666234215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008280507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009803639,0.00006730125,0.99658126,0.00004829411,0.000060348928,0.00003446543,0.000029149567,0.0001888203,0.0020100614],"genre_scores_gemma":[0.015874444,0.00015618335,0.97769314,0.00008448535,0.000046063655,0.00022311059,0.00010852398,0.00021345798,0.005600563],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992574,0.00014837406,0.000034020944,0.00006817215,0.00044717747,0.000044769953],"domain_scores_gemma":[0.99936897,0.00019418569,0.00003790771,0.0000884519,0.0002668065,0.000043644282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076645165,0.0006705432,0.00071892736,0.00072483544,0.00075516663,0.00079125137,0.0019876342,0.0011082687,0.006360611],"category_scores_gemma":[0.0019173458,0.00042654644,0.0009431788,0.00081328565,0.00062654814,0.0014825664,0.0012148375,0.0013816956,0.002314232],"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.00012029591,0.00018641127,0.0008508666,0.0005969608,0.0001854143,0.00039469815,0.00042178034,0.24489337,0.049858067,0.22927043,0.018738566,0.45448315],"study_design_scores_gemma":[0.000038512073,0.000056781177,0.00014826863,0.000031594598,0.000026853548,0.00023666858,0.000023686922,0.93047684,0.007117369,0.033072803,0.028727984,0.000042586107],"about_ca_topic_score_codex":0.0015923596,"about_ca_topic_score_gemma":0.002649369,"teacher_disagreement_score":0.006360611,"about_ca_system_score_codex":0.00035421562,"about_ca_system_score_gemma":0.0012242461,"threshold_uncertainty_score":0.021278381},"labels":[],"label_agreement":null},{"id":"W2008925030","doi":"10.1090/s0002-9947-03-03136-2","title":"Accelerating the convergence of the method of alternating projections","year":2003,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of Guelph","funders":"","keywords":"Linear subspace; Mathematics; Intersection (aeronautics); Hilbert space; Class (philosophy); Convergence (economics); Algorithm; Computer science; Pure mathematics","score_opus":0.025140815819704242,"score_gpt":0.29744307344050935,"score_spread":0.2723022576208051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008925030","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020443441,0.0001732775,0.9762872,0.00010835717,0.000055240074,0.000040280174,0.000011749922,0.00019559667,0.002684828],"genre_scores_gemma":[0.2648149,0.00038927572,0.7301229,0.0001024115,0.00008522513,0.00025598807,0.000060524282,0.00016012421,0.0040085874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854845,0.00071021955,0.00004682539,0.000108822045,0.0004952853,0.00009045451],"domain_scores_gemma":[0.9970906,0.0017208596,0.00015864591,0.0003976307,0.0005362801,0.000095858886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025218679,0.00083735085,0.0007047447,0.00067673554,0.00054611976,0.0008281936,0.0009571375,0.0008717107,0.0019035103],"category_scores_gemma":[0.00919749,0.00045421656,0.0006122461,0.00048149042,0.0014286552,0.0017705997,0.002044419,0.0016027839,0.0006562374],"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.0003975191,0.000100284815,0.0012969756,0.00021985197,0.00012451057,0.00020958573,0.0004280316,0.49241155,0.021283433,0.34281448,0.0024106028,0.13830319],"study_design_scores_gemma":[0.00002237248,0.000054766526,0.00009476073,0.000012222384,0.000007229357,0.000063692925,0.00001815165,0.95177555,0.004967606,0.04072019,0.0022492756,0.0000142227],"about_ca_topic_score_codex":0.00114459,"about_ca_topic_score_gemma":0.0008612724,"teacher_disagreement_score":0.0025218679,"about_ca_system_score_codex":0.0004722945,"about_ca_system_score_gemma":0.0011842342,"threshold_uncertainty_score":0.013337076},"labels":[],"label_agreement":null},{"id":"W2008948528","doi":"10.1016/j.laa.2013.06.002","title":"On matrices over an arbitrary semiring and their generalized inverses","year":2013,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Shanghai Municipal Education Commission; National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Mathematics; Square matrix; Semiring; Inverse; Involutory matrix; Complex Hadamard matrix; Matrix (chemical analysis); Combinatorics; Matrix multiplication; Hermitian matrix; Hadamard product; Matrix ring; Square root of a 2 by 2 matrix; Hadamard matrix; Pure mathematics; Hadamard transform; Symmetric matrix; Invertible matrix; Mathematical analysis; Eigenvalues and eigenvectors","score_opus":0.01109087202161637,"score_gpt":0.23762011313860143,"score_spread":0.22652924111698505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008948528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21679653,0.009732774,0.6836777,0.0035225612,0.0010356301,0.000064987464,0.0003609239,0.00031296906,0.08449603],"genre_scores_gemma":[0.832424,0.008448753,0.10874136,0.0010238822,0.001798947,0.00012288227,0.00037224515,0.00021129902,0.046856686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988024,0.00042117568,0.000065490676,0.00022310096,0.00034775617,0.000139989],"domain_scores_gemma":[0.99746513,0.0013714961,0.0003686774,0.00029278372,0.00033248798,0.00016939995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012683952,0.0013863675,0.00086793344,0.0023752407,0.0012815038,0.002655837,0.0011460629,0.0010849817,0.0051521095],"category_scores_gemma":[0.0049906825,0.00051588024,0.00095293554,0.004279893,0.003917301,0.006368242,0.0022548006,0.002519119,0.0011768102],"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.000031186482,0.00002312196,0.00011561664,0.000046321584,0.000007994981,0.00009175051,0.0003363932,0.0026565047,0.0007640318,0.9831836,0.0011248644,0.011618623],"study_design_scores_gemma":[0.0000046544424,0.000019405334,0.00010352644,0.000015243234,0.000006012306,0.00009609026,0.000077063196,0.00851773,0.0002848565,0.9877067,0.0031543025,0.0000143955085],"about_ca_topic_score_codex":0.0014265955,"about_ca_topic_score_gemma":0.0015203232,"teacher_disagreement_score":0.0051521095,"about_ca_system_score_codex":0.00093775673,"about_ca_system_score_gemma":0.00051747466,"threshold_uncertainty_score":0.017235518},"labels":[],"label_agreement":null},{"id":"W2008973331","doi":"10.1016/j.laa.2008.12.008","title":"Inverse positivity of perturbed tridiagonal <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:math>-matrices","year":2009,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Inverse; Tridiagonal matrix; Mathematics; Toeplitz matrix; Matrix (chemical analysis); Combinatorics; Algebra over a field; Pure mathematics; Geometry; Eigenvalues and eigenvectors; Physics","score_opus":0.013089042287839617,"score_gpt":0.23845692099857824,"score_spread":0.22536787871073863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008973331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11405363,0.0006644617,0.6522097,0.0018132706,0.0010678776,0.00012430703,0.00074018945,0.0007432289,0.22858337],"genre_scores_gemma":[0.8473581,0.00078254845,0.069221124,0.0010518722,0.0004908797,0.00015794764,0.0006885208,0.0011197553,0.079129204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990157,0.00029036196,0.00003358867,0.00017530326,0.00034419607,0.00014084495],"domain_scores_gemma":[0.99647266,0.0010105722,0.00031348085,0.00037042974,0.0014502136,0.00038268993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011624276,0.0007677133,0.00052960165,0.0012088169,0.0008825218,0.002682214,0.0008460657,0.00075938937,0.024200998],"category_scores_gemma":[0.008288344,0.0003597344,0.0006214799,0.000514685,0.0021504355,0.002819356,0.0014574128,0.0019305474,0.0038288152],"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.00015427923,0.000044650078,0.000312242,0.00020135146,0.000019282836,0.0002861959,0.0003065682,0.011499554,0.009066176,0.9449133,0.016247327,0.016949069],"study_design_scores_gemma":[0.000015989284,0.000048466936,0.0003797723,0.00003726185,0.000007037624,0.0004593033,0.00017889697,0.119366184,0.007924697,0.8645591,0.0069797114,0.000043512075],"about_ca_topic_score_codex":0.0009466513,"about_ca_topic_score_gemma":0.00078562024,"teacher_disagreement_score":0.024200998,"about_ca_system_score_codex":0.0007737509,"about_ca_system_score_gemma":0.0009138597,"threshold_uncertainty_score":0.08096045},"labels":[],"label_agreement":null},{"id":"W20093282","doi":"10.1007/3-540-27912-1_4","title":"Computing the Least Squares Inverse of Sparse Matrices on a Network of Clusters","year":2005,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Multithreading; Load balancing (electrical power); Computer science; Parallel computing; Inverse; Distributed computing; Architecture; Algorithm; Thread (computing); Mathematics; Operating system","score_opus":0.019363613538484457,"score_gpt":0.22692678127119437,"score_spread":0.2075631677327099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W20093282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009257994,0.00014587164,0.9868656,0.00019485615,0.00004921016,0.000017006154,0.000105240586,0.00050733174,0.0028569312],"genre_scores_gemma":[0.11985076,0.00040584095,0.86500067,0.00008568117,0.000089196335,0.00007833491,0.0005413448,0.00032261823,0.01362553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950635,0.000119297336,0.00001978457,0.00014069806,0.0001692946,0.000044517317],"domain_scores_gemma":[0.998329,0.0009199198,0.00009431349,0.00030921842,0.0002924128,0.00005521851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005402592,0.0010721551,0.0011157454,0.00066040404,0.0006727884,0.0012281477,0.001692815,0.0010573922,0.004893368],"category_scores_gemma":[0.0046174685,0.0006120011,0.00064513594,0.0015265552,0.0010196787,0.0022018652,0.0013887117,0.0014710922,0.0018297771],"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.00016517493,0.00005817638,0.0010407658,0.0002880636,0.00010883113,0.00014926767,0.0002950943,0.63262177,0.010740792,0.073260896,0.014173823,0.26709738],"study_design_scores_gemma":[0.000011027632,0.000027666285,0.00028427297,0.000010884905,0.00001277136,0.00008441414,0.00006820431,0.9158484,0.0029634044,0.07749584,0.003180118,0.000013062085],"about_ca_topic_score_codex":0.0056639435,"about_ca_topic_score_gemma":0.010531282,"teacher_disagreement_score":0.0056639435,"about_ca_system_score_codex":0.00073878083,"about_ca_system_score_gemma":0.00097542984,"threshold_uncertainty_score":0.016369939},"labels":[],"label_agreement":null},{"id":"W2009936680","doi":"10.4153/cmb-2004-040-7","title":"Multiplicity of Resonances in Black Box Scattering","year":2004,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multiplicity (mathematics); Mathematics; Scaling; Scattering; Pure mathematics; Mathematical analysis; Geometry; Physics; Quantum mechanics","score_opus":0.011101667961684412,"score_gpt":0.21948102396503757,"score_spread":0.20837935600335317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009936680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33659717,0.0008498441,0.5991462,0.0018988715,0.0005662075,0.00008991632,0.00016228243,0.00082106737,0.059868436],"genre_scores_gemma":[0.95656365,0.00026690218,0.03707882,0.000216324,0.00025873858,0.00008450358,0.00004544415,0.00022796892,0.005257676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982686,0.00061655545,0.000097595854,0.0002599071,0.00054726424,0.00021002864],"domain_scores_gemma":[0.9927337,0.004504194,0.0007322908,0.00067487627,0.00073869684,0.0006161387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033546714,0.00091607973,0.0013832459,0.003624517,0.0017549729,0.0028627084,0.0014244261,0.0017276561,0.009071889],"category_scores_gemma":[0.015642628,0.00071183214,0.00070281577,0.0009894934,0.0037262146,0.0049558827,0.0024884155,0.0022878642,0.0009053257],"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.000065072076,0.000017736422,0.00041018124,0.000045024488,0.000006241521,0.00021428484,0.00017713814,0.004428637,0.002694661,0.9884455,0.0007239228,0.0027715198],"study_design_scores_gemma":[0.000017332963,0.000022692479,0.00023072187,0.000033994987,0.0000056596205,0.00019533944,0.00006182861,0.07091889,0.0014867558,0.9261831,0.0008162019,0.000027509115],"about_ca_topic_score_codex":0.00035005412,"about_ca_topic_score_gemma":0.00034803626,"teacher_disagreement_score":0.009071889,"about_ca_system_score_codex":0.0011098862,"about_ca_system_score_gemma":0.00047386583,"threshold_uncertainty_score":0.03034848},"labels":[],"label_agreement":null},{"id":"W2010972644","doi":"10.1002/nla.701","title":"A simultaneous decomposition of a matrix triplet with applications","year":2010,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Shanghai Municipal Education Commission; McGill University; Natural Science Foundation of Shanghai","keywords":"Hermitian matrix; Mathematics; Matrix (chemical analysis); Decomposition; Matrix function; Matrix decomposition; Pure mathematics; Applied mathematics; Algebra over a field; Symmetric matrix; Eigenvalues and eigenvectors; Physics; Quantum mechanics; Chemistry","score_opus":0.004614076783061271,"score_gpt":0.25739552059739856,"score_spread":0.2527814438143373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010972644","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13371232,0.00024006459,0.8166924,0.00041910715,0.00028022466,0.00013273605,0.000120241566,0.00051085395,0.047892105],"genre_scores_gemma":[0.72771865,0.00025464254,0.2492599,0.00032147145,0.0002718921,0.00012929903,0.0002191908,0.00031012224,0.021514941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986406,0.0003109114,0.0000846598,0.00026681938,0.0004787325,0.0002183],"domain_scores_gemma":[0.9987809,0.00019637968,0.00013069685,0.00022464147,0.00045776446,0.00020948553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010704936,0.000837773,0.00055122154,0.0013628892,0.001012032,0.0018326882,0.00073360925,0.0008400777,0.010523121],"category_scores_gemma":[0.0024938695,0.000426241,0.00081643777,0.0008321556,0.0016014032,0.002764714,0.0020846198,0.0017061206,0.0018839362],"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.000052424242,0.000060228285,0.00030071783,0.000069405425,0.000011658851,0.00027528207,0.00027190818,0.0064046066,0.017072454,0.9502063,0.0024179379,0.022857133],"study_design_scores_gemma":[0.000018476047,0.00016051342,0.00028229156,0.00002965009,0.00001327997,0.00042204442,0.00030587116,0.09938949,0.009347797,0.8799758,0.010012353,0.000042469324],"about_ca_topic_score_codex":0.00025599325,"about_ca_topic_score_gemma":0.0004638554,"teacher_disagreement_score":0.010523121,"about_ca_system_score_codex":0.00030574686,"about_ca_system_score_gemma":0.0006933444,"threshold_uncertainty_score":0.035203338},"labels":[],"label_agreement":null},{"id":"W2011997479","doi":"10.5539/jmr.v5n3p1","title":"A Method to Construct Sets of Commuting Matrices","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pairwise comparison; Construct (python library); Matrix (chemical analysis); Iterative method; Algebra over a field; Algorithm; Mathematical optimization; Applied mathematics; Pure mathematics; Computer science; Statistics","score_opus":0.09213041076259573,"score_gpt":0.4322183832169961,"score_spread":0.34008797245440037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011997479","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012988055,0.00005174718,0.99509215,0.000033901146,0.00005741848,0.00004989446,0.000044057793,0.0003024413,0.003069588],"genre_scores_gemma":[0.027362539,0.000105592786,0.9682804,0.00007503598,0.000048637554,0.00033007018,0.00018722973,0.00028002355,0.0033305814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978498,0.0006366453,0.00016643608,0.00037118339,0.00086026214,0.000115669594],"domain_scores_gemma":[0.99748373,0.0009642597,0.00013819741,0.0006114921,0.0006524395,0.0001498283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019002841,0.001203795,0.0010347314,0.0026977821,0.001845338,0.0017067597,0.0020700505,0.00089773186,0.013260392],"category_scores_gemma":[0.0052724187,0.0009653065,0.0018199595,0.0015853794,0.0018012715,0.0025595534,0.003506223,0.0027007216,0.0049256925],"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.000101465695,0.00010245137,0.0004923942,0.0003657996,0.000087742104,0.00019869582,0.0005574444,0.0159369,0.016890112,0.7657881,0.007958676,0.19152018],"study_design_scores_gemma":[0.000055064353,0.00018196357,0.00023299054,0.00012941561,0.00005655157,0.000677662,0.00013859133,0.1403019,0.019592665,0.7711535,0.06737115,0.00010846232],"about_ca_topic_score_codex":0.0004888216,"about_ca_topic_score_gemma":0.0006063871,"teacher_disagreement_score":0.013260392,"about_ca_system_score_codex":0.00052282,"about_ca_system_score_gemma":0.0010709771,"threshold_uncertainty_score":0.04436046},"labels":[],"label_agreement":null},{"id":"W2012349161","doi":"10.1137/090753589","title":"Algebraic Multigrid for Markov Chains","year":2010,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Multigrid method; Markov chain; Interpolation (computer graphics); Applied mathematics; Algebraic number; Multiplicative function; Operator (biology); Matrix (chemical analysis); Invertible matrix; Pure mathematics; Mathematical analysis; Partial differential equation; Computer science","score_opus":0.014250546547828192,"score_gpt":0.27216899358445795,"score_spread":0.25791844703662975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012349161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051536947,0.00014996025,0.9917755,0.00011055151,0.000035077872,0.000027200027,0.000032748285,0.00015809924,0.0025571357],"genre_scores_gemma":[0.29706025,0.00059533375,0.6949463,0.000106131374,0.00008494439,0.00027720255,0.00023224551,0.00026781717,0.0064297793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974173,0.00008915508,0.000011861875,0.000026288822,0.00010707857,0.000023893006],"domain_scores_gemma":[0.9994493,0.00024899727,0.00005893427,0.000096725365,0.00009408657,0.00005186755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005481518,0.00043221802,0.0005155745,0.0007477788,0.00058002345,0.00072397635,0.00068043405,0.0005559259,0.0027081617],"category_scores_gemma":[0.001844078,0.00024194777,0.00067433383,0.0005884024,0.00091711426,0.000660926,0.001482251,0.001253418,0.0005922938],"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.00003113574,0.000027593896,0.00045420098,0.00009870065,0.000022843355,0.00008767725,0.0000990983,0.49281037,0.003682872,0.4607034,0.0015199593,0.040462192],"study_design_scores_gemma":[0.0000046217224,0.0000055507603,0.000036484227,0.0000068938243,0.0000015180593,0.000012067418,0.000005907621,0.94544137,0.0004410234,0.051985707,0.0020548464,0.0000040336954],"about_ca_topic_score_codex":0.0022421489,"about_ca_topic_score_gemma":0.0025283163,"teacher_disagreement_score":0.0027081617,"about_ca_system_score_codex":0.00081713736,"about_ca_system_score_gemma":0.00086563453,"threshold_uncertainty_score":0.009059727},"labels":[],"label_agreement":null},{"id":"W2012743680","doi":"10.1007/s11228-005-0005-1","title":"Clarke Generalized Jacobian of the Projection onto the Cone of Positive Semidefinite Matrices","year":2006,"lang":"en","type":"article","venue":"Set-Valued Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":38,"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 Guelph","funders":"","keywords":"Jacobian matrix and determinant; Cone (formal languages); Differentiable function; Projection (relational algebra); Positive-definite matrix; Mathematics; Matrix (chemical analysis); Pure mathematics; Mathematical analysis; Applied mathematics; Physics; Eigenvalues and eigenvectors; Algorithm; Materials science","score_opus":0.00880545216618401,"score_gpt":0.23647368504024174,"score_spread":0.22766823287405774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012743680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07575148,0.00054975686,0.8879815,0.0007941278,0.00034444832,0.00006907458,0.00038062304,0.00023398381,0.03389509],"genre_scores_gemma":[0.85892224,0.0017220121,0.079778194,0.00050762185,0.0004915092,0.00012756752,0.0004934066,0.00033917127,0.057618346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994375,0.00017341475,0.000014833451,0.0001102859,0.0002132814,0.00005065346],"domain_scores_gemma":[0.9985708,0.00047744205,0.00016614591,0.00012209892,0.00045921982,0.00020418434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009122403,0.0009929262,0.0006156916,0.0011479208,0.00036903002,0.0024611086,0.0007346054,0.0005995816,0.008095151],"category_scores_gemma":[0.0032301699,0.00027480474,0.00045998636,0.0005665586,0.002032065,0.0017504136,0.0009837061,0.0017431629,0.00086888584],"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.000046123685,0.000029259621,0.00026436854,0.000091709095,0.000029185157,0.00011390341,0.00013903901,0.022273967,0.004228251,0.95362306,0.0038251216,0.015336079],"study_design_scores_gemma":[0.000022235283,0.00014291299,0.00097064115,0.000047532714,0.000018263714,0.00038047595,0.00017406073,0.27895823,0.0031490282,0.7071065,0.0089789545,0.00005117996],"about_ca_topic_score_codex":0.0016978735,"about_ca_topic_score_gemma":0.0013591613,"teacher_disagreement_score":0.008095151,"about_ca_system_score_codex":0.00086032995,"about_ca_system_score_gemma":0.001496585,"threshold_uncertainty_score":0.027080953},"labels":[],"label_agreement":null},{"id":"W2013095747","doi":"10.1002/nla.242","title":"A divide and conquer approach to computing the mean first passage matrix for Markov chains via Perron complement reductions","year":2001,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Markov chain; FLOPS; Block matrix; Partition (number theory); Matrix multiplication; Combinatorics; Ergodic theory; Complement (music); Matrix (chemical analysis); Divide and conquer algorithms; Diagonal; Discrete mathematics; Computation; Algorithm; Parallel computing; Computer science; Pure mathematics","score_opus":0.015150813886271673,"score_gpt":0.2651078357017424,"score_spread":0.24995702181547072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013095747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0224529,0.00010344739,0.974069,0.00017497658,0.000023581864,0.00004616656,0.000037389033,0.0006438886,0.0024487854],"genre_scores_gemma":[0.24304357,0.00009340774,0.75326014,0.0001104133,0.000051526833,0.00025433485,0.00013005018,0.00022390968,0.0028326737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911004,0.00036404308,0.000032226675,0.00011002561,0.000265698,0.00011786118],"domain_scores_gemma":[0.9973889,0.0018544229,0.00012776545,0.00026129652,0.0002707992,0.000096786825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017433761,0.00079835556,0.0011922517,0.0015828093,0.0011079478,0.0012322529,0.0013193947,0.0010069966,0.0051942696],"category_scores_gemma":[0.005735911,0.0005543877,0.0008631179,0.0011144414,0.0017477318,0.002269824,0.0014177752,0.0016930246,0.00089903345],"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.000522463,0.00020461594,0.0008262415,0.00017466121,0.00010065442,0.00018203614,0.00025675274,0.5494545,0.0066715847,0.24641144,0.003092748,0.19210225],"study_design_scores_gemma":[0.000026110643,0.000016640712,0.00004518447,0.0000051803436,0.0000055612286,0.000011682215,0.000012669465,0.93678635,0.001605578,0.060950696,0.00052735774,0.000007008857],"about_ca_topic_score_codex":0.0054566194,"about_ca_topic_score_gemma":0.00735388,"teacher_disagreement_score":0.0054566194,"about_ca_system_score_codex":0.0012975779,"about_ca_system_score_gemma":0.0016733356,"threshold_uncertainty_score":0.017376602},"labels":[],"label_agreement":null},{"id":"W2013694283","doi":"10.1016/j.laa.2004.02.029","title":"Maximizing traces of matrix functions","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Hermitian matrix; Combinatorics; Eigenvalues and eigenvectors; Conjecture; Positive-definite matrix; Matrix (chemical analysis); Pure mathematics; Physics","score_opus":0.011236860924304728,"score_gpt":0.25143561058248404,"score_spread":0.2401987496581793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013694283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20158088,0.0007063888,0.75677615,0.0014639145,0.00016702755,0.00006057488,0.0001642169,0.000700277,0.03838056],"genre_scores_gemma":[0.90326726,0.00091579073,0.064916946,0.00029813856,0.00033458084,0.00011714823,0.0002573355,0.0006419436,0.029250907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984242,0.00073524483,0.000060471255,0.00021587522,0.0003638492,0.00020045992],"domain_scores_gemma":[0.9936433,0.0034820596,0.00047635275,0.0007596221,0.0008019483,0.0008366827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026537825,0.0014393452,0.0014438714,0.0015233677,0.0010424188,0.0035141858,0.002215053,0.001830236,0.0056344285],"category_scores_gemma":[0.017435508,0.0007964521,0.0007155553,0.0015573567,0.003248913,0.006599387,0.00297308,0.0022361279,0.0009996702],"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.00004768982,0.000032586144,0.00019192,0.00004270137,0.000011324711,0.000039908744,0.000111058456,0.00879649,0.0012381966,0.9790862,0.0010652897,0.009336653],"study_design_scores_gemma":[0.0000072386188,0.00002030578,0.00007423418,0.000009016516,0.000004593588,0.00004412913,0.00003083767,0.05763099,0.0008842909,0.9406077,0.00067771686,0.000008841124],"about_ca_topic_score_codex":0.0008413474,"about_ca_topic_score_gemma":0.0008455617,"teacher_disagreement_score":0.0056344285,"about_ca_system_score_codex":0.0012850246,"about_ca_system_score_gemma":0.0011957006,"threshold_uncertainty_score":0.018849015},"labels":[],"label_agreement":null},{"id":"W2013949264","doi":"10.1016/j.laa.2007.12.023","title":"Model-updating for self-adjoint quadratic eigenvalue problems","year":2008,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Division of Mathematical Sciences; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Hermitian matrix; Eigenvalues and eigenvectors; Mathematics; Quadratic equation; Self-adjoint operator; Matrix (chemical analysis); Pure mathematics; Symmetric matrix; Symmetry (geometry); Degree (music); Combinatorics; Geometry; Physics; Quantum mechanics","score_opus":0.0286201475597143,"score_gpt":0.2541594058590431,"score_spread":0.2255392582993288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013949264","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019228734,0.00016590676,0.97458583,0.00048692073,0.00015820458,0.00003332717,0.000036879683,0.00021332956,0.005090994],"genre_scores_gemma":[0.73368615,0.00039130534,0.24742885,0.000470703,0.00022001922,0.00026116794,0.00021056963,0.0004583531,0.016872851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999532,0.00022321029,0.000019249352,0.000061705876,0.0001291779,0.000034703764],"domain_scores_gemma":[0.99825746,0.00095051876,0.00016249398,0.00021254722,0.00029682077,0.00012024917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012926944,0.00072481233,0.0011219992,0.00049879873,0.0006383893,0.0014016811,0.0018447434,0.0014443755,0.0042151674],"category_scores_gemma":[0.0072616986,0.0006351873,0.00056980195,0.00056804233,0.0013253095,0.0026012743,0.002223644,0.0017700951,0.0005468623],"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.00010956649,0.00019533774,0.0005845277,0.00020460133,0.00007814615,0.00009014027,0.00020404754,0.63264185,0.0027416165,0.2993591,0.0047232485,0.059067726],"study_design_scores_gemma":[0.000011199013,0.000011407963,0.000032964108,0.00000394184,0.0000035451924,0.000010155563,0.0000094786,0.93429637,0.00023725876,0.064900935,0.00047634295,0.0000062989525],"about_ca_topic_score_codex":0.0027843534,"about_ca_topic_score_gemma":0.0038595723,"teacher_disagreement_score":0.0042151674,"about_ca_system_score_codex":0.0006274188,"about_ca_system_score_gemma":0.0009435775,"threshold_uncertainty_score":0.014101207},"labels":[],"label_agreement":null},{"id":"W2014521517","doi":"10.1016/j.laa.2005.12.007","title":"Some results on structured M-matrices with an application to wireless communications","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Wireless; Algebra over a field; Telecommunications; Computer science; Pure mathematics","score_opus":0.009574350693832447,"score_gpt":0.25281241997590265,"score_spread":0.2432380692820702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014521517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01793082,0.008710896,0.9050875,0.0027725995,0.0012964406,0.00006041418,0.00039300616,0.00022095026,0.06352742],"genre_scores_gemma":[0.5490889,0.031282127,0.32923454,0.005922956,0.010280037,0.00037486767,0.0012734667,0.0004983965,0.07204477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999345,0.00022350952,0.000042623218,0.00010935681,0.00021716965,0.000062276486],"domain_scores_gemma":[0.9969632,0.0017244986,0.00033985346,0.0003173525,0.0004813916,0.00017362405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001007717,0.0016652491,0.0008803609,0.0020698514,0.00095472083,0.0016747931,0.0010559673,0.0012043271,0.008092356],"category_scores_gemma":[0.0053811087,0.0005369372,0.001154599,0.004191288,0.0020055491,0.0032306798,0.001573447,0.0028448475,0.0022862223],"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.000067216046,0.00007069155,0.0002697176,0.00046044748,0.000043471133,0.0003523673,0.00029482527,0.017588412,0.0037105926,0.91936743,0.0120962355,0.04567858],"study_design_scores_gemma":[0.000012781498,0.00007241052,0.00020734363,0.000058861202,0.000024619036,0.00032870492,0.00008250463,0.03333046,0.0010505575,0.950934,0.013873187,0.00002453433],"about_ca_topic_score_codex":0.00057897484,"about_ca_topic_score_gemma":0.00076684245,"teacher_disagreement_score":0.008092356,"about_ca_system_score_codex":0.0005992671,"about_ca_system_score_gemma":0.0005149615,"threshold_uncertainty_score":0.027071595},"labels":[],"label_agreement":null},{"id":"W2015094733","doi":"10.1016/j.laa.2014.12.025","title":"Bounds on polygons of higher rank numerical ranges","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; York University; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Numerical range; Mathematics; Rank (graph theory); Range (aeronautics); Unitary state; Numerical analysis; Operator (biology); Polygon (computer graphics); Upper and lower bounds; Combinatorics; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.021854019182954487,"score_gpt":0.2746880668812006,"score_spread":0.25283404769824613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015094733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15776719,0.0040708054,0.68541527,0.0031474659,0.00043145168,0.0001436691,0.0013236839,0.0011205561,0.14657995],"genre_scores_gemma":[0.8167881,0.003513303,0.13813648,0.00077904377,0.00086395594,0.00029583042,0.001411036,0.0009376633,0.03727457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962431,0.0008553066,0.00020176276,0.00060363417,0.0014869246,0.0006092606],"domain_scores_gemma":[0.9783473,0.01488456,0.001953425,0.002062015,0.0014678182,0.0012849371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002188086,0.0017996586,0.0017675253,0.0043668062,0.0019019427,0.0076312926,0.003114329,0.0013773475,0.017116327],"category_scores_gemma":[0.024039015,0.0012787465,0.0011716338,0.0047229193,0.005682304,0.011943495,0.0065954183,0.0060745333,0.0023923102],"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.0001490795,0.000044113265,0.0006817046,0.00016564554,0.0000185541,0.00014731077,0.0003232862,0.015567787,0.0010419398,0.9581675,0.003692041,0.020001052],"study_design_scores_gemma":[0.00001994689,0.00004966379,0.00035783416,0.0000862859,0.000029518893,0.00028068834,0.00021551499,0.046379007,0.0016733716,0.94226104,0.008614342,0.000032816624],"about_ca_topic_score_codex":0.0013892693,"about_ca_topic_score_gemma":0.0014988162,"teacher_disagreement_score":0.017116327,"about_ca_system_score_codex":0.0017350162,"about_ca_system_score_gemma":0.00068877515,"threshold_uncertainty_score":0.057259858},"labels":[],"label_agreement":null},{"id":"W2015202125","doi":"10.1016/j.laa.2009.06.040","title":"Sparse inertially arbitrary patterns","year":2009,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"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 Waterloo; Redeemer University; University of Regina","funders":"","keywords":"Mathematics; Sign (mathematics); Combinatorics; Matrix (chemical analysis); Set (abstract data type); Inertia; Polynomial; Mathematical analysis; Physics; Computer science","score_opus":0.011264685267572358,"score_gpt":0.241484534523976,"score_spread":0.23021984925640365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015202125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2702093,0.0005227132,0.56461054,0.0020568809,0.0011995975,0.00013851127,0.0012951064,0.0015198726,0.15844744],"genre_scores_gemma":[0.8463045,0.00040750965,0.08131952,0.0011112303,0.00081312726,0.00019083005,0.0018750022,0.00069268176,0.067285575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994307,0.00009385182,0.000030698768,0.00015264397,0.00016503017,0.0001270204],"domain_scores_gemma":[0.99894613,0.00018806075,0.00013803292,0.0004099605,0.00019067973,0.00012717315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033647145,0.00056836894,0.000793925,0.0009843197,0.001208213,0.0015962906,0.00093297724,0.0010271128,0.023400636],"category_scores_gemma":[0.0032104573,0.00043138512,0.00046177264,0.0011962634,0.0015420633,0.0035860264,0.0023020862,0.0015386496,0.003725873],"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.00019028639,0.000072930765,0.00095460436,0.00007729662,0.00001603351,0.00028811165,0.00023154305,0.0037396038,0.0074435226,0.9261649,0.010414293,0.050406683],"study_design_scores_gemma":[0.000024572366,0.00005910078,0.00077280606,0.000018612976,0.000010620213,0.0004554621,0.00018223342,0.02895755,0.0035358048,0.9515783,0.014375241,0.000029642133],"about_ca_topic_score_codex":0.00032497666,"about_ca_topic_score_gemma":0.0005901606,"teacher_disagreement_score":0.023400636,"about_ca_system_score_codex":0.00025798404,"about_ca_system_score_gemma":0.00041337148,"threshold_uncertainty_score":0.07828289},"labels":[],"label_agreement":null},{"id":"W2015224767","doi":"10.1137/s0895479802402818","title":"Optimization and Pseudospectra, with Applications to Robust Stability","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Lipschitz continuity; Mathematical analysis; Matrix (chemical analysis); Condition number; Applied mathematics; Complex plane","score_opus":0.01048618722052016,"score_gpt":0.2502751010984845,"score_spread":0.23978891387796433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015224767","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056097857,0.00500494,0.97623867,0.0010343571,0.00016590451,0.00003061307,0.000046150624,0.00014049176,0.011729031],"genre_scores_gemma":[0.5219045,0.020302858,0.41862622,0.001114612,0.0021029147,0.0006188475,0.00029188383,0.0008756644,0.034162506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886274,0.00050706306,0.000068108384,0.00019608883,0.0003200847,0.000045942747],"domain_scores_gemma":[0.99657696,0.0023505366,0.0003983685,0.00017957312,0.0003976232,0.000096938325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021482029,0.0019126456,0.0009729183,0.0018439972,0.00061881775,0.0017424579,0.000936488,0.0017619686,0.0037979109],"category_scores_gemma":[0.0063177855,0.00065178453,0.0012942706,0.0020181513,0.0031040777,0.0022955844,0.002856746,0.0028190985,0.0007027843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000416513,0.000041053845,0.0005089598,0.00026440853,0.00007100047,0.00015648782,0.00022088955,0.30399072,0.0040110773,0.6370138,0.002760601,0.050919343],"study_design_scores_gemma":[0.0000068040677,0.00003632806,0.00018051817,0.000042961758,0.000010908389,0.00007396082,0.00003293775,0.69328076,0.0007550813,0.29998192,0.005573746,0.000024039058],"about_ca_topic_score_codex":0.0017660427,"about_ca_topic_score_gemma":0.0012852736,"teacher_disagreement_score":0.0037979109,"about_ca_system_score_codex":0.0013974673,"about_ca_system_score_gemma":0.0008182801,"threshold_uncertainty_score":0.012705326},"labels":[],"label_agreement":null},{"id":"W2016648952","doi":"10.4153/cmb-2011-196-0","title":"Universally Overconvergent Power Series via the Riemann Zeta-function","year":2011,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Riemann hypothesis; Riemann zeta function; Power series; Series (stratigraphy); Riemann Xi function; Pure mathematics; Function (biology); Particular values of Riemann zeta function; Arithmetic zeta function; Mathematical analysis; Prime zeta function","score_opus":0.01153514035628765,"score_gpt":0.17487200556579063,"score_spread":0.163336865209503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016648952","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63700527,0.0014452758,0.25396803,0.0009360896,0.00065070763,0.000062929204,0.0001742516,0.0008516543,0.104905866],"genre_scores_gemma":[0.97720236,0.0003873714,0.011313243,0.0001507624,0.00025221624,0.000024303987,0.000062387604,0.00012631495,0.0104811005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993056,0.00013206087,0.00003478138,0.00014755248,0.00028384526,0.00009609016],"domain_scores_gemma":[0.99852043,0.0005405463,0.00015481675,0.00028397056,0.0002147633,0.00028548084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012017722,0.0007524187,0.0005928772,0.0020077599,0.0010619143,0.0027984774,0.0006983734,0.00043699247,0.0051435623],"category_scores_gemma":[0.004567844,0.0002808609,0.00052920677,0.0010834298,0.0026369144,0.0033235208,0.0030250251,0.0018953372,0.0009711846],"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.000034099372,0.000029571598,0.0006632723,0.000027411432,0.0000068661047,0.00043238618,0.00040081827,0.0014981936,0.0025410517,0.97963434,0.00071481563,0.01401705],"study_design_scores_gemma":[0.000024340488,0.00006250251,0.0005159273,0.000030141227,0.000015322716,0.00063134846,0.000117079166,0.009232478,0.003798167,0.97977567,0.005779697,0.000017347682],"about_ca_topic_score_codex":0.00019648422,"about_ca_topic_score_gemma":0.0001905092,"teacher_disagreement_score":0.0051435623,"about_ca_system_score_codex":0.0010348062,"about_ca_system_score_gemma":0.00035313514,"threshold_uncertainty_score":0.017206907},"labels":[],"label_agreement":null},{"id":"W2017033823","doi":"10.1016/j.laa.2006.07.010","title":"Inertially arbitrary sign patterns with no nilpotent realization","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Sign (mathematics); Eigenvalues and eigenvectors; Realization (probability); Monic polynomial; Nilpotent; Polynomial; Combinatorics; Order (exchange); Matrix (chemical analysis); Diagonalizable matrix; Pure mathematics; Characteristic polynomial; Mathematical analysis; Discrete mathematics; Symmetric matrix; Physics","score_opus":0.005518443168721963,"score_gpt":0.20410386408060635,"score_spread":0.19858542091188439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017033823","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5339111,0.00030944723,0.24662937,0.002186497,0.0018313032,0.00013829961,0.0005238237,0.0014333018,0.21303678],"genre_scores_gemma":[0.9264646,0.00018527619,0.02931952,0.000813495,0.00037053486,0.00013585677,0.00047398053,0.000568364,0.041668355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916255,0.00015459562,0.000052414478,0.00017472426,0.0002233494,0.0002323707],"domain_scores_gemma":[0.99916065,0.0001374577,0.00011246726,0.00028529088,0.00014033973,0.00016391801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000547123,0.00070617173,0.00092838885,0.0010270497,0.0020377657,0.002888305,0.0011705279,0.0015555655,0.015712127],"category_scores_gemma":[0.0025295997,0.0005866586,0.00065357663,0.00083546195,0.003319628,0.005249436,0.002859914,0.0021929657,0.0042435816],"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.00009865166,0.000040396426,0.00023313388,0.000024980349,0.0000056362387,0.00015300071,0.00014330412,0.0003408041,0.0034386266,0.9850493,0.0026761936,0.0077959895],"study_design_scores_gemma":[0.000025167403,0.000027777685,0.000120407065,0.000007784952,0.000005241724,0.00016079305,0.000104763225,0.002363419,0.002226883,0.99152476,0.003415694,0.000017416582],"about_ca_topic_score_codex":0.00017333296,"about_ca_topic_score_gemma":0.00029891447,"teacher_disagreement_score":0.015712127,"about_ca_system_score_codex":0.00034802052,"about_ca_system_score_gemma":0.00063419074,"threshold_uncertainty_score":0.052562237},"labels":[],"label_agreement":null},{"id":"W2017636104","doi":"10.1016/j.cam.2005.05.012","title":"Efficient methods for solving a nonsymmetric algebraic Riccati equation arising in stochastic fluid models","year":2005,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Riccati equation; Algebraic Riccati equation; Algebraic number; Matrix (chemical analysis); Markov chain; Applied mathematics; Algebraic equation; Generator (circuit theory); Singular point of an algebraic variety; Pure mathematics; Algebra over a field; Mathematical analysis; Differential equation","score_opus":0.03444736644660301,"score_gpt":0.3107589746164391,"score_spread":0.2763116081698361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017636104","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011531005,0.00028169353,0.9849401,0.00023425372,0.00010481942,0.000046541598,0.000046335397,0.00012943457,0.0026857168],"genre_scores_gemma":[0.32372877,0.0006483315,0.66316,0.00022253486,0.00027852843,0.0003605541,0.00021804772,0.0003596386,0.011023586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995591,0.00016721273,0.00002725625,0.000042319265,0.0001639615,0.000040159845],"domain_scores_gemma":[0.9979938,0.0013055763,0.00015729539,0.00014786076,0.00029862317,0.000096820404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013202525,0.0009226055,0.001232793,0.00077137374,0.000809938,0.0010344199,0.0017606032,0.0017984753,0.0031476049],"category_scores_gemma":[0.004096276,0.00069377734,0.00080879463,0.00089852046,0.0013869262,0.0013646543,0.0019972934,0.0019380961,0.00066852866],"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.00012847155,0.00014853668,0.0005412152,0.0002237957,0.0000796099,0.0001565012,0.0001714357,0.76645803,0.005593959,0.16683413,0.0027041154,0.056960177],"study_design_scores_gemma":[0.000010686724,0.000007889401,0.000025711972,0.0000029335006,0.0000033518472,0.00000793714,0.000007102218,0.98954284,0.00017972845,0.009796612,0.000411246,0.0000039131864],"about_ca_topic_score_codex":0.0048703975,"about_ca_topic_score_gemma":0.0072715394,"teacher_disagreement_score":0.0048703975,"about_ca_system_score_codex":0.0006067557,"about_ca_system_score_gemma":0.0013644645,"threshold_uncertainty_score":0.010529757},"labels":[],"label_agreement":null},{"id":"W2017662701","doi":"10.1080/00207160212122","title":"An Efficient Method for Second Order Boundary Value Problems with Two Point Boundary Conditions","year":2002,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","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":"University of New Brunswick","funders":"","keywords":"Mathematics; Boundary value problem; Mathematical analysis; Perturbation (astronomy); Applied mathematics; Singular boundary method; Order (exchange); Coefficient matrix; Mixed boundary condition; Finite element method; Boundary element method; Eigenvalues and eigenvectors","score_opus":0.01637678035827442,"score_gpt":0.29985460053932184,"score_spread":0.2834778201810474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017662701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015785526,0.00017464189,0.99617153,0.000110861336,0.00009976136,0.000046003996,0.000024028433,0.00013114835,0.0016635546],"genre_scores_gemma":[0.06544145,0.00041119306,0.9205056,0.00017295299,0.00011268699,0.00041300445,0.00013265078,0.00034529588,0.012465115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946624,0.00014500543,0.00002013778,0.000036895173,0.00029410166,0.00003771235],"domain_scores_gemma":[0.99945825,0.00021753837,0.000038674574,0.00009722768,0.00014494537,0.000043263513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008345764,0.0005897872,0.00086998724,0.0007654571,0.00065073586,0.0007508529,0.0014387887,0.0015440233,0.0044330875],"category_scores_gemma":[0.0018397559,0.0005314018,0.00070643116,0.0006451123,0.0009348094,0.001193883,0.0015122233,0.0017976767,0.0016253045],"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.000121817946,0.00016962289,0.0004026083,0.0005988235,0.00009375053,0.00039904416,0.00029813583,0.24623857,0.04263393,0.491344,0.009888477,0.20781116],"study_design_scores_gemma":[0.000047273086,0.00003821025,0.00013421269,0.000038988044,0.000015170693,0.00015738427,0.000017135388,0.9172514,0.0042446144,0.057351217,0.020674529,0.000029891402],"about_ca_topic_score_codex":0.0011287503,"about_ca_topic_score_gemma":0.0013593743,"teacher_disagreement_score":0.0044330875,"about_ca_system_score_codex":0.00042171477,"about_ca_system_score_gemma":0.001005607,"threshold_uncertainty_score":0.014830172},"labels":[],"label_agreement":null},{"id":"W2017901464","doi":"10.1016/j.laa.2006.07.013","title":"Zero-preserving iso-spectral flows based on parallel sums","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"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":"Fields Institute for Research in Mathematical Sciences","keywords":"Mathematics; Inner product space; Conjecture; Zero (linguistics); Projection (relational algebra); Product (mathematics); Space (punctuation); Flow (mathematics); Intersection (aeronautics); Pure mathematics; Product topology; Diagonal; Mathematical analysis; Geometry; Algorithm","score_opus":0.009851322056591229,"score_gpt":0.23348444873363577,"score_spread":0.22363312667704455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017901464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21756035,0.0005613714,0.68370855,0.00073460484,0.00071205874,0.000111005196,0.00014196156,0.0010653373,0.095404774],"genre_scores_gemma":[0.8804648,0.00066381367,0.08434448,0.00036032454,0.0005021684,0.00012494487,0.00014907964,0.0006192317,0.032771204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995229,0.000109709006,0.000023997512,0.00009643396,0.00015637753,0.00009061111],"domain_scores_gemma":[0.9990613,0.00029865222,0.000093667826,0.00022322008,0.00015409084,0.0001691366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007153541,0.00077870354,0.00082879397,0.0016599409,0.0015766466,0.0021880744,0.0010861802,0.0007085807,0.0073455693],"category_scores_gemma":[0.002761982,0.00039927397,0.0008042304,0.0009481555,0.0022538225,0.004142351,0.0025943704,0.0020722216,0.001105731],"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.000049318416,0.000037380254,0.00006850868,0.000027696115,0.0000068335917,0.000038774902,0.00007588797,0.0026094841,0.0018099819,0.9852615,0.0006535997,0.0093610305],"study_design_scores_gemma":[0.000010063896,0.000015045252,0.000047044025,0.0000060883235,0.000006688788,0.00005808148,0.000028374436,0.015996309,0.0016576545,0.980827,0.0013371583,0.000010405444],"about_ca_topic_score_codex":0.00028016797,"about_ca_topic_score_gemma":0.00034589894,"teacher_disagreement_score":0.0073455693,"about_ca_system_score_codex":0.0005286116,"about_ca_system_score_gemma":0.0005059854,"threshold_uncertainty_score":0.024573326},"labels":[],"label_agreement":null},{"id":"W2017990365","doi":"10.1080/02331880903189109","title":"On additive and block decompositions of WLSEs under a multiple partitioned regression model","year":2009,"lang":"en","type":"article","venue":"Statistics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Orthogonality; Estimator; Design matrix; Linear model; Linear regression; Applied mathematics; Matrix (chemical analysis); Block (permutation group theory); Least-squares function approximation; Linear least squares; Generalized least squares; Statistics; Combinatorics","score_opus":0.014633271170064695,"score_gpt":0.27532916406517266,"score_spread":0.260695892895108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017990365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002282532,0.0001088284,0.9970499,0.00005037228,0.000012107923,0.000015623618,0.000026582806,0.00003372813,0.00042020218],"genre_scores_gemma":[0.17180713,0.0017849427,0.81991726,0.00032653497,0.00026163037,0.0004892765,0.0006510095,0.00024887992,0.0045132334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99339664,0.0035999718,0.00035949965,0.0011391318,0.0011620882,0.00034257898],"domain_scores_gemma":[0.97833943,0.014754306,0.0018860402,0.0023279216,0.0023142828,0.00037801647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012349668,0.0015636032,0.001372804,0.0017564294,0.0003967463,0.0015180968,0.0016601922,0.0011638752,0.004441273],"category_scores_gemma":[0.040169273,0.0010691595,0.0018862168,0.001990293,0.0024850115,0.0052185883,0.0028928926,0.0029395043,0.0012585788],"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.000105561776,0.00006788608,0.0016594194,0.0002882536,0.00020784693,0.0001881006,0.000393323,0.11034991,0.0045571453,0.7968694,0.001975202,0.08333803],"study_design_scores_gemma":[0.000020907912,0.0000890239,0.0009896772,0.00006477238,0.00006484259,0.00012156362,0.000076640266,0.6168436,0.0013368003,0.37783328,0.0025102252,0.000048685986],"about_ca_topic_score_codex":0.0015193492,"about_ca_topic_score_gemma":0.0013585693,"teacher_disagreement_score":0.012349668,"about_ca_system_score_codex":0.0006345442,"about_ca_system_score_gemma":0.00093207724,"threshold_uncertainty_score":0.06531203},"labels":[],"label_agreement":null},{"id":"W2018627399","doi":"10.1093/imanum/drt025","title":"GMRES convergence bounds that depend on the right-hand-side vector","year":2013,"lang":"en","type":"article","venue":"IMA Journal of Numerical Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":16,"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":"Generalized minimal residual method; Mathematics; Eigenvalues and eigenvectors; Invertible matrix; Diagonalizable matrix; Applied mathematics; Residual; Convergence (economics); Rank (graph theory); Solver; Krylov subspace; Linear system; Combinatorics; Mathematical analysis; Mathematical optimization; Pure mathematics; Algorithm; Symmetric matrix","score_opus":0.01283529324500673,"score_gpt":0.2388455058763808,"score_spread":0.22601021263137405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018627399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012197584,0.002259217,0.97168094,0.00090399745,0.00029093918,0.000053469794,0.000119244396,0.00076713396,0.011727501],"genre_scores_gemma":[0.4310764,0.00332791,0.55035776,0.0008833095,0.0005117161,0.00040583865,0.00065644906,0.0022661397,0.01051444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971301,0.0011150602,0.0001467237,0.00029023268,0.0011014325,0.0002165875],"domain_scores_gemma":[0.9796015,0.013442212,0.0012337919,0.0015844953,0.0038522242,0.00028570747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009547222,0.0028557668,0.0011684374,0.0015138368,0.00068036723,0.0013775902,0.0013538458,0.0016541177,0.0036704927],"category_scores_gemma":[0.036733087,0.0004152192,0.0009179194,0.00074250926,0.0030007605,0.0029704422,0.0025411777,0.0030768907,0.0017764618],"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.0005393807,0.00008920646,0.001862916,0.00084625685,0.00011841482,0.00032476077,0.0003296429,0.67379564,0.022485495,0.20966578,0.0071301777,0.082812294],"study_design_scores_gemma":[0.0000074764666,0.00005643003,0.0002138427,0.00011446306,0.000015031793,0.00007013253,0.00003507886,0.9640449,0.008178991,0.02390343,0.0033301692,0.00003008144],"about_ca_topic_score_codex":0.0024197635,"about_ca_topic_score_gemma":0.0021756939,"teacher_disagreement_score":0.009547222,"about_ca_system_score_codex":0.0012009478,"about_ca_system_score_gemma":0.0010700698,"threshold_uncertainty_score":0.050491095},"labels":[],"label_agreement":null},{"id":"W2019305290","doi":"10.1016/j.laa.2012.10.033","title":"Positive matrices partitioned into a small number of Hermitian blocks","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Hermitian matrix; Lemma (botany); Mathematical proof; Positive-definite matrix; Combinatorics; Eigenvalues and eigenvectors; Diagonal; Simple (philosophy); Matrix (chemical analysis); Eigendecomposition of a matrix; Block matrix; Diagonal matrix; Pure mathematics; Discrete mathematics","score_opus":0.010612094579670413,"score_gpt":0.2594004071428742,"score_spread":0.2487883125632038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019305290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088048205,0.00047943412,0.896917,0.0004064377,0.0003595096,0.00017312233,0.0004358064,0.0005579516,0.012622551],"genre_scores_gemma":[0.68141216,0.0006021293,0.29016328,0.0005967204,0.0004979228,0.00040792493,0.00079900585,0.00034432884,0.025176568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992805,0.00024349634,0.000045950477,0.00015607175,0.00018890842,0.00008497945],"domain_scores_gemma":[0.998317,0.0006284307,0.00016838027,0.00045390197,0.00032177416,0.0001105504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004481272,0.0008496766,0.00076370337,0.0004389809,0.00047861034,0.00094912574,0.00071079767,0.00062021037,0.010921324],"category_scores_gemma":[0.0032237004,0.0004048609,0.00030189502,0.0006838105,0.00080158346,0.0017990121,0.00077495846,0.0010530816,0.0035612248],"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.0017474575,0.00043199328,0.002165142,0.0004935647,0.00013402381,0.00068576814,0.00039896913,0.055720016,0.33866978,0.3866175,0.013313633,0.19962221],"study_design_scores_gemma":[0.0003929458,0.00088718144,0.004698775,0.00007402015,0.00010418027,0.0012135246,0.00038142482,0.42562264,0.11928808,0.40815693,0.039067328,0.00011296136],"about_ca_topic_score_codex":0.00020318582,"about_ca_topic_score_gemma":0.0003773455,"teacher_disagreement_score":0.010921324,"about_ca_system_score_codex":0.00020814867,"about_ca_system_score_gemma":0.0004388581,"threshold_uncertainty_score":0.0365355},"labels":[],"label_agreement":null},{"id":"W2019991101","doi":"10.1016/j.camwa.2015.01.012","title":"On the inverse and determinant of general bordered tridiagonal matrices","year":2015,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":36,"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 Regina","funders":"","keywords":"Tridiagonal matrix; Mathematics; Tridiagonal matrix algorithm; Inverse; Algebra over a field; Matrix (chemical analysis); Symbolic computation; Applied mathematics; Order (exchange); Current (fluid); Inverse problem; Crank–Nicolson method; Algorithm; Pure mathematics; Numerical analysis; Mathematical analysis; Geometry; Eigenvalues and eigenvectors","score_opus":0.02069757536200332,"score_gpt":0.24790077439733033,"score_spread":0.227203199035327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019991101","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23031868,0.0036857491,0.6897234,0.0016913554,0.0008747477,0.00004542661,0.00022722533,0.0002465654,0.073186874],"genre_scores_gemma":[0.9192403,0.0022653074,0.058419257,0.0004297513,0.00056219765,0.000033860775,0.00025078136,0.00019771274,0.018600835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941015,0.00021041124,0.000024598381,0.0001009593,0.0001823907,0.00007149215],"domain_scores_gemma":[0.9968785,0.0019104548,0.00020523532,0.00029683564,0.0005194863,0.00018951915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010761623,0.0006375363,0.0005811639,0.001062605,0.0005374741,0.0017336608,0.00080896536,0.0008146095,0.005531725],"category_scores_gemma":[0.008147284,0.000307315,0.00041345166,0.0009271257,0.0033492057,0.0025468692,0.0013974733,0.0016653539,0.0007687682],"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.000099447534,0.000053201802,0.000631146,0.00009149574,0.00001534284,0.0002586562,0.00034410798,0.02240581,0.0028426338,0.950794,0.003829533,0.018634727],"study_design_scores_gemma":[0.000013082571,0.000035283487,0.00041237375,0.00003498588,0.000007029427,0.00020573736,0.000119102784,0.11118556,0.001079108,0.88294536,0.0039354498,0.000026982958],"about_ca_topic_score_codex":0.0013537755,"about_ca_topic_score_gemma":0.0017199806,"teacher_disagreement_score":0.005531725,"about_ca_system_score_codex":0.00048599986,"about_ca_system_score_gemma":0.00049161055,"threshold_uncertainty_score":0.018505454},"labels":[],"label_agreement":null},{"id":"W2020441104","doi":"10.1016/s0024-3795(01)00403-7","title":"Two theorems on Euclidean distance matrices and Gale transform","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":21,"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 Waterloo","funders":"","keywords":"Mathematics; Euclidean distance; Combinatorics; Scalar (mathematics); Euclidean distance matrix; Euclidean geometry; Characterization (materials science); Matrix (chemical analysis); Regular polygon; Cone (formal languages); Distance matrix; Euclidean space; Geometry; Algorithm; Physics","score_opus":0.011569153403153332,"score_gpt":0.2396804063629135,"score_spread":0.22811125295976015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020441104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020575725,0.0043148627,0.91293836,0.0062184734,0.0016299572,0.000057459314,0.00042937693,0.00028718504,0.053548686],"genre_scores_gemma":[0.58118725,0.010191693,0.30773655,0.008276085,0.006148872,0.00058551924,0.0012675623,0.0008495658,0.08375698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982999,0.00045744498,0.00010064941,0.00042145923,0.00051981985,0.00020071023],"domain_scores_gemma":[0.99504554,0.0030990604,0.0003814504,0.0005172603,0.0006346376,0.0003220204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024266164,0.001365816,0.0013673753,0.0040176576,0.0016227012,0.003745513,0.0020894294,0.002233815,0.008129832],"category_scores_gemma":[0.012049986,0.0007621087,0.0014208549,0.0036537414,0.0056675402,0.0111266235,0.0048642843,0.006060494,0.0023260775],"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.000022178629,0.000013477623,0.00007864551,0.00004029212,0.0000067368546,0.000039446986,0.00013605272,0.00054480805,0.00030080933,0.983781,0.002665388,0.012371179],"study_design_scores_gemma":[0.000009867021,0.000015278669,0.00012412287,0.00001553642,0.000007373485,0.00016677695,0.000049560233,0.0030337286,0.00046192307,0.9884244,0.007674385,0.000017030905],"about_ca_topic_score_codex":0.00072362414,"about_ca_topic_score_gemma":0.00047683192,"teacher_disagreement_score":0.008129832,"about_ca_system_score_codex":0.0011370318,"about_ca_system_score_gemma":0.0006258615,"threshold_uncertainty_score":0.027197003},"labels":[],"label_agreement":null},{"id":"W2020488675","doi":"10.1145/365723.365728","title":"An observation on bisection software for the symmetric tridiagonal eigenvalue problem","year":2000,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Tridiagonal matrix; Bisection; Eigenvalues and eigenvectors; Bisection method; Mathematics; Computation; Tridiagonal matrix algorithm; Matrix (chemical analysis); Symmetric matrix; Applied mathematics; Yield (engineering); Reduction (mathematics); Minor (academic); Algebra over a field; Algorithm; Pure mathematics; Geometry; Physics","score_opus":0.033292121472528004,"score_gpt":0.27468549541163056,"score_spread":0.24139337393910257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020488675","genre_codex":"methods","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03513697,0.0019011956,0.9348037,0.0027022946,0.00046871768,0.00015260256,0.00015454399,0.0042596175,0.020420276],"genre_scores_gemma":[0.27433527,0.0025289562,0.6931056,0.003284437,0.00070924906,0.0008346693,0.00066888327,0.006166092,0.018366909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99524057,0.0013203667,0.00024355979,0.0008294493,0.0019517171,0.00041436448],"domain_scores_gemma":[0.98808646,0.0060178256,0.00051838096,0.0036261857,0.0015306721,0.00022044442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002486033,0.0015920239,0.0009579048,0.001027618,0.0016359198,0.0018814837,0.002740112,0.0019429049,0.007688004],"category_scores_gemma":[0.01932452,0.0014281715,0.0017009508,0.002128108,0.0034834824,0.008582418,0.003993412,0.006552357,0.0037174835],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013628581,0.0006679409,0.003706781,0.0010544038,0.00017515062,0.00043390854,0.0014904971,0.055229407,0.05234618,0.5292273,0.032479484,0.32182607],"study_design_scores_gemma":[0.00045860055,0.0006672656,0.0035476252,0.00036973396,0.000116290474,0.00091385405,0.00032363547,0.30368528,0.084760755,0.4931964,0.111624196,0.00033642031],"about_ca_topic_score_codex":0.0027519988,"about_ca_topic_score_gemma":0.0018232239,"teacher_disagreement_score":0.007688004,"about_ca_system_score_codex":0.00090947404,"about_ca_system_score_gemma":0.0014324929,"threshold_uncertainty_score":0.025718987},"labels":[],"label_agreement":null},{"id":"W2021000796","doi":"10.1016/s0196-8858(02)00506-7","title":"Multiplicative principal-minor inequalities for totally nonnegative matrices","year":2003,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"National Science Foundation","keywords":"Mathematics; Multiplicative function; Minor (academic); Combinatorics; Nonnegative matrix; Matrix (chemical analysis); Pure mathematics; Symmetric matrix; Mathematical analysis; Eigenvalues and eigenvectors; Humanities","score_opus":0.0172206554813567,"score_gpt":0.28499515692667343,"score_spread":0.2677745014453167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021000796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061488293,0.0018018116,0.8720022,0.0024858336,0.0006719824,0.00009294061,0.00051471114,0.00022901456,0.060713287],"genre_scores_gemma":[0.75490505,0.0045901933,0.18622513,0.0020158414,0.0026668224,0.00053361454,0.0011345246,0.0004687785,0.04746006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811363,0.0005719717,0.000117964606,0.00033389867,0.0006294659,0.0002331284],"domain_scores_gemma":[0.9907838,0.0057992255,0.00075866794,0.0006521227,0.0013720746,0.00063407456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002436656,0.0023234177,0.0010918108,0.0020245132,0.0014748065,0.003783421,0.0019928662,0.0013170921,0.00814715],"category_scores_gemma":[0.012902357,0.0008339309,0.0014895776,0.0019141592,0.0031683228,0.006260643,0.0032732328,0.004680583,0.0013527335],"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.00008109174,0.00003159714,0.00023891854,0.00012243961,0.000023837265,0.00010885893,0.00018737094,0.0038667358,0.0033480474,0.97804135,0.0034121808,0.010537576],"study_design_scores_gemma":[0.00001807371,0.00005249364,0.000292886,0.000021080612,0.000023444836,0.0001783944,0.000055805216,0.025284033,0.0011245846,0.9691278,0.003799647,0.000021905073],"about_ca_topic_score_codex":0.00074158714,"about_ca_topic_score_gemma":0.001557324,"teacher_disagreement_score":0.00814715,"about_ca_system_score_codex":0.0012328617,"about_ca_system_score_gemma":0.0010044201,"threshold_uncertainty_score":0.02725494},"labels":[],"label_agreement":null},{"id":"W2021818992","doi":"10.1007/s10107-006-0727-3","title":"A matrix generation approach for eigenvalue optimization","year":2006,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Interior point method; Eigenvalues and eigenvectors; Column generation; Matrix (chemical analysis); Mathematical optimization; Optimization problem; Algorithm","score_opus":0.023260950768894534,"score_gpt":0.2661355048063854,"score_spread":0.2428745540374909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021818992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007891015,0.00006701966,0.9962759,0.000091115275,0.0000627779,0.00002514966,0.000018393866,0.00014236504,0.0025281974],"genre_scores_gemma":[0.075180106,0.0003654201,0.91216624,0.0003062531,0.000265238,0.00028677422,0.00017523335,0.00047097844,0.010783668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993211,0.0003053093,0.000022584209,0.0000828158,0.0002287357,0.000039438415],"domain_scores_gemma":[0.9989157,0.0005410292,0.000053047446,0.00017855209,0.00025873104,0.00005298768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008363218,0.0009516136,0.0008290558,0.0010821997,0.0009372124,0.0009970213,0.0014851297,0.0011180866,0.009660924],"category_scores_gemma":[0.0030181273,0.0005073236,0.0011268996,0.0010803811,0.0008098697,0.0015294914,0.0016221182,0.001833648,0.0033865343],"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.00009319728,0.0001823434,0.0002550229,0.00022845632,0.000058500853,0.00021032088,0.00019665659,0.13075882,0.008263585,0.6023862,0.017790977,0.23957597],"study_design_scores_gemma":[0.000020167456,0.00005217677,0.00006037294,0.000022269878,0.000013441444,0.00011199382,0.000021729407,0.7154746,0.0014310773,0.27549076,0.0072802906,0.000021123098],"about_ca_topic_score_codex":0.0006483606,"about_ca_topic_score_gemma":0.0012082326,"teacher_disagreement_score":0.009660924,"about_ca_system_score_codex":0.0003266646,"about_ca_system_score_gemma":0.0005648591,"threshold_uncertainty_score":0.03231901},"labels":[],"label_agreement":null},{"id":"W2022520257","doi":"10.2514/6.2010-9325","title":"A New Approach to Multidisciplinary Design Optimization via Internal Decomposition","year":2010,"lang":"en","type":"article","venue":"13th AIAA/ISSMO Multidisciplinary Analysis Optimization Conference","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multidisciplinary design optimization; Decomposition; Computer science; Multidisciplinary approach; Chemistry","score_opus":0.020818521264601188,"score_gpt":0.2888779441800706,"score_spread":0.2680594229154694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022520257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059096183,0.000097819044,0.99710995,0.00007582537,0.000027499027,0.000014019262,0.000011136157,0.00004536778,0.0020274955],"genre_scores_gemma":[0.074712835,0.0006335665,0.9199595,0.0001500639,0.000110842826,0.0003310486,0.00009743923,0.00016162088,0.0038431257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896705,0.00031908578,0.00004225586,0.00011034022,0.00049803365,0.00006325045],"domain_scores_gemma":[0.99944407,0.00018138056,0.00006487251,0.00013135436,0.00012424409,0.00005410236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013010491,0.0009898858,0.0010133687,0.0009689733,0.0004843989,0.001566715,0.0011820112,0.001008838,0.0032677536],"category_scores_gemma":[0.0016802408,0.000595677,0.0015705596,0.00076858763,0.0012554653,0.0014378519,0.0026697041,0.0021485158,0.0010707588],"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.000030600087,0.000059992217,0.00044748496,0.00026490062,0.00007708731,0.00007264468,0.00012711537,0.6263081,0.0074274978,0.2814984,0.002503688,0.08118258],"study_design_scores_gemma":[0.000014585751,0.000046427835,0.000085760956,0.000053932123,0.000016192525,0.00004929767,0.00002009115,0.9217945,0.001344882,0.06563215,0.010927773,0.0000145216145],"about_ca_topic_score_codex":0.0008750883,"about_ca_topic_score_gemma":0.00087430817,"teacher_disagreement_score":0.0032677536,"about_ca_system_score_codex":0.00066769746,"about_ca_system_score_gemma":0.0012333732,"threshold_uncertainty_score":0.01093179},"labels":[],"label_agreement":null},{"id":"W2022603337","doi":"10.3934/dcds.2015.35.4765","title":"Rigorous numerics for nonlinear operators with tridiagonal dominant linear part","year":2015,"lang":"en","type":"preprint","venue":"Discrete and Continuous Dynamical Systems","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Université Laval","funders":"Agence Nationale de la Recherche","keywords":"Tridiagonal matrix; Mathematics; Linear operators; Operator (biology); Diagonal; Computation; Linear map; Nonlinear system; Inverse; Applied mathematics; Contraction (grammar); Algebra over a field; Pure mathematics; Mathematical analysis; Discrete mathematics; Algorithm; Physics; Geometry; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.0120367012027016,"score_gpt":0.2480885726719081,"score_spread":0.2360518714692065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022603337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02351726,0.00024246408,0.9665568,0.00035130486,0.000079258454,0.000033036817,0.000051091818,0.00019852475,0.008970298],"genre_scores_gemma":[0.45063633,0.0005465722,0.53758067,0.00020407926,0.00010873218,0.00025336628,0.00014233583,0.0004088775,0.010119053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994325,0.00017586225,0.000028980035,0.000033442004,0.00029086176,0.00003834986],"domain_scores_gemma":[0.9989644,0.0004671523,0.00012911762,0.00014741266,0.00022599059,0.00006591884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013012673,0.00064142223,0.0004493497,0.0008016198,0.00054473197,0.0010424481,0.0011157369,0.0009666572,0.002872303],"category_scores_gemma":[0.0041563087,0.0003115364,0.0005569309,0.00039596154,0.0017472627,0.0020946315,0.0015353375,0.0014027314,0.0005542614],"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.000027047261,0.000050602746,0.00032556397,0.00013626592,0.000024122795,0.000084870306,0.00017912469,0.16921923,0.007886227,0.81074244,0.0012697481,0.010054666],"study_design_scores_gemma":[0.000007820045,0.0000111352765,0.000066333465,0.00000861222,0.00000212898,0.000016680357,0.000015053202,0.8952565,0.00094457774,0.102399275,0.0012644484,0.0000074293675],"about_ca_topic_score_codex":0.001123634,"about_ca_topic_score_gemma":0.0016375117,"teacher_disagreement_score":0.002872303,"about_ca_system_score_codex":0.00086402346,"about_ca_system_score_gemma":0.0010296857,"threshold_uncertainty_score":0.009608746},"labels":[],"label_agreement":null},{"id":"W2023108949","doi":"10.1016/j.camwa.2009.01.025","title":"The inverse of any two-by-two nonsingular partitioned matrix and three matrix inverse completion problems","year":2009,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Invertible matrix; Block matrix; Mathematics; Involutory matrix; Inverse; Matrix (chemical analysis); Square matrix; Single-entry matrix; Nonnegative matrix; Pure mathematics; Combinatorics; Symmetric matrix; Algebra over a field; Geometry; Eigenvalues and eigenvectors","score_opus":0.011865535596634202,"score_gpt":0.25420166419697726,"score_spread":0.24233612860034306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023108949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07408305,0.00048397912,0.9061781,0.0011222383,0.00022757793,0.00010032436,0.00020305719,0.00020916414,0.01739247],"genre_scores_gemma":[0.5690699,0.00062092865,0.40504533,0.00030078195,0.00017644763,0.00013668588,0.0006404152,0.00021973863,0.02378974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912626,0.00021453299,0.000035440797,0.00019702227,0.00028075135,0.00014595932],"domain_scores_gemma":[0.9980281,0.000790659,0.00023876528,0.0003555154,0.00038052583,0.00020643226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012981478,0.0012209691,0.0009274994,0.0005778766,0.00079486327,0.0024171188,0.0009089087,0.0018886207,0.0064340015],"category_scores_gemma":[0.0044555143,0.0004100222,0.0010143159,0.0008894111,0.0024260762,0.0027861162,0.0016626654,0.0022910535,0.0011750696],"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.00100388,0.00050293066,0.0018172875,0.00078689633,0.00010467366,0.0018853643,0.0014337796,0.12437552,0.043063197,0.5884712,0.014284677,0.22227065],"study_design_scores_gemma":[0.00014141637,0.000351914,0.001853112,0.000067258254,0.000054499607,0.0017691342,0.0015375318,0.32529205,0.026403662,0.6229046,0.019457238,0.00016765526],"about_ca_topic_score_codex":0.0013812938,"about_ca_topic_score_gemma":0.001040434,"teacher_disagreement_score":0.0064340015,"about_ca_system_score_codex":0.00046041847,"about_ca_system_score_gemma":0.0012829296,"threshold_uncertainty_score":0.021523833},"labels":[],"label_agreement":null},{"id":"W2024336882","doi":"10.5539/jmr.v6n2p64","title":"Solution of the Inverse Eigenvalue Problem for Certain (Anti-) Hermitian Matrices Using Newton's Method","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hermitian matrix; Mathematics; Eigenvalues and eigenvectors; Rank (graph theory); Matrix (chemical analysis); Diagonal matrix; Inverse; Combinatorics; Diagonal; Convergence (economics); Mathematical analysis; Pure mathematics; Applied mathematics; Geometry; Physics","score_opus":0.11600851378991354,"score_gpt":0.4073557471996357,"score_spread":0.29134723340972213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024336882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025704736,0.000088723624,0.9698346,0.0000977398,0.000020226573,0.00002968838,0.000018569444,0.00008680607,0.0041188393],"genre_scores_gemma":[0.30198145,0.0002522859,0.6905664,0.0000413524,0.0000318917,0.00013376359,0.00006284632,0.00007642771,0.0068536354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998293,0.00006173388,0.0000065682075,0.000020579893,0.00005826614,0.000023471126],"domain_scores_gemma":[0.99964917,0.0002062555,0.000045683144,0.000017061722,0.00006430681,0.00001753899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051296025,0.00043781224,0.0004952512,0.00034011176,0.00030073646,0.00040426408,0.0004378575,0.0007323617,0.002242738],"category_scores_gemma":[0.0010874817,0.00021854711,0.00034498307,0.00028627814,0.0005867489,0.00040686602,0.00051610795,0.0005579965,0.00032432887],"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.0000824864,0.00004807032,0.00084050756,0.00019050913,0.000031070114,0.00036385405,0.00022819405,0.8373267,0.015295793,0.09546662,0.0015314898,0.048594736],"study_design_scores_gemma":[0.000007686428,0.000015622414,0.00011521955,0.0000061154515,0.000001739448,0.00004049774,0.000022112912,0.9904275,0.0011699689,0.0074281446,0.0007591911,0.000006239839],"about_ca_topic_score_codex":0.0022880286,"about_ca_topic_score_gemma":0.002499375,"teacher_disagreement_score":0.0022880286,"about_ca_system_score_codex":0.00029964547,"about_ca_system_score_gemma":0.0008998356,"threshold_uncertainty_score":0.0075027347},"labels":[],"label_agreement":null},{"id":"W2024703178","doi":"10.1016/j.laa.2005.03.025","title":"Rectangular submatrices of inverse <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mrow><mml:mi mathvariant=\"script\">M</mml:mi></mml:mrow></mml:math>-matrices and the decomposition of a positive matrix as a sum","year":2005,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Inverse; Mathematics; Matrix (chemical analysis); Combinatorics; Block matrix; Geometry; Chemistry; Physics","score_opus":0.008998772410100555,"score_gpt":0.24109466825540668,"score_spread":0.23209589584530613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024703178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11887675,0.0008411081,0.66114134,0.001141382,0.0016911944,0.00028747943,0.005120767,0.0020994048,0.20880061],"genre_scores_gemma":[0.56945187,0.0009819099,0.24864721,0.00066455477,0.0005489104,0.00037689737,0.0058980235,0.0016141175,0.17181651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958855,0.00006228062,0.000025440748,0.000100300786,0.00013105814,0.000092256225],"domain_scores_gemma":[0.99931705,0.00014401173,0.00007634071,0.00017118183,0.00022262258,0.00006875603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034434628,0.0008657628,0.00048062493,0.0008031279,0.00049514545,0.001282992,0.0005273937,0.00041152217,0.05632664],"category_scores_gemma":[0.0019971386,0.00023888878,0.0005653794,0.00094068615,0.0009114832,0.0011239093,0.00083653897,0.0012246112,0.015011377],"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.00040524272,0.00015820512,0.00092687766,0.0004219067,0.00006308101,0.0004904602,0.00039383318,0.006384846,0.061172545,0.66242075,0.06836299,0.19879934],"study_design_scores_gemma":[0.000102501726,0.00035222844,0.0060410486,0.0001986307,0.00007354083,0.0017017635,0.00078856084,0.04659259,0.08137566,0.63041306,0.2322123,0.00014798473],"about_ca_topic_score_codex":0.000786119,"about_ca_topic_score_gemma":0.0012325452,"teacher_disagreement_score":0.05632664,"about_ca_system_score_codex":0.00028540118,"about_ca_system_score_gemma":0.0006562365,"threshold_uncertainty_score":0.18843138},"labels":[],"label_agreement":null},{"id":"W2026408580","doi":"10.1007/bf02829697","title":"Corners of normal matrices","year":2006,"lang":"en","type":"article","venue":"Proceedings of the Indian Academy of Sciences - Section A","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Indian Statistical Institute","keywords":"Diagonal; Normal matrix; Mathematics; Matrix (chemical analysis); Pure mathematics; Geometry; Physics; Materials science; Composite material; Eigenvalues and eigenvectors","score_opus":0.011836087203867179,"score_gpt":0.23894798718206087,"score_spread":0.2271118999781937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026408580","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36939347,0.001748058,0.2992088,0.0025500897,0.0017866744,0.00015440246,0.00078625255,0.00093552476,0.3234367],"genre_scores_gemma":[0.85979515,0.0009287832,0.036861867,0.0005573584,0.00063175237,0.00013523764,0.00070280343,0.0005038052,0.09988327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994404,0.0001255384,0.000028270842,0.0001207633,0.00018974708,0.00009525926],"domain_scores_gemma":[0.998679,0.0004214229,0.00018753875,0.00018288074,0.00026578124,0.00026345227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004193282,0.0008478048,0.00069968385,0.0025842818,0.0009931357,0.0033818076,0.0008990793,0.0008284742,0.019030878],"category_scores_gemma":[0.003162643,0.00044691222,0.00059926417,0.0010777136,0.0020713443,0.0025338226,0.002328683,0.002622844,0.003914742],"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.00010113758,0.000025041998,0.0003085047,0.000034591358,0.000009656686,0.00009984268,0.000247059,0.0013315099,0.002682216,0.9752984,0.0046646167,0.015197368],"study_design_scores_gemma":[0.00002623884,0.000047673304,0.0002991771,0.000018569162,0.000007565035,0.00022111353,0.00017557685,0.008488047,0.0022511147,0.9795792,0.008866215,0.000019496485],"about_ca_topic_score_codex":0.00063956773,"about_ca_topic_score_gemma":0.00064475794,"teacher_disagreement_score":0.019030878,"about_ca_system_score_codex":0.0007910787,"about_ca_system_score_gemma":0.00036886803,"threshold_uncertainty_score":0.063664615},"labels":[],"label_agreement":null},{"id":"W2026700760","doi":"10.1016/j.laa.2014.01.027","title":"Nearly positive matrices","year":2014,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"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":"Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Mathematics; Nonnegative matrix; Positive-definite matrix; Identity (music); Matrix (chemical analysis); Combinatorics; Identity matrix; Orthogonal matrix; Integer matrix; Complex matrix; Pure mathematics; Cone (formal languages); Matrix multiplication; Matrix analysis; Sequence (biology); Symmetric matrix; Eigenvalues and eigenvectors; Orthogonal basis; Algorithm","score_opus":0.006334614927266322,"score_gpt":0.23089206563948247,"score_spread":0.22455745071221617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026700760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14306359,0.0037632254,0.58190066,0.004361947,0.0019219996,0.00009920841,0.0010589715,0.0008575474,0.26297292],"genre_scores_gemma":[0.83497393,0.0022874465,0.04787421,0.0020005219,0.0016574371,0.00012323543,0.0008045137,0.00037677394,0.10990188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938786,0.00014576729,0.000018026596,0.00015390795,0.00023601524,0.000058500937],"domain_scores_gemma":[0.9988391,0.00034013917,0.00019618782,0.00018858258,0.00028611688,0.00014992116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042066985,0.00073745276,0.0005576305,0.0010761793,0.00077533186,0.002042612,0.0005696442,0.0007679906,0.014149673],"category_scores_gemma":[0.0033536495,0.0003745115,0.0003309664,0.0011562069,0.00131647,0.002715289,0.0015678321,0.0017310394,0.0028551994],"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.000036636,0.000016498627,0.00014889403,0.00004584849,0.000008273149,0.00004216215,0.00005413474,0.0014895916,0.00235619,0.97244817,0.005519253,0.017834332],"study_design_scores_gemma":[0.000006914537,0.000016601467,0.0002707702,0.0000105502695,0.0000050277035,0.00019637842,0.000037733247,0.009293234,0.0011885603,0.9789549,0.010007107,0.000012187488],"about_ca_topic_score_codex":0.00033489135,"about_ca_topic_score_gemma":0.00035828358,"teacher_disagreement_score":0.014149673,"about_ca_system_score_codex":0.0004561076,"about_ca_system_score_gemma":0.0003772324,"threshold_uncertainty_score":0.047335327},"labels":[],"label_agreement":null},{"id":"W2027519704","doi":"10.1002/qua.10777","title":"Unitarily invariant decomposition of arbitrary Hermitian matrices of physical interest","year":2003,"lang":"en","type":"article","venue":"International Journal of Quantum Chemistry","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"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":"Ministerio de Ciencia y Tecnología","keywords":"Hermitian matrix; Invariant (physics); Mathematics; Decomposition; Pure mathematics; Quantum; Algebra over a field; Mathematical physics; Quantum mechanics; Physics; Chemistry","score_opus":0.01575960976891935,"score_gpt":0.2825048663090287,"score_spread":0.2667452565401094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027519704","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2983362,0.0009648271,0.6042876,0.00068279216,0.0008069217,0.00016034588,0.000446339,0.00043036396,0.09388455],"genre_scores_gemma":[0.8154969,0.000996048,0.12532201,0.0005800905,0.000658172,0.00016553851,0.0007929884,0.0004641567,0.055524133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991592,0.00018234055,0.000039105023,0.00013135312,0.0003264178,0.00016163738],"domain_scores_gemma":[0.99923813,0.000098472796,0.0001231443,0.00011129883,0.00027679608,0.00015215126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006447275,0.0008773542,0.0004962381,0.0018171518,0.0005705982,0.0017555727,0.00079882285,0.0005330708,0.010042579],"category_scores_gemma":[0.0011576749,0.00024411292,0.0006398156,0.0006076669,0.002003793,0.0012692218,0.00097267085,0.001294421,0.0016199433],"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.00003996646,0.00004174715,0.0001339399,0.000041057687,0.000012388544,0.00011936595,0.0001571793,0.0026777599,0.008633007,0.9744272,0.0021208455,0.011595569],"study_design_scores_gemma":[0.000022654465,0.0001510876,0.00078700995,0.000023144903,0.000012246987,0.00040162512,0.00015756961,0.071779564,0.006786421,0.90658075,0.013239083,0.00005884606],"about_ca_topic_score_codex":0.00083400164,"about_ca_topic_score_gemma":0.00056592503,"teacher_disagreement_score":0.010042579,"about_ca_system_score_codex":0.00052371755,"about_ca_system_score_gemma":0.0006837591,"threshold_uncertainty_score":0.03359574},"labels":[],"label_agreement":null},{"id":"W2027580469","doi":"10.1080/0308108031000114631","title":"Ranks of Solutions of the Matrix Equation <i>AXB</i> = C","year":2003,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Matrix (chemical analysis); Combinatorics; Inverse; Moore–Penrose pseudoinverse; Pure mathematics; Algebra over a field; Geometry","score_opus":0.019812349274246615,"score_gpt":0.2535874551481448,"score_spread":0.2337751058738982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027580469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55101186,0.00079728104,0.40529877,0.001295685,0.00016533198,0.00010678678,0.00047138086,0.0006287539,0.040224146],"genre_scores_gemma":[0.92798907,0.00048642294,0.059779286,0.00015596359,0.00014816722,0.00010068133,0.00034824433,0.00021219322,0.01078007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922097,0.00019443505,0.000044370863,0.00011344672,0.0002847297,0.000142129],"domain_scores_gemma":[0.9967874,0.0014879511,0.0006497706,0.00019307144,0.0005439225,0.00033800467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008489225,0.0006038524,0.00057483686,0.0013204091,0.0008885552,0.0020020267,0.0009553158,0.00078603363,0.0072052055],"category_scores_gemma":[0.00635983,0.00025218455,0.00030489077,0.00055036426,0.0017493464,0.0018526899,0.0012441403,0.0010524733,0.0010890664],"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.00032236177,0.00014371876,0.003002203,0.00057710777,0.000049963375,0.00026585237,0.0008579872,0.044315726,0.025014184,0.85341537,0.0059773647,0.066058174],"study_design_scores_gemma":[0.000044772878,0.00013300513,0.0019509885,0.00006218719,0.000019375537,0.000246159,0.00059626816,0.1284441,0.013446348,0.8492545,0.005700531,0.00010178318],"about_ca_topic_score_codex":0.00063700665,"about_ca_topic_score_gemma":0.00087308226,"teacher_disagreement_score":0.0072052055,"about_ca_system_score_codex":0.0005865985,"about_ca_system_score_gemma":0.0009982921,"threshold_uncertainty_score":0.02410388},"labels":[],"label_agreement":null},{"id":"W2027897474","doi":"10.1016/s0024-3795(99)00265-7","title":"Regular Markov chains for which the transition matrix has large exponent","year":2000,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Markov chain; Exponent; Combinatorics; Stochastic matrix; Bounded function; Stationary distribution; Matrix (chemical analysis); Discrete mathematics; Mathematical analysis; Statistics","score_opus":0.011615937412917084,"score_gpt":0.24753029844779054,"score_spread":0.23591436103487345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027897474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2896935,0.00080027373,0.6892607,0.0016937951,0.00023483865,0.00013394287,0.0006306868,0.0009231615,0.016629146],"genre_scores_gemma":[0.9499706,0.0008765984,0.037143312,0.00041232028,0.0002774885,0.00018710995,0.00039872655,0.0001831645,0.010550679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931264,0.00018167245,0.000033111814,0.00019099632,0.00014312142,0.00013849886],"domain_scores_gemma":[0.98738146,0.008823644,0.0013423065,0.0013162486,0.0006365481,0.0004998566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013776729,0.0006269953,0.0008824832,0.0013072137,0.0008541612,0.0016961715,0.00085304125,0.0016659438,0.004869547],"category_scores_gemma":[0.018965514,0.0005593707,0.0005910762,0.0009234423,0.0018501327,0.0037957213,0.0012920494,0.002130712,0.0009361343],"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.00020582434,0.00007646321,0.001152654,0.00012390318,0.000046556397,0.0003938574,0.00026775853,0.02980676,0.0049504708,0.9508001,0.0024648837,0.009710713],"study_design_scores_gemma":[0.000037004276,0.000027130183,0.0004916581,0.000022214184,0.000015117396,0.00018344662,0.000056223627,0.19789511,0.0013224302,0.7985924,0.0013304128,0.000026788393],"about_ca_topic_score_codex":0.0006062664,"about_ca_topic_score_gemma":0.00078466337,"teacher_disagreement_score":0.004869547,"about_ca_system_score_codex":0.00064163987,"about_ca_system_score_gemma":0.0005547408,"threshold_uncertainty_score":0.016290247},"labels":[],"label_agreement":null},{"id":"W2028242709","doi":"10.1016/j.laa.2009.03.011","title":"Ranks of Hermitian and skew-Hermitian solutions to the matrix equation AXA∗=B","year":2009,"lang":"lv","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Shanghai Municipal Education Commission","keywords":"Hermitian matrix; Mathematics; Hermitian function; Matrix (chemical analysis); Combinatorics; Pure mathematics; Chemistry","score_opus":0.020390212418045946,"score_gpt":0.27101793204760266,"score_spread":0.2506277196295567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028242709","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8321786,0.0012234978,0.09923228,0.0024092412,0.00055297697,0.000089099216,0.0007760644,0.00061701366,0.062921256],"genre_scores_gemma":[0.96448565,0.00058292976,0.0077799945,0.00021955407,0.0005344527,0.00006322741,0.00036479297,0.00021383111,0.025755664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985933,0.00037718544,0.000079112295,0.00012004231,0.000523142,0.00030717588],"domain_scores_gemma":[0.992892,0.0025722887,0.0013053202,0.00039928764,0.0012680177,0.0015630759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015516831,0.00096189487,0.00083865685,0.0036315413,0.0013446342,0.0041923625,0.0012443027,0.0013639013,0.018828835],"category_scores_gemma":[0.009255368,0.0005110267,0.0004811275,0.0010072447,0.0028236397,0.0045300485,0.0024043475,0.0017427756,0.0023310648],"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.00028041276,0.00013405824,0.00129851,0.000120662124,0.000023989493,0.00026605267,0.0008685834,0.0045022275,0.0058757146,0.9638649,0.00439799,0.018366825],"study_design_scores_gemma":[0.000052055304,0.00011335798,0.0019282813,0.00004199573,0.00001424722,0.000384028,0.00059513777,0.034477357,0.002565718,0.956824,0.002910473,0.000093344126],"about_ca_topic_score_codex":0.00045922073,"about_ca_topic_score_gemma":0.0008029248,"teacher_disagreement_score":0.018828835,"about_ca_system_score_codex":0.00067412213,"about_ca_system_score_gemma":0.0010778953,"threshold_uncertainty_score":0.06298876},"labels":[],"label_agreement":null},{"id":"W2028391362","doi":"10.1016/j.laa.2014.09.022","title":"An inverse problem for gyroscopic systems","year":2014,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Inverse; Gyroscope; Applied mathematics; Geometry","score_opus":0.011615773471974582,"score_gpt":0.2560599266392506,"score_spread":0.244444153167276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028391362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01688101,0.0010180162,0.9709401,0.0010940788,0.00021843544,0.000028572926,0.00008302181,0.000080341895,0.009656419],"genre_scores_gemma":[0.7239766,0.0032424987,0.23594375,0.0005377092,0.0006862399,0.00016393731,0.00043014888,0.0001967743,0.03482235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953806,0.00014740239,0.000019282541,0.000113049886,0.00014905403,0.00003309948],"domain_scores_gemma":[0.99897563,0.00066443544,0.00009098186,0.000067919405,0.0001479749,0.00005299713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005814326,0.0007828992,0.0009821998,0.00064442714,0.00055809756,0.0017482567,0.0006942813,0.0017351536,0.004653418],"category_scores_gemma":[0.0043439902,0.00045942547,0.00064022146,0.00054963445,0.0018726491,0.0021790483,0.0017031839,0.0021554355,0.00048191927],"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.00012218622,0.00007941276,0.00061671,0.00056326424,0.00007111599,0.00034151648,0.0005763014,0.23756002,0.0051328754,0.66708946,0.0059166765,0.0819304],"study_design_scores_gemma":[0.000019781255,0.000041086998,0.0002264363,0.000051223305,0.000016339884,0.00021601202,0.0001534676,0.52335227,0.00092386396,0.46864003,0.006326568,0.00003294074],"about_ca_topic_score_codex":0.0027861558,"about_ca_topic_score_gemma":0.0018396692,"teacher_disagreement_score":0.004653418,"about_ca_system_score_codex":0.0004857324,"about_ca_system_score_gemma":0.00082049053,"threshold_uncertainty_score":0.015567243},"labels":[],"label_agreement":null},{"id":"W2028700804","doi":"10.1063/1.1836014","title":"Study of anharmonic singular potentials","year":2005,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Prince Edward Island","funders":"","keywords":"Eigenfunction; Eigenvalues and eigenvectors; Anharmonicity; Mathematics; Hamiltonian (control theory); Hamiltonian matrix; Convergence (economics); Matrix (chemical analysis); Simple (philosophy); Computation; Applied mathematics; Mathematical analysis; Mathematical physics; Symmetric matrix; Physics; Quantum mechanics; Mathematical optimization; Algorithm","score_opus":0.024815679183121254,"score_gpt":0.280861430797608,"score_spread":0.2560457516144867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028700804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40957808,0.0012957172,0.54601604,0.00059645146,0.00019569811,0.00009306193,0.00009331166,0.00021963517,0.041911945],"genre_scores_gemma":[0.93720603,0.0005217687,0.052348465,0.00008736852,0.00011110814,0.000081189355,0.000097262535,0.000120312296,0.00942651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979335,0.00006324062,0.0000067290825,0.00002306185,0.00008220334,0.000031411797],"domain_scores_gemma":[0.99958664,0.00017004105,0.00003981028,0.00005013368,0.0000639623,0.00008942623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043633897,0.00046594357,0.000595497,0.000721537,0.0007499315,0.00070573407,0.00076014025,0.00061171065,0.0022986117],"category_scores_gemma":[0.0015663502,0.00025737204,0.00041613908,0.000274668,0.0011693047,0.00090517045,0.0011887001,0.0007967591,0.00028654904],"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.000042038246,0.000081339604,0.0005237193,0.00013345922,0.000047732294,0.00033480048,0.00014484402,0.21902408,0.012076657,0.7550328,0.0012057732,0.011352822],"study_design_scores_gemma":[0.000010134199,0.000018531207,0.00017551948,0.000009569973,0.00000373573,0.000060965227,0.00003028475,0.8811589,0.0010367157,0.11653558,0.0009508354,0.0000092064965],"about_ca_topic_score_codex":0.0010551065,"about_ca_topic_score_gemma":0.00086536724,"teacher_disagreement_score":0.0022986117,"about_ca_system_score_codex":0.00041502924,"about_ca_system_score_gemma":0.0006624638,"threshold_uncertainty_score":0.007689655},"labels":[],"label_agreement":null},{"id":"W2028753414","doi":"10.1155/2014/515082","title":"A Test Matrix for an Inverse Eigenvalue Problem","year":2014,"lang":"lv","type":"article","venue":"Journal of Applied Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University; University of Waterloo","funders":"","keywords":"Algorithm; Computer science","score_opus":0.022489380054130013,"score_gpt":0.27103343809609903,"score_spread":0.24854405804196902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028753414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016371535,0.0001364856,0.9564276,0.0010763991,0.0004686396,0.00014149606,0.0003180742,0.00083179295,0.024228014],"genre_scores_gemma":[0.42520043,0.00035893355,0.52911264,0.00075112644,0.00035155183,0.0008008054,0.0014794485,0.0013656816,0.040579427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989071,0.0003356746,0.000038800903,0.00014221152,0.00045204168,0.00012417675],"domain_scores_gemma":[0.9976579,0.0011473746,0.00016101493,0.00022256751,0.0006130781,0.00019806194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011829546,0.0015218512,0.00075087586,0.0012484454,0.0010450464,0.002066945,0.0014808198,0.0021146808,0.031867757],"category_scores_gemma":[0.009197899,0.0004455532,0.0009064867,0.00066346873,0.0018441281,0.0017758362,0.002067859,0.0022165428,0.0071253376],"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.0007200854,0.00024436775,0.0017053063,0.0006855323,0.00008223222,0.0015803822,0.00059419376,0.15816706,0.030014709,0.64632905,0.04093071,0.11894636],"study_design_scores_gemma":[0.000082597166,0.00022279423,0.00040731268,0.00008120006,0.000018255669,0.00051139836,0.00027569855,0.7220445,0.0122157335,0.24545781,0.018597292,0.0000853134],"about_ca_topic_score_codex":0.002031545,"about_ca_topic_score_gemma":0.0014155167,"teacher_disagreement_score":0.031867757,"about_ca_system_score_codex":0.00060770015,"about_ca_system_score_gemma":0.0012381986,"threshold_uncertainty_score":0.10660833},"labels":[],"label_agreement":null},{"id":"W2029243213","doi":"10.1016/s0024-3795(01)00462-1","title":"Real eigenvalues of certain tridiagonal matrix polynomials, with queueing applications","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tridiagonal matrix; Mathematics; Eigenvalues and eigenvectors; Lambda; Interval (graph theory); Diagonal; Matrix (chemical analysis); Queueing theory; Algebra over a field; Combinatorics; Applied mathematics; Pure mathematics; Discrete mathematics","score_opus":0.013879799518787529,"score_gpt":0.250541042531399,"score_spread":0.2366612430126115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029243213","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17851813,0.001706828,0.79227,0.0020477902,0.00040098626,0.000053236057,0.00015548918,0.0004312682,0.02441631],"genre_scores_gemma":[0.9369214,0.0011410499,0.048341665,0.00020682199,0.00037095218,0.000057956917,0.00007807178,0.000112974834,0.012769128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943167,0.00019596377,0.000022389682,0.000119310265,0.00012942338,0.00010123684],"domain_scores_gemma":[0.9942399,0.0037556603,0.00060811994,0.00033869673,0.0007187887,0.00033876972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013345655,0.0007709038,0.00048985594,0.0011203805,0.000966251,0.0020215567,0.00093829475,0.0009991465,0.0063561997],"category_scores_gemma":[0.012271449,0.0003976433,0.00035877732,0.0015618317,0.002109732,0.0025179235,0.0010717874,0.0014485111,0.0006803715],"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.00010809884,0.000104021405,0.00045770511,0.00009890415,0.000017011744,0.00022499565,0.00038414932,0.03751936,0.0032369385,0.9383224,0.0034533897,0.016073108],"study_design_scores_gemma":[0.000023383509,0.00003269371,0.00037838792,0.000018344654,0.000009795362,0.00023488031,0.00022691142,0.41887784,0.0013743757,0.5768102,0.0019803527,0.000032823547],"about_ca_topic_score_codex":0.0014179811,"about_ca_topic_score_gemma":0.0013929735,"teacher_disagreement_score":0.0063561997,"about_ca_system_score_codex":0.0008923966,"about_ca_system_score_gemma":0.00085676153,"threshold_uncertainty_score":0.021263659},"labels":[],"label_agreement":null},{"id":"W2029375821","doi":"10.1016/j.laa.2013.10.021","title":"Intervals of totally nonnegative matrices","year":2013,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":20,"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":"Deutscher Akademischer Austauschdienst; University of Regina","keywords":"Mathematics; Invertible matrix; Nonnegative matrix; Combinatorics; Interval (graph theory); Matrix (chemical analysis); Zero (linguistics); Matrix analysis; Symmetric matrix; Pure mathematics; Eigenvalues and eigenvectors","score_opus":0.009097286430230752,"score_gpt":0.24117886408562472,"score_spread":0.23208157765539397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029375821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24635537,0.0038412292,0.67414266,0.00091759785,0.0007010765,0.00007397895,0.0011736675,0.00064442784,0.07215003],"genre_scores_gemma":[0.922916,0.0015573241,0.05999678,0.00031450426,0.0008507916,0.00017912428,0.00094423245,0.0002097335,0.0130315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861133,0.00042400416,0.00008268204,0.00027133236,0.00045227818,0.00015827763],"domain_scores_gemma":[0.9923436,0.0041017053,0.0012518851,0.00043414932,0.0010575082,0.00081113796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089497544,0.0011030104,0.00084895396,0.002486687,0.0007140267,0.0029301988,0.0017547414,0.00067889085,0.007565589],"category_scores_gemma":[0.010312567,0.00051340245,0.0005881021,0.0022709083,0.0016274987,0.0026225932,0.0015967024,0.0017399663,0.0007266783],"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.00023195223,0.000041993695,0.0004475877,0.00013167628,0.000023390223,0.00015718819,0.00025541233,0.004711526,0.0025959117,0.96447766,0.0028449034,0.024080858],"study_design_scores_gemma":[0.000028920203,0.00007228255,0.0006371098,0.00003990969,0.000014651294,0.00023533104,0.000103082035,0.03566438,0.0010573559,0.9579173,0.0041976026,0.000032046628],"about_ca_topic_score_codex":0.00044329706,"about_ca_topic_score_gemma":0.00028837405,"teacher_disagreement_score":0.007565589,"about_ca_system_score_codex":0.0006174036,"about_ca_system_score_gemma":0.00033520503,"threshold_uncertainty_score":0.025309384},"labels":[],"label_agreement":null},{"id":"W2031193519","doi":"10.1016/s0024-3795(01)00552-3","title":"An upper bound on the Perron value of an almost regular tournament matrix","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Tournament; Mathematics; Upper and lower bounds; Value (mathematics); Matrix (chemical analysis); Combinatorics; Applied mathematics; Statistics; Mathematical analysis","score_opus":0.013419677409969603,"score_gpt":0.2591579669652773,"score_spread":0.24573828955530772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031193519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3079178,0.005015993,0.5434176,0.007120453,0.0012822946,0.00015510034,0.0011217332,0.0014433281,0.13252562],"genre_scores_gemma":[0.92467916,0.001362968,0.054851577,0.000990287,0.00090995344,0.00018078179,0.00046120107,0.0002907148,0.016273342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974947,0.00075813296,0.000102198916,0.0004703814,0.0006848387,0.00048991904],"domain_scores_gemma":[0.9879972,0.0077194776,0.00061918,0.0014324014,0.00096088776,0.0012709073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028631713,0.0012222991,0.0016416658,0.002048476,0.0014455024,0.0036713525,0.0032136373,0.0024976698,0.011704339],"category_scores_gemma":[0.01683331,0.00066021836,0.0008532579,0.0018566428,0.0026167238,0.0050922777,0.0030422388,0.0029032724,0.0017969075],"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.0007582011,0.00021624315,0.0016552511,0.0004647378,0.00015074194,0.0002778294,0.00026388402,0.041734245,0.01763833,0.8826997,0.011711955,0.0424289],"study_design_scores_gemma":[0.00006329494,0.00019536991,0.0011727215,0.00010033264,0.00007342943,0.0004479109,0.00008735292,0.229057,0.0051609227,0.75666624,0.006889911,0.000085421234],"about_ca_topic_score_codex":0.00053339585,"about_ca_topic_score_gemma":0.0009844074,"teacher_disagreement_score":0.011704339,"about_ca_system_score_codex":0.001446387,"about_ca_system_score_gemma":0.0010068944,"threshold_uncertainty_score":0.039154887},"labels":[],"label_agreement":null},{"id":"W2031447082","doi":"10.1016/j.laa.2006.03.007","title":"Conditioning of the entries in the stationary vector of a Google-type matrix","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Combinatorics; PageRank; Scalar (mathematics); Matrix (chemical analysis); Conditioning; Type (biology); Graph; Rank (graph theory); Vertex (graph theory); Discrete mathematics; Directed graph; Computer science; Statistics","score_opus":0.007292511554814461,"score_gpt":0.2454426979094086,"score_spread":0.23815018635459412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031447082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3229246,0.00068674603,0.6461447,0.002212733,0.0008581771,0.0001911894,0.0028670414,0.0012775367,0.022837315],"genre_scores_gemma":[0.9426293,0.00070370437,0.030619802,0.000408387,0.00050391123,0.00012529858,0.00314105,0.00031821168,0.021550348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980319,0.0004366409,0.00007514466,0.00049785746,0.00046650885,0.0004919],"domain_scores_gemma":[0.9912356,0.0034405738,0.00079078577,0.0015834974,0.0023308469,0.00061875576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002109497,0.000862958,0.00089243706,0.0013600185,0.0006962924,0.002519682,0.0012732537,0.0009931674,0.020178497],"category_scores_gemma":[0.017223477,0.0004822853,0.0005314261,0.0014689316,0.002891468,0.003299382,0.001111657,0.0020261854,0.0028872313],"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.0016261761,0.00043311005,0.019687122,0.000460315,0.000206953,0.00039618716,0.00052271277,0.17664945,0.025860894,0.64265937,0.024438769,0.10705905],"study_design_scores_gemma":[0.00009569426,0.00042098007,0.016236069,0.0001073429,0.000070148286,0.000358107,0.0004593835,0.6942381,0.016653873,0.26463443,0.006521408,0.00020437506],"about_ca_topic_score_codex":0.00910093,"about_ca_topic_score_gemma":0.012433588,"teacher_disagreement_score":0.020178497,"about_ca_system_score_codex":0.0011401012,"about_ca_system_score_gemma":0.0031016085,"threshold_uncertainty_score":0.06750381},"labels":[],"label_agreement":null},{"id":"W2032127359","doi":"10.1007/s00010-006-2856-4","title":"On reverse-order laws for least-squares g-inverses and minimum norm g-inverses of a matrix product","year":2007,"lang":"en","type":"article","venue":"Aequationes Mathematicae","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Inverse; Combinatorics; Norm (philosophy); Order (exchange); Matrix (chemical analysis); Moore–Penrose pseudoinverse; Product (mathematics); Law; Geometry","score_opus":0.020157415282389537,"score_gpt":0.2841322680031145,"score_spread":0.26397485272072496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032127359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011900778,0.0006820644,0.97757626,0.0007976582,0.00012014602,0.00003148588,0.000101248756,0.00014946739,0.008640899],"genre_scores_gemma":[0.35435677,0.0036139274,0.6111473,0.0019882612,0.001160055,0.00040700447,0.0006976169,0.0013306288,0.025298525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99661463,0.0012712094,0.00022944297,0.00070430915,0.00095013255,0.0002303902],"domain_scores_gemma":[0.9550038,0.03708181,0.0016429701,0.0022478413,0.0034781098,0.0005454818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006523887,0.0016591041,0.0015495613,0.0025947196,0.0015200112,0.0036896965,0.002886055,0.0027568555,0.007663691],"category_scores_gemma":[0.042139232,0.0016919182,0.002686586,0.0023682793,0.00822458,0.010394052,0.0029931988,0.008423008,0.0018054036],"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.000031373827,0.000035986435,0.00041470682,0.000093964576,0.000013789832,0.000091426286,0.0004607203,0.012166091,0.0007681657,0.96752745,0.0023134495,0.016082875],"study_design_scores_gemma":[0.000010146683,0.000021765469,0.00014517046,0.000026731368,0.000008893862,0.00010617536,0.00006129027,0.053600017,0.00053204864,0.9435683,0.0018985565,0.000020794838],"about_ca_topic_score_codex":0.0036988736,"about_ca_topic_score_gemma":0.0044822674,"teacher_disagreement_score":0.007663691,"about_ca_system_score_codex":0.0016496574,"about_ca_system_score_gemma":0.0012367194,"threshold_uncertainty_score":0.03450203},"labels":[],"label_agreement":null},{"id":"W2032154264","doi":"10.1016/j.jfa.2004.10.010","title":"Erratum to “Global heat kernel bounds via desingularizing weights”","year":2004,"lang":"en","type":"erratum","venue":"Journal of Functional Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Kernel (algebra); Heat kernel; Applied mathematics; Pure mathematics; Mathematical analysis","score_opus":0.011462087012190777,"score_gpt":0.23912713681964604,"score_spread":0.22766504980745525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032154264","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013616772,0.0030861252,0.033419456,0.06507632,0.86795557,0.00008016068,0.001181474,0.0013968803,0.026442362],"genre_scores_gemma":[0.06938333,0.009879876,0.08052811,0.12061971,0.2610688,0.00055904785,0.0048698797,0.0072435644,0.44584772],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.995937,0.0007198165,0.00053278997,0.00060974003,0.001920201,0.00028038066],"domain_scores_gemma":[0.98600674,0.004076617,0.0005608628,0.00195582,0.006936146,0.00046384914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034881665,0.0034803585,0.0029485954,0.0045041363,0.0040492695,0.0039143274,0.005196704,0.006610703,0.049210142],"category_scores_gemma":[0.043705456,0.0014805441,0.0020760412,0.0028019329,0.0038494675,0.00624149,0.0024761565,0.009608517,0.020642128],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014825042,0.000026716662,0.00007686547,0.00018293114,0.000029565712,0.00016777469,0.000034598732,0.00043705857,0.00042054665,0.01890592,0.9643106,0.015259134],"study_design_scores_gemma":[0.00014143783,0.00015770452,0.0012178322,0.00049409375,0.00022634206,0.00084459403,0.0001482267,0.0113406135,0.005654595,0.116392836,0.8631596,0.00022217726],"about_ca_topic_score_codex":0.004552033,"about_ca_topic_score_gemma":0.005242543,"teacher_disagreement_score":0.049210142,"about_ca_system_score_codex":0.0032187616,"about_ca_system_score_gemma":0.0020870813,"threshold_uncertainty_score":0.16462433},"labels":[],"label_agreement":null},{"id":"W2032381656","doi":"10.1016/s0024-3795(00)00224-x","title":"Completing triangular block matrices with maximal and minimal ranks","year":2000,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Block (permutation group theory); Combinatorics; Triangular matrix; Matrix (chemical analysis); Block matrix; Discrete mathematics; Pure mathematics; Invertible matrix; Eigenvalues and eigenvectors","score_opus":0.008685612391769865,"score_gpt":0.22448486637231935,"score_spread":0.21579925398054947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032381656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070820466,0.00025917502,0.8814826,0.00034519448,0.000255605,0.00013289099,0.0006859145,0.0014657045,0.04455252],"genre_scores_gemma":[0.5073155,0.0005929108,0.4110398,0.00029981477,0.00043042185,0.00027010453,0.0025753358,0.0013585661,0.076117605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886036,0.00027166857,0.00006252472,0.0001820657,0.00039981926,0.00022357846],"domain_scores_gemma":[0.9973629,0.0006140953,0.00027790866,0.0008599686,0.0006512273,0.00023394758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090435107,0.00083445635,0.000705414,0.00053278025,0.000775895,0.0019802463,0.00082101417,0.00061611366,0.017929582],"category_scores_gemma":[0.0049449466,0.00041283018,0.00048968045,0.00075356173,0.0009607715,0.0025465458,0.002006565,0.0012615668,0.007335246],"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.0003780427,0.00014683441,0.00070993,0.00038554522,0.000035413188,0.00017038417,0.0006782651,0.018594941,0.03398618,0.6896676,0.036841642,0.21840532],"study_design_scores_gemma":[0.000053514483,0.00021424235,0.00059680967,0.000036490714,0.00002224994,0.00025324192,0.00039745157,0.05831761,0.028061561,0.87076753,0.04123348,0.00004584081],"about_ca_topic_score_codex":0.000613179,"about_ca_topic_score_gemma":0.001345128,"teacher_disagreement_score":0.017929582,"about_ca_system_score_codex":0.00029346067,"about_ca_system_score_gemma":0.0008036634,"threshold_uncertainty_score":0.059980452},"labels":[],"label_agreement":null},{"id":"W2032666500","doi":"10.1155/jia.2005.449","title":"Some inequalities for sums of nonnegative definite matrices in quaternions","year":2005,"lang":"en","type":"article","venue":"Journal of Inequalities and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Quaternion; Hermitian matrix; Positive-definite matrix; Algebra over a field; Pure mathematics; Quaternion algebra; Inequality; Matrix (chemical analysis); Division algebra; Mathematical analysis; Algebra representation; Eigenvalues and eigenvectors; Geometry","score_opus":0.02723228361165445,"score_gpt":0.2884520154961019,"score_spread":0.2612197318844474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032666500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045004677,0.011692798,0.8941592,0.002861523,0.0012873759,0.00008262209,0.0007925101,0.00016156053,0.04395775],"genre_scores_gemma":[0.68532324,0.015036587,0.2593183,0.0017391596,0.0038744658,0.0004007407,0.0015065509,0.00035091734,0.032449976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981263,0.0006057444,0.0001591438,0.0002856546,0.00060788385,0.00021511526],"domain_scores_gemma":[0.9948249,0.0030443117,0.00054029113,0.00018316446,0.0011092193,0.00029817983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032836478,0.001716242,0.0008705109,0.002728432,0.0008828785,0.0027098453,0.0012965754,0.0009213502,0.0073081],"category_scores_gemma":[0.010718267,0.00045171456,0.0011249251,0.002432369,0.0020953405,0.0047183465,0.0018483019,0.003325733,0.0010654909],"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.000096422984,0.000027453696,0.0004703372,0.00026677654,0.00004393276,0.00022611232,0.0002798467,0.011674033,0.005699839,0.9434372,0.0040047616,0.033773333],"study_design_scores_gemma":[0.000012563221,0.00006613818,0.0006411549,0.00010595968,0.000034104127,0.00019654076,0.00010511505,0.0873103,0.0032774936,0.8988465,0.009353197,0.00005100367],"about_ca_topic_score_codex":0.0012113826,"about_ca_topic_score_gemma":0.0012187278,"teacher_disagreement_score":0.0073081,"about_ca_system_score_codex":0.0012892233,"about_ca_system_score_gemma":0.00053380197,"threshold_uncertainty_score":0.024448037},"labels":[],"label_agreement":null},{"id":"W2033142970","doi":"10.1007/bf01203175","title":"Normal and seminormal eigenvalues of matrix functions","year":2001,"lang":"en","type":"article","venue":"Integral Equations and Operator Theory","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Matrix function; Matrix (chemical analysis); Spectrum of a matrix; Context (archaeology); Numerical range; Normality; Pure mathematics; Symmetric matrix; Algebra over a field; Combinatorics; Mathematical analysis; Matrix differential equation; Statistics","score_opus":0.011601272811296295,"score_gpt":0.2529014389965245,"score_spread":0.2413001661852282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033142970","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45789862,0.0021693772,0.48089185,0.0021713001,0.0006726361,0.000041811054,0.00020074828,0.00036905354,0.05558455],"genre_scores_gemma":[0.9402395,0.0011505961,0.036015287,0.00023133557,0.00069295225,0.000062445564,0.00013748648,0.00021351058,0.021257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990571,0.00030065363,0.00004441057,0.00015788656,0.00030768686,0.00013221578],"domain_scores_gemma":[0.9960543,0.0017470038,0.00043593944,0.00035293857,0.00076433946,0.00064559357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020573402,0.00080534,0.0007161638,0.0024186198,0.0012322043,0.0035486578,0.0011160526,0.001335114,0.005139865],"category_scores_gemma":[0.010030891,0.00043916673,0.00044534577,0.001184865,0.0044202916,0.0061416677,0.0017579978,0.0021743143,0.0008793017],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024541876,0.000015690855,0.00017781604,0.000011316098,0.0000023244659,0.000027573446,0.00018221466,0.0014258676,0.000647546,0.99293536,0.000525836,0.004023811],"study_design_scores_gemma":[0.000004099005,0.0000060200073,0.00011896828,0.000005462326,0.0000014302207,0.000041507403,0.000063067804,0.01785355,0.00025423503,0.9810698,0.0005720728,0.000009859341],"about_ca_topic_score_codex":0.0006891615,"about_ca_topic_score_gemma":0.0006106971,"teacher_disagreement_score":0.005139865,"about_ca_system_score_codex":0.0009978157,"about_ca_system_score_gemma":0.00067149475,"threshold_uncertainty_score":0.01719451},"labels":[],"label_agreement":null},{"id":"W2036097200","doi":"10.1016/j.ejc.2015.01.010","title":"Corrigendum to “Many large eigenvalues in sparse graphs” [European J. Combin. 34 (2013) 1125–1129]","year":2015,"lang":"en","type":"erratum","venue":"European Journal of Combinatorics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Eigenvalues and eigenvectors; Physics","score_opus":0.028259423805735356,"score_gpt":0.2461163809714948,"score_spread":0.21785695716575945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036097200","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016350206,0.0034788034,0.0013393986,0.039319366,0.9426764,0.000049444894,0.0010760328,0.00049518584,0.01140186],"genre_scores_gemma":[0.01320343,0.018985832,0.005800483,0.0859087,0.42571527,0.0003423723,0.0057268343,0.0018046362,0.4425125],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954007,0.0007220309,0.00058615074,0.0009355441,0.0018993422,0.00045620004],"domain_scores_gemma":[0.9869467,0.0029687225,0.00063116185,0.0011016207,0.007531357,0.0008204097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002623882,0.003339063,0.00373971,0.0062212036,0.0042582005,0.004115044,0.00525088,0.0054270797,0.14901397],"category_scores_gemma":[0.024425043,0.00169125,0.0037834498,0.003928992,0.0027482717,0.005311336,0.0032220904,0.0065656304,0.068824776],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029595156,0.000010464618,0.000037132217,0.00014452724,0.000017733983,0.00009056195,0.000013105333,0.00007160344,0.00006810356,0.0014664665,0.99378574,0.0042650774],"study_design_scores_gemma":[0.00006541529,0.000062799634,0.0014511363,0.00030898416,0.00007494495,0.00039384232,0.000057378224,0.00062674587,0.0005307081,0.011480555,0.9848492,0.00009823051],"about_ca_topic_score_codex":0.015446553,"about_ca_topic_score_gemma":0.022418842,"teacher_disagreement_score":0.14901397,"about_ca_system_score_codex":0.006404655,"about_ca_system_score_gemma":0.0030544882,"threshold_uncertainty_score":0.49850136},"labels":[],"label_agreement":null},{"id":"W2037192928","doi":"10.1016/j.laa.2007.09.022","title":"On orthostochastic, unistochastic and qustochastic matrices","year":2007,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":17,"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 Waterloo","funders":"","keywords":"Mathematics; Algebra over a field; Pure mathematics; Combinatorics","score_opus":0.008630937518256125,"score_gpt":0.2515287291817053,"score_spread":0.2428977916634492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037192928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35168293,0.004099336,0.57377404,0.0031724605,0.0007923855,0.00006559325,0.00053764746,0.00027306215,0.06560253],"genre_scores_gemma":[0.93659276,0.0020323677,0.037365474,0.00062964554,0.0008884499,0.000080906204,0.00037698957,0.00009840168,0.021935116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998389,0.0005888672,0.0000869854,0.000305958,0.0003588047,0.00027039507],"domain_scores_gemma":[0.9905462,0.0055995537,0.0010388523,0.0007019915,0.0012726331,0.0008406803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023091172,0.00096546655,0.00081328826,0.0019131019,0.0018293842,0.0024577114,0.0011379768,0.0012569405,0.006673501],"category_scores_gemma":[0.014260214,0.0004421957,0.00071080687,0.0020941135,0.00442145,0.0042829323,0.002409918,0.0019318978,0.00069057994],"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.00006041255,0.000015040153,0.00038700606,0.000026072672,0.0000056431995,0.00007132887,0.0001500818,0.0048591946,0.0003375189,0.9867927,0.0012704111,0.006024708],"study_design_scores_gemma":[0.000009967514,0.000020545083,0.00016782992,0.0000142405315,0.000004792455,0.000084941414,0.00006954284,0.0342662,0.00020639123,0.9639686,0.001169218,0.000017658163],"about_ca_topic_score_codex":0.0026865131,"about_ca_topic_score_gemma":0.0036094529,"teacher_disagreement_score":0.006673501,"about_ca_system_score_codex":0.0011012439,"about_ca_system_score_gemma":0.0012025859,"threshold_uncertainty_score":0.022325158},"labels":[],"label_agreement":null},{"id":"W2037302946","doi":"10.1016/s0024-3795(02)00300-2","title":"On the congruence of square real matrices","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Invertible matrix; Mathematics; Congruence (geometry); Square matrix; Matrix (chemical analysis); Square (algebra); Complex matrix; Combinatorics; Pure mathematics; Statement (logic); Real number; Algebra over a field; Symmetric matrix; Geometry","score_opus":0.01557181184412229,"score_gpt":0.23989989390232364,"score_spread":0.22432808205820134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037302946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16844897,0.006924366,0.6061739,0.008361597,0.0029818215,0.00010828849,0.00040354376,0.00041566367,0.20618193],"genre_scores_gemma":[0.867748,0.004235835,0.086897105,0.0018092276,0.0046519544,0.0001763516,0.0006390721,0.00036754357,0.03347487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996795,0.0011714848,0.00016716176,0.0005627853,0.0008995664,0.0004039881],"domain_scores_gemma":[0.9898307,0.00705037,0.00061649375,0.00072666287,0.0011781491,0.0005975502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028224075,0.0010250219,0.0013123782,0.0015352543,0.0017240496,0.0040610014,0.0010592287,0.001205108,0.0075081466],"category_scores_gemma":[0.017673811,0.00065378286,0.00087917346,0.0022466348,0.0075263646,0.00854213,0.0035436295,0.0043783025,0.0015639806],"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.00004943462,0.0000146034845,0.00015015903,0.00002435011,0.000002996856,0.00005828278,0.0002941076,0.0005344421,0.00056043616,0.9897195,0.0020365918,0.006555082],"study_design_scores_gemma":[0.000013468841,0.000013030219,0.000080392114,0.000008663201,0.0000017506047,0.000047065376,0.00006329776,0.0023918774,0.00022398094,0.9939826,0.0031674835,0.0000063394214],"about_ca_topic_score_codex":0.0014442819,"about_ca_topic_score_gemma":0.0009878338,"teacher_disagreement_score":0.0075081466,"about_ca_system_score_codex":0.0011597831,"about_ca_system_score_gemma":0.0008836254,"threshold_uncertainty_score":0.025117278},"labels":[],"label_agreement":null},{"id":"W2037427584","doi":"10.1002/cpa.21547","title":"Singular Value Decomposition of a Finite Hilbert Transform Defined on Several Intervals and the Interior Problem of Tomography: The Riemann‐Hilbert Problem Approach","year":2014,"lang":"en","type":"article","venue":"Communications on Pure and Applied Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Singular value; Riemann hypothesis; Method of steepest descent; Singular value decomposition; Mathematical analysis; Singular solution; Matrix (chemical analysis); Hilbert transform; Order (exchange); Riemann–Hilbert problem; Pure mathematics; Eigenvalues and eigenvectors; Algorithm; Statistics","score_opus":0.013233869176320742,"score_gpt":0.2429087033873063,"score_spread":0.22967483421098556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037427584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21870694,0.0005813885,0.7694875,0.0008950832,0.00008231306,0.00003360244,0.000054364693,0.000108815846,0.010049958],"genre_scores_gemma":[0.9420221,0.00051479,0.051019337,0.00010344508,0.00016235147,0.000054412416,0.00012017819,0.00010136555,0.0059019416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994035,0.00027402682,0.000022322489,0.000074730866,0.00014967778,0.00007579523],"domain_scores_gemma":[0.99606377,0.0022293304,0.00045147946,0.00022839403,0.00058522203,0.0004417993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023022264,0.00074571907,0.00077667105,0.0017279176,0.000517613,0.0016266844,0.0009905617,0.00081865216,0.0027535788],"category_scores_gemma":[0.010065835,0.00031428123,0.0006328184,0.0005271479,0.0034646154,0.002744616,0.0020307107,0.0025016088,0.00023708171],"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.00006786725,0.000052056716,0.0010186735,0.00007446107,0.000027336979,0.0002845212,0.00021037861,0.048078515,0.0039007796,0.93905,0.00050147844,0.006733878],"study_design_scores_gemma":[0.000012921677,0.000031456064,0.00044678207,0.000031887866,0.000008619398,0.00011304691,0.00008719059,0.67109615,0.0015260839,0.32610106,0.0005233546,0.00002137376],"about_ca_topic_score_codex":0.0012015605,"about_ca_topic_score_gemma":0.00041667002,"teacher_disagreement_score":0.0027535788,"about_ca_system_score_codex":0.00090795837,"about_ca_system_score_gemma":0.0007040315,"threshold_uncertainty_score":0.0121755},"labels":[],"label_agreement":null},{"id":"W2038067639","doi":"10.1080/01495730208941443","title":"A PARALLEL DIVIDE AND CONQUER ALGORITHM FOR NON SYMMETRIC TRIDIAGONAL TOEPLITZ SYSTEMS USING CONJUGATE GRADIENT","year":2002,"lang":"en","type":"article","venue":"Parallel algorithms 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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Tridiagonal matrix; Toeplitz matrix; Conjugate gradient method; Mathematics; Transpose; Diagonal; Divide and conquer algorithms; Tridiagonal matrix algorithm; Biconjugate gradient method; Band matrix; Matrix (chemical analysis); Biconjugate gradient stabilized method; Complex conjugate; Positive-definite matrix; Algorithm; Symmetric matrix; Applied mathematics; Conjugate residual method; Computer science; Mathematical analysis; Square matrix; Pure mathematics; Gradient descent; Geometry; Eigenvalues and eigenvectors","score_opus":0.029549206045522528,"score_gpt":0.2601528262754053,"score_spread":0.2306036202298828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038067639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011135175,0.00011739231,0.98607475,0.00014479367,0.00003531105,0.000067980414,0.000020041078,0.0009874655,0.0014171092],"genre_scores_gemma":[0.09573749,0.000068017594,0.8999396,0.000076334916,0.00003953694,0.00019611733,0.00008103283,0.00013610767,0.0037258684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996439,0.00007975511,0.000018489573,0.000071257724,0.00013026402,0.000056336936],"domain_scores_gemma":[0.99946123,0.00025750406,0.000045719706,0.000062286395,0.00013378373,0.000039439245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007114144,0.00093818933,0.0010440447,0.0007554398,0.0010435103,0.0008892793,0.001299102,0.0010212472,0.005926797],"category_scores_gemma":[0.0013811154,0.0004585683,0.00041591006,0.0009070954,0.00084298843,0.001089319,0.0010815695,0.0010920605,0.0012858534],"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.0006428808,0.00032116615,0.00087426364,0.00017568478,0.00012680894,0.00030624503,0.00028851483,0.41195533,0.01752673,0.04160804,0.008959402,0.51721483],"study_design_scores_gemma":[0.00007502666,0.000036721947,0.000050011717,0.0000028510153,0.0000070512524,0.00003176211,0.000019570343,0.98989236,0.0024586578,0.006159055,0.0012606996,0.0000062806594],"about_ca_topic_score_codex":0.0070894673,"about_ca_topic_score_gemma":0.010223467,"teacher_disagreement_score":0.0070894673,"about_ca_system_score_codex":0.000773459,"about_ca_system_score_gemma":0.0015623143,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2038353402","doi":"10.1080/03081087.2013.777439","title":"Polynomial bounds for small matrices","year":2013,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"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 Guelph","funders":"University of Newcastle Australia; Indian Statistical Institute; Agence Nationale de la Recherche; University of Guelph","keywords":"Mathematics; Hilbert space; Polynomial; Operator (biology); Combinatorics; Contraction (grammar); PSPACE; Discrete mathematics; Pure mathematics; Computational complexity theory; Mathematical analysis; Linguistics; Algorithm; Biology; Genetics","score_opus":0.013688499705888785,"score_gpt":0.24297646741941265,"score_spread":0.22928796771352386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038353402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05110098,0.009656448,0.8222366,0.0094761485,0.0008827137,0.0000638269,0.00045981864,0.0007180711,0.10540542],"genre_scores_gemma":[0.86447394,0.006595853,0.08543189,0.0026362888,0.0028777139,0.00023860601,0.00063570525,0.000878845,0.03623114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968436,0.0007887016,0.000090976464,0.0007682027,0.0009243791,0.0005841679],"domain_scores_gemma":[0.9802531,0.013930995,0.0008366887,0.0022242088,0.0018328946,0.0009222026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035872634,0.0011748256,0.0012871553,0.0020563095,0.0015051012,0.0034089861,0.0018491836,0.0014133111,0.012347609],"category_scores_gemma":[0.02594451,0.00047866214,0.0010190008,0.0021023992,0.0059675397,0.011191152,0.004951828,0.008241716,0.002475065],"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.000044600172,0.000017876113,0.00016588983,0.000088969464,0.000010565641,0.000046669047,0.00016405084,0.0027621042,0.0015431048,0.9845808,0.0032739576,0.007301433],"study_design_scores_gemma":[0.00000620728,0.000017967048,0.00018833517,0.000024927818,0.0000087591125,0.00004245561,0.00003492916,0.017354684,0.0010881007,0.9764889,0.0047304286,0.000014333024],"about_ca_topic_score_codex":0.0018192858,"about_ca_topic_score_gemma":0.0014993522,"teacher_disagreement_score":0.012347609,"about_ca_system_score_codex":0.0026133312,"about_ca_system_score_gemma":0.0009955377,"threshold_uncertainty_score":0.041306853},"labels":[],"label_agreement":null},{"id":"W2039246184","doi":"10.1016/j.laa.2008.02.018","title":"On the deformation of linear r-fields","year":2008,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kelowna General Hospital","funders":"","keywords":"Mathematics; Orthonormal basis; Field (mathematics); Integer (computer science); Deformation (meteorology); Linear space; Path (computing); Combinatorics; Space (punctuation); Mathematical analysis; Pure mathematics; Physics; Computer science","score_opus":0.016359145098522095,"score_gpt":0.2363214915315866,"score_spread":0.2199623464330645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039246184","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4849318,0.0054594087,0.31178725,0.008858695,0.0023174777,0.000085878564,0.00030730094,0.00064249936,0.18560974],"genre_scores_gemma":[0.92736876,0.0019060678,0.022104453,0.0010170304,0.0013602977,0.0000361154,0.00019528232,0.00021943581,0.04579241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992804,0.0002490734,0.00003165614,0.00015853677,0.00016838322,0.000111895075],"domain_scores_gemma":[0.9991436,0.0003095956,0.00012931405,0.00016793108,0.00011945369,0.00013003031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011138895,0.0007656997,0.0008058966,0.0013793614,0.0013012369,0.0017488976,0.0010616345,0.0011226925,0.008305396],"category_scores_gemma":[0.0025375916,0.00038197023,0.0006393913,0.0012940532,0.0037236453,0.0051559387,0.002064576,0.0022826197,0.0012899332],"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.00004338247,0.000021288404,0.00014564574,0.00002509758,0.000005753224,0.000058275153,0.00019207991,0.0020548392,0.0009844499,0.98691714,0.001275465,0.008276621],"study_design_scores_gemma":[0.000012287572,0.00003121344,0.00018778106,0.00000907035,0.0000037833495,0.00007616547,0.00006472956,0.0068348385,0.00038469603,0.9887897,0.003590258,0.00001548771],"about_ca_topic_score_codex":0.0007976077,"about_ca_topic_score_gemma":0.00053299865,"teacher_disagreement_score":0.008305396,"about_ca_system_score_codex":0.0010128138,"about_ca_system_score_gemma":0.00041924664,"threshold_uncertainty_score":0.027784348},"labels":[],"label_agreement":null},{"id":"W2039538606","doi":"10.1016/j.laa.2005.03.035","title":"Canonical forms for symmetric/skew-symmetric real matrix pairs under strict equivalence and congruence","year":2005,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Skew-symmetric matrix; Hamiltonian matrix; Symmetric matrix; Linear subspace; Canonical form; Pure mathematics; Congruence (geometry); Combinatorics; Skew; Mathematical proof; Hermitian matrix; Algebra over a field; Square matrix; Eigenvalues and eigenvectors; Geometry","score_opus":0.017544091418375176,"score_gpt":0.28785980518769466,"score_spread":0.2703157137693195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039538606","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32903513,0.00086344744,0.50791544,0.0036528027,0.0022778553,0.0004221967,0.0008466471,0.0010896756,0.15389684],"genre_scores_gemma":[0.9099423,0.0008602446,0.05071943,0.0008183733,0.0011792986,0.00041850752,0.00070244574,0.00057494047,0.03478449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99617046,0.0008330179,0.0002950975,0.0008196364,0.001152921,0.0007288662],"domain_scores_gemma":[0.9963792,0.00083599176,0.00047155042,0.00045135032,0.0011463456,0.0007155712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00318337,0.0011473163,0.0010479055,0.0027495958,0.00353963,0.00801365,0.0011985748,0.0016539469,0.010921324],"category_scores_gemma":[0.0065941247,0.00091937097,0.0013846706,0.0022208486,0.005881099,0.010495774,0.0040897047,0.0033993656,0.002662638],"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.000028087738,0.000023882125,0.00009291997,0.000010574661,0.0000039583715,0.000056504436,0.00026489852,0.00009471786,0.0004641306,0.994843,0.0008240924,0.0032932605],"study_design_scores_gemma":[0.000017553195,0.000018427267,0.00008443544,0.0000074216964,0.0000063609123,0.00012408732,0.00017459593,0.00096626405,0.00084307586,0.99537873,0.0023640995,0.000014981033],"about_ca_topic_score_codex":0.00054399413,"about_ca_topic_score_gemma":0.0006484208,"teacher_disagreement_score":0.010921324,"about_ca_system_score_codex":0.0011224498,"about_ca_system_score_gemma":0.0016992877,"threshold_uncertainty_score":0.0365355},"labels":[],"label_agreement":null},{"id":"W2040244671","doi":"10.1016/j.laa.2013.08.031","title":"Fischer determinantal inequalities and Highamʼs Conjecture","year":2013,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Conjecture; Gaussian; Range (aeronautics); Matrix (chemical analysis); Pure mathematics; Combinatorics","score_opus":0.009700593452076144,"score_gpt":0.23197320461510962,"score_spread":0.22227261116303348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040244671","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19063255,0.0059585758,0.204477,0.042465597,0.0025339986,0.00008158236,0.001596919,0.0005735338,0.5516803],"genre_scores_gemma":[0.9487435,0.0015405038,0.014488907,0.003450341,0.001581671,0.000106104846,0.00057446945,0.00015736351,0.029357105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982521,0.0003834296,0.0000557511,0.00034545793,0.00050675013,0.00045654533],"domain_scores_gemma":[0.9968407,0.001969541,0.0001771463,0.00040560254,0.00032651494,0.00028035525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019758248,0.0010099295,0.0012612195,0.0026005593,0.0026825326,0.0031229893,0.002096153,0.0022820886,0.018772317],"category_scores_gemma":[0.008555592,0.0006238082,0.00122025,0.002506753,0.0062259547,0.007699362,0.0043941843,0.006097666,0.002334837],"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.000026531197,0.000009450531,0.00014343586,0.000023078395,0.0000050015838,0.000031618274,0.00008684846,0.0005894441,0.00017437848,0.992717,0.003444264,0.002748996],"study_design_scores_gemma":[0.000007769335,0.0000040957066,0.00014130984,0.000007593602,0.0000030350996,0.000029039213,0.000026312468,0.0020784477,0.00013310567,0.9952997,0.002260179,0.000009314511],"about_ca_topic_score_codex":0.0032660859,"about_ca_topic_score_gemma":0.002374357,"teacher_disagreement_score":0.018772317,"about_ca_system_score_codex":0.002460754,"about_ca_system_score_gemma":0.0009471831,"threshold_uncertainty_score":0.06279963},"labels":[],"label_agreement":null},{"id":"W2040359081","doi":"10.1016/j.laa.2011.09.015","title":"On two expressions of the MLE for a special case of the extended growth curve models","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its 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":"McGill University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Equivalence (formal languages); Mathematics; Projection (relational algebra); Applied mathematics; Algebraic number; Matrix (chemical analysis); Iterative method; Algebra over a field; Pure mathematics; Mathematical optimization; Mathematical analysis; Algorithm","score_opus":0.028782389956257075,"score_gpt":0.2633839396483764,"score_spread":0.23460154969211935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040359081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06295244,0.0060719056,0.81948465,0.006815654,0.0011242994,0.0000951867,0.00048647865,0.00041930602,0.102550074],"genre_scores_gemma":[0.73539764,0.00609752,0.1904837,0.0026274074,0.0036015324,0.0004239864,0.0010096631,0.000981429,0.05937713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903226,0.0004244864,0.00006483385,0.0001396951,0.00020761813,0.0001312349],"domain_scores_gemma":[0.9957039,0.0022911595,0.0005506625,0.00036085906,0.0005808489,0.00051257684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026489205,0.0015004284,0.001602887,0.0032120247,0.0013939921,0.003794398,0.0023017412,0.00371001,0.012498943],"category_scores_gemma":[0.013857587,0.00070116663,0.0015257471,0.002298523,0.0040799626,0.007855584,0.0026349102,0.004404199,0.0019684639],"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.000008389449,0.000011133129,0.000080900245,0.00004130456,0.0000069794837,0.00007178707,0.0000946873,0.0022354687,0.00019961155,0.99392563,0.0012117368,0.0021123614],"study_design_scores_gemma":[0.0000071889717,0.000008000542,0.00013917917,0.00004504202,0.000008785068,0.0001289203,0.000056208693,0.03525699,0.0001612523,0.96210974,0.0020502172,0.000028370148],"about_ca_topic_score_codex":0.0012322518,"about_ca_topic_score_gemma":0.0017073521,"teacher_disagreement_score":0.012498943,"about_ca_system_score_codex":0.0016477047,"about_ca_system_score_gemma":0.0011396267,"threshold_uncertainty_score":0.041813135},"labels":[],"label_agreement":null},{"id":"W2041004354","doi":"10.1016/j.laa.2009.03.032","title":"Directed intervals and the dual of a graph","year":2009,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Adjacency matrix; Invertible matrix; Discrete mathematics; Graph; Two-graph; Line graph; Graph power; Pure mathematics","score_opus":0.008410390937062107,"score_gpt":0.24108570645399371,"score_spread":0.2326753155169316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041004354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31599265,0.0021124005,0.58134806,0.0020808678,0.0004903952,0.00004896211,0.0010073289,0.00032112663,0.09659828],"genre_scores_gemma":[0.9028889,0.0010822386,0.07788147,0.0004187256,0.000394454,0.00008020501,0.00057217013,0.00011114748,0.016570667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953246,0.00015142154,0.000019788746,0.00011637228,0.00011961568,0.000060391336],"domain_scores_gemma":[0.9984139,0.0007102678,0.00024182556,0.00011587491,0.00026725384,0.00025086792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005751169,0.00028402658,0.00038731218,0.0014926554,0.00055312697,0.0020596117,0.00087927026,0.00052507233,0.005673942],"category_scores_gemma":[0.0025403642,0.00022020603,0.00031748213,0.001226677,0.0011369154,0.0022614843,0.00081218436,0.0014416133,0.0005915679],"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.000042017782,0.000019408299,0.0001308314,0.000019405557,0.000004511452,0.000025999572,0.0000910372,0.0010589338,0.0005839873,0.9903611,0.0009055356,0.0067573437],"study_design_scores_gemma":[0.000012506682,0.000014502139,0.00013374294,0.0000104444225,0.0000044479775,0.00005361145,0.00007008447,0.01354837,0.00026803653,0.9821801,0.0036972945,0.0000068213863],"about_ca_topic_score_codex":0.0007490487,"about_ca_topic_score_gemma":0.00050897506,"teacher_disagreement_score":0.005673942,"about_ca_system_score_codex":0.00051966636,"about_ca_system_score_gemma":0.00032780113,"threshold_uncertainty_score":0.018981218},"labels":[],"label_agreement":null},{"id":"W2041135148","doi":"10.1016/j.laa.2008.06.007","title":"More on generalized inverses of partitioned matrices with Banachiewicz–Schur forms","year":2008,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Moore–Penrose pseudoinverse; Hermitian matrix; Schur complement; Inverse; Schur's theorem; Schur decomposition; Pure mathematics; Schur product theorem; Matrix (chemical analysis); Generalized inverse; Combinatorics; Algebra over a field; Eigenvalues and eigenvectors; Geometry; Physics","score_opus":0.01575864768235986,"score_gpt":0.24054643350965085,"score_spread":0.224787785827291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041135148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040548436,0.017085193,0.6043299,0.01675018,0.012201133,0.00009083786,0.00081890554,0.00057619595,0.30759928],"genre_scores_gemma":[0.4242808,0.016795887,0.22302328,0.014470617,0.012019504,0.00015231653,0.0010748203,0.0008929876,0.30728987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999482,0.0001615891,0.00002530399,0.0001267302,0.00014855014,0.00005584833],"domain_scores_gemma":[0.9993868,0.0002460927,0.000053587977,0.00012990342,0.00014460283,0.00003893217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011388963,0.0013939948,0.000855557,0.0013035118,0.00071265583,0.0016853886,0.00088325876,0.0011201997,0.033057798],"category_scores_gemma":[0.0021462515,0.00037600112,0.0013483725,0.0017351848,0.0018655129,0.006195315,0.0010763202,0.0021864832,0.0032348514],"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.000032970154,0.00004797239,0.00010810889,0.00020021369,0.00002101747,0.00017619258,0.00036849242,0.002126407,0.002382049,0.95208365,0.017278915,0.025173964],"study_design_scores_gemma":[0.000011395047,0.00003733044,0.00021713387,0.00004723454,0.000010974041,0.00018482597,0.0001257858,0.0029376363,0.0012041454,0.92494607,0.07023663,0.00004083308],"about_ca_topic_score_codex":0.0010768869,"about_ca_topic_score_gemma":0.0016293266,"teacher_disagreement_score":0.033057798,"about_ca_system_score_codex":0.00062025414,"about_ca_system_score_gemma":0.0002694694,"threshold_uncertainty_score":0.110589385},"labels":[],"label_agreement":null},{"id":"W2042667556","doi":"10.1016/j.laa.2011.04.005","title":"Majorization and multiplier sequences","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Majorization; Mathematics; Multiplier (economics); Mathematical proof; Algebra over a field; Matrix (chemical analysis); Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.019915120969895558,"score_gpt":0.23500416750085135,"score_spread":0.21508904653095579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042667556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116015345,0.0030420069,0.7093384,0.0033525182,0.00087096845,0.00009436783,0.00040508504,0.0005125895,0.16636863],"genre_scores_gemma":[0.7304004,0.002590352,0.10485503,0.0011891166,0.0017139772,0.0003196607,0.0005766665,0.0005967061,0.15775818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999038,0.00032209652,0.00003984003,0.0002368845,0.00021853791,0.00014466545],"domain_scores_gemma":[0.99753016,0.0011164143,0.0003203202,0.00028979394,0.0004461509,0.0002971351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013180088,0.0013589102,0.00095356815,0.0020456344,0.0015934039,0.0024544916,0.00126388,0.0010266902,0.015225341],"category_scores_gemma":[0.0054431176,0.0007541681,0.00096921204,0.0018850536,0.0026180595,0.0044857347,0.0026497797,0.003428069,0.0031145066],"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.000040212955,0.000015255331,0.00006845218,0.00002309423,0.0000057291463,0.000023338487,0.0000637769,0.00078877935,0.0008739564,0.9879298,0.0018390066,0.008328506],"study_design_scores_gemma":[0.0000093438985,0.00002375642,0.000090137524,0.000009123331,0.000004954794,0.0000897653,0.000022636086,0.0047391905,0.0010006411,0.9895113,0.0044874307,0.000011639008],"about_ca_topic_score_codex":0.0003712456,"about_ca_topic_score_gemma":0.00035531496,"teacher_disagreement_score":0.015225341,"about_ca_system_score_codex":0.0010779343,"about_ca_system_score_gemma":0.00081626076,"threshold_uncertainty_score":0.050933897},"labels":[],"label_agreement":null},{"id":"W2044496489","doi":"10.1080/00029890.2009.11920976","title":"Almost All Integer Matrices Have No Integer Eigenvalues","year":2009,"lang":"en","type":"article","venue":"American Mathematical Monthly","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Integer (computer science); Eigenvalues and eigenvectors; Integer matrix; Radical of an integer; Mathematics; Integer points in convex polyhedra; Integer programming; Half-integer; Combinatorics; Prime factor; Branch and price; Computer science; Mathematical optimization; Physics; Prime (order theory); Symmetric matrix; Nonnegative matrix","score_opus":0.01171347998623152,"score_gpt":0.26648394570078426,"score_spread":0.25477046571455275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044496489","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19645004,0.009966094,0.5936016,0.05924797,0.0069644824,0.00006922169,0.0011728145,0.0014330511,0.13109483],"genre_scores_gemma":[0.93159616,0.0030600715,0.029642366,0.008214213,0.005896395,0.00010217442,0.00055748934,0.00023262607,0.020698559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983298,0.0004415983,0.00008730103,0.00039071406,0.0005364371,0.00021417257],"domain_scores_gemma":[0.98718053,0.008265752,0.0014528612,0.0015309263,0.0009842075,0.0005856896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013808977,0.0005944006,0.0008111913,0.0009229378,0.001474878,0.0028639392,0.0009029855,0.0015528005,0.0075584287],"category_scores_gemma":[0.014657207,0.0004369885,0.0005458655,0.0009911106,0.0031408363,0.0053456794,0.0012429471,0.0022722161,0.001782317],"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.00023191536,0.00005018115,0.00279965,0.00015085597,0.00004444998,0.00022571623,0.00027197198,0.001846601,0.0018297809,0.91495556,0.02388895,0.053704407],"study_design_scores_gemma":[0.000037776677,0.000052617357,0.0012930384,0.000037861002,0.000019499435,0.0004479305,0.00012721415,0.007986119,0.0019730004,0.95754516,0.030445501,0.000034262055],"about_ca_topic_score_codex":0.00020436248,"about_ca_topic_score_gemma":0.00023945823,"teacher_disagreement_score":0.0075584287,"about_ca_system_score_codex":0.0005176429,"about_ca_system_score_gemma":0.00029293264,"threshold_uncertainty_score":0.025285482},"labels":[],"label_agreement":null},{"id":"W2045010435","doi":"10.1007/bf01217534","title":"Repeated eigenvectors and the numerical range of self-adjoint quadratic operator polynomials","year":2002,"lang":"en","type":"article","venue":"Integral Equations and Operator Theory","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Hilbert space; Operator (biology); Self-adjoint operator; Polynomial; Numerical range; Quadratic equation; Pure mathematics; Quadratic function; Mathematical analysis; Geometry","score_opus":0.012445863857316108,"score_gpt":0.22014435275134286,"score_spread":0.20769848889402676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045010435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3631342,0.0018512174,0.58658403,0.0018794391,0.0002681665,0.000044336706,0.00006428629,0.0011640104,0.045010302],"genre_scores_gemma":[0.95446795,0.0003117714,0.039798927,0.00015464348,0.00010675473,0.000034963974,0.000040575247,0.00023116356,0.0048532677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998828,0.00053687854,0.000041517513,0.00011420588,0.00038426818,0.00009517938],"domain_scores_gemma":[0.9952317,0.003157097,0.00033201821,0.00042544055,0.0005364339,0.00031726452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021839226,0.0004975003,0.00047211174,0.0012586148,0.00062240637,0.0021487325,0.0011191315,0.00095279934,0.003770207],"category_scores_gemma":[0.016697656,0.00040067505,0.00027683697,0.00060879934,0.0024272776,0.0032662149,0.0020642732,0.001762968,0.00057619036],"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.00014442761,0.00008580163,0.00067603064,0.0000891137,0.000017413962,0.00017767595,0.00038483486,0.035349865,0.010498304,0.92830783,0.0010559142,0.02321285],"study_design_scores_gemma":[0.000029263958,0.00003759979,0.0003163662,0.000039927174,0.000006562115,0.00017853089,0.000080041944,0.30928898,0.0050297366,0.6832915,0.0016661481,0.000035336965],"about_ca_topic_score_codex":0.00031527126,"about_ca_topic_score_gemma":0.0003351136,"teacher_disagreement_score":0.003770207,"about_ca_system_score_codex":0.00047224632,"about_ca_system_score_gemma":0.00040826917,"threshold_uncertainty_score":0.012612581},"labels":[],"label_agreement":null},{"id":"W2045472404","doi":"10.1016/j.laa.2012.05.014","title":"Sign patterns that require or allow particular refined inertias","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Iowa State University; National Science Foundation","keywords":"Sign (mathematics); Mathematics; Diagonal; Eigenvalues and eigenvectors; Combinatorics; Zero (linguistics); Diagonal matrix; Matrix (chemical analysis); Pure mathematics; Mathematical analysis; Geometry; Physics; Quantum mechanics","score_opus":0.03166310911011993,"score_gpt":0.2702285708111855,"score_spread":0.23856546170106557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045472404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5325202,0.0001929532,0.33511797,0.00085906446,0.0015284684,0.00040916968,0.0010023138,0.0032382251,0.12513165],"genre_scores_gemma":[0.8978591,0.00013806108,0.07351168,0.00053964765,0.00019425202,0.00017630296,0.0010438331,0.0014267329,0.025110262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987338,0.00013515855,0.00013206714,0.00026873438,0.00029653226,0.00043364477],"domain_scores_gemma":[0.9953751,0.00062744913,0.00045579454,0.0021950575,0.00065513304,0.00069156394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093224866,0.00080161326,0.0009856476,0.00089168985,0.0014113057,0.0024693639,0.0010501627,0.0017116715,0.02626286],"category_scores_gemma":[0.007989967,0.0005678605,0.000992027,0.00085893134,0.0024384302,0.004480251,0.0024476198,0.0026157459,0.004276393],"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.0007259517,0.00022372925,0.0043809637,0.00022553645,0.000050932584,0.0018589031,0.000706836,0.0022314307,0.07236927,0.8638029,0.0085735405,0.044849947],"study_design_scores_gemma":[0.00018530924,0.00026720818,0.0048071383,0.00008789358,0.000088324225,0.0022829291,0.00083497824,0.014358261,0.03535375,0.90924907,0.03231752,0.00016765836],"about_ca_topic_score_codex":0.0002621351,"about_ca_topic_score_gemma":0.00069133524,"teacher_disagreement_score":0.02626286,"about_ca_system_score_codex":0.0003246215,"about_ca_system_score_gemma":0.0007132565,"threshold_uncertainty_score":0.08785796},"labels":[],"label_agreement":null},{"id":"W2045625613","doi":"10.1007/s10444-010-9168-x","title":"Top-level acceleration of adaptive algebraic multilevel methods for steady-state solution to Markov chains","year":2010,"lang":"en","type":"article","venue":"Advances in Computational Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Preconditioner; Multiplicative function; Markov chain; Eigenvalues and eigenvectors; Applied mathematics; Invertible matrix; Acceleration; Multigrid method; Algebraic number; Convergence (economics); Mathematical optimization; Iterative method; Mathematical analysis; Pure mathematics; Differential equation","score_opus":0.04211352499498902,"score_gpt":0.3685037694528638,"score_spread":0.3263902444578748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045625613","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010913717,0.000116579446,0.9842812,0.0001460319,0.00010692464,0.0000338466,0.000049753988,0.00043960827,0.0039123665],"genre_scores_gemma":[0.3764792,0.0003021044,0.61721176,0.00018645076,0.0001397143,0.00030921563,0.00019913616,0.00033582878,0.0048365956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957734,0.00015259854,0.000022377895,0.00003315171,0.00015433344,0.000060150334],"domain_scores_gemma":[0.9983516,0.0008562817,0.00008195909,0.0002375594,0.00037732907,0.00009538808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008087777,0.0004944283,0.0009862211,0.00060827244,0.00072825165,0.0010444397,0.0016676515,0.0011092573,0.007899507],"category_scores_gemma":[0.0045854067,0.00038009338,0.0008584567,0.0007572446,0.0006590874,0.0010059217,0.0018903275,0.0022696855,0.001508909],"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.0002295908,0.00016452427,0.00087161333,0.00021654645,0.00010083078,0.00009905117,0.00019834063,0.7285421,0.0051229885,0.118881606,0.0041832495,0.14138949],"study_design_scores_gemma":[0.0000056784284,0.000006682521,0.000022667644,0.000002926759,0.00000217975,0.0000031481516,0.000004015189,0.9947519,0.000204868,0.004648864,0.00034487358,0.0000022587656],"about_ca_topic_score_codex":0.005667277,"about_ca_topic_score_gemma":0.0072916383,"teacher_disagreement_score":0.007899507,"about_ca_system_score_codex":0.000533375,"about_ca_system_score_gemma":0.0011952126,"threshold_uncertainty_score":0.026426435},"labels":[],"label_agreement":null},{"id":"W2045800700","doi":"10.2307/2695518","title":"An Elaborate Uniform Convergence: 10840","year":2002,"lang":"en","type":"article","venue":"American Mathematical Monthly","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Convergence (economics); Mathematics; Computer science; Applied mathematics; Economics","score_opus":0.012266847695092722,"score_gpt":0.24475371010689104,"score_spread":0.2324868624117983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045800700","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021981902,0.012422612,0.35310835,0.02340503,0.007944707,0.0005626114,0.0023590864,0.0017352463,0.5764804],"genre_scores_gemma":[0.35099486,0.0084360605,0.105531566,0.0056315847,0.0049781166,0.0012053293,0.0040219743,0.0026928515,0.5165076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982217,0.0005439001,0.00007184149,0.0005134691,0.00044120653,0.00020779618],"domain_scores_gemma":[0.997758,0.00092114677,0.000087665045,0.000394698,0.0006850818,0.0001534086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029027618,0.002500626,0.0014485891,0.0017724204,0.0016248038,0.002440506,0.0016829602,0.0017870732,0.117340654],"category_scores_gemma":[0.009213791,0.0004810693,0.0021584334,0.001845193,0.0012178667,0.0044135167,0.0051118564,0.0033775046,0.030248784],"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.0003855293,0.00011028012,0.0013078653,0.0008653403,0.00014764178,0.0003491804,0.00028782903,0.0086786635,0.00318734,0.59591216,0.2502446,0.13852371],"study_design_scores_gemma":[0.00015123864,0.00015650639,0.0023627374,0.00041789876,0.00016809154,0.0008485548,0.0001786396,0.118051134,0.0041299956,0.56764984,0.30578992,0.000095430776],"about_ca_topic_score_codex":0.0024149753,"about_ca_topic_score_gemma":0.0031845202,"teacher_disagreement_score":0.117340654,"about_ca_system_score_codex":0.0025141514,"about_ca_system_score_gemma":0.0015122837,"threshold_uncertainty_score":0.3925436},"labels":[],"label_agreement":null},{"id":"W2045801261","doi":"10.1002/mana.200410424","title":"A connection between Schur multiplication and Fourier interpolation. II","year":2006,"lang":"en","type":"article","venue":"Mathematische Nachrichten","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ryerson University","keywords":"Mathematics; Hermitian matrix; Combinatorics; Matrix norm; Unitary matrix; Matrix multiplication; Schur product theorem; Schur decomposition; Norm (philosophy); Matrix (chemical analysis); Gramian matrix; Sesquilinear form; Hankel matrix; Connection (principal bundle); Schur complement; Unitary state; Pure mathematics; Mathematical analysis; Eigenvalues and eigenvectors; Geometry","score_opus":0.011484332084719355,"score_gpt":0.23504645992395762,"score_spread":0.22356212783923826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045801261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08888947,0.0016795966,0.8501787,0.0012220076,0.0006153941,0.000098077304,0.00020819457,0.00019315541,0.056915496],"genre_scores_gemma":[0.74554807,0.0009808865,0.2324368,0.00039902635,0.0007849113,0.00015852232,0.00022544514,0.00019157528,0.019274732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998604,0.0005393538,0.000073829025,0.0002442517,0.00038313743,0.00015557569],"domain_scores_gemma":[0.9973937,0.0011192581,0.0003797588,0.00035523315,0.0005231676,0.00022890605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00302449,0.00063008006,0.0005882296,0.0016469173,0.0011552359,0.0017512568,0.00083964074,0.0009264665,0.004056782],"category_scores_gemma":[0.0057666623,0.00039810376,0.0007736226,0.0011544462,0.003707973,0.0033147014,0.0020912685,0.00237272,0.00069559197],"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.000043060034,0.000013533763,0.00018066456,0.000025326292,0.0000053887934,0.00004366324,0.00012689258,0.0025223298,0.0014509186,0.9846752,0.0006834729,0.010229544],"study_design_scores_gemma":[0.000009980855,0.00007745234,0.0003304052,0.000029307737,0.0000050102153,0.00014760901,0.00007079305,0.059468806,0.0027318755,0.9306603,0.0064396,0.000028971292],"about_ca_topic_score_codex":0.0007495468,"about_ca_topic_score_gemma":0.00054205867,"teacher_disagreement_score":0.004056782,"about_ca_system_score_codex":0.0013188507,"about_ca_system_score_gemma":0.0005832465,"threshold_uncertainty_score":0.015995204},"labels":[],"label_agreement":null},{"id":"W2047008089","doi":"10.4208/jcm.1401-m4145","title":"Numerical Studies of a Class of Composite Preconditioners","year":2014,"lang":"en","type":"article","venue":"Journal of Computational Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Composite number; Class (philosophy); Mathematics; Materials science; Computer science; Composite material; Artificial intelligence","score_opus":0.022080776779164406,"score_gpt":0.29507931025078454,"score_spread":0.2729985334716201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047008089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23125161,0.00057932065,0.75154907,0.00048232268,0.00025171827,0.000104413906,0.00007069898,0.00052117754,0.015189664],"genre_scores_gemma":[0.85644615,0.00021387161,0.14085862,0.00006880181,0.00008083682,0.0000877739,0.00006348078,0.000083764986,0.0020967766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995877,0.00012308967,0.000015123614,0.000047625723,0.00017232989,0.00005413971],"domain_scores_gemma":[0.9972274,0.0017610888,0.00023901576,0.0002342475,0.00038203568,0.0001561601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009052951,0.00040993484,0.0005733581,0.0005278551,0.0005431517,0.00062610075,0.0006257491,0.001103303,0.0021464569],"category_scores_gemma":[0.004851488,0.00021601697,0.0004804142,0.000402861,0.0010302941,0.00081542693,0.0007479948,0.0010649064,0.00021761081],"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.00053164986,0.00016911555,0.0034433454,0.00031699854,0.00009555367,0.00042834267,0.00024628165,0.8220966,0.028039545,0.11032742,0.002155624,0.032149486],"study_design_scores_gemma":[0.000020155016,0.000039443505,0.00025282236,0.0000065333365,0.0000065942304,0.000027409093,0.0000144300975,0.9933467,0.002508757,0.0030975277,0.000673269,0.0000064145515],"about_ca_topic_score_codex":0.0014883605,"about_ca_topic_score_gemma":0.0012439573,"teacher_disagreement_score":0.0021464569,"about_ca_system_score_codex":0.00025503512,"about_ca_system_score_gemma":0.000594355,"threshold_uncertainty_score":0.0071805716},"labels":[],"label_agreement":null},{"id":"W2047897503","doi":"10.1016/j.laa.2014.03.007","title":"A note on sign patterns of order 3 that require particular refined inertias","year":2014,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Sign (mathematics); Order (exchange); Combinatorics; Mathematical analysis","score_opus":0.015277474931445295,"score_gpt":0.25351562238259295,"score_spread":0.23823814745114766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047897503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36051333,0.0009149045,0.43688142,0.0049235686,0.004022247,0.00015301479,0.0005677311,0.001992437,0.1900314],"genre_scores_gemma":[0.8227226,0.0007179996,0.13995041,0.0014493925,0.00088262995,0.00010730876,0.0005539759,0.0013178482,0.03229791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993074,0.00012854396,0.00006159513,0.00014710608,0.00019121659,0.00016417756],"domain_scores_gemma":[0.99729425,0.00076728204,0.00023143861,0.0010920044,0.0002841113,0.00033090077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092846225,0.00069459237,0.00086459174,0.00094730087,0.0017596815,0.001978754,0.0011401469,0.0015495723,0.014210598],"category_scores_gemma":[0.006623037,0.00048827537,0.0010832177,0.0009348749,0.0033722713,0.0044966913,0.0019788493,0.0031359522,0.0021836732],"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.00013652451,0.000042232503,0.00084528787,0.00008328386,0.000008658157,0.000557678,0.00042763224,0.0010003223,0.010138908,0.95718753,0.0069837514,0.022588233],"study_design_scores_gemma":[0.000023641353,0.000039828046,0.000623535,0.00002300382,0.000009238383,0.0005219022,0.0001635704,0.004375349,0.0029057309,0.9801239,0.011152778,0.00003743976],"about_ca_topic_score_codex":0.0005727392,"about_ca_topic_score_gemma":0.0011821227,"teacher_disagreement_score":0.014210598,"about_ca_system_score_codex":0.00036184178,"about_ca_system_score_gemma":0.0005419308,"threshold_uncertainty_score":0.047539234},"labels":[],"label_agreement":null},{"id":"W2049085908","doi":"10.1515/advg.2005.5.4.583","title":"Positivity, sums of squares and the multi-dimensional moment problem II","year":2005,"lang":"en","type":"article","venue":"Advances in Geometry","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":45,"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":"Lemma (botany); Mathematics; Section (typography); Algebraic number; Mathematical proof; Moment problem; Moment (physics); Discrete mathematics; Explained sum of squares; Combinatorics; Algebra over a field; Pure mathematics; Mathematical analysis; Computer science; Geometry","score_opus":0.005438372741447335,"score_gpt":0.25057850192739956,"score_spread":0.2451401291859522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049085908","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6231568,0.0025796865,0.2768016,0.0042225714,0.00045095794,0.00006827556,0.00035560803,0.00015103916,0.09221337],"genre_scores_gemma":[0.975831,0.0006384284,0.012055057,0.0002564404,0.00053246453,0.000055896126,0.00017049478,0.00007230599,0.010388037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980564,0.0006476095,0.00009755724,0.0003735841,0.0005159469,0.000308895],"domain_scores_gemma":[0.9940608,0.003416497,0.00071910967,0.00044737954,0.00055883947,0.0007974041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021579638,0.0006009936,0.0010189925,0.0015787054,0.0014667223,0.0032464045,0.0013813325,0.0012515766,0.007970602],"category_scores_gemma":[0.008607997,0.00053098047,0.0009670924,0.0013936037,0.004483468,0.007259994,0.0034541802,0.002769107,0.00072685146],"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.000050531475,0.000017582275,0.00042278832,0.000055227592,0.00001199643,0.00010667674,0.00018674167,0.0032046817,0.000777887,0.9890632,0.0013145255,0.0047882223],"study_design_scores_gemma":[0.000006898516,0.0000176914,0.00043404827,0.000015031918,0.000004537569,0.00018296095,0.00010109664,0.012628285,0.00044072338,0.9848107,0.0013434077,0.000014631397],"about_ca_topic_score_codex":0.00041178448,"about_ca_topic_score_gemma":0.00022783988,"teacher_disagreement_score":0.007970602,"about_ca_system_score_codex":0.0013004763,"about_ca_system_score_gemma":0.00048723785,"threshold_uncertainty_score":0.026664317},"labels":[],"label_agreement":null},{"id":"W2049843373","doi":"10.1155/2007/13749","title":"A Philatelic Excursion with Jeff Hunter in Probability and Matrix Theory","year":2007,"lang":"en","type":"article","venue":"Journal of Applied Mathematics and Decision Sciences","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Excursion; Honour; Presentation (obstetrics); Sociology; Mathematical economics; Mathematics; History; Law; Archaeology; Political science","score_opus":0.01999780260734347,"score_gpt":0.2936935858114335,"score_spread":0.27369578320409005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049843373","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003764529,0.09495573,0.025364988,0.40085518,0.31740415,0.00007972191,0.00060747034,0.0007664936,0.15620172],"genre_scores_gemma":[0.02856782,0.042204246,0.015980653,0.102759235,0.21377203,0.00012226998,0.0003812352,0.0019795282,0.59423304],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983615,0.0005161543,0.000072690054,0.00028099568,0.00065147044,0.00011715206],"domain_scores_gemma":[0.9953876,0.002028643,0.00026963672,0.00024133318,0.0011009275,0.00097195106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016318293,0.0013040756,0.0009181442,0.001598888,0.0038319628,0.003428346,0.0008926917,0.0019886966,0.025162507],"category_scores_gemma":[0.009190506,0.00044167414,0.00072894566,0.001369034,0.0028187113,0.004538029,0.0032059983,0.006400308,0.019138837],"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.000015644726,0.000012658555,0.00006875301,0.000038636004,0.0000058974565,0.00013994363,0.00029805707,0.00006440676,0.00022697184,0.010127458,0.980555,0.008446504],"study_design_scores_gemma":[0.0000021690505,0.000013542882,0.00020528072,0.0000941418,0.000003082178,0.00045240473,0.00027022915,0.00012770237,0.00014757318,0.009438839,0.98923105,0.000013884657],"about_ca_topic_score_codex":0.0012292636,"about_ca_topic_score_gemma":0.002091159,"teacher_disagreement_score":0.025162507,"about_ca_system_score_codex":0.0013398699,"about_ca_system_score_gemma":0.00074968074,"threshold_uncertainty_score":0.08417702},"labels":[],"label_agreement":null},{"id":"W2049871086","doi":"10.1016/j.sysconle.2004.06.008","title":"Iterative least-squares solutions of coupled Sylvester matrix equations","year":2004,"lang":"en","type":"article","venue":"Systems & Control Letters","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":417,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Sylvester matrix; Sylvester equation; Iterative method; Mathematics; Sylvester's law of inertia; Matrix-free methods; Least-squares function approximation; Applied mathematics; Matrix (chemical analysis); Block (permutation group theory); Gauss–Seidel method; Augmented matrix; Mathematical optimization; Algorithm; State-transition matrix; Sparse matrix; Symmetric matrix; Mathematical analysis; Eigenvalues and eigenvectors; Polynomial matrix; Polynomial","score_opus":0.012446075549826869,"score_gpt":0.23674376152197463,"score_spread":0.22429768597214775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049871086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062893284,0.000053542553,0.99198675,0.000055190252,0.000022020684,0.000020965106,0.000021744094,0.00021836394,0.0013320687],"genre_scores_gemma":[0.24715015,0.00030167084,0.7413054,0.00010317339,0.00005945902,0.000211176,0.00022440178,0.0002836761,0.010360901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994105,0.00015090125,0.000032878757,0.00010517381,0.0002498241,0.000050703708],"domain_scores_gemma":[0.99887484,0.00055943854,0.00014535149,0.00012695094,0.00026053487,0.00003286167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063065597,0.00096935057,0.0009267715,0.00045327254,0.00047862355,0.001187121,0.0011971605,0.0012742098,0.0037834349],"category_scores_gemma":[0.003955924,0.00070428615,0.0008158152,0.00078576704,0.00060571596,0.0012873723,0.0013131297,0.0012804997,0.0011985798],"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.00016887201,0.00008903497,0.0007424278,0.0002855593,0.00016189805,0.00013656149,0.00067556475,0.6992423,0.032125648,0.060693435,0.0027859195,0.20289283],"study_design_scores_gemma":[0.000017235936,0.000030007617,0.00015347665,0.000012856252,0.000014133627,0.000032098378,0.000035771907,0.9808944,0.0057588615,0.011501462,0.0015321986,0.000017479935],"about_ca_topic_score_codex":0.0029959932,"about_ca_topic_score_gemma":0.004735998,"teacher_disagreement_score":0.0037834349,"about_ca_system_score_codex":0.00039399133,"about_ca_system_score_gemma":0.0015879787,"threshold_uncertainty_score":0.0126568675},"labels":[],"label_agreement":null},{"id":"W2050187383","doi":"10.1016/s0024-3795(00)00145-2","title":"Numerical range of linear pencils","year":2000,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Numerical range; Mathematics; Hermitian matrix; Numerical analysis; Pencil (optics); Range (aeronautics); Complex matrix; Product (mathematics); Matrix (chemical analysis); Inner product space; Mathematical analysis; Pure mathematics; Geometry; Physics; Optics; Chemistry","score_opus":0.011513744556380606,"score_gpt":0.24848514658954693,"score_spread":0.23697140203316633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050187383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13603672,0.002643093,0.7018675,0.0019232671,0.0005449963,0.000071764945,0.0004380827,0.0010457789,0.15542883],"genre_scores_gemma":[0.90772223,0.0011795015,0.065664135,0.0004247605,0.00039077274,0.000108892054,0.0003668996,0.0003516802,0.023791132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860173,0.0004619341,0.00006944342,0.00019882209,0.0005306707,0.00013741644],"domain_scores_gemma":[0.99520665,0.002943791,0.00034361272,0.00042630793,0.00075358665,0.00032611092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013401161,0.0006995708,0.00064980256,0.0022477242,0.000678143,0.003293241,0.0014353654,0.0009541766,0.015778393],"category_scores_gemma":[0.016661134,0.00034004156,0.00048356247,0.0014193341,0.0024668586,0.0051220693,0.0027097862,0.0023534903,0.0023603803],"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.000094599796,0.00004214471,0.0003811805,0.0001600264,0.000014235139,0.000088511944,0.00016024767,0.019318953,0.0022639565,0.949391,0.0026292074,0.025456058],"study_design_scores_gemma":[0.000015363628,0.000038281203,0.00018732157,0.00005088527,0.000006623574,0.00013908932,0.00006954079,0.09759872,0.0030790851,0.89467233,0.0041146777,0.000028002774],"about_ca_topic_score_codex":0.00029119066,"about_ca_topic_score_gemma":0.00026373597,"teacher_disagreement_score":0.015778393,"about_ca_system_score_codex":0.00062672945,"about_ca_system_score_gemma":0.0004324911,"threshold_uncertainty_score":0.052783966},"labels":[],"label_agreement":null},{"id":"W2050724454","doi":"10.1090/s0025-5718-00-01262-x","title":"Tensor product Gauss-Lobatto points are Fekete points for the cube","year":2000,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Tensor product; Mathematics; Simplex; Tensor (intrinsic definition); Quadrature (astronomy); Pure mathematics; Geometry","score_opus":0.020628212641156888,"score_gpt":0.2670022820283079,"score_spread":0.246374069387151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050724454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07127927,0.00037940074,0.9026431,0.00027550943,0.00014297345,0.000048570146,0.0001247622,0.00033154752,0.024774874],"genre_scores_gemma":[0.6446385,0.0006797491,0.33513093,0.00026947577,0.00011158647,0.00016658285,0.00039134116,0.00074108917,0.017870732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937445,0.0001415984,0.00003313926,0.000093111244,0.00028841753,0.00006936553],"domain_scores_gemma":[0.99869776,0.000399709,0.0001248047,0.00021145532,0.00047228634,0.00009394958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009233882,0.00054871535,0.00054225756,0.0011498355,0.00089939026,0.0024261454,0.0007475416,0.0009098801,0.0061986567],"category_scores_gemma":[0.004722666,0.0003266101,0.00050588505,0.0009272074,0.0021449723,0.002785777,0.0016606901,0.001646102,0.0031229372],"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.00009983033,0.00002057963,0.0006112923,0.00008499666,0.000009892811,0.00009097477,0.00028260465,0.013402302,0.0039508054,0.93830425,0.0022481608,0.040894393],"study_design_scores_gemma":[0.000021080135,0.000051308158,0.00040659288,0.000067510104,0.00001081086,0.00029669708,0.00022801985,0.14880462,0.007959184,0.8215961,0.02051287,0.000045177112],"about_ca_topic_score_codex":0.0012192061,"about_ca_topic_score_gemma":0.0009404845,"teacher_disagreement_score":0.0061986567,"about_ca_system_score_codex":0.00056379975,"about_ca_system_score_gemma":0.0005471621,"threshold_uncertainty_score":0.020736516},"labels":[],"label_agreement":null},{"id":"W2050959344","doi":"10.1007/s10444-011-9173-8","title":"A preconditioning technique for a class of PDE-constrained optimization problems","year":2011,"lang":"en","type":"article","venue":"Advances in Computational Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Preconditioner; Schur complement; Mathematics; Hessian matrix; Saddle point; Applied mathematics; Diagonal; Constraint (computer-aided design); Mathematical optimization; Multigrid method; Saddle; Constrained optimization; Optimization problem; Mathematical analysis; Iterative method; Eigenvalues and eigenvectors; Partial differential equation; Geometry","score_opus":0.021528839247573095,"score_gpt":0.2696847643049171,"score_spread":0.24815592505734402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050959344","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039318358,0.00023972838,0.9922126,0.00015608352,0.00013213466,0.000036616995,0.000042234748,0.00014511877,0.0031035955],"genre_scores_gemma":[0.15343653,0.001361512,0.8345668,0.00028304226,0.0003416895,0.00025856984,0.00026354424,0.0002904319,0.009197905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997403,0.000083600265,0.0000143231755,0.000034883426,0.000102874415,0.000024100054],"domain_scores_gemma":[0.99963105,0.00015132473,0.000037681282,0.00006132279,0.00008129127,0.00003737058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005117501,0.0009061504,0.0006466059,0.0004314725,0.00041975031,0.0004925583,0.00063488225,0.00095686584,0.0037854826],"category_scores_gemma":[0.0019396334,0.00025412394,0.00059260346,0.00071646005,0.00064096815,0.0007210009,0.0010734561,0.0017688298,0.0009893798],"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.0003417009,0.00023229557,0.0005818388,0.00070431986,0.00008560122,0.00075196545,0.0002656377,0.20932914,0.103838675,0.312756,0.018821308,0.35229146],"study_design_scores_gemma":[0.00006014646,0.00015403942,0.0002502346,0.000040917635,0.000030895088,0.00031832623,0.000028847804,0.90427226,0.008586784,0.070904374,0.01532951,0.000023755458],"about_ca_topic_score_codex":0.000725175,"about_ca_topic_score_gemma":0.0011649267,"teacher_disagreement_score":0.0037854826,"about_ca_system_score_codex":0.00016034923,"about_ca_system_score_gemma":0.0005987193,"threshold_uncertainty_score":0.012663722},"labels":[],"label_agreement":null},{"id":"W2051245790","doi":"10.4236/am.2015.62028","title":"Schur Complement Computations in Intel&amp;#174; Math Kernel Library PARDISO","year":2015,"lang":"en","type":"article","venue":"Applied Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Schur complement; Complement (music); Schur's theorem; Computation; Kernel (algebra); Matrix (chemical analysis); Computer science; Mathematics; Parallel computing; Algebra over a field; Algorithm; Combinatorics; Pure mathematics; Eigenvalues and eigenvectors; Chemistry","score_opus":0.04918525836911592,"score_gpt":0.27765127953924373,"score_spread":0.22846602117012782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051245790","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00976021,0.00032251712,0.95188904,0.00017626597,0.00008536274,0.00007972648,0.0009227572,0.017343907,0.019420134],"genre_scores_gemma":[0.116763905,0.00031068127,0.85999054,0.00018167285,0.00006508458,0.00027789964,0.0022882512,0.003259794,0.016862234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991843,0.00012204652,0.000045580327,0.00010676646,0.00042471825,0.000116527495],"domain_scores_gemma":[0.99910647,0.00021789089,0.000059618294,0.00020471863,0.00037026472,0.00004092659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006066591,0.0009338039,0.00082555995,0.0013539109,0.0008243836,0.0017386607,0.001805609,0.0005404091,0.027931208],"category_scores_gemma":[0.0025161086,0.00047007456,0.0007691331,0.0013536807,0.0006677824,0.0022810195,0.0013454305,0.0011672188,0.013049845],"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.00059099967,0.00020226136,0.0011064849,0.0005361865,0.00007209706,0.00026047643,0.00041786052,0.053398024,0.017284887,0.31230298,0.06517669,0.5486509],"study_design_scores_gemma":[0.00014690457,0.00011060327,0.0006762587,0.000104200546,0.000033223634,0.00030289651,0.00010137956,0.7096915,0.046642534,0.11062305,0.13149008,0.00007728071],"about_ca_topic_score_codex":0.004737945,"about_ca_topic_score_gemma":0.008062922,"teacher_disagreement_score":0.027931208,"about_ca_system_score_codex":0.0012770377,"about_ca_system_score_gemma":0.0017131893,"threshold_uncertainty_score":0.09343922},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"not_applicable","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"split"},{"id":"W2051271081","doi":"10.5539/mas.v2n6p124","title":"Study on the GMRES (m) Method of Krylov Subspace and Its Application","year":2008,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Generalized minimal residual method; Krylov subspace; Iterative method; Computer science; Nonlinear system; Projection (relational algebra); Scale (ratio); Mathematics; Mathematical optimization; Nonlinear programming; Subspace topology; Applied mathematics; Algorithm; Artificial intelligence","score_opus":0.036536122406844534,"score_gpt":0.2900708469644943,"score_spread":0.2535347245576498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051271081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006096437,0.0127313435,0.96240324,0.00080850127,0.00033212913,0.000035945814,0.000028689155,0.00012722974,0.017436428],"genre_scores_gemma":[0.34055504,0.04573379,0.58460635,0.0010162964,0.002034374,0.0002879082,0.00024939916,0.00041284863,0.025103902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991035,0.00032208936,0.000043912547,0.0001597254,0.0003227828,0.000047944446],"domain_scores_gemma":[0.99931324,0.00030756945,0.0000472178,0.000057897832,0.00023473345,0.00003946173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011125454,0.0009479025,0.0009979123,0.0009337892,0.00054820377,0.00063802284,0.0007563208,0.0011715523,0.0031313389],"category_scores_gemma":[0.002143497,0.00033951682,0.0009948276,0.00134754,0.001166739,0.0015871252,0.001087491,0.0019723545,0.0010331755],"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.0001096269,0.00008878323,0.0014110089,0.0011179597,0.0001381429,0.0004277638,0.00054945075,0.118862614,0.016738432,0.5908759,0.008919909,0.26076037],"study_design_scores_gemma":[0.00003890403,0.00021924407,0.001095957,0.00020810295,0.000061477585,0.001104717,0.0001500444,0.7227746,0.008506641,0.18202165,0.08370795,0.00011073546],"about_ca_topic_score_codex":0.0019622452,"about_ca_topic_score_gemma":0.000821157,"teacher_disagreement_score":0.0031313389,"about_ca_system_score_codex":0.00043865482,"about_ca_system_score_gemma":0.00086174393,"threshold_uncertainty_score":0.0104753375},"labels":[],"label_agreement":null},{"id":"W2051471495","doi":"10.1016/j.laa.2014.09.010","title":"Companion matrix patterns","year":2014,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Companion matrix; Matrix (chemical analysis); Integer matrix; Matrix analysis; Eigenvalues and eigenvectors; Combinatorics; Block matrix; Square matrix; Diagonal; Property (philosophy); Pure mathematics; Symmetric matrix; Algebra over a field; Nonnegative matrix; Discrete mathematics","score_opus":0.009173830482827203,"score_gpt":0.25128430350781533,"score_spread":0.24211047302498812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051471495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09228783,0.0006712702,0.6620577,0.0014627182,0.0017922086,0.00036521014,0.0031108013,0.0034757121,0.23477666],"genre_scores_gemma":[0.6321117,0.000835193,0.16661432,0.0011093856,0.00096980925,0.000395076,0.0065653,0.0016647516,0.18973446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891686,0.00015759018,0.00007793398,0.00032482648,0.0003855242,0.0001372743],"domain_scores_gemma":[0.9977477,0.00033009,0.00023159044,0.000835489,0.00066233263,0.00019274243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004864886,0.00078362506,0.00077259226,0.002039182,0.0011188138,0.0024891258,0.000935138,0.0012197602,0.05398431],"category_scores_gemma":[0.0055544297,0.0004392961,0.00064021937,0.0021490946,0.0009132709,0.0034697887,0.002016359,0.0014455878,0.016876454],"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.00026095612,0.00014641703,0.0014079977,0.00018981122,0.00003403855,0.000559858,0.00037679903,0.0018677022,0.010219983,0.7656032,0.040232714,0.17910063],"study_design_scores_gemma":[0.00003068535,0.000089848436,0.0009808835,0.000035374378,0.000018397774,0.0014749793,0.0002038437,0.015230133,0.0067500505,0.9014199,0.07372724,0.000038759485],"about_ca_topic_score_codex":0.00033760606,"about_ca_topic_score_gemma":0.0003920272,"teacher_disagreement_score":0.05398431,"about_ca_system_score_codex":0.00037429502,"about_ca_system_score_gemma":0.00052651775,"threshold_uncertainty_score":0.18059552},"labels":[],"label_agreement":null},{"id":"W2052209103","doi":"10.4279/pip.020003","title":"Expansions for eigenfunction and eigenvalues of large-$n$ Toeplitz matrices","year":2010,"lang":"en","type":"article","venue":"Papers in Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Materials Research; Materials Research Science and Engineering Center, Harvard University; Institut Périmètre de physique théorique; University of Chicago; Industry Canada; Government of Canada; National Science Foundation","keywords":"Toeplitz matrix; Eigenvalues and eigenvectors; Eigenfunction; Mathematics; Inverse; Matrix (chemical analysis); Asymptotic expansion; Pure mathematics; Mathematical analysis; Mathematical physics; Physics; Quantum mechanics; Geometry","score_opus":0.00963750193181519,"score_gpt":0.25639786070980614,"score_spread":0.24676035877799093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052209103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025538621,0.00032970228,0.9580538,0.0002524662,0.00012170003,0.00004714925,0.000050273422,0.0001858793,0.015420416],"genre_scores_gemma":[0.4614502,0.0016345577,0.4997456,0.00040492497,0.00028976682,0.00036730478,0.0002563813,0.0008639437,0.034987267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958163,0.00011644827,0.000021362028,0.000049247385,0.00019226082,0.000039182414],"domain_scores_gemma":[0.99848807,0.0008417594,0.00014618834,0.00013710289,0.0002817032,0.00010511262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013088844,0.00083824893,0.00047145406,0.0015868942,0.00061882485,0.00079848716,0.0012151547,0.00084922585,0.004680327],"category_scores_gemma":[0.0052869855,0.0004300001,0.0008284828,0.00041693504,0.0017856633,0.0023803874,0.0010990257,0.0019477134,0.0014893564],"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.00002509801,0.000042000243,0.00040126653,0.00013413571,0.000011743776,0.00024641544,0.00038934077,0.07388058,0.010646163,0.8972872,0.002262472,0.014673512],"study_design_scores_gemma":[0.00000888145,0.00002288088,0.00025941333,0.000057015583,0.000005293064,0.00014593678,0.000103490696,0.6812338,0.0028801474,0.31150496,0.0037390736,0.00003905074],"about_ca_topic_score_codex":0.0010196773,"about_ca_topic_score_gemma":0.0019585448,"teacher_disagreement_score":0.004680327,"about_ca_system_score_codex":0.0006818622,"about_ca_system_score_gemma":0.0006803909,"threshold_uncertainty_score":0.015657306},"labels":[],"label_agreement":null},{"id":"W2053136965","doi":"10.1016/s0024-3795(01)00533-x","title":"A characterization of commutators of idempotents","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Mathematics; Commutator; Characterization (materials science); Pure mathematics; Operator (biology); Property (philosophy); Element (criminal law); Discrete mathematics; Combinatorics; Algebra over a field; Physics","score_opus":0.01412529616963823,"score_gpt":0.22908626704259905,"score_spread":0.21496097087296082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053136965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26666957,0.001291979,0.65762025,0.0010164131,0.0007002346,0.00009752002,0.00034001106,0.00044110985,0.07182289],"genre_scores_gemma":[0.87711155,0.0010134998,0.090799734,0.0007920498,0.001283314,0.00021975694,0.00049606705,0.0005138543,0.027770225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760914,0.00056468986,0.00021350425,0.0006990501,0.0005761921,0.00033746037],"domain_scores_gemma":[0.99352527,0.0034108358,0.0006758606,0.00063580205,0.0010465158,0.00070577435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030872386,0.0010250991,0.0011202508,0.0026230824,0.0023095312,0.004120764,0.00164049,0.0014422155,0.007990942],"category_scores_gemma":[0.006994923,0.0007746816,0.0011574515,0.002205876,0.0047650198,0.007634735,0.002784765,0.0032327732,0.0015888611],"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.000050754228,0.00003594767,0.00035113134,0.000026906775,0.000008391168,0.00012518236,0.00047029404,0.00017527693,0.0023121866,0.9888681,0.0009252063,0.006650523],"study_design_scores_gemma":[0.000018104434,0.000046501995,0.00019107756,0.000017216851,0.000012540144,0.00029340317,0.0001397656,0.0027912045,0.0022784593,0.98861724,0.0055710436,0.000023355393],"about_ca_topic_score_codex":0.00024693814,"about_ca_topic_score_gemma":0.00024385726,"teacher_disagreement_score":0.007990942,"about_ca_system_score_codex":0.0007789325,"about_ca_system_score_gemma":0.0006178357,"threshold_uncertainty_score":0.026732385},"labels":[],"label_agreement":null},{"id":"W2053250875","doi":"10.1016/s0024-3795(00)00312-8","title":"On Perron complements of totally nonnegative matrices","year":2001,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Complement (music); Schur complement; Quotient; Nonnegative matrix; Combinatorics; Matrix (chemical analysis); Pure mathematics; Symmetric matrix; Eigenvalues and eigenvectors","score_opus":0.014140774311434259,"score_gpt":0.26867429942917376,"score_spread":0.2545335251177395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053250875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2754383,0.0028801833,0.5360563,0.0023150132,0.0010809859,0.00009788575,0.000732963,0.00042216227,0.18097623],"genre_scores_gemma":[0.8334377,0.00304424,0.09185654,0.0013741534,0.0010346551,0.00023432296,0.0011208536,0.0004478643,0.06744958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981712,0.000749055,0.00006134523,0.00023092573,0.0005237569,0.0002636294],"domain_scores_gemma":[0.9926623,0.004355032,0.000752581,0.00034488545,0.0010224268,0.0008628067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024464733,0.0017338763,0.0018296901,0.0033318268,0.002310784,0.003964663,0.002044593,0.0016663483,0.011815086],"category_scores_gemma":[0.010654929,0.0009430332,0.0013932129,0.0029736045,0.0048396373,0.006830001,0.0037438835,0.002805403,0.0019299163],"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.000106642954,0.000038101705,0.00016692783,0.000076755874,0.0000125338875,0.0000975345,0.00016858126,0.0041305446,0.00058369036,0.9848867,0.0026751026,0.0070568444],"study_design_scores_gemma":[0.000013616403,0.000023191526,0.00013484778,0.00003863034,0.000008979387,0.00009082456,0.000086049375,0.024616893,0.0003422473,0.9722696,0.002351665,0.000023335086],"about_ca_topic_score_codex":0.0023213485,"about_ca_topic_score_gemma":0.0030444032,"teacher_disagreement_score":0.011815086,"about_ca_system_score_codex":0.0012919712,"about_ca_system_score_gemma":0.00094030134,"threshold_uncertainty_score":0.03952545},"labels":[],"label_agreement":null},{"id":"W2053441619","doi":"10.1016/j.laa.2014.07.040","title":"A completely PPT map","year":2014,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Transpose; Mathematics; Positive-definite matrix; Matrix (chemical analysis); Combinatorics; Pure mathematics; Chemistry; Eigenvalues and eigenvectors; Physics; Quantum mechanics; Chromatography","score_opus":0.012435459318088352,"score_gpt":0.24027020426280343,"score_spread":0.2278347449447151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053441619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120472364,0.00087501935,0.48081714,0.0075334013,0.0025337257,0.0002354575,0.0014944676,0.0025105744,0.38352787],"genre_scores_gemma":[0.67647386,0.00091574737,0.034313105,0.0022299804,0.0015262229,0.000318362,0.0009440989,0.0010552171,0.28222334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875724,0.00016472579,0.000041386098,0.00037239463,0.00036374765,0.00030043212],"domain_scores_gemma":[0.9990947,0.00022761275,0.00007071343,0.00016970957,0.00021226081,0.00022503565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057967193,0.0010694732,0.00084139506,0.0013727596,0.0024533044,0.0034048546,0.000817019,0.0015616897,0.025408233],"category_scores_gemma":[0.0021433982,0.0004958466,0.0010372106,0.0009622561,0.0024397634,0.0057474445,0.004838799,0.0040271957,0.006713628],"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.00006751637,0.000039214458,0.000090740024,0.000039964638,0.000012649718,0.00008625672,0.00013502828,0.0005076064,0.0019357504,0.9793371,0.005314361,0.012433798],"study_design_scores_gemma":[0.00001648277,0.000043944412,0.00015454396,0.0000127407375,0.000011820464,0.00022060749,0.000072410505,0.0031100127,0.0027938911,0.9764682,0.01707523,0.000020092546],"about_ca_topic_score_codex":0.0003644799,"about_ca_topic_score_gemma":0.00015160655,"teacher_disagreement_score":0.025408233,"about_ca_system_score_codex":0.000897371,"about_ca_system_score_gemma":0.0010190561,"threshold_uncertainty_score":0.084999025},"labels":[],"label_agreement":null},{"id":"W2054095765","doi":"10.1007/s00233-002-0012-6","title":"Irreducible semigroups of matrices with eigenvalue one","year":2003,"lang":"en","type":"article","venue":"Semigroup Forum","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Semigroup; Eigenvalues and eigenvectors; Special classes of semigroups; Matrix (chemical analysis); Pure mathematics; Property (philosophy); Algebra over a field; Combinatorics","score_opus":0.009478759869795184,"score_gpt":0.2129731526166595,"score_spread":0.20349439274686432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054095765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2986959,0.00083302526,0.6140432,0.0016735597,0.00095461914,0.00013056854,0.0005583783,0.0010756112,0.08203525],"genre_scores_gemma":[0.8894772,0.0004905504,0.06890744,0.0003762169,0.0008300596,0.00023736134,0.00051145075,0.00024893408,0.038920663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979603,0.00057649997,0.00010770843,0.00038463675,0.0006035011,0.00036733024],"domain_scores_gemma":[0.9943159,0.0026197443,0.00056400464,0.0006440048,0.00083901675,0.0010174357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019378158,0.00088073633,0.0009444904,0.0022228782,0.00217833,0.0037683984,0.0010982084,0.0009991637,0.01250318],"category_scores_gemma":[0.0068482715,0.00057149597,0.0010808454,0.0009840244,0.0023278124,0.0039105495,0.0023243155,0.002144363,0.0019634818],"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.000051277002,0.000032335774,0.00013608002,0.000023132488,0.0000046457526,0.00008596385,0.00038419338,0.0004065512,0.0011601115,0.99256825,0.0010990032,0.0040484536],"study_design_scores_gemma":[0.000019045829,0.000029589424,0.0001273556,0.000010295032,0.000004769142,0.00014312421,0.00009204943,0.0042298236,0.00069194805,0.99211335,0.0025228807,0.000015759804],"about_ca_topic_score_codex":0.0002499512,"about_ca_topic_score_gemma":0.00028504958,"teacher_disagreement_score":0.01250318,"about_ca_system_score_codex":0.0007111866,"about_ca_system_score_gemma":0.0007075341,"threshold_uncertainty_score":0.04182732},"labels":[],"label_agreement":null},{"id":"W2055256112","doi":"10.1016/j.laa.2012.06.040","title":"Generalization of Mirsky’s theorem on diagonals and eigenvalues of matrices","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Eigenvalues and eigenvectors; Generalization; Diagonal; Combinatorics; Diagonal matrix; Matrix (chemical analysis); Field (mathematics); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.014621879223927683,"score_gpt":0.2636632607637532,"score_spread":0.2490413815398255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055256112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034071192,0.0017192421,0.88114065,0.0021976223,0.0011749872,0.00005008192,0.00041140453,0.00038613103,0.07884863],"genre_scores_gemma":[0.70837414,0.0037078166,0.22610626,0.003131508,0.0037661649,0.00022038352,0.000616606,0.0006665905,0.053410538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988663,0.00025303953,0.000058775215,0.00036609394,0.0003498906,0.00010590875],"domain_scores_gemma":[0.9978225,0.00086312665,0.00019312528,0.00040690985,0.0005729394,0.00014124656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012949827,0.0008296821,0.0008415077,0.0024514825,0.0011628757,0.0020125802,0.00117084,0.000989815,0.008304331],"category_scores_gemma":[0.0061209616,0.0004889929,0.0010454376,0.0015625138,0.0028059753,0.0052179126,0.0026225995,0.0028632747,0.002548103],"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.0000313027,0.000021206763,0.00020445396,0.00007284081,0.000014411104,0.00005498497,0.00025020403,0.0019789154,0.0019203504,0.974271,0.004132252,0.017048111],"study_design_scores_gemma":[0.000005899008,0.000016076005,0.00018253061,0.000016776672,0.0000053035583,0.00008929763,0.00004536056,0.0076086894,0.0006232555,0.98308015,0.008309088,0.00001759455],"about_ca_topic_score_codex":0.00089370535,"about_ca_topic_score_gemma":0.0006868214,"teacher_disagreement_score":0.008304331,"about_ca_system_score_codex":0.00063288654,"about_ca_system_score_gemma":0.00057383755,"threshold_uncertainty_score":0.027780771},"labels":[],"label_agreement":null},{"id":"W2055857927","doi":"10.1063/1.1571659","title":"Tensor operators and constructing indecomposable representations of semidirect product groups","year":2003,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Toronto","funders":"","keywords":"Semidirect product; Indecomposable module; Tensor product; Mathematics; Group (periodic table); Tensor (intrinsic definition); Algebra over a field; Pure mathematics; Product (mathematics); Representation (politics); Operator (biology); Wreath product; Irreducible representation; Physics; Quantum mechanics; Geometry; Chemistry","score_opus":0.01705191441784482,"score_gpt":0.268938287227369,"score_spread":0.2518863728095242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055857927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47275582,0.000327804,0.50658184,0.00052466075,0.000103026985,0.000087274326,0.000063011874,0.00035608266,0.019200569],"genre_scores_gemma":[0.73717755,0.0002330758,0.25541198,0.00011730074,0.00008543134,0.00009172659,0.0001594353,0.00011553702,0.0066079684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986671,0.0004569338,0.00009804294,0.00020920234,0.0003643748,0.00020424025],"domain_scores_gemma":[0.9982864,0.00064127037,0.00021376048,0.00037711594,0.00018629839,0.00029514282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020152107,0.00075095205,0.00062126666,0.0014726367,0.001385073,0.0018068873,0.0009944324,0.0007161143,0.0022793293],"category_scores_gemma":[0.0031915864,0.0005579399,0.0009880014,0.0010039968,0.0034647489,0.0043783123,0.003011812,0.0015972522,0.00042429188],"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.0000767266,0.00005877741,0.00051943795,0.000051421248,0.000012039558,0.00021932335,0.0012620478,0.0026757189,0.004826035,0.97516304,0.00044906672,0.014686298],"study_design_scores_gemma":[0.000017301227,0.00006198993,0.000104816885,0.00001701824,0.000009366375,0.00013683886,0.00028564932,0.015166622,0.005689515,0.9754723,0.0030207017,0.000017838074],"about_ca_topic_score_codex":0.00029803658,"about_ca_topic_score_gemma":0.00041854187,"teacher_disagreement_score":0.0022793293,"about_ca_system_score_codex":0.00069507345,"about_ca_system_score_gemma":0.00051555235,"threshold_uncertainty_score":0.0106576085},"labels":[],"label_agreement":null},{"id":"W2056013740","doi":"10.1007/s10955-012-0585-8","title":"Further Implications of the Bessis–Moussa–Villani Conjecture","year":2012,"lang":"en","type":"article","venue":"Journal of Statistical Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Conjecture; Hermitian matrix; Laplace transform; Measure (data warehouse); Function (biology); Mathematics; Mathematical physics; Pure mathematics; Physics; Combinatorics; Mathematical analysis; Computer science","score_opus":0.013381917026548932,"score_gpt":0.2685754690536366,"score_spread":0.25519355202708766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056013740","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27956873,0.007866104,0.13031742,0.1381761,0.0054512434,0.00007479115,0.00086451386,0.00056559197,0.4371155],"genre_scores_gemma":[0.9321597,0.0024925992,0.013272852,0.005223217,0.0049585816,0.00005688529,0.00046300478,0.00021089602,0.041162293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987924,0.0004235871,0.000038341677,0.00022868121,0.00031236687,0.00020470016],"domain_scores_gemma":[0.991742,0.0048847124,0.0006777949,0.0010314288,0.0009802788,0.0006837421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024591954,0.0007641733,0.0016517217,0.0020052372,0.0032462163,0.0028719532,0.0021367446,0.0031484566,0.028489955],"category_scores_gemma":[0.018625814,0.00043917133,0.0009726273,0.0015550392,0.005189233,0.008727849,0.0036513207,0.004750914,0.0021139293],"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.000031200478,0.000019569876,0.00022720956,0.000029058257,0.0000046055306,0.000080505895,0.00009908024,0.0006343482,0.00023518824,0.9909368,0.0045946226,0.0031076842],"study_design_scores_gemma":[0.000007089462,0.0000033890526,0.00016568339,0.0000062093272,0.0000014366584,0.000040403265,0.000040073857,0.002302516,0.000043732405,0.9958584,0.0015251196,0.000006024936],"about_ca_topic_score_codex":0.002679479,"about_ca_topic_score_gemma":0.0020006285,"teacher_disagreement_score":0.028489955,"about_ca_system_score_codex":0.001395673,"about_ca_system_score_gemma":0.00097554515,"threshold_uncertainty_score":0.09530836},"labels":[],"label_agreement":null},{"id":"W2056167539","doi":"10.2514/1.34810","title":"Parallel Newton-Krylov Solver for the Euler equations Discretized Using Simultaneous Approximation Terms","year":2008,"lang":"en","type":"article","venue":"AIAA Journal","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":147,"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 Toronto","funders":"","keywords":"Discretization; Solver; Backward Euler method; Euler's formula; Applied mathematics; Euler equations; Mathematics; Semi-implicit Euler method; Euler method; Newton's method; Mathematical analysis; Computer science; Physics; Mathematical optimization; Nonlinear system","score_opus":0.04111804146867975,"score_gpt":0.27706368555515015,"score_spread":0.2359456440864704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056167539","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020287825,0.000088675464,0.9677472,0.00011072315,0.0000477058,0.00007090472,0.00016688176,0.0008486132,0.010631389],"genre_scores_gemma":[0.2277091,0.00020820346,0.7509264,0.00005935677,0.000051409042,0.0003489869,0.0005812886,0.00038910683,0.019726165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976915,0.000047423284,0.0000114563245,0.00002437582,0.00012361273,0.000024040675],"domain_scores_gemma":[0.9996971,0.00011311975,0.000040061714,0.000051804913,0.00008169636,0.000016200202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002924585,0.0006045705,0.00081523624,0.00031784255,0.00059158826,0.0004770558,0.00067879475,0.00053052773,0.007460329],"category_scores_gemma":[0.00097073964,0.00031970092,0.00051148114,0.0005460297,0.00030510215,0.0005824418,0.00079107116,0.00083386415,0.0020394993],"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.00017374799,0.00012900519,0.0018561261,0.0002866499,0.00007495212,0.00029283218,0.00026262598,0.6987747,0.02754545,0.074710615,0.0074881357,0.1884051],"study_design_scores_gemma":[0.000023506002,0.000018331126,0.00012172914,0.000004535671,0.000005048286,0.000043970645,0.000013725059,0.9884476,0.0034138367,0.0035759495,0.0043261214,0.00000555792],"about_ca_topic_score_codex":0.005821099,"about_ca_topic_score_gemma":0.009190545,"teacher_disagreement_score":0.007460329,"about_ca_system_score_codex":0.0004758754,"about_ca_system_score_gemma":0.0025075567,"threshold_uncertainty_score":0.0249573},"labels":[],"label_agreement":null},{"id":"W2056300772","doi":"10.1016/j.laa.2013.02.034","title":"Eigenvalue and spectral intervals for a nonlinear algebraic system","year":2013,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"University of Glasgow","keywords":"Mathematics; Eigenvalues and eigenvectors; Resolvent; Multiplicity (mathematics); Algebraic number; Nonlinear system; Operator (biology); Spectrum (functional analysis); Matrix (chemical analysis); Boundary value problem; Mathematical analysis; Pure mathematics; Applied mathematics","score_opus":0.011204073969654279,"score_gpt":0.24267597444144162,"score_spread":0.23147190047178734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056300772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38834682,0.0009116469,0.56844723,0.0010946039,0.00019860348,0.000043855114,0.0002772999,0.00043419402,0.040245764],"genre_scores_gemma":[0.9702069,0.0002708352,0.02409776,0.00006230803,0.00017310475,0.00005321661,0.0000990138,0.000083004066,0.004953886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944586,0.00015458444,0.000030693613,0.000088494984,0.00019947751,0.00008090617],"domain_scores_gemma":[0.99580127,0.00270924,0.0005060086,0.00018092399,0.0004842913,0.00031812617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010526031,0.00064214575,0.0005862874,0.0020755779,0.00083825213,0.0016778527,0.001022679,0.0006414182,0.0061990474],"category_scores_gemma":[0.0061108638,0.00026431115,0.00036579013,0.00082335126,0.0015367783,0.0020705746,0.001273938,0.0011143942,0.00052339665],"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.00016078803,0.00006643623,0.00058288936,0.00007210016,0.000016613225,0.00013520264,0.00047106773,0.018433265,0.004543291,0.9569958,0.0013924908,0.017130135],"study_design_scores_gemma":[0.000019962989,0.000040316037,0.0006045449,0.000019195326,0.000007838604,0.00013963241,0.00017427621,0.19259241,0.0011220897,0.80409443,0.0011510351,0.000034267603],"about_ca_topic_score_codex":0.0004943961,"about_ca_topic_score_gemma":0.00032074994,"teacher_disagreement_score":0.0061990474,"about_ca_system_score_codex":0.00056765834,"about_ca_system_score_gemma":0.00032989535,"threshold_uncertainty_score":0.020737946},"labels":[],"label_agreement":null},{"id":"W2056352329","doi":"10.1080/15326340600649045","title":"Spectral Polynomial Algorithms for Computing Bi-Diagonal Representations for Phase Type Distributions and Matrix-Exponential Distributions","year":2006,"lang":"en","type":"article","venue":"Stochastic Models","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Chinese Academy of Sciences","keywords":"Mathematics; Diagonal; Exponential function; Type (biology); Diagonal matrix; Matrix exponential; Phase-type distribution; Matrix (chemical analysis); Matrix polynomial; Exponential type; Polynomial; Algorithm; Combinatorics; Algebra over a field; Mathematical analysis; Pure mathematics; Exponential distribution; Geometry; Statistics","score_opus":0.027546449479200607,"score_gpt":0.3163973006700832,"score_spread":0.2888508511908826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056352329","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028766964,0.000051184565,0.99592674,0.00005914044,0.000016499063,0.0000231845,0.000028577128,0.00026922784,0.00074878143],"genre_scores_gemma":[0.14933777,0.0002546298,0.84648126,0.00012533848,0.00011117015,0.00020348286,0.00036977924,0.00024759432,0.0028689266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875593,0.00034948462,0.00007231572,0.00020500369,0.00043667064,0.00018059157],"domain_scores_gemma":[0.9955888,0.002460081,0.0002741703,0.0008636717,0.0006473913,0.00016593341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001622444,0.0009999983,0.00081140763,0.0018551897,0.00085454213,0.001815082,0.0017523558,0.0010726715,0.0058123996],"category_scores_gemma":[0.011995199,0.00039365643,0.0009990694,0.0018959788,0.0011704604,0.0037276414,0.0020747406,0.0023844198,0.0022204407],"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.00018806526,0.00023421622,0.0008947986,0.00018678591,0.00004880054,0.00007409102,0.00019998575,0.15729591,0.0033929786,0.48818517,0.0048203305,0.3444788],"study_design_scores_gemma":[0.000033361568,0.000035210636,0.00013342171,0.0000129589525,0.000008982211,0.000058440193,0.000046572633,0.712763,0.002035232,0.28288862,0.001965085,0.000019048191],"about_ca_topic_score_codex":0.001980185,"about_ca_topic_score_gemma":0.002895609,"teacher_disagreement_score":0.0058123996,"about_ca_system_score_codex":0.0011697542,"about_ca_system_score_gemma":0.001662245,"threshold_uncertainty_score":0.019444466},"labels":[],"label_agreement":null},{"id":"W2056707245","doi":"10.1002/nla.258","title":"On the growth factor in Gaussian elimination for generalized Higham matrices","year":2002,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Gaussian elimination; Hermitian matrix; Mathematics; Positive-definite matrix; Matrix (chemical analysis); Gaussian; Combinatorics; Class (philosophy); Factor (programming language); Upper and lower bounds; Pure mathematics; Mathematical analysis; Physics; Computer science; Chemistry; Computational chemistry","score_opus":0.01661374818348609,"score_gpt":0.2450198333137332,"score_spread":0.2284060851302471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056707245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20453547,0.0018964815,0.7575524,0.0022384063,0.00042718532,0.000106162384,0.0001350805,0.00073143176,0.032377314],"genre_scores_gemma":[0.90886915,0.0012544246,0.075679965,0.0005004446,0.0003072659,0.00015729462,0.00019571657,0.0004493878,0.012586391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977963,0.00092307414,0.000053844313,0.00014605878,0.0007912375,0.00028943922],"domain_scores_gemma":[0.9787139,0.016023451,0.0010213937,0.0012485922,0.0022703493,0.000722311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040423316,0.0011683049,0.0008322928,0.0013093443,0.0012091785,0.0014478423,0.0009971011,0.0010992509,0.005591102],"category_scores_gemma":[0.029121669,0.00035910393,0.000590584,0.0008319835,0.003661128,0.0031888478,0.002272069,0.0021319857,0.0014002803],"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.00047226108,0.00008507443,0.0026350962,0.00021551263,0.000038582762,0.00045551072,0.0004094392,0.08486697,0.00749488,0.8528371,0.008316772,0.042172916],"study_design_scores_gemma":[0.000038315648,0.00009801802,0.0005205221,0.000076309065,0.00001585285,0.00031346505,0.000086893735,0.577813,0.0071844724,0.4102465,0.0035461674,0.000060388935],"about_ca_topic_score_codex":0.0023781813,"about_ca_topic_score_gemma":0.0022777533,"teacher_disagreement_score":0.005591102,"about_ca_system_score_codex":0.0011549598,"about_ca_system_score_gemma":0.00095894944,"threshold_uncertainty_score":0.0213781},"labels":[],"label_agreement":null},{"id":"W2057980100","doi":"10.1177/109434200101500106","title":"Parallel Implementation and Practical Use of Sparse Approximate Inverse Preconditioners with a Priori Sparsity Patterns","year":2001,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":107,"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":"Lawrence Livermore National Laboratory; University of Waterloo; Microsoft; U.S. Department of Energy","keywords":"Inverse; Sparse matrix; Computation; Computer science; Minification; Matrix (chemical analysis); Norm (philosophy); Algorithm; Numbering; A priori and a posteriori; Mathematical optimization; Code (set theory); Parallel computing; Mathematics","score_opus":0.030757544522088925,"score_gpt":0.2976504321479393,"score_spread":0.2668928876258504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057980100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080588296,0.00012063261,0.90772784,0.00032492238,0.00003423865,0.0001287059,0.000053704513,0.0027583602,0.008263336],"genre_scores_gemma":[0.42945597,0.00015862714,0.56683487,0.000049428087,0.00002984031,0.00018465058,0.00015511844,0.00035091722,0.0027804933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991891,0.00023371037,0.000029598508,0.00007673697,0.00037533155,0.00009557814],"domain_scores_gemma":[0.9977906,0.0011876505,0.00014591412,0.000483573,0.00032696605,0.00006527439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010487995,0.00069996127,0.00062843534,0.00041830374,0.00073652994,0.0006388111,0.0011081684,0.00081213634,0.0024035126],"category_scores_gemma":[0.005778145,0.00033382126,0.00035040002,0.0005111273,0.00084109773,0.00096065627,0.00094062026,0.00076351344,0.00063357333],"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.00048352513,0.00034146715,0.0026924137,0.00027633674,0.000056935754,0.0004493017,0.0005267678,0.6102651,0.04503473,0.044257835,0.004679383,0.29093617],"study_design_scores_gemma":[0.000080100086,0.000118615775,0.0002653316,0.0000103978045,0.000012406411,0.000101402205,0.0000470881,0.9586243,0.027117651,0.0090990765,0.0045106737,0.000012928658],"about_ca_topic_score_codex":0.0034047945,"about_ca_topic_score_gemma":0.0037493154,"teacher_disagreement_score":0.0034047945,"about_ca_system_score_codex":0.0005260219,"about_ca_system_score_gemma":0.0011132933,"threshold_uncertainty_score":0.008040607},"labels":[],"label_agreement":null},{"id":"W2058729111","doi":"10.1016/s0024-3795(02)00540-2","title":"A rank criterion for the order of a pole of a matrix function","year":2003,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Meromorphic function; Rank (graph theory); Order (exchange); Matrix (chemical analysis); Function (biology); Applied mathematics; Matrix function; Augmented matrix; Pure mathematics; Square matrix; Combinatorics; Symmetric matrix; Eigenvalues and eigenvectors","score_opus":0.01185558295670634,"score_gpt":0.26533912986863817,"score_spread":0.2534835469119318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058729111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17810605,0.0005630576,0.78960866,0.0011045454,0.00034405797,0.000090946494,0.0004955997,0.0008980615,0.028789021],"genre_scores_gemma":[0.86944205,0.00047198098,0.113726474,0.0004005681,0.0007539085,0.000073042786,0.0005031619,0.00047515187,0.014153672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987771,0.00034078432,0.000070754075,0.00018778072,0.00044202266,0.00018161666],"domain_scores_gemma":[0.9891589,0.005408489,0.00090769137,0.0011274156,0.002251959,0.0011454674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020511632,0.00096575357,0.00083726103,0.0028389127,0.0011792021,0.0026587625,0.00095143134,0.0015927249,0.0073947525],"category_scores_gemma":[0.012040522,0.000484661,0.00062073284,0.0007811297,0.0026779799,0.0033695018,0.0014273517,0.0023616394,0.0022653737],"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.00084933086,0.00015515988,0.0037558693,0.00027822657,0.000036760055,0.00077651086,0.00069933914,0.020646764,0.06432891,0.84224504,0.008225711,0.058002472],"study_design_scores_gemma":[0.00009726957,0.0005807264,0.0023335135,0.00011143909,0.000054502485,0.0011917943,0.00042638383,0.14952557,0.022668961,0.81018263,0.012645962,0.00018120912],"about_ca_topic_score_codex":0.0006509784,"about_ca_topic_score_gemma":0.0006634694,"teacher_disagreement_score":0.0073947525,"about_ca_system_score_codex":0.0006048019,"about_ca_system_score_gemma":0.0007697109,"threshold_uncertainty_score":0.024737954},"labels":[],"label_agreement":null},{"id":"W2059421710","doi":"10.5539/jmr.v6n3p91","title":"Computing Outer Inverses Using Complete Orthogonal Factorizations","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Singular value decomposition; Mathematics; QR decomposition; Rank (graph theory); Matrix decomposition; Orthogonal matrix; Matrix (chemical analysis); Inverse; Triangular matrix; Representation (politics); Decomposition; Algebra over a field; Applied mathematics; Combinatorics; Algorithm; Pure mathematics; Invertible matrix; Eigenvalues and eigenvectors; Geometry; Orthogonal basis","score_opus":0.1895481065322302,"score_gpt":0.3982488366910253,"score_spread":0.2087007301587951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059421710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004554966,0.00009078137,0.992998,0.000035796125,0.00002785647,0.000019921512,0.000061749495,0.00024812247,0.0019627167],"genre_scores_gemma":[0.13035087,0.00044848848,0.8615133,0.00009562902,0.0000839589,0.00012599998,0.00059144874,0.00032341472,0.006466851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992949,0.00019173534,0.000036835765,0.000100754434,0.00029572932,0.000079983074],"domain_scores_gemma":[0.99878484,0.0004744557,0.00011579477,0.0002654768,0.00028535226,0.000073970536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010173547,0.001333142,0.00096784445,0.0010379159,0.0004651069,0.0017303267,0.00081968517,0.00074969535,0.005783456],"category_scores_gemma":[0.0042456514,0.00045359173,0.000948123,0.00091343315,0.0010305818,0.002040036,0.0016406204,0.0013146857,0.0023073712],"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.00018529074,0.0001266169,0.0006399555,0.0003540005,0.000079005455,0.0002388818,0.00035151112,0.34986788,0.016493445,0.3082586,0.008577025,0.31482783],"study_design_scores_gemma":[0.000017362861,0.000070435504,0.00015150782,0.000023420504,0.000009794733,0.00008380888,0.00006875625,0.91879433,0.003798961,0.071295984,0.005657005,0.000028659299],"about_ca_topic_score_codex":0.0016653974,"about_ca_topic_score_gemma":0.0022505587,"teacher_disagreement_score":0.005783456,"about_ca_system_score_codex":0.0003268157,"about_ca_system_score_gemma":0.0009014828,"threshold_uncertainty_score":0.019347608},"labels":[],"label_agreement":null},{"id":"W2060293964","doi":"10.1016/j.jfa.2014.05.003","title":"Sums of orthogonal projections","year":2014,"lang":"en","type":"article","venue":"Journal of Functional Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council","keywords":"Mathematics; Injective function; TRACE (psycholinguistics); Operator (biology); Hilbert space; Nuclear operator; Trace class; Uniqueness; Discrete mathematics; Closure (psychology); Norm (philosophy); Pure mathematics; Combinatorics; Integer (computer science); Banach space; Finite-rank operator; Mathematical analysis","score_opus":0.010740405428352197,"score_gpt":0.22239954265322406,"score_spread":0.21165913722487187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060293964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042810652,0.0014714221,0.8808674,0.0009326816,0.0013602488,0.00008800821,0.00043583201,0.00047720593,0.07155663],"genre_scores_gemma":[0.47493485,0.0042790934,0.37095463,0.0011925087,0.0023517096,0.00046225975,0.0017580491,0.0016187191,0.14244817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975979,0.00074372714,0.00016815438,0.00048389292,0.00082891405,0.0001774412],"domain_scores_gemma":[0.9965791,0.0012088134,0.00025689745,0.00055391504,0.0009893617,0.00041190098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018224518,0.0015389945,0.0012105573,0.0029394666,0.0013338361,0.0040553217,0.001241776,0.0013323816,0.017372344],"category_scores_gemma":[0.007961366,0.00092506176,0.0015588179,0.0018872225,0.002511097,0.0045695435,0.0044967975,0.0028870488,0.00349958],"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.000050901086,0.0000415695,0.00019027847,0.000075968426,0.000050310802,0.000047673897,0.00010474618,0.0019306493,0.0029477037,0.95758015,0.003319926,0.0336601],"study_design_scores_gemma":[0.0000106417965,0.000030188168,0.00036959373,0.000032785516,0.000027895645,0.00033413485,0.000075710435,0.02992218,0.0020596606,0.95809996,0.008998953,0.0000382338],"about_ca_topic_score_codex":0.0002984102,"about_ca_topic_score_gemma":0.000379754,"teacher_disagreement_score":0.017372344,"about_ca_system_score_codex":0.00048158105,"about_ca_system_score_gemma":0.0008708614,"threshold_uncertainty_score":0.058116257},"labels":[],"label_agreement":null},{"id":"W2061177641","doi":"10.1145/1940475.1940493","title":"On sparse interpolation over finite fields","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Simon Fraser University","funders":"","keywords":"Interpolation (computer graphics); Computer science; Mathematics; Finite field; Applied mathematics; Algorithm; Artificial intelligence; Discrete mathematics","score_opus":0.05602838422521382,"score_gpt":0.28940966552503694,"score_spread":0.2333812812998231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061177641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047204673,0.002692036,0.8510282,0.0022679747,0.0009061462,0.00008918255,0.0007145379,0.0008153897,0.094281875],"genre_scores_gemma":[0.61949915,0.007509734,0.27917653,0.0010409844,0.0022733072,0.00020884318,0.0030799026,0.0007234825,0.086488076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946684,0.00019177784,0.000019548303,0.00006091209,0.00018448461,0.00007655827],"domain_scores_gemma":[0.9979658,0.0012759494,0.0000900559,0.00036658978,0.0002106589,0.00009093055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009661539,0.0006256561,0.0008834389,0.0015915063,0.00064627745,0.0007162833,0.0006600117,0.00060738664,0.016345479],"category_scores_gemma":[0.0045747478,0.00025929295,0.00040905844,0.0024863307,0.0012415425,0.002462322,0.0022623902,0.0019529476,0.0025778017],"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.00030965602,0.00008011849,0.00061948627,0.00027365203,0.00003740299,0.00014153121,0.00019279934,0.0410188,0.003328951,0.7168009,0.026066937,0.21112974],"study_design_scores_gemma":[0.000029030636,0.000073821204,0.00029852317,0.0000804421,0.0000119664155,0.0001387236,0.00006678858,0.14212655,0.0018836672,0.83441013,0.020863375,0.00001702145],"about_ca_topic_score_codex":0.0012498046,"about_ca_topic_score_gemma":0.0018674922,"teacher_disagreement_score":0.016345479,"about_ca_system_score_codex":0.00053733785,"about_ca_system_score_gemma":0.00046410706,"threshold_uncertainty_score":0.054681063},"labels":[],"label_agreement":null},{"id":"W2063957170","doi":"10.1002/nla.521","title":"Mathematical Modelling and Mathematical Methods in Energy","year":2006,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Fundação Araucária","keywords":"Library science; Bachelor; Mathematics; Operations research; Geography; Computer science; Archaeology","score_opus":0.013189107157339524,"score_gpt":0.2776829384344822,"score_spread":0.2644938312771427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063957170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044902936,0.101568334,0.78611124,0.014900421,0.0068219425,0.00009161753,0.00062059925,0.0006891271,0.08470647],"genre_scores_gemma":[0.31163123,0.15111884,0.37273657,0.00631284,0.01628585,0.00092871924,0.0018402266,0.0014324258,0.13771321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767977,0.0009481757,0.00015434867,0.0003452882,0.0007416215,0.00013073903],"domain_scores_gemma":[0.9979911,0.001012492,0.00021417078,0.0003187698,0.00038153352,0.00008194801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023427578,0.0015794429,0.0018672753,0.0026087451,0.0008696483,0.0040000123,0.0013315222,0.002180955,0.0074155787],"category_scores_gemma":[0.0035388798,0.0005478366,0.0027391673,0.0021706054,0.003970267,0.0035186687,0.0023683344,0.005723285,0.004387181],"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.00001833853,0.000024602463,0.00024572905,0.000513454,0.000072738025,0.00012970887,0.00027077645,0.016028944,0.0013372463,0.92513937,0.02039902,0.03582004],"study_design_scores_gemma":[0.000009319901,0.00003788788,0.00034575284,0.00019953908,0.000024169512,0.00023349201,0.00008075381,0.032328956,0.000612756,0.80476826,0.16132806,0.00003108154],"about_ca_topic_score_codex":0.0016620038,"about_ca_topic_score_gemma":0.00084006763,"teacher_disagreement_score":0.0074155787,"about_ca_system_score_codex":0.0020392286,"about_ca_system_score_gemma":0.0015902618,"threshold_uncertainty_score":0.024807632},"labels":[],"label_agreement":null},{"id":"W2064505984","doi":"10.1155/2010/862392","title":"Iterative Signal Processing in Communications","year":2010,"lang":"en","type":"article","venue":"Journal of Electrical and Computer Engineering","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"University of Alberta","funders":"","keywords":"Signal processing; SIGNAL (programming language); Computer science; Digital signal processing; Computer hardware","score_opus":0.006622914590842552,"score_gpt":0.22091430061157402,"score_spread":0.21429138602073147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064505984","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065922164,0.21318345,0.62168753,0.011960444,0.0099974265,0.00010227571,0.00020319752,0.00045921805,0.13581422],"genre_scores_gemma":[0.29621363,0.29098856,0.2926407,0.009274816,0.02795549,0.0004468096,0.00040717312,0.00030111035,0.08177162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989784,0.0004174765,0.000053165193,0.00016096304,0.0003312254,0.000058938305],"domain_scores_gemma":[0.9988527,0.00069756655,0.00007356863,0.00011920568,0.00022038294,0.00003652959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089025684,0.000815331,0.0007778421,0.0010080467,0.0005905714,0.001881868,0.0006103701,0.0021875394,0.004642031],"category_scores_gemma":[0.0028638192,0.00024711387,0.00034609734,0.0019524882,0.0026659286,0.0020268692,0.0011892244,0.0028124338,0.0024737795],"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.000023954737,0.000021109963,0.00019760303,0.00037967163,0.000020940011,0.0001316202,0.00019844834,0.0095453905,0.0012993632,0.8934692,0.021438196,0.07327461],"study_design_scores_gemma":[0.000011642994,0.000090373964,0.00021479305,0.00022016076,0.000013013842,0.0005080175,0.00006877465,0.02730318,0.0010209302,0.7907435,0.17977017,0.00003547347],"about_ca_topic_score_codex":0.00061645464,"about_ca_topic_score_gemma":0.00045874648,"teacher_disagreement_score":0.004642031,"about_ca_system_score_codex":0.00082098285,"about_ca_system_score_gemma":0.0006986294,"threshold_uncertainty_score":0.015529156},"labels":[],"label_agreement":null},{"id":"W2065501945","doi":"10.1016/j.laa.2011.05.017","title":"Potentially nilpotent patterns and the Nilpotent-Jacobian method","year":2011,"lang":"en","type":"preprint","venue":"Linear Algebra and its 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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Redeemer University","funders":"","keywords":"Nilpotent; Nilpotent matrix; Jacobian matrix and determinant; Mathematics; Unipotent; Nilpotent group; Pure mathematics; Sign (mathematics); Central series; Matrix (chemical analysis); Algebra over a field; Eigenvalues and eigenvectors; Square matrix; Mathematical analysis; Applied mathematics; Symmetric matrix; Physics","score_opus":0.016817136948804483,"score_gpt":0.26172801001269297,"score_spread":0.24491087306388848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065501945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20072028,0.0019726807,0.6833439,0.0028402808,0.0005873651,0.00008006152,0.00019617235,0.00052565377,0.109733656],"genre_scores_gemma":[0.8735349,0.000946514,0.08654247,0.0004824906,0.00041629383,0.00009301363,0.00015974481,0.00019727036,0.037627295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995745,0.00014574334,0.000017767981,0.00006458292,0.00014550157,0.00005192136],"domain_scores_gemma":[0.9990995,0.00039928162,0.000079566766,0.00015409336,0.0001523732,0.00011523451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064318307,0.00041012676,0.0005409206,0.0012355819,0.00094150164,0.0016324159,0.0012686242,0.0006360096,0.007594106],"category_scores_gemma":[0.004088526,0.0002655957,0.00033746185,0.0008242226,0.0019878338,0.0028779185,0.0019038925,0.0014084834,0.001355299],"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.000031832253,0.000021585418,0.00031606577,0.000032073352,0.0000065319687,0.000081064485,0.00011678051,0.002582494,0.0007384318,0.97798866,0.0014785032,0.016606059],"study_design_scores_gemma":[0.0000069339917,0.0000056156923,0.00005007609,0.0000055846626,0.0000016522296,0.00004370185,0.000026103955,0.013816606,0.00029382834,0.9843455,0.0013995338,0.0000049177147],"about_ca_topic_score_codex":0.0005878295,"about_ca_topic_score_gemma":0.0007163829,"teacher_disagreement_score":0.007594106,"about_ca_system_score_codex":0.00047136817,"about_ca_system_score_gemma":0.0005268928,"threshold_uncertainty_score":0.02540481},"labels":[],"label_agreement":null},{"id":"W2065860406","doi":"10.1016/j.cam.2006.12.001","title":"A communication-less parallel algorithm for tridiagonal Toeplitz systems","year":2007,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; St. Francis Xavier University","funders":"","keywords":"Tridiagonal matrix; Toeplitz matrix; Circulant matrix; Mathematics; Linear system; Diagonal; Diagonally dominant matrix; Linear algebra; Tridiagonal matrix algorithm; Levinson recursion; System of linear equations; Parallel algorithm; Algorithm; Algebra over a field; Applied mathematics; Pure mathematics; Mathematical analysis; Geometry; Eigenvalues and eigenvectors","score_opus":0.021429443477888558,"score_gpt":0.26953752572249906,"score_spread":0.2481080822446105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065860406","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015339071,0.00012430063,0.9790547,0.00018997521,0.0001405757,0.000082060986,0.000065551445,0.001379926,0.0036238567],"genre_scores_gemma":[0.13840437,0.00012680232,0.85277253,0.00017369965,0.00008726224,0.00023720923,0.0002887789,0.00026354432,0.0076458137],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995359,0.000093448165,0.00003848529,0.000072156894,0.00017945598,0.00008056734],"domain_scores_gemma":[0.99914455,0.00029987126,0.00004176907,0.00019654994,0.00025063354,0.00006654137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005402309,0.000788849,0.0007943174,0.00050925306,0.0010982801,0.0010582266,0.0014712722,0.00086214306,0.010019944],"category_scores_gemma":[0.0019849364,0.0003871444,0.00043666977,0.0009282239,0.0005108312,0.0013412513,0.0016123326,0.0012315812,0.0024157877],"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.0011087183,0.00042859273,0.00064013695,0.00027102316,0.000098865035,0.0002664826,0.00032597085,0.24459796,0.026861057,0.05528047,0.016235566,0.6538851],"study_design_scores_gemma":[0.00014647041,0.00013445881,0.00010109934,0.000010448205,0.000017089826,0.00009738274,0.00004132712,0.96988946,0.006162285,0.01918742,0.0041937437,0.000018840323],"about_ca_topic_score_codex":0.003276377,"about_ca_topic_score_gemma":0.0055788434,"teacher_disagreement_score":0.010019944,"about_ca_system_score_codex":0.0005061361,"about_ca_system_score_gemma":0.0015666747,"threshold_uncertainty_score":0.033520103},"labels":[],"label_agreement":null},{"id":"W2067314231","doi":"10.1007/s10589-013-9635-7","title":"The generalized trust region subproblem","year":2014,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":66,"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 Waterloo","funders":"","keywords":"Mathematics; Trust region; Bounded function; Parameterized complexity; Quadratic equation; Eigenvalues and eigenvectors; Constraint (computer-aided design); Combinatorics; Applied mathematics; Mathematical optimization; Mathematical analysis; Computer science; Geometry","score_opus":0.009774008977502658,"score_gpt":0.23106854064144983,"score_spread":0.22129453166394716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067314231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0086068595,0.00035800476,0.9864319,0.0005290364,0.00007772575,0.00004590541,0.00010670071,0.00006881623,0.0037750448],"genre_scores_gemma":[0.55716926,0.001319754,0.42185754,0.00042703593,0.0005111348,0.00046417263,0.00063992286,0.00030923026,0.017301984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985247,0.00071690895,0.00004742876,0.00033087487,0.0002781897,0.0001019476],"domain_scores_gemma":[0.99686664,0.002087985,0.00021534061,0.00030825238,0.00038242468,0.000139354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016374984,0.0011626817,0.0018128243,0.00056218693,0.00040868524,0.0018753491,0.001429789,0.0022294724,0.0049374206],"category_scores_gemma":[0.008649843,0.0005864182,0.00074436335,0.0008686256,0.0015844904,0.002250802,0.0023578731,0.0019572712,0.0007847086],"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.00024795908,0.000068528854,0.00047578118,0.00044023426,0.000119287455,0.0003377599,0.00011523605,0.7781707,0.0024503078,0.13266294,0.009483987,0.07542716],"study_design_scores_gemma":[0.000030659587,0.000037552694,0.00008694512,0.000016961892,0.000014340931,0.000082069106,0.000022644075,0.94052434,0.00051085476,0.056958605,0.0017052942,0.000009731454],"about_ca_topic_score_codex":0.0029409612,"about_ca_topic_score_gemma":0.0017664983,"teacher_disagreement_score":0.0049374206,"about_ca_system_score_codex":0.00081732235,"about_ca_system_score_gemma":0.0015639821,"threshold_uncertainty_score":0.016517282},"labels":[],"label_agreement":null},{"id":"W2067594519","doi":"10.1002/nla.428","title":"Asymptotic properties of the <i>QR</i> factorization of banded Hessenberg–Toeplitz matrices","year":2005,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Toeplitz matrix; Mathematics; QR decomposition; Factorization; Diagonal; Matrix decomposition; Matrix (chemical analysis); Combinatorics; Applied mathematics; Algebra over a field; Pure mathematics; Algorithm; Eigenvalues and eigenvectors; Geometry","score_opus":0.008905594285361623,"score_gpt":0.21267136045333165,"score_spread":0.20376576616797004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067594519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07559112,0.00032959488,0.91647804,0.00025354404,0.00004776963,0.000034647845,0.000085233725,0.00045565303,0.00672438],"genre_scores_gemma":[0.84260947,0.00050245377,0.1509002,0.00012573054,0.00007406481,0.00009370575,0.00033607136,0.00023909804,0.0051192935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931467,0.00025761564,0.000028838227,0.000082702245,0.00023562666,0.00008050819],"domain_scores_gemma":[0.99496704,0.0025837277,0.00063916954,0.0006536933,0.00097471004,0.00018161048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019900184,0.00053760293,0.00040940466,0.0005299513,0.00029939733,0.00086850795,0.0004624193,0.0004318408,0.0048472034],"category_scores_gemma":[0.013733727,0.0003094548,0.00030460692,0.00037710907,0.0014618997,0.0014487596,0.0007673286,0.0008304885,0.0011687736],"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.0003679301,0.00007495579,0.002310853,0.00028299406,0.000054501816,0.00034678978,0.00043802444,0.5236498,0.031327527,0.38274908,0.004103674,0.054293867],"study_design_scores_gemma":[0.0000113299475,0.000050027556,0.0005035609,0.00002957704,0.0000050913045,0.00008531094,0.000057982197,0.9534612,0.003977871,0.040543064,0.0012581769,0.00001683145],"about_ca_topic_score_codex":0.0021096687,"about_ca_topic_score_gemma":0.0012302159,"teacher_disagreement_score":0.0048472034,"about_ca_system_score_codex":0.00052776,"about_ca_system_score_gemma":0.00063191913,"threshold_uncertainty_score":0.016215503},"labels":[],"label_agreement":null},{"id":"W2067616576","doi":"10.1016/j.laa.2011.07.034","title":"A new derivation of a formula by Kato","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its 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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Waterloo","funders":"","keywords":"Mathematics; Derivation; Algebra over a field; Applied mathematics; Pure mathematics; Surgery","score_opus":0.01534582059124612,"score_gpt":0.2298301892983962,"score_spread":0.21448436870715007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067616576","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05160438,0.0028070314,0.72453564,0.009267467,0.0067143654,0.00012130052,0.00080031407,0.0009777416,0.20317174],"genre_scores_gemma":[0.5123645,0.0030120378,0.35955617,0.006831897,0.0034251327,0.00029025064,0.00056189613,0.0016580679,0.1123001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994623,0.0001429565,0.00003934443,0.00011307323,0.00018502699,0.000057312674],"domain_scores_gemma":[0.99959344,0.0001207065,0.000022839875,0.00006688289,0.00014740958,0.000048695427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008450739,0.00079423265,0.0010676266,0.0021991807,0.0016462229,0.001698741,0.0016003539,0.0012233742,0.0076386523],"category_scores_gemma":[0.0025299992,0.0005633574,0.0014921842,0.0017787066,0.0026584829,0.0051569412,0.0034372902,0.003299611,0.002500349],"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.00001156909,0.000010881824,0.00006197607,0.0000397874,0.000008335741,0.00009415104,0.00020555261,0.0002305679,0.0009246662,0.9865892,0.0035088272,0.008314412],"study_design_scores_gemma":[0.000011819148,0.0000182129,0.0000885717,0.000016152426,0.00001308384,0.00013242153,0.000044652323,0.0027742349,0.00053465954,0.97802013,0.01832482,0.000021214677],"about_ca_topic_score_codex":0.0015359399,"about_ca_topic_score_gemma":0.001768978,"teacher_disagreement_score":0.0076386523,"about_ca_system_score_codex":0.0013639417,"about_ca_system_score_gemma":0.00091845565,"threshold_uncertainty_score":0.025553882},"labels":[],"label_agreement":null},{"id":"W2068874164","doi":"10.1007/s10543-006-0091-y","title":"An Arnoldi-type algorithm for computing page rank","year":2006,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"PageRank; Computation; Convergence (economics); Algorithm; Rank (graph theory); Matrix (chemical analysis); Computer science; Arnoldi iteration; Type (biology); Mathematics; Generalized minimal residual method; Mathematical optimization; Iterative method; Theoretical computer science; Combinatorics","score_opus":0.01507716441216068,"score_gpt":0.26552127964239675,"score_spread":0.2504441152302361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068874164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003178275,0.000130748,0.99070895,0.00014990976,0.00017408817,0.000060993196,0.000104133884,0.0017671899,0.0037257525],"genre_scores_gemma":[0.061089136,0.0002143368,0.9283003,0.00014701385,0.0001696964,0.00020233926,0.000375644,0.0005387484,0.008962791],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990101,0.0002078106,0.00007306118,0.00014163184,0.0004905374,0.00007685079],"domain_scores_gemma":[0.99795,0.0005810554,0.00009760789,0.00054598646,0.0007123519,0.00011301051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093518844,0.0010252123,0.0011302598,0.0019139214,0.0010945747,0.0020118274,0.001656988,0.0011305043,0.010041451],"category_scores_gemma":[0.0068984586,0.0005708946,0.00073421944,0.0021802285,0.001015388,0.0028156184,0.001875257,0.0024062272,0.0065999967],"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.00040941962,0.00020767956,0.00089938974,0.00029808207,0.000096828604,0.00015589497,0.0002394428,0.056291904,0.020752653,0.21986003,0.022964513,0.67782414],"study_design_scores_gemma":[0.00011804653,0.0001592128,0.00034298847,0.000044160977,0.000043870587,0.00022893737,0.000078436635,0.7189972,0.019807,0.23996142,0.02013121,0.000087486536],"about_ca_topic_score_codex":0.0014046256,"about_ca_topic_score_gemma":0.0030340957,"teacher_disagreement_score":0.010041451,"about_ca_system_score_codex":0.00073013274,"about_ca_system_score_gemma":0.0015529527,"threshold_uncertainty_score":0.033591986},"labels":[],"label_agreement":null},{"id":"W2069223940","doi":"10.1239/jap/996986760","title":"On the convergence and limits of certain matrix sequences arising in quasi-birth-and-death Markov chains","year":2001,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Markov chain; Sequence (biology); Matrix (chemical analysis); Limit (mathematics); Convergence (economics); Stochastic matrix; Applied mathematics; Boundary (topology); Limit of a sequence; Birth–death process; Rate of convergence; Markov process; Mathematical analysis; Statistics; Computer science","score_opus":0.02380851750277468,"score_gpt":0.26208043253747343,"score_spread":0.23827191503469874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069223940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3368618,0.0014359567,0.64850247,0.0012099816,0.00008724997,0.00011454363,0.00013464707,0.0002664637,0.011386874],"genre_scores_gemma":[0.90990096,0.0016540968,0.08163617,0.00025711095,0.00013332331,0.000335946,0.00020847828,0.00014511414,0.005728767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991787,0.00035820092,0.000050840532,0.00012539752,0.0001795733,0.000107217165],"domain_scores_gemma":[0.9743429,0.01852536,0.0024785805,0.00067524385,0.0024750738,0.0015028678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004386491,0.00076191913,0.0007987227,0.0018263219,0.001286216,0.0019560002,0.0014639986,0.0015901255,0.0029106543],"category_scores_gemma":[0.034516566,0.00051759527,0.0007147119,0.0010285499,0.0038414926,0.003931525,0.0019685782,0.0020191188,0.00037288058],"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.00011614764,0.000082405946,0.0024792098,0.00016271937,0.000032445387,0.00042103077,0.0008404958,0.12967165,0.0042191786,0.853913,0.0007138258,0.007347916],"study_design_scores_gemma":[0.000019030349,0.000052569034,0.00047903857,0.000052284893,0.000011075634,0.00014518584,0.00018369808,0.71866184,0.0014604252,0.278264,0.00063562905,0.0000350814],"about_ca_topic_score_codex":0.0032981075,"about_ca_topic_score_gemma":0.00238583,"teacher_disagreement_score":0.004386491,"about_ca_system_score_codex":0.0015418614,"about_ca_system_score_gemma":0.0010018331,"threshold_uncertainty_score":0.023198247},"labels":[],"label_agreement":null},{"id":"W2069560865","doi":"10.1007/s00020-014-2178-1","title":"Remarks on the Convergence of Pseudospectra","year":2014,"lang":"en","type":"article","venue":"Integral Equations and Operator Theory","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":21,"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":"Queen's University; Queen's University Belfast; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Resolvent; Mathematics; Resolvent formalism; Hilbert space; Norm (philosophy); Constant (computer programming); Hausdorff distance; Hausdorff space; Limiting; Mathematical analysis; Pure mathematics; Convergence (economics); Operator norm; Open set; Operator (biology); Banach space; Finite-rank operator","score_opus":0.009712942344925852,"score_gpt":0.22784982874763676,"score_spread":0.21813688640271092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069560865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047654822,0.0075399843,0.6463644,0.05735156,0.007935842,0.0001005557,0.00077898375,0.0010029792,0.23127092],"genre_scores_gemma":[0.6494035,0.008731019,0.2079381,0.026769264,0.012635425,0.0005687996,0.00066951336,0.0014199155,0.09186443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963032,0.0015155508,0.00021481123,0.0006552069,0.0010577405,0.00025344692],"domain_scores_gemma":[0.97091484,0.021430489,0.00075151573,0.002288726,0.0036774073,0.0009370746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0109709175,0.0014528587,0.0015288746,0.0034709692,0.0022791256,0.0030771787,0.0028733707,0.003091333,0.015481995],"category_scores_gemma":[0.03013598,0.0005381887,0.0020027375,0.0015858933,0.008694629,0.011716618,0.0047480944,0.008330876,0.0017530742],"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.00003504021,0.000018170425,0.00017835766,0.000085241605,0.000012854518,0.00011545524,0.00020458033,0.0010079045,0.00040249407,0.9905794,0.003956604,0.0034038243],"study_design_scores_gemma":[0.00001589878,0.000021820271,0.00033306592,0.000044377543,0.000009886946,0.00013613695,0.00007116769,0.0077259755,0.00045863265,0.98249555,0.008666069,0.000021517451],"about_ca_topic_score_codex":0.0018122472,"about_ca_topic_score_gemma":0.0009203355,"teacher_disagreement_score":0.015481995,"about_ca_system_score_codex":0.0013783257,"about_ca_system_score_gemma":0.000602382,"threshold_uncertainty_score":0.058020473},"labels":[],"label_agreement":null},{"id":"W2069630595","doi":"10.1145/990353.990364","title":"Exact implicitization of polynomial curves and surfaces","year":2003,"lang":"en","type":"article","venue":"ACM SIGSAM Bulletin","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Polynomial; Applied mathematics; Pure mathematics; Algebra over a field; Mathematical analysis; Physics","score_opus":0.010330380520770505,"score_gpt":0.23075319598593586,"score_spread":0.22042281546516534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069630595","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04027591,0.000493405,0.93489736,0.00030273717,0.00010217044,0.000024691195,0.00010951507,0.0013781847,0.022415975],"genre_scores_gemma":[0.57332015,0.0012848632,0.39094284,0.00012657052,0.00013589581,0.00007306446,0.00046538658,0.0012955872,0.032355685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950695,0.00006157805,0.000014843511,0.00004947228,0.00030577029,0.000061392064],"domain_scores_gemma":[0.99943906,0.00013535387,0.000034071225,0.00022822208,0.00013268931,0.000030518106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031929184,0.00045493935,0.0006085116,0.00070191815,0.0005207736,0.0014248297,0.00088054966,0.0005808591,0.009873407],"category_scores_gemma":[0.002232508,0.00028923256,0.00039513857,0.0009802488,0.00091494445,0.0021985236,0.0021426447,0.0013929569,0.002114037],"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.00007830035,0.000046023073,0.00037299597,0.00015602594,0.000014589317,0.000102291044,0.00035523315,0.12254948,0.01943962,0.5645689,0.0059435726,0.28637293],"study_design_scores_gemma":[0.000027880895,0.000030356345,0.0001866059,0.000023320277,0.000004569214,0.00012111601,0.000088209636,0.7152276,0.012336557,0.23733617,0.03459288,0.000024662124],"about_ca_topic_score_codex":0.0016767124,"about_ca_topic_score_gemma":0.0024849656,"teacher_disagreement_score":0.009873407,"about_ca_system_score_codex":0.00055626914,"about_ca_system_score_gemma":0.00061077916,"threshold_uncertainty_score":0.033029854},"labels":[],"label_agreement":null},{"id":"W2070321958","doi":"10.1016/j.laa.2013.07.018","title":"The rational canonical form via the splitting field","year":2013,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Iran National Science Foundation; Indiana Academy of Sciences","keywords":"Mathematics; Canonical form; Converse; Field (mathematics); Uniqueness; Extension (predicate logic); Pure mathematics; Polynomial; Matrix (chemical analysis); Algebra over a field; Discrete mathematics; Mathematical analysis; Computer science; Geometry","score_opus":0.008045356407425309,"score_gpt":0.23753934037045119,"score_spread":0.22949398396302587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070321958","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44872543,0.0013471836,0.30686787,0.0076387413,0.001244121,0.00012889005,0.0004958363,0.0006624604,0.23288946],"genre_scores_gemma":[0.9172798,0.00080939103,0.034577996,0.0009003253,0.0010275419,0.00007562077,0.00025601606,0.0002849044,0.04478842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993936,0.00015497534,0.000021817259,0.00015913931,0.00017391657,0.000096571755],"domain_scores_gemma":[0.99957675,0.00009212852,0.000055665805,0.00005864786,0.000107479515,0.00010931001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086211186,0.0007570404,0.00066709734,0.0015233924,0.0011835876,0.0030322038,0.0008990955,0.0011023885,0.011108412],"category_scores_gemma":[0.0017397818,0.00042831153,0.00049869105,0.00088862295,0.0033027127,0.0053116987,0.0016402598,0.0023469632,0.0021191945],"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.000018567904,0.000013481114,0.0000851335,0.000012408422,0.0000029807036,0.000028380931,0.00008949986,0.00044055938,0.0005450612,0.9931432,0.0011320371,0.0044885827],"study_design_scores_gemma":[0.000011151143,0.000009057908,0.00004402051,0.0000051811458,0.0000020938535,0.00005000065,0.00004140901,0.0031331847,0.00027122383,0.9946949,0.0017312539,0.0000065170893],"about_ca_topic_score_codex":0.0006834854,"about_ca_topic_score_gemma":0.00056191377,"teacher_disagreement_score":0.011108412,"about_ca_system_score_codex":0.0008768506,"about_ca_system_score_gemma":0.0008951834,"threshold_uncertainty_score":0.03716129},"labels":[],"label_agreement":null},{"id":"W2072649103","doi":"10.4153/cmb-2001-027-9","title":"Linear Operators Preserving Generalized Numerical Ranges and Radii on Certain Triangular Algebras of Matrices","year":2001,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","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":true,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"University of Cambridge; National Science Foundation","keywords":"Mathematics; Numerical range; RADIUS; Triangular matrix; Matrix (chemical analysis); Block (permutation group theory); Linear operators; Range (aeronautics); Complex matrix; Pure mathematics; Spectral radius; Algebra over a field; Combinatorics; Mathematical analysis; Eigenvalues and eigenvectors; Chemistry","score_opus":0.013642350511035017,"score_gpt":0.23489438307103874,"score_spread":0.22125203256000373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072649103","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85625565,0.0003090737,0.12410611,0.00023363771,0.00004345023,0.00005101625,0.00013941941,0.00021810518,0.01864352],"genre_scores_gemma":[0.97733605,0.00014481742,0.01795723,0.000091205075,0.00008671955,0.00005154974,0.00012072503,0.000054594628,0.0041571013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990042,0.000286346,0.000060107643,0.00013885413,0.0003470488,0.00016347072],"domain_scores_gemma":[0.9973911,0.0008410344,0.0006507826,0.00021049342,0.00043259328,0.00047402232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010351589,0.0003401711,0.00036726624,0.0012382906,0.0007336288,0.0016133739,0.0006265312,0.00045164328,0.003357255],"category_scores_gemma":[0.0029428576,0.00023955024,0.00042379345,0.0006504578,0.0018685281,0.0026124935,0.0011362897,0.0007795228,0.0003880363],"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.00011395814,0.000044013326,0.000560758,0.000043317454,0.000011778144,0.00016974598,0.0004900136,0.0026800134,0.012949679,0.9756482,0.0004766204,0.006811875],"study_design_scores_gemma":[0.00005134472,0.00018983087,0.001450108,0.000030386092,0.000015311804,0.00040591904,0.00047526218,0.050295617,0.010656238,0.93356055,0.0028064859,0.000062995205],"about_ca_topic_score_codex":0.00054108223,"about_ca_topic_score_gemma":0.0004939677,"teacher_disagreement_score":0.003357255,"about_ca_system_score_codex":0.0005951478,"about_ca_system_score_gemma":0.00035226712,"threshold_uncertainty_score":0.011231184},"labels":[],"label_agreement":null},{"id":"W2072898412","doi":"10.1155/s0161171204301183","title":"On mixed‐type reverse‐order laws for the Moore‐Penrose inverse of a matrix product","year":2004,"lang":"en","type":"article","venue":"International Journal of Mathematics and Mathematical Sciences","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":31,"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 Alberta","funders":"McGill University","keywords":"Mathematics; Type (biology); Order (exchange); Inverse; Moore–Penrose pseudoinverse; Matrix (chemical analysis); Product (mathematics); Generalized inverse; Law; Pure mathematics; Geometry; Political science","score_opus":0.027938572152255762,"score_gpt":0.31571577115400057,"score_spread":0.2877771990017448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072898412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021948377,0.0010433095,0.9475362,0.000563619,0.00030134406,0.00008079669,0.00023903977,0.00019442843,0.028092952],"genre_scores_gemma":[0.57207537,0.0051217983,0.37951747,0.001803591,0.0011695599,0.0007233116,0.0011575519,0.0006044964,0.037826832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711597,0.0007702017,0.0002599705,0.0005271851,0.0010526946,0.00027403],"domain_scores_gemma":[0.98303187,0.008440706,0.0020322623,0.0017047654,0.004208007,0.0005823242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042318827,0.0014036996,0.0010725188,0.0027105785,0.0012320153,0.004001388,0.0013258827,0.0016527615,0.008974557],"category_scores_gemma":[0.020350285,0.00096455903,0.0018662544,0.0019606685,0.005035437,0.0073361113,0.0021656859,0.0055010193,0.0033727654],"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.000042233834,0.000049082788,0.0005268439,0.00012678593,0.000022188318,0.00029582478,0.00036562144,0.0064729378,0.003160384,0.972073,0.002733005,0.014132062],"study_design_scores_gemma":[0.000018963297,0.00014603694,0.00049887004,0.00007792448,0.000023810178,0.000896798,0.00020958383,0.07943093,0.0038792007,0.9066561,0.008066088,0.00009580872],"about_ca_topic_score_codex":0.0016134237,"about_ca_topic_score_gemma":0.0023574042,"teacher_disagreement_score":0.008974557,"about_ca_system_score_codex":0.0011043582,"about_ca_system_score_gemma":0.0009616063,"threshold_uncertainty_score":0.03002286},"labels":[],"label_agreement":null},{"id":"W2072945393","doi":"10.1016/j.laa.2010.09.045","title":"Positivity and matrix semigroups","year":2010,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"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 Waterloo; Saint Mary's University","funders":"","keywords":"Mathematics; Semigroup; Diagonal; Special classes of semigroups; Matrix (chemical analysis); Group (periodic table); Diagonal matrix; Pure mathematics; Nonnegative matrix; Combinatorics; Discrete mathematics; Algebra over a field; Symmetric matrix; Eigenvalues and eigenvectors","score_opus":0.005802817423992051,"score_gpt":0.24798011969886186,"score_spread":0.2421773022748698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072945393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20042934,0.012216596,0.4893282,0.012274309,0.0026468537,0.0000736976,0.00054760743,0.00037875015,0.2821047],"genre_scores_gemma":[0.9047034,0.004172848,0.022638077,0.0011409324,0.002243499,0.00015563593,0.00027134767,0.0001553829,0.06451896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908864,0.00037048312,0.00004257816,0.00018162307,0.00023286462,0.00008383917],"domain_scores_gemma":[0.99649835,0.0021530448,0.00028761875,0.00020126763,0.0005172943,0.0003423521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015640887,0.0008165112,0.0008612087,0.0015003554,0.002037113,0.0029364158,0.00078482897,0.001140357,0.0089661125],"category_scores_gemma":[0.0051124725,0.00057900656,0.0007074539,0.0015087998,0.004655205,0.0052981265,0.0019486554,0.0028409439,0.00097323774],"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.00001619404,0.000008925375,0.000040877396,0.000023615687,0.0000032533335,0.000037765018,0.00018810634,0.00034602403,0.0005624927,0.99524826,0.0011001945,0.002424419],"study_design_scores_gemma":[0.000004163424,0.000005153788,0.000044802455,0.0000039163183,0.0000019823744,0.000040894338,0.000033474753,0.0014296842,0.00012113575,0.9964139,0.0018957513,0.000005204181],"about_ca_topic_score_codex":0.00058933126,"about_ca_topic_score_gemma":0.0005034762,"teacher_disagreement_score":0.0089661125,"about_ca_system_score_codex":0.000892907,"about_ca_system_score_gemma":0.00059034483,"threshold_uncertainty_score":0.029994667},"labels":[],"label_agreement":null},{"id":"W2072968905","doi":"10.1016/j.nuclphysb.2010.01.009","title":"The integration algorithm of Lax equation for both generic Lax matrices and generic initial conditions","year":2010,"lang":"en","type":"article","venue":"Nuclear Physics B","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Diagonalizable matrix; Lax pair; Mathematics; Applied mathematics; Algebra over a field; Matrix (chemical analysis); Computer science; Eigenvalues and eigenvectors; Pure mathematics; Symmetric matrix","score_opus":0.023818136252783173,"score_gpt":0.27013860178680943,"score_spread":0.24632046553402626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072968905","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012704661,0.00009313918,0.98338574,0.00016467493,0.000037433474,0.000028038114,0.000019205734,0.0001322031,0.003434915],"genre_scores_gemma":[0.2566644,0.00029827008,0.734846,0.00018251968,0.000071590825,0.00015746776,0.00013553651,0.0002780061,0.0073661823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995316,0.0001372577,0.000042472264,0.000078559766,0.00015301314,0.000057195484],"domain_scores_gemma":[0.999286,0.00030810802,0.000071424314,0.000104663246,0.00018686982,0.00004286724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011372111,0.00036724418,0.0005230802,0.00061684137,0.00064821535,0.00088983454,0.0010622158,0.000777888,0.0042091757],"category_scores_gemma":[0.0036796834,0.00023319833,0.00060660706,0.0005229052,0.00093282084,0.0019220436,0.0017523852,0.0014602406,0.0010417561],"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.000078686375,0.000051302788,0.0013006917,0.00013485466,0.000029930015,0.00026280642,0.00062865735,0.032083455,0.00923963,0.8247993,0.00242599,0.12896466],"study_design_scores_gemma":[0.00003131743,0.000041667285,0.00034668457,0.00003740043,0.0000185513,0.00022626217,0.00009310321,0.5990394,0.005231089,0.3889078,0.0059964,0.00003047168],"about_ca_topic_score_codex":0.00085714407,"about_ca_topic_score_gemma":0.0009475125,"teacher_disagreement_score":0.0042091757,"about_ca_system_score_codex":0.00060371193,"about_ca_system_score_gemma":0.00066901435,"threshold_uncertainty_score":0.0140811205},"labels":[],"label_agreement":null},{"id":"W2073148515","doi":"10.1016/j.laa.2008.12.032","title":"On the necessary and sufficient condition for the extended Wedderburn–Guttman theorem","year":2009,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Rank (graph theory); Mathematics; Combinatorics; Guttman scale; Matrix (chemical analysis); Discrete mathematics; Statistics","score_opus":0.011614368575178242,"score_gpt":0.2605060276295781,"score_spread":0.24889165905439983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073148515","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24652453,0.0028986179,0.5476181,0.011057679,0.0024257891,0.00020727681,0.001675119,0.0005682969,0.18702467],"genre_scores_gemma":[0.898779,0.0018075884,0.06196335,0.0032442831,0.0016094436,0.0002832942,0.0011793225,0.0003513164,0.030782431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991172,0.00017397197,0.000048655984,0.00027923108,0.00018277003,0.0001980481],"domain_scores_gemma":[0.995218,0.0027851188,0.0002932174,0.00048070474,0.000815469,0.00040735185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002410481,0.0007945918,0.0014982846,0.0013518815,0.0017438866,0.0015222064,0.0020513632,0.0015272901,0.020995326],"category_scores_gemma":[0.011014376,0.0005032375,0.0012895205,0.0011867774,0.0041588815,0.006986767,0.0037757433,0.0044810823,0.0021030176],"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.00019263399,0.000055952754,0.00064318214,0.000143771,0.00003438337,0.00038014428,0.00029264129,0.0024617042,0.0026102765,0.97725564,0.0054085697,0.01052121],"study_design_scores_gemma":[0.000056913737,0.000044351695,0.0006436502,0.000038649312,0.00001705409,0.00018227966,0.00011321337,0.012479002,0.0010594155,0.98007274,0.0052639567,0.000028817705],"about_ca_topic_score_codex":0.0010448208,"about_ca_topic_score_gemma":0.0010950587,"teacher_disagreement_score":0.020995326,"about_ca_system_score_codex":0.00080544176,"about_ca_system_score_gemma":0.0011260096,"threshold_uncertainty_score":0.070236325},"labels":[],"label_agreement":null},{"id":"W2073211212","doi":"10.1063/1.1481389","title":"An Airy discrete variable representation basis","year":2002,"lang":"en","type":"article","venue":"The Journal of Chemical Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":9,"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":"Ryerson University; National Science Foundation","keywords":"Eigenfunction; Airy function; Basis (linear algebra); Representation (politics); Matrix representation; Basis function; Variable (mathematics); Hamiltonian (control theory); Mathematics; Discrete variable; Matrix (chemical analysis); Mathematical analysis; Kinetic energy; Physics; Classical mechanics; Applied mathematics; Eigenvalues and eigenvectors; Geometry; Mathematical optimization; Quantum mechanics","score_opus":0.01877239313291964,"score_gpt":0.2576578139250594,"score_spread":0.23888542079213973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073211212","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009808734,0.00042572487,0.9617742,0.0004186734,0.0004121907,0.00003675729,0.00016875265,0.00035760453,0.026597405],"genre_scores_gemma":[0.24391486,0.0010191792,0.7234695,0.00061575527,0.00043791256,0.00024846467,0.00063839526,0.00045567067,0.02920034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945086,0.00017706052,0.000023631967,0.00007949765,0.0001988832,0.000070170274],"domain_scores_gemma":[0.99960953,0.00008348122,0.000021271466,0.00012369947,0.00011992875,0.00004214012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007736842,0.00035579051,0.00057090825,0.00076090446,0.0005530532,0.0018671144,0.0010710286,0.00067255663,0.009995567],"category_scores_gemma":[0.0015919579,0.00024368713,0.0005037152,0.00063945644,0.0010711536,0.0019114491,0.0015889117,0.0016170857,0.0028614467],"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.000033416152,0.00001647566,0.00007574648,0.000040392806,0.000005653735,0.00004297734,0.00006529475,0.005385965,0.0025896393,0.94985294,0.0034916266,0.038399763],"study_design_scores_gemma":[0.000038913106,0.00008184904,0.00015420065,0.00005378106,0.000012626755,0.00024058195,0.00007961928,0.2120829,0.0040712818,0.71029145,0.07285181,0.000040953044],"about_ca_topic_score_codex":0.00064723537,"about_ca_topic_score_gemma":0.0005414289,"teacher_disagreement_score":0.009995567,"about_ca_system_score_codex":0.0004380629,"about_ca_system_score_gemma":0.00073928543,"threshold_uncertainty_score":0.033438563},"labels":[],"label_agreement":null},{"id":"W2073513725","doi":"10.1145/1923947.1924027","title":"High-performance computing with sparsity and structure","year":2010,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Lethbridge; McMaster University; IBM (Canada)","funders":"","keywords":"Computer science; Computation; Data science; Supercomputer; Sparse matrix; Science and engineering; Data structure; Distributed computing; Computational science; Theoretical computer science; Parallel computing; Algorithm; Engineering ethics; Engineering; Programming language","score_opus":0.0037137815574631115,"score_gpt":0.18286077703295067,"score_spread":0.17914699547548757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073513725","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07251766,0.0051333685,0.8652394,0.006848549,0.0010191078,0.00009913642,0.0005873703,0.0016007042,0.046954796],"genre_scores_gemma":[0.7722492,0.003776034,0.21022063,0.0007890383,0.0010715396,0.00016231269,0.00087857276,0.00021861962,0.0106340265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993623,0.0001598794,0.000022119091,0.000071939074,0.00031410673,0.000069595466],"domain_scores_gemma":[0.9984485,0.0006747353,0.00010518144,0.00036633937,0.0002971169,0.00010811234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051861705,0.00032858585,0.0005060958,0.00040084907,0.0006156314,0.0013001151,0.0008309053,0.0007035459,0.0032258157],"category_scores_gemma":[0.0045876796,0.00027731908,0.00024313362,0.0010588237,0.0012257845,0.0022022882,0.0017408378,0.0014806534,0.001023763],"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.0002771443,0.00010031669,0.002212208,0.00047769365,0.000079986996,0.00044373,0.00025058756,0.1345397,0.013649988,0.65503764,0.04263049,0.15030044],"study_design_scores_gemma":[0.000040921474,0.000057104724,0.00049859285,0.000034741926,0.000011564159,0.00016482518,0.0000497453,0.45288476,0.0039857505,0.51717466,0.02507919,0.000018087343],"about_ca_topic_score_codex":0.00069412385,"about_ca_topic_score_gemma":0.0010131771,"teacher_disagreement_score":0.0032258157,"about_ca_system_score_codex":0.00039789794,"about_ca_system_score_gemma":0.0007567749,"threshold_uncertainty_score":0.010791361},"labels":[],"label_agreement":null},{"id":"W2073945928","doi":"10.48550/arxiv.1209.4949","title":"Fischer type determinantal inequalities for accretive-dissipative matrices","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dissipative system; Type (biology); Mathematics; Matrix (chemical analysis); Combinatorics; Physics; Algebra over a field; Pure mathematics; Thermodynamics; Materials science","score_opus":0.09906848907549,"score_gpt":0.22961167393404217,"score_spread":0.13054318485855215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073945928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09893727,0.0021594435,0.69082105,0.0049483785,0.00047480493,0.00011613943,0.0012723281,0.00027011908,0.20100048],"genre_scores_gemma":[0.8672951,0.0019448414,0.07993441,0.0018023193,0.00045636657,0.00033070453,0.0010518527,0.00020547428,0.046978965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861765,0.00046848622,0.00006753337,0.00020965154,0.00038162927,0.00025500418],"domain_scores_gemma":[0.993533,0.0046423925,0.00037207574,0.00031929658,0.0007677379,0.00036537502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024206282,0.0013580157,0.00057563075,0.0018327204,0.00094684516,0.0021496653,0.0015370254,0.0010819538,0.014998988],"category_scores_gemma":[0.010140658,0.0004411764,0.0007870747,0.0011874671,0.0029355898,0.0033642282,0.0021596886,0.003254466,0.0017235744],"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.000027918848,0.000010535996,0.00019565261,0.00004685244,0.0000078494995,0.000045857112,0.000094443654,0.0053253933,0.0008309338,0.98747486,0.0017168258,0.0042227586],"study_design_scores_gemma":[0.000010127704,0.00002268218,0.00034113255,0.000033474556,0.0000063102298,0.000052394305,0.000056825444,0.0710489,0.00082211255,0.92467487,0.0029043814,0.000026787331],"about_ca_topic_score_codex":0.0023941305,"about_ca_topic_score_gemma":0.0043299664,"teacher_disagreement_score":0.014998988,"about_ca_system_score_codex":0.0025486178,"about_ca_system_score_gemma":0.0010478372,"threshold_uncertainty_score":0.05017668},"labels":[],"label_agreement":null},{"id":"W2074057915","doi":"10.1016/j.laa.2005.08.009","title":"On the Wedderburn–Guttman theorem","year":2005,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Guttman scale; Rank (graph theory); Invertible matrix; Combinatorics; Inverse; Matrix (chemical analysis); Pure mathematics; Statistics; Chemistry; Geometry","score_opus":0.010635847106908632,"score_gpt":0.2395114240348644,"score_spread":0.22887557692795577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074057915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094610095,0.0111203,0.5912296,0.017417809,0.0043458687,0.000072149385,0.0007162025,0.00034580086,0.2801422],"genre_scores_gemma":[0.7248518,0.01032621,0.12347802,0.007237265,0.004687919,0.0001984983,0.0007971601,0.0005820093,0.12784114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994599,0.00015078962,0.000019508127,0.00013904633,0.00015045865,0.00008026122],"domain_scores_gemma":[0.9984611,0.0009083702,0.000092587856,0.00020487243,0.00022179895,0.000111327005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013804586,0.0007885345,0.0009394743,0.0017426502,0.0016996866,0.0016470137,0.0013239596,0.001111189,0.014282249],"category_scores_gemma":[0.005760782,0.00038954668,0.00084311096,0.0018977616,0.0036600046,0.006119648,0.003353165,0.004238187,0.0021090393],"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.000038674312,0.000018708208,0.00016403738,0.000051653486,0.000009618301,0.000046986206,0.00009809646,0.0012681612,0.0003911516,0.97450125,0.0062455144,0.017166285],"study_design_scores_gemma":[0.0000063531875,0.000008634157,0.0001353157,0.000014440145,0.00000413931,0.000036465844,0.000020261004,0.0036012782,0.00017538227,0.9903555,0.0056351307,0.000007155879],"about_ca_topic_score_codex":0.0013981129,"about_ca_topic_score_gemma":0.0013534442,"teacher_disagreement_score":0.014282249,"about_ca_system_score_codex":0.0008739071,"about_ca_system_score_gemma":0.0005790888,"threshold_uncertainty_score":0.047778904},"labels":[],"label_agreement":null},{"id":"W2074560815","doi":"10.1016/s0096-3003(01)00096-0","title":"Parallel algorithms for solving tridiagonal and near-circulant systems","year":2002,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Tridiagonal matrix; Circulant matrix; Tridiagonal matrix algorithm; Gaussian elimination; Algorithm; Mathematics; Linear system; System of linear equations; Coefficient matrix; Applied mathematics; Computer science; Gaussian; Mathematical analysis; Computational chemistry","score_opus":0.031804603344548335,"score_gpt":0.24749859538582927,"score_spread":0.21569399204128092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074560815","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019177292,0.0004558263,0.9725654,0.0002344885,0.0002101865,0.00007047923,0.00008930737,0.001068647,0.0061284574],"genre_scores_gemma":[0.20461254,0.0004698891,0.7863563,0.00015561316,0.00016849993,0.00028040438,0.00028438203,0.00035591732,0.0073164455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995009,0.00013378408,0.000031157222,0.000068962814,0.00019776133,0.000067432076],"domain_scores_gemma":[0.99842715,0.0007594165,0.00010164698,0.00024694978,0.00037189893,0.00009294672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007581724,0.00092652254,0.00098221,0.0008554628,0.0013287675,0.0011893983,0.0015024351,0.0011026742,0.006739293],"category_scores_gemma":[0.00461145,0.00055280206,0.00055132265,0.0017549243,0.0007912879,0.0016237446,0.0013770249,0.0012916022,0.0015201074],"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.00032585912,0.00026418138,0.0006228975,0.0003375968,0.00009412341,0.00017233272,0.00023077978,0.5774891,0.006893019,0.11450807,0.01283644,0.2862257],"study_design_scores_gemma":[0.00005211536,0.000026254202,0.000066381814,0.000006904706,0.000010583526,0.000032930806,0.000024593171,0.9503445,0.0016357295,0.045935843,0.0018557016,0.0000084718695],"about_ca_topic_score_codex":0.0044299676,"about_ca_topic_score_gemma":0.011302089,"teacher_disagreement_score":0.006739293,"about_ca_system_score_codex":0.0006808797,"about_ca_system_score_gemma":0.0016575925,"threshold_uncertainty_score":0.022545159},"labels":[],"label_agreement":null},{"id":"W2075038987","doi":"10.5539/jmr.v5n4p58","title":"Discussing a More Fundamental Concept Than the Minimal Residual Method to Solve Linear System in a Krylov Subspace","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Taiwan University; National Science Council","keywords":"Mathematics; Linear subspace; Krylov subspace; Residual; Subspace topology; Projection (relational algebra); Combinatorics; Linear system; Applied mathematics; Discrete mathematics; Pure mathematics; Algorithm; Mathematical analysis","score_opus":0.07201811595646808,"score_gpt":0.4033788663043245,"score_spread":0.33136075034785645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075038987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023532533,0.0003742342,0.99465203,0.0002827857,0.000077591474,0.000019933601,0.00001348227,0.000077901546,0.0021487],"genre_scores_gemma":[0.12135287,0.0012316862,0.87072474,0.0005104491,0.00036529292,0.00025590503,0.00015400299,0.00023888712,0.0051661837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991565,0.00031872716,0.00004115306,0.00015835997,0.0002734603,0.000051697756],"domain_scores_gemma":[0.9995467,0.00019569199,0.00005352586,0.00006585463,0.000107587446,0.000030569103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015801928,0.00087013945,0.00093926396,0.00068458845,0.00056270347,0.00080632063,0.0012028521,0.0010745698,0.0031174438],"category_scores_gemma":[0.0018956087,0.00031642153,0.0008921024,0.0007008938,0.0019659419,0.0019052133,0.0017191251,0.0023018178,0.0008094454],"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.0001411435,0.000108886816,0.00071070937,0.0007826137,0.0001654547,0.00011249765,0.00037221026,0.14231545,0.03069316,0.7018741,0.005518069,0.11720569],"study_design_scores_gemma":[0.000065858454,0.00046399765,0.0003670338,0.000076290045,0.000062971805,0.00028593658,0.0001158821,0.796994,0.014928998,0.15874286,0.027787473,0.00010870263],"about_ca_topic_score_codex":0.0010590088,"about_ca_topic_score_gemma":0.0007835967,"teacher_disagreement_score":0.0031174438,"about_ca_system_score_codex":0.00038035362,"about_ca_system_score_gemma":0.0010216482,"threshold_uncertainty_score":0.0104289055},"labels":[],"label_agreement":null},{"id":"W2075200087","doi":"10.1007/s11075-009-9286-z","title":"Rayleigh quotient algorithms for nonsymmetric matrix pencils","year":2009,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rayleigh quotient iteration; Mathematics; Eigenvalues and eigenvectors; Rayleigh quotient; Convergence (economics); Matrix (chemical analysis); Theory of computation; Iterative method; Quotient; Algorithm; Mathematical analysis; Applied mathematics; Algebra over a field; Pure mathematics; Preconditioner","score_opus":0.021588814093993998,"score_gpt":0.29193035395969674,"score_spread":0.27034153986570275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075200087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034008906,0.00024813792,0.99393725,0.00010518611,0.00007458201,0.000028710714,0.00002570205,0.00025419978,0.0019252378],"genre_scores_gemma":[0.13854688,0.0008187317,0.84851676,0.00022791878,0.00017356219,0.00029196145,0.00024901025,0.0005480269,0.010627083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979674,0.0009609991,0.00011142327,0.00017528137,0.000672219,0.000112686816],"domain_scores_gemma":[0.9945872,0.0030017605,0.00024485428,0.00093289325,0.0010416743,0.00019163013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026031074,0.001322911,0.0010853036,0.0011255763,0.000601739,0.0021084002,0.0019786619,0.0011326467,0.008122864],"category_scores_gemma":[0.017135253,0.00051786914,0.00059676234,0.0014313373,0.0018614668,0.003981873,0.003170179,0.0021859996,0.0030416616],"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.00034512597,0.000118785705,0.00052308897,0.00023769481,0.00006511365,0.00011319251,0.00026175223,0.19508544,0.0056514596,0.51115716,0.007861693,0.27857953],"study_design_scores_gemma":[0.000045402936,0.0000492172,0.00006146363,0.000018232975,0.000008354482,0.00004257157,0.000030461226,0.80229783,0.0030836272,0.19039348,0.0039503393,0.000019067038],"about_ca_topic_score_codex":0.0013206928,"about_ca_topic_score_gemma":0.0016004652,"teacher_disagreement_score":0.008122864,"about_ca_system_score_codex":0.0007733882,"about_ca_system_score_gemma":0.0010945669,"threshold_uncertainty_score":0.027173698},"labels":[],"label_agreement":null},{"id":"W2075640534","doi":"10.1088/0266-5611/17/2/302","title":"<i>m</i> -functions and inverse generalized eigenvalue problem","year":2001,"lang":"en","type":"article","venue":"Inverse Problems","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Inverse; Inverse problem; Diagonal; Matrix (chemical analysis); Generalized inverse; Diagonal matrix; Applied mathematics; Combinatorics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.020687835063084706,"score_gpt":0.2265003076252016,"score_spread":0.20581247256211688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075640534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075166844,0.0019816558,0.88719565,0.0021226292,0.0003066997,0.00003077185,0.00007495306,0.00015733977,0.032963503],"genre_scores_gemma":[0.8146188,0.002109675,0.15639897,0.0006934475,0.00060562755,0.00014984958,0.00017355657,0.00018475777,0.025065295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996939,0.00013072828,0.000008942205,0.000046830217,0.000056611363,0.00006300625],"domain_scores_gemma":[0.99942267,0.00027443457,0.00009623413,0.000038855524,0.000100613586,0.000067190704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008250747,0.0009238317,0.0005073318,0.00078846235,0.0005977702,0.0011007178,0.00080026774,0.0012562871,0.0028785015],"category_scores_gemma":[0.0023175636,0.00024503283,0.0004336629,0.00048278022,0.00198933,0.0016107828,0.0011074233,0.0012268247,0.00077371515],"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.00005422188,0.000051575567,0.0006587955,0.00012339425,0.000024401148,0.0003105283,0.00018768296,0.07644302,0.0036108177,0.89350927,0.0058763297,0.019150052],"study_design_scores_gemma":[0.000014437132,0.00004836851,0.0003259637,0.00004123997,0.000006786582,0.0002208026,0.0001246077,0.41244715,0.0014396545,0.5787739,0.0065301475,0.00002695825],"about_ca_topic_score_codex":0.0010274878,"about_ca_topic_score_gemma":0.00042067765,"teacher_disagreement_score":0.0028785015,"about_ca_system_score_codex":0.0004204079,"about_ca_system_score_gemma":0.00042571046,"threshold_uncertainty_score":0.009629488},"labels":[],"label_agreement":null},{"id":"W2075789590","doi":"10.1145/1940475.1940490","title":"Cache friendly sparse matrix-vector multiplication","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Lethbridge; Western University","funders":"","keywords":"Multiplication (music); Computer science; Matrix multiplication; Kernel (algebra); Sparse matrix; Parallel computing; Column (typography); Cache; Matrix (chemical analysis); Conjugate gradient method; Cache-oblivious algorithm; CPU cache; Algorithm; Computational complexity theory; Cache algorithms; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.05468255262939944,"score_gpt":0.2969070496063049,"score_spread":0.24222449697690543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075789590","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07604027,0.00078361225,0.9089192,0.00033044931,0.00014102984,0.00006289717,0.00031690646,0.0048198216,0.008585693],"genre_scores_gemma":[0.52992636,0.00037836257,0.4610367,0.0001423951,0.00010506649,0.0001393544,0.0007690444,0.00037628732,0.007126393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920136,0.0001749927,0.000044878714,0.000069394795,0.00041692663,0.00009248629],"domain_scores_gemma":[0.99756,0.00081095396,0.00017387186,0.0007157234,0.0006516269,0.00008772409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004673296,0.00049126626,0.0006403344,0.00052021275,0.0006105533,0.0008239744,0.0009875054,0.0004932008,0.004894355],"category_scores_gemma":[0.0042666337,0.00022036818,0.0002479874,0.0013255292,0.00033389192,0.0015201372,0.0010429318,0.00070780556,0.0018264541],"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.0011569023,0.0002709266,0.0043575265,0.00042270782,0.00010718324,0.00050094665,0.000294527,0.26522908,0.057850976,0.07914682,0.03542125,0.5552412],"study_design_scores_gemma":[0.000043605287,0.00012743521,0.0004061633,0.000013128541,0.0000109701,0.00014911834,0.000037389564,0.9563692,0.016636202,0.019621778,0.006570227,0.000014756972],"about_ca_topic_score_codex":0.0022344335,"about_ca_topic_score_gemma":0.0060560894,"teacher_disagreement_score":0.004894355,"about_ca_system_score_codex":0.00040242384,"about_ca_system_score_gemma":0.0012645653,"threshold_uncertainty_score":0.016373217},"labels":[],"label_agreement":null},{"id":"W2075924802","doi":"10.1016/s0024-3795(02)00345-2","title":"Upper and lower bounds for ranks of matrix expressions using generalized inverses","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Schur complement; Inverse; Matrix (chemical analysis); Complement (music); Combinatorics; Generalized inverse; Moore–Penrose pseudoinverse; Rank (graph theory); Upper and lower bounds; Expression (computer science); Pure mathematics; Mathematical analysis; Geometry; Eigenvalues and eigenvectors","score_opus":0.027237988947309295,"score_gpt":0.2822941735064546,"score_spread":0.2550561845591453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075924802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030214682,0.0045951125,0.927488,0.001882341,0.0005977682,0.00014928158,0.00051410653,0.0016607356,0.032897867],"genre_scores_gemma":[0.53732854,0.006919373,0.41790724,0.0013627374,0.0041792146,0.00058064575,0.0013759157,0.0022332869,0.02811303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9832864,0.004854688,0.00085792044,0.0021063804,0.0064155194,0.0024790945],"domain_scores_gemma":[0.9309817,0.047060657,0.003321214,0.009150415,0.0071274512,0.0023585234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01029103,0.0044086687,0.0029962528,0.007587485,0.002479065,0.010106603,0.005256542,0.0032599058,0.015359109],"category_scores_gemma":[0.06453818,0.0017950749,0.0028770305,0.0052126013,0.0073214713,0.017764125,0.008425928,0.0100207245,0.0063639716],"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.00045110303,0.00029580307,0.0009926241,0.00058488746,0.00010970548,0.00023044286,0.0006755394,0.036852717,0.005745725,0.84346265,0.009195023,0.10140381],"study_design_scores_gemma":[0.000031291933,0.00013396956,0.00044785664,0.00015697368,0.000093729854,0.00028536568,0.0001559697,0.13567264,0.006239814,0.8500007,0.006645977,0.00013583618],"about_ca_topic_score_codex":0.00077631447,"about_ca_topic_score_gemma":0.0016952995,"teacher_disagreement_score":0.015359109,"about_ca_system_score_codex":0.0022273487,"about_ca_system_score_gemma":0.0022194753,"threshold_uncertainty_score":0.054424822},"labels":[],"label_agreement":null},{"id":"W2076020455","doi":"10.1016/s0096-3003(02)00598-2","title":"Condition number of Drazin inverse and their condition numbers of singular linear systems","year":2003,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":22,"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":"University of Regina","keywords":"Drazin inverse; Mathematics; Condition number; Sensitivity (control systems); Linear system; Inverse; Singular value; Upper and lower bounds; Measure (data warehouse); Perturbation (astronomy); Applied mathematics; Mathematical analysis; Geometry; Computer science; Eigenvalues and eigenvectors; Physics","score_opus":0.011062778778251644,"score_gpt":0.24928521107026042,"score_spread":0.23822243229200876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076020455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42480582,0.0014946277,0.4386193,0.0017675047,0.00045378733,0.000099125005,0.00050978514,0.00038227852,0.13186775],"genre_scores_gemma":[0.94484437,0.0007197256,0.035829097,0.00020833538,0.0002486087,0.00010373244,0.00025063887,0.00015436349,0.01764107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918693,0.00021717402,0.000040561044,0.00013314317,0.00030523894,0.000116800715],"domain_scores_gemma":[0.99486595,0.002723352,0.00058763765,0.0003245503,0.0009979425,0.000500525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014112607,0.0006514125,0.000537239,0.0022846153,0.0012958408,0.0026128462,0.00088684156,0.001182032,0.014883778],"category_scores_gemma":[0.008720201,0.00031777256,0.00040951473,0.0010099015,0.002738071,0.0034760102,0.0010257507,0.0019405809,0.0013868159],"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.000079612335,0.000023336599,0.00026866575,0.00005496739,0.0000047194503,0.00004556087,0.00017319934,0.0046015093,0.0019755666,0.984315,0.0010908362,0.0073670396],"study_design_scores_gemma":[0.000015679243,0.000041692976,0.0004498916,0.000024696217,0.000005667338,0.00013841008,0.00010257905,0.05415199,0.0020466428,0.9410976,0.0018802573,0.000044813896],"about_ca_topic_score_codex":0.0006762185,"about_ca_topic_score_gemma":0.0007262816,"teacher_disagreement_score":0.014883778,"about_ca_system_score_codex":0.00098125,"about_ca_system_score_gemma":0.00091190357,"threshold_uncertainty_score":0.049791217},"labels":[],"label_agreement":null},{"id":"W207628992","doi":"","title":"Extremal Matrices of Generalized Exponents of Primitive Nearly Reducible Matrices.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Combinatorics","score_opus":0.020475206867856043,"score_gpt":0.23593862173507596,"score_spread":0.21546341486721993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W207628992","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7832451,0.0013022176,0.124298826,0.0010853667,0.00039712174,0.00009071687,0.00047771755,0.00037052142,0.08873249],"genre_scores_gemma":[0.9685384,0.0003622034,0.018071162,0.00015327285,0.00026970656,0.000035893856,0.00020973383,0.00007584322,0.012283739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994892,0.00011855153,0.000024181545,0.00008379124,0.00017486425,0.0001093828],"domain_scores_gemma":[0.9989151,0.00039108092,0.000220804,0.00016904608,0.00012693694,0.00017707329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004281299,0.00055869744,0.0004552556,0.0014078317,0.0008197235,0.0020880338,0.00060501695,0.0006455576,0.009313866],"category_scores_gemma":[0.0037091363,0.00034317776,0.00035113603,0.0005561697,0.0015935329,0.0025519708,0.0014485712,0.0015097203,0.0013790053],"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.00012172079,0.000029559596,0.000730878,0.00005519606,0.000011933388,0.00028366238,0.00020356654,0.00212046,0.0035453578,0.9786028,0.0022986147,0.011996301],"study_design_scores_gemma":[0.000025937572,0.00003926681,0.00052257685,0.000028179467,0.000008655927,0.00042251305,0.00012841946,0.013275523,0.0022342799,0.97960424,0.0036918449,0.000018536572],"about_ca_topic_score_codex":0.000263403,"about_ca_topic_score_gemma":0.0005044194,"teacher_disagreement_score":0.009313866,"about_ca_system_score_codex":0.00046736724,"about_ca_system_score_gemma":0.00025532025,"threshold_uncertainty_score":0.03115791},"labels":[],"label_agreement":null},{"id":"W2076398485","doi":"10.1145/1394042.1394103","title":"Efficient order basis computation (abstract only)","year":2008,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Basis (linear algebra); Computation; Mathematics; Polynomial basis; Matrix (chemical analysis); Reduction (mathematics); Order (exchange); Interpolation (computer graphics); Basis function; Computer science; Applied mathematics; Algorithm; Mathematical analysis; Geometry; Artificial intelligence","score_opus":0.038041249625672124,"score_gpt":0.2937833124075733,"score_spread":0.2557420627819012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076398485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022521654,0.0002975815,0.9232565,0.00031546724,0.0003541837,0.000111078094,0.0010379266,0.009308134,0.042797472],"genre_scores_gemma":[0.38569444,0.00041091064,0.54807484,0.00027337202,0.00028472478,0.00018660388,0.0046616993,0.0033830274,0.05703038],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995265,0.00006221151,0.000021657708,0.00006863756,0.00023942588,0.00008159297],"domain_scores_gemma":[0.99944264,0.00007545123,0.000017212478,0.00025998036,0.00017058125,0.00003420623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003035942,0.0007155801,0.00085465744,0.0009535595,0.00068660284,0.0016134706,0.00087562826,0.00044612563,0.037751738],"category_scores_gemma":[0.0015768958,0.00033799603,0.0008003558,0.0012131279,0.00050543103,0.0017452867,0.001811646,0.0011150854,0.015980223],"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.00038033084,0.000107922686,0.0007390252,0.00039514108,0.00006182443,0.000282739,0.00021503761,0.027548607,0.02108843,0.39411455,0.08518197,0.46988454],"study_design_scores_gemma":[0.00009966366,0.00009324522,0.0005278531,0.000067180714,0.00003370792,0.00033050004,0.00008999749,0.3556804,0.049451355,0.49172786,0.10184545,0.000052803814],"about_ca_topic_score_codex":0.0010607763,"about_ca_topic_score_gemma":0.0024666754,"teacher_disagreement_score":0.037751738,"about_ca_system_score_codex":0.00048796224,"about_ca_system_score_gemma":0.0007290929,"threshold_uncertainty_score":0.12629211},"labels":[],"label_agreement":null},{"id":"W2076449511","doi":"10.1016/j.jspi.2008.11.017","title":"On consistency, natural restrictions and estimability under classical and extended growth curve models","year":2009,"lang":"en","type":"article","venue":"Journal of Statistical Planning and Inference","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Consistency (knowledge bases); Estimator; Applied mathematics; Growth curve (statistics); Matrix (chemical analysis); Statistics; Discrete mathematics","score_opus":0.028694088617012795,"score_gpt":0.3067868434325413,"score_spread":0.27809275481552853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076449511","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08306156,0.0013505263,0.90475065,0.004882036,0.00013484214,0.0001619654,0.0008175326,0.00026769136,0.0045732902],"genre_scores_gemma":[0.7655144,0.0023232058,0.22099249,0.002085203,0.0012235467,0.00076751463,0.0026259392,0.00038776215,0.0040799654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.94784784,0.03652843,0.0031299863,0.0072017116,0.0035635182,0.0017284271],"domain_scores_gemma":[0.228437,0.72350043,0.015155938,0.023615388,0.007617646,0.0016735648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.08755803,0.0015518403,0.0061870143,0.0036917687,0.0021070112,0.0060998797,0.009762727,0.005780877,0.0063392823],"category_scores_gemma":[0.4551227,0.0026865336,0.0038696076,0.0051801084,0.016627051,0.019357197,0.0094319,0.010413797,0.0005694968],"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.00061911915,0.00014774501,0.0099199405,0.00045293476,0.0005218799,0.0004986235,0.00088072446,0.054824222,0.00032838114,0.9090233,0.0020451413,0.020738004],"study_design_scores_gemma":[0.00012541882,0.00008133668,0.0011006716,0.000077597426,0.000075923526,0.00014675522,0.000111048386,0.08717317,0.0002387838,0.91016364,0.0006577696,0.0000477513],"about_ca_topic_score_codex":0.004592067,"about_ca_topic_score_gemma":0.0023098225,"teacher_disagreement_score":0.08755803,"about_ca_system_score_codex":0.0019214756,"about_ca_system_score_gemma":0.003936637,"threshold_uncertainty_score":0.46305668},"labels":[],"label_agreement":null},{"id":"W2076587164","doi":"10.1016/j.laa.2005.01.007","title":"Optimal measures for Toeplitz matrices","year":2005,"lang":"en","type":"article","venue":"Linear Algebra and its 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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Toeplitz matrix; Mathematics; Schur complement; Extreme point; Unit sphere; Measure (data warehouse); Pure mathematics; Norm (philosophy); Matrix (chemical analysis); Matrix norm; Combinatorics; Eigenvalues and eigenvectors","score_opus":0.015035001110870767,"score_gpt":0.2650263633801431,"score_spread":0.24999136226927235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076587164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06232913,0.001961636,0.9248554,0.0009963055,0.00024635068,0.00005436176,0.00014094399,0.00028615032,0.009129704],"genre_scores_gemma":[0.7855489,0.0027657608,0.19907317,0.00071823085,0.0008079146,0.00027663252,0.00031703556,0.00039875068,0.010093623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964665,0.0013018781,0.00020070632,0.00060523907,0.0009977695,0.00042784036],"domain_scores_gemma":[0.98836714,0.0066029523,0.0012802348,0.0012859517,0.0014623028,0.001001418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038384632,0.0012822475,0.0016009843,0.0025349306,0.0012279769,0.0044509205,0.0020546126,0.0017122069,0.0041190484],"category_scores_gemma":[0.020951713,0.00078524905,0.0006952951,0.0022179498,0.0035173015,0.0078839725,0.0032522439,0.0029716033,0.0005794554],"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.000056732104,0.000054038108,0.00019478438,0.00007547149,0.000024391682,0.000017882816,0.00008797774,0.017373068,0.0013778114,0.9552328,0.0014759067,0.024029065],"study_design_scores_gemma":[0.000013786994,0.00004658341,0.00014469225,0.000023721766,0.000010013936,0.000024814222,0.000043182692,0.08784194,0.0010693045,0.9096677,0.0010939625,0.000020247544],"about_ca_topic_score_codex":0.00080603675,"about_ca_topic_score_gemma":0.0010888702,"teacher_disagreement_score":0.0044509205,"about_ca_system_score_codex":0.002636808,"about_ca_system_score_gemma":0.0016051029,"threshold_uncertainty_score":0.020299971},"labels":[],"label_agreement":null},{"id":"W2076733016","doi":"10.1002/cjs.5550350410","title":"Nonlinear functional models for functional responses in reproducing kernel hilbert spaces","year":2007,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Reproducing kernel Hilbert space; Hilbert space; Kernel (algebra); Smoothing; Estimator; Nonlinear system; Applied mathematics; Kernel regression; Computer science; Extension (predicate logic); Kernel method; Mathematics; Representer theorem; Kernel smoother; Nonlinear regression; Nonparametric regression; Algorithm; Artificial intelligence; Regression analysis; Machine learning; Kernel embedding of distributions; Support vector machine; Statistics; Discrete mathematics; Pure mathematics; Radial basis function kernel","score_opus":0.03725385583395897,"score_gpt":0.2508526050452271,"score_spread":0.21359874921126815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076733016","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013575971,0.00024646922,0.98313683,0.00056870066,0.00004887456,0.000029793424,0.000044333516,0.0000774597,0.002271585],"genre_scores_gemma":[0.8045563,0.0007330847,0.17577547,0.00046433078,0.0002029821,0.0003644025,0.00021951784,0.00016171481,0.017522292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746835,0.0016452756,0.00007379192,0.00023330166,0.00041747722,0.00016176939],"domain_scores_gemma":[0.99534684,0.003195798,0.00044975942,0.0002998998,0.0005622039,0.00014561883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005878585,0.0008370186,0.0009809004,0.0008063802,0.00031435824,0.0012613079,0.0016683232,0.0018354938,0.0032658018],"category_scores_gemma":[0.0106394775,0.000414599,0.0012967365,0.0005674606,0.0022367556,0.0019473364,0.0017435473,0.0017729257,0.0005772331],"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.00004261142,0.00006486483,0.0005289266,0.00010282078,0.000069769885,0.00012056696,0.00021240041,0.30041632,0.0024583759,0.6826713,0.0011510287,0.012160979],"study_design_scores_gemma":[0.0000055241176,0.000018116874,0.0001471132,0.000008277323,0.0000055308387,0.000023392895,0.000012244085,0.9072731,0.00018402377,0.09176775,0.0005440386,0.000010953025],"about_ca_topic_score_codex":0.0030945174,"about_ca_topic_score_gemma":0.0017860587,"teacher_disagreement_score":0.005878585,"about_ca_system_score_codex":0.0013969404,"about_ca_system_score_gemma":0.00070923666,"threshold_uncertainty_score":0.031089306},"labels":[],"label_agreement":null},{"id":"W2077108379","doi":"10.1504/ijica.2009.027997","title":"A modified version of Jacobi approach","year":2009,"lang":"en","type":"article","venue":"International Journal of Innovative Computing 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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Set (abstract data type); Prime (order theory); Jacobi method; Algorithm; Mathematical optimization; Filter (signal processing); Theoretical computer science; Applied mathematics; Mathematics; Programming language","score_opus":0.014448931671422222,"score_gpt":0.29157992173638175,"score_spread":0.27713099006495956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077108379","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004252025,0.000335562,0.9872114,0.00017209175,0.00023140214,0.00008012785,0.00007413025,0.00042997347,0.0072133057],"genre_scores_gemma":[0.10999586,0.00056056096,0.8678104,0.00022357005,0.00027311148,0.00026723553,0.00023313725,0.0003188385,0.02031719],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926525,0.000106876985,0.0000371892,0.0001259977,0.00041413883,0.00005046769],"domain_scores_gemma":[0.99955684,0.00010834151,0.000032010088,0.000093489165,0.00018247297,0.000026786167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005538643,0.00061144895,0.0009488089,0.00055591983,0.00056257745,0.00066939637,0.0016478412,0.0007293452,0.005704122],"category_scores_gemma":[0.0011388145,0.00037225673,0.0009661558,0.00071744394,0.00048832264,0.0010005769,0.0009424458,0.0010185402,0.0019657454],"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.00021067882,0.00016903045,0.0013672384,0.00056299445,0.00020013377,0.00032071877,0.00035657056,0.25388512,0.03981449,0.14070278,0.0144334985,0.5479767],"study_design_scores_gemma":[0.000034650282,0.0001088067,0.00035341296,0.00001643359,0.000026819593,0.00025870453,0.00003380512,0.94422275,0.005950071,0.02368982,0.025270611,0.00003406103],"about_ca_topic_score_codex":0.0030256708,"about_ca_topic_score_gemma":0.0035172931,"teacher_disagreement_score":0.005704122,"about_ca_system_score_codex":0.0004160435,"about_ca_system_score_gemma":0.0018916882,"threshold_uncertainty_score":0.019082248},"labels":[],"label_agreement":null},{"id":"W2077741232","doi":"10.1145/2755996.2756672","title":"A Relaxed Algorithm for Online Matrix Inversion","year":2015,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":10,"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":"Invertible matrix; Algorithm; Dimension (graph theory); Matrix (chemical analysis); Iterative method; Computation; Rank (graph theory); Computer science; Multiplication (music); Matrix multiplication; Inversion (geology); Row; Field (mathematics); Row and column spaces; Mathematics; Combinatorics; Pure mathematics","score_opus":0.03083502350588944,"score_gpt":0.28673256539303027,"score_spread":0.2558975418871408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077741232","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017780849,0.000023035005,0.9962704,0.00006145199,0.000017634622,0.000028909155,0.000040347,0.0006561368,0.0011240254],"genre_scores_gemma":[0.06129534,0.000059421614,0.9340154,0.00011175853,0.00005419168,0.00014691937,0.00032633773,0.00020718358,0.0037833808],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979989,0.0004477282,0.000116446645,0.00035981563,0.0008306071,0.00024639955],"domain_scores_gemma":[0.99786466,0.000620022,0.00012817184,0.0008489398,0.00046032004,0.00007787624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001519365,0.0010677376,0.0010261935,0.00056984543,0.0005609847,0.0016717035,0.002598795,0.0014266723,0.010170618],"category_scores_gemma":[0.0054791397,0.00065214775,0.0008551291,0.00091493136,0.0008969355,0.003071682,0.0029460408,0.0027664194,0.004945045],"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.0005804133,0.0003043398,0.0006159694,0.00026163174,0.000057967285,0.000210371,0.00031273765,0.24188292,0.026951987,0.16816759,0.013038322,0.54761565],"study_design_scores_gemma":[0.000054102027,0.000109054425,0.000098432676,0.000015222066,0.000008760225,0.00013089128,0.000035778223,0.94797224,0.007416104,0.03748372,0.006652969,0.000022744514],"about_ca_topic_score_codex":0.0021477195,"about_ca_topic_score_gemma":0.0031912907,"teacher_disagreement_score":0.010170618,"about_ca_system_score_codex":0.00072834047,"about_ca_system_score_gemma":0.0019192804,"threshold_uncertainty_score":0.03402406},"labels":[],"label_agreement":null},{"id":"W2078262122","doi":"10.1080/03081080008818654","title":"Cone-transitive matrix semigroups","year":2000,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","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":"Dalhousie University; University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transitive relation; Mathematics; Cone (formal languages); Pure mathematics; Mathematics Subject Classification; Characterization (materials science); Vector space; Field (mathematics); Matrix (chemical analysis); Combinatorics; Discrete mathematics; Algorithm","score_opus":0.007210006518639762,"score_gpt":0.2516920172231664,"score_spread":0.24448201070452666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078262122","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6403853,0.00037201802,0.28774574,0.0006190962,0.00021717745,0.0001554019,0.0004842747,0.00048905815,0.06953191],"genre_scores_gemma":[0.9722678,0.000118100106,0.016129583,0.00006144203,0.00008902837,0.00006656843,0.00024223255,0.000028349375,0.010996967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993994,0.00014412458,0.000043496522,0.00011903707,0.00019995506,0.000093977666],"domain_scores_gemma":[0.99854517,0.00041131827,0.00028694823,0.00016857848,0.0002963561,0.00029158153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006396375,0.0003339123,0.0002292495,0.0006138046,0.00068770593,0.0015069413,0.0003504939,0.00022815051,0.005664327],"category_scores_gemma":[0.0016003135,0.0001489258,0.00042888452,0.00027595446,0.0012416685,0.0012171987,0.00066564966,0.00051125814,0.0005308957],"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.000070364185,0.00002906043,0.00047462,0.0000316254,0.0000042708753,0.00030977253,0.00045912404,0.0013735152,0.008000374,0.983145,0.00080990535,0.0052924016],"study_design_scores_gemma":[0.000046250654,0.00016485887,0.0009066487,0.000020866215,0.000010897228,0.00075888546,0.0003734692,0.027583731,0.008161254,0.95163023,0.010313629,0.000029205217],"about_ca_topic_score_codex":0.00044355617,"about_ca_topic_score_gemma":0.00045746655,"teacher_disagreement_score":0.005664327,"about_ca_system_score_codex":0.0005113481,"about_ca_system_score_gemma":0.00041304238,"threshold_uncertainty_score":0.018949032},"labels":[],"label_agreement":null},{"id":"W2078367643","doi":"10.1016/j.laa.2006.05.019","title":"Sets of matrices with given joint numerical range","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Numerical range; Mathematics; Hermitian matrix; Range (aeronautics); Joint (building); Tuple; Complex matrix; Matrix (chemical analysis); Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.009020625771616279,"score_gpt":0.22663036440858308,"score_spread":0.2176097386369668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078367643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09184605,0.0009413765,0.87367743,0.00073318183,0.000157495,0.00013998878,0.0023470323,0.0018389164,0.02831852],"genre_scores_gemma":[0.69564867,0.001083673,0.2863139,0.0004473881,0.00035084932,0.0006551584,0.00376371,0.00054516876,0.011191414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956247,0.0012172424,0.00034423172,0.0009261608,0.0015100362,0.0003776333],"domain_scores_gemma":[0.98672926,0.0066786828,0.001434175,0.0023324825,0.0021824846,0.00064286636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018719069,0.0013163885,0.0014053053,0.0040791375,0.001392488,0.0056573004,0.0018428128,0.0013379642,0.008112119],"category_scores_gemma":[0.019995714,0.0007517307,0.0011072024,0.002590383,0.0025682098,0.004937716,0.0036269012,0.0018353908,0.0023652024],"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.0006614287,0.0002369719,0.0020210496,0.0005349649,0.00016230153,0.0003896773,0.0008939338,0.01976129,0.014590176,0.84854865,0.0052666124,0.10693292],"study_design_scores_gemma":[0.00006983121,0.00014207834,0.0010137834,0.00020272864,0.00006112403,0.0007408154,0.0002544412,0.07813082,0.013815647,0.89521265,0.010250109,0.000105954256],"about_ca_topic_score_codex":0.0002941865,"about_ca_topic_score_gemma":0.0002630825,"teacher_disagreement_score":0.008112119,"about_ca_system_score_codex":0.00064970163,"about_ca_system_score_gemma":0.0007682878,"threshold_uncertainty_score":0.027137816},"labels":[],"label_agreement":null},{"id":"W2078456473","doi":"10.1007/s10958-005-0154-7","title":"Block LU factorization is stable for block matrices whose inverses are block diagonally dominant","year":2005,"lang":"en","type":"article","venue":"Journal of Mathematical Sciences","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Diagonally dominant matrix; Factorization; Block (permutation group theory); Row; Inverse; Block matrix; LU decomposition; Diagonal; Matrix decomposition; Pure mathematics; Algorithm; Invertible matrix; Geometry; Eigenvalues and eigenvectors; Computer science; Physics","score_opus":0.025042491925315852,"score_gpt":0.2783652091636581,"score_spread":0.2533227172383422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078456473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042008165,0.0002977799,0.949423,0.00035107028,0.00018692792,0.00007419351,0.00030760947,0.0009641557,0.0063871304],"genre_scores_gemma":[0.76995337,0.00075769564,0.20423871,0.00066011265,0.000536943,0.00034409898,0.0015005007,0.00078363,0.021224972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988005,0.00024921724,0.000048847,0.0002718197,0.0004123273,0.00021735106],"domain_scores_gemma":[0.9948985,0.0020448817,0.0005761224,0.00078780466,0.0014975277,0.00019513913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010999098,0.0014555737,0.0012769233,0.0010985134,0.0011012648,0.0020326367,0.00057377625,0.0010119654,0.0066172895],"category_scores_gemma":[0.0111946035,0.00061157666,0.0005250326,0.0011169533,0.001493938,0.0027813443,0.0012722276,0.0012088289,0.004262952],"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.0024981408,0.00035640338,0.0024983005,0.0005949856,0.0002250676,0.00050202245,0.00072891545,0.09995574,0.20606683,0.3790761,0.020882709,0.28661484],"study_design_scores_gemma":[0.00015365984,0.00051749486,0.00097199733,0.000050623534,0.00004979123,0.00033505887,0.00031025818,0.6132773,0.0349514,0.34186724,0.007413129,0.000102057646],"about_ca_topic_score_codex":0.0012288732,"about_ca_topic_score_gemma":0.0016040212,"teacher_disagreement_score":0.0066172895,"about_ca_system_score_codex":0.00041130604,"about_ca_system_score_gemma":0.0012768977,"threshold_uncertainty_score":0.022136986},"labels":[],"label_agreement":null},{"id":"W2078784171","doi":"10.1016/j.jmaa.2006.06.017","title":"A class of nonlinear equations in Hilbert space and its application to completeness problems","year":2006,"lang":"en","type":"article","venue":"Journal of Mathematical 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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Completeness (order theory); Hilbert space; Nonlinear system; Class (philosophy); Mathematical analysis; Applied mathematics; Calculus (dental); Pure mathematics; Algebra over a field; Computer science","score_opus":0.013215954698368513,"score_gpt":0.25957948550737947,"score_spread":0.24636353080901097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078784171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10283717,0.0019958627,0.8335899,0.006817071,0.00067628425,0.00018136168,0.0007060171,0.00019601572,0.053000327],"genre_scores_gemma":[0.7011765,0.0042634835,0.2380994,0.0015259531,0.0026405312,0.00039984056,0.00089882227,0.00024570138,0.050749704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928373,0.00027253514,0.000050267405,0.00011332646,0.00021123585,0.00006895138],"domain_scores_gemma":[0.99686074,0.0017167211,0.00029680712,0.00023185703,0.0005413584,0.0003524037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019828368,0.0007853617,0.0010719753,0.0015665247,0.0016793214,0.0017395678,0.001327963,0.002466549,0.004007616],"category_scores_gemma":[0.008122965,0.00046676665,0.0014014483,0.0012280407,0.0027160225,0.004365753,0.0028685112,0.0036882716,0.0004532907],"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.000008286935,0.000016593347,0.00024165926,0.000036101563,0.000008958698,0.00006496143,0.00014071038,0.0026516474,0.0005179643,0.99025095,0.0018293331,0.004232809],"study_design_scores_gemma":[0.000011142534,0.000017195089,0.00023589881,0.000010785181,0.0000057981283,0.00013321727,0.000066263485,0.042398978,0.000165833,0.95281404,0.004127248,0.000013648968],"about_ca_topic_score_codex":0.002426412,"about_ca_topic_score_gemma":0.001994184,"teacher_disagreement_score":0.004007616,"about_ca_system_score_codex":0.00096428755,"about_ca_system_score_gemma":0.0012743768,"threshold_uncertainty_score":0.013406813},"labels":[],"label_agreement":null},{"id":"W2079287897","doi":"10.1007/s10910-015-0509-3","title":"A structure-preserving algorithm for linear systems with circulant pentadiagonal coefficient matrices","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematical Chemistry","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"National Natural Science Foundation of China","keywords":"Circulant matrix; Coefficient matrix; Algorithm; Factorization; Linear system; MATLAB; Mathematics; System of linear equations; Computer science; Matrix (chemical analysis); Order (exchange); Applied mathematics; Mathematical analysis; Eigenvalues and eigenvectors","score_opus":0.02081461431451483,"score_gpt":0.25922877451073506,"score_spread":0.23841416019622022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079287897","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0097163925,0.000049214716,0.98668784,0.00010349494,0.0000521191,0.000093140334,0.00005046115,0.0008034568,0.0024438275],"genre_scores_gemma":[0.11032372,0.00007984337,0.88465255,0.00011930438,0.00005161613,0.0002208856,0.00027627507,0.0002571439,0.0040186876],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943644,0.00010828084,0.000033369186,0.00010292813,0.00023471516,0.00008427269],"domain_scores_gemma":[0.9988895,0.00045642967,0.000058458332,0.00029582396,0.00023045232,0.00006934033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006331538,0.00085133564,0.0007561251,0.00063841545,0.0008814722,0.001002057,0.0018118256,0.00096149277,0.006517576],"category_scores_gemma":[0.003118788,0.00054645276,0.00074402115,0.0007929051,0.0007415978,0.0012653068,0.002536238,0.0020473357,0.0022753337],"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.00046376238,0.00039934134,0.0005729998,0.0002875355,0.00007769232,0.000229739,0.00034175362,0.19446692,0.023373095,0.10534003,0.01249575,0.6619514],"study_design_scores_gemma":[0.00010642484,0.00020166537,0.0001137273,0.00001657811,0.000020256735,0.00013162447,0.00005956676,0.91239303,0.012820979,0.068958916,0.005154659,0.000022546723],"about_ca_topic_score_codex":0.0014862806,"about_ca_topic_score_gemma":0.0025449635,"teacher_disagreement_score":0.006517576,"about_ca_system_score_codex":0.0004089542,"about_ca_system_score_gemma":0.0015830472,"threshold_uncertainty_score":0.021803498},"labels":[],"label_agreement":null},{"id":"W2079678340","doi":"10.1093/imrn/rnm086","title":"Operator-valued Semicircular Elements: Solving A Quadratic Matrix Equation with Positivity Constraints","year":2007,"lang":"en","type":"article","venue":"International Mathematics Research Notices","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Queen (butterfly); Mathematics; Operator (biology)","score_opus":0.06121214032924077,"score_gpt":0.38930418516642756,"score_spread":0.3280920448371868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079678340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034639724,0.00009308948,0.95716035,0.00036053892,0.000047078105,0.000030932486,0.000026498463,0.000081973216,0.007559819],"genre_scores_gemma":[0.6804838,0.00028504772,0.30063233,0.0002521167,0.00010596783,0.00019910965,0.000100421385,0.00019159203,0.017749593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996567,0.0001362501,0.000011366347,0.000037747457,0.000117795506,0.000040268198],"domain_scores_gemma":[0.9986286,0.0010108177,0.00008460599,0.000070074646,0.00013357785,0.000072299605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009532879,0.0005697881,0.0005462325,0.00028722844,0.0003802927,0.0007876337,0.0009948142,0.0010706884,0.003432718],"category_scores_gemma":[0.0048613534,0.00028599225,0.00030535707,0.0004822352,0.0013771239,0.0011708351,0.0012472805,0.0010650748,0.00040985591],"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.00010789032,0.00007748293,0.00040101106,0.00018851808,0.000024967409,0.00020920591,0.00033651432,0.49818882,0.007444049,0.46772617,0.0016637774,0.023631569],"study_design_scores_gemma":[0.000013554188,0.000017767437,0.00002603803,0.000005124939,0.0000019885942,0.000017328468,0.00001787507,0.93813795,0.0007960843,0.060459003,0.00050200964,0.0000053261],"about_ca_topic_score_codex":0.001641325,"about_ca_topic_score_gemma":0.0015237333,"teacher_disagreement_score":0.003432718,"about_ca_system_score_codex":0.00040964945,"about_ca_system_score_gemma":0.0007956655,"threshold_uncertainty_score":0.01148361},"labels":[],"label_agreement":null},{"id":"W2080022619","doi":"10.1016/s0024-3795(01)00297-x","title":"Rank equalities for idempotent and involutary matrices","year":2001,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Idempotent matrix; Idempotence; Rank (graph theory); Hermitian matrix; Scalar (mathematics); Combinatorics; Algebra over a field; Commutator; Pure mathematics; Geometry","score_opus":0.020965737596375617,"score_gpt":0.2691860662872015,"score_spread":0.24822032869082586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080022619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35315126,0.0034959556,0.46841687,0.0035476577,0.00082474505,0.00012111838,0.00107347,0.0009031213,0.16846584],"genre_scores_gemma":[0.922586,0.0014994189,0.03747592,0.00062715256,0.0010749036,0.00011081614,0.00068813906,0.00032982545,0.035607792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718285,0.00062071823,0.00018015468,0.00048525256,0.0010210117,0.0005099699],"domain_scores_gemma":[0.9894628,0.0062101786,0.0012353583,0.0011763822,0.0010715158,0.0008438849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026717884,0.0010917609,0.0009862512,0.003154435,0.0023737124,0.006098779,0.0014098644,0.0013660763,0.017216578],"category_scores_gemma":[0.013674498,0.0008285405,0.00087326573,0.0028375809,0.004231714,0.011607861,0.0031248084,0.0034345095,0.0024961638],"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.000121320525,0.00004936065,0.0004065909,0.00005949121,0.0000103613165,0.00013667753,0.00042846665,0.0011365374,0.0011562103,0.9774296,0.0031245274,0.015940849],"study_design_scores_gemma":[0.000013009789,0.00001833796,0.00015513784,0.000009960673,0.0000070719097,0.00013569277,0.000079822785,0.0029354326,0.0008150695,0.9943293,0.0014830919,0.000018017296],"about_ca_topic_score_codex":0.00063052465,"about_ca_topic_score_gemma":0.0010392264,"teacher_disagreement_score":0.017216578,"about_ca_system_score_codex":0.0010267391,"about_ca_system_score_gemma":0.0007689394,"threshold_uncertainty_score":0.057595253},"labels":[],"label_agreement":null},{"id":"W2080176999","doi":"10.1016/s0024-3795(01)00267-1","title":"A triangle inequality in Hilbert modules over matrix algebras","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Pure mathematics; Triangle inequality; Inequality; Matrix (chemical analysis); Algebra over a field; Quaternion; Combinatorics; Mathematical analysis; Geometry","score_opus":0.020008916962339553,"score_gpt":0.26900739437590904,"score_spread":0.24899847741356948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080176999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18924414,0.0028951068,0.6606352,0.007831952,0.0015084593,0.000058836147,0.00052494,0.0005266266,0.13677476],"genre_scores_gemma":[0.90093875,0.0016004111,0.057837393,0.0015869908,0.0014483406,0.00012148128,0.0005086205,0.00039668492,0.03556143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981894,0.00049108657,0.000095856405,0.00039836665,0.0005883571,0.0002369744],"domain_scores_gemma":[0.99408096,0.0036459728,0.000393951,0.00058388273,0.00076990866,0.00052530825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021917378,0.0006375515,0.0012321591,0.0017894836,0.0019030147,0.0037804204,0.0023983254,0.0018115556,0.017676892],"category_scores_gemma":[0.009991198,0.0006716317,0.00095050177,0.0037100664,0.004789945,0.0145888,0.0041299067,0.0056616636,0.0019389838],"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.000036014495,0.00001134481,0.00013516909,0.000030735835,0.0000039233173,0.000039696875,0.0001582306,0.00037620304,0.00056619715,0.99184823,0.0014628469,0.005331322],"study_design_scores_gemma":[0.000007183769,0.000011259816,0.00010312934,0.000007905885,0.0000044988756,0.00004929026,0.000043179964,0.00519611,0.0004120933,0.99251586,0.0016412322,0.000008151091],"about_ca_topic_score_codex":0.0017847533,"about_ca_topic_score_gemma":0.0013272852,"teacher_disagreement_score":0.017676892,"about_ca_system_score_codex":0.0015223701,"about_ca_system_score_gemma":0.00064504746,"threshold_uncertainty_score":0.05913508},"labels":[],"label_agreement":null},{"id":"W2080350435","doi":"10.1016/j.laa.2006.10.022","title":"OMC for scalar multiples of unitaries","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Numerical range; Conjecture; Complex plane; Scalar (mathematics); Combinatorics; Normal matrix; Algebra over a field; Multilinear algebra; Unitary state; Multilinear map; Pure mathematics; Mathematical analysis; Geometry; Division algebra; Filtered algebra; Quantum mechanics; Physics","score_opus":0.010184522406834044,"score_gpt":0.23722331282036005,"score_spread":0.227038790413526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080350435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12075497,0.0020927314,0.69570273,0.0025384105,0.0026430734,0.00016166717,0.0006342832,0.0018152234,0.17365691],"genre_scores_gemma":[0.788885,0.00095925695,0.13460101,0.0020516426,0.0015946053,0.00020655274,0.0005758742,0.000923891,0.070202164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989813,0.0002096561,0.00005329078,0.00020629665,0.00034540874,0.00020414848],"domain_scores_gemma":[0.9970625,0.0008198495,0.0003795871,0.00077151373,0.00069261045,0.00027392595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009005926,0.0007986341,0.0007271542,0.0023650224,0.0015533816,0.0022407211,0.00097614474,0.0010019448,0.01771064],"category_scores_gemma":[0.0066888807,0.00023982495,0.00050129276,0.0023658415,0.0018305905,0.0030066292,0.002022751,0.00202631,0.00367279],"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.00009622864,0.0000413434,0.00033756168,0.000090836846,0.0000135594755,0.00013545045,0.00013537607,0.001963962,0.0022726373,0.9313647,0.010459696,0.053088654],"study_design_scores_gemma":[0.000009584759,0.000023013376,0.00018925458,0.000042007927,0.0000076027254,0.00024308673,0.00007253531,0.02119842,0.0029674596,0.9616905,0.013525325,0.00003120258],"about_ca_topic_score_codex":0.00064880506,"about_ca_topic_score_gemma":0.0008410436,"teacher_disagreement_score":0.01771064,"about_ca_system_score_codex":0.0006784698,"about_ca_system_score_gemma":0.00065420667,"threshold_uncertainty_score":0.05924797},"labels":[],"label_agreement":null},{"id":"W2081082048","doi":"10.1080/02781070290016214","title":"In Honor of Professor Erwin Kreyszig on the Occasion of His Eightieth Birthday","year":2002,"lang":"en","type":"article","venue":"Complex Variables Theory and Application An International Journal","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Biography; Honor; Classics; Mathematics; Tribute; Art history; Philosophy; History; Computer science","score_opus":0.027825935658937432,"score_gpt":0.28262067378513417,"score_spread":0.25479473812619674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081082048","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006510706,0.0938096,0.0106766755,0.39554495,0.42155617,0.00010194573,0.0011212431,0.0005183921,0.07016028],"genre_scores_gemma":[0.06599895,0.06736676,0.0055832034,0.037733946,0.17716326,0.00017086703,0.0009075809,0.0008682695,0.64420724],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998283,0.00026006583,0.00008918483,0.00037192294,0.00072368974,0.0002722466],"domain_scores_gemma":[0.99462825,0.0007253834,0.00035150954,0.00018100702,0.001502499,0.0026112718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019992029,0.0011017937,0.0013594455,0.0010356061,0.0021844287,0.0032623298,0.0009775679,0.0019949907,0.024776023],"category_scores_gemma":[0.008616754,0.00029031525,0.0005048489,0.0009059164,0.0016249223,0.0028845707,0.0032876253,0.006045347,0.029068774],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001300783,0.00002315172,0.0004217378,0.00017463716,0.000018052877,0.0003473409,0.00036949976,0.0001571666,0.00092819665,0.014637321,0.9464483,0.036344517],"study_design_scores_gemma":[0.0000047857948,0.000043266682,0.00037677077,0.00007639649,0.0000075920434,0.00039353364,0.00016648983,0.00008820882,0.0006965575,0.0029024407,0.9952302,0.000013857272],"about_ca_topic_score_codex":0.00094756624,"about_ca_topic_score_gemma":0.0015412911,"teacher_disagreement_score":0.024776023,"about_ca_system_score_codex":0.0019418428,"about_ca_system_score_gemma":0.0014898026,"threshold_uncertainty_score":0.08288401},"labels":[],"label_agreement":null},{"id":"W2082072907","doi":"10.4236/ajcm.2013.31003","title":"A Derivative-Free Optimization Algorithm Using Sparse Grid Integration","year":2013,"lang":"en","type":"article","venue":"American Journal of Computational Mathematics","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":"York University","funders":"","keywords":"Algorithm; Grid; Convergence (economics); Heuristic; Mathematical optimization; Derivative (finance); Computer science; Numerical integration; Sparse grid; Nonlinear system; Function (biology); Mathematics; Geometry","score_opus":0.015551276102985125,"score_gpt":0.2527773247268217,"score_spread":0.23722604862383656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082072907","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018933205,0.00007961311,0.99643195,0.000049406746,0.00005454749,0.000020669644,0.000011943864,0.00025114397,0.0012073757],"genre_scores_gemma":[0.07284147,0.00016230851,0.9220797,0.000112664384,0.00006577487,0.00016001188,0.00012226756,0.00022686494,0.004228966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999582,0.000081981096,0.000018076928,0.0000520587,0.00023688852,0.000028964088],"domain_scores_gemma":[0.99949837,0.00019657059,0.000041168245,0.00006994811,0.00015673124,0.00003714236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006961534,0.00067660946,0.001012114,0.00058893254,0.00049072265,0.0007069009,0.0012648634,0.0011921256,0.0028723953],"category_scores_gemma":[0.0019779745,0.00046282433,0.0006260868,0.00079593546,0.00061993,0.0010045493,0.0012773089,0.0012885194,0.0012139792],"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.00008458014,0.00007782264,0.000549369,0.00012857081,0.000065478875,0.000120990575,0.00008264922,0.73423994,0.010733099,0.03911315,0.005865393,0.20893894],"study_design_scores_gemma":[0.000010127976,0.000015078268,0.000035443583,0.000003392735,0.0000034756297,0.000021185291,0.0000018718138,0.9950948,0.0006921447,0.002592606,0.0015244167,0.0000055300775],"about_ca_topic_score_codex":0.0032102223,"about_ca_topic_score_gemma":0.0030489115,"teacher_disagreement_score":0.0032102223,"about_ca_system_score_codex":0.0005216736,"about_ca_system_score_gemma":0.0012681747,"threshold_uncertainty_score":0.009609163},"labels":[],"label_agreement":null},{"id":"W2082801382","doi":"10.1139/p08-012","title":"Does the manifestly covariant equation ∂<sub>α</sub> <i>A</i><sup>α</sup> = 0 imply that <i>A</i><sup>α</sup> is a four-vector?","year":2008,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Physics; Covariant transformation; Mathematical physics; Simple (philosophy); Epistemology","score_opus":0.026508467779557426,"score_gpt":0.20888238206846801,"score_spread":0.1823739142889106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082801382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1531743,0.0023422018,0.43494508,0.13294902,0.0052971686,0.000069387046,0.00048594904,0.000912696,0.2698243],"genre_scores_gemma":[0.8422305,0.0027881158,0.11384731,0.012419985,0.0017511678,0.00008043787,0.0002705964,0.00051515084,0.026096666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922705,0.00018366908,0.00005637997,0.0001488787,0.00028816168,0.00009588581],"domain_scores_gemma":[0.998035,0.00061616837,0.000317797,0.00050834357,0.000399193,0.00012347684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002521994,0.00039199807,0.00051027787,0.0005243159,0.0020871875,0.0025567245,0.0013978233,0.0028754824,0.006980411],"category_scores_gemma":[0.007513358,0.00033421614,0.00057065143,0.00075720524,0.007858473,0.008248524,0.0015837445,0.0029585287,0.0024268194],"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.000007713281,0.0000070755327,0.00027964922,0.000031726555,0.0000029201722,0.000079736965,0.00022365921,0.00015994009,0.0003772846,0.99049723,0.0032050556,0.0051280106],"study_design_scores_gemma":[0.00000779249,0.000007517083,0.00027119348,0.000016152004,0.000004841038,0.00026930484,0.00020876579,0.002188697,0.00038763203,0.9836912,0.012932065,0.000014784544],"about_ca_topic_score_codex":0.0017608947,"about_ca_topic_score_gemma":0.0016798337,"teacher_disagreement_score":0.006980411,"about_ca_system_score_codex":0.0007869862,"about_ca_system_score_gemma":0.0010093171,"threshold_uncertainty_score":0.023351848},"labels":[],"label_agreement":null},{"id":"W2083312487","doi":"10.1007/s11134-009-9113-1","title":"Transient solutions for multi-server queues with finite buffers","year":2009,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia; University of Saskatchewan","funders":"","keywords":"Eigenvalues and eigenvectors; Transient (computer programming); Queue; Staffing; Mathematics; Finite difference; Applied mathematics; Finite set; Computer science; Mathematical analysis; Physics; Computer network; Operating system","score_opus":0.038449892640538566,"score_gpt":0.2622355256748267,"score_spread":0.22378563303428817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083312487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062365927,0.00095182034,0.92565984,0.0012402699,0.000211924,0.000052017782,0.00009347775,0.00033516236,0.009089573],"genre_scores_gemma":[0.94717413,0.0008145861,0.037833218,0.00025412798,0.00013148929,0.00016483112,0.00011786241,0.00011597737,0.013393681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995908,0.00013291021,0.000021499896,0.00006156396,0.00009358958,0.00009970799],"domain_scores_gemma":[0.99538594,0.0033743596,0.00036771962,0.00013215838,0.00046366017,0.0002762504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015035135,0.00075011275,0.0008726286,0.0011645567,0.00090337277,0.0023862217,0.001609574,0.0019487786,0.004101902],"category_scores_gemma":[0.012840493,0.0006729577,0.0006845966,0.001078901,0.0016871202,0.0021330086,0.0014495178,0.0015044764,0.00035402083],"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.00023657747,0.00011823336,0.0005611453,0.00015427156,0.00004945895,0.00022087888,0.00035796902,0.54202783,0.0031564382,0.43560967,0.0032940672,0.014213476],"study_design_scores_gemma":[0.000020982538,0.000012527416,0.00006173736,0.00001328164,0.000007689486,0.00001722032,0.000053442487,0.93005675,0.00026290515,0.06923033,0.00025402542,0.000009124856],"about_ca_topic_score_codex":0.004781853,"about_ca_topic_score_gemma":0.0030912447,"teacher_disagreement_score":0.004781853,"about_ca_system_score_codex":0.0025104734,"about_ca_system_score_gemma":0.0018974681,"threshold_uncertainty_score":0.018214822},"labels":[],"label_agreement":null},{"id":"W2083836337","doi":"10.1016/s0096-3003(01)00098-4","title":"Highly efficient parallel algorithm for finite difference solution to Navier–Stoke's equation on a hypercube","year":2002,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Tridiagonal matrix; Tridiagonal matrix algorithm; Hypercube; Discretization; Generalization; Computation; Mathematics; Matrix (chemical analysis); Algorithm; Band matrix; Finite difference method; Reduction (mathematics); Finite difference; Applied mathematics; Parallel computing; Computer science; Mathematical analysis; Discrete mathematics; Symmetric matrix; Geometry; Square matrix; Physics; Eigenvalues and eigenvectors","score_opus":0.03372380291306331,"score_gpt":0.24820521988478747,"score_spread":0.21448141697172415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083836337","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08849948,0.000486953,0.8915796,0.00070159463,0.00031903636,0.00016576283,0.00021264689,0.0018028975,0.01623193],"genre_scores_gemma":[0.38526705,0.00027182265,0.60216445,0.00013597147,0.000098425524,0.00044101378,0.0004375248,0.00025952604,0.010924271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997292,0.00007010218,0.0000158643,0.00002766337,0.00012027725,0.000036872025],"domain_scores_gemma":[0.99947387,0.00019963192,0.00002785286,0.0000798464,0.00017957049,0.000039197963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005000617,0.0005464309,0.0006699408,0.00041189484,0.00092183356,0.00066877465,0.0010696535,0.00053441187,0.0055272644],"category_scores_gemma":[0.0014574656,0.000293763,0.0003418944,0.00084620924,0.0004213025,0.0009199875,0.0010260078,0.0008061858,0.0011222503],"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.0010863985,0.000270472,0.0017509128,0.0004016906,0.0001215932,0.0004969853,0.00045910547,0.5030379,0.03406536,0.07343278,0.019017393,0.36585942],"study_design_scores_gemma":[0.00012493314,0.00006712741,0.00020468574,0.000008318345,0.000012216465,0.00004851546,0.000044502416,0.9692694,0.0072742254,0.018102841,0.0048312563,0.000011963348],"about_ca_topic_score_codex":0.0033445437,"about_ca_topic_score_gemma":0.0044120606,"teacher_disagreement_score":0.0055272644,"about_ca_system_score_codex":0.0006719464,"about_ca_system_score_gemma":0.0012072128,"threshold_uncertainty_score":0.018490493},"labels":[],"label_agreement":null},{"id":"W2083936573","doi":"10.1007/s00211-008-0172-8","title":"On optimal condition numbers for Markov chains","year":2008,"lang":"de","type":"article","venue":"Numerische Mathematik","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":20,"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 Regina","funders":"","keywords":"Mathematics; Combinatorics; Markov chain; Ergodic theory; Ergodicity; Inverse; Norm (philosophy); Stationary distribution; Discrete mathematics; Mathematical analysis; Statistics","score_opus":0.020276165713651095,"score_gpt":0.264963043820058,"score_spread":0.24468687810640688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083936573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0755676,0.0030984294,0.84520364,0.005345792,0.000793586,0.00023254548,0.0006331631,0.00041184796,0.06871338],"genre_scores_gemma":[0.7727105,0.0048726657,0.19307694,0.0014212447,0.0011775916,0.0011015822,0.0009361028,0.00084516354,0.023858283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956968,0.0022116264,0.00018072825,0.0004632853,0.00093402574,0.00051347195],"domain_scores_gemma":[0.93797106,0.052427858,0.0024676574,0.0017198758,0.0029838218,0.0024298425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009043116,0.0020357943,0.002317911,0.0031117187,0.0019136729,0.0045225713,0.0025961392,0.0035354022,0.022414384],"category_scores_gemma":[0.06695675,0.0013403887,0.0009739348,0.0025666738,0.006731876,0.009500397,0.0037237103,0.00618275,0.0013907698],"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.00006168705,0.00002989561,0.000093500305,0.00007312759,0.000008926393,0.000018976023,0.000068522044,0.029083198,0.00033254668,0.9642668,0.0018227207,0.0041401773],"study_design_scores_gemma":[0.00002844113,0.000013446226,0.00007209643,0.000043823504,0.0000046838154,0.000009983262,0.000022126878,0.1179779,0.0001749862,0.8809566,0.000676923,0.000018983843],"about_ca_topic_score_codex":0.0026758232,"about_ca_topic_score_gemma":0.0032691518,"teacher_disagreement_score":0.022414384,"about_ca_system_score_codex":0.0057527525,"about_ca_system_score_gemma":0.004341951,"threshold_uncertainty_score":0.0749836},"labels":[],"label_agreement":null},{"id":"W2084226713","doi":"10.1063/1.4736842","title":"Comment on some results of Erdahl and the convex structure of reduced density matrices","year":2012,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":22,"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 Guelph; University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Regular polygon; Convex analysis; Pure mathematics; Combinatorics; Convex optimization; Geometry","score_opus":0.016086401324587454,"score_gpt":0.2560660351343437,"score_spread":0.23997963380975623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084226713","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034274173,0.006254429,0.013563457,0.9391622,0.016773658,0.000027634967,0.0006134323,0.0003035766,0.019874169],"genre_scores_gemma":[0.09501328,0.007867992,0.010498827,0.8068989,0.061844304,0.00019377771,0.00034261274,0.0005784406,0.016761886],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957354,0.0010254281,0.00028279476,0.0009022933,0.0016770662,0.00037692324],"domain_scores_gemma":[0.98290986,0.011644202,0.0010586218,0.0010014202,0.0026656399,0.000720226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007046919,0.0013169422,0.001522739,0.0013806131,0.0032461176,0.0031067007,0.0081773065,0.008975223,0.010599803],"category_scores_gemma":[0.019448334,0.00042812416,0.0013592539,0.0017909185,0.0123203015,0.014095035,0.0039831856,0.01704642,0.005343684],"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.0001268556,0.00004593047,0.00043961138,0.0002281571,0.000026933028,0.0007776893,0.00057676976,0.0006775633,0.0003294679,0.44421118,0.54372305,0.008836823],"study_design_scores_gemma":[0.000058273334,0.000072858275,0.00088798837,0.00026167743,0.000015499216,0.00071120413,0.00053852284,0.002314195,0.0012110076,0.7685688,0.22525157,0.000108454005],"about_ca_topic_score_codex":0.0028494191,"about_ca_topic_score_gemma":0.0014604874,"teacher_disagreement_score":0.010599803,"about_ca_system_score_codex":0.0020181148,"about_ca_system_score_gemma":0.0010349463,"threshold_uncertainty_score":0.03726816},"labels":[],"label_agreement":null},{"id":"W2085120770","doi":"10.1016/j.laa.2012.05.035","title":"Tripotency of a linear combination of two involutory matrices and a tripotent matrix that mutually commute","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Matrix (chemical analysis); Involutory matrix; Block (permutation group theory); Matrix analysis; Algebra over a field; Combinatorics; Pure mathematics; Square matrix; Symmetric matrix; Eigenvalues and eigenvectors","score_opus":0.0179595651600082,"score_gpt":0.2747893100120989,"score_spread":0.2568297448520907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085120770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3671327,0.0006895186,0.43679178,0.00069324294,0.0021749598,0.00022947049,0.00072875444,0.0008611872,0.19069831],"genre_scores_gemma":[0.90359217,0.00045521275,0.05783625,0.00042770637,0.0006450808,0.0002941783,0.00062267185,0.00031830484,0.035808343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984023,0.0002637133,0.00010579083,0.00041649071,0.0004892842,0.00032244984],"domain_scores_gemma":[0.9985398,0.0003215668,0.00025638982,0.0003313292,0.00030214572,0.0002487977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009539683,0.0008418871,0.0005595688,0.0012955348,0.0013167465,0.0020052914,0.00095736503,0.0007960401,0.013473865],"category_scores_gemma":[0.0023153024,0.0003386724,0.000595463,0.001099167,0.00264182,0.0024465176,0.0020024383,0.0016757693,0.0029598922],"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.00036531326,0.00010825778,0.0005075574,0.00014676388,0.00005097881,0.0011969014,0.0006842236,0.00071166427,0.041323334,0.91274434,0.003513433,0.03864721],"study_design_scores_gemma":[0.000091028814,0.00047319013,0.0012160359,0.00010401688,0.00010220297,0.002943058,0.00064356707,0.007866353,0.06255162,0.8776493,0.046188872,0.00017078259],"about_ca_topic_score_codex":0.00020742336,"about_ca_topic_score_gemma":0.0002258044,"teacher_disagreement_score":0.013473865,"about_ca_system_score_codex":0.0002994196,"about_ca_system_score_gemma":0.00062967214,"threshold_uncertainty_score":0.045074582},"labels":[],"label_agreement":null},{"id":"W2085378537","doi":"10.1137/060661673","title":"A Preconditioner for Linear Systems Arising From Interior Point Optimization Methods","year":2007,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":48,"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":"Preconditioner; Interior point method; Mathematics; Saddle point; Linear system; Applied mathematics; Eigenvalues and eigenvectors; Mathematical optimization; Matrix (chemical analysis); Iterated function; Condition number; Quadratic programming; Algorithm; Mathematical analysis; Geometry","score_opus":0.031574164376521385,"score_gpt":0.346956663709278,"score_spread":0.31538249933275664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085378537","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016258435,0.00007497636,0.99648345,0.00008710533,0.000038062066,0.000032278345,0.000027525213,0.0002972933,0.0013334401],"genre_scores_gemma":[0.053252745,0.00029462215,0.9430901,0.00010291589,0.00008743809,0.00028024358,0.0001326837,0.00032484793,0.002434505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893075,0.00046027204,0.000044355438,0.00008265156,0.00041303007,0.00006902056],"domain_scores_gemma":[0.99835134,0.0008930538,0.00016974071,0.00026418164,0.0002563705,0.00006536547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015381338,0.00086949294,0.0009643284,0.0004986226,0.0006148457,0.00080105703,0.0008010578,0.0013351096,0.0045913784],"category_scores_gemma":[0.005892381,0.00042375727,0.0006227339,0.00069458474,0.0010662372,0.0009602806,0.0018329412,0.002741063,0.0025289634],"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.00021897146,0.00015388607,0.00068083295,0.0005901281,0.000077597586,0.00052281836,0.0004341738,0.5205763,0.03503006,0.22815157,0.009970653,0.20359302],"study_design_scores_gemma":[0.00003231035,0.00006256491,0.000085726526,0.000035605433,0.0000102095755,0.000089102636,0.000017864615,0.95436066,0.0073603685,0.029059248,0.008871359,0.000015024101],"about_ca_topic_score_codex":0.0009458524,"about_ca_topic_score_gemma":0.001107734,"teacher_disagreement_score":0.0045913784,"about_ca_system_score_codex":0.0003095191,"about_ca_system_score_gemma":0.0011204269,"threshold_uncertainty_score":0.0153597},"labels":[],"label_agreement":null},{"id":"W2087131745","doi":"10.1109/tmag.2011.2176318","title":"Efficient Implementation of Gaussian Belief Propagation Solver for Large Sparse Diagonally Dominant Linear Systems","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Solver; Speedup; Computer science; Diagonally dominant matrix; Parallel computing; Conjugate gradient method; Gaussian elimination; Diagonal; Algorithm; Belief propagation; Gaussian; Parallel algorithm; Sparse matrix; Applied mathematics; Mathematics; Invertible matrix; Geometry; Physics","score_opus":0.01633148315383508,"score_gpt":0.27439007499755264,"score_spread":0.25805859184371754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087131745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061545856,0.000029000315,0.99100775,0.000098308825,0.000019503268,0.000024986106,0.000031296557,0.0013205919,0.0013139169],"genre_scores_gemma":[0.13808084,0.00006903002,0.85870206,0.0000762748,0.000021765285,0.00011802344,0.00019289568,0.00025604753,0.0024831067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995584,0.000102932434,0.000019093319,0.000043731892,0.00022093122,0.00005489583],"domain_scores_gemma":[0.9991679,0.000322851,0.000055652064,0.000113581315,0.00028632052,0.000053726973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007615381,0.00067003403,0.00052476086,0.00037987548,0.00046160782,0.0006810604,0.0012003022,0.0006975065,0.0038897088],"category_scores_gemma":[0.0023834151,0.00032811376,0.0003512197,0.00066055823,0.0004985307,0.0007064248,0.00096660835,0.0010724931,0.0014198215],"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.00027037304,0.00021645163,0.0014742971,0.00017662426,0.00008816163,0.00023878126,0.00023739552,0.5970267,0.029335579,0.04597841,0.009471836,0.31548542],"study_design_scores_gemma":[0.000016363434,0.000012839875,0.000046343146,0.0000024477279,0.0000030976933,0.000011327055,0.0000068075365,0.9926702,0.0038065254,0.0024614092,0.00095881656,0.000003981722],"about_ca_topic_score_codex":0.006869537,"about_ca_topic_score_gemma":0.011190091,"teacher_disagreement_score":0.006869537,"about_ca_system_score_codex":0.0005600645,"about_ca_system_score_gemma":0.0020641643,"threshold_uncertainty_score":0.01365906},"labels":[],"label_agreement":null},{"id":"W2087700323","doi":"10.1145/1838599.1838602","title":"LU factoring of non-invertible matrices","year":2010,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Factoring; Invertible matrix; Rank (graph theory); Extension (predicate logic); Mathematics; Matrix (chemical analysis); Basis (linear algebra); Fraction (chemistry); Computation; Algebra over a field; Computer science; Algorithm; Pure mathematics; Combinatorics; Programming language","score_opus":0.02447850481722616,"score_gpt":0.2936675261053943,"score_spread":0.26918902128816813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087700323","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069732754,0.00020921114,0.9880966,0.000059695434,0.00006284378,0.000024764942,0.000064438944,0.00051212363,0.0039970474],"genre_scores_gemma":[0.27195984,0.0009311495,0.7092828,0.00033711785,0.00036089803,0.00016939423,0.0005759824,0.0007606431,0.015622106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878865,0.00028304415,0.00009434792,0.00025314538,0.00044317567,0.00013774988],"domain_scores_gemma":[0.9977003,0.0006761908,0.00020208428,0.0006507156,0.00067491835,0.00009577838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000945052,0.0009990133,0.0006086401,0.0010332316,0.00054169603,0.0016404822,0.0005713497,0.0004890432,0.007915735],"category_scores_gemma":[0.0065851226,0.00028395292,0.0006179279,0.00086592615,0.0017916843,0.002904214,0.0014304952,0.0011953857,0.0030249446],"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.0002275422,0.000052198622,0.0007131659,0.00028499006,0.000034641966,0.0003123938,0.00078076636,0.032081433,0.027552558,0.6541434,0.008084574,0.27573234],"study_design_scores_gemma":[0.000043405093,0.0002970551,0.0004298199,0.00012963782,0.000030018871,0.0006678712,0.0002731389,0.20172437,0.054059077,0.6812697,0.060976375,0.00009947983],"about_ca_topic_score_codex":0.00086106063,"about_ca_topic_score_gemma":0.0009018871,"teacher_disagreement_score":0.007915735,"about_ca_system_score_codex":0.00041040423,"about_ca_system_score_gemma":0.0005552822,"threshold_uncertainty_score":0.026480794},"labels":[],"label_agreement":null},{"id":"W2088187808","doi":"10.5539/jmr.v5n4p52","title":"On Positive Integer Powers of Toeplitz Matrices","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Toeplitz matrix; Mathematics; Integer (computer science); Matrix (chemical analysis); Combinatorics; Levinson recursion; Integer matrix; Shalom; Discrete mathematics; Algebra over a field; Pure mathematics; Nonnegative matrix; Symmetric matrix; Theology; Chemistry","score_opus":0.04163628422797602,"score_gpt":0.3575452078759446,"score_spread":0.31590892364796863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088187808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25512165,0.0016406543,0.6386367,0.0010900026,0.0005727478,0.00009928368,0.00024013195,0.00024162604,0.102357246],"genre_scores_gemma":[0.9244937,0.0017971965,0.05516006,0.00057425693,0.0008580264,0.0000894588,0.00028391043,0.00015976283,0.016583595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988626,0.00026301743,0.00007318727,0.00023044173,0.0003576252,0.00021315242],"domain_scores_gemma":[0.99459004,0.0031550855,0.00048967573,0.00050741713,0.0008554972,0.00040231098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014289872,0.0009953016,0.00055254763,0.0011499528,0.00082246005,0.0015537854,0.000628941,0.00071915594,0.008189474],"category_scores_gemma":[0.012581056,0.00033319075,0.00048292428,0.0008775552,0.0029959464,0.0057254215,0.0015131523,0.0021451316,0.001817073],"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.0001287625,0.00004576677,0.000805059,0.00012385414,0.000008249579,0.0013212205,0.00046618353,0.006160463,0.011406378,0.96128416,0.0018188349,0.016431138],"study_design_scores_gemma":[0.00002605822,0.000114563045,0.00040984745,0.000062827,0.000013184233,0.0009175272,0.00024896403,0.03763694,0.00647897,0.9456724,0.008379794,0.000038963917],"about_ca_topic_score_codex":0.00040995888,"about_ca_topic_score_gemma":0.0003213382,"teacher_disagreement_score":0.008189474,"about_ca_system_score_codex":0.0003946074,"about_ca_system_score_gemma":0.0003788724,"threshold_uncertainty_score":0.0273965},"labels":[],"label_agreement":null},{"id":"W2088385674","doi":"10.1007/s11005-015-0748-z","title":"Reflectionless CMV Matrices and Scattering Theory","year":2015,"lang":"en","type":"article","venue":"Letters in Mathematical Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Scattering; Matrix (chemical analysis); Diagonal; Scattering theory; Line (geometry); Mathematics; Physics; Pure mathematics; Diagonal matrix; Mathematical physics; Quantum mechanics; Geometry; Chemistry","score_opus":0.026659045629284638,"score_gpt":0.27015611728739325,"score_spread":0.2434970716581086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088385674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15312484,0.001842779,0.7326841,0.0026360655,0.0010796998,0.00007064831,0.00020869258,0.00058321917,0.10777003],"genre_scores_gemma":[0.88642085,0.0013759135,0.06226144,0.0010679464,0.00080212636,0.00009387905,0.00029420012,0.0004079192,0.047275722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931407,0.00022165885,0.000027406253,0.000106248255,0.00022727852,0.00010338909],"domain_scores_gemma":[0.99859875,0.00056249305,0.00018026136,0.00022275723,0.00025090427,0.00018481282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094514753,0.0011543169,0.00081182685,0.0015097046,0.00100659,0.003020079,0.0016074115,0.0019259306,0.008951765],"category_scores_gemma":[0.0043942947,0.0005248482,0.0008660623,0.0010320408,0.0032688254,0.0046498636,0.0021212485,0.0033718261,0.0019555544],"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.000014874935,0.000011694638,0.000046847257,0.000012094113,0.000003339236,0.000026299238,0.000052515148,0.001041898,0.0005561457,0.99461526,0.0006364458,0.0029825252],"study_design_scores_gemma":[0.0000052919536,0.0000065133368,0.00002633352,0.000004973625,0.0000016029609,0.00005588865,0.00002423904,0.0076721245,0.00022780235,0.9912697,0.0006984766,0.000007065287],"about_ca_topic_score_codex":0.00049574947,"about_ca_topic_score_gemma":0.0002749203,"teacher_disagreement_score":0.008951765,"about_ca_system_score_codex":0.0006475633,"about_ca_system_score_gemma":0.0006611679,"threshold_uncertainty_score":0.029946625},"labels":[],"label_agreement":null},{"id":"W2089229947","doi":"10.1016/j.jcp.2007.10.024","title":"Effect of discretization order on preconditioning and convergence of a high-order unstructured Newton-GMRES solver for the Euler equations","year":2007,"lang":"en","type":"article","venue":"Journal of Computational Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Generalized minimal residual method; Discretization; Mathematics; Incomplete LU factorization; Applied mathematics; Linear system; Solver; Jacobian matrix and determinant; Backward Euler method; Preconditioner; Eigenvalues and eigenvectors; Mathematical analysis; Mathematical optimization; Matrix decomposition","score_opus":0.007685409757316886,"score_gpt":0.2689418643759637,"score_spread":0.26125645461864677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089229947","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89710355,0.0005356658,0.0968723,0.00030373776,0.00018180738,0.00003035549,0.00009548468,0.000606224,0.004270891],"genre_scores_gemma":[0.9670883,0.00022958715,0.03142809,0.00005229148,0.00002615538,0.000011524144,0.00007919548,0.00027567908,0.00080916093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992186,0.00037616177,0.000053746404,0.000060631784,0.00018446146,0.000106333784],"domain_scores_gemma":[0.9817083,0.013979318,0.0009911687,0.001324328,0.0015510201,0.00044594036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019474872,0.00065570604,0.000692131,0.0003894091,0.0006247322,0.00077299366,0.0004114053,0.0009967226,0.0017795924],"category_scores_gemma":[0.018927682,0.0004333976,0.0003411345,0.00038317783,0.001045717,0.0011529477,0.0006850561,0.0008445265,0.00029091426],"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.008270784,0.00080046547,0.013671807,0.00062469277,0.00011599831,0.0012532286,0.0007684266,0.6577543,0.2194675,0.008486181,0.0022066806,0.08658002],"study_design_scores_gemma":[0.00012804577,0.0005216048,0.0034728548,0.000034213288,0.00006968709,0.00018538052,0.000080083846,0.9214344,0.07217066,0.0014800297,0.0003844963,0.000038651742],"about_ca_topic_score_codex":0.0016955207,"about_ca_topic_score_gemma":0.0030389878,"teacher_disagreement_score":0.0019474872,"about_ca_system_score_codex":0.00020374221,"about_ca_system_score_gemma":0.0008277853,"threshold_uncertainty_score":0.010299444},"labels":[],"label_agreement":null},{"id":"W2089611640","doi":"10.1109/cefc.2010.5481252","title":"Understanding the efficiency of parallel incomplete Cholesky preconditioners on the performance of ICCG solvers for multi-core and GPU systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Cholesky decomposition; Incomplete Cholesky factorization; Conjugate gradient method; Solver; Computer science; Parallel computing; Minimum degree algorithm; Factorization; Algorithm; Programming language","score_opus":0.09656858121821488,"score_gpt":0.2720199604564914,"score_spread":0.17545137923827653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089611640","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8399022,0.0013654211,0.1467211,0.00061580807,0.00003292977,0.000056141045,0.00017646412,0.00077538984,0.010354561],"genre_scores_gemma":[0.9588594,0.00070821866,0.039022725,0.000053531618,0.000029031617,0.000036649773,0.00018307245,0.00022439833,0.0008829723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993399,0.00021075692,0.000034192282,0.00007828542,0.00024158998,0.000095298565],"domain_scores_gemma":[0.9926105,0.0055284826,0.0004663085,0.00068848464,0.00063281227,0.00007338507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015473187,0.0006544181,0.0007219865,0.0005160307,0.0003526065,0.00087819475,0.0005344106,0.0006059388,0.0015799662],"category_scores_gemma":[0.011592645,0.00035589654,0.00023820897,0.00074948464,0.0007868475,0.002292088,0.0005701048,0.0006095402,0.00027434767],"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.00097456976,0.00018246767,0.0075730677,0.00040667842,0.0000639636,0.00020606039,0.00033322626,0.8496274,0.04886249,0.011430101,0.0012303835,0.07910956],"study_design_scores_gemma":[0.00002591952,0.0001277793,0.0024961007,0.000015499762,0.000018662367,0.000038740523,0.00005698209,0.9613883,0.032268252,0.0029770217,0.00057372596,0.000013043847],"about_ca_topic_score_codex":0.0028812701,"about_ca_topic_score_gemma":0.0024986155,"teacher_disagreement_score":0.0028812701,"about_ca_system_score_codex":0.0003938321,"about_ca_system_score_gemma":0.00082260114,"threshold_uncertainty_score":0.008183122},"labels":[],"label_agreement":null},{"id":"W2089638310","doi":"10.1016/s0024-3795(02)00685-7","title":"Positive definite Hankel matrices of minimal condition","year":2003,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Positive-definite matrix; Hankel matrix; Class (philosophy); Combinatorics; Pure mathematics; Applied mathematics; Mathematical analysis; Eigenvalues and eigenvectors; Computer science","score_opus":0.009629510665098014,"score_gpt":0.24646818505495,"score_spread":0.23683867438985198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089638310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20567855,0.00082358666,0.69174314,0.0025430627,0.00065102434,0.00009694605,0.0010532045,0.0009969011,0.09641355],"genre_scores_gemma":[0.894102,0.0005262624,0.07178795,0.00075904524,0.00059005094,0.00015561352,0.0006531835,0.00035118652,0.03107473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994448,0.00011823825,0.000020773705,0.00012766753,0.00018102402,0.0001076206],"domain_scores_gemma":[0.99795485,0.0009209635,0.00028181548,0.00016975682,0.0004345982,0.00023799462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061419525,0.0007373369,0.0007325295,0.0007214882,0.0009143157,0.0017432749,0.00094324624,0.0011285659,0.018868865],"category_scores_gemma":[0.0053231795,0.00033753618,0.0003017782,0.00063905714,0.0015142405,0.0027882592,0.0010823373,0.0016247311,0.0025240472],"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.000098959616,0.00003897002,0.00018587534,0.000072280774,0.000008143064,0.0001037437,0.000116619376,0.0015601908,0.00529776,0.9777706,0.003754633,0.010992268],"study_design_scores_gemma":[0.000020746837,0.000029314986,0.00020175535,0.000011383799,0.000003641994,0.00014235552,0.00006219598,0.01739707,0.0028092656,0.9770816,0.002218325,0.00002230524],"about_ca_topic_score_codex":0.0004664833,"about_ca_topic_score_gemma":0.0005960114,"teacher_disagreement_score":0.018868865,"about_ca_system_score_codex":0.00035461868,"about_ca_system_score_gemma":0.0007001978,"threshold_uncertainty_score":0.06312263},"labels":[],"label_agreement":null},{"id":"W2089930092","doi":"10.1016/j.laa.2004.04.007","title":"The Moore–Penrose inverse of matrices with an acyclic bipartite graph","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Inverse; Square matrix; Complete bipartite graph; Diagonal; Matrix (chemical analysis); Moore–Penrose pseudoinverse; Diagonally dominant matrix; Block matrix; Rank (graph theory); Diagonal matrix; Graph; Discrete mathematics; Symmetric matrix; Invertible matrix; Pure mathematics; Eigenvalues and eigenvectors; Geometry","score_opus":0.009461010088431473,"score_gpt":0.24058487913519014,"score_spread":0.23112386904675866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089930092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06523407,0.0007471732,0.8956504,0.0011209955,0.00035692734,0.00006572619,0.0004394935,0.0003892776,0.035995945],"genre_scores_gemma":[0.6234545,0.0016202605,0.33958715,0.0013731363,0.00089233305,0.00023510127,0.0008749128,0.00034948197,0.03161309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769586,0.0008857156,0.00011933283,0.0005505489,0.00056965597,0.00017882128],"domain_scores_gemma":[0.99515224,0.00216631,0.0007658334,0.0008340045,0.00070974935,0.00037181113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014463974,0.00091328396,0.000819702,0.0019003049,0.0010393764,0.00275397,0.0016697239,0.0019415424,0.007969351],"category_scores_gemma":[0.009300618,0.00068095175,0.0008604189,0.0024872122,0.0029717912,0.0046933508,0.0018021839,0.0024718072,0.0020117613],"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.000103915765,0.0000721305,0.00033675611,0.00010842961,0.000027665388,0.00015309147,0.00024629524,0.013588361,0.002168683,0.9473947,0.0037465144,0.032053407],"study_design_scores_gemma":[0.000009076524,0.000028634448,0.00013608225,0.000019962537,0.000007660026,0.00018014786,0.00005521166,0.035418518,0.0010964146,0.9586709,0.00434668,0.000030660452],"about_ca_topic_score_codex":0.0013283449,"about_ca_topic_score_gemma":0.0013554669,"teacher_disagreement_score":0.007969351,"about_ca_system_score_codex":0.00063502055,"about_ca_system_score_gemma":0.0008420484,"threshold_uncertainty_score":0.026660144},"labels":[],"label_agreement":null},{"id":"W2090646187","doi":"10.1007/s11590-008-0106-5","title":"Sufficiency of linear transformations on Euclidean Jordan algebras","year":2008,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Convexity; Mathematics; Euclidean geometry; Complementarity (molecular biology); Linear map; Jordan algebra; Commutative property; Linear complementarity problem; Euclidean distance; Pure mathematics; Transformation (genetics); Computational intelligence; Combinatorics; Euclidean distance matrix; Property (philosophy); Applied mathematics; Algebra over a field; Nonlinear system; Computer science; Algebra representation; Geometry","score_opus":0.01178637397763147,"score_gpt":0.21714134833001084,"score_spread":0.20535497435237937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090646187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26427788,0.002562604,0.5659728,0.0037142804,0.0004742837,0.00013989134,0.0009299087,0.0006110183,0.16131727],"genre_scores_gemma":[0.94517684,0.001150321,0.032489736,0.0012382742,0.00048865005,0.00017817794,0.00094139075,0.00025848328,0.018078018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973717,0.001126703,0.000167074,0.0003766538,0.0005866861,0.0003713062],"domain_scores_gemma":[0.9899095,0.00636957,0.0007911461,0.0007814702,0.001397885,0.000750426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029923369,0.00094137114,0.0013707719,0.002391227,0.0014970917,0.0028555794,0.0015994263,0.0015446115,0.010510438],"category_scores_gemma":[0.013165319,0.00093435525,0.0010597233,0.0014937083,0.0035164107,0.0056829047,0.0034831644,0.00331579,0.0016769782],"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.00008976678,0.000031069052,0.0002758837,0.000081506674,0.000016208309,0.000091894835,0.000132712,0.0016447689,0.0011003282,0.9889426,0.001993643,0.0055995435],"study_design_scores_gemma":[0.000024566643,0.000033550386,0.00020548045,0.00002067127,0.000008385116,0.000109925786,0.00007404764,0.0086637,0.00092852506,0.9881748,0.0017432749,0.000012977194],"about_ca_topic_score_codex":0.00038333033,"about_ca_topic_score_gemma":0.00042392235,"teacher_disagreement_score":0.010510438,"about_ca_system_score_codex":0.00066306733,"about_ca_system_score_gemma":0.0008596698,"threshold_uncertainty_score":0.03516096},"labels":[],"label_agreement":null},{"id":"W2091356782","doi":"10.1090/s0025-5718-05-01748-5","title":"Algorithms for hyperbolic quadratic eigenvalue problems","year":2005,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Positive-definite matrix; Eigenvalues and eigenvectors; Mathematics; Hermitian matrix; Quadratic equation; Lambda; Matrix (chemical analysis); Pure mathematics; Mathematical analysis; Applied mathematics; Combinatorics; Geometry; Quantum mechanics; Physics","score_opus":0.03144884872393362,"score_gpt":0.2860411006219882,"score_spread":0.25459225189805457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091356782","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008536661,0.00039384136,0.97284126,0.0008441802,0.00019414273,0.00006617871,0.00015335737,0.00090134423,0.016069027],"genre_scores_gemma":[0.23440991,0.0007828944,0.7151266,0.00061600446,0.0003790409,0.00039661067,0.0010990073,0.0014686651,0.04572128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911934,0.00027874397,0.000059248374,0.00018601053,0.00024248225,0.00011420945],"domain_scores_gemma":[0.9975376,0.0014502095,0.00012704314,0.0003138518,0.00043146976,0.00013987294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011983127,0.0010354088,0.000691272,0.00084257167,0.0009405952,0.0017808235,0.0017123553,0.0013740133,0.021138733],"category_scores_gemma":[0.008528688,0.00054734934,0.0009735609,0.0010658081,0.0009841889,0.003264042,0.0037660273,0.00239187,0.0062510944],"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.00018453972,0.00017322763,0.0014267477,0.0004459497,0.00008874652,0.00020105779,0.00054338045,0.17122509,0.002422773,0.5832943,0.036690906,0.20330335],"study_design_scores_gemma":[0.00004363947,0.000027388118,0.00014157647,0.00002803456,0.000008657512,0.000060082664,0.00010238336,0.5022758,0.00082077464,0.48717418,0.009300921,0.000016536653],"about_ca_topic_score_codex":0.002361309,"about_ca_topic_score_gemma":0.0036848756,"teacher_disagreement_score":0.021138733,"about_ca_system_score_codex":0.0009595453,"about_ca_system_score_gemma":0.0008458549,"threshold_uncertainty_score":0.07071608},"labels":[],"label_agreement":null},{"id":"W2091379119","doi":"10.1006/jmaa.2001.7732","title":"How to Express a Parallel Sum of k Matrices","year":2002,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Hermitian matrix; Inverse; Positive-definite matrix; Block (permutation group theory); Expression (computer science); Combinatorics; Matrix (chemical analysis); Moore–Penrose pseudoinverse; Pure mathematics; Eigenvalues and eigenvectors; Geometry; Computer science; Physics","score_opus":0.017640483640555257,"score_gpt":0.25256592132218164,"score_spread":0.23492543768162638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091379119","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01354583,0.00015625553,0.9702564,0.0003761324,0.00046111454,0.000059510116,0.00018461792,0.00070942246,0.014250736],"genre_scores_gemma":[0.11254407,0.0003873775,0.8623892,0.00024317067,0.00019947201,0.00019127756,0.00035966546,0.0006199045,0.023065813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994289,0.000117670774,0.00006058929,0.00010276611,0.00023485266,0.000055169334],"domain_scores_gemma":[0.9993352,0.00017395218,0.000051931365,0.00016686642,0.00021512044,0.0000568923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072340044,0.0008161884,0.0005161896,0.00041298722,0.0007343979,0.001885901,0.00091316475,0.0005763016,0.00915384],"category_scores_gemma":[0.0025190893,0.00039319403,0.0007620209,0.00073930447,0.0007524144,0.002973559,0.0014862099,0.0013898496,0.0043388437],"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.00031480132,0.00014218215,0.0008888156,0.0004718979,0.00011807814,0.0009114636,0.00061618973,0.06771901,0.034583695,0.55890656,0.021211512,0.3141159],"study_design_scores_gemma":[0.000059240287,0.00014650707,0.000297424,0.00006840608,0.00007465428,0.0009657265,0.00026440207,0.2652976,0.031430643,0.61524194,0.08608182,0.000071598966],"about_ca_topic_score_codex":0.00087488524,"about_ca_topic_score_gemma":0.0018593328,"teacher_disagreement_score":0.00915384,"about_ca_system_score_codex":0.0003524764,"about_ca_system_score_gemma":0.0006280237,"threshold_uncertainty_score":0.030622661},"labels":[],"label_agreement":null},{"id":"W2091675867","doi":"10.1007/s00373-010-0886-0","title":"A Magnetic Procedure for the Stability Number","year":2009,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Stability (learning theory); Discrete mathematics; Computer science","score_opus":0.010607719335356402,"score_gpt":0.2269015478680244,"score_spread":0.21629382853266801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091675867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016079336,0.00047713047,0.8636667,0.0020644115,0.0017035146,0.00014809908,0.00020855106,0.0009789452,0.114673294],"genre_scores_gemma":[0.47562048,0.00074664457,0.42577732,0.0018591392,0.0019144438,0.00077433704,0.00029273395,0.0020533656,0.090961576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991716,0.00023115671,0.000053147236,0.00020956708,0.00025270347,0.00008182874],"domain_scores_gemma":[0.9985146,0.0006010991,0.000079993595,0.0003176121,0.00037212344,0.000114641276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013520302,0.0008661143,0.00070119643,0.0034182228,0.0030695158,0.0020597342,0.00200291,0.0013451024,0.015598139],"category_scores_gemma":[0.0054678763,0.00046795455,0.000785737,0.0013365593,0.003715831,0.0043820245,0.0025643993,0.0030027523,0.0035856836],"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.000055018885,0.000022679475,0.00006617048,0.00005780217,0.0000063664934,0.000034695047,0.00013959454,0.0005097746,0.003639321,0.96590924,0.0040778816,0.025481464],"study_design_scores_gemma":[0.000029106644,0.000048308975,0.00018555159,0.00003207345,0.000024732519,0.0001844781,0.00010030015,0.01073188,0.008605755,0.94711405,0.03289419,0.000049597464],"about_ca_topic_score_codex":0.0006714832,"about_ca_topic_score_gemma":0.0009111072,"teacher_disagreement_score":0.015598139,"about_ca_system_score_codex":0.0012055379,"about_ca_system_score_gemma":0.00075220433,"threshold_uncertainty_score":0.052181005},"labels":[],"label_agreement":null},{"id":"W2092896986","doi":"10.1006/acha.2001.0363","title":"Convergence of Vector Subdivision Schemes in Sobolev Spaces","year":2002,"lang":"en","type":"article","venue":"Applied and Computational Harmonic Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Sobolev space; Subdivision; Sequence (biology); Convergence (economics); Norm (philosophy); Solution set; Combinatorics; Discrete mathematics; Mathematical analysis; Pure mathematics; Applied mathematics; Set (abstract data type)","score_opus":0.012754568905899178,"score_gpt":0.22429012956987915,"score_spread":0.21153556066397997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092896986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16585816,0.002199832,0.81353176,0.00077338546,0.00030182378,0.000102596794,0.00006992151,0.0001871411,0.016975494],"genre_scores_gemma":[0.81208724,0.0019696713,0.1533294,0.00023750289,0.00015955456,0.00020374922,0.00019864578,0.0003226391,0.031491533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905986,0.00045036062,0.000046966485,0.000061617466,0.00028725195,0.00009400919],"domain_scores_gemma":[0.99472755,0.0031999636,0.00035962224,0.00028680637,0.0010878994,0.0003381813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003268872,0.00073944475,0.0008596232,0.0017236803,0.0006413,0.0019100023,0.0011466438,0.0012907223,0.0031633163],"category_scores_gemma":[0.012215593,0.0004797463,0.0005261638,0.0010317331,0.002289663,0.0020683892,0.0032788976,0.0016591762,0.0004213521],"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.00034820035,0.000104129394,0.0011391708,0.00023469412,0.00003942563,0.00007249285,0.00073201006,0.16702005,0.010964351,0.7591074,0.0017957909,0.058442265],"study_design_scores_gemma":[0.000018126126,0.000051253304,0.00024196302,0.00003226472,0.0000073572746,0.00003737501,0.00007306138,0.8411016,0.0014832185,0.1547341,0.0022048126,0.000014866526],"about_ca_topic_score_codex":0.0040100706,"about_ca_topic_score_gemma":0.0021657352,"teacher_disagreement_score":0.0040100706,"about_ca_system_score_codex":0.0014668173,"about_ca_system_score_gemma":0.00089696667,"threshold_uncertainty_score":0.017287612},"labels":[],"label_agreement":null},{"id":"W2093305365","doi":"10.1016/j.laa.2006.09.002","title":"A stabilization criterion for matrices","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its 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":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Eigenvalues and eigenvectors; Complex plane; Simple (philosophy); Complex matrix; Linear system; Sense (electronics); Plane (geometry); Matrix (chemical analysis); Pure mathematics; Mathematical analysis; Geometry","score_opus":0.009612027771237553,"score_gpt":0.2514916853649997,"score_spread":0.24187965759376218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093305365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04724754,0.00073405827,0.9197252,0.0010536853,0.00026135243,0.0000782817,0.00018910159,0.0005298728,0.030180948],"genre_scores_gemma":[0.81034154,0.00094347785,0.14113691,0.00075791165,0.0006257176,0.00041591152,0.0006510205,0.000508724,0.044618845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993887,0.00014488083,0.000024577874,0.00017924808,0.00018664234,0.000075945696],"domain_scores_gemma":[0.9975374,0.0009441237,0.00018987714,0.00021079631,0.0009022145,0.00021562795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009257636,0.001064305,0.00078952394,0.0012362506,0.001326407,0.0014679709,0.000889651,0.0014925885,0.0069995783],"category_scores_gemma":[0.004425541,0.00041927223,0.00056005723,0.0008115979,0.0013568056,0.0022640107,0.0024231062,0.0019315188,0.0014243048],"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.00023199883,0.00006108769,0.0005110855,0.00018963186,0.000030288105,0.0001489656,0.00020949976,0.043849956,0.038861975,0.85715586,0.011629091,0.047120508],"study_design_scores_gemma":[0.00003639921,0.00022070153,0.00043217943,0.000055801076,0.000020017324,0.00012923816,0.00011104886,0.36641622,0.015747173,0.60567755,0.011112856,0.00004080357],"about_ca_topic_score_codex":0.00073291536,"about_ca_topic_score_gemma":0.00081912766,"teacher_disagreement_score":0.0069995783,"about_ca_system_score_codex":0.0008927359,"about_ca_system_score_gemma":0.0007996811,"threshold_uncertainty_score":0.023415923},"labels":[],"label_agreement":null},{"id":"W2093467115","doi":"10.1016/s0024-3795(02)00346-4","title":"Multiplicative preservers on semigroups of matrices","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":19,"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 Regina; University of Calgary","funders":"","keywords":"Mathematics; Hermitian matrix; Multiplicative function; Spectral radius; Square matrix; Numerical range; Rank (graph theory); Combinatorics; Matrix (chemical analysis); Idempotent matrix; Idempotence; Normal matrix; Complex matrix; Nonnegative matrix; Positive-definite matrix; Matrix analysis; Pure mathematics; Symmetric matrix; Mathematical analysis; Eigenvalues and eigenvectors","score_opus":0.01750676818076076,"score_gpt":0.24327356147885598,"score_spread":0.22576679329809524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093467115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35229257,0.0022098718,0.57570386,0.0018856096,0.00092994637,0.00009613825,0.0004993041,0.0008136036,0.06556917],"genre_scores_gemma":[0.8864923,0.0013579883,0.068954214,0.0005806521,0.001615736,0.00021230683,0.00045979884,0.00026886875,0.0400581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976809,0.0006429491,0.0001449716,0.00048591715,0.0007778809,0.00026726958],"domain_scores_gemma":[0.993789,0.0030885157,0.0007089854,0.0007285887,0.00073809724,0.0009467921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021557822,0.0009651138,0.0008342818,0.0021890544,0.0018993322,0.0044045853,0.0012020813,0.0008658156,0.006121716],"category_scores_gemma":[0.00503548,0.0009344643,0.0014445543,0.0013588604,0.0031518915,0.0060331966,0.0032016675,0.0028237996,0.0011450938],"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.00006297293,0.000038966886,0.00022961223,0.000036686557,0.0000124993885,0.000107590204,0.0005912796,0.0005275567,0.0027143033,0.98822844,0.00080571463,0.0066443034],"study_design_scores_gemma":[0.00003112803,0.00016479516,0.00042378047,0.00001630125,0.000021271955,0.00039923674,0.0001883395,0.0061889607,0.0032861454,0.9827184,0.0065320344,0.000029557528],"about_ca_topic_score_codex":0.00031783647,"about_ca_topic_score_gemma":0.00043159077,"teacher_disagreement_score":0.006121716,"about_ca_system_score_codex":0.0007548997,"about_ca_system_score_gemma":0.00058314396,"threshold_uncertainty_score":0.020479202},"labels":[],"label_agreement":null},{"id":"W2093958826","doi":"10.1016/j.laa.2009.01.031","title":"Allow problems concerning spectral properties of sign pattern matrices: A survey","year":2009,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sign (mathematics); Mathematics; Nilpotent; Matrix (chemical analysis); Nilpotent group; Pure mathematics; Mathematical analysis","score_opus":0.02918793999162779,"score_gpt":0.2415264922268797,"score_spread":0.2123385522352519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093958826","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036753055,0.14656053,0.75463116,0.006851593,0.0009191315,0.00008280211,0.0006257928,0.00042814162,0.053147882],"genre_scores_gemma":[0.46030766,0.21697387,0.28449348,0.0037951663,0.011959168,0.0003055187,0.0025618118,0.0006690838,0.018934201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99739,0.000859987,0.00018392524,0.0006968018,0.0007211045,0.00014819342],"domain_scores_gemma":[0.98723793,0.009295692,0.0006770193,0.0012233636,0.0013213599,0.0002445213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031562678,0.0015033374,0.002154366,0.0039218045,0.0015821492,0.0050903386,0.0025890528,0.0024854206,0.005843076],"category_scores_gemma":[0.012621455,0.001118467,0.0011754233,0.008450313,0.0038696355,0.010942503,0.0021275936,0.0035611365,0.0025987888],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008242337,0.00020852745,0.0019319528,0.0016308277,0.00007241058,0.00012876393,0.00038871737,0.008126482,0.0015489154,0.7344015,0.011654339,0.2398251],"study_design_scores_gemma":[0.000012039985,0.00004505341,0.00046195975,0.0001426396,0.000017872486,0.00034169134,0.00015488078,0.018524077,0.00087474065,0.96421516,0.015175358,0.000034543747],"about_ca_topic_score_codex":0.00057542394,"about_ca_topic_score_gemma":0.000566129,"teacher_disagreement_score":0.005843076,"about_ca_system_score_codex":0.00097178447,"about_ca_system_score_gemma":0.001193052,"threshold_uncertainty_score":0.019547045},"labels":[],"label_agreement":null},{"id":"W2094280202","doi":"10.1007/s11518-006-0131-9","title":"A note on the stochastic roots of stochastic matrices","year":2003,"lang":"en","type":"article","venue":"Journal of Systems Science and Systems Engineering","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Mathematical economics; Computer science; Mathematical optimization","score_opus":0.012095813251775224,"score_gpt":0.2220656571688736,"score_spread":0.2099698439170984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094280202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015620853,0.016815325,0.8905326,0.024814904,0.007624901,0.000025347736,0.00023824339,0.0002574291,0.044070337],"genre_scores_gemma":[0.5830571,0.038719036,0.26890385,0.009584663,0.039231893,0.000121029014,0.00037480186,0.0011033225,0.058904365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829155,0.0006730121,0.000114601025,0.00034506823,0.00047356694,0.00010221854],"domain_scores_gemma":[0.9769982,0.019770201,0.0006571658,0.0010953902,0.0011273209,0.00035183082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036660817,0.0010484108,0.0013485054,0.0012627412,0.0010534764,0.0024358402,0.001573226,0.0027508838,0.00639822],"category_scores_gemma":[0.034794427,0.00068781804,0.0012563253,0.0016199789,0.0038273404,0.006513795,0.0026523303,0.007954503,0.001298233],"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.00003367297,0.000012222183,0.0002140506,0.00011167638,0.000022755652,0.00022816184,0.00015564064,0.011709291,0.0010494334,0.9555142,0.011434429,0.019514484],"study_design_scores_gemma":[0.000008627752,0.000015736588,0.0001517623,0.000031336716,0.0000086681885,0.00008265996,0.000026216685,0.022567783,0.0002768407,0.9622996,0.014504287,0.0000264246],"about_ca_topic_score_codex":0.0014621846,"about_ca_topic_score_gemma":0.0014782463,"teacher_disagreement_score":0.00639822,"about_ca_system_score_codex":0.0007307962,"about_ca_system_score_gemma":0.00067405874,"threshold_uncertainty_score":0.021404207},"labels":[],"label_agreement":null},{"id":"W2094497608","doi":"10.1016/j.laa.2012.03.021","title":"Formulas for calculating the extremum ranks and inertias of a four-term quadratic matrix-valued function and their applications","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":19,"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":"Connaught Fund","keywords":"Mathematics; Hermitian matrix; Matrix (chemical analysis); Matrix function; Positive-definite matrix; Rank (graph theory); Pascal matrix; Sylvester's law of inertia; Function (biology); Square root of a 2 by 2 matrix; Pure mathematics; Nonnegative matrix; Combinatorics; Symmetric matrix; Eigenvalues and eigenvectors","score_opus":0.02236281726882542,"score_gpt":0.26561209068040076,"score_spread":0.24324927341157535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094497608","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025060736,0.0011282825,0.94772565,0.0003003856,0.00036248594,0.000104081715,0.0002798642,0.0011010664,0.02393736],"genre_scores_gemma":[0.27258497,0.0019126842,0.7031855,0.00032070235,0.000759956,0.000479547,0.00080099463,0.0016466941,0.01830897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992298,0.0001584766,0.000082343846,0.000084186904,0.00036115138,0.00008402232],"domain_scores_gemma":[0.9978867,0.0008408927,0.00022841676,0.0003005246,0.00058494904,0.00015854409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001996288,0.0015013695,0.0011959972,0.005082749,0.0009953575,0.002630249,0.0031600373,0.0013057758,0.010656733],"category_scores_gemma":[0.010821495,0.0006068838,0.0010298535,0.0027770703,0.0017417754,0.004763392,0.0020585957,0.002182972,0.0042442204],"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.000057280253,0.00009381727,0.0008577658,0.00035789306,0.000036805057,0.00021796844,0.00029615508,0.012327738,0.004669331,0.85066843,0.0067617306,0.12365515],"study_design_scores_gemma":[0.000027642433,0.00005217846,0.0008229321,0.000174967,0.00005417015,0.00037190094,0.00020162712,0.1859973,0.0049782866,0.79659545,0.010599505,0.00012408626],"about_ca_topic_score_codex":0.0005514289,"about_ca_topic_score_gemma":0.0017527121,"teacher_disagreement_score":0.010656733,"about_ca_system_score_codex":0.00088478933,"about_ca_system_score_gemma":0.00095211505,"threshold_uncertainty_score":0.035650373},"labels":[],"label_agreement":null},{"id":"W2096220424","doi":"10.1007/s11228-004-7197-7","title":"Nonsmooth Analysis of Singular Values. Part I: Theory","year":2005,"lang":"en","type":"article","venue":"Set-Valued Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Subderivative; Mathematics; Simple (philosophy); Limiting; TRACE (psycholinguistics); Singular value; Mathematical analysis; Singular solution; Work (physics); Applied mathematics; Matrix (chemical analysis); Pure mathematics; Calculus (dental); Eigenvalues and eigenvectors; Regular polygon; Geometry; Philosophy; Physics","score_opus":0.011947932966609278,"score_gpt":0.2594108906264844,"score_spread":0.24746295765987514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096220424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010546879,0.022244347,0.9514882,0.00096456945,0.00077425584,0.000027654754,0.00018768376,0.00016540669,0.013600957],"genre_scores_gemma":[0.69780093,0.04386168,0.21466197,0.001425007,0.005071548,0.00034975828,0.00078014267,0.00044267505,0.03560625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994462,0.00014938528,0.000036109337,0.00008991655,0.00025022242,0.00002814656],"domain_scores_gemma":[0.99815625,0.001120149,0.0001675408,0.00020418852,0.00028719447,0.000064582506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010627619,0.00071122864,0.0008781119,0.0015011095,0.0004147925,0.0016747508,0.0007711561,0.00066154986,0.004556468],"category_scores_gemma":[0.004876889,0.00032187506,0.00059595634,0.0014911771,0.0020869283,0.0018090189,0.0010033905,0.0019442767,0.0010809788],"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.000031620002,0.000046997528,0.00057362765,0.0005711826,0.000083311264,0.000106895255,0.00027402607,0.015360218,0.0050557493,0.87000775,0.013423816,0.094464764],"study_design_scores_gemma":[0.000005710898,0.000043688975,0.0007387217,0.00008507854,0.000031810574,0.00017323247,0.00006581047,0.1078447,0.0013847257,0.8764825,0.013126563,0.000017489701],"about_ca_topic_score_codex":0.00053024385,"about_ca_topic_score_gemma":0.00039361182,"teacher_disagreement_score":0.004556468,"about_ca_system_score_codex":0.00054468756,"about_ca_system_score_gemma":0.00031507353,"threshold_uncertainty_score":0.015242934},"labels":[],"label_agreement":null},{"id":"W2096249340","doi":"10.1109/ipdps.2004.1303284","title":"A parallel QR factorization algorithm for solving toeplitz tridiagonal systems","year":2004,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 New Brunswick","funders":"","keywords":"Toeplitz matrix; Tridiagonal matrix; QR decomposition; Computer science; Factorization; Scalability; Algorithm; Speedup; Parallel computing; Matrix decomposition; Parallel algorithm; Linear system; Mathematics; Eigenvalues and eigenvectors; Pure mathematics","score_opus":0.017949441729085313,"score_gpt":0.24726648008058913,"score_spread":0.22931703835150383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096249340","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021162757,0.00021071377,0.9945531,0.00010885028,0.00011452507,0.000056920533,0.00009815196,0.00094771705,0.0017937328],"genre_scores_gemma":[0.03044168,0.0003749227,0.9626766,0.00007001844,0.00009696449,0.00017478193,0.00038802443,0.0002726853,0.0055043413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953187,0.00009584172,0.00003331723,0.00009313444,0.0002060577,0.000039772272],"domain_scores_gemma":[0.9991874,0.00025934842,0.000053802472,0.000113853246,0.0003400191,0.00004550702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005670397,0.0010494291,0.0009959788,0.00045742124,0.00061031565,0.0006278729,0.00076837087,0.00067945325,0.01374139],"category_scores_gemma":[0.0020714693,0.00033007938,0.0005816255,0.00086397945,0.0003894542,0.0007489438,0.00084466254,0.0010525966,0.005284654],"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.00041847327,0.00014533392,0.00046573387,0.00048154633,0.00009574843,0.00037591043,0.0001338769,0.35429066,0.028668355,0.047241196,0.030419521,0.5372636],"study_design_scores_gemma":[0.000090602894,0.00011134614,0.00011415221,0.000022571521,0.000020762867,0.00018929024,0.000022655237,0.95673114,0.008693499,0.013796734,0.02018052,0.000026673348],"about_ca_topic_score_codex":0.0023435391,"about_ca_topic_score_gemma":0.0023481883,"teacher_disagreement_score":0.01374139,"about_ca_system_score_codex":0.0003003511,"about_ca_system_score_gemma":0.0010116686,"threshold_uncertainty_score":0.045969546},"labels":[],"label_agreement":null},{"id":"W2096346341","doi":"10.1109/iembs.2005.1617084","title":"Arnoldi Preconditioning for Solving Large Linear Biomedical Systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Preconditioner; Linear system; Conjugate gradient method; Computer science; Applied mathematics; Computation; Iterative method; Mathematical optimization; Algorithm; Mathematics; Mathematical analysis","score_opus":0.012823700141467836,"score_gpt":0.26131650607835066,"score_spread":0.24849280593688283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096346341","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004480401,0.00045501176,0.98918825,0.0003279922,0.000098513236,0.000046497273,0.000046785462,0.0006876339,0.004668827],"genre_scores_gemma":[0.15174468,0.001518631,0.8393124,0.0001630241,0.00019568265,0.00031264333,0.0002297198,0.00031601402,0.006207237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996007,0.0001289865,0.000022867154,0.00004283823,0.00018147542,0.000023076875],"domain_scores_gemma":[0.99924845,0.00042148292,0.00006433746,0.00011839306,0.000116260344,0.000031014188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000593567,0.0004757477,0.0005830275,0.00029627696,0.000609449,0.0004674323,0.00038253237,0.00060085556,0.004594921],"category_scores_gemma":[0.0022790777,0.00036641821,0.0003694494,0.0004346647,0.0007787569,0.0005897889,0.0008756412,0.0010961394,0.0014010352],"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.00018498687,0.000071916,0.0012691072,0.00095949013,0.00008365355,0.0005568718,0.00045405605,0.45961636,0.06707026,0.16136238,0.019305179,0.28906566],"study_design_scores_gemma":[0.000049090613,0.000081623126,0.0003699497,0.000034212546,0.000016809752,0.00014697334,0.00004869484,0.91712487,0.015633568,0.041808013,0.024666183,0.00002003237],"about_ca_topic_score_codex":0.0015892728,"about_ca_topic_score_gemma":0.0022644503,"teacher_disagreement_score":0.004594921,"about_ca_system_score_codex":0.0003212549,"about_ca_system_score_gemma":0.0009836485,"threshold_uncertainty_score":0.015371561},"labels":[],"label_agreement":null},{"id":"W2096600852","doi":"10.13001/1081-3810.1127","title":"Matrix inversion and digraphs: the one factor case","year":2004,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Invertible matrix; Digraph; Mathematics; Inverse; Combinatorics; Matrix (chemical analysis); Diagonal matrix; Involutory matrix; Block matrix; Diagonal; Square matrix; Diagonally dominant matrix; Pure mathematics; Sequence (biology); Simple (philosophy); Inversion (geology); Symmetric matrix; Eigenvalues and eigenvectors; Physics","score_opus":0.009089055789342236,"score_gpt":0.23904091061957805,"score_spread":0.2299518548302358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096600852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14275584,0.001294633,0.7694542,0.0007731441,0.00019378636,0.000109681074,0.0005405415,0.0004847846,0.08439343],"genre_scores_gemma":[0.8341456,0.0013427965,0.13490038,0.0003579708,0.00026719598,0.00012394712,0.00062426605,0.00013686567,0.02810098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995065,0.00008473772,0.00002693364,0.00014781962,0.00013572507,0.00009833959],"domain_scores_gemma":[0.99870753,0.000588367,0.00020136999,0.00018842399,0.00018591133,0.00012839783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037931403,0.00048817744,0.00037141284,0.0009876272,0.0006801186,0.0014661456,0.00050779944,0.00082882395,0.007436911],"category_scores_gemma":[0.0027969317,0.00026653605,0.00048139013,0.0012028173,0.0019214957,0.002805008,0.0009430144,0.0010824739,0.0011770631],"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.000029326888,0.00002037759,0.00027013628,0.000046841895,0.000005304894,0.00020918017,0.00017229811,0.005821765,0.0017945333,0.970088,0.0011568482,0.020385357],"study_design_scores_gemma":[0.000010043902,0.000035894856,0.00014786387,0.000019935216,0.0000052605283,0.00026722826,0.00008547419,0.027479218,0.0010214874,0.96319604,0.007712632,0.000018937766],"about_ca_topic_score_codex":0.002070062,"about_ca_topic_score_gemma":0.002306514,"teacher_disagreement_score":0.007436911,"about_ca_system_score_codex":0.0007874697,"about_ca_system_score_gemma":0.000562412,"threshold_uncertainty_score":0.02487892},"labels":[],"label_agreement":null},{"id":"W2099035905","doi":"10.1002/nme.2618","title":"An extended QR‐solver for large profiled matrices","year":2009,"lang":"en","type":"article","venue":"International Journal for Numerical Methods in Engineering","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":"Centre for Interdisciplinary Research in Rehabilitation","funders":"","keywords":"Eigenvalues and eigenvectors; Convergence (economics); Solver; Computation; Applied mathematics; Mathematics; Matrix (chemical analysis); Extension (predicate logic); Computer science; Algorithm; Mathematical optimization; Physics","score_opus":0.02013699228422398,"score_gpt":0.39768363171192506,"score_spread":0.37754663942770106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099035905","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007042992,0.0001220134,0.9890999,0.00010897002,0.00008437126,0.00006512808,0.00008103064,0.00046704145,0.0029285743],"genre_scores_gemma":[0.114004105,0.00020040407,0.8760729,0.00008623046,0.00006876268,0.00021051137,0.00019123475,0.0002680777,0.00889779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995871,0.00012477368,0.000020228592,0.000046212826,0.00018975665,0.000031886564],"domain_scores_gemma":[0.999345,0.00022339402,0.000062969855,0.00009858745,0.00020193713,0.00006808184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007431574,0.00066774484,0.0008911709,0.00031912356,0.00035502375,0.00070789224,0.001395628,0.0009794254,0.0063437833],"category_scores_gemma":[0.0013217625,0.000414037,0.0006273076,0.00038557386,0.00054698426,0.00082580384,0.0014841472,0.0011241591,0.0017073724],"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.0002524559,0.000114716466,0.0005396535,0.000446789,0.0000715642,0.00081711396,0.00020686866,0.7211945,0.047615495,0.11344913,0.008236314,0.107055426],"study_design_scores_gemma":[0.000031859752,0.00002552821,0.000037182846,0.000009778728,0.0000029617574,0.000070117574,0.000007658222,0.99060225,0.001756286,0.0043733036,0.003074428,0.000008693342],"about_ca_topic_score_codex":0.0017486138,"about_ca_topic_score_gemma":0.0016600412,"teacher_disagreement_score":0.0063437833,"about_ca_system_score_codex":0.00027638313,"about_ca_system_score_gemma":0.0010934018,"threshold_uncertainty_score":0.021222055},"labels":[],"label_agreement":null},{"id":"W2099242299","doi":"10.1016/j.laa.2011.03.060","title":"Sign patterns with a nest of positive principal minors","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Principal (computer security); Sign (mathematics); Mathematics; Principal component analysis; Eigenvalues and eigenvectors; Nest (protein structural motif); Permutation matrix; Matrix (chemical analysis); Combinatorics; Statistics; Mathematical analysis; Biology; Computer science; Physics; Quantum mechanics; Computer security; Chemistry","score_opus":0.01483530688290331,"score_gpt":0.22328705405598098,"score_spread":0.20845174717307768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099242299","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4651667,0.00021166685,0.47700983,0.0010566153,0.0006714433,0.0001740592,0.000472098,0.0014707367,0.053766903],"genre_scores_gemma":[0.8795977,0.00012519772,0.081180066,0.0002589881,0.00021672204,0.00011246115,0.00045434537,0.0007155556,0.03733883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933916,0.00013143217,0.00005085059,0.00014343814,0.00022162509,0.00011345018],"domain_scores_gemma":[0.99779487,0.00042293972,0.00039531986,0.00050295505,0.0005047512,0.00037907372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005596293,0.0006153062,0.0006312567,0.0012625753,0.0012693336,0.0021731744,0.0007209184,0.0009802744,0.014433743],"category_scores_gemma":[0.004038089,0.0004974543,0.000582642,0.00082869956,0.0016301072,0.0027188538,0.0015812605,0.0014388141,0.0025929874],"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.0006069925,0.00019951604,0.0036811235,0.00013014367,0.000038078993,0.0013693295,0.0006600448,0.0020997103,0.044827394,0.8617048,0.010468659,0.074214235],"study_design_scores_gemma":[0.00010186252,0.00023047489,0.00186418,0.000036769892,0.00003258378,0.0029862926,0.00040920265,0.0236496,0.016718162,0.93593055,0.01797154,0.00006865316],"about_ca_topic_score_codex":0.00017302072,"about_ca_topic_score_gemma":0.00037943842,"teacher_disagreement_score":0.014433743,"about_ca_system_score_codex":0.00027178795,"about_ca_system_score_gemma":0.0004151424,"threshold_uncertainty_score":0.048285663},"labels":[],"label_agreement":null},{"id":"W2100367334","doi":"10.1007/s11587-006-0001-2","title":"A duality theory for some non-convex functions of matrices","year":2006,"lang":"en","type":"article","venue":"Ricerche di Matematica","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Pacific Institute for the Mathematical Sciences","funders":"","keywords":"Mathematics; Legendre transformation; Legendre polynomials; Eigenvalues and eigenvectors; Duality (order theory); Nonlinear system; Convex analysis; Applied mathematics; Elasticity (physics); Convex function; Regular polygon; Mathematical analysis; Pure mathematics; Convex optimization; Geometry; Physics","score_opus":0.017679987016298845,"score_gpt":0.2657059538145909,"score_spread":0.24802596679829203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100367334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033750936,0.0024989073,0.91662407,0.0031969573,0.00050208095,0.000054869524,0.0002525874,0.00009758332,0.04302196],"genre_scores_gemma":[0.65940917,0.005679769,0.2590862,0.0029297525,0.0026416627,0.00060916453,0.00067903317,0.00031519818,0.06865001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850875,0.0006336537,0.000059128877,0.00023908199,0.00039907027,0.00016020374],"domain_scores_gemma":[0.9967614,0.0019193818,0.0002455986,0.00020522471,0.0005726329,0.0002958061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028672528,0.0013097634,0.0012828234,0.0029792262,0.0018828327,0.0039628157,0.001695423,0.001932088,0.0063665835],"category_scores_gemma":[0.0071838875,0.00074805255,0.0018610699,0.002792991,0.0029987623,0.006366478,0.002952895,0.0060064592,0.0009876235],"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.000014725614,0.00001913806,0.000058447087,0.000029486091,0.0000068392033,0.00002667128,0.000059413655,0.0014519847,0.00026048586,0.99318945,0.0013396029,0.0035438188],"study_design_scores_gemma":[0.000007292083,0.000023002665,0.00008706569,0.000015028795,0.000008239578,0.000065324464,0.00002934738,0.022988055,0.00023111588,0.97364193,0.0028947308,0.000008895236],"about_ca_topic_score_codex":0.00064166496,"about_ca_topic_score_gemma":0.0005308555,"teacher_disagreement_score":0.0063665835,"about_ca_system_score_codex":0.0022686613,"about_ca_system_score_gemma":0.0011368992,"threshold_uncertainty_score":0.021298349},"labels":[],"label_agreement":null},{"id":"W2101271356","doi":"10.1109/iscas.1990.112345","title":"Simple factorizability of 2-dimensional polynomials","year":2002,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"Simple (philosophy); Polynomial; Rank (graph theory); Mathematics; Matrix (chemical analysis); Difference polynomials; Applied mathematics; Characteristic polynomial; Algebra over a field; Algorithm; Discrete mathematics; Combinatorics; Pure mathematics; Orthogonal polynomials; Mathematical analysis","score_opus":0.021808884264751787,"score_gpt":0.2390859988860762,"score_spread":0.21727711462132443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101271356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24689056,0.0001529467,0.74023855,0.00014793074,0.00005186829,0.00013364505,0.00030077022,0.0011749896,0.010908834],"genre_scores_gemma":[0.93404484,0.00007801154,0.064211845,0.00004716722,0.00003269413,0.000066689914,0.00024538935,0.00010113396,0.0011722144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979662,0.0005146629,0.00013081986,0.0003592746,0.00076049264,0.00026858444],"domain_scores_gemma":[0.99245036,0.003138248,0.0010689868,0.0015479825,0.001519822,0.00027465532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015813306,0.0007174911,0.0005421555,0.0017140809,0.0006083945,0.0014320927,0.0005224352,0.00055677514,0.007845645],"category_scores_gemma":[0.017526167,0.0002423206,0.0004927421,0.001134698,0.0018197352,0.0021584015,0.0014368889,0.0007192135,0.00093995425],"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.0022512686,0.00017841576,0.016441489,0.0005193661,0.000101643025,0.0012066927,0.0008629397,0.17593174,0.11396871,0.50204605,0.0044883313,0.18200341],"study_design_scores_gemma":[0.00013918262,0.00082790863,0.004777651,0.000091121554,0.000028288641,0.0007859538,0.00038290067,0.5761244,0.054078806,0.35677916,0.005848597,0.0001359433],"about_ca_topic_score_codex":0.0010160335,"about_ca_topic_score_gemma":0.0007931681,"teacher_disagreement_score":0.007845645,"about_ca_system_score_codex":0.00045437028,"about_ca_system_score_gemma":0.00056853006,"threshold_uncertainty_score":0.02624631},"labels":[],"label_agreement":null},{"id":"W2101330872","doi":"10.4153/cmb-2004-025-0","title":"A Geometric Characterization of Nonnegative Bands","year":2004,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Idempotence; Indecomposable module; Characterization (materials science); Rank (graph theory); Subspace topology; Invariant (physics); Combinatorics; Semigroup; Invariant subspace; Pure mathematics; Discrete mathematics; Linear subspace; Mathematical analysis","score_opus":0.007703694859285128,"score_gpt":0.19761532342773852,"score_spread":0.1899116285684534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101330872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49538466,0.00069091615,0.44448423,0.0008391389,0.00019807748,0.000079843536,0.00035754463,0.0003199114,0.057645723],"genre_scores_gemma":[0.944095,0.00023937898,0.04857889,0.0001295485,0.00018837048,0.00007433558,0.00033638478,0.00007710079,0.006280891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993279,0.00012611174,0.00003757499,0.00018097454,0.00021437873,0.000113093396],"domain_scores_gemma":[0.99898714,0.00019565334,0.00031050303,0.0001091185,0.00021638806,0.00018120187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005435821,0.00054683,0.00036112618,0.0022542903,0.00089730433,0.001997644,0.00055406627,0.00045012694,0.004864979],"category_scores_gemma":[0.0016182963,0.0002553227,0.0003785087,0.0009899734,0.002795949,0.0023376355,0.0016752788,0.0010334187,0.00047643867],"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.000057197765,0.0000187994,0.0006606152,0.000031451018,0.0000049702885,0.00011629018,0.00016132103,0.0022469144,0.005773023,0.9789853,0.0010948122,0.010849314],"study_design_scores_gemma":[0.000017362152,0.000085580046,0.0016572517,0.000035801586,0.000013113879,0.00083050755,0.0003915447,0.023126492,0.004878514,0.9533571,0.015573013,0.000033687047],"about_ca_topic_score_codex":0.00027488702,"about_ca_topic_score_gemma":0.00021500373,"teacher_disagreement_score":0.004864979,"about_ca_system_score_codex":0.00060946203,"about_ca_system_score_gemma":0.00023720675,"threshold_uncertainty_score":0.016274989},"labels":[],"label_agreement":null},{"id":"W2101788802","doi":"10.1109/tmag.2009.2012640","title":"Efficient Multicore Sparse Matrix-Vector Multiplication for FE Electromagnetics","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","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":"McGill University","funders":"","keywords":"Electromagnetics; Multi-core processor; Multiplication (music); Sparse matrix; Computer science; Sparse approximation; Matrix multiplication; Parallel computing; Computational science; Matrix (chemical analysis); Computational electromagnetics; Set (abstract data type); Algorithm; Mathematics; Physics; Electromagnetic field; Materials science","score_opus":0.013617960005041566,"score_gpt":0.2569370167323706,"score_spread":0.24331905672732906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101788802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025885878,0.00022310058,0.9680099,0.00021835999,0.000056328292,0.000036951882,0.00010976574,0.001490027,0.0039698025],"genre_scores_gemma":[0.22851206,0.00016875096,0.76650846,0.00007674972,0.000040099952,0.00011989869,0.00036188838,0.00015670268,0.0040554344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997569,0.000051894152,0.000011862381,0.000024011328,0.00013215716,0.000023186243],"domain_scores_gemma":[0.9994506,0.00020263874,0.000042347656,0.00011045428,0.00016496879,0.000028987028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030752955,0.00052212924,0.00041598084,0.00034757753,0.00057684566,0.0004125853,0.0008165976,0.000456651,0.0040524243],"category_scores_gemma":[0.0013180408,0.00016419766,0.00022021632,0.00071843807,0.00022372462,0.0008951993,0.0006451277,0.0005632503,0.00081786147],"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.00032693258,0.00018597402,0.0010775665,0.00028264002,0.00006925559,0.00021041336,0.00020279456,0.35180593,0.063393116,0.045114763,0.016087053,0.52124345],"study_design_scores_gemma":[0.000019944224,0.000049167167,0.00016730433,0.0000065120726,0.0000046766054,0.000053926025,0.000019054809,0.9761681,0.011085098,0.007784734,0.004633851,0.000007633836],"about_ca_topic_score_codex":0.0026681798,"about_ca_topic_score_gemma":0.008510712,"teacher_disagreement_score":0.0040524243,"about_ca_system_score_codex":0.00036366493,"about_ca_system_score_gemma":0.0006736953,"threshold_uncertainty_score":0.013556719},"labels":[],"label_agreement":null},{"id":"W2102134292","doi":"10.4153/cmb-2009-012-3","title":"Matrix Valued Orthogonal Polynomials on the Unit Circle: Some Extensions of the Classical Theory","year":2009,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Orthogonal polynomials; Classical orthogonal polynomials; Christoffel symbols; Discrete orthogonal polynomials; Unit circle; Wilson polynomials; Hahn polynomials; Pascal matrix; Algebra over a field; Matrix (chemical analysis); Gegenbauer polynomials; Pure mathematics; Orthogonal matrix; Polynomial matrix; Representation (politics); Difference polynomials; Symmetric matrix; Square matrix; Mathematical analysis; Matrix polynomial; Polynomial; Orthogonal basis","score_opus":0.016164291110163823,"score_gpt":0.23841696767494897,"score_spread":0.22225267656478515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102134292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20301202,0.007528332,0.635962,0.003144324,0.0011166349,0.000057599314,0.00018504554,0.00018758031,0.14880638],"genre_scores_gemma":[0.90610373,0.0040878444,0.067835115,0.0005421906,0.0020322679,0.000050656592,0.00008114688,0.000078508834,0.01918855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942005,0.00019213058,0.0000194475,0.00007482312,0.00021806719,0.000075590826],"domain_scores_gemma":[0.99913764,0.00033028674,0.00013386215,0.00009418648,0.00022038967,0.000083653445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010102374,0.00040700822,0.00043088087,0.0015814384,0.0006786353,0.001497307,0.0008969145,0.00060228555,0.003986897],"category_scores_gemma":[0.0032682307,0.00018284698,0.00042697662,0.001649897,0.002161463,0.0024193563,0.0009202838,0.0010683221,0.00056618295],"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.000003890355,0.0000054035045,0.000030441377,0.00001411642,0.0000013902716,0.000032285883,0.000034033503,0.0016473789,0.00019311787,0.9945893,0.0003913461,0.003057268],"study_design_scores_gemma":[0.0000046939285,0.000015443082,0.00013568588,0.00001679624,0.0000025700647,0.00010780736,0.00004754922,0.05119401,0.00023950954,0.9435547,0.004668202,0.000013102087],"about_ca_topic_score_codex":0.001627615,"about_ca_topic_score_gemma":0.0011067573,"teacher_disagreement_score":0.003986897,"about_ca_system_score_codex":0.0009350699,"about_ca_system_score_gemma":0.00061828515,"threshold_uncertainty_score":0.013337493},"labels":[],"label_agreement":null},{"id":"W2102278702","doi":"10.1109/tit.2014.2298436","title":"The Entropy Power Inequality for Quantum Systems","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":74,"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":"Inequality; Quantum relative entropy; Statistical physics; Quantum; Mathematics; Physics; Quantum discord; Quantum mechanics; Mathematical analysis; Quantum entanglement","score_opus":0.00955767166377284,"score_gpt":0.23279398317528943,"score_spread":0.2232363115115166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102278702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08756595,0.0056120786,0.6641608,0.009407498,0.0008914386,0.00015774724,0.0011495794,0.00026062873,0.23079425],"genre_scores_gemma":[0.9077651,0.0035189763,0.055150773,0.0019092442,0.0027246948,0.00046636068,0.00077203225,0.00029800308,0.027394822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99591833,0.0011265601,0.00019817722,0.00061991543,0.0015399265,0.00059715554],"domain_scores_gemma":[0.9884497,0.008779848,0.00048202157,0.0008694201,0.0010399311,0.0003789902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036708552,0.00091889064,0.0010618299,0.0016230907,0.0013673089,0.0032078307,0.0015668574,0.0015567177,0.010484079],"category_scores_gemma":[0.018537775,0.0004656106,0.0011022814,0.0012616807,0.0054202196,0.008016937,0.003877306,0.004293346,0.0013866831],"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.000028885135,0.000009329532,0.00018576397,0.000061317834,0.000010254962,0.00009311608,0.000098790406,0.004838098,0.0009426004,0.9854521,0.0017254693,0.006554291],"study_design_scores_gemma":[0.000007256779,0.000009960246,0.00017727776,0.000014737059,0.0000029525995,0.000035753605,0.000012466786,0.030432751,0.00032747415,0.9673899,0.0015787543,0.00001071364],"about_ca_topic_score_codex":0.0019097488,"about_ca_topic_score_gemma":0.0008008841,"teacher_disagreement_score":0.010484079,"about_ca_system_score_codex":0.0027353365,"about_ca_system_score_gemma":0.0012199925,"threshold_uncertainty_score":0.035072684},"labels":[],"label_agreement":null},{"id":"W2102621509","doi":"10.23919/acc.2004.1384752","title":"On iterative solutions of a class of matrix equations in systems and control","year":2004,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Iterative method; Convergence (economics); Sylvester matrix; Matrix-free methods; Matrix (chemical analysis); Local convergence; Computer science; Applied mathematics; Gauss–Seidel method; Jacobi method; Sylvester equation; Mathematics; Mathematical optimization; Class (philosophy); Algorithm; Sparse matrix; Eigenvalues and eigenvectors; Mathematical analysis; Artificial intelligence","score_opus":0.015253726325610522,"score_gpt":0.2572965616699963,"score_spread":0.24204283534438578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102621509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021103648,0.0011429689,0.99225205,0.00014150946,0.000063049956,0.000039527327,0.000014568871,0.00005384017,0.0041821906],"genre_scores_gemma":[0.2049633,0.0084226215,0.77079517,0.00037268855,0.00065951695,0.00073000934,0.0002342124,0.00019190018,0.013630555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990402,0.0003501855,0.000055146134,0.00014522839,0.00035882957,0.000050394097],"domain_scores_gemma":[0.9985862,0.0009368456,0.0001122386,0.00009989289,0.00024365782,0.000021137595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017152098,0.0013276265,0.00095699896,0.000703392,0.00056099467,0.0008714391,0.0009000316,0.001566568,0.002464268],"category_scores_gemma":[0.0045187497,0.00036450056,0.0009702441,0.0013375487,0.0018252732,0.0016326786,0.0013092727,0.0018967784,0.00075535954],"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.000045303896,0.00006196343,0.0004722875,0.0005272935,0.0000948617,0.00019894553,0.0004690223,0.3881343,0.0058624498,0.4991706,0.0026303597,0.10233268],"study_design_scores_gemma":[0.000019893236,0.00008105196,0.00012937366,0.00006988783,0.000017323775,0.00014387406,0.0000390756,0.8391885,0.0020417955,0.14664082,0.0116031645,0.000025286987],"about_ca_topic_score_codex":0.001550872,"about_ca_topic_score_gemma":0.0011291078,"teacher_disagreement_score":0.002464268,"about_ca_system_score_codex":0.0005356613,"about_ca_system_score_gemma":0.00094043615,"threshold_uncertainty_score":0.0090709925},"labels":[],"label_agreement":null},{"id":"W2104989938","doi":"10.2514/6.2005-572","title":"Compressed Banded Data Structure for Preconditioned Iterative Solver in Numerical Heat Transfer","year":2005,"lang":"en","type":"article","venue":"43rd AIAA Aerospace Sciences Meeting and Exhibit","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"China Scholarship Council","keywords":"Solver; Computer science; Heat transfer; Iterative method; Computational science; Data structure; Algorithm; Parallel computing; Mechanics; Physics","score_opus":0.02720368311307413,"score_gpt":0.2785724764811722,"score_spread":0.2513687933680981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104989938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008695596,0.00033237663,0.988284,0.0003130777,0.00009004779,0.00005430776,0.00012801996,0.00066528824,0.0014371802],"genre_scores_gemma":[0.17003374,0.0005740612,0.82427907,0.00022722766,0.00013238812,0.00042209637,0.0008232721,0.0002804826,0.0032277103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946123,0.00015767486,0.000032176973,0.00004497909,0.0002784604,0.00002553166],"domain_scores_gemma":[0.9987752,0.0004539531,0.00007958275,0.00028123008,0.00037176276,0.000038339844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000562767,0.0004891728,0.00046694113,0.00048768552,0.000509273,0.00071737455,0.00083312474,0.00060237735,0.004319174],"category_scores_gemma":[0.002811859,0.00021814407,0.0003099387,0.0010570367,0.00063323707,0.0011514599,0.00091005914,0.0010346062,0.0011409379],"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.0006612239,0.0001339817,0.001111398,0.0005386186,0.000064764296,0.0003191832,0.00044235203,0.27417734,0.040827837,0.16452414,0.017436171,0.499763],"study_design_scores_gemma":[0.000048140784,0.0001101174,0.00015491797,0.000035080666,0.000011535006,0.000115575414,0.000049513765,0.9458133,0.017792972,0.020172326,0.015679,0.000017593647],"about_ca_topic_score_codex":0.002230475,"about_ca_topic_score_gemma":0.0023562608,"teacher_disagreement_score":0.004319174,"about_ca_system_score_codex":0.0004762398,"about_ca_system_score_gemma":0.0009736787,"threshold_uncertainty_score":0.01444906},"labels":[],"label_agreement":null},{"id":"W2105432417","doi":"10.1016/j.laa.2009.01.015","title":"On a matrix decomposition of Hartwig and Spindelböck","year":2009,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Corollary; Multilinear algebra; Mathematics; Multilinear map; Square matrix; Matrix (chemical analysis); Algebra over a field; Complex matrix; Linear algebra; Square (algebra); Pure mathematics; Decomposition; Combinatorics; Symmetric matrix; Jordan algebra; Eigenvalues and eigenvectors; Algebra representation","score_opus":0.007704871102420895,"score_gpt":0.27848247197033366,"score_spread":0.27077760086791275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105432417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081254326,0.0051415665,0.8301627,0.0034833304,0.0028406589,0.00010447265,0.00059066864,0.00040733698,0.07601492],"genre_scores_gemma":[0.59074914,0.0045360136,0.29276645,0.002802831,0.0024109595,0.00021608124,0.0010491969,0.00088477536,0.10458448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953604,0.00017426112,0.000016044773,0.00007878813,0.00013793027,0.0000569287],"domain_scores_gemma":[0.99948347,0.00016566303,0.000039778766,0.00008842695,0.00013597496,0.00008662618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084466295,0.00089370663,0.001068289,0.0014895238,0.00097601087,0.001486098,0.00090608123,0.0006764902,0.009376423],"category_scores_gemma":[0.0024889614,0.00035791166,0.0008044335,0.0018311344,0.001460201,0.002512694,0.001759101,0.0018782163,0.002482854],"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.00004503467,0.00003146833,0.00009127556,0.000049446047,0.000012440027,0.000050313687,0.00012980583,0.0038671857,0.0011024644,0.9716105,0.007716995,0.015293056],"study_design_scores_gemma":[0.00000958345,0.000014970401,0.00010551458,0.000018318204,0.0000075664134,0.000040316678,0.000042490046,0.028795805,0.0004407414,0.9623591,0.008146757,0.000019040019],"about_ca_topic_score_codex":0.0013479321,"about_ca_topic_score_gemma":0.0014662218,"teacher_disagreement_score":0.009376423,"about_ca_system_score_codex":0.0005211878,"about_ca_system_score_gemma":0.00060161285,"threshold_uncertainty_score":0.031367302},"labels":[],"label_agreement":null},{"id":"W2106204743","doi":"10.1016/s0024-3795(01)00415-3","title":"Quadratic expansions of spectral functions","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Hessian matrix; Eigenvalues and eigenvectors; Hessian equation; Positive-definite matrix; Pure mathematics; Invariant (physics); Quadratic equation; Mathematical analysis; Quadratic form (statistics); Function (biology); Symmetric matrix; Quadratic function; Combinatorics; Applied mathematics; Mathematical physics; Geometry","score_opus":0.015894578713498832,"score_gpt":0.23195664865740045,"score_spread":0.21606206994390162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106204743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19512889,0.0037442702,0.52527875,0.004080502,0.0016586831,0.00005564517,0.0003302253,0.000655085,0.26906797],"genre_scores_gemma":[0.80144304,0.002218504,0.049494494,0.00091498974,0.0024086754,0.0001077942,0.00034499078,0.0005471809,0.14252044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909914,0.00031377884,0.000027644877,0.0001280226,0.00031614935,0.000115301846],"domain_scores_gemma":[0.9982052,0.0008106001,0.00016093143,0.00016787753,0.00043796646,0.00021736906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011394363,0.0011184445,0.0009771098,0.002934059,0.0011032069,0.0023026394,0.0013852186,0.0012127431,0.013263823],"category_scores_gemma":[0.005269336,0.00056014484,0.0005990047,0.0020870594,0.0027634534,0.004478082,0.002000221,0.0031025964,0.0027627293],"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.000018489574,0.000017936403,0.00005530991,0.00002691993,0.000003419184,0.000021219497,0.00008918334,0.001353933,0.00072882854,0.98894227,0.001880919,0.0068616606],"study_design_scores_gemma":[0.00000683073,0.000009274787,0.00014721496,0.000013146327,0.0000041367066,0.000055050514,0.00003923144,0.019716764,0.00046181344,0.9766509,0.002881837,0.0000137342295],"about_ca_topic_score_codex":0.000820419,"about_ca_topic_score_gemma":0.000965547,"teacher_disagreement_score":0.013263823,"about_ca_system_score_codex":0.0010498127,"about_ca_system_score_gemma":0.0004727059,"threshold_uncertainty_score":0.044371903},"labels":[],"label_agreement":null},{"id":"W2106833662","doi":"10.1137/s1064827599353865","title":"Residual Replacement Strategies for Krylov Subspace Iterative Methods for the Convergence of True Residuals","year":2000,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":69,"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; McKnight Foundation","keywords":"Residual; Krylov subspace; Mathematics; Generalized minimal residual method; Subspace topology; Convergence (economics); Method of mean weighted residuals; Applied mathematics; Computation; Mathematical optimization; Iterative method; Algorithm; Finite element method; Mathematical analysis","score_opus":0.03886730709429653,"score_gpt":0.3721906244394505,"score_spread":0.33332331734515397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106833662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005831558,0.00016599521,0.99325055,0.000036435387,0.00001820424,0.000022497103,0.0000041416974,0.00013951641,0.0005310122],"genre_scores_gemma":[0.23430969,0.00034860463,0.76280904,0.00007744106,0.000046368645,0.00019981466,0.000057580877,0.00027326396,0.0018782079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981712,0.00087681913,0.000102240345,0.00014185572,0.00062987395,0.00007807911],"domain_scores_gemma":[0.99646914,0.0020408754,0.0003185123,0.00057644723,0.00051232445,0.000082692786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037222249,0.0010713321,0.0009671767,0.0006075097,0.0004533352,0.0009093657,0.0014441877,0.0010091037,0.0015219098],"category_scores_gemma":[0.011454572,0.00037188854,0.0005863794,0.00039366994,0.0017083831,0.0014852802,0.0014344744,0.0014808944,0.00078825274],"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.0003046792,0.00010965951,0.0010242218,0.00034290322,0.00007530235,0.00022899763,0.0006791271,0.49490488,0.0348123,0.31120276,0.0014319364,0.15488327],"study_design_scores_gemma":[0.000017483666,0.00013189418,0.00007834448,0.00002956733,0.00000914718,0.00005639643,0.000028768269,0.96725655,0.009310254,0.020547947,0.0025107379,0.000022846056],"about_ca_topic_score_codex":0.0008512411,"about_ca_topic_score_gemma":0.0009560083,"teacher_disagreement_score":0.0037222249,"about_ca_system_score_codex":0.0005205865,"about_ca_system_score_gemma":0.0009109926,"threshold_uncertainty_score":0.019685209},"labels":[],"label_agreement":null},{"id":"W2106855060","doi":"10.1016/s0362-546x(99)00126-1","title":"Convex analysis on Cartan subspaces","year":2000,"lang":"en","type":"article","venue":"Nonlinear Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":32,"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 Waterloo","funders":"","keywords":"Mathematics; Linear subspace; Invariant (physics); Combinatorics; Unitary state; Singular value; Matrix norm; Pure mathematics; Matrix (chemical analysis); Norm (philosophy); Regular polygon; Mathematical physics; Physics; Geometry; Law; Quantum mechanics","score_opus":0.007716655607069036,"score_gpt":0.24840936861771515,"score_spread":0.24069271301064613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106855060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03700882,0.0022260922,0.92227495,0.0015747685,0.00021548697,0.00003969477,0.00034436607,0.00015642811,0.03615946],"genre_scores_gemma":[0.6608757,0.0067942794,0.23393133,0.0010672391,0.0010787247,0.00033427103,0.0010729459,0.00061990955,0.09422564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916124,0.00043902503,0.000025097104,0.00011172744,0.00020123564,0.00006160198],"domain_scores_gemma":[0.99803716,0.0010538953,0.00019139251,0.00015258692,0.000416711,0.00014830485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013292294,0.0014754041,0.0012301069,0.0020237986,0.00091435225,0.0017671965,0.00084413786,0.0008666446,0.0058082426],"category_scores_gemma":[0.0047337017,0.00063743786,0.0008264155,0.0021835952,0.0022226074,0.0028546222,0.002370582,0.0024668432,0.0009349132],"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.000038403497,0.00002561237,0.00024392005,0.00010365317,0.000045723868,0.0000606226,0.00012940654,0.056726437,0.0014273946,0.9129522,0.0056822905,0.022564432],"study_design_scores_gemma":[0.0000056788076,0.000022125956,0.00025915314,0.000019912422,0.0000099279605,0.000048346297,0.000046810645,0.24711888,0.00043890296,0.74727917,0.004737567,0.000013547207],"about_ca_topic_score_codex":0.004367822,"about_ca_topic_score_gemma":0.0033762644,"teacher_disagreement_score":0.0058082426,"about_ca_system_score_codex":0.0013539353,"about_ca_system_score_gemma":0.00082973356,"threshold_uncertainty_score":0.019430459},"labels":[],"label_agreement":null},{"id":"W2107400804","doi":"10.1017/s1446181109000364","title":"AN APPROXIMATE MATRIX INVERSION PROCEDURE BY PARALLELIZATION OF THE SHERMAN–MORRISON FORMULA","year":2009,"lang":"en","type":"article","venue":"The ANZIAM Journal","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":"Toronto Metropolitan University","funders":"","keywords":"Preconditioner; Incomplete LU factorization; Factorization; Parallel computing; Computer science; Inversion (geology); Matrix (chemical analysis); Matrix decomposition; Linear system; Inverse; Incomplete Cholesky factorization; LU decomposition; Algorithm; Mathematics; Iterative method; Geometry; Mathematical analysis","score_opus":0.006824261619264791,"score_gpt":0.24672936158692285,"score_spread":0.23990509996765805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107400804","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017784234,0.00006251384,0.97800577,0.000105404986,0.00004213918,0.000049826504,0.000017881639,0.00052464893,0.0034075254],"genre_scores_gemma":[0.26116982,0.00011519026,0.73386896,0.00007205872,0.000047306865,0.00013230857,0.000058927424,0.00023565619,0.004299802],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997243,0.00008110665,0.000010676015,0.000028059289,0.00012407253,0.000031688844],"domain_scores_gemma":[0.9995937,0.00012909279,0.000036438796,0.00009681095,0.00012264738,0.00002130308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000517286,0.00039494684,0.0005493621,0.00045872814,0.000384516,0.0003836844,0.00070260616,0.00033718,0.0036056393],"category_scores_gemma":[0.001308901,0.00017389763,0.0003457448,0.00053692824,0.00055792875,0.0005161284,0.0006110033,0.00062975497,0.00068647886],"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.00029863775,0.000180027,0.0012323397,0.00021303896,0.00005949083,0.00036583788,0.0002599375,0.33346623,0.073627904,0.171942,0.0068468642,0.4115077],"study_design_scores_gemma":[0.00003579843,0.000039511335,0.0001686543,0.0000057302627,0.000007906865,0.00005669007,0.000013806621,0.97638685,0.010003535,0.009842,0.0034319058,0.000007653963],"about_ca_topic_score_codex":0.0033888635,"about_ca_topic_score_gemma":0.004215838,"teacher_disagreement_score":0.0036056393,"about_ca_system_score_codex":0.00034610557,"about_ca_system_score_gemma":0.00090060494,"threshold_uncertainty_score":0.012062073},"labels":[],"label_agreement":null},{"id":"W2112767856","doi":"10.1007/s10898-014-0148-4","title":"Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems","year":2014,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McGill University; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Branch and bound; Integer (computer science); Bounding overwatch; Relaxation (psychology); Norm (philosophy); Upper and lower bounds; Tree (set theory); Mathematical optimization; Combinatorics; Discrete mathematics; Algorithm; Computer science","score_opus":0.012743016755149045,"score_gpt":0.24718801793251077,"score_spread":0.23444500117736172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112767856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035200047,0.00019950651,0.9915455,0.000301755,0.0001250379,0.000029756657,0.000045162204,0.0003032182,0.003930004],"genre_scores_gemma":[0.15124013,0.00036103753,0.8423056,0.000313953,0.00018556124,0.00027236977,0.00023055708,0.00046000292,0.0046308734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904853,0.0004795235,0.000030176428,0.00007275437,0.00027734964,0.00009163552],"domain_scores_gemma":[0.9981536,0.001117372,0.00009371151,0.0002187532,0.0003031349,0.000113273345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016455929,0.0010160388,0.0011027319,0.0006095547,0.00060511526,0.0013740695,0.0013940816,0.0012294165,0.008430027],"category_scores_gemma":[0.00737808,0.00051195646,0.00048354268,0.0009957587,0.0011444325,0.0014175004,0.0016350057,0.003506058,0.0022225163],"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.00044196556,0.00022265174,0.0003218132,0.00028212208,0.00005018503,0.00010386171,0.00011762027,0.7054994,0.0046168603,0.111642785,0.012885173,0.16381559],"study_design_scores_gemma":[0.000027023878,0.000025829315,0.000021457941,0.000010761429,0.0000035099486,0.000009482123,0.00001215794,0.98040456,0.0004270485,0.01766742,0.0013859165,0.0000049083883],"about_ca_topic_score_codex":0.004039025,"about_ca_topic_score_gemma":0.0058640847,"teacher_disagreement_score":0.008430027,"about_ca_system_score_codex":0.00061955076,"about_ca_system_score_gemma":0.0017472229,"threshold_uncertainty_score":0.028201282},"labels":[],"label_agreement":null},{"id":"W2113248459","doi":"10.1016/j.laa.2009.08.004","title":"Convergence rates of some iterative methods for nonsymmetric algebraic Riccati equations arising in transport theory","year":2009,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":29,"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 Regina","funders":"","keywords":"Mathematics; Algebraic Riccati equation; Convergence (economics); Riccati equation; Applied mathematics; Algebraic number; Rate of convergence; Class (philosophy); Iterative method; Algebraic equation; Mathematical analysis; Mathematical optimization; Differential equation; Nonlinear system","score_opus":0.025121322137773922,"score_gpt":0.34458029457722483,"score_spread":0.31945897243945093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113248459","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12816893,0.0026607171,0.8520457,0.0013863957,0.00032295083,0.00020288843,0.0001779243,0.00038390586,0.014650534],"genre_scores_gemma":[0.7338313,0.0024789926,0.24492823,0.00041456142,0.0004145996,0.0005957576,0.0006053227,0.0010711034,0.015660197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975458,0.0013463129,0.00014670649,0.00021622221,0.00051745895,0.00022756304],"domain_scores_gemma":[0.9573145,0.03238051,0.0018728893,0.0016219809,0.0055262516,0.0012839054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010460312,0.0021114685,0.0014743957,0.0023117694,0.0018338199,0.0025858213,0.00298813,0.002927912,0.0041316524],"category_scores_gemma":[0.04253566,0.000931814,0.0020471758,0.0013630424,0.004866528,0.0036970237,0.0036243105,0.0044048303,0.00064505724],"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.0005403952,0.00018755825,0.0028006767,0.0006630523,0.00021626572,0.00025175448,0.0010537145,0.347121,0.009784426,0.6040323,0.0033521487,0.029996715],"study_design_scores_gemma":[0.000030314683,0.00006187923,0.00032247984,0.00004655125,0.000037940583,0.00006655033,0.00008227453,0.94172275,0.0026047449,0.05438608,0.0005968934,0.00004157213],"about_ca_topic_score_codex":0.0039774803,"about_ca_topic_score_gemma":0.0028825635,"teacher_disagreement_score":0.010460312,"about_ca_system_score_codex":0.0021900723,"about_ca_system_score_gemma":0.0025059232,"threshold_uncertainty_score":0.055320084},"labels":[],"label_agreement":null},{"id":"W2114188988","doi":"10.1016/s0024-3795(02)00431-7","title":"A note on the minimal nonnegative solution of a nonsymmetric algebraic Riccati equation","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":36,"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 Regina","funders":"","keywords":"Mathematics; Algebraic Riccati equation; Riccati equation; Algebraic number; Algebraic solution; Matrix (chemical analysis); Nonnegative matrix; Pure mathematics; Applied mathematics; Mathematical analysis; Symmetric matrix; Differential equation","score_opus":0.029307936880379703,"score_gpt":0.2509612697942319,"score_spread":0.2216533329138522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114188988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102231815,0.0058055646,0.7159044,0.01448899,0.01110856,0.000070234,0.00043138416,0.0005402033,0.14941883],"genre_scores_gemma":[0.6982809,0.0046616113,0.23450491,0.0036952265,0.0048354566,0.000093701216,0.00040204555,0.0004987606,0.05302746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983966,0.000047938658,0.000011197953,0.000032577882,0.000053137042,0.000015444688],"domain_scores_gemma":[0.99964654,0.00015729059,0.000041386582,0.000032019645,0.00006507887,0.00005771049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005647775,0.0007406581,0.0006479334,0.00049837126,0.00075485156,0.0009917383,0.00088404136,0.000873617,0.0036715565],"category_scores_gemma":[0.0017814526,0.0002128488,0.00045296652,0.00042925778,0.0012914626,0.001172359,0.0011717343,0.0017645428,0.00075106946],"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.000052147683,0.000021900405,0.00014796773,0.00014127005,0.000015321963,0.00038086428,0.0001072725,0.0033430043,0.012038994,0.95678407,0.011790335,0.015176891],"study_design_scores_gemma":[0.000009894698,0.000045616904,0.0001836432,0.00002617401,0.000011941886,0.0002148471,0.000049017424,0.020835903,0.0016915101,0.96050864,0.016397713,0.000025232343],"about_ca_topic_score_codex":0.00056999346,"about_ca_topic_score_gemma":0.0013492146,"teacher_disagreement_score":0.0036715565,"about_ca_system_score_codex":0.00027028428,"about_ca_system_score_gemma":0.00044347328,"threshold_uncertainty_score":0.01228261},"labels":[],"label_agreement":null},{"id":"W2114216028","doi":"10.2478/s11532-011-0047-1","title":"An analysis of SCF and geometry convergence for diatomic molecules","year":2011,"lang":"en","type":"article","venue":"Open Chemistry","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Saint Mary's University","funders":"Gaussian","keywords":"Diatomic molecule; Convergence (economics); Basis set; Basis (linear algebra); Hartree–Fock method; Set (abstract data type); Molecule; Geometry; Atomic physics; Chemistry; Physics; Computational chemistry; Mathematics; Quantum mechanics; Computer science","score_opus":0.019763874067416268,"score_gpt":0.2705085002511313,"score_spread":0.25074462618371507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114216028","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.953071,0.0006682482,0.02769446,0.00026714648,0.000036651163,0.0000464806,0.0003782753,0.0003635944,0.017474076],"genre_scores_gemma":[0.98860186,0.00015844674,0.009625682,0.000037693346,0.000010158725,0.000042829666,0.00054917834,0.00011545475,0.00085877976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936455,0.00020091278,0.000015963058,0.00003894103,0.0002870071,0.000092606875],"domain_scores_gemma":[0.99610764,0.0021167505,0.00017555842,0.00040885215,0.001069207,0.0001221085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021038584,0.00045340456,0.00071432616,0.0014542277,0.0006879282,0.0005729847,0.001058027,0.00060738,0.00282078],"category_scores_gemma":[0.006675116,0.00019932314,0.00037853827,0.0011720201,0.00075095455,0.0006962741,0.00044585823,0.0005435805,0.0002965234],"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.00053700886,0.00020349637,0.010174935,0.0002864401,0.00013409022,0.0004555382,0.00021262975,0.8485217,0.01331442,0.10275874,0.0026732248,0.020727754],"study_design_scores_gemma":[0.000017500319,0.00004848065,0.0015628166,0.000015020009,0.000006960834,0.00003836968,0.000029746625,0.99059886,0.0038031444,0.0034636098,0.00040674699,0.0000087171975],"about_ca_topic_score_codex":0.0034777182,"about_ca_topic_score_gemma":0.0020389296,"teacher_disagreement_score":0.0034777182,"about_ca_system_score_codex":0.0008970363,"about_ca_system_score_gemma":0.0006633906,"threshold_uncertainty_score":0.011126459},"labels":[],"label_agreement":null},{"id":"W2114617845","doi":"10.1155/s016117120000257x","title":"Cauchy′s interlace theorem and lower bounds for the spectral radius","year":2000,"lang":"en","type":"article","venue":"International Journal of Mathematics and Mathematical Sciences","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Mathematics; Spectral radius; Interlacing; Cauchy distribution; RADIUS; Upper and lower bounds; Matrix (chemical analysis); Simple (philosophy); Pure mathematics; Combinatorics; Mathematical analysis; Quantum mechanics; Eigenvalues and eigenvectors; Physics","score_opus":0.015057881349219199,"score_gpt":0.2819155211449836,"score_spread":0.2668576397957644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114617845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01787569,0.008823334,0.91824853,0.0035284164,0.0013643767,0.00008533253,0.00027415424,0.00042180248,0.049378324],"genre_scores_gemma":[0.52414775,0.02046541,0.3970436,0.0044618817,0.005858951,0.0010029372,0.00088189996,0.0017881609,0.044349443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995906,0.0010323036,0.00024666823,0.000845592,0.001450038,0.0005193662],"domain_scores_gemma":[0.9763204,0.014157148,0.0013178062,0.0023771646,0.0045896005,0.001237884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068139792,0.0028153732,0.0019180477,0.005850732,0.0021719278,0.0030987142,0.0037007527,0.003325785,0.008624366],"category_scores_gemma":[0.038334794,0.0009500373,0.0027789855,0.0032121835,0.0062506204,0.012385633,0.005829038,0.009542028,0.004228063],"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.00010795819,0.000050264673,0.00046096416,0.00038619526,0.000055558707,0.00029014033,0.0003441479,0.0070819925,0.0060689114,0.94625264,0.008400439,0.030500751],"study_design_scores_gemma":[0.000015849799,0.000101687765,0.0006172639,0.000112607384,0.00004296891,0.0005743174,0.00010475022,0.04848585,0.007204161,0.9187813,0.023871375,0.00008793229],"about_ca_topic_score_codex":0.0013716932,"about_ca_topic_score_gemma":0.0007022889,"teacher_disagreement_score":0.008624366,"about_ca_system_score_codex":0.0020423643,"about_ca_system_score_gemma":0.001121138,"threshold_uncertainty_score":0.036036193},"labels":[],"label_agreement":null},{"id":"W2114959612","doi":"10.1007/s10463-006-0075-3","title":"On constrained generalized inverses of matrices and their properties","year":2006,"lang":"en","type":"article","venue":"Annals of the Institute of Statistical Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Pure mathematics; Applied mathematics","score_opus":0.04436942490366452,"score_gpt":0.2699079812584746,"score_spread":0.22553855635481007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114959612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06481347,0.0016519199,0.91842294,0.0007879884,0.00018425976,0.000038647406,0.0002648181,0.00019262069,0.013643249],"genre_scores_gemma":[0.71097296,0.005790552,0.2578251,0.0013586855,0.0016326164,0.0003241308,0.0012802669,0.0005898693,0.02022584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976617,0.0010666861,0.00011888801,0.0004536343,0.0005449715,0.00015412612],"domain_scores_gemma":[0.97401977,0.019645859,0.0020345654,0.001951669,0.0017786154,0.0005696111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028669827,0.0014378423,0.0013110945,0.002427317,0.00096678047,0.0026298284,0.0016727598,0.002072545,0.0057828366],"category_scores_gemma":[0.03008678,0.0009135319,0.0012354732,0.0033113225,0.004266731,0.006015242,0.0025464674,0.0028275186,0.0012313883],"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.000057159556,0.000032963722,0.0004185124,0.00008452897,0.000024271943,0.00016416228,0.00027083885,0.012943043,0.0016861113,0.96547747,0.0017875748,0.017053483],"study_design_scores_gemma":[0.000015538688,0.00003345689,0.00027225836,0.000026052998,0.000009183639,0.00024660403,0.00005408365,0.04445199,0.00045893528,0.95245594,0.0019461939,0.000029667635],"about_ca_topic_score_codex":0.0011418463,"about_ca_topic_score_gemma":0.0010463304,"teacher_disagreement_score":0.0057828366,"about_ca_system_score_codex":0.00050203037,"about_ca_system_score_gemma":0.0007528232,"threshold_uncertainty_score":0.019345522},"labels":[],"label_agreement":null},{"id":"W2115288744","doi":"10.1016/j.laa.2008.06.005","title":"A note on the fixed-point iteration for the matrix equations <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mrow><mml:mi>X</mml:mi><mml:mo>±</mml:mo><mml:msup><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mo>∗</mml:mo></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:mi>I</mml:mi></mml:mrow></mml:math>","year":2008,"lang":"lv","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":20,"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 Regina","funders":"","keywords":"Mathematics; Scroll; Matrix (chemical analysis); Point (geometry); Discrete mathematics; Combinatorics; Geometry; Theology","score_opus":0.019777197018780016,"score_gpt":0.24850231302795073,"score_spread":0.22872511600917073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115288744","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016966834,0.008099744,0.9188496,0.0040647592,0.0068283547,0.0000909226,0.00040881685,0.0008327942,0.059128314],"genre_scores_gemma":[0.073080234,0.014334413,0.7806564,0.0035875377,0.008609688,0.00067792647,0.0014140415,0.003578276,0.1140615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805474,0.0008087427,0.0001249465,0.0003081498,0.00062344834,0.000079993064],"domain_scores_gemma":[0.9971545,0.0017331084,0.00007228636,0.00044412847,0.00047683076,0.00011919814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042495034,0.0023789702,0.0017028619,0.0018273775,0.0011102743,0.0022698715,0.002719146,0.002120861,0.02572396],"category_scores_gemma":[0.009656787,0.0010124409,0.004003764,0.0021910602,0.0029942265,0.0047092196,0.002691283,0.009559056,0.013525524],"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.00012366625,0.00006356905,0.0002319802,0.00047597178,0.00009613179,0.0003588622,0.00033108713,0.010898735,0.0018391702,0.7852293,0.095837146,0.10451429],"study_design_scores_gemma":[0.00004325406,0.000104510895,0.00040664617,0.00024388406,0.0000534045,0.0003492545,0.000060897444,0.06612263,0.0017800226,0.7588647,0.17185718,0.00011366847],"about_ca_topic_score_codex":0.0054015047,"about_ca_topic_score_gemma":0.005282975,"teacher_disagreement_score":0.02572396,"about_ca_system_score_codex":0.0017044101,"about_ca_system_score_gemma":0.0016402323,"threshold_uncertainty_score":0.08605522},"labels":[],"label_agreement":null},{"id":"W2115384070","doi":"10.1109/ipdps.2004.1303271","title":"A parallel method for near-circulant penta-diagonal systems","year":2004,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 New Brunswick","funders":"","keywords":"Toeplitz matrix; Tridiagonal matrix; Circulant matrix; Diagonal; Coefficient matrix; Row; Linear system; Matrix (chemical analysis); Computer science; Band matrix; Row and column spaces; Mathematics; Algorithm; Tridiagonal matrix algorithm; Symmetric matrix; Square matrix; Eigenvalues and eigenvectors; Mathematical analysis; Pure mathematics; Geometry","score_opus":0.022944527111537185,"score_gpt":0.2887929345556607,"score_spread":0.2658484074441235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115384070","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054911496,0.00023715317,0.98570967,0.00014519338,0.0001416425,0.00010242253,0.00008420453,0.0005662837,0.007522197],"genre_scores_gemma":[0.07384986,0.00028301566,0.90984756,0.00010151998,0.00009796414,0.00043596583,0.00018780284,0.00051625964,0.014679985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997669,0.000061977196,0.000009712493,0.000022869732,0.00011359934,0.000025032046],"domain_scores_gemma":[0.9995185,0.00021660519,0.0000270351,0.0000631534,0.00013428251,0.000040435483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051128323,0.0006625367,0.00086563325,0.0006583353,0.0010710867,0.00063448155,0.0012610189,0.0007165912,0.013450465],"category_scores_gemma":[0.0011675834,0.00034891863,0.0005299541,0.0009237134,0.0006354226,0.000696677,0.0011213421,0.0011163487,0.0036666496],"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.0001389958,0.00017307498,0.00054694107,0.0004099659,0.000081449696,0.000522626,0.0002322801,0.57092595,0.009972705,0.13899058,0.021492891,0.25651252],"study_design_scores_gemma":[0.000027006166,0.000023892459,0.000055817683,0.000012810867,0.000005390123,0.000052315536,0.000019828181,0.9754267,0.0008270426,0.016575625,0.006964348,0.0000091620905],"about_ca_topic_score_codex":0.0044269953,"about_ca_topic_score_gemma":0.00827641,"teacher_disagreement_score":0.013450465,"about_ca_system_score_codex":0.0005517927,"about_ca_system_score_gemma":0.0014118616,"threshold_uncertainty_score":0.04499632},"labels":[],"label_agreement":null},{"id":"W2116631256","doi":"10.1109/acc.2009.5159967","title":"Generalized real perturbation values with applications to the structured real controllability radius of LTI systems","year":2009,"lang":"en","type":"article","venue":"","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":"University of Toronto","funders":"","keywords":"Controllability; Perturbation (astronomy); Computation; Robustness (evolution); Mathematics; Control theory (sociology); Inverted pendulum; Applied mathematics; Computer science; Mathematical analysis; Algorithm; Physics; Control (management)","score_opus":0.010159347643315825,"score_gpt":0.24866081744750312,"score_spread":0.2385014698041873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116631256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04143902,0.00023971414,0.9545125,0.000102556485,0.000042037027,0.00003830049,0.00002849798,0.00034088088,0.0032566225],"genre_scores_gemma":[0.8450662,0.000247446,0.15307803,0.000053787742,0.000057466757,0.00007064441,0.000050325285,0.00015138005,0.0012247976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954444,0.00015467903,0.000028478722,0.00006482237,0.00017700954,0.000030505578],"domain_scores_gemma":[0.9982198,0.0010318944,0.00022018826,0.00022824209,0.00023466407,0.00006525049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092689163,0.0006476979,0.00043302262,0.0010276271,0.00026207085,0.0008338598,0.0006350693,0.0004064014,0.0018984446],"category_scores_gemma":[0.0059836074,0.00018504604,0.00031518197,0.0005184643,0.001117963,0.0019323537,0.00086425856,0.00068494736,0.00024420163],"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.00018498175,0.00005091828,0.00091518264,0.0001466401,0.000038522176,0.00036919993,0.00019091634,0.5727759,0.026269494,0.32756862,0.0008468864,0.070642665],"study_design_scores_gemma":[0.00000671732,0.00006310318,0.00022736768,0.000012682628,0.000005280461,0.000081523845,0.000021670317,0.9291549,0.006313623,0.06339602,0.0006998778,0.000017375713],"about_ca_topic_score_codex":0.0002774471,"about_ca_topic_score_gemma":0.00026121148,"teacher_disagreement_score":0.0018984446,"about_ca_system_score_codex":0.00048566944,"about_ca_system_score_gemma":0.0002768697,"threshold_uncertainty_score":0.0063509345},"labels":[],"label_agreement":null},{"id":"W2116913423","doi":"10.1287/ijoc.1100.0383","title":"Algorithms for Coxianization of Phase-Type Generators","year":2010,"lang":"en","type":"article","venue":"INFORMS journal on computing","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":"Dalhousie University","funders":"","keywords":"Generator (circuit theory); Eigenvalues and eigenvectors; Type (biology); Phase (matter); Algorithm; Computer science; Mathematics; Physics; Power (physics); Thermodynamics","score_opus":0.02065572123318676,"score_gpt":0.3019533648761951,"score_spread":0.28129764364300835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116913423","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059430096,0.00005389551,0.99185586,0.000054480442,0.000018663006,0.00006951635,0.00004944763,0.0005510937,0.0014040846],"genre_scores_gemma":[0.106834985,0.00009569299,0.88888633,0.000064631655,0.000041096013,0.0002197649,0.00043696447,0.00034459482,0.003075847],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991499,0.00019065132,0.00007105833,0.00019891777,0.00025291884,0.00013658166],"domain_scores_gemma":[0.9972114,0.0015430395,0.00020943598,0.0004911723,0.00043765918,0.00010726435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001475702,0.0009979806,0.0010042876,0.0013840372,0.00090936216,0.0012302804,0.0017259793,0.00084056094,0.010439381],"category_scores_gemma":[0.0063151605,0.00055446697,0.0009794823,0.0010102686,0.00094169495,0.001978888,0.0026782241,0.0016149462,0.0026341195],"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.00050470914,0.00017839285,0.0015147817,0.0003079493,0.000079554666,0.00016042353,0.00043902363,0.21010996,0.011898246,0.23235199,0.009249949,0.53320503],"study_design_scores_gemma":[0.00015885833,0.000109650246,0.00017343705,0.00002435832,0.000019086272,0.00013555658,0.00012659976,0.7647285,0.0071142083,0.22064614,0.0067320364,0.00003148193],"about_ca_topic_score_codex":0.0013998876,"about_ca_topic_score_gemma":0.00239347,"teacher_disagreement_score":0.010439381,"about_ca_system_score_codex":0.0010552362,"about_ca_system_score_gemma":0.0017311967,"threshold_uncertainty_score":0.034923136},"labels":[],"label_agreement":null},{"id":"W2116987627","doi":"10.1109/tac.2002.800667","title":"A curve-shaping approach for determining bounds on H/sub ∞/ performance under hard constraints","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Transfer function; Bode plot; Norm (philosophy); Control theory (sociology); Bandwidth (computing); Sensitivity (control systems); Mathematics; Mathematical optimization; Optimization problem; Computer science; Applied mathematics; Engineering; Control (management)","score_opus":0.03858458955541905,"score_gpt":0.24447349508228658,"score_spread":0.20588890552686753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116987627","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004656856,0.00009816491,0.9919437,0.000067853616,0.000012817149,0.00002363677,0.000015644644,0.00016959611,0.0030117533],"genre_scores_gemma":[0.56502247,0.0006786754,0.42927912,0.00025756515,0.000067848865,0.0002158197,0.00010770942,0.0001904842,0.004180343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905664,0.0003117828,0.00003614735,0.00015486561,0.00036119128,0.00007929656],"domain_scores_gemma":[0.9968528,0.0022158187,0.00024124836,0.0002449524,0.00035306864,0.00009210644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020620555,0.0016742693,0.0009886605,0.00091430615,0.00042363512,0.001326388,0.0009638852,0.0014787405,0.0026077714],"category_scores_gemma":[0.009073287,0.0005107676,0.00049660413,0.000627383,0.002005721,0.0015648729,0.0014304501,0.0016464752,0.0006931178],"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.000100830046,0.00003642497,0.0002595163,0.00009228953,0.000029251882,0.000058521255,0.00008908919,0.8960156,0.01292474,0.038274094,0.00053036097,0.051589232],"study_design_scores_gemma":[0.000005887584,0.00009110971,0.00006195369,0.000016225364,0.000005088641,0.000022882916,0.000014645667,0.97402734,0.006530874,0.018327763,0.00088121486,0.000015042246],"about_ca_topic_score_codex":0.00081897085,"about_ca_topic_score_gemma":0.0005812595,"teacher_disagreement_score":0.0026077714,"about_ca_system_score_codex":0.0010593659,"about_ca_system_score_gemma":0.0009441053,"threshold_uncertainty_score":0.010905325},"labels":[],"label_agreement":null},{"id":"W2118811613","doi":"10.1137/s089547980036838x","title":"Twice Differentiable Spectral Functions","year":2001,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Differentiable function; Hessian matrix; Eigenvalues and eigenvectors; Pure mathematics; Symmetric matrix; Function (biology); Mathematical analysis; Matrix (chemical analysis); Applied mathematics","score_opus":0.007979552960835083,"score_gpt":0.2555741821285429,"score_spread":0.2475946291677078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118811613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12348103,0.00093304046,0.8360401,0.0011073782,0.00029827395,0.000051909166,0.00035785057,0.0005567973,0.037173565],"genre_scores_gemma":[0.8667603,0.001212605,0.09469093,0.00045145283,0.00034411292,0.00013608043,0.0004146569,0.0004868926,0.035502978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993781,0.0001230221,0.000031814106,0.00013098119,0.00022312588,0.000112901325],"domain_scores_gemma":[0.99801826,0.00059276144,0.00020585695,0.0002461479,0.0006656294,0.00027137145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000947605,0.0009845054,0.0005379859,0.0016213238,0.00055496686,0.0016249253,0.00068035885,0.0014107588,0.006295066],"category_scores_gemma":[0.004225913,0.00028962136,0.00051154307,0.00074200565,0.001770443,0.0033594957,0.0011824048,0.0015935972,0.0018484112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006183396,0.000030364637,0.00070837606,0.00007106004,0.000013097011,0.00038871352,0.00026395312,0.011452433,0.0152882105,0.9336768,0.003508626,0.034536567],"study_design_scores_gemma":[0.000017818222,0.00006912994,0.0010793986,0.00004245468,0.000010163047,0.00067824183,0.00020957438,0.18240446,0.007574796,0.7975833,0.010273838,0.000056808698],"about_ca_topic_score_codex":0.0006488421,"about_ca_topic_score_gemma":0.0004423977,"teacher_disagreement_score":0.006295066,"about_ca_system_score_codex":0.000777539,"about_ca_system_score_gemma":0.0004852578,"threshold_uncertainty_score":0.021059036},"labels":[],"label_agreement":null},{"id":"W2121091932","doi":"10.1109/rsp.2009.37","title":"Rapid Prototyping Projection Algorithms with FPGA Technology","year":2009,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Toeplitz matrix; Field-programmable gate array; Projection (relational algebra); Computer science; Algorithm; Acceleration; Field (mathematics); Mathematics; Embedded system","score_opus":0.010968935440026554,"score_gpt":0.2355907840777718,"score_spread":0.22462184863774523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121091932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016767511,0.0003460259,0.967595,0.00017063408,0.00012858561,0.00013559475,0.00006837908,0.0035014916,0.011286855],"genre_scores_gemma":[0.107555345,0.00033903663,0.88768893,0.000060454982,0.000037233123,0.00014601024,0.00013660963,0.00018965825,0.0038467213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993674,0.00014310006,0.00003557252,0.00006124707,0.00032881188,0.000063771295],"domain_scores_gemma":[0.99930346,0.00028298702,0.000037940128,0.00015390124,0.00018617365,0.00003554356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058871706,0.0007551983,0.0004191036,0.00046209496,0.00035783814,0.0010372323,0.00086066447,0.00056754693,0.009789616],"category_scores_gemma":[0.002138725,0.00033536882,0.00039646446,0.0004465952,0.0003509553,0.0010946367,0.00087515084,0.0008366267,0.0022163496],"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.00048378404,0.00013744035,0.0011927806,0.00041842993,0.00007182063,0.0009475899,0.0003034641,0.14336435,0.085851446,0.08629962,0.014518606,0.6664106],"study_design_scores_gemma":[0.00021170791,0.00052560115,0.00090199197,0.00014009757,0.000029907964,0.0010756287,0.00013743658,0.8128605,0.082217455,0.026924137,0.07490349,0.0000720065],"about_ca_topic_score_codex":0.0012484768,"about_ca_topic_score_gemma":0.0014538461,"teacher_disagreement_score":0.009789616,"about_ca_system_score_codex":0.00033991857,"about_ca_system_score_gemma":0.0006202361,"threshold_uncertainty_score":0.032749534},"labels":[],"label_agreement":null},{"id":"W2121454630","doi":"10.13001/1081-3810.1065","title":"How to establish universal block-matrix factorizations","year":2001,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Factorization; Algebra over a field; Quaternion; Block (permutation group theory); Matrix decomposition; Pure mathematics; Combinatorics; Algorithm; Eigenvalues and eigenvectors","score_opus":0.007173415064601761,"score_gpt":0.23528526945593906,"score_spread":0.2281118543913373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121454630","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015481104,0.0005693136,0.9551724,0.00034307686,0.0002978227,0.00011003426,0.00025822848,0.0007622327,0.027005743],"genre_scores_gemma":[0.3999078,0.0013567255,0.57782143,0.00085103733,0.0005364452,0.0004123004,0.0009769929,0.0012052171,0.016931994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964664,0.0007626784,0.00032001708,0.0009172745,0.0009343114,0.00059937435],"domain_scores_gemma":[0.9957848,0.0014043773,0.00030534453,0.000986742,0.001215226,0.00030355022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037930987,0.0012498291,0.001289628,0.002630828,0.0019293939,0.0021808967,0.0011504468,0.0010167098,0.018524418],"category_scores_gemma":[0.010994314,0.0008620844,0.0014854883,0.0014191727,0.0028497644,0.009574255,0.0043947226,0.002853424,0.005737643],"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.00004748804,0.00002471542,0.00030628362,0.00013641351,0.000021323427,0.0001392033,0.00032223016,0.001989185,0.0033552316,0.94901174,0.003542827,0.04110347],"study_design_scores_gemma":[0.000011649854,0.000029851994,0.00014757071,0.000061427054,0.000015316205,0.00014791747,0.000082046616,0.012187921,0.0058254353,0.96864855,0.012807492,0.000034839497],"about_ca_topic_score_codex":0.0012617211,"about_ca_topic_score_gemma":0.0013235095,"teacher_disagreement_score":0.018524418,"about_ca_system_score_codex":0.00082353404,"about_ca_system_score_gemma":0.0009591568,"threshold_uncertainty_score":0.061970294},"labels":[],"label_agreement":null},{"id":"W2122266675","doi":"10.1002/nla.547","title":"An efficient linear programming solver for optimal filter synthesis","year":2007,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Sun Microsystems; Intel Corporation","keywords":"Solver; Linear programming; Deconvolution; Mathematics; Linear system; Mathematical optimization; Filter (signal processing); Algorithm; Point (geometry); Block (permutation group theory); System of linear equations; Applied mathematics; Computer science","score_opus":0.011562888039975466,"score_gpt":0.2707725232927044,"score_spread":0.25920963525272894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122266675","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021293422,0.000051139996,0.9956879,0.00008404737,0.000013383519,0.000025417352,0.000035799763,0.00025273155,0.0017202046],"genre_scores_gemma":[0.09197761,0.00013392688,0.903076,0.000090208596,0.000035728703,0.00036010265,0.0001554191,0.00023974731,0.0039311433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995524,0.00016939738,0.00001757674,0.000062900566,0.0001503858,0.00004721082],"domain_scores_gemma":[0.9989648,0.00079985335,0.0000471976,0.000039346156,0.00012394042,0.000024914762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011682983,0.0009229154,0.0011946082,0.00062346674,0.00045635807,0.0010737404,0.00076788815,0.0012609132,0.0073061455],"category_scores_gemma":[0.0030041859,0.0006967603,0.0006581295,0.00071506377,0.00071266975,0.0006774402,0.0009766672,0.0014972377,0.0014006858],"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.00007874923,0.00005735705,0.00016733445,0.00014773115,0.000030044737,0.00008846992,0.00007644913,0.86710715,0.0030524002,0.043862738,0.0028510068,0.082480475],"study_design_scores_gemma":[0.000017715838,0.000009528357,0.000009613616,0.000004865003,0.000002642026,0.0000068096747,0.0000071018185,0.99230605,0.0004698848,0.0063260165,0.0008374673,0.0000023173966],"about_ca_topic_score_codex":0.0038536533,"about_ca_topic_score_gemma":0.0041575585,"teacher_disagreement_score":0.0073061455,"about_ca_system_score_codex":0.00066147925,"about_ca_system_score_gemma":0.0021154003,"threshold_uncertainty_score":0.02444154},"labels":[],"label_agreement":null},{"id":"W2123124454","doi":"10.1002/acs.774","title":"Exponential convergence of the Kalman filter based parameter estimation algorithm","year":2003,"lang":"en","type":"article","venue":"International Journal of Adaptive Control and Signal Processing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Kalman filter; Convergence (economics); Extended Kalman filter; Rate of convergence; Fast Kalman filter; Exponential function; Invariant extended Kalman filter; Mathematics; Algorithm; Ensemble Kalman filter; Computer science; Covariance matrix; Mathematical optimization; Applied mathematics; Statistics","score_opus":0.012493526994320915,"score_gpt":0.24016746122314733,"score_spread":0.22767393422882642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123124454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036290684,0.0001838868,0.99443984,0.000057863544,0.000028015613,0.000014227699,0.000012618405,0.00014356317,0.0014910224],"genre_scores_gemma":[0.6521825,0.0011256188,0.33585897,0.0002453771,0.00015742776,0.0003990661,0.00026717936,0.00029729842,0.009466591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983968,0.0005673423,0.00008431921,0.00028137778,0.0005715167,0.000098612145],"domain_scores_gemma":[0.99520737,0.0030014801,0.00026209417,0.00029469386,0.0011820823,0.000052289266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00363646,0.0007706962,0.0009911928,0.00085229176,0.00042817884,0.0013694735,0.0010501292,0.001172345,0.003166271],"category_scores_gemma":[0.015794795,0.00045559288,0.00065533305,0.00062090263,0.0011690814,0.0021268243,0.0013755216,0.0017602099,0.0010310702],"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.00013012251,0.00003560739,0.00087041507,0.00016966905,0.000094108866,0.000055750264,0.00015298965,0.8044848,0.0052325334,0.07709645,0.0014422571,0.11023527],"study_design_scores_gemma":[0.000007499355,0.000014687716,0.00013947216,0.000016044201,0.000007739092,0.000018643095,0.000004822749,0.9922577,0.0011600539,0.005688565,0.0006750807,0.000009701055],"about_ca_topic_score_codex":0.0038859379,"about_ca_topic_score_gemma":0.001663731,"teacher_disagreement_score":0.0038859379,"about_ca_system_score_codex":0.0008312316,"about_ca_system_score_gemma":0.0014207832,"threshold_uncertainty_score":0.019231677},"labels":[],"label_agreement":null},{"id":"W2124251904","doi":"10.1002/cem.1230","title":"Algorithms for DEDICOM: acceleration, deceleration, or neither?","year":2009,"lang":"en","type":"article","venue":"Journal of Chemometrics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Monotonic function; Convergence (economics); Eigenvalues and eigenvectors; Computation; Extrapolation; Acceleration; Algorithm; Polynomial; Simple (philosophy); Matrix (chemical analysis); Mathematics; Computer science; Decomposition; Mathematical optimization","score_opus":0.051647291405399344,"score_gpt":0.3183347952125155,"score_spread":0.26668750380711614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124251904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004256963,0.00038350114,0.9921765,0.0004762351,0.000100897305,0.000037282374,0.000026997926,0.0005434503,0.0019981642],"genre_scores_gemma":[0.092258975,0.0003804773,0.9012295,0.00030795464,0.0001735054,0.00012977862,0.00018903633,0.00029430588,0.0050364714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899954,0.0002989523,0.00007922249,0.00023774352,0.0002944916,0.00009013449],"domain_scores_gemma":[0.99688417,0.0013023964,0.00021888874,0.0008016221,0.0006043686,0.00018847518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021699066,0.0009429331,0.00085373403,0.0010330904,0.0006930623,0.0015985827,0.0018445239,0.001166863,0.008303605],"category_scores_gemma":[0.007923622,0.0004254997,0.0008081213,0.0011216273,0.0013388233,0.0031781406,0.0029187307,0.0026401584,0.0030507427],"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.00056881254,0.00016336377,0.00141889,0.00038295545,0.00006608883,0.00015041338,0.0002725448,0.071479484,0.006532364,0.23145299,0.020655893,0.66685617],"study_design_scores_gemma":[0.00012800664,0.00012654983,0.00049465435,0.00010154668,0.000023099268,0.0003827299,0.00015790107,0.7636851,0.0075992527,0.20266737,0.02458805,0.00004579827],"about_ca_topic_score_codex":0.0009452434,"about_ca_topic_score_gemma":0.0010227624,"teacher_disagreement_score":0.008303605,"about_ca_system_score_codex":0.0006699478,"about_ca_system_score_gemma":0.0007635371,"threshold_uncertainty_score":0.027778327},"labels":[],"label_agreement":null},{"id":"W2124343650","doi":"10.1090/s0002-9939-07-09068-5","title":"An elementary and constructive solution to Hilbert’s 17th Problem for matrices","year":2007,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":29,"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":"Banff International Research Station for Mathematical Innovation and Discovery; National Science Foundation","keywords":"Constructive; Mathematics; Pure mathematics; Algebra over a field; Computer science; Process (computing); Programming language","score_opus":0.008320411574523567,"score_gpt":0.26165750474030663,"score_spread":0.25333709316578307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124343650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015889432,0.002252535,0.72612315,0.00673774,0.0022723428,0.00011762683,0.0005665883,0.00077880267,0.2452618],"genre_scores_gemma":[0.35726988,0.0038439257,0.46668667,0.0036575913,0.0025423837,0.00047239786,0.0011002565,0.0012954506,0.1631314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991704,0.0002335469,0.00003418172,0.00010205702,0.00033582392,0.00012400023],"domain_scores_gemma":[0.99913424,0.00047460452,0.000045844223,0.00009350277,0.00017225301,0.000079627374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015298292,0.0012959242,0.0007850411,0.0012100905,0.0013482498,0.0024917154,0.0013773547,0.0013854885,0.031364977],"category_scores_gemma":[0.004695862,0.0005554736,0.0017675919,0.0009343788,0.0028071709,0.0043882784,0.0040822364,0.0039787632,0.0067712455],"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.00001058461,0.000016041762,0.000042496365,0.00007076426,0.0000092025,0.000051883693,0.00014641078,0.0010141805,0.00046385653,0.98116964,0.0075288084,0.009476102],"study_design_scores_gemma":[0.000016191021,0.00001662526,0.00005962736,0.000029898685,0.0000070338338,0.000080071506,0.000064451575,0.0058556176,0.00059834647,0.96774065,0.025518928,0.000012596456],"about_ca_topic_score_codex":0.0011950987,"about_ca_topic_score_gemma":0.0020284662,"teacher_disagreement_score":0.031364977,"about_ca_system_score_codex":0.0015903079,"about_ca_system_score_gemma":0.0015618398,"threshold_uncertainty_score":0.10492629},"labels":[],"label_agreement":null},{"id":"W2124789259","doi":"10.1016/s0024-3795(00)00040-9","title":"Decomposable numerical ranges on orthonormal tensors","year":2000,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto; National Science Foundation","keywords":"Orthonormal basis; Mathematics; Numerical range; Character (mathematics); Combinatorics; Matrix (chemical analysis); Degree (music); Algebraic number; Pure mathematics; Algebra over a field; Mathematical analysis; Geometry","score_opus":0.00867010891196819,"score_gpt":0.23980682163638037,"score_spread":0.2311367127244122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124789259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09652632,0.0005467261,0.8800309,0.00037525993,0.00017013714,0.00004138415,0.00022668458,0.00070678,0.02137591],"genre_scores_gemma":[0.6807626,0.001022102,0.29898968,0.00030754576,0.00046671068,0.00010971761,0.00069190405,0.0007398089,0.016909923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812776,0.00060243375,0.00012765345,0.0003104342,0.00062719744,0.00020456336],"domain_scores_gemma":[0.9965965,0.0012213215,0.0004308461,0.00089111004,0.0005333671,0.00032682964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013944886,0.00083098444,0.00063434185,0.0018601639,0.0006257834,0.002450348,0.0009898748,0.0006139761,0.0069487453],"category_scores_gemma":[0.0058843144,0.00049257686,0.00051813235,0.0016563896,0.0022758837,0.0057057883,0.0032549147,0.002130199,0.001641214],"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.00008528671,0.000051122097,0.0003137913,0.000068730405,0.000010594497,0.00015834026,0.0002981742,0.0050684856,0.0054826792,0.92384535,0.002190439,0.062427074],"study_design_scores_gemma":[0.000009782858,0.000060198498,0.00019958867,0.00003081754,0.000008236085,0.00021008193,0.00013819315,0.030248705,0.004757633,0.95859104,0.005727355,0.000018460087],"about_ca_topic_score_codex":0.0001929613,"about_ca_topic_score_gemma":0.00028192572,"teacher_disagreement_score":0.0069487453,"about_ca_system_score_codex":0.0003331987,"about_ca_system_score_gemma":0.0002828357,"threshold_uncertainty_score":0.023245871},"labels":[],"label_agreement":null},{"id":"W2124912997","doi":"10.2478/spma-2014-0008","title":"Inverses and eigenvalues of diamondalternating sign matrices","year":2014,"lang":"en","type":"article","venue":"Special Matrices","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":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria","keywords":"Eigenvalues and eigenvectors; Mathematics; Sign (mathematics); Inverse; Diamond; Binomial theorem; Matrix (chemical analysis); Combinatorics; Binomial coefficient; Polynomial; Binomial (polynomial); Characteristic polynomial; Pure mathematics; Mathematical analysis; Geometry; Physics; Statistics; Quantum mechanics","score_opus":0.009672768240546798,"score_gpt":0.23120133655520478,"score_spread":0.22152856831465798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124912997","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57710236,0.00021096953,0.39283103,0.00024507203,0.00013808665,0.000050948718,0.00016660971,0.00031340143,0.028941507],"genre_scores_gemma":[0.9465374,0.00010168914,0.047102638,0.00004370956,0.000034792145,0.000030315066,0.000091696216,0.00004617332,0.00601167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954826,0.000105458996,0.000017925351,0.0000603208,0.0002079904,0.000060004895],"domain_scores_gemma":[0.9989004,0.00037950312,0.0001762724,0.00011800806,0.00029896884,0.00012676607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041568137,0.00035515716,0.00019980893,0.00076267245,0.0003021657,0.00070873596,0.00031813025,0.00036235285,0.0061910474],"category_scores_gemma":[0.0031123548,0.00016603056,0.00016787685,0.00030917113,0.0010254297,0.00071117847,0.0005850306,0.0005084271,0.0006166436],"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.00022972414,0.00010407949,0.0019421674,0.00011711104,0.000015589405,0.000717258,0.00048264815,0.021276567,0.049935177,0.86092937,0.0036383476,0.060612004],"study_design_scores_gemma":[0.00004490341,0.00012508799,0.0021305606,0.000046850142,0.0000076142346,0.0010985725,0.00028171396,0.249826,0.02078082,0.71731234,0.008279465,0.00006598724],"about_ca_topic_score_codex":0.00037038623,"about_ca_topic_score_gemma":0.00052203995,"teacher_disagreement_score":0.0061910474,"about_ca_system_score_codex":0.00027069612,"about_ca_system_score_gemma":0.00023841823,"threshold_uncertainty_score":0.020711124},"labels":[],"label_agreement":null},{"id":"W21261701","doi":"10.1111/j.1525-1470.2010.01352.x","title":"New algorithms for matrices, polynomials and matrix polynomials","year":2006,"lang":"en","type":"article","venue":"Pediatric Dermatology","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Polynomial matrix; Matrix polynomial; Mathematics; Polynomial; Companion matrix; Eigenvalues and eigenvectors; Matrix (chemical analysis); Reciprocal polynomial; Rayleigh quotient; Computation; Algebra over a field; Lagrange polynomial; Applied mathematics; Algorithm; Pure mathematics; Mathematical analysis","score_opus":0.010091918546949834,"score_gpt":0.2578278145457859,"score_spread":0.24773589599883608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W21261701","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032955594,0.0009270083,0.99182266,0.00041489463,0.00025538934,0.000034282155,0.00007751633,0.00032432025,0.0028483246],"genre_scores_gemma":[0.07840069,0.0020303365,0.9125535,0.00024198354,0.0005016287,0.00018481647,0.0004157272,0.00017939149,0.0054918793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845004,0.00047993605,0.0001018531,0.0002530953,0.00060719927,0.00010790578],"domain_scores_gemma":[0.9970611,0.0015194558,0.00026159678,0.0003840152,0.0006512085,0.00012257464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013173058,0.0011841519,0.0006406387,0.0018257857,0.0007745646,0.0017467611,0.0012904941,0.0009643835,0.0042681023],"category_scores_gemma":[0.011669481,0.00042451112,0.000723419,0.0019723235,0.0012331171,0.0041890135,0.0025596519,0.0024991732,0.0022293674],"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.00013639423,0.00007905124,0.000940728,0.00032592242,0.00006066395,0.00017085944,0.00030511303,0.07624936,0.0036510527,0.49753603,0.016979808,0.403565],"study_design_scores_gemma":[0.000040450184,0.00011341678,0.00028793968,0.00007130426,0.000019452607,0.0005073234,0.000096195196,0.49395838,0.0021391464,0.4668311,0.035895415,0.000039795723],"about_ca_topic_score_codex":0.0016538925,"about_ca_topic_score_gemma":0.002179711,"teacher_disagreement_score":0.0042681023,"about_ca_system_score_codex":0.0008150354,"about_ca_system_score_gemma":0.00082262856,"threshold_uncertainty_score":0.014278233},"labels":[],"label_agreement":null},{"id":"W2127017400","doi":"10.1016/j.laa.2006.09.023","title":"A generalized eigenvalue problem in the max algebra","year":2007,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Uniqueness; Eigenvalues and eigenvectors; Combinatorics; Product (mathematics); Pure mathematics; Algebra over a field; Mathematical analysis; Geometry","score_opus":0.01408071755192025,"score_gpt":0.2626993614384288,"score_spread":0.24861864388650856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127017400","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14215271,0.0012699321,0.7864956,0.0066036256,0.0007921933,0.000067192566,0.00032307045,0.00036153026,0.06193415],"genre_scores_gemma":[0.86329913,0.001029796,0.09864056,0.0011479311,0.001226962,0.00019447897,0.00032569037,0.00025984657,0.03387568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985973,0.00064104964,0.000049363472,0.00027280723,0.0002991807,0.00014027012],"domain_scores_gemma":[0.9982539,0.00093415525,0.00018788561,0.00019193513,0.00022499255,0.00020709718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001491819,0.00078475004,0.0012904763,0.00091403606,0.0015128186,0.0031803332,0.0014047099,0.0016445584,0.0100313695],"category_scores_gemma":[0.0056092944,0.000436696,0.00085590844,0.0014516867,0.0030943365,0.0056728497,0.0024104249,0.0027652623,0.0012189652],"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.0000346969,0.000021799202,0.000114275215,0.000045968336,0.000013371961,0.00006640945,0.0001138639,0.004474102,0.00065270346,0.9849244,0.0027344842,0.006803814],"study_design_scores_gemma":[0.0000066180505,0.000006640748,0.000038444457,0.000004941752,0.000002985821,0.000037759706,0.000035793426,0.0159945,0.00015700012,0.9827808,0.0009274406,0.0000070389815],"about_ca_topic_score_codex":0.00066986034,"about_ca_topic_score_gemma":0.0006898328,"teacher_disagreement_score":0.0100313695,"about_ca_system_score_codex":0.0008954253,"about_ca_system_score_gemma":0.0009513399,"threshold_uncertainty_score":0.03355831},"labels":[],"label_agreement":null},{"id":"W2128952174","doi":"10.1109/cdc.1992.371096","title":"On computing the eigenvalues of a symplectic pencil","year":2005,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"Pencil (optics); Symplectic geometry; Eigenvalues and eigenvectors; Matrix pencil; Algebraic number; Mathematics; Algebra over a field; Algebraic Riccati equation; Symplectic matrix; Applied mathematics; Pure mathematics; Computer science; Symplectic representation; Riccati equation; Mathematical analysis; Symplectic manifold; Differential equation; Physics","score_opus":0.01548347772842862,"score_gpt":0.24994179163024915,"score_spread":0.23445831390182054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128952174","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008986749,0.00010541801,0.98591006,0.00009251244,0.00006511092,0.000031705487,0.000030836847,0.0006439319,0.0041337186],"genre_scores_gemma":[0.113049924,0.0003028696,0.8772617,0.00011483799,0.00005629346,0.00011745675,0.00020263664,0.00037403897,0.008520256],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994294,0.00013221789,0.000032673855,0.00009496387,0.0002482698,0.000062401305],"domain_scores_gemma":[0.9986143,0.0007801338,0.00008678071,0.00016909851,0.00028936836,0.00006023381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006970626,0.0009201672,0.0008370657,0.0011789987,0.00095274346,0.0015317745,0.0008817654,0.0008622318,0.0069909506],"category_scores_gemma":[0.004470559,0.00047764095,0.0004823929,0.0013835225,0.0012731592,0.002961298,0.0016608491,0.0011212581,0.002509819],"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.00018915511,0.00013865475,0.00091866066,0.00027417694,0.000043682863,0.00032368817,0.0003809479,0.16397993,0.014698942,0.30116823,0.008686522,0.5091974],"study_design_scores_gemma":[0.000053114523,0.00008297071,0.00024476994,0.000030840518,0.000008054973,0.0001701684,0.00009511224,0.74511504,0.009355225,0.23553027,0.009276006,0.000038453676],"about_ca_topic_score_codex":0.0009400433,"about_ca_topic_score_gemma":0.0012041848,"teacher_disagreement_score":0.0069909506,"about_ca_system_score_codex":0.0004534843,"about_ca_system_score_gemma":0.00076586095,"threshold_uncertainty_score":0.023387015},"labels":[],"label_agreement":null},{"id":"W2128985516","doi":"10.1002/nla.1826","title":"Finding off‐diagonal entries of the inverse of a large symmetric sparse matrix","year":2012,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Diagonal; Inverse; Mathematics; Diagonal matrix; Node (physics); Matrix (chemical analysis); Combinatorics; Vertex (graph theory); Algorithm; Block matrix; Band matrix; Square matrix; Symmetric matrix; Eigenvalues and eigenvectors; Geometry; Graph","score_opus":0.012424760643217217,"score_gpt":0.2608739387652651,"score_spread":0.2484491781220479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128985516","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031909823,0.000029554985,0.96586835,0.000067826135,0.000020654026,0.00002760058,0.000031275795,0.00028073366,0.0017641081],"genre_scores_gemma":[0.3289505,0.000069606154,0.6674333,0.00005424879,0.000023716771,0.000054538195,0.000171366,0.00013899231,0.003103709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997074,0.000059115344,0.000015814194,0.000043016145,0.00014418358,0.000030440478],"domain_scores_gemma":[0.9990595,0.0004561964,0.0001091366,0.000118807664,0.00020427587,0.000052205552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004908455,0.00049164874,0.0004534467,0.0006601863,0.00032866825,0.0005234308,0.00054209045,0.00033897525,0.0028597454],"category_scores_gemma":[0.0027287495,0.00027053512,0.0005069437,0.0003065238,0.00071348046,0.0008513611,0.0008608158,0.00067172456,0.00066895917],"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.00035198563,0.00014625805,0.003749196,0.0003627618,0.00006825108,0.0006997627,0.0006414152,0.40261734,0.12939452,0.15437523,0.006252195,0.3013411],"study_design_scores_gemma":[0.000020550126,0.0000766899,0.0004416083,0.000013792109,0.000007068263,0.00016935075,0.00006628779,0.9455926,0.018709175,0.031910416,0.0029757721,0.000016589514],"about_ca_topic_score_codex":0.0013699359,"about_ca_topic_score_gemma":0.0020333428,"teacher_disagreement_score":0.0028597454,"about_ca_system_score_codex":0.00030306613,"about_ca_system_score_gemma":0.0006427492,"threshold_uncertainty_score":0.009566784},"labels":[],"label_agreement":null},{"id":"W2129343865","doi":"10.1109/tpds.2012.286","title":"Parallel Sparse Approximate Inverse Preconditioning on Graphic Processing Units","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":35,"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; National Science Foundation","keywords":"Preconditioner; Computer science; Biconjugate gradient stabilized method; Solver; Parallel computing; Computational science; Rate of convergence; Sparse matrix; Iterative method; Biconjugate gradient method; Linear system; Convergence (economics); Algorithm; Mathematics; Conjugate residual method; Gradient descent; Channel (broadcasting); Artificial intelligence","score_opus":0.03125104163723649,"score_gpt":0.23963007811566095,"score_spread":0.20837903647842446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129343865","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04588474,0.00047473112,0.9130146,0.00039853356,0.00023659962,0.00015498407,0.0003898741,0.015663723,0.023782237],"genre_scores_gemma":[0.2736414,0.0003426524,0.7099572,0.00028392312,0.00008869547,0.00028024518,0.0013911597,0.00081598083,0.013198772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944574,0.000110078545,0.000025317533,0.000069307316,0.00027733875,0.000072191964],"domain_scores_gemma":[0.99938357,0.000114815375,0.000040002888,0.0002194028,0.00020879832,0.00003335717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029884066,0.00075895136,0.0005871268,0.0005577174,0.0004627438,0.00071104296,0.0011899554,0.0005025448,0.011653329],"category_scores_gemma":[0.0014654582,0.00035081498,0.0006036561,0.0013819779,0.00041458794,0.0006117247,0.0009841035,0.0008164579,0.0035685485],"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.0010867094,0.0001563753,0.0021498788,0.00041726814,0.00010483304,0.0005743541,0.0002584751,0.2718699,0.10292741,0.042703047,0.068528004,0.5092237],"study_design_scores_gemma":[0.00015418878,0.00017666975,0.0013341928,0.000025912132,0.000028109871,0.00018119982,0.000050132006,0.9142967,0.03887251,0.011509339,0.033343602,0.00002750465],"about_ca_topic_score_codex":0.0052312603,"about_ca_topic_score_gemma":0.007818359,"teacher_disagreement_score":0.011653329,"about_ca_system_score_codex":0.0005295928,"about_ca_system_score_gemma":0.0011661813,"threshold_uncertainty_score":0.0389843},"labels":[],"label_agreement":null},{"id":"W2129405000","doi":"10.1016/s0024-3795(00)00237-8","title":"A criterion for the existence of common invariant subspaces of matrices","year":2001,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":20,"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 Regina","funders":"","keywords":"Mathematics; Linear subspace; Invertible matrix; Invariant (physics); Eigenvalues and eigenvectors; Invariant subspace; Subspace topology; Grassmannian; Pure mathematics; Scalar (mathematics); Dimension (graph theory); Combinatorics; Mathematical analysis; Mathematical physics","score_opus":0.021887210000284943,"score_gpt":0.2794851996961133,"score_spread":0.25759798969582837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129405000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20628192,0.00095194497,0.76296383,0.00096233067,0.00019900753,0.00017828851,0.0007785837,0.00046201804,0.027222086],"genre_scores_gemma":[0.8781789,0.00049425854,0.111957885,0.00042937012,0.00037904357,0.0002583995,0.0014277409,0.00021742655,0.0066569564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960239,0.0008578841,0.00034316364,0.0009885643,0.0012422111,0.00054431637],"domain_scores_gemma":[0.97767544,0.010125415,0.0017465343,0.0021224804,0.006412803,0.0019172655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002750689,0.0010865182,0.0016314348,0.0040557436,0.0027290145,0.0052736714,0.0016416712,0.0023249513,0.004696515],"category_scores_gemma":[0.018259589,0.0007138845,0.001068402,0.002608151,0.0050180824,0.0052589136,0.0051503233,0.0029411537,0.001221791],"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.00022698034,0.00007692568,0.003098456,0.00012371769,0.000058488942,0.00021581707,0.0005408154,0.0051109097,0.010351462,0.95174813,0.0031025615,0.025345683],"study_design_scores_gemma":[0.00006035968,0.0003513107,0.0025752261,0.00013079797,0.00006289446,0.00086720096,0.0007911852,0.06889553,0.01597348,0.8973041,0.012860287,0.0001276874],"about_ca_topic_score_codex":0.0007921608,"about_ca_topic_score_gemma":0.00062568235,"teacher_disagreement_score":0.0052736714,"about_ca_system_score_codex":0.0009348094,"about_ca_system_score_gemma":0.0013247228,"threshold_uncertainty_score":0.015711427},"labels":[],"label_agreement":null},{"id":"W2129466305","doi":"10.1162/neco_a_00549","title":"A Novel Iterative Method for Computing Generalized Inverse","year":2013,"lang":"en","type":"article","venue":"Neural Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Natural Science Foundation of China","keywords":"Iterative method; Karush–Kuhn–Tucker conditions; Convergence (economics); Inverse; Mathematics; Acceleration; Algorithm; Generalized inverse; Mathematical optimization; Computer science; Computational complexity theory; Applied mathematics","score_opus":0.03561027582205123,"score_gpt":0.3167459392857639,"score_spread":0.28113566346371266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129466305","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001182411,0.00012107592,0.99687105,0.000047899586,0.00006390545,0.000018986226,0.0000091684,0.00010060039,0.0015849168],"genre_scores_gemma":[0.068643406,0.0004447318,0.92513376,0.00011202788,0.00011597845,0.00014761783,0.00008192666,0.0001381551,0.005182363],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994381,0.00012228506,0.000030930183,0.0000772845,0.00029595173,0.0000353947],"domain_scores_gemma":[0.99960715,0.00009973863,0.000033370176,0.000055989298,0.00017891338,0.000024933444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005910278,0.0007665765,0.00077878067,0.00066289416,0.00049255666,0.0007619162,0.0009807616,0.00088853575,0.0032836897],"category_scores_gemma":[0.0016356393,0.00032594256,0.0008241872,0.0007238928,0.0006661564,0.0013315439,0.001101937,0.0012674025,0.0012769111],"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.00016166034,0.00009353461,0.00071204454,0.0006901847,0.00016439022,0.00038692597,0.00041762486,0.22719048,0.06959785,0.3368541,0.007957189,0.35577393],"study_design_scores_gemma":[0.000030082181,0.000079641344,0.000129274,0.000030085968,0.000020740807,0.00032443937,0.000030867363,0.9500133,0.0075621447,0.0275926,0.0141473,0.000039544164],"about_ca_topic_score_codex":0.0011477967,"about_ca_topic_score_gemma":0.0013806124,"teacher_disagreement_score":0.0032836897,"about_ca_system_score_codex":0.00036624548,"about_ca_system_score_gemma":0.0011314723,"threshold_uncertainty_score":0.010985017},"labels":[],"label_agreement":null},{"id":"W2129656082","doi":"10.1109/icassp.1988.196929","title":"An eigenvalue recursion for Hermitian Toeplitz matrices","year":2003,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Toeplitz matrix; Hermitian matrix; Eigenvalues and eigenvectors; Recursion (computer science); Levinson recursion; Generalization; Mathematics; Matrix (chemical analysis); Order (exchange); Applied mathematics; Pure mathematics; Algebra over a field; Algorithm; Combinatorics; Mathematical analysis; Physics","score_opus":0.015040133759275673,"score_gpt":0.2714055648166486,"score_spread":0.25636543105737297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129656082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010048308,0.00010191781,0.99625385,0.000053534528,0.00003073356,0.000030602823,0.000023104716,0.00021864459,0.0022826917],"genre_scores_gemma":[0.043604385,0.00040710653,0.947004,0.00011723248,0.00007029962,0.000196646,0.00015001913,0.00027375168,0.008176523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992686,0.00020711859,0.000046966445,0.00012537854,0.00027714367,0.00007474459],"domain_scores_gemma":[0.9988146,0.000554543,0.00008960814,0.0001271021,0.00036122964,0.000052832263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010149364,0.00092750817,0.0007171729,0.0012213012,0.0007815485,0.001231102,0.0010384362,0.00094657054,0.009448224],"category_scores_gemma":[0.004504538,0.00052311213,0.0008643944,0.0012524758,0.0010170426,0.0022159552,0.001428211,0.0016378867,0.0052760113],"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.00005230414,0.00008445756,0.0009642234,0.00020951346,0.000034009645,0.00036937636,0.00047749188,0.089170985,0.014150623,0.63001144,0.010715203,0.25376043],"study_design_scores_gemma":[0.000025791247,0.000054645807,0.00031582636,0.00005972679,0.000011876057,0.0004544518,0.00006889009,0.63816434,0.0053395675,0.3325648,0.022886937,0.000053101547],"about_ca_topic_score_codex":0.0020275484,"about_ca_topic_score_gemma":0.0045032706,"teacher_disagreement_score":0.009448224,"about_ca_system_score_codex":0.000774599,"about_ca_system_score_gemma":0.0012193338,"threshold_uncertainty_score":0.03160751},"labels":[],"label_agreement":null},{"id":"W2129690072","doi":"10.1016/j.laa.2012.05.012","title":"On the Hermitian solutions to a system of adjointable operator equations","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Shanghai Leading Academic Discipline Project; Ministry of Education of the People's Republic of China; Ferdowsi University of Mashhad; National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Hermitian matrix; Mathematics; Operator (biology); Hermitian adjoint; Self-adjoint operator; Hilbert space; Expression (computer science); Pure mathematics; Algebra over a field; Quasinormal operator; Finite-rank operator; Computer science; Banach space","score_opus":0.021797220135985302,"score_gpt":0.2477417720947566,"score_spread":0.22594455195877128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129690072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21862273,0.001097997,0.74293673,0.003136562,0.00059263967,0.0001149656,0.00019957335,0.00020979076,0.033089023],"genre_scores_gemma":[0.86779076,0.0013437431,0.09846393,0.0008873219,0.0006501872,0.00016792072,0.00035676555,0.000182514,0.030156843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988533,0.00052392087,0.000053286185,0.00013615673,0.00030567177,0.00012757702],"domain_scores_gemma":[0.9972941,0.0015632991,0.00032286017,0.00014731853,0.00039855557,0.00027386576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00221378,0.0012803802,0.001199793,0.0014044164,0.0012223469,0.00255792,0.0015665218,0.0022668627,0.007915013],"category_scores_gemma":[0.007849403,0.00067068025,0.0008338383,0.0013340139,0.0041564372,0.0039512143,0.0029802592,0.0028690596,0.0007572972],"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.000039080445,0.000047590594,0.00021282867,0.000054775028,0.00001930194,0.00011947981,0.0002392199,0.010716217,0.0009633742,0.98103976,0.0012555066,0.0052927453],"study_design_scores_gemma":[0.000025790921,0.000024929022,0.000088412075,0.000014922937,0.0000054823713,0.00005983761,0.00008234179,0.07977295,0.00026067713,0.9188942,0.0007513267,0.000019108367],"about_ca_topic_score_codex":0.0012399035,"about_ca_topic_score_gemma":0.0011913236,"teacher_disagreement_score":0.007915013,"about_ca_system_score_codex":0.00075934164,"about_ca_system_score_gemma":0.0012474848,"threshold_uncertainty_score":0.02647835},"labels":[],"label_agreement":null},{"id":"W2129876245","doi":"10.1016/j.jpaa.2005.02.011","title":"Orthogonal invariants of a matrix of order four and applications","year":2005,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Order (exchange); Matrix (chemical analysis); Algebra over a field; Pure mathematics; Hilbert–Poincaré series; Set (abstract data type); Homogeneous; Series (stratigraphy); Combinatorics; Computer science","score_opus":0.009652957099484634,"score_gpt":0.23838896440630064,"score_spread":0.228736007306816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129876245","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6859955,0.0018895952,0.23049401,0.0016664078,0.0009994829,0.000062842446,0.00025805214,0.00048675286,0.0781473],"genre_scores_gemma":[0.95072263,0.0008400757,0.028320074,0.00019166186,0.00064598804,0.000025152745,0.0001447736,0.00011682806,0.018992761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970585,0.000064309046,0.000018973167,0.000055910405,0.000092343456,0.000062592684],"domain_scores_gemma":[0.99877745,0.0004032551,0.00026826316,0.00014092756,0.00021555614,0.00019458689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005951007,0.0007531016,0.00059601996,0.00295426,0.0008547051,0.0014316794,0.00083102833,0.0006829691,0.0054751653],"category_scores_gemma":[0.0025457263,0.00029744502,0.00048916816,0.0019352916,0.0022623334,0.0019764267,0.0014542297,0.0014083962,0.00048608394],"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.000069007845,0.00004768955,0.0003329177,0.000028223667,0.000006137763,0.00010813193,0.00019674259,0.0021839733,0.0028955275,0.9789388,0.0012624608,0.013930293],"study_design_scores_gemma":[0.000017059352,0.000068002824,0.0004950514,0.000014854564,0.0000137976,0.00031868956,0.00016374848,0.03037186,0.0031344788,0.95947134,0.005888004,0.000043025266],"about_ca_topic_score_codex":0.0006908798,"about_ca_topic_score_gemma":0.0006305781,"teacher_disagreement_score":0.0054751653,"about_ca_system_score_codex":0.00061636796,"about_ca_system_score_gemma":0.0005098493,"threshold_uncertainty_score":0.018316269},"labels":[],"label_agreement":null},{"id":"W2129885352","doi":"10.1016/j.laa.2003.12.010","title":"Numerical solution of a quadratic eigenvalue problem","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":33,"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 Regina","funders":"","keywords":"Eigenvalues and eigenvectors; Positive-definite matrix; Mathematics; Quadratic equation; Symmetry (geometry); The Imaginary; Matrix (chemical analysis); Mathematical analysis; Pure mathematics; Mathematical physics; Physics; Quantum mechanics; Chemistry; Geometry","score_opus":0.011074556011935261,"score_gpt":0.24554394998233597,"score_spread":0.2344693939704007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129885352","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15323457,0.00032149057,0.8209258,0.0015880356,0.00037842215,0.000079707796,0.00009450733,0.00050613104,0.022871338],"genre_scores_gemma":[0.7976011,0.00013750797,0.19231187,0.00017771876,0.00010137859,0.00012623689,0.00010381389,0.00016299634,0.009277395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996213,0.00013955064,0.00001703788,0.000047355396,0.00013413992,0.000040543557],"domain_scores_gemma":[0.9982723,0.0010890942,0.00012357441,0.000119389144,0.00029601387,0.00009976515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010025898,0.00041046608,0.00081273477,0.00048888824,0.00071541104,0.000979312,0.00080404757,0.001595271,0.004700422],"category_scores_gemma":[0.0053642094,0.00035500852,0.00028019067,0.0006366431,0.0011276321,0.0013037688,0.0014072406,0.0010395785,0.00044646856],"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.00030310114,0.00019278198,0.00086220866,0.00022805044,0.000045302993,0.00018992336,0.0002652376,0.86248875,0.007751793,0.090902925,0.0032725355,0.03349747],"study_design_scores_gemma":[0.00002153974,0.000020882626,0.00007675431,0.0000062911313,0.0000024461913,0.000016021164,0.000026389758,0.9889298,0.0006454399,0.009755011,0.00049337297,0.000006139077],"about_ca_topic_score_codex":0.0027082828,"about_ca_topic_score_gemma":0.0023329319,"teacher_disagreement_score":0.004700422,"about_ca_system_score_codex":0.00040552215,"about_ca_system_score_gemma":0.0009776242,"threshold_uncertainty_score":0.01572448},"labels":[],"label_agreement":null},{"id":"W2130218118","doi":"10.1109/iscas.1990.112472","title":"Realization of extensions to Faddeev algorithm on array of SIMD processors","year":2002,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Realization (probability); Computer science; Computation; Architecture; SIMD; Parallel computing; Matrix (chemical analysis); Algorithm; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.019388149802403165,"score_gpt":0.24246875429683706,"score_spread":0.2230806044944339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130218118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09507572,0.0006042988,0.8742059,0.00038522648,0.00027176854,0.00008657893,0.00021126354,0.0030947046,0.026064513],"genre_scores_gemma":[0.47476536,0.0003672793,0.514904,0.00019389897,0.00006867157,0.000159568,0.00056446606,0.00009246429,0.008884418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998043,0.000045923116,0.000017062175,0.000030260377,0.00006294132,0.000039564537],"domain_scores_gemma":[0.9998005,0.000027684344,0.000013587852,0.000052793403,0.000086546796,0.000018872117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025409608,0.00037312275,0.00024378521,0.0004460604,0.0004310236,0.0005869704,0.0008583672,0.00032261238,0.003467514],"category_scores_gemma":[0.00042969012,0.00016934922,0.00028900956,0.00042536523,0.00029113903,0.00079584634,0.0005566656,0.00043196513,0.0008682366],"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.00091835257,0.00021255131,0.0036149905,0.00033847772,0.000098599434,0.00074305735,0.0004384841,0.10655439,0.10861093,0.19411324,0.019074911,0.5652821],"study_design_scores_gemma":[0.00020258843,0.00066461926,0.0012546229,0.0000902426,0.000058448215,0.00086994824,0.00016322787,0.689502,0.13467179,0.06892337,0.103523,0.00007613334],"about_ca_topic_score_codex":0.0009799312,"about_ca_topic_score_gemma":0.0015322127,"teacher_disagreement_score":0.003467514,"about_ca_system_score_codex":0.00044217947,"about_ca_system_score_gemma":0.00060535927,"threshold_uncertainty_score":0.011599958},"labels":[],"label_agreement":null},{"id":"W2130417105","doi":"10.1007/pl00021726","title":"Optimal Stability and Eigenvalue Multiplicity","year":2001,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Multiplicity (mathematics); Eigenvalues and eigenvectors; Stability (learning theory); Numerical analysis; Applied mathematics; Mathematical analysis; Physics; Computer science","score_opus":0.031083607720059372,"score_gpt":0.2848674620295977,"score_spread":0.2537838543095383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130417105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23534065,0.002755791,0.64397156,0.006388979,0.00074720767,0.00009084528,0.00028234805,0.00056865276,0.10985394],"genre_scores_gemma":[0.960607,0.0007767814,0.020553527,0.00036330693,0.0007494371,0.00014139611,0.0001121139,0.00019505128,0.016501341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982077,0.0006159842,0.00007327165,0.0004248131,0.00043690816,0.00024128499],"domain_scores_gemma":[0.99077237,0.0056742425,0.000832379,0.00089049165,0.0011075201,0.000722909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020321887,0.00097073504,0.0016899671,0.0018710358,0.0017736371,0.0038220445,0.0014642975,0.0016315294,0.010887041],"category_scores_gemma":[0.018090596,0.0007376373,0.0007629443,0.0013302857,0.003992462,0.0062950356,0.0038604122,0.0029034382,0.0014402638],"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.00007875857,0.000026521851,0.00021912312,0.000036629175,0.000013004616,0.00001901239,0.00008121408,0.010847221,0.0009321414,0.97851884,0.0016994071,0.0075281966],"study_design_scores_gemma":[0.000009753236,0.000010891692,0.00010824245,0.000006387745,0.000004074588,0.000019058993,0.000025292975,0.02646263,0.0004084283,0.9723913,0.0005445869,0.000009383362],"about_ca_topic_score_codex":0.00037362712,"about_ca_topic_score_gemma":0.00032751902,"teacher_disagreement_score":0.010887041,"about_ca_system_score_codex":0.0014634772,"about_ca_system_score_gemma":0.00095346273,"threshold_uncertainty_score":0.036420763},"labels":[],"label_agreement":null},{"id":"W2131628385","doi":"10.1016/j.jedc.2010.10.006","title":"Second-order approximation of dynamic models without the use of tensors","year":2010,"lang":"en","type":"article","venue":"Journal of Economic Dynamics and Control","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hessian matrix; Fortran; Code (set theory); Representation (politics); Order (exchange); MATLAB; Computer science; Matrix representation; Applied mathematics; USable; Matrix (chemical analysis); Key (lock); Source code; Algorithm; Algebra over a field; Theoretical computer science; Programming language; Mathematical optimization; Mathematics; Pure mathematics; Physics","score_opus":0.01006795405941648,"score_gpt":0.21442715348042624,"score_spread":0.20435919942100975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131628385","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010289975,0.0003368402,0.98525846,0.00020104864,0.00012379175,0.000016693217,0.000074077434,0.00022069633,0.0034783029],"genre_scores_gemma":[0.67087543,0.0015831285,0.29641363,0.00025964974,0.00028615387,0.00019749589,0.00059026136,0.00045247521,0.029341815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966323,0.00013951509,0.000020255806,0.000040884424,0.000098163655,0.000037879043],"domain_scores_gemma":[0.9985734,0.0007063432,0.00013223093,0.00029514206,0.00019366526,0.000099130884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009800278,0.0011335775,0.0012967649,0.0006450643,0.00053531217,0.0014662762,0.0010457898,0.0012095171,0.002920827],"category_scores_gemma":[0.0042162426,0.00062970666,0.0009128842,0.0006301305,0.000891924,0.0021104007,0.001214911,0.0021438112,0.0009521849],"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.000104107574,0.00009083265,0.0004105826,0.00015194209,0.0000631971,0.00013195847,0.00013973528,0.68095183,0.0034727245,0.2839612,0.0026178511,0.027903993],"study_design_scores_gemma":[0.000002168969,0.000006379321,0.000021169322,0.000002710022,0.000002692836,0.000010133806,0.0000039307183,0.9854445,0.00019278226,0.013732062,0.0005777219,0.000003730729],"about_ca_topic_score_codex":0.010196534,"about_ca_topic_score_gemma":0.008544916,"teacher_disagreement_score":0.010196534,"about_ca_system_score_codex":0.0008956075,"about_ca_system_score_gemma":0.0012445723,"threshold_uncertainty_score":0.0202744},"labels":[],"label_agreement":null},{"id":"W2131677444","doi":"10.1017/s0004972700035784","title":"ABS-type methods for solving full row rank linear systems using a new rank two update","year":2004,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"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":"Sharif University of Technology; York University","keywords":"Mathematics; Rank (graph theory); Dimension (graph theory); Type (biology); Matrix (chemical analysis); System of linear equations; Linear equation; Class (philosophy); Applied mathematics; Augmented matrix; Linear system; Combinatorics; Mathematical analysis; Square matrix; Symmetric matrix; Eigenvalues and eigenvectors","score_opus":0.04777071579681103,"score_gpt":0.34295661830033425,"score_spread":0.2951859025035232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131677444","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040603736,0.000074200114,0.9933242,0.000084381136,0.000056273246,0.000035802248,0.000029230616,0.000416691,0.0019187668],"genre_scores_gemma":[0.08344359,0.00014383366,0.9067464,0.00015675418,0.00014327127,0.00021276301,0.0001390972,0.00024642842,0.008767925],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991277,0.00029898272,0.000052239193,0.00007765148,0.0003907771,0.000052663523],"domain_scores_gemma":[0.99828416,0.0007754032,0.00013019306,0.00029863286,0.0004336993,0.00007792444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010745074,0.001037268,0.0005940362,0.00059157755,0.0005001361,0.00080149755,0.00094085553,0.00071891135,0.0048473873],"category_scores_gemma":[0.0032793419,0.00037890114,0.0007077708,0.00043337693,0.0010133374,0.0012302018,0.0013481677,0.0022402862,0.0019612396],"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.0004263205,0.0002535749,0.0014839914,0.00039307776,0.000105391475,0.00025921,0.00055110495,0.20084248,0.031663824,0.23284993,0.016394299,0.5147768],"study_design_scores_gemma":[0.000053145504,0.00012956132,0.00019227451,0.000016451215,0.000012982014,0.00015064592,0.000032997817,0.93008935,0.008317078,0.048158415,0.012814476,0.000032530163],"about_ca_topic_score_codex":0.001970813,"about_ca_topic_score_gemma":0.0035776307,"teacher_disagreement_score":0.0048473873,"about_ca_system_score_codex":0.00032512136,"about_ca_system_score_gemma":0.00087447726,"threshold_uncertainty_score":0.0162161},"labels":[],"label_agreement":null},{"id":"W2132750688","doi":"10.13001/1081-3810.1114","title":"On nonnegative matrices with given row and column sums","year":2003,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"McGill University","funders":"","keywords":"Mathematics; Column (typography); Combinatorics; Row and column spaces; Pure mathematics; Row; Geometry","score_opus":0.004411372928628116,"score_gpt":0.21326746395661283,"score_spread":0.20885609102798472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132750688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057051945,0.001988127,0.89518255,0.0010206265,0.000447464,0.00009119777,0.0007687738,0.00044575945,0.043003567],"genre_scores_gemma":[0.49729285,0.007853534,0.43101293,0.0017838477,0.0012807259,0.0006386885,0.0034265441,0.00081372884,0.055897217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798286,0.00065923546,0.00014722413,0.00036583224,0.0005532593,0.00029154663],"domain_scores_gemma":[0.9946741,0.0027754458,0.0006664713,0.00053103204,0.0009176523,0.00043527517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001563583,0.0022555238,0.0009165429,0.001960715,0.0010534694,0.0027430803,0.001112416,0.0012271006,0.007911213],"category_scores_gemma":[0.010776085,0.0006747115,0.0007119763,0.0024078737,0.0027735296,0.0050740587,0.0024818503,0.0017343615,0.0035463131],"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.00020851596,0.000057369783,0.0005642213,0.00032335214,0.000021707667,0.00045704845,0.0002773062,0.017871754,0.00716623,0.8978354,0.010385459,0.06483167],"study_design_scores_gemma":[0.00002185919,0.000068501206,0.00036923427,0.000093686955,0.000010547093,0.00030707667,0.00006781436,0.047055904,0.0017528636,0.9420824,0.008125223,0.00004488844],"about_ca_topic_score_codex":0.001350933,"about_ca_topic_score_gemma":0.002477153,"teacher_disagreement_score":0.007911213,"about_ca_system_score_codex":0.0007538268,"about_ca_system_score_gemma":0.00075071555,"threshold_uncertainty_score":0.026465595},"labels":[],"label_agreement":null},{"id":"W2133538828","doi":"10.1109/mwscas.2007.4488718","title":"Laplace transform approach to analysis and synthesis of bessel type linear time-varying systems","year":2007,"lang":"en","type":"article","venue":"Conference proceedings","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Laplace transform; Laplace transform applied to differential equations; Two-sided Laplace transform; Bessel function; Inverse Laplace transform; LTI system theory; Linear system; Mathematics; Mellin transform; Mathematical analysis; Post's inversion formula; Ordinary differential equation; Linear differential equation; Laplace–Stieltjes transform; Applied mathematics; Green's function for the three-variable Laplace equation; Differential equation; Fractional Fourier transform; Fourier transform; Fourier analysis","score_opus":0.017218330498154424,"score_gpt":0.2414801443284209,"score_spread":0.2242618138302665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133538828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012478714,0.000279941,0.99559,0.000053122025,0.000035308556,0.000007592239,0.000011088323,0.000076793935,0.002698379],"genre_scores_gemma":[0.41085982,0.0049621644,0.56131834,0.00035030805,0.00048713578,0.00025265297,0.0002038114,0.00016055656,0.021405214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998411,0.00004053917,0.00001055764,0.00002455399,0.000074184616,0.000009087672],"domain_scores_gemma":[0.9998247,0.00009599074,0.00001541841,0.00001557187,0.000042425603,0.0000060072425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003140524,0.00047389045,0.0003586696,0.00034530094,0.00018966352,0.0007172778,0.00038468777,0.0005592827,0.0029154618],"category_scores_gemma":[0.0006929418,0.00020052312,0.00044549518,0.00047394264,0.00044470627,0.00057326246,0.00037786172,0.00090020086,0.0007447912],"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.00007987019,0.00007213791,0.00026440405,0.00036615515,0.000052291605,0.00027150448,0.00034138723,0.2904055,0.08946833,0.37349433,0.002740774,0.24244337],"study_design_scores_gemma":[0.0000127928,0.00010294348,0.00010287635,0.000024800127,0.000014381685,0.00012605912,0.000027417436,0.9056419,0.010713881,0.07239421,0.010820481,0.000018310182],"about_ca_topic_score_codex":0.0004417782,"about_ca_topic_score_gemma":0.00041752408,"teacher_disagreement_score":0.0029154618,"about_ca_system_score_codex":0.00027537203,"about_ca_system_score_gemma":0.00031101113,"threshold_uncertainty_score":0.009753227},"labels":[],"label_agreement":null},{"id":"W2134676649","doi":"10.1080/00207160008804986","title":"A split-correct parallel algorithm for solving tridiagonal symmetric toeplitz systems","year":2000,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Tridiagonal matrix; Toeplitz matrix; Tridiagonal matrix algorithm; Mathematics; Diagonally dominant matrix; Diagonal; Linear system; Algorithm; Applied mathematics; Levinson recursion; System of linear equations; Algebra over a field; Mathematical analysis; Pure mathematics; Eigenvalues and eigenvectors; Geometry; Invertible matrix","score_opus":0.01633063061697472,"score_gpt":0.2645873229879092,"score_spread":0.2482566923709345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134676649","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006496354,0.000101013036,0.9908716,0.00009373128,0.00006571483,0.000057982958,0.000032670672,0.0009193817,0.0013614909],"genre_scores_gemma":[0.060721997,0.000099823315,0.93445486,0.00006722349,0.00003706473,0.0001565677,0.00015221951,0.00020683912,0.004103375],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944204,0.00008895376,0.000030033536,0.000073201096,0.00030627838,0.000059478713],"domain_scores_gemma":[0.9990729,0.00023125536,0.00005269937,0.00015671011,0.00044057705,0.000045942772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007363219,0.0009582776,0.000701669,0.0007599537,0.0009224759,0.0007410305,0.001112449,0.000988643,0.005617942],"category_scores_gemma":[0.0024570464,0.0005495007,0.00052634865,0.0010357931,0.00071706186,0.0010108433,0.0010387147,0.0014302214,0.0021532902],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005328158,0.00017830114,0.0010285643,0.00024241534,0.00010669078,0.00036806735,0.0003335577,0.24308279,0.033349738,0.02872214,0.010692082,0.6813627],"study_design_scores_gemma":[0.000095674885,0.00010078324,0.0001600866,0.000009947262,0.000017150796,0.00018425766,0.000042273867,0.9685579,0.014332619,0.009503859,0.0069738356,0.000021726299],"about_ca_topic_score_codex":0.005038107,"about_ca_topic_score_gemma":0.0068939105,"teacher_disagreement_score":0.005617942,"about_ca_system_score_codex":0.0004516814,"about_ca_system_score_gemma":0.0017114222,"threshold_uncertainty_score":0.018793881},"labels":[],"label_agreement":null},{"id":"W2137074890","doi":"10.1109/icppw.2000.869116","title":"Data distribution and communication schemes for IQMR method on massively distributed memory computers","year":2002,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"St. Francis Xavier University","funders":"","keywords":"Massively parallel; Computer science; Distributed memory; Lanczos resampling; Parallel computing; Block (permutation group theory); Computation; Algorithm; Time complexity; Matrix (chemical analysis); Shared memory; Mathematics; Eigenvalues and eigenvectors","score_opus":0.05732449564394215,"score_gpt":0.3056527401806144,"score_spread":0.24832824453667224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137074890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02976445,0.00016195726,0.9676124,0.00018046543,0.00002695457,0.00004816192,0.000023537204,0.00037779173,0.0018043247],"genre_scores_gemma":[0.39025888,0.00026216314,0.60585743,0.000059520968,0.000065525164,0.00025413153,0.00010192209,0.00015123216,0.0029892086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943167,0.00022814749,0.00003059078,0.000067589455,0.00019011421,0.000051759507],"domain_scores_gemma":[0.9986249,0.00063882145,0.00014522063,0.00030492764,0.00024007815,0.00004604619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009568608,0.00033438503,0.00047158662,0.0003256481,0.00052023254,0.00056427444,0.0010400668,0.00043625745,0.0015784935],"category_scores_gemma":[0.0034838298,0.00022309984,0.00029231774,0.00059157837,0.00069844036,0.0010772962,0.00082963303,0.00065272226,0.000457061],"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.00034151823,0.000116964584,0.0011915377,0.00021478639,0.000029227873,0.00025498535,0.0003800079,0.70661455,0.028812056,0.11078472,0.0027248338,0.14853477],"study_design_scores_gemma":[0.000029527582,0.000035358127,0.00008930523,0.0000036873223,0.0000042460492,0.000032845695,0.000015080595,0.9868132,0.0038587144,0.007863771,0.0012482924,0.000006003156],"about_ca_topic_score_codex":0.0014437641,"about_ca_topic_score_gemma":0.000917234,"teacher_disagreement_score":0.0015784935,"about_ca_system_score_codex":0.0005261437,"about_ca_system_score_gemma":0.0006606395,"threshold_uncertainty_score":0.0052805543},"labels":[],"label_agreement":null},{"id":"W2138320903","doi":"10.11575/prism/30586","title":"Bounding the Nullities of Random Block Hankel Matrices: An Alternative Approach","year":2005,"lang":"en","type":"article","venue":"PRISM (University of Calgary)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Bounding overwatch; Lanczos resampling; Block (permutation group theory); Rank (graph theory); Hankel matrix; Algebra over a field; Applied mathematics; Combinatorics; Pure mathematics; Computer science; Mathematical analysis","score_opus":0.012893260597847218,"score_gpt":0.2033071747816615,"score_spread":0.1904139141838143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138320903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017728731,0.00028654188,0.978009,0.00041687462,0.000045361772,0.00007213297,0.0002069511,0.0002441966,0.002990195],"genre_scores_gemma":[0.6843574,0.0018937429,0.30092767,0.0006714461,0.0005941358,0.00072756247,0.00089932495,0.0003629137,0.009565753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991277,0.0038032387,0.00036105188,0.0014393923,0.0024608562,0.00065845554],"domain_scores_gemma":[0.8752442,0.09790362,0.005484669,0.0149851395,0.005103253,0.001279147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01095922,0.001774214,0.0020104167,0.0026581339,0.0008189342,0.0032285554,0.0033177603,0.0019746772,0.007847739],"category_scores_gemma":[0.0816894,0.000967591,0.0011998016,0.0018789109,0.0048455405,0.008586866,0.0037004906,0.0033177054,0.0013087122],"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.0007939962,0.00023276945,0.004020281,0.00038784827,0.00024089581,0.00029900818,0.0003701474,0.27987164,0.012351307,0.6466772,0.0030243343,0.051730614],"study_design_scores_gemma":[0.000063600506,0.00016212297,0.00051475625,0.000048502057,0.000033910273,0.00019272862,0.00005886754,0.82975245,0.0062235254,0.161178,0.0017129629,0.00005863994],"about_ca_topic_score_codex":0.0010262409,"about_ca_topic_score_gemma":0.0008477366,"teacher_disagreement_score":0.01095922,"about_ca_system_score_codex":0.0013746985,"about_ca_system_score_gemma":0.0017856344,"threshold_uncertainty_score":0.057958603},"labels":[],"label_agreement":null},{"id":"W2138547815","doi":"10.1016/j.laa.2011.03.034","title":"Complex symmetric stabilizing solution of the matrix equation <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mrow><mml:mi>X</mml:mi><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mi>⊤</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:mi>Q</mml:mi></mml:mrow></mml:math>","year":2011,"lang":"lv","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":20,"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 Regina","funders":"","keywords":"Matrix (chemical analysis); Mathematics; Algorithm; Function (biology); Symmetric matrix; Eigenvalues and eigenvectors; Physics","score_opus":0.0270469653953384,"score_gpt":0.2474098819308612,"score_spread":0.22036291653552278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138547815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04520619,0.0005801999,0.84676176,0.002008545,0.00047883185,0.00009422851,0.00036635454,0.0004894643,0.104014546],"genre_scores_gemma":[0.81236327,0.0011475111,0.07432817,0.0005141574,0.00026175103,0.00022096453,0.00044148823,0.00036404326,0.11035856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977845,0.0000521872,0.000006621242,0.000042863423,0.000082305894,0.000037435948],"domain_scores_gemma":[0.9994462,0.00017791937,0.0001068193,0.00005152907,0.00017007132,0.000047384325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034162073,0.0008042878,0.00047838117,0.00047063528,0.00047497582,0.0013627646,0.00049188925,0.00083600066,0.02205096],"category_scores_gemma":[0.0020947612,0.00017782702,0.00037235094,0.00042835443,0.000919234,0.00094202295,0.00097261067,0.0009884349,0.0034966532],"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.00016864619,0.00007734185,0.00043709006,0.00021868169,0.000047449812,0.00028051235,0.00023455374,0.1505175,0.010086135,0.7659873,0.025434662,0.046510097],"study_design_scores_gemma":[0.000035310473,0.00009674096,0.0003064948,0.000056535748,0.000014940932,0.00014714646,0.00016039258,0.74268377,0.004085128,0.23931544,0.013059694,0.00003837418],"about_ca_topic_score_codex":0.0027042003,"about_ca_topic_score_gemma":0.0026750548,"teacher_disagreement_score":0.02205096,"about_ca_system_score_codex":0.0007472218,"about_ca_system_score_gemma":0.0013649722,"threshold_uncertainty_score":0.07376778},"labels":[],"label_agreement":null},{"id":"W2138844572","doi":"10.1109/tac.2005.852558","title":"Gradient based iterative algorithms for solving a class of matrix equations","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":497,"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":"Iterative method; Sylvester matrix; Matrix (chemical analysis); Mathematics; Algorithm; Convergence (economics); Rate of convergence; Matrix-free methods; Matrix splitting; Convergent matrix; Mathematical optimization; Applied mathematics; Local convergence; Computer science; Sparse matrix; State-transition matrix; Symmetric matrix; Mathematical analysis","score_opus":0.016006606474567444,"score_gpt":0.26895120167732917,"score_spread":0.25294459520276175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138844572","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013009588,0.00014616315,0.9970981,0.000048075908,0.000016884602,0.000026246427,0.000008741958,0.00009117812,0.0012636724],"genre_scores_gemma":[0.08796046,0.00060767145,0.90696156,0.00008535273,0.00006978801,0.00033829513,0.00008295407,0.00010399414,0.0037899578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995958,0.00012641725,0.000021789938,0.00006539604,0.000160339,0.000030222433],"domain_scores_gemma":[0.999331,0.00038103058,0.000056379595,0.00005032533,0.0001644152,0.00001697645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001063481,0.0010291287,0.0007297165,0.00068181247,0.0004161609,0.00065563415,0.0010675493,0.0011629659,0.002071427],"category_scores_gemma":[0.0031689042,0.00040547654,0.0006205613,0.00078659295,0.00078796403,0.0010548844,0.0007945055,0.0015069282,0.0008409262],"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.000043322714,0.000068169196,0.0005814975,0.0003074384,0.00007546701,0.00011150269,0.00022457908,0.6305235,0.0061637186,0.20741974,0.0027589723,0.15172207],"study_design_scores_gemma":[0.000009530819,0.000015598593,0.000047230697,0.000009757879,0.00000421992,0.000024501702,0.000008940696,0.976334,0.0008581502,0.020674847,0.0020071112,0.0000061224005],"about_ca_topic_score_codex":0.0026062154,"about_ca_topic_score_gemma":0.0026670725,"teacher_disagreement_score":0.0026062154,"about_ca_system_score_codex":0.00055741525,"about_ca_system_score_gemma":0.0010668489,"threshold_uncertainty_score":0.006929636},"labels":[],"label_agreement":null},{"id":"W2139136228","doi":"10.1016/s0024-3795(00)00026-4","title":"Spectrally arbitrary patterns","year":2000,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Sign (mathematics); Combinatorics; Monic polynomial; Conjecture; Tridiagonal matrix; Matrix (chemical analysis); Order (exchange); Nilpotent; Polynomial; Mathematical analysis; Physics; Eigenvalues and eigenvectors","score_opus":0.007600462144641165,"score_gpt":0.22754378759556315,"score_spread":0.219943325450922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139136228","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22280982,0.00086582685,0.36227295,0.003976957,0.0018677913,0.00012676198,0.0008356881,0.0013029939,0.40594122],"genre_scores_gemma":[0.81171894,0.00061373826,0.052844983,0.0017324258,0.0008150854,0.00016963345,0.0008389608,0.00065631914,0.13060996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992036,0.0001575786,0.00003970283,0.00022250159,0.00023096713,0.00014566233],"domain_scores_gemma":[0.9988397,0.00021803679,0.00011852839,0.00041107895,0.00026056744,0.00015224455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044402637,0.00057155045,0.0006737813,0.0013189336,0.0018336978,0.0024439227,0.0009218064,0.0012136018,0.023650797],"category_scores_gemma":[0.0033001506,0.00041005109,0.0005394634,0.0010657741,0.0021507447,0.004218864,0.0024234739,0.0018345811,0.005028266],"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.00003495829,0.000017896953,0.00014717065,0.000024726805,0.000004412368,0.000058147725,0.00009367367,0.0002446358,0.0018814626,0.98464257,0.0033170427,0.009533439],"study_design_scores_gemma":[0.0000075688235,0.000009971827,0.00016732932,0.000008802977,0.0000036308236,0.00023348317,0.00009534537,0.0025648575,0.0013239863,0.98684883,0.008726885,0.0000092839755],"about_ca_topic_score_codex":0.00028312925,"about_ca_topic_score_gemma":0.00036166262,"teacher_disagreement_score":0.023650797,"about_ca_system_score_codex":0.00045373532,"about_ca_system_score_gemma":0.00041375723,"threshold_uncertainty_score":0.0791198},"labels":[],"label_agreement":null},{"id":"W2139454542","doi":"10.1016/s0024-3795(99)00281-5","title":"Principal pivot transforms: properties and applications","year":2000,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":92,"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 Regina","funders":"","keywords":"Principal (computer security); Mathematics; Principal component analysis; Transformation (genetics); Matrix (chemical analysis); Transformation matrix; Algebra over a field; Algorithm; Mathematical optimization; Applied mathematics; Computer science; Pure mathematics; Statistics","score_opus":0.015927995212589533,"score_gpt":0.22774781200454852,"score_spread":0.211819816791959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139454542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09965061,0.0013518854,0.8758356,0.0004226272,0.00020236745,0.00004707583,0.0001607222,0.000610257,0.021718936],"genre_scores_gemma":[0.81070906,0.0026897541,0.16697773,0.00024187539,0.00077249313,0.00009830444,0.0004131803,0.000647901,0.017449765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914074,0.00020663242,0.00004076244,0.00020481726,0.00030211944,0.00010482383],"domain_scores_gemma":[0.9944818,0.002631627,0.0006491356,0.0011073595,0.000807545,0.000322481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014831419,0.00068126945,0.0008598476,0.0016548234,0.000976363,0.0030627367,0.0008716294,0.0009054668,0.0052684937],"category_scores_gemma":[0.010608299,0.00051211216,0.00057988276,0.0031647603,0.003449061,0.0042381505,0.0017718761,0.0019690383,0.0021694356],"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.00025373406,0.00008646189,0.0009087952,0.00007104413,0.000013592361,0.00016652876,0.0002523689,0.0043715024,0.007488201,0.91249204,0.002386954,0.07150875],"study_design_scores_gemma":[0.00004621833,0.00012862348,0.00051444286,0.000027780616,0.000025514719,0.00092062145,0.00016407807,0.07187493,0.01620209,0.90367365,0.006377306,0.000044786648],"about_ca_topic_score_codex":0.00034371787,"about_ca_topic_score_gemma":0.00035509656,"teacher_disagreement_score":0.0052684937,"about_ca_system_score_codex":0.0003419019,"about_ca_system_score_gemma":0.0007583982,"threshold_uncertainty_score":0.017624855},"labels":[],"label_agreement":null},{"id":"W2139898093","doi":"10.1007/s10910-010-9737-8","title":"The relationship between the eigenvalues and eigenvectors of a similarity matrix and its associated Carbó index matrix","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematical Chemistry","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Alfred P. Sloan Foundation","keywords":"Eigenvalues and eigenvectors; Mathematics; Matrix similarity; Matrix (chemical analysis); Generalized eigenvector; Eigendecomposition of a matrix; Block matrix; Diagonal matrix; Pure mathematics; Symmetric matrix; Defective matrix; Square matrix; Combinatorics; Diagonalizable matrix; Diagonal; Mathematical analysis; Quantum mechanics; Physics; Geometry; State-transition matrix","score_opus":0.021386281164349305,"score_gpt":0.2896631294743486,"score_spread":0.26827684830999926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139898093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41673404,0.00081442454,0.56894433,0.0007153828,0.000117977055,0.00009416551,0.000441711,0.00028385234,0.011854149],"genre_scores_gemma":[0.94497114,0.00034191075,0.05122641,0.000082962186,0.00010973088,0.0000738823,0.00022639422,0.000044311484,0.0029232518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990263,0.00020710115,0.000049722956,0.00031628646,0.0003368255,0.00006375682],"domain_scores_gemma":[0.9819932,0.01285694,0.0018334318,0.00063893135,0.0021418908,0.00053565553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011047265,0.0003673846,0.00042445934,0.001908374,0.00055728055,0.0016956176,0.0006453275,0.0008126387,0.0042903363],"category_scores_gemma":[0.0226433,0.00024943933,0.00020696226,0.0012693058,0.0018129521,0.0023240047,0.000817366,0.0008314815,0.0005564423],"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.00061823067,0.00032771466,0.034158617,0.00049682934,0.00019248867,0.0006156366,0.0013162992,0.06883536,0.061708946,0.6286613,0.004783165,0.19828545],"study_design_scores_gemma":[0.00006186541,0.00028391782,0.03922407,0.00007977969,0.000070677386,0.001605566,0.00053046853,0.4778684,0.008453972,0.46784568,0.0037290056,0.00024650767],"about_ca_topic_score_codex":0.00093733956,"about_ca_topic_score_gemma":0.00096135715,"teacher_disagreement_score":0.0042903363,"about_ca_system_score_codex":0.00035742798,"about_ca_system_score_gemma":0.0005282958,"threshold_uncertainty_score":0.01435262},"labels":[],"label_agreement":null},{"id":"W2140151266","doi":"10.1016/j.laa.2013.06.005","title":"Unital affine semigroups","year":2013,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada; University of Guelph","keywords":"Mathematics; Affine transformation; Semigroup; Affine combination; Affine hull; Affine coordinate system; Invertible matrix; Pure mathematics; Discrete mathematics; Bounded function; Element (criminal law); Special classes of semigroups; Affine group; Affine representation; Combinatorics; Affine space; Algebra over a field; Mathematical analysis","score_opus":0.007859412777873295,"score_gpt":0.22165249435463477,"score_spread":0.21379308157676147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140151266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29729384,0.0033459405,0.42062244,0.002156443,0.0011420184,0.00011904461,0.00083542196,0.0010785682,0.27340627],"genre_scores_gemma":[0.91206616,0.0008031813,0.024738599,0.0003435303,0.00065041555,0.00011692075,0.00041587785,0.00013733671,0.060728032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990275,0.00025311852,0.000067170346,0.00022564885,0.00028006127,0.0001464355],"domain_scores_gemma":[0.9985624,0.00052755116,0.00019773643,0.00017084974,0.00028691266,0.00025461076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008586408,0.00066070777,0.00058905885,0.0015018708,0.0015484485,0.0029303576,0.0008146302,0.0005135155,0.013105875],"category_scores_gemma":[0.002140791,0.00046278108,0.0006652409,0.0012219877,0.0022040126,0.0031198498,0.0019282849,0.0016220555,0.0020148694],"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.000026384703,0.000014024937,0.00007265166,0.000021255326,0.0000049927635,0.000051383493,0.00020360666,0.00024499837,0.0008284311,0.9937734,0.00081865705,0.0039402316],"study_design_scores_gemma":[0.000019275876,0.00003680629,0.00026164873,0.000010664131,0.000010354617,0.00018462684,0.00015745938,0.0040098457,0.0018478283,0.9830169,0.010425421,0.000019027157],"about_ca_topic_score_codex":0.00028689456,"about_ca_topic_score_gemma":0.00026545924,"teacher_disagreement_score":0.013105875,"about_ca_system_score_codex":0.00072879734,"about_ca_system_score_gemma":0.0003357476,"threshold_uncertainty_score":0.043843508},"labels":[],"label_agreement":null},{"id":"W2141654299","doi":"10.1002/nla.318","title":"Consistency adjustments for pairwise comparison matrices","year":2002,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Consistency (knowledge bases); Rank (graph theory); Pairwise comparison; Transitive relation; Matrix (chemical analysis); Applied mathematics; Low-rank approximation; Linear least squares; Least-squares function approximation; Mathematical optimization; Linear model; Combinatorics; Discrete mathematics; Statistics; Mathematical analysis","score_opus":0.0225620477831706,"score_gpt":0.26577950657403887,"score_spread":0.24321745879086826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141654299","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055645104,0.00013447905,0.99172455,0.0001505551,0.000075653115,0.00008397373,0.00005980415,0.00019924415,0.0020072435],"genre_scores_gemma":[0.22679774,0.00019263134,0.76817805,0.00025103817,0.00020270278,0.00046033063,0.00035493536,0.0004964715,0.0030661311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9491579,0.035504855,0.0015781609,0.0055931457,0.0074116224,0.0007542794],"domain_scores_gemma":[0.89377284,0.06525161,0.0072344933,0.02185134,0.011079467,0.0008101544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03394126,0.0010312585,0.0015289802,0.002278949,0.0014065224,0.002864432,0.0038718362,0.0015819768,0.0067850845],"category_scores_gemma":[0.18082675,0.001071979,0.0015292873,0.0021144887,0.0041347495,0.0041769845,0.004491518,0.0035720803,0.0018691239],"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.00049958273,0.00010233254,0.0024169984,0.00057261885,0.00037807712,0.00017687735,0.0005273888,0.1385725,0.008491914,0.5649142,0.0067289164,0.27661854],"study_design_scores_gemma":[0.00006596296,0.00026002916,0.0015878498,0.00014539759,0.00007695923,0.0003024404,0.00015407935,0.51072764,0.013271449,0.4605836,0.012739366,0.000085263964],"about_ca_topic_score_codex":0.0007257423,"about_ca_topic_score_gemma":0.00070551655,"teacher_disagreement_score":0.03394126,"about_ca_system_score_codex":0.0012359186,"about_ca_system_score_gemma":0.0016868792,"threshold_uncertainty_score":0.17950064},"labels":[],"label_agreement":null},{"id":"W2143369442","doi":"10.1109/ismvl.1997.601407","title":"On the synthesis of MVL functions using input and output phase assignments","year":2002,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Saskatchewan","funders":"King Fahd University of Petroleum and Minerals","keywords":"Matrix (chemical analysis); Complement (music); Matching (statistics); Mathematics; Realization (probability); Minification; Algorithm; Reduction (mathematics); Function (biology); Matrix decomposition; Mathematical optimization; Computer science; Eigenvalues and eigenvectors; Statistics","score_opus":0.04517110895367091,"score_gpt":0.25679899308871246,"score_spread":0.21162788413504155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143369442","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01082434,0.00013842732,0.9857546,0.000038939757,0.000017167604,0.000032414137,0.000020690633,0.0002641918,0.0029093057],"genre_scores_gemma":[0.2157651,0.0003761694,0.78118145,0.00007403994,0.00004759471,0.00011103258,0.00013687009,0.000079887715,0.0022277408],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995764,0.00016060799,0.00002550277,0.000058257243,0.00013515484,0.000044112432],"domain_scores_gemma":[0.9994604,0.0003013159,0.000066598215,0.000088773864,0.000073020885,0.000009887506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061808625,0.00069671986,0.0004044333,0.000508589,0.00033232378,0.0005056652,0.00050389726,0.00035750278,0.0023946646],"category_scores_gemma":[0.0015447299,0.00023521924,0.00037457576,0.0005913216,0.00052155077,0.0009776046,0.00042548918,0.0004687334,0.000764583],"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.000272732,0.00008747255,0.00032381096,0.00039285148,0.00004432593,0.00010086394,0.00019945041,0.17728636,0.10444258,0.09002522,0.0014625354,0.62536186],"study_design_scores_gemma":[0.000065017695,0.00040298572,0.00032858003,0.00006795191,0.000044746692,0.0003066628,0.000068671194,0.8363931,0.105759755,0.03716354,0.019360539,0.00003852432],"about_ca_topic_score_codex":0.00043702955,"about_ca_topic_score_gemma":0.00058942026,"teacher_disagreement_score":0.0023946646,"about_ca_system_score_codex":0.00036712186,"about_ca_system_score_gemma":0.00042461272,"threshold_uncertainty_score":0.0080109835},"labels":[],"label_agreement":null},{"id":"W2145297230","doi":"10.1016/j.laa.2010.06.047","title":"Hermitian quadratic matrix polynomials: Solvents and inverse problems","year":2010,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Hermitian matrix; Eigenvalues and eigenvectors; Matrix polynomial; Monic polynomial; Polynomial matrix; Characteristic polynomial; Inverse; Quadratic function; Matrix (chemical analysis); Quadratic equation; Pure mathematics; Polynomial; Combinatorics; Mathematical analysis","score_opus":0.010732376754954465,"score_gpt":0.25615877700083206,"score_spread":0.24542640024587759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145297230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05561941,0.005336609,0.8644707,0.0061893947,0.0013053701,0.00006738343,0.00031626597,0.00026796004,0.066426866],"genre_scores_gemma":[0.7054927,0.0073423623,0.18850455,0.0015099862,0.003667696,0.000120991775,0.0005688979,0.00045133548,0.092341505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898845,0.00035499007,0.000034823966,0.00021651965,0.0003213341,0.000083975996],"domain_scores_gemma":[0.99670094,0.0018440144,0.00035436676,0.0003784915,0.0004957532,0.0002264718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013834949,0.001071674,0.0008758552,0.0012290528,0.0010289777,0.0027586757,0.0013664047,0.0021231791,0.010937163],"category_scores_gemma":[0.008865437,0.00063082186,0.00059082784,0.0019019552,0.003890032,0.006156778,0.002756339,0.004179796,0.0021553955],"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.00003399042,0.00003596684,0.0001443002,0.000101973164,0.0000065831446,0.00008216333,0.00015050865,0.0039216345,0.0007271043,0.9646427,0.004519003,0.025634116],"study_design_scores_gemma":[0.000010738566,0.000014284284,0.00009044474,0.000015738267,0.000004083864,0.00016317981,0.00007111618,0.018899819,0.0005087485,0.97637635,0.0038303288,0.00001510401],"about_ca_topic_score_codex":0.0004968776,"about_ca_topic_score_gemma":0.0005109763,"teacher_disagreement_score":0.010937163,"about_ca_system_score_codex":0.0005595016,"about_ca_system_score_gemma":0.0007537269,"threshold_uncertainty_score":0.03658843},"labels":[],"label_agreement":null},{"id":"W2145370474","doi":"10.1016/s0024-3795(03)00580-9","title":"Low rank perturbations and the spectrum of a tridiagonal sign pattern","year":2003,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"University of Victoria","keywords":"Mathematics; Tridiagonal matrix; Sign (mathematics); Eigenvalues and eigenvectors; Combinatorics; Rank (graph theory); Diagonal; Algebraic number; Multiplicity (mathematics); Spectral radius; Conjecture; Spectrum (functional analysis); Mathematical analysis; Geometry; Physics","score_opus":0.007582839362240893,"score_gpt":0.21859291523208016,"score_spread":0.21101007586983928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145370474","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69368625,0.00043360263,0.27069366,0.0016071814,0.00027421155,0.000033146964,0.0001814144,0.000506552,0.0325841],"genre_scores_gemma":[0.97533244,0.0001781713,0.016902369,0.00020716286,0.00015254908,0.000023652796,0.00007931619,0.00009062426,0.007033639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956435,0.00013505065,0.000015321973,0.000066004926,0.00015883746,0.000060337938],"domain_scores_gemma":[0.998324,0.0006585783,0.000291338,0.00024178694,0.00024162167,0.00024271567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005321141,0.00045993683,0.00044782765,0.0013388308,0.00068914413,0.0015022927,0.0005617424,0.00082688534,0.005025893],"category_scores_gemma":[0.0044718175,0.00026962743,0.00019925664,0.0007159496,0.0019529336,0.0018616625,0.001071863,0.0011768742,0.0006613661],"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.00022201109,0.00006865453,0.0007282498,0.00003340579,0.000011311843,0.00035097857,0.00028512854,0.00961073,0.014379174,0.9511327,0.0023410502,0.020836607],"study_design_scores_gemma":[0.000015583839,0.000028195042,0.00036697384,0.000006656343,0.000002914863,0.00021133176,0.00009065823,0.05981222,0.0016502464,0.9368639,0.0009318812,0.00001963185],"about_ca_topic_score_codex":0.00032676302,"about_ca_topic_score_gemma":0.00029876575,"teacher_disagreement_score":0.005025893,"about_ca_system_score_codex":0.00031986067,"about_ca_system_score_gemma":0.00029783093,"threshold_uncertainty_score":0.016813278},"labels":[],"label_agreement":null},{"id":"W2146369775","doi":"10.1109/icc.2009.40","title":"A Note on the Performance of Sparse Matrix-vector Multiplication with Column Reordering","year":2009,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"University of Lethbridge","funders":"","keywords":"Row and column spaces; Sparse matrix; Row; Computer science; Column (typography); Multiplication (music); Parallel computing; Preprocessor; Binary number; Matrix multiplication; Matrix (chemical analysis); Algorithm; Reuse; Supercomputer; Theoretical computer science; Arithmetic; Mathematics; Artificial intelligence","score_opus":0.010728583985238375,"score_gpt":0.2337511688409588,"score_spread":0.22302258485572043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146369775","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17882538,0.0072121737,0.7797573,0.0025843792,0.0007667437,0.00010929895,0.00020104056,0.0084509,0.022092804],"genre_scores_gemma":[0.5206894,0.0020040679,0.4682056,0.00032586345,0.00031148005,0.00006704427,0.00048664954,0.0005491593,0.007360719],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869555,0.00044702922,0.00008249061,0.000112791626,0.0005217984,0.0001403155],"domain_scores_gemma":[0.9924063,0.0041805916,0.00028505767,0.0018971751,0.0011130018,0.000117829564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013894757,0.0008062226,0.0006623612,0.0007118962,0.00057432835,0.0009637562,0.0009280568,0.0005445895,0.0037924228],"category_scores_gemma":[0.009108475,0.00026130737,0.00027539174,0.0019247229,0.0006640716,0.0021949615,0.0006845666,0.0010780335,0.0014093147],"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.0016937681,0.00022202216,0.0029955122,0.0004866886,0.000092061135,0.00038963655,0.0002965414,0.0794891,0.12217636,0.034820378,0.019658603,0.7376793],"study_design_scores_gemma":[0.00015460057,0.001350613,0.0026367037,0.00008391782,0.00007709484,0.00096242403,0.00015435438,0.68352497,0.25388736,0.027525319,0.029546747,0.000095878844],"about_ca_topic_score_codex":0.002374625,"about_ca_topic_score_gemma":0.0029553685,"teacher_disagreement_score":0.0037924228,"about_ca_system_score_codex":0.00042766304,"about_ca_system_score_gemma":0.00073498423,"threshold_uncertainty_score":0.012686968},"labels":[],"label_agreement":null},{"id":"W2146745011","doi":"10.1007/s10915-004-4794-4","title":"Preconditioning for a Class of Spectral Differentiation Matrices","year":2005,"lang":"en","type":"article","venue":"Journal of Scientific Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Preconditioner; Mathematics; Conjugate gradient method; Generalized minimal residual method; Discretization; Applied mathematics; Nonlinear system; Conjugate residual method; Partial differential equation; Fast Fourier transform; Mathematical analysis; Linear system; Mathematical optimization; Algorithm; Gradient descent; Computer science","score_opus":0.013826874749613971,"score_gpt":0.2562712215791882,"score_spread":0.24244434682957422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146745011","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03809983,0.00026115173,0.9537166,0.00019888418,0.00013144503,0.00004486631,0.00006129684,0.00041318472,0.0070727225],"genre_scores_gemma":[0.61216897,0.0006863646,0.3729629,0.00026139573,0.00022239784,0.00013292335,0.00028452658,0.00032030602,0.012960137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996748,0.00008556046,0.00001590553,0.00004787127,0.00012866435,0.000047242997],"domain_scores_gemma":[0.9988617,0.0004251441,0.00013609555,0.00019923945,0.00024525204,0.00013261885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054219813,0.00065027527,0.0004196441,0.0004185766,0.00044761974,0.00067091454,0.0004916759,0.00046634235,0.0044071623],"category_scores_gemma":[0.0033238414,0.00022071452,0.00026684196,0.0005411106,0.00073272473,0.0008366626,0.00075896294,0.0008956681,0.00087435317],"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.0005311141,0.00020432734,0.00084640045,0.00026984393,0.000038353322,0.00029191904,0.00027783852,0.12667146,0.05401964,0.56532687,0.010644237,0.24087794],"study_design_scores_gemma":[0.00007350945,0.00015469099,0.0003396314,0.000025624684,0.000014395725,0.00023357198,0.000051977877,0.73786473,0.010795127,0.24252915,0.00789469,0.00002286018],"about_ca_topic_score_codex":0.00068255235,"about_ca_topic_score_gemma":0.0013332347,"teacher_disagreement_score":0.0044071623,"about_ca_system_score_codex":0.0002400473,"about_ca_system_score_gemma":0.0006155191,"threshold_uncertainty_score":0.014743447},"labels":[],"label_agreement":null},{"id":"W2147228817","doi":"10.1016/s0024-3795(02)00260-4","title":"Two numerical methods for optimizing matrix stability","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Lipschitz continuity; Matrix (chemical analysis); Function (biology); Matrix function; Exponential stability; Dynamical systems theory; Mathematical analysis; Pure mathematics; Combinatorics; Applied mathematics; Symmetric matrix; Physics","score_opus":0.036269343226081635,"score_gpt":0.3461622929148682,"score_spread":0.30989294968878656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147228817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002390123,0.00021549739,0.99526525,0.0001662377,0.00013592158,0.00003117699,0.000016072278,0.00014699501,0.0016328255],"genre_scores_gemma":[0.11791677,0.00037165324,0.8722101,0.00018864365,0.00025510075,0.0003130731,0.000072218114,0.00033824652,0.008334131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880934,0.0004321059,0.000060779734,0.00013540835,0.00050071743,0.000061701554],"domain_scores_gemma":[0.99692494,0.0014961511,0.00027172331,0.0004112505,0.00073620206,0.00015974202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002324517,0.0011012134,0.0010533264,0.0012293597,0.00080628874,0.0012532318,0.0014050938,0.00192504,0.003853943],"category_scores_gemma":[0.0097683845,0.0005001673,0.000776536,0.0010907442,0.0014938107,0.0018344538,0.0019035283,0.0018064842,0.0007860332],"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.00028094603,0.00023957627,0.0006709986,0.00033002158,0.00008777461,0.000058751375,0.00023274025,0.44299012,0.012866693,0.20910633,0.0047477745,0.32838827],"study_design_scores_gemma":[0.000031698706,0.000055529756,0.00012254265,0.000015563186,0.000012776803,0.000025797102,0.000011559711,0.9733387,0.003071524,0.020292982,0.0029996783,0.000021592594],"about_ca_topic_score_codex":0.0016263445,"about_ca_topic_score_gemma":0.0025253405,"teacher_disagreement_score":0.003853943,"about_ca_system_score_codex":0.00091543316,"about_ca_system_score_gemma":0.0012364526,"threshold_uncertainty_score":0.012892723},"labels":[],"label_agreement":null},{"id":"W2147371417","doi":"10.1112/blms/33.1.77","title":"Spectral Characterization of Algebraic Elements","year":2001,"lang":"en","type":"article","venue":"Bulletin of the London Mathematical Society","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":"Université Laval","funders":"","keywords":"Mathematics; Converse; Characterization (materials science); Spectrum (functional analysis); Banach algebra; Hausdorff space; Algebraic number; Pure mathematics; Element (criminal law); Algebra over a field; Banach space; Mathematical analysis; Geometry","score_opus":0.009368162394182034,"score_gpt":0.22103602035299988,"score_spread":0.21166785795881785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147371417","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71869326,0.0007203843,0.23970574,0.0006394542,0.00008593365,0.000033671815,0.00018955386,0.00020770545,0.039724305],"genre_scores_gemma":[0.9853978,0.00022188664,0.010561958,0.00006836412,0.00008779299,0.000018224615,0.00010199269,0.000026457197,0.003515593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995142,0.000086353604,0.00003406326,0.00013084683,0.00016856597,0.00006593224],"domain_scores_gemma":[0.99799466,0.0006143396,0.0003404073,0.00016367505,0.0004959344,0.00039095036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047375154,0.00029960065,0.0002932495,0.0018521864,0.0006209645,0.0014137358,0.00046409533,0.0004272806,0.0032803707],"category_scores_gemma":[0.002993394,0.00016545529,0.00025415033,0.00068439374,0.0020027775,0.0025693474,0.0016886187,0.00087488355,0.00050562836],"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.00005433094,0.000026780768,0.0011536075,0.000053973876,0.000010603779,0.00011001916,0.00055858085,0.0034758176,0.012105572,0.97139287,0.0003471645,0.010710759],"study_design_scores_gemma":[0.000015830148,0.00010963346,0.0015532229,0.0000475497,0.000011289489,0.00049780024,0.00052900636,0.038497284,0.008851762,0.9426639,0.007192904,0.000029653886],"about_ca_topic_score_codex":0.0002537939,"about_ca_topic_score_gemma":0.00016498455,"teacher_disagreement_score":0.0032803707,"about_ca_system_score_codex":0.0004775112,"about_ca_system_score_gemma":0.00025071448,"threshold_uncertainty_score":0.01097393},"labels":[],"label_agreement":null},{"id":"W2148124198","doi":"10.1016/j.spl.2006.01.005","title":"On equality and proportionality of ordinary least squares, weighted least squares and best linear unbiased estimators in the general linear model","year":2006,"lang":"en","type":"article","venue":"Statistics & Probability Letters","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Ordinary least squares; Best linear unbiased prediction; Statistics; Estimator; Least-squares function approximation; Applied mathematics; Generalized least squares; Non-linear least squares; Linear least squares; Iteratively reweighted least squares; Rank (graph theory); Combinatorics","score_opus":0.02066054827804798,"score_gpt":0.27433063826170456,"score_spread":0.2536700899836566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148124198","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011878613,0.0030549266,0.9782104,0.0016640179,0.0002612616,0.000041197913,0.000083718325,0.00011777297,0.0046881116],"genre_scores_gemma":[0.5677797,0.010184481,0.39148176,0.0033295827,0.0028642286,0.0006147774,0.00075056776,0.0013206045,0.021674354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96851367,0.019296685,0.0015726426,0.0043455446,0.0050291577,0.0012423281],"domain_scores_gemma":[0.759728,0.21625751,0.0055009867,0.008101604,0.009147879,0.001263992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.05146228,0.0022334622,0.0032619794,0.0032272418,0.0017093216,0.0047620223,0.0061993618,0.0043430105,0.0038956979],"category_scores_gemma":[0.27522022,0.002362318,0.0020728093,0.0036385409,0.013544573,0.021536982,0.010798897,0.007211785,0.000832624],"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.00021445374,0.000051413852,0.0022054678,0.00036511204,0.0001646967,0.00018618316,0.00058136566,0.052585397,0.000824266,0.88720214,0.002128284,0.05349125],"study_design_scores_gemma":[0.000036203048,0.00005339428,0.000758123,0.00008053497,0.00006202007,0.00018660568,0.0000738459,0.20377107,0.0007088608,0.79191417,0.0022960512,0.00005907869],"about_ca_topic_score_codex":0.0034364199,"about_ca_topic_score_gemma":0.0019516634,"teacher_disagreement_score":0.05146228,"about_ca_system_score_codex":0.0022175615,"about_ca_system_score_gemma":0.002569494,"threshold_uncertainty_score":0.27216178},"labels":[],"label_agreement":null},{"id":"W2148910845","doi":"10.1016/j.laa.2004.05.008","title":"Sums of totally positive matrices","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Algebra over a field; Pure mathematics","score_opus":0.00684015904075573,"score_gpt":0.23630691857829747,"score_spread":0.22946675953754175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148910845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19799921,0.0037179394,0.6100687,0.0013314186,0.0017628215,0.00009186214,0.00064617774,0.00075901346,0.18362285],"genre_scores_gemma":[0.8133243,0.0023435778,0.08306649,0.0007501176,0.002480411,0.00022168425,0.0009907456,0.00053854554,0.09628418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983163,0.0004372496,0.00009781828,0.00029952612,0.0006770023,0.00017206703],"domain_scores_gemma":[0.9971042,0.0012724781,0.00036819198,0.00023602723,0.00061259174,0.0004064502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075487775,0.0013802955,0.00096809724,0.0023321386,0.0015948678,0.0039445786,0.0012224172,0.00083838037,0.009843705],"category_scores_gemma":[0.004606167,0.00070020277,0.0008369755,0.0021730794,0.002201181,0.0039290534,0.0027718553,0.001929921,0.0017543589],"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.00006842504,0.000032527798,0.00019629703,0.000121253375,0.000029180817,0.00010343358,0.0001759223,0.0017830172,0.0030058473,0.9701937,0.003938937,0.020351496],"study_design_scores_gemma":[0.000005918241,0.000019814754,0.00017135855,0.00001703583,0.000013345334,0.0002715956,0.000045725454,0.0065164394,0.0015399461,0.9868753,0.004505503,0.000018003724],"about_ca_topic_score_codex":0.00015253996,"about_ca_topic_score_gemma":0.0003078722,"teacher_disagreement_score":0.009843705,"about_ca_system_score_codex":0.0004387638,"about_ca_system_score_gemma":0.00048474973,"threshold_uncertainty_score":0.032930493},"labels":[],"label_agreement":null},{"id":"W2149510406","doi":"10.1002/nme.2894","title":"Iterative solvers for 3D linear and nonlinear elasticity problems: Displacement and mixed formulations","year":2010,"lang":"en","type":"article","venue":"International Journal for Numerical Methods in Engineering","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Preconditioner; Discretization; Finite element method; Linear elasticity; Krylov subspace; Mathematics; Iterative method; Applied mathematics; Elasticity (physics); Linear system; Nonlinear system; Quadratic equation; Mathematical optimization; Mathematical analysis; Geometry; Structural engineering","score_opus":0.019702344914352587,"score_gpt":0.35972755424774583,"score_spread":0.34002520933339325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149510406","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013200152,0.00019490045,0.9829829,0.00013971786,0.000040424253,0.000038010723,0.000035648227,0.0002563035,0.0031119413],"genre_scores_gemma":[0.16546153,0.00030945722,0.8280918,0.000106726395,0.00006547103,0.00018440545,0.000118001706,0.00015221613,0.0055104485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994777,0.00013853668,0.00003307085,0.000038599712,0.00028067525,0.000031362586],"domain_scores_gemma":[0.9992488,0.00032037828,0.000108568005,0.00009805102,0.00017830274,0.000045954017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006579276,0.00058164104,0.000572867,0.00033148177,0.0003233517,0.0008113988,0.0010654184,0.001008382,0.0026949982],"category_scores_gemma":[0.0016023978,0.00033269307,0.00059142784,0.00049989275,0.00078136416,0.0010593276,0.0017771603,0.0011213318,0.00071618694],"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.00010850357,0.0001237008,0.0010230506,0.00036535785,0.000085090825,0.00024370191,0.00033282524,0.6727678,0.06352163,0.13254125,0.003032869,0.12585422],"study_design_scores_gemma":[0.00001079173,0.000020852092,0.000060965227,0.0000059261224,0.0000037989917,0.00004588732,0.000012742242,0.9893182,0.0038220515,0.004805773,0.0018862388,0.0000068472364],"about_ca_topic_score_codex":0.00094046874,"about_ca_topic_score_gemma":0.0013561506,"teacher_disagreement_score":0.0026949982,"about_ca_system_score_codex":0.000296559,"about_ca_system_score_gemma":0.00082937547,"threshold_uncertainty_score":0.009015679},"labels":[],"label_agreement":null},{"id":"W2149623001","doi":"10.1016/s0024-3795(01)00472-4","title":"Efficient matrix preconditioners for black box linear algebra","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Preconditioner; Linear algebra; Algebra over a field; Mathematics; Toeplitz matrix; Numerical linear algebra; Computation; Matrix (chemical analysis); Algebraic number; Linear system; Pure mathematics; Algorithm; Mathematical analysis; Geometry","score_opus":0.015301756644446237,"score_gpt":0.2593083641973076,"score_spread":0.24400660755286133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149623001","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0083244145,0.00015439617,0.982685,0.00028924443,0.00017084557,0.00005582555,0.00014976683,0.0017827764,0.006387827],"genre_scores_gemma":[0.16733266,0.0003416124,0.80786604,0.00025393112,0.00024930006,0.00037797654,0.0005025718,0.0011628915,0.02191294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991302,0.00023066619,0.00003522773,0.00007713554,0.0004158633,0.00011084069],"domain_scores_gemma":[0.9987876,0.00048398305,0.000089388755,0.00033000574,0.00023445119,0.000074647935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009483795,0.00095223525,0.0012661435,0.00055329996,0.0009956544,0.0012266904,0.0013242591,0.001004723,0.016571078],"category_scores_gemma":[0.0036706564,0.00054580416,0.00054440496,0.0010845389,0.0009612317,0.00235414,0.0019578936,0.0026950585,0.0043677287],"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.0009993637,0.00024908048,0.0003506938,0.0003249632,0.00009709352,0.00015880742,0.00028904757,0.19948278,0.022163205,0.38450655,0.04054424,0.35083416],"study_design_scores_gemma":[0.0001454933,0.00006279612,0.00009709695,0.00002555283,0.000016217773,0.00003350308,0.00004128931,0.74286056,0.011083693,0.23060022,0.015010773,0.000022890998],"about_ca_topic_score_codex":0.0018426628,"about_ca_topic_score_gemma":0.0046849074,"teacher_disagreement_score":0.016571078,"about_ca_system_score_codex":0.0004917193,"about_ca_system_score_gemma":0.0012971411,"threshold_uncertainty_score":0.055435777},"labels":[],"label_agreement":null},{"id":"W2149658402","doi":"10.1090/s0002-9947-09-04771-0","title":"Multidimensional operator multipliers","year":2009,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":43,"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":"Engineering and Physical Sciences Research Council; Vetenskapsrådet; Queen's University; Chalmers Tekniska Högskola; Queen's University Belfast","keywords":"Mathematics; Operator (biology); Algebra over a field; Shift operator; Finite-rank operator; Compact operator; Pure mathematics; Banach space; Computer science; Extension (predicate logic)","score_opus":0.00895172130026881,"score_gpt":0.2480762069615946,"score_spread":0.2391244856613258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149658402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15388048,0.0027579833,0.6654581,0.001808384,0.0015568867,0.00033984007,0.00090400357,0.00048569337,0.17280862],"genre_scores_gemma":[0.6870582,0.0017097564,0.23847894,0.00093911716,0.0009998176,0.00051636697,0.00067806506,0.00038063838,0.06923916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990299,0.00022732616,0.00007579537,0.00019319968,0.00031225735,0.00016161645],"domain_scores_gemma":[0.99916244,0.00013685039,0.00016756167,0.00011654662,0.00027387895,0.0001427827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009471379,0.0011248266,0.000507503,0.002244827,0.0013539082,0.0023597965,0.0010361879,0.00091222255,0.016189113],"category_scores_gemma":[0.0019435864,0.0003511409,0.0010289939,0.0010882978,0.0016467716,0.004432157,0.0030762427,0.0018304818,0.0027407438],"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.000012602941,0.0000113058695,0.000102745485,0.000034077435,0.0000050256303,0.00005981603,0.000111403,0.0005424326,0.0016071302,0.99223185,0.0008513755,0.004430137],"study_design_scores_gemma":[0.000013904755,0.000059788294,0.00017953868,0.000042356605,0.000008262828,0.00032231212,0.00014289671,0.013014102,0.0031181432,0.956721,0.026342396,0.000035319565],"about_ca_topic_score_codex":0.00046366995,"about_ca_topic_score_gemma":0.0004441591,"teacher_disagreement_score":0.016189113,"about_ca_system_score_codex":0.0010998448,"about_ca_system_score_gemma":0.0008149379,"threshold_uncertainty_score":0.054158032},"labels":[],"label_agreement":null},{"id":"W2149899904","doi":"10.1109/cefc-06.2006.1633140","title":"Strategies for h-p Adaptive Finite Element Analysis for Electromagnetics in Large Scale Parallel Computing Environments: Theory and Practice","year":2006,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University","funders":"","keywords":"Supercomputer; Computer science; Expediting; Finite element method; Parallel computing; Convergence (economics); Computational science; Electromagnetics; Scale (ratio); Computation; Computational electromagnetics; Adaptive mesh refinement; Computer engineering; Stability (learning theory); Distributed computing; Algorithm; Machine learning; Electronic engineering; Systems engineering; Engineering","score_opus":0.010544762034171434,"score_gpt":0.2562795756208557,"score_spread":0.24573481358668425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149899904","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061886053,0.00007819728,0.99853754,0.00008595993,0.0000075083526,0.000028021865,0.0000038100156,0.000072061724,0.00056805246],"genre_scores_gemma":[0.03894657,0.0003754849,0.9591239,0.00008748734,0.00002904472,0.0003602426,0.000025703868,0.00010397308,0.00094757095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849224,0.0007336398,0.00007321584,0.00010182787,0.00055409106,0.000044971835],"domain_scores_gemma":[0.99617356,0.0025450068,0.00018834301,0.0005152098,0.00049381715,0.00008414164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036210883,0.0010076108,0.00086224824,0.0010356772,0.0010118112,0.001494404,0.0026580605,0.0017701329,0.0029002826],"category_scores_gemma":[0.010264784,0.0006790044,0.0006816413,0.0012016973,0.0023561541,0.002096526,0.0022387933,0.0021588823,0.0015472053],"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.000067472516,0.00016489853,0.0011524577,0.00039595884,0.00007544099,0.00024740607,0.00061614794,0.43749478,0.009037117,0.29571152,0.0036216634,0.25141516],"study_design_scores_gemma":[0.000021056583,0.00003433862,0.00007823723,0.000036119112,0.0000063867333,0.000052635958,0.00004657225,0.90799993,0.0016423478,0.08597417,0.004092389,0.000015841832],"about_ca_topic_score_codex":0.0016132032,"about_ca_topic_score_gemma":0.0019819734,"teacher_disagreement_score":0.0036210883,"about_ca_system_score_codex":0.0005513421,"about_ca_system_score_gemma":0.00138396,"threshold_uncertainty_score":0.019150376},"labels":[],"label_agreement":null},{"id":"W2150766149","doi":"10.1016/j.laa.2013.08.018","title":"On algebraic Riccati equations associated with M -matrices","year":2013,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":29,"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 Regina","funders":"Shandong Academy of Sciences","keywords":"Algebraic Riccati equation; Mathematics; Riccati equation; Invertible matrix; Matrix (chemical analysis); Pure mathematics; Matrix difference equation; Algebraic number; Algebraic solution; Linear-quadratic regulator; Applied mathematics; Algebraic equation; Mathematical analysis; Optimal control; Differential equation; Mathematical optimization; Ordinary differential equation; Differential algebraic equation","score_opus":0.010217351628902248,"score_gpt":0.22786867247020723,"score_spread":0.21765132084130498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150766149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08783168,0.0034523006,0.83777344,0.0020493048,0.000499763,0.00007961602,0.0003117738,0.00017292758,0.06782914],"genre_scores_gemma":[0.8578678,0.005336345,0.09903068,0.00093948474,0.0013300397,0.0001737955,0.00069950975,0.00015107766,0.034471147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930215,0.00030954758,0.000033114746,0.000107505955,0.00017978757,0.00006794128],"domain_scores_gemma":[0.99832386,0.0009283856,0.0002768035,0.00012701168,0.00026091316,0.00008303257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097323407,0.0010655873,0.00071457296,0.0013909579,0.0007473518,0.001441741,0.0010089788,0.001074515,0.005696911],"category_scores_gemma":[0.0046250178,0.00043240472,0.0007060337,0.0021191966,0.0022395188,0.0027076544,0.0017572982,0.0017957696,0.0010500081],"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.000015657311,0.000019955733,0.00020898963,0.000055471515,0.000010727135,0.00009354175,0.00016935299,0.017323323,0.00087221025,0.97105294,0.0015292554,0.0086485995],"study_design_scores_gemma":[0.000010217126,0.000018573839,0.00015523871,0.00001860536,0.0000060933194,0.00007523538,0.00004963871,0.085746914,0.000342139,0.911025,0.0025313993,0.00002084906],"about_ca_topic_score_codex":0.00226074,"about_ca_topic_score_gemma":0.002116351,"teacher_disagreement_score":0.005696911,"about_ca_system_score_codex":0.00081363367,"about_ca_system_score_gemma":0.0006358442,"threshold_uncertainty_score":0.019058108},"labels":[],"label_agreement":null},{"id":"W2151529082","doi":"10.3968/j.sms.1923845220110301.152","title":"Spectral Radius of Nonnegative Centrosymmetric Matrices","year":2011,"lang":"en","type":"article","venue":"Studies in mathematical sciences","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Spectral radius; RADIUS; Mathematics; Combinatorics; Physics; Eigenvalues and eigenvectors; Quantum mechanics; Computer science","score_opus":0.08848144104843177,"score_gpt":0.32984387006620186,"score_spread":0.2413624290177701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151529082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10033749,0.00042281408,0.8884995,0.00022620482,0.000085026135,0.000032918804,0.00013651521,0.00028534874,0.009974217],"genre_scores_gemma":[0.81294274,0.00069037545,0.1818261,0.00015872745,0.00014156016,0.000079231344,0.00029036924,0.00015825556,0.0037126539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926835,0.00020839213,0.00003414011,0.00011857734,0.00029502882,0.000075372765],"domain_scores_gemma":[0.9971084,0.0012675044,0.00039553645,0.00034065102,0.0007010954,0.00018677692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008629699,0.00056693895,0.00043648,0.0013207494,0.0004979769,0.00095932954,0.00064575014,0.0004656217,0.0027590706],"category_scores_gemma":[0.0065972805,0.00017461157,0.00031379174,0.00062842126,0.0011508036,0.0017226237,0.00088418124,0.0007181841,0.0007656092],"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.00027492846,0.000050224382,0.0019136688,0.00023594387,0.000042659285,0.0002738506,0.0002628607,0.12859513,0.039377067,0.72137964,0.005161754,0.10243231],"study_design_scores_gemma":[0.00001597321,0.00008424442,0.0010876777,0.000036644622,0.000013260618,0.000336663,0.00013384412,0.6335961,0.013766789,0.34629297,0.0045823893,0.000053359832],"about_ca_topic_score_codex":0.0005817472,"about_ca_topic_score_gemma":0.0005213142,"teacher_disagreement_score":0.0027590706,"about_ca_system_score_codex":0.00040883682,"about_ca_system_score_gemma":0.0003824716,"threshold_uncertainty_score":0.009230018},"labels":[],"label_agreement":null},{"id":"W2151560129","doi":"10.1002/wics.1269","title":"Sparse matrix computations with application to solve system of nonlinear equations","year":2013,"lang":"en","type":"review","venue":"Wiley Interdisciplinary Reviews Computational Statistics","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":"University of Lethbridge","funders":"HORIZON EUROPE Excellent Science; Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd","keywords":"Sparse matrix; Matrix-free methods; Nonlinear system; Linear algebra; Computer science; Applied mathematics; Numerical linear algebra; Numerical analysis; Nonlinear programming; Algorithm; Matrix (chemical analysis); Mathematical optimization; Mathematics","score_opus":0.040734630173377605,"score_gpt":0.3558509177304233,"score_spread":0.31511628755704574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151560129","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023874827,0.4090207,0.55923563,0.0027982397,0.0013789354,0.00011804832,0.00023786433,0.0006867634,0.024136418],"genre_scores_gemma":[0.03545289,0.7121529,0.24012403,0.0006486588,0.0024276525,0.00027574503,0.0005515971,0.0002463667,0.0081201475],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99931407,0.00014636356,0.000049354927,0.00008911541,0.0003780038,0.000023107934],"domain_scores_gemma":[0.9983296,0.0010380682,0.000089601366,0.000116404386,0.00038720213,0.000039130577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010298456,0.0009540742,0.0011865806,0.0017392691,0.00038615745,0.0010869483,0.0011051081,0.00087089086,0.0039372244],"category_scores_gemma":[0.0034093636,0.00060448836,0.000815992,0.0033881196,0.0011129661,0.0015584285,0.0012733963,0.0021481398,0.0034612946],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031764775,0.00007734186,0.0006525194,0.0047861054,0.00013964764,0.00011664037,0.00015589879,0.042741787,0.0025439137,0.16966665,0.02881936,0.7502683],"study_design_scores_gemma":[0.00004236661,0.00013411207,0.0013352699,0.0016428956,0.00007612235,0.0011164293,0.00011524317,0.18140696,0.005268971,0.24234591,0.5664103,0.00010544622],"about_ca_topic_score_codex":0.0011503274,"about_ca_topic_score_gemma":0.0011987688,"teacher_disagreement_score":0.0039372244,"about_ca_system_score_codex":0.00042350628,"about_ca_system_score_gemma":0.0009943092,"threshold_uncertainty_score":0.013171315},"labels":[],"label_agreement":null},{"id":"W2154915620","doi":"10.1016/j.laa.2005.01.029","title":"Isospectral vibrating systems. Part 1. The spectral method","year":2005,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; University of Nottingham","keywords":"Isospectral; Mathematics; Constructive; Hermitian matrix; Class (philosophy); Pure mathematics; Equivalence (formal languages); Inverse; Matrix (chemical analysis); Algebra over a field","score_opus":0.012673940415974156,"score_gpt":0.26563369659148467,"score_spread":0.25295975617551053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154915620","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02740209,0.061910905,0.79970807,0.0022278337,0.004664404,0.000085276755,0.0002905024,0.00025422397,0.103456795],"genre_scores_gemma":[0.652501,0.05067507,0.16066748,0.0020726677,0.009875903,0.0005014309,0.0007247718,0.0003767216,0.122605026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972814,0.00010570144,0.000016060687,0.000041096264,0.00008807873,0.000020862097],"domain_scores_gemma":[0.9997012,0.00013453102,0.000041937747,0.000045092896,0.000054615408,0.000022559214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055780803,0.0008682234,0.00054323324,0.0011551308,0.00043273502,0.0010637464,0.0006771,0.0009941999,0.007646945],"category_scores_gemma":[0.0011138195,0.0003424173,0.00044306956,0.0009737632,0.0017971933,0.0015447388,0.0011120553,0.0013285019,0.001639888],"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.000021634502,0.00005710704,0.00017373923,0.00029328046,0.000015976198,0.00004384324,0.00018297309,0.01028202,0.003333413,0.91714346,0.0068021016,0.061650433],"study_design_scores_gemma":[0.000007630004,0.000056047767,0.0005218709,0.000087138425,0.000013651805,0.0001692454,0.000068202804,0.05562732,0.0012638246,0.9074092,0.034748994,0.000026758064],"about_ca_topic_score_codex":0.00036563896,"about_ca_topic_score_gemma":0.00036608038,"teacher_disagreement_score":0.007646945,"about_ca_system_score_codex":0.0003576076,"about_ca_system_score_gemma":0.0003004353,"threshold_uncertainty_score":0.025581598},"labels":[],"label_agreement":null},{"id":"W2155252746","doi":"10.1109/aps.2006.1710588","title":"Optimization using Broyden-update self-adjoint sensitivities","year":2006,"lang":"en","type":"article","venue":"2006 IEEE Antennas and Propagation Society International Symposium","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"McMaster University","funders":"","keywords":"Computation; Overhead (engineering); Computer science; Adjoint equation; Sensitivity (control systems); Mathematical optimization; Optimization problem; Matrix (chemical analysis); Algorithm; Optimization algorithm; Mathematics; Electronic engineering","score_opus":0.007633425620647701,"score_gpt":0.2200643868026042,"score_spread":0.2124309611819565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155252746","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009751396,0.00005507022,0.9886481,0.000083760344,0.000030513824,0.000028819983,0.000015012062,0.00023229251,0.001155127],"genre_scores_gemma":[0.29639605,0.000115398485,0.6985796,0.00015954679,0.000034056175,0.00020833426,0.00006930552,0.00021861955,0.0042192056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999522,0.0002026472,0.00002240638,0.00005617256,0.00016683506,0.000030037112],"domain_scores_gemma":[0.99909663,0.0004928228,0.00007531161,0.000109976,0.00019453198,0.00003077884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014479733,0.0006896809,0.0008522479,0.00051048707,0.00036861177,0.0007488964,0.0008710432,0.0013860837,0.0017163156],"category_scores_gemma":[0.0032205,0.0005967444,0.00058482797,0.00037230924,0.0007216088,0.0012209812,0.0008894641,0.0008986151,0.00034119698],"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.000117340875,0.00009043961,0.00044365687,0.00009682825,0.00007183829,0.00008020135,0.00010583469,0.8931099,0.014697645,0.033028964,0.0013141141,0.056843176],"study_design_scores_gemma":[0.000008270926,0.000010716834,0.000040854986,0.000001976133,0.0000020221314,0.000008242358,0.0000017154408,0.99588144,0.0021451502,0.0015487886,0.00034550598,0.000005238892],"about_ca_topic_score_codex":0.0015638869,"about_ca_topic_score_gemma":0.0018273054,"teacher_disagreement_score":0.0017163156,"about_ca_system_score_codex":0.00050819403,"about_ca_system_score_gemma":0.0008488961,"threshold_uncertainty_score":0.0076577067},"labels":[],"label_agreement":null},{"id":"W2155803791","doi":"10.1016/j.laa.2007.08.013","title":"Polynomial numerical hulls of matrices","year":2007,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":20,"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":"National Science Foundation","keywords":"Numerical range; Mathematics; Hermitian matrix; Eigenvalues and eigenvectors; Combinatorics; Spectrum (functional analysis); Complex matrix; Polynomial; Hull; Characteristic polynomial; Unitary matrix; Matrix (chemical analysis); Normal matrix; Order (exchange); Circular ensemble; Matrix polynomial; Companion matrix; Square matrix; Unitary state; Polynomial matrix; Pure mathematics; Symmetric matrix; Mathematical analysis","score_opus":0.00882574773364875,"score_gpt":0.2572488122699369,"score_spread":0.24842306453628815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155803791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18756652,0.0006498767,0.75623477,0.0008763816,0.00020212929,0.000046187506,0.000480727,0.0005810084,0.05336243],"genre_scores_gemma":[0.89619774,0.0007051661,0.07026973,0.00015491596,0.0004255158,0.000048688675,0.00066212326,0.00023015063,0.031305883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998811,0.00021570118,0.000044728407,0.00022186842,0.0005091936,0.00019744456],"domain_scores_gemma":[0.9958318,0.0020032222,0.0005735267,0.0005132231,0.000635488,0.000442767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008338387,0.00061046664,0.0007395807,0.0016905578,0.0010597061,0.0033976797,0.0010578684,0.0005284872,0.010813648],"category_scores_gemma":[0.007969494,0.00046047202,0.00067842094,0.001789511,0.0029599231,0.004736641,0.0022152152,0.0029622093,0.0020642723],"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.00009347911,0.000029293598,0.0003491009,0.000052400632,0.000007439698,0.00006645029,0.00026035102,0.007352411,0.0018551073,0.9688168,0.002102067,0.019015111],"study_design_scores_gemma":[0.000016685433,0.000049882674,0.00049406796,0.000021845311,0.000008265389,0.00013568597,0.00015376994,0.057792164,0.0031997822,0.9315829,0.006520136,0.000024821684],"about_ca_topic_score_codex":0.0015992915,"about_ca_topic_score_gemma":0.0015232221,"teacher_disagreement_score":0.010813648,"about_ca_system_score_codex":0.0010893429,"about_ca_system_score_gemma":0.0006022462,"threshold_uncertainty_score":0.03617525},"labels":[],"label_agreement":null},{"id":"W2158285196","doi":"10.1016/s0024-3795(03)00577-9","title":"Unitary dilation approach to contractive matrix completion","year":2003,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Research Grants Council, University Grants Committee","keywords":"Mathematics; Dilation (metric space); Unitary state; Unitary matrix; Matrix completion; Matrix (chemical analysis); Algebra over a field; Construct (python library); Block (permutation group theory); Block matrix; Pure mathematics; Discrete mathematics; Combinatorics; Computer science","score_opus":0.015140716137138471,"score_gpt":0.2596429048220842,"score_spread":0.24450218868494572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158285196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044684887,0.0011636437,0.8865399,0.0028744123,0.0006199968,0.0000518936,0.0001372755,0.00029517605,0.063632846],"genre_scores_gemma":[0.73622483,0.0021432952,0.19037971,0.00097253564,0.0019534766,0.00017555151,0.00021505043,0.00034319173,0.06759235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942195,0.00015377249,0.000022070892,0.00011610291,0.00021581438,0.00007038647],"domain_scores_gemma":[0.99897456,0.000388899,0.00009198911,0.00020796282,0.00020670112,0.00012989058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079290284,0.0005543259,0.0007803585,0.00074112474,0.0011446183,0.0015636069,0.00096900656,0.0007934516,0.00662944],"category_scores_gemma":[0.0025971506,0.0003192459,0.0005832499,0.0008628076,0.0029637672,0.0037192553,0.0017782281,0.002399576,0.0006073319],"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.000005527899,0.0000061094906,0.000013764183,0.000006764209,0.0000015096401,0.000010421804,0.000040996827,0.00073214853,0.00030139627,0.9952474,0.0005991083,0.0030348666],"study_design_scores_gemma":[0.0000057348416,0.000014168579,0.000052359916,0.0000030386664,0.0000027398187,0.000033004126,0.000028066794,0.0163684,0.00047782576,0.97888696,0.0041201804,0.000007511267],"about_ca_topic_score_codex":0.001320513,"about_ca_topic_score_gemma":0.0009416411,"teacher_disagreement_score":0.00662944,"about_ca_system_score_codex":0.0011737915,"about_ca_system_score_gemma":0.0008870296,"threshold_uncertainty_score":0.022177696},"labels":[],"label_agreement":null},{"id":"W2158573426","doi":"10.1016/j.laa.2006.12.013","title":"The higher-order derivatives of spectral functions","year":2007,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":32,"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 Guelph","funders":"","keywords":"Mathematics; Hessian matrix; Differentiable function; Eigenvalues and eigenvectors; Symmetric matrix; Pure mathematics; Separable space; Symmetric function; Order (exchange); Matrix (chemical analysis); Elementary symmetric polynomial; Function (biology); Matrix function; Applied mathematics; Mathematical analysis; Orthogonal polynomials","score_opus":0.010701359919969625,"score_gpt":0.25174754413139677,"score_spread":0.24104618421142715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158573426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18543126,0.007173554,0.73470795,0.0037906505,0.0015331629,0.000032366057,0.0003052959,0.00054517604,0.06648066],"genre_scores_gemma":[0.8852234,0.00469646,0.06351865,0.0008554154,0.0016644316,0.000049502472,0.00020187447,0.00038403785,0.04340621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922967,0.00026749008,0.000039018596,0.00014312429,0.00023559382,0.000085011765],"domain_scores_gemma":[0.995719,0.0021621478,0.0005059509,0.00042859983,0.00068285357,0.0005014391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016874768,0.0010035464,0.00076924457,0.0033846968,0.0011140619,0.0035873745,0.0014020384,0.0014923129,0.007622288],"category_scores_gemma":[0.010293129,0.00053459173,0.00060610345,0.002463635,0.0042813905,0.007803423,0.0015841962,0.0030461894,0.0013340134],"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.000017350294,0.000016571657,0.00016817098,0.000030406314,0.0000047839158,0.000043437023,0.0001524346,0.0023659968,0.0007382213,0.98657703,0.0010035358,0.008882034],"study_design_scores_gemma":[0.0000034719403,0.0000073751226,0.00021300052,0.000014357016,0.000004180972,0.00009297444,0.00003932943,0.023090882,0.00051977247,0.9731549,0.0028407383,0.000018982591],"about_ca_topic_score_codex":0.001251483,"about_ca_topic_score_gemma":0.0014574919,"teacher_disagreement_score":0.007622288,"about_ca_system_score_codex":0.0013491792,"about_ca_system_score_gemma":0.0008722305,"threshold_uncertainty_score":0.025499165},"labels":[],"label_agreement":null},{"id":"W2161590236","doi":"10.13001/1081-3810.1086","title":"On the Cayley transform of positivity classes of matrices","year":2002,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":26,"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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Cayley transform; Combinatorics; Factorization; Matrix (chemical analysis); Pure mathematics; Class (philosophy); Nonnegative matrix; Involution (esoterism); Matrix decomposition; Symmetric matrix; Graph; Eigenvalues and eigenvectors","score_opus":0.009571181560378063,"score_gpt":0.22473492134106846,"score_spread":0.2151637397806904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161590236","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60129845,0.00067151047,0.32348487,0.00074358,0.00014375767,0.000072747454,0.00022502383,0.00015931066,0.07320075],"genre_scores_gemma":[0.9709811,0.00059126824,0.018678155,0.00022749187,0.00020081122,0.000063894375,0.0002722638,0.00008543613,0.008899416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994455,0.0001432023,0.00001775065,0.0001211596,0.0001513275,0.00012104365],"domain_scores_gemma":[0.9963965,0.0018209113,0.00043844114,0.0002682689,0.000638513,0.0004374246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013114685,0.000485803,0.0003913424,0.0012847258,0.0012088923,0.0019598624,0.0004938667,0.0005931638,0.0073579927],"category_scores_gemma":[0.006375358,0.00029002532,0.000510087,0.00079433026,0.0023197543,0.0028498813,0.00089844986,0.0012850581,0.0008187727],"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.00009019214,0.000028268681,0.0009529741,0.000025528983,0.0000065147747,0.00017269533,0.0003105858,0.0042570266,0.0040183607,0.97593075,0.0012968564,0.0129102515],"study_design_scores_gemma":[0.000019043819,0.000053795913,0.00056003645,0.000017612098,0.0000050644244,0.00024416964,0.00018071062,0.05033851,0.001996864,0.94405156,0.0025086305,0.000023942768],"about_ca_topic_score_codex":0.0014584465,"about_ca_topic_score_gemma":0.0011499708,"teacher_disagreement_score":0.0073579927,"about_ca_system_score_codex":0.00058024377,"about_ca_system_score_gemma":0.0004782954,"threshold_uncertainty_score":0.02461493},"labels":[],"label_agreement":null},{"id":"W2162471115","doi":"10.4153/cjm-2001-020-6","title":"Hyperbolic Polynomials and Convex Analysis","year":2001,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":105,"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; Okanagan University College","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; National Science Foundation","keywords":"Mathematics; Univariate; Regular polygon; Polynomial; Convex function; Homogeneous polynomial; Pure mathematics; Function (biology); Homogeneous; Mathematical analysis; Combinatorics; Matrix polynomial; Multivariate statistics; Geometry","score_opus":0.014461114469188623,"score_gpt":0.22336329971216629,"score_spread":0.20890218524297766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162471115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17351036,0.004266699,0.72889,0.003701049,0.0003125708,0.00006327392,0.00041537607,0.00013962404,0.088701054],"genre_scores_gemma":[0.93543565,0.0016795396,0.043306164,0.00024030902,0.00046913608,0.00004273185,0.0002224463,0.00007647116,0.018527603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950445,0.00018461756,0.000015509462,0.00008075064,0.00014370437,0.00007095641],"domain_scores_gemma":[0.9989918,0.00041725463,0.00015034659,0.00008233452,0.00023232921,0.00012593102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011141973,0.0005492904,0.00045068728,0.0011246095,0.0005225913,0.0010802267,0.00048431236,0.00031727733,0.004700484],"category_scores_gemma":[0.0032097795,0.0001856324,0.00040498943,0.0008997516,0.0028691401,0.0015331915,0.0015723895,0.0015572343,0.00052400416],"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.000010664126,0.000004341273,0.0001721428,0.000019027404,0.0000063375014,0.000026012636,0.000055310124,0.008479042,0.000461191,0.9838644,0.0011043178,0.005797203],"study_design_scores_gemma":[0.0000067494866,0.000015259851,0.00033110328,0.000015746245,0.000004753869,0.000040856332,0.000080340746,0.10670715,0.00047394214,0.8870415,0.0052746567,0.000008036982],"about_ca_topic_score_codex":0.0022708846,"about_ca_topic_score_gemma":0.0015732837,"teacher_disagreement_score":0.004700484,"about_ca_system_score_codex":0.0014620397,"about_ca_system_score_gemma":0.00045612213,"threshold_uncertainty_score":0.015724659},"labels":[],"label_agreement":null},{"id":"W2163943651","doi":"10.1016/s0024-3795(00)00098-7","title":"Solving the two-dimensional CIS problem by a rational algorithm","year":2000,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Arithmetic function; Dimension (graph theory); Integer (computer science); Algorithm; Subspace topology; Combinatorics; Algebra over a field; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.006967783719888575,"score_gpt":0.2325181656412012,"score_spread":0.22555038192131263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163943651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035998434,0.00015538491,0.9485972,0.00054616446,0.00010327567,0.00006399641,0.00009615534,0.0006341624,0.01380527],"genre_scores_gemma":[0.424626,0.00030680152,0.5633838,0.00018678914,0.00014488684,0.00015721333,0.00032251596,0.00026056773,0.010611512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938273,0.00016090783,0.000031119987,0.00013314321,0.00018726758,0.00010486682],"domain_scores_gemma":[0.9987539,0.0007888031,0.000053128715,0.00017447303,0.0001671263,0.000062528015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008593394,0.00069592317,0.0012473251,0.00070546544,0.0006086572,0.0017012754,0.0011829878,0.0011714954,0.010824824],"category_scores_gemma":[0.0044638473,0.00033190835,0.0006368931,0.0009147135,0.0013457752,0.0019696306,0.0018701142,0.0017888816,0.0017314547],"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.00059353135,0.00024055908,0.0011297358,0.00044463365,0.00007887177,0.00023819781,0.00030052327,0.25344977,0.0065929443,0.41885296,0.01212323,0.30595496],"study_design_scores_gemma":[0.00014515498,0.00010065441,0.00015850316,0.000028814851,0.000020095455,0.00010877899,0.00017473867,0.80504733,0.0030033125,0.1857314,0.0054564113,0.00002469189],"about_ca_topic_score_codex":0.002058153,"about_ca_topic_score_gemma":0.0018330093,"teacher_disagreement_score":0.010824824,"about_ca_system_score_codex":0.0005921518,"about_ca_system_score_gemma":0.0014446877,"threshold_uncertainty_score":0.036212683},"labels":[],"label_agreement":null},{"id":"W2164261830","doi":"10.1016/j.cpc.2007.11.014","title":"FPGA architecture and implementation of sparse matrix–vector multiplication for the finite element method","year":2007,"lang":"en","type":"article","venue":"Computer Physics Communications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"University of Toronto","keywords":"Field-programmable gate array; Computer science; Pipeline (software); FLOPS; Parallel computing; Sparse matrix; Finite element method; Computational science; Floating point; Multiplication (music); Matrix multiplication; Computer hardware; Algorithm; Engineering; Mathematics","score_opus":0.0355221840187309,"score_gpt":0.3563668584390772,"score_spread":0.3208446744203463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164261830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1617047,0.0013102429,0.77657735,0.0007803668,0.00047465033,0.00019188382,0.0005800682,0.009558305,0.04882235],"genre_scores_gemma":[0.7257279,0.00034223203,0.25866002,0.00016871424,0.00005925986,0.00012591002,0.0007124315,0.0001290148,0.014074483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998807,0.000021944232,0.000007176142,0.000016409347,0.000049266862,0.00002459499],"domain_scores_gemma":[0.99986386,0.00003274154,0.000010890136,0.000022761456,0.000059723207,0.000010035334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000118681666,0.0002956562,0.00020279948,0.00043353435,0.00029102468,0.00047345113,0.00063469535,0.00027334064,0.00875923],"category_scores_gemma":[0.0003341419,0.00017391422,0.00012565727,0.00037578467,0.000109566245,0.00030780263,0.00016574915,0.00029498496,0.0014724061],"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.0012893263,0.0002164511,0.003203634,0.0004232361,0.0001052297,0.00049424294,0.00027707283,0.08160594,0.1597073,0.03511531,0.03261046,0.68495184],"study_design_scores_gemma":[0.0003676012,0.00088244997,0.0048503745,0.000095260155,0.000079629965,0.0010652898,0.00017830508,0.6505268,0.2246277,0.009185102,0.10805543,0.000086072774],"about_ca_topic_score_codex":0.0025430662,"about_ca_topic_score_gemma":0.0033734385,"teacher_disagreement_score":0.00875923,"about_ca_system_score_codex":0.00034472469,"about_ca_system_score_gemma":0.0005387946,"threshold_uncertainty_score":0.029302537},"labels":[],"label_agreement":null},{"id":"W2165984696","doi":"10.1109/padsw.2000.884679","title":"Estimating the parallel performance of IQMR method for unsymmetric large and sparse linear systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"St. Francis Xavier University","funders":"","keywords":"Hypercube; Computer science; Network topology; Parallel algorithm; Intel iPSC; Algorithm; Routing (electronic design automation); Computation; Stability (learning theory); Sparse matrix; Binary tree; Parallel computing; Topology (electrical circuits); Mathematics","score_opus":0.03120271677974931,"score_gpt":0.27570624675102107,"score_spread":0.24450352997127175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165984696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45026332,0.00043148675,0.54383254,0.00020803971,0.000042405,0.00008043103,0.00011834069,0.0016244611,0.0033989449],"genre_scores_gemma":[0.69970214,0.00016443178,0.2988474,0.000022002656,0.00002471222,0.00007263742,0.00023762576,0.00011202061,0.00081703695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999501,0.00020940258,0.000021907677,0.00005901831,0.00015691877,0.000051716226],"domain_scores_gemma":[0.9970487,0.001772917,0.00019554465,0.0004797572,0.00044854922,0.000054610933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001516906,0.00049393636,0.00044335262,0.0004701573,0.00029669193,0.00028937764,0.00072434306,0.00048263554,0.0011097012],"category_scores_gemma":[0.006880366,0.00021484452,0.0002283255,0.00067994266,0.0005321651,0.00090275623,0.00038802892,0.00045511045,0.00032462736],"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.00091844174,0.00017109523,0.0061962306,0.00027777086,0.000079239544,0.00018644973,0.0001946689,0.8404238,0.043382887,0.011523043,0.0013429387,0.09530338],"study_design_scores_gemma":[0.000017205846,0.00006972689,0.000542434,0.0000017249475,0.000004037344,0.000021222146,0.000010627879,0.9925041,0.0059293895,0.0007432349,0.00015136474,0.000004980911],"about_ca_topic_score_codex":0.0022032063,"about_ca_topic_score_gemma":0.0016985395,"teacher_disagreement_score":0.0022032063,"about_ca_system_score_codex":0.00030489135,"about_ca_system_score_gemma":0.00053863187,"threshold_uncertainty_score":0.008022249},"labels":[],"label_agreement":null},{"id":"W2166115210","doi":"10.1016/s0024-3795(00)00254-8","title":"On the location of the spectrum of hypertournament matrices","year":2001,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Multilinear algebra; Eigenvalues and eigenvectors; Numerical range; Spectrum (functional analysis); Complex matrix; Matrix (chemical analysis); Linear algebra; Range (aeronautics); Pure mathematics; Normal matrix; Algebra over a field; Geometry; Jordan algebra; Algebra representation","score_opus":0.010723163022731122,"score_gpt":0.22870942221488216,"score_spread":0.21798625919215103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166115210","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60705864,0.0012350939,0.3580483,0.0019018349,0.00025485197,0.00003595955,0.0002594639,0.0004553901,0.030750392],"genre_scores_gemma":[0.976144,0.0003771182,0.017971542,0.00012498889,0.0001607326,0.000029178073,0.00014080649,0.00010187102,0.004949702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996123,0.0001380324,0.000013819512,0.00008816785,0.00008541163,0.0000622584],"domain_scores_gemma":[0.9951881,0.0026147657,0.0007576007,0.00028805068,0.000656305,0.00049516646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084711483,0.00051304343,0.0005311962,0.0016780123,0.0011128224,0.0019184904,0.0014809452,0.0012429435,0.0070111114],"category_scores_gemma":[0.010421057,0.00034277266,0.00026367136,0.0008447035,0.002501793,0.0027259896,0.0015565724,0.0014003462,0.001050591],"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.00040789036,0.00006756961,0.001582877,0.000097035205,0.000015312753,0.0003498425,0.0004145127,0.012414621,0.0085723195,0.9480694,0.002476864,0.025531836],"study_design_scores_gemma":[0.000060274488,0.00007739885,0.0008480613,0.000067405155,0.000011182874,0.00028271202,0.00029868787,0.11200413,0.003544759,0.8805523,0.0022047304,0.000048354104],"about_ca_topic_score_codex":0.0007835526,"about_ca_topic_score_gemma":0.000722575,"teacher_disagreement_score":0.0070111114,"about_ca_system_score_codex":0.00052304403,"about_ca_system_score_gemma":0.0005022122,"threshold_uncertainty_score":0.023454547},"labels":[],"label_agreement":null},{"id":"W2166356498","doi":"10.1002/nla.787","title":"On the perturbation of the Q‐factor of the QR factorization","year":2011,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Perturbation (astronomy); Mathematics; Invertible matrix; Factorization; Applied mathematics; Combinatorics; Pure mathematics; Algorithm; Physics; Quantum mechanics","score_opus":0.016871562044017387,"score_gpt":0.21272173993302815,"score_spread":0.19585017788901077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166356498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011622202,0.0003814558,0.9820769,0.00035602585,0.00009622755,0.000030502744,0.000066517714,0.0001746462,0.005195493],"genre_scores_gemma":[0.73422486,0.0019601998,0.25187674,0.00071549247,0.00054632226,0.00026846325,0.00040030864,0.00050810823,0.009499446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99621683,0.0017416772,0.00010332434,0.00032359926,0.0013725958,0.00024194598],"domain_scores_gemma":[0.98747975,0.008227094,0.0008556325,0.0011841672,0.0019385931,0.00031469157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004502464,0.0013427646,0.00071438774,0.0011648623,0.0005087902,0.0013346488,0.00057605444,0.0006903306,0.0033138206],"category_scores_gemma":[0.01893734,0.00034564032,0.0006380599,0.0006046264,0.002813564,0.0024268737,0.0022695183,0.0024200561,0.0012696462],"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.0005432234,0.00007864105,0.0013992178,0.00032010075,0.00010429242,0.00049109757,0.00031991946,0.41818902,0.03392775,0.47338498,0.005778699,0.06546305],"study_design_scores_gemma":[0.0000075139887,0.0000838025,0.0004621841,0.0000458612,0.000010723026,0.0001259972,0.000048754882,0.8673813,0.008149683,0.12125154,0.0023980197,0.00003455571],"about_ca_topic_score_codex":0.0013658558,"about_ca_topic_score_gemma":0.00044619796,"teacher_disagreement_score":0.004502464,"about_ca_system_score_codex":0.00091953744,"about_ca_system_score_gemma":0.0008336854,"threshold_uncertainty_score":0.023811579},"labels":[],"label_agreement":null},{"id":"W2168496234","doi":"10.1088/0305-4470/36/47/008","title":"Asymptotic iteration method for eigenvalue problems","year":2003,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and General","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":559,"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 Prince Edward Island; Concordia University","funders":"","keywords":"Eigenvalues and eigenvectors; Mathematics; Homogeneous; Applied mathematics; Order (exchange); Type (biology); Differential equation; Homogeneous differential equation; Mathematical analysis; Ordinary differential equation; Physics; Combinatorics; Differential algebraic equation; Quantum mechanics","score_opus":0.020183299381335396,"score_gpt":0.2807246459431958,"score_spread":0.2605413465618604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168496234","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039235326,0.00017602734,0.9895537,0.00011903679,0.0000816519,0.000033228338,0.000021803336,0.00025464676,0.0058362614],"genre_scores_gemma":[0.23687315,0.0005904233,0.7384218,0.00028342358,0.00022743427,0.0007476348,0.00022982436,0.0006276428,0.021998722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929273,0.00034666536,0.00002909139,0.00004342445,0.00024369633,0.000044405675],"domain_scores_gemma":[0.9987923,0.0005820213,0.00005393462,0.00011148825,0.00037863912,0.00008155558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012516266,0.00055157836,0.0008258916,0.00091518334,0.00057731563,0.0007935676,0.0010284921,0.0009417102,0.0049286806],"category_scores_gemma":[0.003999482,0.00028454806,0.0007080265,0.00059480837,0.0010206816,0.0009407028,0.0015991491,0.0016863092,0.0016021484],"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.00015056049,0.00016451493,0.00089260435,0.00030610766,0.000068332214,0.00018523312,0.0002862909,0.26492256,0.012659257,0.5312358,0.007829916,0.18129888],"study_design_scores_gemma":[0.000013442703,0.000035180285,0.000086864944,0.000018534396,0.0000047870953,0.00006115782,0.000013363517,0.94242215,0.0008344337,0.052729227,0.0037688,0.000012162761],"about_ca_topic_score_codex":0.0013739897,"about_ca_topic_score_gemma":0.0015912987,"teacher_disagreement_score":0.0049286806,"about_ca_system_score_codex":0.0005654085,"about_ca_system_score_gemma":0.0011709499,"threshold_uncertainty_score":0.016488075},"labels":[],"label_agreement":null},{"id":"W2169047042","doi":"10.1139/p07-160","title":"Momentum average approximations for the Holstein polaron","year":2008,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Physics; Polaron; Momentum (technical analysis); Position and momentum space; Simple (philosophy); Approximations of π; Function (biology); Space (punctuation); Applied mathematics; Quantum mechanics; Statistical physics; Mathematics; Computer science","score_opus":0.021673374205970923,"score_gpt":0.2160356584436619,"score_spread":0.19436228423769097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169047042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0404212,0.00047555374,0.931055,0.0003154031,0.00016060818,0.000029853492,0.00006956985,0.00033895436,0.027133867],"genre_scores_gemma":[0.7034702,0.001311331,0.2744837,0.0003808196,0.000244253,0.00023044524,0.0002971126,0.0006179238,0.01896423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999551,0.00014034532,0.000017501347,0.00003065679,0.00020712774,0.00005335698],"domain_scores_gemma":[0.99908435,0.00043594028,0.00006898682,0.00020077218,0.00013352696,0.00007641347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010698014,0.0006777236,0.00070333004,0.0011889566,0.0008923541,0.0014220427,0.0020057543,0.000988053,0.0033161622],"category_scores_gemma":[0.0033837012,0.00028995232,0.00070018845,0.0008365832,0.0012699715,0.0023592948,0.0014383291,0.0014879962,0.0012415532],"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.000034862143,0.00003933594,0.0004000349,0.000068328474,0.000024068428,0.00015762477,0.00010787195,0.19557655,0.001973104,0.7876187,0.0014173111,0.012582186],"study_design_scores_gemma":[0.0000050977383,0.000009822737,0.000063590756,0.000008623047,0.0000035832916,0.00003134027,0.0000142006975,0.8006646,0.00049023825,0.19778018,0.00092028524,0.000008419005],"about_ca_topic_score_codex":0.0022995742,"about_ca_topic_score_gemma":0.0021950316,"teacher_disagreement_score":0.0033161622,"about_ca_system_score_codex":0.000841689,"about_ca_system_score_gemma":0.00083460496,"threshold_uncertainty_score":0.011093676},"labels":[],"label_agreement":null},{"id":"W2169257454","doi":"10.13001/1081-3810.1300","title":"On the minimum rank of not necessarily symmetric matrices: A preliminary study","year":2009,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":52,"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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Digraph; Rank (graph theory); Zero (linguistics); Graph; Cover (algebra); Simple graph; Discrete mathematics","score_opus":0.010352681736522,"score_gpt":0.24872913210156505,"score_spread":0.23837645036504304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169257454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11083836,0.004695161,0.85165036,0.0014509922,0.00020529164,0.000086712,0.000531182,0.00028483063,0.030257175],"genre_scores_gemma":[0.72921073,0.008523044,0.24345887,0.00055876217,0.0013086618,0.00016964422,0.0013057429,0.0003380213,0.015126543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981092,0.0006829429,0.00012227234,0.0003482185,0.0004981278,0.00023912676],"domain_scores_gemma":[0.976073,0.017756242,0.0017212386,0.001624221,0.0022044242,0.0006208851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030398734,0.0011436533,0.0011567285,0.0016973934,0.00084930874,0.0024174142,0.0012270333,0.0011569776,0.005860564],"category_scores_gemma":[0.023791954,0.00068041816,0.0011079282,0.002633403,0.0029027215,0.006893528,0.001558484,0.0023347207,0.0013829344],"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.00028105683,0.00024104965,0.003109012,0.0008190425,0.000067858375,0.00043946863,0.00055088743,0.08145505,0.006414099,0.829823,0.008406213,0.06839318],"study_design_scores_gemma":[0.000031072894,0.0003083824,0.0012404651,0.00012055992,0.00003080845,0.00052971696,0.00020522118,0.1854534,0.0035029356,0.80157435,0.006939307,0.00006373506],"about_ca_topic_score_codex":0.0014822284,"about_ca_topic_score_gemma":0.001724331,"teacher_disagreement_score":0.005860564,"about_ca_system_score_codex":0.0008807322,"about_ca_system_score_gemma":0.00089361204,"threshold_uncertainty_score":0.019605577},"labels":[],"label_agreement":null},{"id":"W2169257893","doi":"10.13001/1081-3810.1171","title":"Schur complements and Banachiewicz-Schur forms","year":2005,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Schur complement; Idempotent matrix; Schur's theorem; Schur product theorem; Idempotence; Rank (graph theory); Schur decomposition; Schur algebra; Pure mathematics; Matrix (chemical analysis); Algebra over a field; Schur's lemma; Combinatorics; Eigenvalues and eigenvectors","score_opus":0.007760726781642667,"score_gpt":0.24745581324726929,"score_spread":0.23969508646562662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169257893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22581312,0.0004907009,0.70099455,0.00064071827,0.00018611588,0.00017563804,0.00030500581,0.00026404412,0.07113012],"genre_scores_gemma":[0.89129865,0.0005215636,0.09028392,0.00026552854,0.00022739165,0.00022328932,0.0003305396,0.00007834194,0.01677077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984484,0.00037981538,0.00007550012,0.0003008016,0.00054234004,0.0002530736],"domain_scores_gemma":[0.9975708,0.0008366536,0.0004421518,0.00021671857,0.00067270134,0.000260886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012248391,0.0010543007,0.00068122236,0.0013747547,0.0012380123,0.0025659318,0.0005880733,0.0007387826,0.011662323],"category_scores_gemma":[0.0056389184,0.00040950676,0.00072666514,0.000717109,0.0034710385,0.0036387965,0.0018149767,0.0016862537,0.0010186785],"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.00006840805,0.00002924377,0.00022935549,0.000062346444,0.000016573435,0.00029054115,0.00020340264,0.005155784,0.00427583,0.98098963,0.0006686498,0.008010376],"study_design_scores_gemma":[0.000046842422,0.00015737128,0.00036757518,0.000044056032,0.000019621244,0.0006273848,0.00039633567,0.04301012,0.0077883378,0.94133234,0.0061558317,0.000054187363],"about_ca_topic_score_codex":0.0008534209,"about_ca_topic_score_gemma":0.001219902,"teacher_disagreement_score":0.011662323,"about_ca_system_score_codex":0.00064604107,"about_ca_system_score_gemma":0.0012168875,"threshold_uncertainty_score":0.0390144},"labels":[],"label_agreement":null},{"id":"W2170078808","doi":"10.1109/ipdps.2008.4536466","title":"A parallel sewing method for solving tridiagonal Toeplitz strictly diagonally dominant systems","year":2008,"lang":"en","type":"article","venue":"Proceedings - IEEE International Parallel and Distributed Processing Symposium","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Toeplitz matrix; Tridiagonal matrix; Diagonal; Computer science; Diagonally dominant matrix; Coefficient matrix; Parallel computing; Linear system; Band matrix; Matrix (chemical analysis); Scale (ratio); Algorithm; Mathematics; Symmetric matrix; Square matrix; Mathematical analysis; Pure mathematics; Geometry","score_opus":0.0254816714249268,"score_gpt":0.2831043667954523,"score_spread":0.2576226953705255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170078808","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009211254,0.000065106586,0.9890225,0.000042934364,0.000029812685,0.000030246494,0.0000146937755,0.00028221225,0.0013011764],"genre_scores_gemma":[0.087820284,0.00014255961,0.9083714,0.000043742235,0.000018704191,0.00012900785,0.00007552901,0.000116632495,0.0032821686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999861,0.000026455498,0.000006545136,0.000018825638,0.000071389666,0.00001573574],"domain_scores_gemma":[0.9998074,0.00006418073,0.000016906393,0.000035950623,0.00006078937,0.000014760974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029161962,0.00051950314,0.00045325267,0.00037732735,0.0005375023,0.00036828863,0.0006714311,0.0004700224,0.0028037215],"category_scores_gemma":[0.00065794296,0.00025746628,0.00041693944,0.0005571725,0.00045012805,0.00062903424,0.0005501607,0.0007502292,0.00064128987],"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.00025442833,0.00015599758,0.00091481494,0.00024667708,0.00009721841,0.0003010582,0.0003125531,0.36567694,0.102827445,0.06309075,0.005874007,0.46024805],"study_design_scores_gemma":[0.000032409596,0.000060656133,0.00011796496,0.0000070759875,0.00000783271,0.00007366222,0.000019309422,0.98093915,0.007953142,0.007239937,0.0035364358,0.000012440758],"about_ca_topic_score_codex":0.0020687191,"about_ca_topic_score_gemma":0.00322848,"teacher_disagreement_score":0.0028037215,"about_ca_system_score_codex":0.00017828864,"about_ca_system_score_gemma":0.00089775666,"threshold_uncertainty_score":0.009379327},"labels":[],"label_agreement":null},{"id":"W2170774163","doi":"10.1002/nla.1825","title":"Hermitian‐type generalized singular value decomposition with applications","year":2012,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Shanghai Municipal Education Commission; National Natural Science Foundation of China; McGill University; Natural Science Foundation of Shanghai","keywords":"Hermitian matrix; Mathematics; Hermitian function; Singular value decomposition; Matrix (chemical analysis); Matrix function; Rank (graph theory); Pure mathematics; Algebra over a field; Applied mathematics; Symmetric matrix; Mathematical analysis; Combinatorics; Algorithm; Physics","score_opus":0.009507974454374934,"score_gpt":0.26415630785386945,"score_spread":0.2546483333994945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170774163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005964012,0.00073453627,0.98519933,0.00025006858,0.00015088166,0.000025484891,0.000048338683,0.00008250352,0.0075447885],"genre_scores_gemma":[0.49538517,0.00275445,0.48722968,0.0003332044,0.0008109494,0.0001429627,0.00026502338,0.00016726599,0.012911197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994381,0.00024325016,0.000031896343,0.00007788991,0.00017361424,0.000035219306],"domain_scores_gemma":[0.99928206,0.00021393163,0.00006856649,0.00010949738,0.00027906097,0.00004686578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083248946,0.0007902386,0.00053683383,0.000637303,0.00025331212,0.0007534074,0.00047758565,0.00039280945,0.0036774273],"category_scores_gemma":[0.002433691,0.00021186112,0.000600369,0.0009794519,0.00086653937,0.00080911646,0.00111452,0.0011374967,0.0008185628],"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.000033812667,0.000041555042,0.00036178424,0.00015428371,0.0000395424,0.00016475355,0.0001061535,0.08954181,0.004354047,0.8052554,0.0058585242,0.09408846],"study_design_scores_gemma":[0.000009227525,0.000035677116,0.00023022678,0.00002427973,0.000007395238,0.0001273127,0.00003581498,0.5285364,0.0011216714,0.46139497,0.008462345,0.000014583302],"about_ca_topic_score_codex":0.00072598923,"about_ca_topic_score_gemma":0.00070209784,"teacher_disagreement_score":0.0036774273,"about_ca_system_score_codex":0.0003081682,"about_ca_system_score_gemma":0.0004162155,"threshold_uncertainty_score":0.01230222},"labels":[],"label_agreement":null},{"id":"W2170897621","doi":"10.1155/s016117120431210x","title":"Hypersymmetric functions and Pochhammers of 2 × 2 nonautonomous matrices","year":2004,"lang":"en","type":"article","venue":"International Journal of Mathematics and Mathematical Sciences","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Mathematics; Pure mathematics; Applied mathematics","score_opus":0.016212572862202228,"score_gpt":0.26958056549746545,"score_spread":0.2533679926352632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170897621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2741297,0.0010633784,0.6726896,0.00051232753,0.00050378346,0.000096412,0.00024440658,0.00029748166,0.050463013],"genre_scores_gemma":[0.8636445,0.0010873893,0.11950955,0.0004184502,0.0004704051,0.00014937414,0.0001877664,0.00020804412,0.01432461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940705,0.0001508419,0.00002943105,0.000091271504,0.00016665908,0.00015476414],"domain_scores_gemma":[0.99918085,0.00026061892,0.0001549218,0.00013074158,0.00018646085,0.00008643049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006727929,0.0008333696,0.0003345244,0.0013087135,0.0006979037,0.0016767451,0.00060639787,0.0006651503,0.0049134004],"category_scores_gemma":[0.0023252082,0.00024071951,0.0004724069,0.00080187345,0.0019766046,0.0027734532,0.00075602025,0.00097058946,0.0016273847],"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.00001987609,0.000013297083,0.00013535772,0.000021015108,0.0000034649229,0.00015058427,0.00019143098,0.003419789,0.003392275,0.9787416,0.0008341709,0.0130770635],"study_design_scores_gemma":[0.000011576625,0.00007928325,0.0004942154,0.000017213591,0.000004146889,0.00038604817,0.00012856907,0.047814548,0.0042069345,0.9380767,0.008730961,0.0000498529],"about_ca_topic_score_codex":0.0005322757,"about_ca_topic_score_gemma":0.00037032765,"teacher_disagreement_score":0.0049134004,"about_ca_system_score_codex":0.00036850915,"about_ca_system_score_gemma":0.00046955445,"threshold_uncertainty_score":0.016436934},"labels":[],"label_agreement":null},{"id":"W2171106345","doi":"10.1016/j.jmaa.2005.06.040","title":"Convergence of the solution of a nonsymmetric matrix Riccati differential equation to its stable equilibrium solution","year":2005,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Riccati equation; Convergence (economics); Matrix (chemical analysis); Algebraic Riccati equation; Applied mathematics; Differential equation; Mathematical analysis","score_opus":0.018922689745634345,"score_gpt":0.27201267005613683,"score_spread":0.2530899803105025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171106345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35413823,0.00046021806,0.6095914,0.0017087762,0.00025821335,0.00020067145,0.000152027,0.00039695378,0.03309346],"genre_scores_gemma":[0.9450053,0.00039279557,0.037131116,0.0001841044,0.00006672972,0.00019099988,0.00020747875,0.00021704492,0.01660449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999577,0.00015039263,0.000017571809,0.00006855507,0.00011777781,0.000068762376],"domain_scores_gemma":[0.9946025,0.0030674776,0.00044915744,0.00017624443,0.0014058709,0.0002987923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016350959,0.0008900177,0.00073958,0.001104977,0.000980302,0.0015204353,0.00087309314,0.0012655244,0.0059220907],"category_scores_gemma":[0.0102128275,0.00042913665,0.0007614321,0.0004485635,0.002104315,0.0017046032,0.0019498699,0.0018112229,0.0006989707],"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.00057679735,0.0002716941,0.0035015473,0.00032393142,0.000124358,0.00059169024,0.0013557513,0.47131217,0.02693389,0.46176106,0.004533221,0.028713891],"study_design_scores_gemma":[0.00003023451,0.00011549546,0.0005040948,0.000022587705,0.000011647053,0.000097591495,0.0001849178,0.94058126,0.0027006103,0.05477599,0.00095296075,0.000022560427],"about_ca_topic_score_codex":0.004532499,"about_ca_topic_score_gemma":0.0020405971,"teacher_disagreement_score":0.0059220907,"about_ca_system_score_codex":0.0010010698,"about_ca_system_score_gemma":0.0019326509,"threshold_uncertainty_score":0.019811332},"labels":[],"label_agreement":null},{"id":"W2171197520","doi":"10.1002/0470094745.app2","title":"Appendix II: Matrix Algebra","year":2005,"lang":"en","type":"other","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"National Research Council Canada","funders":"","keywords":"Transpose; Subtraction; Algebra over a field; Mathematics; Matrix (chemical analysis); Inverse; Matrix multiplication; Pure mathematics; Arithmetic; Physics; Chemistry; Geometry","score_opus":0.007148185767451024,"score_gpt":0.24365527823979174,"score_spread":0.23650709247234072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171197520","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014208547,0.0051749446,0.29089683,0.004213247,0.01202835,0.0008366486,0.06611612,0.006177326,0.61313564],"genre_scores_gemma":[0.040006254,0.008205561,0.2878096,0.0046175984,0.008162953,0.0019857534,0.08335395,0.009043975,0.5568143],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99858934,0.00040575291,0.000109384215,0.00019616907,0.0006317868,0.00006755046],"domain_scores_gemma":[0.9941941,0.002025593,0.00017973602,0.00070017384,0.0027844089,0.00011597682],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010217484,0.0014707918,0.0010704634,0.0023094807,0.000829805,0.0018673696,0.00157713,0.00085510383,0.44010633],"category_scores_gemma":[0.011184643,0.0005290285,0.00084966206,0.0030900957,0.000610569,0.0023546035,0.0011272792,0.0020728793,0.25706446],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031844276,0.0000438822,0.00011363455,0.00038094967,0.000012399068,0.00006412165,0.00005343344,0.0010570835,0.0004588631,0.09547744,0.8459662,0.056340083],"study_design_scores_gemma":[0.000018239123,0.000023088161,0.00030069757,0.00015059019,0.000009383988,0.00024579413,0.00004183466,0.0019497301,0.000744792,0.090782516,0.9057047,0.000028685412],"about_ca_topic_score_codex":0.0028745134,"about_ca_topic_score_gemma":0.0023654003,"teacher_disagreement_score":0.44010633,"about_ca_system_score_codex":0.0010567628,"about_ca_system_score_gemma":0.0015530178,"threshold_uncertainty_score":0.79862034},"labels":[],"label_agreement":null},{"id":"W2172178367","doi":"10.1109/tmag.2010.2044023","title":"Multicore Acceleration of CG Algorithms Using Blocked-Pipeline-Matching Techniques","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"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":"Computer science; Multi-core processor; Parallel computing; Speedup; Acceleration; Pipeline (software); Kernel (algebra); Sparse matrix; Algorithm; Instruction set; Conjugate gradient method; Computational science; Mathematics","score_opus":0.02028227679712895,"score_gpt":0.27578056820860963,"score_spread":0.25549829141148067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172178367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031660147,0.00012142334,0.9604756,0.00014416863,0.00005790914,0.000058467725,0.000111565845,0.0034943654,0.0038763643],"genre_scores_gemma":[0.2810148,0.000113577364,0.71286297,0.00005921101,0.00001998933,0.00012309544,0.00033089356,0.00029777666,0.0051775863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975485,0.000040696807,0.0000121620815,0.000031721014,0.00011699591,0.000043525728],"domain_scores_gemma":[0.9995623,0.0001324586,0.000039941497,0.00009005669,0.00014348999,0.0000317179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003263219,0.00062538544,0.00037193764,0.0004173277,0.0003585983,0.00046620233,0.0010717084,0.00041484868,0.0053253234],"category_scores_gemma":[0.0011017423,0.00025568836,0.00038376052,0.0008585807,0.00025349547,0.00085341884,0.0006178531,0.0006071618,0.000929768],"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.0008828814,0.00039821956,0.0022337935,0.00028086422,0.00013640257,0.00025008997,0.0002784976,0.40569746,0.13744609,0.035199065,0.010916935,0.40627968],"study_design_scores_gemma":[0.000060055267,0.00009181716,0.0002557418,0.00000463412,0.000009880646,0.0000304988,0.000011967354,0.9687825,0.023134764,0.0037619623,0.003845831,0.000010371035],"about_ca_topic_score_codex":0.0080584455,"about_ca_topic_score_gemma":0.009545274,"teacher_disagreement_score":0.0080584455,"about_ca_system_score_codex":0.00062952243,"about_ca_system_score_gemma":0.0015648111,"threshold_uncertainty_score":0.017814934},"labels":[],"label_agreement":null},{"id":"W2180959024","doi":"10.1109/tmag.2010.2081662","title":"Enhancing the Performance of Conjugate Gradient Solvers on Graphic Processing Units","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Conjugate gradient method; Computer science; Conjugate; Parallel computing; Computational science; Matrix (chemical analysis); Algorithm; Mathematics; Materials science","score_opus":0.02388422119664639,"score_gpt":0.2120530118419275,"score_spread":0.18816879064528114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180959024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046058036,0.0007159803,0.9409506,0.00072472653,0.00019614943,0.00008462397,0.000054829325,0.0027447275,0.008470306],"genre_scores_gemma":[0.3471429,0.0006519871,0.64665216,0.000246919,0.00010004926,0.00013217163,0.00014591803,0.00079488114,0.0041329684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991335,0.00031809855,0.000036657097,0.00005311987,0.00036342378,0.000095149946],"domain_scores_gemma":[0.9973246,0.0016123854,0.0001375742,0.00032404222,0.0005217385,0.0000797143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010610749,0.0010021725,0.00080510596,0.0005793988,0.0005015229,0.0013474027,0.000994556,0.0010223819,0.003999657],"category_scores_gemma":[0.0086405985,0.0004362851,0.0004431485,0.001011846,0.000827028,0.0015799017,0.001281187,0.0015575872,0.0014812787],"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.001057371,0.0002106143,0.0030447145,0.0007843115,0.00012903806,0.00058564486,0.0005074653,0.50727785,0.0814083,0.07191195,0.014662892,0.31841996],"study_design_scores_gemma":[0.000031635715,0.000054830885,0.00020770244,0.000016822285,0.000009016609,0.000056387784,0.000018192106,0.97473145,0.016929723,0.0046433937,0.0032891505,0.000011627669],"about_ca_topic_score_codex":0.002755537,"about_ca_topic_score_gemma":0.003079608,"teacher_disagreement_score":0.003999657,"about_ca_system_score_codex":0.00046562587,"about_ca_system_score_gemma":0.0014073224,"threshold_uncertainty_score":0.01338017},"labels":[],"label_agreement":null},{"id":"W2184502091","doi":"10.4172/2329-6755.1000199","title":"Accelerating the GMRES Solver with Block ILU (K) Preconditioner on GPUs in Reservoir Simulation","year":2015,"lang":"en","type":"article","venue":"Journal of Geology & Geosciences","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":9,"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; Alberta Innovates - Technology Futures; CMG Reservoir Simulation Foundation; University of Calgary","keywords":"Preconditioner; Generalized minimal residual method; Solver; Parallel computing; Block (permutation group theory); Computer science; Computational science; Mathematics; Algorithm; Iterative method; Geometry; Programming language","score_opus":0.03913799224480729,"score_gpt":0.284931255499752,"score_spread":0.24579326325494472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184502091","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10947842,0.00088479556,0.88074416,0.0003956386,0.00009584075,0.000044682227,0.00008264518,0.0013907487,0.0068831197],"genre_scores_gemma":[0.50259805,0.0007698242,0.49211824,0.00008452502,0.00004305225,0.000089641275,0.00013698362,0.00032940233,0.0038301474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971384,0.00013504908,0.000013570449,0.000025554267,0.000082537874,0.00002941842],"domain_scores_gemma":[0.9996685,0.00016366228,0.000025600208,0.00004941294,0.00007341024,0.000019372948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003467083,0.00033701112,0.0004641524,0.00019795739,0.00033072638,0.0003845453,0.00043283383,0.0004350728,0.0010508116],"category_scores_gemma":[0.0014218878,0.00026045722,0.0003607458,0.00045949512,0.00041826523,0.0005285041,0.0006041924,0.00061499514,0.00035343823],"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.00022884783,0.00005887514,0.0018895043,0.00016377555,0.000060022667,0.0001950589,0.00024593994,0.85124296,0.028046973,0.020124173,0.0026866514,0.095057234],"study_design_scores_gemma":[0.000007528869,0.0000140968405,0.0001232189,0.0000032234816,0.000003409663,0.000011657316,0.000009860167,0.99494755,0.0026583113,0.0010854588,0.0011319565,0.00000367301],"about_ca_topic_score_codex":0.010872462,"about_ca_topic_score_gemma":0.007790677,"teacher_disagreement_score":0.010872462,"about_ca_system_score_codex":0.00032260563,"about_ca_system_score_gemma":0.0007252642,"threshold_uncertainty_score":0.021618366},"labels":[],"label_agreement":null},{"id":"W2185453861","doi":"10.1007/978-3-319-42432-3_34","title":"DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Heuristics; Jacobian matrix and determinant; Suite; Computer science; Software; Sparse matrix; Exploit; Algorithm; Sparse approximation; Graph; Theoretical computer science; Parallel computing; Programming language; Mathematics","score_opus":0.015376201355193046,"score_gpt":0.24697260672696203,"score_spread":0.23159640537176898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185453861","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015349494,0.00014747513,0.9019362,0.00006584309,0.00012401963,0.00006314665,0.0020281756,0.08728981,0.0068104267],"genre_scores_gemma":[0.03883519,0.00037611037,0.8871539,0.00020342195,0.00008449182,0.00039422905,0.008672734,0.04339177,0.020888077],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932945,0.00008323814,0.00006051258,0.000103701546,0.00036034675,0.00006278232],"domain_scores_gemma":[0.9986327,0.000596216,0.00007577521,0.00021061361,0.0004065879,0.00007808318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082709145,0.0016448825,0.0011574262,0.001550604,0.0008689016,0.0019023309,0.0032433465,0.001328016,0.098053865],"category_scores_gemma":[0.0046726945,0.0013256113,0.0013172288,0.0012926846,0.00047099972,0.0018550218,0.0024725928,0.002396203,0.036308747],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032351413,0.00014581784,0.0017966968,0.0017133281,0.00022659876,0.00070856867,0.0007397844,0.036069226,0.024392297,0.04671157,0.3103832,0.5767894],"study_design_scores_gemma":[0.00036292194,0.00010394804,0.0010144324,0.00025315816,0.00009555534,0.0011216046,0.00028121538,0.4777251,0.04685264,0.062296286,0.40969452,0.00019860856],"about_ca_topic_score_codex":0.0029778457,"about_ca_topic_score_gemma":0.007012861,"teacher_disagreement_score":0.098053865,"about_ca_system_score_codex":0.00041429757,"about_ca_system_score_gemma":0.0013254237,"threshold_uncertainty_score":0.3280229},"labels":[],"label_agreement":null},{"id":"W2197128032","doi":"10.1109/ipdps.2002.1016645","title":"Parallel algorithms for perturbed tridiagonal Toeplitz systems using projection methods","year":2002,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Tridiagonal matrix; Toeplitz matrix; Invertible matrix; Algorithm; Diagonally dominant matrix; Coefficient matrix; Projection (relational algebra); Mathematics; Linear system; Diagonal; Tridiagonal matrix algorithm; Matrix (chemical analysis); Levinson recursion; Band matrix; Positive-definite matrix; Applied mathematics; Oblique projection; Computer science; Symmetric matrix; Square matrix; Pure mathematics; Mathematical analysis; Orthographic projection; Geometry; Physics","score_opus":0.1048889420767621,"score_gpt":0.35183979952925554,"score_spread":0.24695085745249346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2197128032","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005037039,0.00009484985,0.993009,0.000060113452,0.000026567437,0.000041119503,0.000017853978,0.00078821473,0.0009253035],"genre_scores_gemma":[0.13026983,0.00022810984,0.8652165,0.00005421743,0.00004336894,0.00028126384,0.00015211993,0.00022653917,0.0035279403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993856,0.00016474912,0.000043368058,0.00009028763,0.00023700217,0.00007901756],"domain_scores_gemma":[0.99900407,0.0004398458,0.00007349134,0.00017644763,0.00024601768,0.00006012868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008403275,0.0011749443,0.0011124685,0.00048677062,0.0010062616,0.0011926743,0.0013559756,0.0008960668,0.0053095226],"category_scores_gemma":[0.0025723467,0.00061882514,0.00057834527,0.0009630944,0.00079874136,0.0017793722,0.0018282692,0.0016876446,0.001754116],"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.00032342403,0.00015436254,0.0004852346,0.0001672521,0.000095928364,0.00021214913,0.00030104574,0.7126155,0.011731983,0.05481851,0.004185358,0.21490927],"study_design_scores_gemma":[0.000033847973,0.000026035135,0.00003683797,0.0000044753206,0.00000541784,0.00003406598,0.000018671173,0.97760963,0.0027907742,0.018355316,0.0010770017,0.000007854274],"about_ca_topic_score_codex":0.004198237,"about_ca_topic_score_gemma":0.0049684625,"teacher_disagreement_score":0.0053095226,"about_ca_system_score_codex":0.0007529958,"about_ca_system_score_gemma":0.0013874308,"threshold_uncertainty_score":0.017762125},"labels":[],"label_agreement":null},{"id":"W2201697889","doi":"10.1109/ipdps.2002.1016651","title":"The improved BiCG method for large and sparse linear systems on parallel distributed memory architectures","year":2002,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Lanczos resampling; Computer science; Computation; Distributed memory; Lanczos algorithm; Massively parallel; Sparse matrix; Parallel computing; Algorithm; Matrix (chemical analysis); Numerical stability; Linear system; Stability (learning theory); Coefficient matrix; Shared memory; Mathematics; Numerical analysis; Eigenvalues and eigenvectors","score_opus":0.01940822842109863,"score_gpt":0.2640460853587109,"score_spread":0.24463785693761225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2201697889","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00556483,0.0007605249,0.9892924,0.00037516616,0.00016317377,0.00008267186,0.00008987057,0.0010465703,0.0026248256],"genre_scores_gemma":[0.057542834,0.00040111982,0.9375664,0.00020673081,0.000087934015,0.00021236436,0.00025489822,0.00025691703,0.0034708288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995771,0.00010948114,0.000011658447,0.000031048246,0.00023840652,0.000032252567],"domain_scores_gemma":[0.99974173,0.000052543688,0.000015524836,0.00005278406,0.00010637414,0.0000309787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044892714,0.00072633976,0.0009643918,0.00080968766,0.0004953895,0.00049489655,0.0013651274,0.0008868268,0.002120757],"category_scores_gemma":[0.0010187513,0.00029701597,0.0003755687,0.0011369463,0.00067282846,0.0005511096,0.0007328085,0.0012035605,0.0015671729],"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.00027474202,0.00012512795,0.0012828422,0.00059646554,0.000084312895,0.00036906626,0.0002813488,0.4292317,0.04358551,0.10057056,0.035657346,0.38794097],"study_design_scores_gemma":[0.000065713364,0.000048460923,0.00023945063,0.000016288262,0.000010181334,0.000095341034,0.000015777252,0.96463615,0.0037371567,0.011791384,0.019320177,0.000024012328],"about_ca_topic_score_codex":0.005128228,"about_ca_topic_score_gemma":0.005710803,"teacher_disagreement_score":0.005128228,"about_ca_system_score_codex":0.00041772274,"about_ca_system_score_gemma":0.0011888852,"threshold_uncertainty_score":0.010196745},"labels":[],"label_agreement":null},{"id":"W2202435936","doi":"10.1007/978-0-387-68276-1_19","title":"Matrix Factorizations, Compounds, Direct Products, and M-Matrices","year":2010,"lang":"en","type":"book-chapter","venue":"Springer series in statistics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Compendium; Exposition (narrative); De Bruijn sequence; Matrix exponential; Matrix (chemical analysis); Mathematics; Algebra over a field; Pure mathematics; Discrete mathematics; Philosophy; Linguistics; Art","score_opus":0.011714578638983054,"score_gpt":0.2432729343826606,"score_spread":0.23155835574367753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2202435936","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02101141,0.30472067,0.49184746,0.0052166167,0.0037305236,0.00006814546,0.0014690777,0.0008230643,0.17111301],"genre_scores_gemma":[0.34214047,0.14712349,0.3762365,0.0034545024,0.012519502,0.00037303008,0.00253555,0.0005857356,0.11503132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995789,0.0001152687,0.000024127507,0.00012719257,0.00012309458,0.000031474112],"domain_scores_gemma":[0.9991148,0.00052157004,0.00011959045,0.00011301742,0.00008874943,0.000042257958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006805232,0.0012241855,0.0011008909,0.0018102395,0.00094109355,0.0024676884,0.0009092985,0.0012918648,0.015168319],"category_scores_gemma":[0.0028818892,0.00053901604,0.0007358298,0.003519234,0.0025413297,0.004031446,0.00084964227,0.0019054227,0.0052834465],"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.0000370997,0.00003141316,0.00030016812,0.00049778697,0.000022284446,0.00010475498,0.00020723535,0.0023081412,0.00124944,0.8559563,0.043601934,0.09568332],"study_design_scores_gemma":[0.000005199273,0.000022230253,0.00019700764,0.0000486867,0.0000061825153,0.00031404724,0.000053205327,0.0032462599,0.00023222141,0.9544493,0.041408576,0.000017192498],"about_ca_topic_score_codex":0.0008234822,"about_ca_topic_score_gemma":0.0013230395,"teacher_disagreement_score":0.015168319,"about_ca_system_score_codex":0.00056712236,"about_ca_system_score_gemma":0.0006320272,"threshold_uncertainty_score":0.050743043},"labels":[],"label_agreement":null},{"id":"W2204415323","doi":"10.1007/978-3-0348-0037-2_4","title":"Some Not-quite-elementary Operators","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Operator (biology); Mathematics; Algebra over a field; Pure mathematics; Calculus (dental); Medicine; Chemistry","score_opus":0.022138197668108026,"score_gpt":0.22745103327698055,"score_spread":0.20531283560887253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2204415323","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004293102,0.017074145,0.17060085,0.0044286973,0.0035786137,0.000040409745,0.00029666035,0.00048189162,0.79920566],"genre_scores_gemma":[0.05139944,0.017864166,0.07124447,0.0017226737,0.0023079284,0.000114056944,0.00041708167,0.00063387887,0.8542962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997769,0.000038865885,0.00001015997,0.00003803086,0.00011362171,0.000022511897],"domain_scores_gemma":[0.99984396,0.00006249628,0.000004806225,0.000031987965,0.000044516688,0.000012354071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029859174,0.0008125741,0.00047362156,0.0007643222,0.0010688835,0.0019254871,0.0007521671,0.0007286199,0.02916942],"category_scores_gemma":[0.00072162715,0.00034409,0.0004677505,0.0014537452,0.002016809,0.00413735,0.00093837484,0.0025990065,0.010391692],"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.000004447178,0.000011215938,0.000013987563,0.00007344163,0.000002330427,0.000018667904,0.0001235705,0.00024276577,0.00046198483,0.9213851,0.036277138,0.04138532],"study_design_scores_gemma":[0.0000029859045,0.000005084856,0.0000474677,0.000047658756,0.0000027765893,0.00009336517,0.000049858856,0.0009100337,0.00047947446,0.760204,0.23814932,0.00000801213],"about_ca_topic_score_codex":0.000654633,"about_ca_topic_score_gemma":0.0013041171,"teacher_disagreement_score":0.02916942,"about_ca_system_score_codex":0.0008863355,"about_ca_system_score_gemma":0.00066304964,"threshold_uncertainty_score":0.09758139},"labels":[],"label_agreement":null},{"id":"W2209600785","doi":"10.1007/978-1-84882-231-3_7","title":"Illustrative Cases on PFT","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Paul's Hospital; Vancouver General Hospital; University of Toronto","funders":"","keywords":"Computer science","score_opus":0.027920042947884863,"score_gpt":0.24733720385982227,"score_spread":0.21941716091193741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2209600785","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021960378,0.0007495933,0.079655685,0.0032375779,0.0003507296,0.000055331802,0.00014827271,0.00020903801,0.89363337],"genre_scores_gemma":[0.6597006,0.0017233483,0.0677602,0.0008328955,0.00035716372,0.00014137127,0.00032397482,0.0003225493,0.26883787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996575,0.0001001241,0.000011623946,0.000034555305,0.000109911874,0.00008631378],"domain_scores_gemma":[0.9994037,0.00032766306,0.000032959844,0.000077469864,0.000081339,0.00007682492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036606798,0.0005009534,0.00035849083,0.0007740946,0.0015625412,0.0016706407,0.00074153807,0.0024355934,0.0374754],"category_scores_gemma":[0.0033527839,0.00021834529,0.0005195314,0.00131933,0.0016704942,0.0019960222,0.0013580557,0.0018477505,0.004240395],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004276755,0.000025620073,0.00015877196,0.00003577502,0.0000038930843,0.0026232728,0.00018297159,0.012362061,0.0003521835,0.9415349,0.018822094,0.023855692],"study_design_scores_gemma":[0.000021684556,0.00002120928,0.00019313859,0.000043471082,0.0000054203742,0.0028807453,0.000318774,0.028146664,0.00043243318,0.885052,0.08286921,0.000015203004],"about_ca_topic_score_codex":0.0028446012,"about_ca_topic_score_gemma":0.002596932,"teacher_disagreement_score":0.0374754,"about_ca_system_score_codex":0.00082898943,"about_ca_system_score_gemma":0.0004303402,"threshold_uncertainty_score":0.1253677},"labels":[],"label_agreement":null},{"id":"W2214287022","doi":"10.1016/j.laa.2015.11.024","title":"On algebraic Riccati equations associated with regular singular M-matrices","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algebraic Riccati equation; Riccati equation; Matrix (chemical analysis); Algebraic number; Algebraic equation; Product (mathematics); Rate of convergence; Convergence (economics); Pure mathematics; Applied mathematics; Mathematical analysis; Nonlinear system; Geometry; Differential equation","score_opus":0.019109801649020323,"score_gpt":0.24691413376712362,"score_spread":0.2278043321181033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2214287022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1975384,0.0027053743,0.72693896,0.0023308133,0.00053887005,0.000103203216,0.00036676164,0.00024302134,0.06923466],"genre_scores_gemma":[0.9106496,0.0025170457,0.056660894,0.0005740281,0.0008538531,0.00010485819,0.00048343034,0.00012432011,0.028031994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934334,0.00026543354,0.000032048938,0.00011287382,0.00017375962,0.000072512295],"domain_scores_gemma":[0.99819,0.0008868568,0.00038110057,0.00013262006,0.00027891315,0.00013046863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090396905,0.0011568756,0.0009006831,0.0015043634,0.00081439764,0.0015916063,0.0011088954,0.0011988048,0.0053174864],"category_scores_gemma":[0.0048081987,0.0004687296,0.00077520445,0.0018417394,0.0026584957,0.0026347747,0.0019133714,0.0018522965,0.0008376122],"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.000025743664,0.000030165353,0.00028153785,0.00006630858,0.000016368102,0.00016190874,0.0002197484,0.021417495,0.0011315305,0.96836275,0.0014272265,0.0068591298],"study_design_scores_gemma":[0.000013085839,0.000019809271,0.00016232058,0.000015728141,0.000006909808,0.00008426029,0.0000710129,0.11603567,0.00035534636,0.88187236,0.0013408195,0.0000226875],"about_ca_topic_score_codex":0.0025007974,"about_ca_topic_score_gemma":0.0025036715,"teacher_disagreement_score":0.0053174864,"about_ca_system_score_codex":0.0008657962,"about_ca_system_score_gemma":0.00069603295,"threshold_uncertainty_score":0.017788768},"labels":[],"label_agreement":null},{"id":"W2214637448","doi":"","title":"Some Progresses on Krylov Linear Solvers: Block-variants and Resiliency","year":2014,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Block (permutation group theory); Computational science; Parallel computing; Mathematics","score_opus":0.011623036848022251,"score_gpt":0.23538166630979163,"score_spread":0.2237586294617694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2214637448","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010051813,0.08794194,0.8424202,0.008707215,0.0034920853,0.000121232144,0.00046416698,0.0011620491,0.045639355],"genre_scores_gemma":[0.1920706,0.1440843,0.59806114,0.0052891774,0.014657077,0.00041317227,0.0022592414,0.0024321922,0.040733088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973738,0.0011375681,0.00017201151,0.00045027773,0.00069581607,0.00017046208],"domain_scores_gemma":[0.9945927,0.0031423902,0.00020342872,0.0011080799,0.0007267215,0.0002265923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004704727,0.0025005094,0.0016990304,0.0014574219,0.0007603811,0.0032229484,0.0021946274,0.0019939677,0.011216022],"category_scores_gemma":[0.014261668,0.0012790766,0.0015027964,0.0024810939,0.0030197806,0.0067815636,0.003802776,0.008523066,0.00494558],"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.00038898797,0.0002040266,0.00045078553,0.0016482281,0.00020284632,0.00010521035,0.0003295598,0.0556374,0.0030784102,0.54695445,0.04839552,0.34260443],"study_design_scores_gemma":[0.00012204201,0.00030911498,0.00037497777,0.00061819254,0.000113934155,0.00025643304,0.00012770307,0.24405605,0.004245043,0.6279616,0.121724896,0.00009012855],"about_ca_topic_score_codex":0.0010502232,"about_ca_topic_score_gemma":0.0009681765,"teacher_disagreement_score":0.011216022,"about_ca_system_score_codex":0.0008761299,"about_ca_system_score_gemma":0.001249854,"threshold_uncertainty_score":0.037521303},"labels":[],"label_agreement":null},{"id":"W2226918922","doi":"10.1017/cbo9780511810183.031","title":"Derivatives – notation","year":2010,"lang":"en","type":"other","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Trent University","funders":"","keywords":"Notation; Programming language; Computer science; Linguistics; Philosophy","score_opus":0.00829211080927724,"score_gpt":0.23869877934576325,"score_spread":0.230406668536486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2226918922","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050009936,0.012365014,0.47877356,0.0037440925,0.0059643737,0.000099621226,0.0064921877,0.0026872132,0.48487294],"genre_scores_gemma":[0.22931708,0.01769562,0.2746298,0.0043678586,0.006246608,0.0004898712,0.010496044,0.008701189,0.44805604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866486,0.00041749835,0.000117040225,0.00031884297,0.00040612216,0.000075659365],"domain_scores_gemma":[0.9984773,0.00035579837,0.00018144981,0.0004289976,0.00045655473,0.00009997729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016930769,0.0014949477,0.000807327,0.0022267788,0.0009781106,0.0030607367,0.0015583838,0.001023332,0.081105456],"category_scores_gemma":[0.0048513454,0.000391829,0.0009216623,0.0021065802,0.001641576,0.0048253024,0.0013867262,0.003039284,0.058203552],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036158086,0.00002243925,0.00016421457,0.00031608596,0.000020160254,0.000113028575,0.0001738963,0.0016900586,0.0016399522,0.80327874,0.1342083,0.058337014],"study_design_scores_gemma":[0.000010821707,0.00003757839,0.00028003362,0.00009341133,0.000015832993,0.00046968306,0.000062293875,0.006738893,0.0019157614,0.60223305,0.38810435,0.000038366325],"about_ca_topic_score_codex":0.0011613186,"about_ca_topic_score_gemma":0.001058753,"teacher_disagreement_score":0.081105456,"about_ca_system_score_codex":0.00079362886,"about_ca_system_score_gemma":0.0005937554,"threshold_uncertainty_score":0.27132475},"labels":[],"label_agreement":null},{"id":"W2241216108","doi":"10.4153/cjm-2017-041-8","title":"Nearly Approximate Transitivity (AT) for Circulant Matrices","year":2017,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Transitive relation; Ergodic theory; Circulant matrix; Dimension (graph theory); Isomorphism (crystallography)","score_opus":0.027187165575992104,"score_gpt":0.24925425982048507,"score_spread":0.22206709424449297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2241216108","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6896792,0.00023066782,0.27507436,0.00048044912,0.00008869837,0.00007716191,0.00022731264,0.00028316793,0.033859007],"genre_scores_gemma":[0.9834615,0.0000926163,0.0125041315,0.0001252802,0.000055309938,0.000043247812,0.00012270777,0.000047135447,0.0035479271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992138,0.00019023071,0.000049423543,0.0001756411,0.00021848614,0.00015245286],"domain_scores_gemma":[0.99717474,0.0010652288,0.0005182707,0.00052923866,0.00032541828,0.000387045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007175249,0.0003173387,0.00044343507,0.00094599754,0.0008575382,0.001686652,0.0004458967,0.0006465584,0.004405081],"category_scores_gemma":[0.004048406,0.00024162457,0.0006683124,0.00049133436,0.0022321683,0.0019433015,0.0011728889,0.0011382457,0.00045280764],"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.000041596646,0.000024284776,0.00057008496,0.0000201282,0.0000075677667,0.00015431509,0.00016077019,0.0034265239,0.0034132986,0.98873436,0.00041679895,0.0030303576],"study_design_scores_gemma":[0.000015371188,0.0000789882,0.00055981043,0.0000146157945,0.000009104592,0.00024659076,0.00009855445,0.057144478,0.0033068906,0.93674344,0.001758347,0.000023886554],"about_ca_topic_score_codex":0.0009168569,"about_ca_topic_score_gemma":0.00078015187,"teacher_disagreement_score":0.004405081,"about_ca_system_score_codex":0.00068449776,"about_ca_system_score_gemma":0.00046448282,"threshold_uncertainty_score":0.014736474},"labels":[],"label_agreement":null},{"id":"W2241526904","doi":"","title":"Characterization and Control in Large Hilbert spaces.","year":2008,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"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":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; Agricultural Research Development Agency; National Security Agency","keywords":"Characterization (materials science); Mathematics; Linguistics; Computer science; Philosophy; Materials science; Nanotechnology","score_opus":0.004941480198481271,"score_gpt":0.1797829488405956,"score_spread":0.1748414686421143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2241526904","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04868854,0.002583571,0.9148595,0.0036335625,0.00017140448,0.0000939039,0.00039567045,0.000156276,0.029417574],"genre_scores_gemma":[0.80645496,0.0021604442,0.17122443,0.000614093,0.00035536164,0.0003167311,0.00071589666,0.00013800626,0.018020183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984425,0.00054363714,0.00008307587,0.0002523354,0.0005355616,0.00014293543],"domain_scores_gemma":[0.9971558,0.0015167644,0.00032114008,0.00046621024,0.00037445631,0.0001656632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002048668,0.0005491522,0.0006134061,0.0009922893,0.0007502575,0.0023897374,0.0007767658,0.00090715935,0.0046327515],"category_scores_gemma":[0.006516264,0.0002933345,0.00061097887,0.0007669989,0.0040923175,0.0057067676,0.0017809727,0.002244072,0.0006999676],"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.000019124049,0.000021521379,0.00021382356,0.00006640263,0.000011656842,0.000019193278,0.00015382828,0.010380188,0.0012060616,0.9781943,0.0012925566,0.008421261],"study_design_scores_gemma":[0.0000067716896,0.000018366225,0.00013484572,0.00001610493,0.0000027877122,0.00002482529,0.000051880477,0.08455702,0.0007784065,0.911944,0.0024564213,0.000008693222],"about_ca_topic_score_codex":0.0010588983,"about_ca_topic_score_gemma":0.0008097872,"teacher_disagreement_score":0.0046327515,"about_ca_system_score_codex":0.0012849628,"about_ca_system_score_gemma":0.0010144163,"threshold_uncertainty_score":0.015498042},"labels":[],"label_agreement":null},{"id":"W2244294681","doi":"10.1007/978-3-662-44199-2_73","title":"Computing Moore-Penrose Inverses of Ore Polynomial Matrices","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Maple; Quaternion; Polynomial; Moore–Penrose pseudoinverse; Inverse; Computation; Algebra over a field; Computer science; Symbolic computation; Algorithm; Mathematics; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.011679567542008306,"score_gpt":0.2356570233112701,"score_spread":0.22397745576926179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244294681","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09598957,0.0004454486,0.87972414,0.00030935262,0.00021258979,0.000054815442,0.00047656812,0.0016970738,0.021090355],"genre_scores_gemma":[0.54710495,0.0005934065,0.4284887,0.00019869076,0.00025579956,0.000064944164,0.0018757428,0.0006784834,0.020739289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999015,0.00014617514,0.00006417959,0.00022734987,0.0004077506,0.00013950124],"domain_scores_gemma":[0.99791056,0.0008389419,0.00016312116,0.0005165927,0.00043990836,0.00013082454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006590962,0.000851872,0.00088815397,0.0009151463,0.0005446336,0.0021609038,0.001184957,0.0007842417,0.012453037],"category_scores_gemma":[0.006095421,0.0005159793,0.00080004014,0.0012540587,0.0010561901,0.004806807,0.0020021237,0.0017901865,0.0038605148],"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.0007021946,0.00025999284,0.0024043778,0.00042891884,0.00008672852,0.00038606397,0.00054994045,0.062356114,0.023587245,0.45924854,0.016595373,0.4333945],"study_design_scores_gemma":[0.00005419942,0.0001916218,0.0007890644,0.00006924672,0.000028611137,0.00050119194,0.00026428507,0.22251715,0.022985088,0.73969305,0.012847465,0.000059031812],"about_ca_topic_score_codex":0.00065459864,"about_ca_topic_score_gemma":0.0017666977,"teacher_disagreement_score":0.012453037,"about_ca_system_score_codex":0.00046844932,"about_ca_system_score_gemma":0.00059370504,"threshold_uncertainty_score":0.041659594},"labels":[],"label_agreement":null},{"id":"W2255188617","doi":"10.48550/arxiv.1407.0671","title":"Optimal rates of convergence of matrices with applications","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Linear subspace; Rate of convergence; Eigenvalues and eigenvectors; Characterization (materials science); Convergence (economics); Projection (relational algebra); Intersection (aeronautics); Mathematics; Applied mathematics; Compact convergence; Modes of convergence (annotated index); Projection method; Normal convergence; Mathematical optimization; Computer science; Algorithm; Pure mathematics; Dykstra's projection algorithm","score_opus":0.033598851516764415,"score_gpt":0.1924748976258742,"score_spread":0.15887604610910977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255188617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08995549,0.0023762905,0.88309664,0.0009369621,0.0001999225,0.0002046286,0.00012115393,0.00042303337,0.022685856],"genre_scores_gemma":[0.7617733,0.00272078,0.2220085,0.00034805542,0.00032682737,0.00068871875,0.00022075538,0.0007744249,0.011138634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951277,0.0026350357,0.00026244583,0.00057500397,0.0009347747,0.0004650409],"domain_scores_gemma":[0.97241795,0.01751515,0.001983924,0.0026081349,0.0043818103,0.0010931096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009436936,0.0019052649,0.0010746261,0.002299725,0.00091463287,0.00254828,0.0018082357,0.0014470897,0.006400021],"category_scores_gemma":[0.07091821,0.0008431898,0.0009185362,0.001136471,0.0033597082,0.005064554,0.003727404,0.0028713166,0.0015669096],"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.00039395673,0.00010983737,0.0014122603,0.00048054438,0.00006270364,0.00018719172,0.0005185963,0.18128994,0.012183749,0.75886774,0.0033940538,0.041099496],"study_design_scores_gemma":[0.000043983135,0.00020511301,0.00034424243,0.00016944134,0.000023839419,0.00019338373,0.00016836516,0.7535368,0.012620653,0.22936621,0.0032812012,0.000046646033],"about_ca_topic_score_codex":0.00050566404,"about_ca_topic_score_gemma":0.00038980893,"teacher_disagreement_score":0.009436936,"about_ca_system_score_codex":0.0015005935,"about_ca_system_score_gemma":0.0014319031,"threshold_uncertainty_score":0.049907863},"labels":[],"label_agreement":null},{"id":"W2255776716","doi":"10.14288/1.0080636","title":"Linear transformations on matrices.","year":2012,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.008807685101720367,"score_gpt":0.1817372871956211,"score_spread":0.17292960209390074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255776716","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082252674,0.015471718,0.42733526,0.0062112855,0.0045708525,0.00014868431,0.00043242768,0.00041520936,0.46316183],"genre_scores_gemma":[0.7116966,0.010237435,0.09089443,0.0024903256,0.00502757,0.00020314369,0.0006687511,0.0003080791,0.1784736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992126,0.00020459849,0.00004346849,0.00015989984,0.00028237473,0.000096915726],"domain_scores_gemma":[0.9992879,0.00022673763,0.00012073959,0.00012502239,0.00017699887,0.000062509374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078639545,0.00066600187,0.00029466764,0.00085411075,0.0011188282,0.0019975558,0.0005746843,0.0006649769,0.009526984],"category_scores_gemma":[0.001639973,0.00023374993,0.00080518314,0.0007221503,0.003001812,0.0033972466,0.0012158151,0.0017535859,0.003291997],"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.0000062650797,0.0000073983697,0.00004766292,0.000032531138,0.0000028978154,0.000036670044,0.00024958633,0.00023552154,0.0007928649,0.98944,0.0015312085,0.007617273],"study_design_scores_gemma":[0.0000032167259,0.00003949604,0.000103605766,0.00001680776,0.000003118358,0.00016615771,0.00011373638,0.0015686194,0.0009970461,0.9634676,0.033512507,0.000008070669],"about_ca_topic_score_codex":0.0006143768,"about_ca_topic_score_gemma":0.0004432068,"teacher_disagreement_score":0.009526984,"about_ca_system_score_codex":0.000797721,"about_ca_system_score_gemma":0.0005046841,"threshold_uncertainty_score":0.03187096},"labels":[],"label_agreement":null},{"id":"W2255863952","doi":"10.1016/j.laa.2016.02.004","title":"Spectral characterization of matchings in graphs","year":2016,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Skew; Matching (statistics); Characterization (materials science); Graph; Cograph; Rank (graph theory); Discrete mathematics; Line graph; Pathwidth","score_opus":0.0071874500983275524,"score_gpt":0.2240534489991379,"score_spread":0.21686599890081035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255863952","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4786089,0.00085018727,0.46205023,0.0021751346,0.00023236322,0.000092641654,0.000957798,0.0007113726,0.05432129],"genre_scores_gemma":[0.9641083,0.00042971913,0.022711327,0.0003486845,0.00041343897,0.000076059056,0.00073925493,0.00018090375,0.010992336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989184,0.00028401686,0.000060711576,0.0002775093,0.0002643816,0.00019495074],"domain_scores_gemma":[0.9956435,0.0020243353,0.0007498539,0.00034616573,0.0006070174,0.0006292089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009742624,0.00071988895,0.0007949054,0.0044791983,0.0014190145,0.0031384977,0.0016244999,0.001305509,0.009601209],"category_scores_gemma":[0.00568512,0.00051433116,0.00069805706,0.0027265511,0.002269323,0.00496878,0.0018575214,0.0016789152,0.0013308846],"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.000088271605,0.00007881422,0.000678443,0.00006509888,0.000011055559,0.000048228132,0.0003046653,0.0028820534,0.0034658287,0.97851104,0.0020531467,0.011813286],"study_design_scores_gemma":[0.000011164743,0.000023586112,0.00041827784,0.00002174171,0.000009092215,0.00010224238,0.00018683018,0.030793156,0.0012400287,0.9651411,0.002037335,0.000015409256],"about_ca_topic_score_codex":0.0007218262,"about_ca_topic_score_gemma":0.0006344652,"teacher_disagreement_score":0.009601209,"about_ca_system_score_codex":0.0010838149,"about_ca_system_score_gemma":0.0005105527,"threshold_uncertainty_score":0.032119215},"labels":[],"label_agreement":null},{"id":"W2265069555","doi":"10.1093/imanum/drw070","title":"On the use of Hahn’s asymptotic formula and stabilized recurrence for a fast, simple and stable Chebyshev–Jacobi transform","year":2016,"lang":"en","type":"preprint","venue":"IMA Journal of Numerical Analysis","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Orthogonality; Jacobi polynomials; Simple (philosophy); Chebyshev iteration; Chebyshev polynomials; Chebyshev equation; Inverse; Mathematical analysis; Chebyshev filter; Applied mathematics; Stability (learning theory); Orthogonal polynomials; Classical orthogonal polynomials; Geometry; Computer science","score_opus":0.03401247439919128,"score_gpt":0.2749202900337683,"score_spread":0.240907815634577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2265069555","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012684666,0.00036648486,0.97900635,0.00016633424,0.00009208971,0.000034178607,0.00001654121,0.0001916684,0.00744167],"genre_scores_gemma":[0.35907722,0.0008412287,0.6284703,0.00027713727,0.00023782837,0.00018256318,0.000089268266,0.00045773791,0.0103666885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994375,0.00017888677,0.00003025063,0.0000646029,0.00024967364,0.000039050687],"domain_scores_gemma":[0.9992306,0.00034518683,0.00006646857,0.00011177613,0.00020806414,0.00003789744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011171678,0.0005932554,0.00048103143,0.001140502,0.0004402171,0.00086136267,0.0007248907,0.00062898657,0.0021886546],"category_scores_gemma":[0.004157154,0.00022510128,0.0006652181,0.0007185373,0.0013586702,0.0012094888,0.0007858228,0.0014176368,0.0009609131],"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.0000600924,0.000046665322,0.00038326572,0.00007900368,0.000016215812,0.00016022209,0.00022331571,0.05372434,0.026845515,0.8376202,0.0018141628,0.079027064],"study_design_scores_gemma":[0.000016790844,0.00005944747,0.000188899,0.000030050214,0.000010800037,0.0001803171,0.000026684402,0.84639496,0.0108402865,0.13505267,0.007162792,0.000036387435],"about_ca_topic_score_codex":0.0010814195,"about_ca_topic_score_gemma":0.0011739597,"teacher_disagreement_score":0.0021886546,"about_ca_system_score_codex":0.0006886563,"about_ca_system_score_gemma":0.0007026862,"threshold_uncertainty_score":0.007321775},"labels":[],"label_agreement":null},{"id":"W2267098731","doi":"10.1016/j.aml.2015.10.008","title":"New applications of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>M</mml:mi></mml:math>-matrix methods to stability of high-order linear delayed equations","year":2015,"lang":"en","type":"article","venue":"Applied Mathematics Letters","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":"Vancouver Island University","funders":"Secretaría de Ciencia y Técnica, Universidad de Buenos Aires; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Stability (learning theory); Matrix (chemical analysis); Algorithm; Scroll; Linear multistep method; Applied mathematics; Computer science; Machine learning; Mathematical analysis; Theology","score_opus":0.024007854784698364,"score_gpt":0.28309119015707557,"score_spread":0.2590833353723772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2267098731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063461764,0.007503494,0.9453509,0.0034272638,0.0014523951,0.000040125135,0.00013050543,0.00056579337,0.035183407],"genre_scores_gemma":[0.22173549,0.017016832,0.67193246,0.0012035376,0.0035173835,0.00019765092,0.0005533847,0.000855009,0.08298826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995925,0.00012594872,0.000031752483,0.000074739015,0.00015566689,0.000019528436],"domain_scores_gemma":[0.9986279,0.0007589342,0.00007615613,0.00016398443,0.00027099266,0.00010202058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090388936,0.00077444024,0.00047847963,0.0009427009,0.00042728998,0.0012339102,0.000851697,0.0009728864,0.014000052],"category_scores_gemma":[0.0029921047,0.00029608977,0.0007248012,0.0007190535,0.0009067817,0.0017676668,0.0013440236,0.0022865138,0.0027161941],"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.00008960741,0.00011089315,0.00091497676,0.00051461946,0.00006787366,0.0002515472,0.00031549874,0.057651702,0.020732066,0.6425047,0.03272123,0.24412535],"study_design_scores_gemma":[0.000032062526,0.00006601913,0.0005323916,0.00012176766,0.00001976668,0.0003618335,0.00006437722,0.49003607,0.0068726796,0.41266334,0.08917946,0.000050145114],"about_ca_topic_score_codex":0.00091263937,"about_ca_topic_score_gemma":0.0014492901,"teacher_disagreement_score":0.014000052,"about_ca_system_score_codex":0.00080693787,"about_ca_system_score_gemma":0.00053998455,"threshold_uncertainty_score":0.046834886},"labels":[],"label_agreement":null},{"id":"W2267541717","doi":"10.2139/ssrn.2493844","title":"Correlation Matrices with the Perron-Frobenius Property","year":2014,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; McMaster University; University of Waterloo","funders":"","keywords":"Correlation; Property (philosophy); Mathematics; Statistical physics; Mathematical economics; Applied mathematics; Physics; Philosophy; Geometry","score_opus":0.004015522653320404,"score_gpt":0.19267000427029016,"score_spread":0.18865448161696977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2267541717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04916766,0.0008066783,0.9118962,0.0013210851,0.00030066076,0.000081685415,0.00045258668,0.00043478844,0.035538603],"genre_scores_gemma":[0.82046753,0.0015289288,0.13657573,0.0013287504,0.00086154277,0.0003322798,0.00079169916,0.0003296833,0.037783887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984988,0.0004617482,0.000052223193,0.00030030773,0.00048665534,0.00020029968],"domain_scores_gemma":[0.99505144,0.0020688483,0.00076856115,0.0009056144,0.0008604477,0.0003451094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020503104,0.0009757566,0.00093689276,0.0017078106,0.0009288542,0.0019414286,0.0012211633,0.0021491947,0.008631687],"category_scores_gemma":[0.012706875,0.00050203945,0.0006741668,0.0017631734,0.0020587505,0.0035715185,0.0019211309,0.0022809827,0.0028197207],"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.00006747945,0.000026036992,0.00035772115,0.00006827865,0.000023204648,0.00016079024,0.000090881316,0.00539612,0.0019433914,0.97330135,0.003568996,0.014995763],"study_design_scores_gemma":[0.000028033272,0.00005308013,0.0005438498,0.000033277953,0.000013209993,0.0005754309,0.00004099704,0.06099233,0.0019593423,0.93094605,0.0047634435,0.000050876803],"about_ca_topic_score_codex":0.0006409532,"about_ca_topic_score_gemma":0.0006669505,"teacher_disagreement_score":0.008631687,"about_ca_system_score_codex":0.00044939594,"about_ca_system_score_gemma":0.0012088876,"threshold_uncertainty_score":0.028875828},"labels":[],"label_agreement":null},{"id":"W2270649826","doi":"","title":"Condition number for weighted linear least squares problem","year":2007,"lang":"en","type":"article","venue":"Journal of Computational Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Toronto Metropolitan University","funders":"","keywords":"Mathematics; Least-squares function approximation; Applied mathematics; Statistics","score_opus":0.015133027062327494,"score_gpt":0.299214495278453,"score_spread":0.2840814682161255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2270649826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020057322,0.00058771315,0.96907985,0.0015151801,0.0002996498,0.000080965394,0.00041390973,0.00023755986,0.0077279047],"genre_scores_gemma":[0.52939916,0.002481665,0.4449987,0.0008400196,0.0009889397,0.0012266131,0.002438859,0.0006614189,0.016964586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968054,0.0011703223,0.00012802797,0.0005644699,0.0010694327,0.00026239338],"domain_scores_gemma":[0.9731785,0.021714147,0.0011564966,0.0008736385,0.002427717,0.0006494978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037781133,0.0012984124,0.0013848263,0.0011908659,0.00085455365,0.0023162873,0.002285919,0.002135843,0.015309891],"category_scores_gemma":[0.03741645,0.0005156698,0.0004425048,0.0018693702,0.0021638481,0.0051858886,0.001925005,0.003282629,0.0017062073],"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.0008550389,0.00017297622,0.0017403064,0.0011822503,0.00008777167,0.00036968902,0.00023358014,0.27568373,0.009778568,0.564819,0.030362086,0.114715055],"study_design_scores_gemma":[0.000058993126,0.00008353916,0.00037775605,0.00005544545,0.00001580685,0.00009584986,0.00004377417,0.7166033,0.0017312088,0.279079,0.0018167697,0.000038617527],"about_ca_topic_score_codex":0.0018058281,"about_ca_topic_score_gemma":0.0013378081,"teacher_disagreement_score":0.015309891,"about_ca_system_score_codex":0.0011318156,"about_ca_system_score_gemma":0.0022638687,"threshold_uncertainty_score":0.05121672},"labels":[],"label_agreement":null},{"id":"W2274422857","doi":"10.1080/10236190410001658959","title":"Analytic Evaluation of Factorial Polynomials for Nonautonomous Matrices","year":2004,"lang":"en","type":"article","venue":"The Journal of Difference Equations and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"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; Factorial; Variable (mathematics); Applied mathematics; Factorial experiment; Orthogonal polynomials; Pure mathematics; Difference polynomials; Algebra over a field; Mathematical analysis; Statistics","score_opus":0.038562782673235804,"score_gpt":0.30761653946532586,"score_spread":0.26905375679209004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274422857","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04467661,0.00019240323,0.9439281,0.00015627005,0.00007453168,0.000043077624,0.00004500083,0.00017241109,0.010711519],"genre_scores_gemma":[0.57611036,0.00063220225,0.40942338,0.0001578445,0.00009176676,0.00016821698,0.00010991718,0.0003671687,0.012939173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933356,0.00019150958,0.00003292508,0.000078719146,0.000276671,0.00008667748],"domain_scores_gemma":[0.99836844,0.00094759854,0.00016748792,0.0001362805,0.00028370647,0.00009648172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014626781,0.00087683345,0.0008800208,0.0014554745,0.0006353623,0.0015962373,0.0013759218,0.0009488297,0.0052330843],"category_scores_gemma":[0.0069077923,0.00044278835,0.000776563,0.00077601825,0.0016819175,0.0020222564,0.0012043322,0.0013219197,0.0008265069],"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.000026649543,0.00003643874,0.00030175276,0.0001137603,0.000014935985,0.00026627505,0.00026567237,0.061440617,0.009564634,0.9110221,0.00054287584,0.016404113],"study_design_scores_gemma":[0.000017759583,0.000034396246,0.00018777394,0.00003258895,0.000011883737,0.00016037401,0.00007686519,0.6769721,0.005413834,0.31433716,0.0027098125,0.000045485824],"about_ca_topic_score_codex":0.0017544525,"about_ca_topic_score_gemma":0.0028184648,"teacher_disagreement_score":0.0052330843,"about_ca_system_score_codex":0.0012025681,"about_ca_system_score_gemma":0.0010221516,"threshold_uncertainty_score":0.01750642},"labels":[],"label_agreement":null},{"id":"W2279397665","doi":"10.1109/hipc.2015.38","title":"A GPU-Based MIS Aggregation Strategy: Algorithms, Comparisons, and Applications within AMG","year":2015,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"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":"National Institute of General Medical Sciences; Ministry of Economy, Trade and Industry; National Science Foundation","keywords":"Preconditioner; Krylov subspace; Conjugate gradient method; Computer science; Algorithm; Partition (number theory); Solver; Linear system; Conjugate residual method; Subspace topology; Multigrid method; Iterative method; Mathematics","score_opus":0.03529884505046818,"score_gpt":0.2741068992079887,"score_spread":0.23880805415752052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279397665","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15527946,0.0011940037,0.8254234,0.00077827275,0.00026015277,0.00022382896,0.0003199662,0.004060162,0.0124607505],"genre_scores_gemma":[0.47997501,0.00046552857,0.51667625,0.00009767226,0.00005174123,0.00014760708,0.0004365977,0.00041416776,0.0017353809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992387,0.00022942136,0.00004339623,0.00007716334,0.00035158373,0.000059687063],"domain_scores_gemma":[0.9984067,0.0005190447,0.000101272286,0.00040614055,0.00047855824,0.00008824007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008936538,0.0008068933,0.00083009887,0.0012205965,0.00059069914,0.0012072478,0.00090072636,0.00096069736,0.0018122472],"category_scores_gemma":[0.004500289,0.00024485908,0.00039742558,0.0020623147,0.00054023037,0.0013070325,0.0010927806,0.00082273595,0.00043545972],"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.0005772235,0.00023149198,0.004796218,0.00028019375,0.00009527271,0.00015552333,0.0002210955,0.6425289,0.017766558,0.026811056,0.005023422,0.3015131],"study_design_scores_gemma":[0.000021364951,0.00006000086,0.00058580155,0.000008337197,0.0000068226664,0.0000328127,0.00003059495,0.9889481,0.0056973095,0.00285846,0.0017393868,0.00001097119],"about_ca_topic_score_codex":0.0064814063,"about_ca_topic_score_gemma":0.0063877907,"teacher_disagreement_score":0.0064814063,"about_ca_system_score_codex":0.00080733665,"about_ca_system_score_gemma":0.0008308245,"threshold_uncertainty_score":0.012887359},"labels":[],"label_agreement":null},{"id":"W2287475882","doi":"10.1007/s11075-015-0085-4","title":"Optimal Rates of Linear Convergence of Relaxed Alternating Projections and Generalized Douglas-Rachford Methods for Two Subspaces","year":2015,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Linear subspace; Rate of convergence; Mathematics; Projection (relational algebra); Eigenvalues and eigenvectors; Theory of computation; Convergence (economics); Applied mathematics; Nonlinear system; Projection method; Intersection (aeronautics); Matrix (chemical analysis); Dykstra's projection algorithm; Mathematical optimization; Algorithm; Pure mathematics; Computer science","score_opus":0.06371311389702866,"score_gpt":0.39677105204245355,"score_spread":0.3330579381454249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287475882","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025714288,0.0014629737,0.9646516,0.0009957702,0.00022945991,0.00014024635,0.00011898696,0.00029472986,0.006391978],"genre_scores_gemma":[0.3536458,0.0019746877,0.6291881,0.0006428455,0.00039902513,0.0010921205,0.0004356679,0.0010028766,0.011618773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99258065,0.005106994,0.00029831432,0.00046414245,0.0010818732,0.000468086],"domain_scores_gemma":[0.9527837,0.036678243,0.001792425,0.0027937696,0.004174229,0.0017776005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019010352,0.0031697508,0.0018795738,0.002214816,0.0013763326,0.0035380947,0.0037799843,0.004220625,0.0065803854],"category_scores_gemma":[0.074877754,0.0015708706,0.0016934557,0.001979583,0.0062968293,0.0071101766,0.007594264,0.0061422503,0.001321449],"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.0012386988,0.00019488703,0.0010068341,0.00086259644,0.00013242773,0.00012847067,0.0008001527,0.31818643,0.0041638906,0.61390644,0.00489778,0.054481395],"study_design_scores_gemma":[0.0000760261,0.00012820153,0.00020693884,0.00012266381,0.000031220843,0.000069999136,0.00012514435,0.88295186,0.0028927855,0.11196343,0.0013713735,0.00006039524],"about_ca_topic_score_codex":0.002575047,"about_ca_topic_score_gemma":0.0023464542,"teacher_disagreement_score":0.019010352,"about_ca_system_score_codex":0.002394152,"about_ca_system_score_gemma":0.0039436966,"threshold_uncertainty_score":0.10053754},"labels":[],"label_agreement":null},{"id":"W2290543689","doi":"10.1007/s11854-016-0013-0","title":"Spectral (isotropic) manifolds and their dimension","year":2016,"lang":"en","type":"article","venue":"Journal d Analyse Mathématique","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Dimension (graph theory); Mathematics; Isotropy; Manifold (fluid mechanics); Pure mathematics; Eigenvalues and eigenvectors; Mathematical analysis; Combinatorics; Physics; Quantum mechanics","score_opus":0.00897846643257903,"score_gpt":0.2255209050776431,"score_spread":0.2165424386450641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290543689","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9076639,0.0014319081,0.034835976,0.0018849218,0.0001968195,0.000020031888,0.00041156975,0.00012592004,0.053428918],"genre_scores_gemma":[0.9905599,0.0005146168,0.003512757,0.00009328977,0.00019699932,0.00002278589,0.00013674717,0.000025380668,0.004937516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995995,0.000091082286,0.000020372843,0.00007405248,0.00012632961,0.00008872451],"domain_scores_gemma":[0.9975442,0.0010219819,0.0004582558,0.00015477354,0.00032449956,0.0004961485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068310095,0.00042214713,0.00039378254,0.0037584284,0.0012107032,0.003004066,0.0005959259,0.00081663806,0.006292871],"category_scores_gemma":[0.0033498902,0.00033939173,0.00029397564,0.0011644923,0.003064502,0.0032114568,0.0019058888,0.0010994467,0.00051480863],"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.000036102163,0.000013439323,0.0012398869,0.000024680587,0.00000904128,0.00004484147,0.00033874824,0.0008894104,0.000890611,0.9911584,0.0012075464,0.004147257],"study_design_scores_gemma":[0.000010573862,0.000021895597,0.0029916463,0.000017919698,0.000011362916,0.00019208013,0.00029474357,0.00680109,0.00043467135,0.9863302,0.0028771616,0.000016564794],"about_ca_topic_score_codex":0.00047067384,"about_ca_topic_score_gemma":0.0005215637,"teacher_disagreement_score":0.006292871,"about_ca_system_score_codex":0.00068062014,"about_ca_system_score_gemma":0.0003150492,"threshold_uncertainty_score":0.021051764},"labels":[],"label_agreement":null},{"id":"W2293453699","doi":"","title":"On Numerical Resiliency in Numerical Linear Algebra Solvers","year":2015,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Université de Sherbrooke","funders":"","keywords":"Krylov subspace; Computer science; Interpolation (computer graphics); Conjugate gradient method; Linear algebra; Numerical analysis; Numerical linear algebra; Class (philosophy); Algorithm; Fault (geology); Linear system; Subspace topology; Theoretical computer science; Computational science; Iterative method; Mathematics; Artificial intelligence","score_opus":0.014666923277205708,"score_gpt":0.24515315331733079,"score_spread":0.23048623004012508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293453699","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03998142,0.006039758,0.904586,0.009023543,0.0020382085,0.0002926825,0.00034740302,0.0029905147,0.03470035],"genre_scores_gemma":[0.7845247,0.004349086,0.18204446,0.003073373,0.002651336,0.0006800754,0.0007550295,0.0019764246,0.019945493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9882718,0.005976447,0.0006490779,0.0012233874,0.002907434,0.0009718449],"domain_scores_gemma":[0.94323695,0.037175737,0.0023929924,0.012442097,0.0035528638,0.0011993197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011178674,0.0020829737,0.0022693595,0.0029551985,0.002432686,0.0036436403,0.0028083378,0.002194266,0.012656145],"category_scores_gemma":[0.08524733,0.0011195351,0.0016421066,0.0027287095,0.0068958164,0.008212358,0.010472791,0.007219758,0.00248072],"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.0015638457,0.0002931738,0.0030725754,0.00086069404,0.00022022557,0.00023043934,0.0006054907,0.2528034,0.004427122,0.5670817,0.022636317,0.14620504],"study_design_scores_gemma":[0.0000575284,0.00012119834,0.00033259086,0.00012897461,0.000056908786,0.000098089986,0.00009200555,0.507218,0.0031445303,0.48226067,0.0064614676,0.000028032771],"about_ca_topic_score_codex":0.001203055,"about_ca_topic_score_gemma":0.00106875,"teacher_disagreement_score":0.012656145,"about_ca_system_score_codex":0.0017279306,"about_ca_system_score_gemma":0.0020770016,"threshold_uncertainty_score":0.059119165},"labels":[],"label_agreement":null},{"id":"W2303412700","doi":"10.1007/s00220-017-2856-3","title":"The Kontsevich Matrix Integral: Convergence to the Painlevé Hierarchy and Stokes’ Phenomenon","year":2017,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Concordia University; Université du Québec à Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Matrix (chemical analysis); Ramanujan tau function; Convergence (economics); Hierarchy; Limit (mathematics); Space (punctuation); Nonlinear system; Function (biology); Complex system","score_opus":0.046401315434595546,"score_gpt":0.34658514569113164,"score_spread":0.3001838302565361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2303412700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28408924,0.008751576,0.45211673,0.016851984,0.0014839108,0.00006738516,0.00022791715,0.00047900196,0.23593223],"genre_scores_gemma":[0.93525064,0.0025646999,0.031120626,0.0010339575,0.00139697,0.00006891305,0.000115681585,0.00022192008,0.028226588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993735,0.00021582944,0.00002265853,0.000083838284,0.00020214943,0.00010204875],"domain_scores_gemma":[0.9978042,0.0010330403,0.00021392085,0.0001604404,0.00041642052,0.00037199282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016745308,0.00067082053,0.00089186954,0.0024179916,0.0016973377,0.002912634,0.0013451582,0.0018262237,0.005912083],"category_scores_gemma":[0.009593138,0.0004203069,0.00070749945,0.0011517577,0.0043843486,0.006058674,0.0029332358,0.003336124,0.00078456395],"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.000008438578,0.0000066745674,0.000064961525,0.000017865084,0.0000027236313,0.00002745298,0.000082239596,0.0007315672,0.0003354833,0.9965411,0.00069403107,0.001487487],"study_design_scores_gemma":[0.0000050001863,0.000004054425,0.00008688549,0.0000091084,0.0000017151037,0.00005118868,0.0000296847,0.014852036,0.00012655153,0.983943,0.0008845183,0.000006196255],"about_ca_topic_score_codex":0.0016636321,"about_ca_topic_score_gemma":0.0010028076,"teacher_disagreement_score":0.005912083,"about_ca_system_score_codex":0.0018479616,"about_ca_system_score_gemma":0.0012086492,"threshold_uncertainty_score":0.019777954},"labels":[],"label_agreement":null},{"id":"W2320769111","doi":"10.4153/cmb-2003-041-9","title":"Approximating Positive Polynomials Using Sums of Squares","year":2003,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Quadratic equation; Variety (cybernetics); Algebraic number; Algebra over a field; Space (punctuation); Context (archaeology); Emphasis (telecommunications); Moment (physics); Quadratic function; Pure mathematics; Mathematical analysis; Statistics; Computer science","score_opus":0.015539796875884786,"score_gpt":0.23095624649165195,"score_spread":0.21541644961576717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2320769111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11392632,0.00021897737,0.8812684,0.0001726366,0.00006541588,0.0000139660715,0.000035666268,0.000288093,0.0040105293],"genre_scores_gemma":[0.8904711,0.00021743518,0.105075255,0.00007041021,0.00011304738,0.000021042219,0.00008354214,0.00013050821,0.0038177045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990402,0.00036262407,0.000040756942,0.00012783584,0.000346179,0.00008243247],"domain_scores_gemma":[0.99733114,0.0017697494,0.00025364722,0.0002274399,0.00029702907,0.0001211526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011509045,0.00050914945,0.00073858973,0.0010750142,0.00030380033,0.0012316791,0.0008674746,0.00054135744,0.0028556227],"category_scores_gemma":[0.007935388,0.0002643651,0.00032264806,0.00087349373,0.0013547332,0.0021652088,0.0015001127,0.0008895658,0.00050724816],"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.0004595232,0.00006825891,0.0022834826,0.00020040935,0.00006052078,0.00030315097,0.00038652247,0.29760215,0.016644796,0.54838073,0.0026975207,0.13091294],"study_design_scores_gemma":[0.0000088254,0.00006494456,0.00023479284,0.0000150621,0.0000067005835,0.00012154493,0.00006317165,0.8348717,0.0039371215,0.15904465,0.0016132545,0.00001813336],"about_ca_topic_score_codex":0.00069128646,"about_ca_topic_score_gemma":0.00074289925,"teacher_disagreement_score":0.0028556227,"about_ca_system_score_codex":0.00046328007,"about_ca_system_score_gemma":0.0002363685,"threshold_uncertainty_score":0.009553015},"labels":[],"label_agreement":null},{"id":"W2322908176","doi":"10.1142/9789812778857_0010","title":"RECURRENCE RELATIONS FOR THE COEFFICIENTS IN HYPERGEOMETRIC SERIES EXPANSIONS","year":2007,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Series (stratigraphy); Recurrence relation; Hypergeometric function; Bilateral hypergeometric series; Hypergeometric identity; Mathematics; Computer science; Generalized hypergeometric function; Applied mathematics; Hypergeometric function of a matrix argument; Mathematical analysis; Geology","score_opus":0.02077783688455195,"score_gpt":0.27248994160356327,"score_spread":0.25171210471901134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2322908176","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20018783,0.010141552,0.70899624,0.0039872853,0.0014849593,0.00016847483,0.0006794744,0.00084985344,0.07350436],"genre_scores_gemma":[0.86453736,0.006418103,0.08666323,0.0007785192,0.001783939,0.0004064329,0.0007014251,0.000689912,0.038021054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988715,0.0004029544,0.000083042,0.00013588161,0.00037427215,0.00013236013],"domain_scores_gemma":[0.9928725,0.0045386096,0.00068636006,0.00045741608,0.0011238455,0.00032125833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028966884,0.00096819084,0.00093048275,0.0045754667,0.0010565328,0.0033704545,0.0016111134,0.001374527,0.008278966],"category_scores_gemma":[0.024066394,0.00056121335,0.0006911159,0.0031283572,0.0023260985,0.004502789,0.001267079,0.0031113827,0.0025118028],"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.000031952597,0.000024853494,0.0005795709,0.00009598187,0.000014678309,0.00014413822,0.0003914942,0.0057299105,0.0013888943,0.9692187,0.0034355817,0.018944269],"study_design_scores_gemma":[0.000016022901,0.000012987055,0.00037961363,0.00006557896,0.000018510118,0.00018221365,0.00009173784,0.06924464,0.000983367,0.9256721,0.003286816,0.0000463941],"about_ca_topic_score_codex":0.0013593206,"about_ca_topic_score_gemma":0.0019583167,"teacher_disagreement_score":0.008278966,"about_ca_system_score_codex":0.0013160751,"about_ca_system_score_gemma":0.00077640655,"threshold_uncertainty_score":0.027695894},"labels":[],"label_agreement":null},{"id":"W2325676038","doi":"10.1515/spma-2016-0003","title":"Pentadiagonal Companion Matrices","year":2015,"lang":"en","type":"article","venue":"Special Matrices","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University","funders":"","keywords":"Transpose; Mathematics; Factorization; Matrix (chemical analysis); Sparse matrix; Permutation matrix; Permutation (music); Matrix decomposition; Combinatorics; Algorithm","score_opus":0.024008734125993973,"score_gpt":0.258861157228126,"score_spread":0.23485242310213206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325676038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20867237,0.00034447206,0.7479189,0.00040990952,0.00024768978,0.00017103384,0.0005970166,0.0008858421,0.040752817],"genre_scores_gemma":[0.8778623,0.00022240126,0.10108832,0.00029403705,0.0002095522,0.00010264314,0.00083528267,0.00014998046,0.019235505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939704,0.00011456907,0.000027463475,0.00016735742,0.00020589848,0.00008767835],"domain_scores_gemma":[0.99859315,0.00032566773,0.00025661022,0.00028950188,0.0003941497,0.0001409072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037567937,0.00055890065,0.00049041567,0.0009793969,0.0005420695,0.001141234,0.00048259643,0.0005321606,0.011855696],"category_scores_gemma":[0.0037152676,0.00020526197,0.00031080807,0.0006900589,0.00096357346,0.001242421,0.0008752475,0.0008901835,0.0018162116],"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.0004150556,0.00013766397,0.0022457237,0.00022276831,0.00006574258,0.0007742244,0.00046684782,0.06516811,0.032263976,0.73191494,0.015810419,0.15051445],"study_design_scores_gemma":[0.000044660217,0.00021920021,0.0017364747,0.000028973789,0.000015343097,0.0008463338,0.00019170268,0.34306437,0.013382698,0.61990637,0.020506337,0.00005755585],"about_ca_topic_score_codex":0.000729835,"about_ca_topic_score_gemma":0.0006206086,"teacher_disagreement_score":0.011855696,"about_ca_system_score_codex":0.00032377648,"about_ca_system_score_gemma":0.0003693452,"threshold_uncertainty_score":0.03966123},"labels":[],"label_agreement":null},{"id":"W2325964884","doi":"10.4064/bc89-0-14","title":"Jucys-Murphy elements and the unitary Weingarten function","year":2010,"lang":"en","type":"article","venue":"Banach Center Publications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Unitary state; Connection (principal bundle); Function (biology); Pure mathematics; Mathematics; Group (periodic table); Algebra over a field; Physics; Geometry; Quantum mechanics","score_opus":0.007117282343164081,"score_gpt":0.21592493745567792,"score_spread":0.20880765511251384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325964884","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44411355,0.0010310223,0.38160893,0.0015453593,0.0004762764,0.000062142535,0.000087170396,0.00047800638,0.17059755],"genre_scores_gemma":[0.948033,0.00036229932,0.03154915,0.00024996328,0.00022176144,0.00005247041,0.000039288363,0.00008676339,0.019405307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997174,0.00005593137,0.00001387215,0.00003789154,0.000094380724,0.00008049042],"domain_scores_gemma":[0.99966335,0.00008865009,0.00004493523,0.00006486589,0.000068078065,0.000070126785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004780751,0.00031053295,0.00034151928,0.0008480994,0.0009848413,0.0010673485,0.0006025701,0.00047979984,0.00397297],"category_scores_gemma":[0.001529187,0.00012523239,0.0003214393,0.0005021653,0.0017618085,0.0025766054,0.0013409257,0.001095655,0.0006932268],"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.0000069336834,0.0000049107243,0.00007668724,0.000006323603,9.290428e-7,0.000027977141,0.00007747231,0.0004175475,0.0006282014,0.99465525,0.00017297466,0.0039248927],"study_design_scores_gemma":[0.000003429789,0.00001907956,0.000111730835,0.0000072106,0.0000020319665,0.000086139284,0.00007872642,0.0043602134,0.0017669199,0.9895549,0.004002054,0.000007591278],"about_ca_topic_score_codex":0.00035671535,"about_ca_topic_score_gemma":0.0004228393,"teacher_disagreement_score":0.00397297,"about_ca_system_score_codex":0.00046816448,"about_ca_system_score_gemma":0.00042131418,"threshold_uncertainty_score":0.013290942},"labels":[],"label_agreement":null},{"id":"W2326090653","doi":"10.2514/6.2007-4333","title":"A parallel Newton-Krylov flow solver for the Euler equations on multi-block grids","year":2007,"lang":"en","type":"article","venue":"18th AIAA Computational Fluid Dynamics Conference","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"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 Toronto","funders":"Canada Research Chairs","keywords":"Preconditioner; Krylov subspace; Mathematics; Discretization; Applied mathematics; Backward Euler method; Euler equations; Iterative method; Solver; Newton's method; Linear system; Euler's formula; Mathematical optimization; Mathematical analysis; Nonlinear system","score_opus":0.032120699589333016,"score_gpt":0.28127695494816085,"score_spread":0.24915625535882785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2326090653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061259163,0.000109158,0.9885805,0.00009073436,0.000052061398,0.00006821858,0.00016680712,0.0013530389,0.0034536005],"genre_scores_gemma":[0.06308229,0.00018852839,0.93081677,0.000052140134,0.000036056397,0.0002448253,0.00046662358,0.00036682596,0.0047460487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997409,0.00005081304,0.000011959174,0.000026761325,0.00014797335,0.000021601432],"domain_scores_gemma":[0.99973816,0.00008128548,0.000025060635,0.000053070115,0.00007777633,0.000024663073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034652487,0.0005777139,0.00071443745,0.0003031231,0.0005166501,0.0004850118,0.00094031246,0.00063047354,0.0051350803],"category_scores_gemma":[0.0008045884,0.00034505312,0.00056821265,0.0005011716,0.00032735922,0.0007139773,0.00078397646,0.00075442577,0.0016221073],"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.00013682923,0.00012627462,0.0011944461,0.00027066856,0.000064250795,0.00022391156,0.00012192102,0.7004489,0.02710022,0.040848136,0.011191581,0.21827288],"study_design_scores_gemma":[0.00003996379,0.000027905213,0.00012068422,0.000006200581,0.000005516447,0.00004944442,0.000005845597,0.98601127,0.0031469187,0.0032846213,0.007293853,0.0000079289475],"about_ca_topic_score_codex":0.0038073054,"about_ca_topic_score_gemma":0.0043082233,"teacher_disagreement_score":0.0051350803,"about_ca_system_score_codex":0.0002990399,"about_ca_system_score_gemma":0.0013272952,"threshold_uncertainty_score":0.017178595},"labels":[],"label_agreement":null},{"id":"W2327367869","doi":"10.1016/j.laa.2016.03.049","title":"Algebraically positive matrices","year":2016,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Algebraically closed field; Algebraic number; Sign (mathematics); Property (philosophy); Characterization (materials science); Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.0074605515615002475,"score_gpt":0.23615720016269376,"score_spread":0.22869664860119351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2327367869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12602691,0.002366008,0.45035985,0.0058670747,0.0023744213,0.00017480388,0.0011833165,0.00096483,0.41068286],"genre_scores_gemma":[0.81401914,0.0017731371,0.046869576,0.0013903107,0.0021525996,0.00020917234,0.00078411994,0.00027292068,0.13252896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895775,0.00022720898,0.000039885217,0.00025672303,0.00038236592,0.00013599252],"domain_scores_gemma":[0.9984124,0.00045046705,0.00026082783,0.00019203556,0.00049483636,0.00018946732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050264853,0.00094630267,0.00053972186,0.0016706858,0.0015190649,0.0033977071,0.00071524165,0.00078652933,0.01727563],"category_scores_gemma":[0.0030965437,0.00037465896,0.00043694148,0.001424975,0.0025771053,0.0033715614,0.0021119236,0.0028017287,0.004448116],"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.000017155991,0.000017248518,0.000068668414,0.000028778073,0.0000037339087,0.00003432656,0.000077282144,0.0003712668,0.0012615478,0.9867812,0.0032634845,0.008075221],"study_design_scores_gemma":[0.000009100926,0.000020657477,0.00017020752,0.000012407384,0.0000052172086,0.00024551622,0.000067598776,0.0026220893,0.0016908174,0.97622365,0.018916436,0.00001617194],"about_ca_topic_score_codex":0.00027853667,"about_ca_topic_score_gemma":0.00033808564,"teacher_disagreement_score":0.01727563,"about_ca_system_score_codex":0.0006620154,"about_ca_system_score_gemma":0.000754213,"threshold_uncertainty_score":0.057792723},"labels":[],"label_agreement":null},{"id":"W2332798939","doi":"10.4064/sm8421-3-2016","title":"Universal bounds for positive matrix semigroups","year":2016,"lang":"en","type":"article","venue":"Studia Mathematica","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Prince Edward Island","funders":"","keywords":"Mathematics; Semigroup; Diagonal; Bounded function; Matrix (chemical analysis); Diagonal matrix; Combinatorics; Pure mathematics; Discrete mathematics; Similarity (geometry); Mathematical analysis; Image (mathematics)","score_opus":0.01117884421377918,"score_gpt":0.2595811904358732,"score_spread":0.248402346222094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2332798939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21943352,0.00194007,0.69117606,0.0019485402,0.0004520213,0.00011178671,0.00021373775,0.0010152011,0.083709076],"genre_scores_gemma":[0.9451941,0.00047497137,0.04577477,0.00044369712,0.00031379174,0.00016220257,0.00013198148,0.00019371347,0.0073107956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700886,0.0007733105,0.00015301169,0.0007035125,0.000911321,0.0004500331],"domain_scores_gemma":[0.98074466,0.012233717,0.0015910373,0.0024254534,0.0013378604,0.0016672837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034596338,0.001042747,0.0010302715,0.0014535215,0.0018105581,0.0030206004,0.0019475725,0.0013472133,0.012482508],"category_scores_gemma":[0.020327447,0.00049751,0.0011968212,0.00090906944,0.0039501297,0.006355706,0.006050899,0.0028171558,0.0010435153],"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.00007660355,0.000042779702,0.0003405396,0.00010020204,0.000016733327,0.00010605633,0.0003587969,0.0073363865,0.0037832793,0.979018,0.0007069623,0.008113542],"study_design_scores_gemma":[0.000020240002,0.00012615992,0.0003581289,0.000052373864,0.000028113167,0.0001783882,0.0001431399,0.07916837,0.005569031,0.91053337,0.0037900389,0.000032809687],"about_ca_topic_score_codex":0.00046262756,"about_ca_topic_score_gemma":0.00065544766,"teacher_disagreement_score":0.012482508,"about_ca_system_score_codex":0.0017134749,"about_ca_system_score_gemma":0.00060672854,"threshold_uncertainty_score":0.04175812},"labels":[],"label_agreement":null},{"id":"W2335754200","doi":"10.2514/6.2005-5231","title":"Three-Dimensional Aerodynamic Computations on Unstructured Grids Using a Newton-Krylov Approach","year":2005,"lang":"en","type":"article","venue":"17th AIAA Computational Fluid Dynamics Conference","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"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 Toronto","funders":"","keywords":"Aerodynamics; Computation; Computer science; Unstructured grid; Computational science; Computational fluid dynamics; Parallel computing; Mechanics; Algorithm; Physics","score_opus":0.019212546918654254,"score_gpt":0.2481651924360233,"score_spread":0.22895264551736905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2335754200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030459043,0.00009520144,0.9626553,0.00015564664,0.00005718902,0.0000743695,0.00009713774,0.00052404153,0.005882245],"genre_scores_gemma":[0.35763043,0.00020263593,0.6377337,0.000067979934,0.00004718641,0.00025676066,0.00024906683,0.00017386556,0.0036384317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999785,0.00004453627,0.000011452749,0.00001769145,0.00011755384,0.000023766317],"domain_scores_gemma":[0.9997105,0.00009905683,0.000027533597,0.000049893002,0.000084388535,0.000028659993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002429304,0.00037833644,0.00060077227,0.0003456909,0.00064742327,0.00054847164,0.0007940336,0.0005090201,0.001983166],"category_scores_gemma":[0.0008082446,0.00027082855,0.00050426624,0.00037137393,0.000553593,0.0004334887,0.00091080816,0.0006606766,0.00069045],"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.000047021305,0.000047115616,0.00061348727,0.00006616311,0.000020790732,0.00014155047,0.00011234692,0.89969397,0.011467323,0.043694284,0.0015671744,0.042528775],"study_design_scores_gemma":[0.000011797125,0.000011725273,0.00007316453,0.0000039104802,0.0000015180267,0.000016211678,0.0000069678354,0.99335855,0.0009074754,0.0039943354,0.0016083752,0.0000059058266],"about_ca_topic_score_codex":0.004677898,"about_ca_topic_score_gemma":0.0038782766,"teacher_disagreement_score":0.004677898,"about_ca_system_score_codex":0.00034524925,"about_ca_system_score_gemma":0.0009922014,"threshold_uncertainty_score":0.009301305},"labels":[],"label_agreement":null},{"id":"W2336918718","doi":"10.1016/j.laa.2017.04.006","title":"Existence of a not necessarily symmetric matrix with given distinct eigenvalues and graph","year":2017,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tridiagonal matrix; Mathematics; Eigenvalues and eigenvectors; Combinatorics; Symmetric matrix; Graph; Matrix (chemical analysis); Physics","score_opus":0.017341739179095456,"score_gpt":0.2726083034609132,"score_spread":0.2552665642818177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336918718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40339997,0.0004566125,0.5536714,0.0030856845,0.00029606157,0.0001111498,0.0008319549,0.00061263033,0.037534464],"genre_scores_gemma":[0.8477333,0.00041014247,0.13750465,0.00045590053,0.00014085895,0.00015615726,0.000669665,0.00021691436,0.012712318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993012,0.00014980369,0.000038605707,0.0002328451,0.00016518134,0.0001123765],"domain_scores_gemma":[0.9958546,0.0021517165,0.00048543766,0.00039351737,0.000670507,0.00044420906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077112863,0.00093502307,0.0010057238,0.0012623017,0.0013310619,0.0019679468,0.0010887785,0.0021031979,0.006619659],"category_scores_gemma":[0.005767362,0.0007992058,0.0007089069,0.0011048897,0.00150539,0.0032881298,0.0018684737,0.0017074496,0.0011035606],"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.0003058243,0.00011366778,0.0013218108,0.000322459,0.00005459179,0.00046797303,0.0005318661,0.0066353576,0.02202201,0.94305754,0.0061427574,0.019024175],"study_design_scores_gemma":[0.00006916276,0.00009132087,0.0010643741,0.00004471074,0.000029103438,0.001142227,0.00032507817,0.049491193,0.0062176445,0.9379201,0.0035374588,0.00006757949],"about_ca_topic_score_codex":0.000325668,"about_ca_topic_score_gemma":0.00039007326,"teacher_disagreement_score":0.006619659,"about_ca_system_score_codex":0.00058203586,"about_ca_system_score_gemma":0.0009239057,"threshold_uncertainty_score":0.022144973},"labels":[],"label_agreement":null},{"id":"W2338260032","doi":"10.1002/nla.2050","title":"Towards an optimal condition number of certain augmented Lagrangian‐type saddle‐point matrices","year":2016,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Invertible matrix; Saddle point; Eigenvalues and eigenvectors; Augmented Lagrangian method; Rank (graph theory); Block (permutation group theory); Matrix (chemical analysis); Saddle; Applied mathematics; Type (biology); Singular value decomposition; Combinatorics; Block matrix; Lagrangian; Singular value; Pure mathematics; Mathematical optimization; Algorithm; Geometry","score_opus":0.009549939276433841,"score_gpt":0.2723625157209429,"score_spread":0.26281257644450906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338260032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07178549,0.00025605081,0.9158143,0.00037585062,0.000035320776,0.000048717342,0.000080776306,0.00013316835,0.011470341],"genre_scores_gemma":[0.8006534,0.00042628733,0.1925064,0.00014082328,0.000051635576,0.00024328507,0.0001773649,0.00028281158,0.0055179885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996767,0.00016187,0.0000104988985,0.00004286241,0.000072224626,0.0000358687],"domain_scores_gemma":[0.9985649,0.0008445921,0.00018600927,0.00009035038,0.00021050373,0.00010365651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017477018,0.001032474,0.00070880423,0.0007550447,0.00047062067,0.0011181772,0.0007352785,0.0009169788,0.0034627984],"category_scores_gemma":[0.0051354486,0.0005685377,0.00038260693,0.0003950459,0.0012634238,0.0012351043,0.00097385497,0.0009951276,0.00048978406],"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.000108891225,0.000060032133,0.00045872122,0.0001635649,0.000040254232,0.000104506675,0.0000954761,0.6485856,0.011581191,0.32458472,0.002370524,0.011846553],"study_design_scores_gemma":[0.0000064286896,0.000025425039,0.000091173,0.000013907558,0.0000035584899,0.00001213945,0.000013910663,0.95908654,0.0010086288,0.039382905,0.00034632703,0.000009052496],"about_ca_topic_score_codex":0.0010608223,"about_ca_topic_score_gemma":0.001042983,"teacher_disagreement_score":0.0034627984,"about_ca_system_score_codex":0.00085554266,"about_ca_system_score_gemma":0.0011810068,"threshold_uncertainty_score":0.011584163},"labels":[],"label_agreement":null},{"id":"W2341812661","doi":"","title":"Investigation of Steady State Problems via Quarter Sweep Schemes","year":2013,"lang":"en","type":"article","venue":"Sains Malaysiana","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Relaxation (psychology); Sweep frequency response analysis; Mathematics; Quarter (Canadian coin); Steady state (chemistry); Computer science; Mechanics; Physics; Chemistry; Acoustics; Medicine","score_opus":0.01168848679619982,"score_gpt":0.2059628341273843,"score_spread":0.19427434733118448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2341812661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061190493,0.0006767859,0.917521,0.00032373948,0.0001229508,0.00008621711,0.0001927002,0.0004948056,0.019391319],"genre_scores_gemma":[0.6828199,0.0012825241,0.30053982,0.00012456859,0.000062715495,0.00021955968,0.00037803286,0.00022252841,0.014350332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998647,0.00003872234,0.0000077849,0.000017885155,0.000052875657,0.000018036984],"domain_scores_gemma":[0.999632,0.00015851935,0.0000449139,0.00007135848,0.00007702223,0.000016233294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003360238,0.00035315703,0.00055489625,0.00035784565,0.00037992565,0.0007562876,0.00065000606,0.0005535455,0.0053916336],"category_scores_gemma":[0.0010831563,0.00022802026,0.0005677238,0.00040047188,0.00047258564,0.00089616026,0.00056577666,0.0007384683,0.00054557796],"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.00024684332,0.00013712066,0.0033863606,0.0004738246,0.0000763932,0.00029729988,0.00048183874,0.7102963,0.03657101,0.13210312,0.0040410636,0.111888885],"study_design_scores_gemma":[0.000008572574,0.00003468117,0.00018466984,0.000011195222,0.000005641732,0.0000364122,0.000033299093,0.98813117,0.002290702,0.005966889,0.0032909662,0.000005760373],"about_ca_topic_score_codex":0.002116245,"about_ca_topic_score_gemma":0.0014142246,"teacher_disagreement_score":0.0053916336,"about_ca_system_score_codex":0.000269959,"about_ca_system_score_gemma":0.0005730114,"threshold_uncertainty_score":0.018036783},"labels":[],"label_agreement":null},{"id":"W2357770997","doi":"","title":"Several Properties of Adjoint Matrix and Two Classes Generalized Inverse Matrices","year":2002,"lang":"en","type":"article","venue":"Journal of Guangxi University for Nationalities","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Prairie Improvement Network","funders":"","keywords":"Mathematics; Inverse; Matrix (chemical analysis); Drazin inverse; Singular value decomposition; Pure mathematics; Generalized inverse; Involutory matrix; Combinatorics; Matrix function; Symmetric matrix; Physics; Eigenvalues and eigenvectors; Algorithm; Chemistry; Geometry","score_opus":0.03271537199424252,"score_gpt":0.2322691201351441,"score_spread":0.1995537481409016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2357770997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15258208,0.001789087,0.7744181,0.0013308057,0.00046200186,0.000089167865,0.00029240196,0.0004406002,0.06859571],"genre_scores_gemma":[0.8899823,0.0012600182,0.09173695,0.00072954973,0.00081881793,0.00017036343,0.00044407402,0.000166822,0.014691114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991098,0.0001481042,0.000057918733,0.00022132418,0.00036494224,0.00009791368],"domain_scores_gemma":[0.99701786,0.001189184,0.000514321,0.00030242812,0.00073007954,0.00024612542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009773611,0.00063778146,0.00044175462,0.0016116657,0.0007387425,0.0018274672,0.00048239907,0.0012914606,0.004021233],"category_scores_gemma":[0.005758614,0.00030611843,0.00066849875,0.0009987439,0.0024390195,0.0028144752,0.0011672905,0.0021708815,0.0008174435],"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.00004413196,0.000035918194,0.00093926,0.00007253081,0.000015225438,0.0003501155,0.00049370783,0.0022956296,0.00673098,0.96398234,0.0014988963,0.023541143],"study_design_scores_gemma":[0.000026147756,0.000087666034,0.0011793526,0.000034240857,0.000017188888,0.0018958341,0.00028754704,0.026952203,0.0052826745,0.9509247,0.013250079,0.000062422296],"about_ca_topic_score_codex":0.0004750442,"about_ca_topic_score_gemma":0.00037914704,"teacher_disagreement_score":0.004021233,"about_ca_system_score_codex":0.00042116354,"about_ca_system_score_gemma":0.0004045268,"threshold_uncertainty_score":0.013452351},"labels":[],"label_agreement":null},{"id":"W2357874524","doi":"","title":"Least-squares Solution of the Matrix Equation [A_1XB_1,A_2XB_2]=[C,D]","year":2003,"lang":"en","type":"article","venue":"Journal of Sichuan Normal University","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Prairie Improvement Network","funders":"","keywords":"Mathematics; Singular value decomposition; Matrix (chemical analysis); Total least squares; Linear least squares; Least-squares function approximation; Applied mathematics; Orthogonal matrix; Invariant (physics); Pure mathematics; Mathematical analysis; Physics; Orthogonal basis; Algorithm; Mathematical physics; Statistics","score_opus":0.011905436597507747,"score_gpt":0.20108837277481156,"score_spread":0.1891829361773038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2357874524","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006108564,0.0001692245,0.99120975,0.00014113102,0.000053194344,0.00002049796,0.00004363329,0.00016918175,0.0020847998],"genre_scores_gemma":[0.24864163,0.00088925724,0.73744917,0.00011738861,0.000111307105,0.0001246886,0.00046121827,0.00014258976,0.012062826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996406,0.00006990525,0.000017636929,0.00012069585,0.00012646861,0.000024720004],"domain_scores_gemma":[0.99958974,0.0001642274,0.000055636756,0.00005148882,0.00012554556,0.000013304506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048628132,0.00068514224,0.0006183526,0.00044221577,0.00039941602,0.0006753384,0.0005971358,0.0008048801,0.003617742],"category_scores_gemma":[0.002005446,0.0002367585,0.00045876292,0.00078795425,0.00060120784,0.0008376848,0.00040772487,0.0010100357,0.001044901],"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.00008012369,0.00008271819,0.0020575917,0.00068671437,0.00019200594,0.00037873568,0.0003478223,0.40978876,0.060113855,0.15602455,0.010102063,0.36014515],"study_design_scores_gemma":[0.000008734114,0.00005916578,0.0006776479,0.000022157037,0.000019463396,0.00025578457,0.00008411143,0.94331425,0.00880614,0.0394225,0.0072966446,0.000033349956],"about_ca_topic_score_codex":0.0031971342,"about_ca_topic_score_gemma":0.0040495214,"teacher_disagreement_score":0.003617742,"about_ca_system_score_codex":0.0002719256,"about_ca_system_score_gemma":0.0012200507,"threshold_uncertainty_score":0.012102544},"labels":[],"label_agreement":null},{"id":"W2359273157","doi":"","title":"Applications of Improvable Cholesky Factorization of Symmetry Matrix in Eigenvalue Problems","year":2003,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"CAE (Canada)","funders":"","keywords":"Cholesky decomposition; Eigenvalues and eigenvectors; Incomplete Cholesky factorization; Minimum degree algorithm; Matrix (chemical analysis); Mathematics; Symmetric matrix; Factorization; Matrix decomposition; Symmetry (geometry); Eigendecomposition of a matrix; Applied mathematics; Algebra over a field; Pure mathematics; Physics; Algorithm; Chemistry; Geometry; Quantum mechanics","score_opus":0.008070069183425187,"score_gpt":0.24343398546925946,"score_spread":0.23536391628583428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2359273157","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047225994,0.00020771836,0.99384767,0.000109346685,0.00004046036,0.000019025121,0.000022509641,0.00007618923,0.0009544621],"genre_scores_gemma":[0.26505685,0.0010253934,0.72928625,0.00015238496,0.00027603193,0.00031992645,0.00022391001,0.00014385999,0.0035153353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998606,0.00063663756,0.00006523522,0.0001709131,0.00041051095,0.00011080683],"domain_scores_gemma":[0.99527186,0.0028365958,0.00038147604,0.0005721753,0.0007300991,0.00020783083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018164227,0.0010869561,0.0010358874,0.0013730347,0.00077375013,0.00091275113,0.0012273969,0.0009560643,0.004266295],"category_scores_gemma":[0.011826877,0.00054972776,0.00083485356,0.0011299978,0.0014031249,0.0020855952,0.0018159421,0.001761297,0.00095017615],"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.00030979203,0.00014343277,0.0025161486,0.0004566355,0.00011055397,0.00034916124,0.0003426846,0.36944315,0.011883589,0.47485328,0.004028791,0.1355627],"study_design_scores_gemma":[0.000017746086,0.000041960324,0.00020385232,0.000021697015,0.0000057845987,0.000058513662,0.000026249185,0.87002635,0.0017429042,0.12655179,0.0012857645,0.00001736912],"about_ca_topic_score_codex":0.0021781828,"about_ca_topic_score_gemma":0.0021753544,"teacher_disagreement_score":0.004266295,"about_ca_system_score_codex":0.0006171295,"about_ca_system_score_gemma":0.0010430679,"threshold_uncertainty_score":0.014272153},"labels":[],"label_agreement":null},{"id":"W2359828160","doi":"","title":"Inverse Eigenvalue Problem for Centro-symmetric Matrices","year":2004,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"CAE (Canada)","funders":"","keywords":"Eigenvalues and eigenvectors; Inverse; Mathematics; Expression (computer science); Inverse problem; Matrix (chemical analysis); Applied mathematics; Symmetric matrix; Inverse iteration; Mathematical analysis; Combinatorics; Physics; Computer science; Geometry; Chemistry","score_opus":0.013994818278369193,"score_gpt":0.23672800645961894,"score_spread":0.22273318818124976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2359828160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00808029,0.00022050028,0.9868384,0.00018972815,0.0000379785,0.000013711015,0.000026592781,0.000045138408,0.004547656],"genre_scores_gemma":[0.42336082,0.0024460212,0.5432756,0.0003997167,0.00029213738,0.00023735182,0.0003657761,0.00018851503,0.029433995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993125,0.00020479152,0.000027194748,0.00014884827,0.00024852407,0.000058236026],"domain_scores_gemma":[0.99871826,0.0006906537,0.00014115783,0.00009408547,0.00030658126,0.00004925377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010298431,0.00068918744,0.00061204046,0.00068865693,0.0005289264,0.0013629392,0.0007182002,0.0014593329,0.004126725],"category_scores_gemma":[0.005809727,0.00033141888,0.0005189224,0.0007202108,0.0013097398,0.0018045359,0.0013291517,0.0014225866,0.001223872],"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.000102838145,0.00003824176,0.0006697641,0.0002746224,0.00004073066,0.0004974446,0.0003374082,0.13554935,0.021064397,0.7747338,0.004095594,0.062595785],"study_design_scores_gemma":[0.000015822927,0.000036960522,0.0003641997,0.0000353811,0.000013503304,0.0005016546,0.00021540366,0.5968129,0.0059362752,0.3896492,0.0063854875,0.00003303018],"about_ca_topic_score_codex":0.0007457781,"about_ca_topic_score_gemma":0.0007440031,"teacher_disagreement_score":0.004126725,"about_ca_system_score_codex":0.00039227022,"about_ca_system_score_gemma":0.00069594075,"threshold_uncertainty_score":0.01380527},"labels":[],"label_agreement":null},{"id":"W2360979580","doi":"","title":"The Centrosymmetric Solution of Minimum Frobenius Norm of the Matrix Equation AXB=C","year":2003,"lang":"en","type":"article","venue":"Hainan Daxue xuebao. Ziran kexue ban","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Prairie Improvement Network","funders":"","keywords":"Mathematics; Matrix norm; Norm (philosophy); Singular value decomposition; Matrix (chemical analysis); Singular value; Pure mathematics; Eigenvalues and eigenvectors; Algorithm; Physics; Chemistry","score_opus":0.011620438204425798,"score_gpt":0.22291724193900642,"score_spread":0.21129680373458062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2360979580","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13438869,0.0004693073,0.8363002,0.0007820427,0.00012488542,0.00008138253,0.00031012573,0.00013969427,0.027403688],"genre_scores_gemma":[0.84189904,0.00095831725,0.14416502,0.00023032627,0.00015340594,0.000239498,0.0005766375,0.00013544936,0.011642301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999653,0.00006507048,0.000017738561,0.00007974678,0.00012357067,0.000060915012],"domain_scores_gemma":[0.99928683,0.00019459998,0.00015782366,0.00003653679,0.00025135602,0.000072900846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048637434,0.0006965263,0.00054475997,0.0005866516,0.0004649362,0.00098021,0.0005538867,0.00093414023,0.0045075924],"category_scores_gemma":[0.0033526884,0.00021350979,0.00039205747,0.00046922112,0.0009424324,0.0013862718,0.00064034265,0.0008886119,0.0008019667],"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.0001781221,0.00005596347,0.0017318695,0.00033701255,0.000046084893,0.0006061013,0.00030434082,0.055191513,0.043702394,0.84847224,0.0072027817,0.04217174],"study_design_scores_gemma":[0.000051638945,0.00012597707,0.0014876724,0.00005773627,0.000020352152,0.00085587724,0.00036642104,0.52371275,0.014161154,0.45509416,0.0039944435,0.00007179928],"about_ca_topic_score_codex":0.0012887868,"about_ca_topic_score_gemma":0.0010082109,"teacher_disagreement_score":0.0045075924,"about_ca_system_score_codex":0.00031425993,"about_ca_system_score_gemma":0.0010620848,"threshold_uncertainty_score":0.015079439},"labels":[],"label_agreement":null},{"id":"W2375215345","doi":"","title":"Semi-positive Subdefiniteness for a Kind of Quaternion Matrices","year":2001,"lang":"en","type":"article","venue":"Hainan Daxue xuebao. Ziran kexue ban","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Prairie Improvement Network","funders":"","keywords":"Quaternion; Mathematics; Pure mathematics; Inverse; Matrix (chemical analysis); Positive-definite matrix; Field (mathematics); Algebra over a field; Physics; Geometry; Materials science; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.01472373779141836,"score_gpt":0.24615752781516623,"score_spread":0.23143379002374787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2375215345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18209904,0.00064097514,0.78938395,0.0004930173,0.0001640373,0.00005181499,0.00017630852,0.0002458807,0.02674488],"genre_scores_gemma":[0.9069242,0.00043908437,0.08695076,0.0001748612,0.00018632028,0.000048158377,0.00023365277,0.0000396874,0.0050033447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995307,0.00008269079,0.000040678686,0.00012569531,0.00018333037,0.000036945967],"domain_scores_gemma":[0.99823123,0.0006869413,0.00027899595,0.00019359482,0.00047020623,0.00013906119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005259359,0.00030820054,0.00022072859,0.00076411397,0.00045299006,0.0007325694,0.00025305524,0.00039632575,0.0036815894],"category_scores_gemma":[0.0026902885,0.00015285562,0.000270756,0.00040229535,0.0010307098,0.0017002999,0.00042793443,0.0007551742,0.00054778147],"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.00020528137,0.000036477533,0.0022072794,0.00017716826,0.000016050673,0.0007618154,0.0004477314,0.004990317,0.043673217,0.8947842,0.002159667,0.050540842],"study_design_scores_gemma":[0.000046704252,0.00031153322,0.0019696697,0.00006667069,0.000021996042,0.004076128,0.00042012567,0.08823234,0.03587394,0.8519559,0.016926626,0.00009839449],"about_ca_topic_score_codex":0.0002656694,"about_ca_topic_score_gemma":0.00036307867,"teacher_disagreement_score":0.0036815894,"about_ca_system_score_codex":0.00018713124,"about_ca_system_score_gemma":0.00023431894,"threshold_uncertainty_score":0.012316167},"labels":[],"label_agreement":null},{"id":"W2380144308","doi":"","title":"Some Inequalities of Eigenvalues for Self conjugate Quaternion Matrices","year":2005,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"CAE (Canada)","funders":"","keywords":"Quaternion; Eigenvalues and eigenvectors; Mathematics; Rayleigh–Ritz method; Conjugate; Field (mathematics); Pure mathematics; Mathematical analysis; Geometry; Physics; Boundary value problem","score_opus":0.019807659455612917,"score_gpt":0.26840486723646445,"score_spread":0.24859720778085154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2380144308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05005349,0.005632926,0.9062409,0.0013651026,0.00046542822,0.000041074112,0.000258719,0.00023696378,0.035705347],"genre_scores_gemma":[0.82182,0.0062407698,0.151407,0.0008969536,0.0012248713,0.00024037294,0.0005777785,0.00062751566,0.0169647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974523,0.00076810207,0.00016097132,0.00044592016,0.0008504609,0.0003222131],"domain_scores_gemma":[0.99103653,0.006150616,0.0005282012,0.00043192544,0.0015574018,0.0002952039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002702686,0.0011441921,0.00074034405,0.002242693,0.0007133391,0.0017444355,0.0013996023,0.0009887975,0.006391103],"category_scores_gemma":[0.015914857,0.00040886196,0.00070713,0.0012174979,0.0018107359,0.0059937863,0.0017046445,0.0024080377,0.0013682572],"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.00023553654,0.000062246385,0.0022634068,0.0005826429,0.00008492273,0.0005713948,0.0008177426,0.023434406,0.029385202,0.8703593,0.0073196418,0.06488357],"study_design_scores_gemma":[0.000025383386,0.00015236219,0.0027389114,0.00014870406,0.000052827385,0.00072784006,0.00037887468,0.30963832,0.016845986,0.6596583,0.009492494,0.00013996803],"about_ca_topic_score_codex":0.0006755785,"about_ca_topic_score_gemma":0.000648152,"teacher_disagreement_score":0.006391103,"about_ca_system_score_codex":0.00082696177,"about_ca_system_score_gemma":0.000345515,"threshold_uncertainty_score":0.021380365},"labels":[],"label_agreement":null},{"id":"W2383996974","doi":"10.1016/j.laa.2016.04.028","title":"The nowhere-zero eigenbasis problem for a graph","year":2016,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Graph; Zero (linguistics); Connectivity; Discrete mathematics","score_opus":0.01123115118946282,"score_gpt":0.24386424065190537,"score_spread":0.23263308946244254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2383996974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34829414,0.0008576676,0.5864914,0.009115356,0.0006600061,0.00012380455,0.0007861571,0.0005336778,0.05313782],"genre_scores_gemma":[0.8695234,0.0007895041,0.088033535,0.0009576275,0.0004935128,0.00020242564,0.0010299094,0.00045251127,0.03851753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994504,0.00018530624,0.000020464706,0.0001478274,0.00009981471,0.00009614479],"domain_scores_gemma":[0.99844044,0.00094835495,0.00013472716,0.00014344792,0.0001598328,0.00017322936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000826336,0.0009712212,0.0011954927,0.0010825781,0.0013576392,0.002970915,0.0018864815,0.0023562822,0.01120095],"category_scores_gemma":[0.0034876212,0.0005599206,0.00061381375,0.00097258284,0.002474775,0.0043403227,0.0019160439,0.0031065694,0.0013722793],"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.00011792029,0.0001314034,0.00040858384,0.00014725537,0.000030006264,0.00011483461,0.00028483654,0.0126546575,0.0020047864,0.95497334,0.009193348,0.019939069],"study_design_scores_gemma":[0.00002081928,0.0000131058105,0.00009128069,0.0000111774125,0.0000054169795,0.00004679266,0.00013537773,0.034694415,0.0005177083,0.96340597,0.001047012,0.0000110650635],"about_ca_topic_score_codex":0.0018013666,"about_ca_topic_score_gemma":0.001843668,"teacher_disagreement_score":0.01120095,"about_ca_system_score_codex":0.0008009971,"about_ca_system_score_gemma":0.0010961812,"threshold_uncertainty_score":0.037470877},"labels":[],"label_agreement":null},{"id":"W2396528273","doi":"","title":"On the generalized antiaverage problem.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.00804163962185088,"score_gpt":0.22174068237473257,"score_spread":0.2136990427528817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396528273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20728362,0.00535809,0.53048116,0.014075807,0.0019011694,0.00010401361,0.0011992679,0.0010762176,0.23852079],"genre_scores_gemma":[0.8553506,0.0030390627,0.087468565,0.0022477724,0.002412093,0.00015278097,0.0016097222,0.000490045,0.047229365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990299,0.00031995057,0.000035636993,0.00018897276,0.00021405498,0.00021155208],"domain_scores_gemma":[0.99672323,0.0020351028,0.0002446901,0.00040051693,0.0002920048,0.00030443174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001064013,0.0006735528,0.0011208048,0.0011129407,0.0019320898,0.002325189,0.001742967,0.0015549251,0.016711472],"category_scores_gemma":[0.0068640285,0.0002775685,0.00050196244,0.0017162437,0.0016862497,0.0063971854,0.0023850594,0.0023919677,0.0023991822],"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.00010029498,0.000060960032,0.0006190865,0.00010282745,0.000028986862,0.00011120641,0.000089349196,0.008205222,0.0005386283,0.9240252,0.02379094,0.0423274],"study_design_scores_gemma":[0.000013488841,0.000011052118,0.00021076127,0.000012169196,0.0000068256954,0.0000813534,0.000057367415,0.023054985,0.00022693149,0.9712524,0.0050655673,0.0000070541832],"about_ca_topic_score_codex":0.0015925417,"about_ca_topic_score_gemma":0.0026145657,"teacher_disagreement_score":0.016711472,"about_ca_system_score_codex":0.0009901399,"about_ca_system_score_gemma":0.00087104854,"threshold_uncertainty_score":0.05590546},"labels":[],"label_agreement":null},{"id":"W2399727414","doi":"10.48550/arxiv.1503.07226","title":"A note on algebraic Riccati equations associated with reducible singular M-matrices","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algebraic Riccati equation; Conjecture; Riccati equation; Algebraic number; Algebraic equation; Pure mathematics; Applied mathematics; Algebra over a field; Mathematical analysis; Nonlinear system; Differential equation; Physics","score_opus":0.06590564996564914,"score_gpt":0.20636629580192575,"score_spread":0.1404606458362766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399727414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18035372,0.0020724048,0.7129657,0.01130263,0.0024827498,0.000118566626,0.00036124288,0.0005258415,0.08981712],"genre_scores_gemma":[0.8458922,0.0015247897,0.13277902,0.0014317,0.0014873161,0.0000961936,0.00029170405,0.00016247564,0.016334593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957997,0.00012272442,0.000027562075,0.00009078322,0.00013701219,0.00004193282],"domain_scores_gemma":[0.9977648,0.001391758,0.00019853556,0.00020188834,0.0002574814,0.00018555278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012717242,0.0008168863,0.00060264923,0.0009465835,0.0008482933,0.0015839149,0.0009399793,0.001001386,0.0051241154],"category_scores_gemma":[0.0074823657,0.0002589725,0.00069442095,0.0007424845,0.002924089,0.002018522,0.0018560613,0.0023546002,0.0006930709],"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.000045094846,0.000024773268,0.000505656,0.00010766396,0.0000103084185,0.00021885708,0.00021306673,0.00919066,0.0032659173,0.9725963,0.0045513096,0.009270294],"study_design_scores_gemma":[0.00001121546,0.00003639827,0.00017678192,0.000024449906,0.0000064571705,0.00008758153,0.00004698845,0.043647707,0.0012125955,0.95063615,0.0040974133,0.000016268506],"about_ca_topic_score_codex":0.0009902362,"about_ca_topic_score_gemma":0.0009218634,"teacher_disagreement_score":0.0051241154,"about_ca_system_score_codex":0.0005102791,"about_ca_system_score_gemma":0.00039280832,"threshold_uncertainty_score":0.017141879},"labels":[],"label_agreement":null},{"id":"W2400749722","doi":"10.13001/1081-3810.3129","title":"Totally Positive Density Matrices and Linear Preservers","year":2016,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Mathematics; Intersection (aeronautics); Density matrix; Set (abstract data type); Matrix (chemical analysis); Quantum; Qubit; Pure mathematics; Combinatorics; Discrete mathematics; Quantum mechanics; Computer science; Physics","score_opus":0.005074375965425664,"score_gpt":0.22262417888748373,"score_spread":0.21754980292205806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400749722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49563104,0.0016631428,0.33349702,0.0017127249,0.00022340188,0.00008285578,0.00066597795,0.00044005486,0.16608368],"genre_scores_gemma":[0.97019124,0.0005436093,0.019551244,0.00020611762,0.00026531427,0.000069441776,0.00032331713,0.00007153222,0.008778268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836713,0.00043801728,0.00007790386,0.00030170762,0.0005508568,0.0002644197],"domain_scores_gemma":[0.9966043,0.0014710878,0.00063856883,0.00038502348,0.00046209956,0.0004388313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014378704,0.00057427335,0.0003877248,0.0015552916,0.000995038,0.0027606783,0.00088061,0.0007075058,0.0059691863],"category_scores_gemma":[0.004487722,0.00029991212,0.0005103671,0.00097230857,0.0035791018,0.0034732115,0.001856937,0.0016156097,0.00068656914],"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.000019837687,0.000013785884,0.000114537506,0.000020612453,0.0000037740951,0.00007040996,0.000117199685,0.001148453,0.00092752377,0.9937034,0.00048926316,0.0033711817],"study_design_scores_gemma":[0.000006833826,0.000033497254,0.00016216056,0.000011466606,0.0000029243902,0.000168183,0.000107364096,0.010787872,0.0008261431,0.9863849,0.0014941425,0.000014480226],"about_ca_topic_score_codex":0.00052188244,"about_ca_topic_score_gemma":0.00037689073,"teacher_disagreement_score":0.0059691863,"about_ca_system_score_codex":0.00059269724,"about_ca_system_score_gemma":0.0005293886,"threshold_uncertainty_score":0.019968927},"labels":[],"label_agreement":null},{"id":"W2400938207","doi":"","title":"Sharp Bounds for Spectral Radius of Graphs Presented by K-Neighbour of the Vertices","year":2016,"lang":"en","type":"article","venue":"Advances in natural science/Advances in natural sciences","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Spectral radius; Mathematics; Eigenvalues and eigenvectors; Integer (computer science); Graph; Upper and lower bounds; Sequence (biology); RADIUS; Connectivity; Simple (philosophy); Discrete mathematics; Simple graph; Physics; Mathematical analysis; Computer science; Quantum mechanics","score_opus":0.005616565907139849,"score_gpt":0.2820546128543018,"score_spread":0.27643804694716195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400938207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28969616,0.017108306,0.629799,0.003309499,0.00060221273,0.00013758354,0.0011400906,0.0014485181,0.05675866],"genre_scores_gemma":[0.9242816,0.004187074,0.065903366,0.000639154,0.0005855007,0.00023700196,0.00055309944,0.00027950705,0.0033336815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758005,0.0007607452,0.000095114236,0.0005819975,0.0004915175,0.0004905242],"domain_scores_gemma":[0.9819437,0.012218516,0.0015111996,0.0015162405,0.0011441549,0.0016662256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021965716,0.0017858368,0.0013099792,0.0035807244,0.0013460066,0.0024429476,0.002952474,0.0016665878,0.005496247],"category_scores_gemma":[0.026881179,0.0007153244,0.0010165515,0.0018757988,0.0033273818,0.005797327,0.0036812641,0.0030606948,0.0015965414],"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.0014422656,0.00023694243,0.007295519,0.0017185642,0.0003049073,0.0010609664,0.0018569017,0.13173598,0.05208701,0.73071903,0.01844482,0.053097054],"study_design_scores_gemma":[0.00006613666,0.00035251642,0.006224211,0.00036622642,0.00023009098,0.0016059761,0.0006908937,0.42378417,0.016236324,0.5379032,0.012306532,0.00023380424],"about_ca_topic_score_codex":0.00072869944,"about_ca_topic_score_gemma":0.0009070691,"teacher_disagreement_score":0.005496247,"about_ca_system_score_codex":0.0013610759,"about_ca_system_score_gemma":0.0005047284,"threshold_uncertainty_score":0.018386722},"labels":[],"label_agreement":null},{"id":"W2402021895","doi":"","title":"On the lower and upper bounds for the Euclidean norm of a complex matrix and its Applications.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Euclidean geometry; Norm (philosophy); Matrix (chemical analysis); Upper and lower bounds; Matrix norm; Euclidean distance matrix; Euclidean distance; Pure mathematics; Combinatorics; Mathematical analysis; Geometry; Eigenvalues and eigenvectors","score_opus":0.013040818740399158,"score_gpt":0.24815105249620723,"score_spread":0.23511023375580806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402021895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01744487,0.045254037,0.8334261,0.0074868943,0.003123673,0.00008252574,0.0009295637,0.0006269982,0.09162536],"genre_scores_gemma":[0.45357224,0.049920525,0.42125502,0.0056237527,0.010862891,0.0009065805,0.0021241985,0.0015373025,0.05419752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949286,0.0017974407,0.0003913962,0.00075777917,0.0016694817,0.0004553014],"domain_scores_gemma":[0.96220475,0.028528899,0.0015636222,0.00323709,0.0031381354,0.0013273795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008241151,0.003213437,0.0023263553,0.005479098,0.0017698371,0.0056518926,0.0043810573,0.003746798,0.011268247],"category_scores_gemma":[0.061190497,0.0010660564,0.0015580804,0.005224111,0.006686679,0.012949646,0.0065048486,0.012047983,0.0061619915],"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.00014235968,0.00008312728,0.00043567174,0.00030874458,0.000049623744,0.00014882034,0.00027645245,0.011224019,0.0016345008,0.9348625,0.01396186,0.036872387],"study_design_scores_gemma":[0.000012606257,0.000042846128,0.00038893268,0.00015962547,0.000029048844,0.00023749267,0.00010127466,0.049005076,0.0009505711,0.9355842,0.013435079,0.000053271684],"about_ca_topic_score_codex":0.0017919383,"about_ca_topic_score_gemma":0.002448066,"teacher_disagreement_score":0.011268247,"about_ca_system_score_codex":0.0022310014,"about_ca_system_score_gemma":0.0012181568,"threshold_uncertainty_score":0.04358387},"labels":[],"label_agreement":null},{"id":"W2402242051","doi":"","title":"Exponential Operator Decomposition For Carlitz Type Generating Functions.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Operator (biology); Exponential function; Decomposition; Type (biology); Pure mathematics; Algebra over a field; Mathematical analysis","score_opus":0.010232109645765881,"score_gpt":0.24898442991691594,"score_spread":0.23875232027115006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402242051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18758255,0.0018875197,0.5673828,0.0028736326,0.00074844214,0.00011353201,0.0010550419,0.0007350223,0.23762141],"genre_scores_gemma":[0.86908805,0.0011303386,0.048970237,0.0006855897,0.0007831367,0.00014422115,0.0008366019,0.00037095105,0.077990994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941516,0.00014122507,0.000027259888,0.00008410735,0.000210247,0.000121958015],"domain_scores_gemma":[0.9987243,0.00053426553,0.000118559015,0.00015603605,0.00030450083,0.00016221222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011412917,0.0007861377,0.00056625955,0.0026060839,0.0009378873,0.0026456157,0.000960491,0.0009376205,0.017662259],"category_scores_gemma":[0.003442297,0.00030271037,0.00067608507,0.0013825175,0.0017829508,0.0049238983,0.0014185815,0.0023655468,0.0038236862],"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.000014479757,0.000019573537,0.00012217897,0.000018237897,0.0000023870818,0.000023076553,0.00006510695,0.0003576021,0.000321319,0.9926604,0.001932327,0.0044632773],"study_design_scores_gemma":[0.0000070658593,0.000007960285,0.00010648235,0.0000107037795,0.0000027668375,0.00007027752,0.00004093946,0.008027284,0.000380213,0.9891628,0.0021745644,0.000008989904],"about_ca_topic_score_codex":0.0007047538,"about_ca_topic_score_gemma":0.00087056565,"teacher_disagreement_score":0.017662259,"about_ca_system_score_codex":0.0010262497,"about_ca_system_score_gemma":0.0006187196,"threshold_uncertainty_score":0.059086144},"labels":[],"label_agreement":null},{"id":"W2404682706","doi":"","title":"Remarks on two special matrices.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.006189509537240962,"score_gpt":0.23702071083343013,"score_spread":0.23083120129618917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404682706","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0255059,0.007021468,0.12785959,0.15490982,0.03105552,0.0001263381,0.00073675247,0.0012250065,0.6515596],"genre_scores_gemma":[0.5515434,0.009844915,0.11130741,0.0894065,0.024199912,0.0005104823,0.0010984896,0.0008312056,0.21125765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877006,0.0003300714,0.00005392946,0.00025246514,0.00039418947,0.00019923809],"domain_scores_gemma":[0.9969848,0.0016016157,0.00015079939,0.00039812652,0.00049405196,0.00037064342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016955708,0.0010124433,0.00072556315,0.0016512587,0.0021277466,0.0017830738,0.0017761997,0.002455149,0.030726638],"category_scores_gemma":[0.0064666905,0.00030234957,0.0009465011,0.0009886246,0.004246002,0.0056354837,0.0027692416,0.004071261,0.004591788],"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.00007293111,0.000028256665,0.0001493773,0.00012108137,0.000012644251,0.00047744266,0.0002219221,0.00029787823,0.00056499837,0.9127953,0.07647722,0.008780937],"study_design_scores_gemma":[0.000036558467,0.000025864618,0.00036614417,0.00006126352,0.000009253836,0.0006113532,0.00019614534,0.0008360156,0.0005311681,0.8755432,0.12175972,0.000023423405],"about_ca_topic_score_codex":0.0011841028,"about_ca_topic_score_gemma":0.0009919726,"teacher_disagreement_score":0.030726638,"about_ca_system_score_codex":0.00092985266,"about_ca_system_score_gemma":0.00043160355,"threshold_uncertainty_score":0.10279083},"labels":[],"label_agreement":null},{"id":"W2406516169","doi":"","title":"On Konhauser Matrix Polynomials.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.016111796866289028,"score_gpt":0.23843353679213558,"score_spread":0.22232173992584656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406516169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1348634,0.0147160115,0.44823572,0.007768186,0.0019253957,0.00010563209,0.0011059534,0.00076451356,0.39051515],"genre_scores_gemma":[0.79858404,0.010442401,0.07967689,0.0021648386,0.002152424,0.0001239769,0.0009935548,0.0003104965,0.10555135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913883,0.0002361935,0.000034136465,0.00013925027,0.0002803375,0.00017118541],"domain_scores_gemma":[0.9986077,0.0007453765,0.00014119873,0.000193613,0.00018578251,0.00012629265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095586356,0.0007993025,0.00056900363,0.0020398526,0.0014167177,0.0018877462,0.000769884,0.00077279954,0.0140817035],"category_scores_gemma":[0.004250819,0.00032175265,0.00047673486,0.0024797807,0.002324906,0.0057323226,0.0024706186,0.003344782,0.0045993854],"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.000024294011,0.000023047482,0.00015943519,0.0000534283,0.000005723299,0.000046980553,0.00015489226,0.0010059865,0.0005334361,0.97728205,0.0051809703,0.015529785],"study_design_scores_gemma":[0.000007879544,0.000012866174,0.0001838333,0.000021090977,0.0000050525455,0.000116453506,0.000065522276,0.003947266,0.0004357102,0.9850969,0.010096691,0.000010685064],"about_ca_topic_score_codex":0.0012426245,"about_ca_topic_score_gemma":0.00205862,"teacher_disagreement_score":0.0140817035,"about_ca_system_score_codex":0.0011339751,"about_ca_system_score_gemma":0.00055654836,"threshold_uncertainty_score":0.047108054},"labels":[],"label_agreement":null},{"id":"W2407129199","doi":"","title":"Families Of Generating Functions For The Jacobi And Related Matrix Polynomials.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Jacobi polynomials; Matrix (chemical analysis); Pure mathematics; Algebra over a field; Orthogonal polynomials; Chemistry","score_opus":0.007498580002478342,"score_gpt":0.2275648589387481,"score_spread":0.22006627893626973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407129199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25234148,0.003848773,0.48002568,0.0037938764,0.00068152003,0.00017589075,0.0018404411,0.000952501,0.25633985],"genre_scores_gemma":[0.8957432,0.002028752,0.046181418,0.0005989458,0.0006787149,0.00033587337,0.0013265206,0.00037350648,0.052733153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921155,0.00022119099,0.000029674356,0.000110976114,0.00028450607,0.00014211927],"domain_scores_gemma":[0.9968574,0.0019396156,0.00028316525,0.00030099237,0.0003684793,0.00025025496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012700841,0.00071795547,0.00055427256,0.0038888096,0.0016151568,0.0025301846,0.0011626602,0.0010655614,0.01205922],"category_scores_gemma":[0.00745211,0.00046741086,0.00085308676,0.0018644903,0.0016387056,0.0034338897,0.0015291017,0.0018960409,0.0025066563],"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.00001133754,0.000014487816,0.00019037056,0.000018214143,0.0000033264253,0.00003850885,0.00010362584,0.00063317484,0.00020672198,0.9891237,0.0024300956,0.0072263684],"study_design_scores_gemma":[0.0000122161755,0.000010598061,0.00023592667,0.000023263772,0.0000052038704,0.0002544629,0.00007001041,0.010020393,0.00042019365,0.98292255,0.006009309,0.00001590742],"about_ca_topic_score_codex":0.00051968737,"about_ca_topic_score_gemma":0.0006104346,"teacher_disagreement_score":0.01205922,"about_ca_system_score_codex":0.0011541289,"about_ca_system_score_gemma":0.0006679014,"threshold_uncertainty_score":0.040342093},"labels":[],"label_agreement":null},{"id":"W2408391094","doi":"","title":"On The Max-Type Equation.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Geology","score_opus":0.014663195224017043,"score_gpt":0.23500135906474198,"score_spread":0.22033816384072494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408391094","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039059784,0.0053210575,0.42430118,0.016023437,0.0034169136,0.00007548136,0.0015595544,0.0005791339,0.5096635],"genre_scores_gemma":[0.595306,0.005112626,0.12368224,0.00789288,0.0040263645,0.0002718628,0.0019162713,0.00090902945,0.2608827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923205,0.00024470736,0.00004166042,0.00013589824,0.00023140098,0.00011415504],"domain_scores_gemma":[0.99804926,0.0011538293,0.00013096194,0.0002239481,0.00033672675,0.00010529683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012079346,0.00055356923,0.0007973679,0.0008957172,0.0012216804,0.0021446825,0.0013884783,0.0015575984,0.02828997],"category_scores_gemma":[0.0070338817,0.00038323185,0.0008505166,0.0014601453,0.0018712805,0.008755927,0.0022735882,0.00483865,0.0067247027],"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.000025492014,0.0000109752655,0.00019156827,0.00004563974,0.000006113551,0.000037450543,0.000053364776,0.00045335732,0.00021445916,0.9764721,0.013734762,0.008754686],"study_design_scores_gemma":[0.000010712517,0.000005605241,0.000113433955,0.00001682675,0.000004788819,0.000077745295,0.000024261946,0.004101639,0.00017711923,0.98737633,0.0080846865,0.000006666788],"about_ca_topic_score_codex":0.0012487789,"about_ca_topic_score_gemma":0.0022453621,"teacher_disagreement_score":0.02828997,"about_ca_system_score_codex":0.0011348601,"about_ca_system_score_gemma":0.0007269502,"threshold_uncertainty_score":0.09463936},"labels":[],"label_agreement":null},{"id":"W2416294048","doi":"10.1007/978-3-319-32557-6_6","title":"Development of Krylov and AMG Linear Solvers for Large-Scale Sparse Matrices on GPUs","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Krylov subspace; Computer science; Solver; Parallel computing; Computational science; Generalized minimal residual method; Linear system; Sparse matrix; Iterative method; CUDA; Algorithm; Mathematics; Programming language; Chemistry","score_opus":0.01598613731197933,"score_gpt":0.24586210336917785,"score_spread":0.2298759660571985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2416294048","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051100734,0.00217542,0.9618298,0.0005678097,0.0003987395,0.00012224636,0.00030113917,0.004538046,0.024956807],"genre_scores_gemma":[0.027570222,0.0017398089,0.95293146,0.00020958621,0.00014782826,0.0001641026,0.0007279826,0.0013228796,0.015186198],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943024,0.000082015176,0.000032950724,0.00007471677,0.00032947163,0.000050576247],"domain_scores_gemma":[0.99926203,0.00013136325,0.000027829486,0.00014067655,0.00037255615,0.000065391476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066288345,0.0010897025,0.00080879853,0.0007446951,0.0004642321,0.0012951518,0.002155009,0.0009916046,0.012209639],"category_scores_gemma":[0.0020609812,0.0008654893,0.00091622514,0.001509724,0.00050581514,0.001626035,0.0015777302,0.00323517,0.0075654853],"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.0001302553,0.00015415081,0.0007527481,0.0008093391,0.0001225713,0.00019461584,0.00028536865,0.10552509,0.027388107,0.1460879,0.06455492,0.653995],"study_design_scores_gemma":[0.000066197725,0.000073471594,0.00033098232,0.00013473062,0.000027549957,0.00017643352,0.00004512291,0.774415,0.017049184,0.04592181,0.16171305,0.000046532004],"about_ca_topic_score_codex":0.0027749108,"about_ca_topic_score_gemma":0.0043099914,"teacher_disagreement_score":0.012209639,"about_ca_system_score_codex":0.00071612117,"about_ca_system_score_gemma":0.0013323247,"threshold_uncertainty_score":0.040845275},"labels":[],"label_agreement":null},{"id":"W2425279105","doi":"10.1007/s40324-016-0088-7","title":"GMRES with multiple preconditioners","year":2016,"lang":"en","type":"article","venue":"SeMA Journal","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada","keywords":"Generalized minimal residual method; Krylov subspace; Residual; Block (permutation group theory); Computer science; Mathematical optimization; Norm (philosophy); Heuristic; Algorithm; Subspace topology; Mathematics; Iterative method; Combinatorics; Artificial intelligence","score_opus":0.007062434585224631,"score_gpt":0.20841074018751016,"score_spread":0.20134830560228553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2425279105","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030308913,0.00016726945,0.98810774,0.0002697954,0.00031598398,0.00004019796,0.00013659845,0.0008445242,0.0070869927],"genre_scores_gemma":[0.051122192,0.00020300502,0.92955875,0.00017600767,0.00020735431,0.00019927268,0.00024014259,0.0007510463,0.017542275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991689,0.00029036385,0.0000471372,0.00010720773,0.00033498375,0.000051474944],"domain_scores_gemma":[0.99888915,0.0003460356,0.00010734476,0.00033426518,0.00025756218,0.00006569229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007586787,0.0012354584,0.0011261747,0.00063379464,0.0006055021,0.0008599841,0.0012177095,0.0016671197,0.014685994],"category_scores_gemma":[0.0035546045,0.0005221825,0.0008000729,0.0008583398,0.00069425517,0.0012240916,0.002218371,0.0025155882,0.0052926387],"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.00034184032,0.000133431,0.0005309215,0.00076305046,0.00019985193,0.00052710215,0.0002559907,0.3340598,0.024533167,0.21438532,0.037052225,0.38721722],"study_design_scores_gemma":[0.00007877424,0.00008255988,0.00024078494,0.00006930434,0.000039818937,0.00021824714,0.00005588882,0.8751472,0.01608685,0.06474651,0.043192945,0.00004120645],"about_ca_topic_score_codex":0.0016632631,"about_ca_topic_score_gemma":0.003993388,"teacher_disagreement_score":0.014685994,"about_ca_system_score_codex":0.00031623064,"about_ca_system_score_gemma":0.0010374488,"threshold_uncertainty_score":0.049129546},"labels":[],"label_agreement":null},{"id":"W2464434531","doi":"10.1016/j.jmaa.2016.06.012","title":"Derivatives of functions of eigenvalues and eigenvectors for symmetric matrices","year":2016,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Science Foundation of Ministry of Education of China; Natural Sciences and Engineering Research Council of Canada","keywords":"Eigenvalues and eigenvectors; Mathematics; Differentiable function; Eigenvalue perturbation; Eigenvalues and eigenvectors of the second derivative; Inverse; Class (philosophy); Matrix differential equation; Spectrum of a matrix; Pure mathematics; Matrix (chemical analysis); Applied mathematics; Mathematical analysis; Differential equation; Geometry","score_opus":0.014556091023144951,"score_gpt":0.264728404689498,"score_spread":0.25017231366635306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2464434531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.125245,0.0023385496,0.8470564,0.0013776406,0.000466851,0.000049726343,0.0003160853,0.00045092907,0.02269893],"genre_scores_gemma":[0.843928,0.0031712689,0.11978598,0.00034865068,0.00041886026,0.00009836076,0.0003199548,0.0006441687,0.031284716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994295,0.00019799158,0.0000359272,0.00008884396,0.00017509995,0.00007246725],"domain_scores_gemma":[0.99496883,0.0029213636,0.00056107726,0.00029484896,0.0008641177,0.0003899139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020387424,0.0009948049,0.00055680145,0.0026063975,0.00060506136,0.0027624352,0.0009805934,0.0011289353,0.0048541864],"category_scores_gemma":[0.013116444,0.0004005019,0.0005445788,0.0014372119,0.0023357435,0.0037101458,0.0010106812,0.0016385005,0.0007898058],"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.00011527271,0.000065568885,0.0009378718,0.00016798702,0.00002782755,0.00026946462,0.00054112345,0.025506767,0.0072934683,0.9230415,0.0037287753,0.038304254],"study_design_scores_gemma":[0.00001598413,0.00004552135,0.0016163866,0.00006535711,0.000023071583,0.0004324625,0.0002490757,0.2406948,0.002575065,0.7487945,0.00541502,0.00007267696],"about_ca_topic_score_codex":0.0016905972,"about_ca_topic_score_gemma":0.0017806183,"teacher_disagreement_score":0.0048541864,"about_ca_system_score_codex":0.0013198999,"about_ca_system_score_gemma":0.0012163237,"threshold_uncertainty_score":0.016238809},"labels":[],"label_agreement":null},{"id":"W2466466179","doi":"","title":"On the Null Space Structure Associated with Trees and Cycles","year":2013,"lang":"en","type":"article","venue":"NSUWorks (Nova Southeastern University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada","keywords":"Null (SQL); Mathematics; Context (archaeology); Space (punctuation); Combinatorics; Pure mathematics; Discrete mathematics; Computer science; Geography; Data mining","score_opus":0.00906280898097382,"score_gpt":0.1711542968351127,"score_spread":0.1620914878541389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2466466179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45160118,0.0006585997,0.52122945,0.000784711,0.000099607234,0.000079162994,0.0004275065,0.00026495138,0.024854833],"genre_scores_gemma":[0.94557786,0.0005170728,0.043741554,0.00019327384,0.00019661912,0.00012975879,0.0006089226,0.00015220522,0.008882843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854136,0.00047302095,0.000071427065,0.00021926808,0.00045389272,0.00024106842],"domain_scores_gemma":[0.9939469,0.0028645983,0.00082582294,0.00054137566,0.0011614715,0.00065977057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014715344,0.00067724165,0.00055953703,0.003106401,0.0014945775,0.003125563,0.0009825306,0.0009355463,0.0057337494],"category_scores_gemma":[0.00783887,0.00036817227,0.00062894914,0.0018964767,0.0038264187,0.005669873,0.0024202114,0.0013708456,0.0007141308],"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.000032217056,0.00001594183,0.0005133793,0.000023248467,0.0000062116906,0.00008957524,0.00023278785,0.0018256,0.001005633,0.99215853,0.00033576222,0.0037610943],"study_design_scores_gemma":[0.0000073310557,0.000043280485,0.00031265544,0.0000196696,0.000005727041,0.00013526397,0.00021727427,0.029404359,0.00084078714,0.9672415,0.0017475145,0.000024650742],"about_ca_topic_score_codex":0.001210762,"about_ca_topic_score_gemma":0.00080778566,"teacher_disagreement_score":0.0057337494,"about_ca_system_score_codex":0.00070477795,"about_ca_system_score_gemma":0.00067035755,"threshold_uncertainty_score":0.019181311},"labels":[],"label_agreement":null},{"id":"W2467953035","doi":"10.1090/conm/579/11527","title":"On the Waring Problem with multivariate Dickson polynomials","year":2012,"lang":"en","type":"other","venue":"Contemporary mathematics - American Mathematical Society","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":"Carleton University","funders":"","keywords":"Mathematics; Multivariate statistics; Combinatorics; Algebra over a field; Pure mathematics; Statistics","score_opus":0.026057226920289344,"score_gpt":0.2546785888681168,"score_spread":0.22862136194782745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2467953035","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42997202,0.0023981985,0.45113882,0.0046965866,0.0006001468,0.00014698866,0.00067042105,0.0004983874,0.10987853],"genre_scores_gemma":[0.90899503,0.002160047,0.056643613,0.00054414273,0.0010298262,0.00011444018,0.00074994366,0.00028901407,0.029473918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983944,0.00034482218,0.00008263603,0.00036722462,0.00035104254,0.00045988546],"domain_scores_gemma":[0.9930367,0.004481241,0.00071988173,0.0006120141,0.00048451943,0.00066566997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025530073,0.0011638413,0.0012639469,0.0022539287,0.0020289728,0.0021383995,0.0011214494,0.0012155152,0.013605788],"category_scores_gemma":[0.010330181,0.0005249322,0.0013434675,0.0019858973,0.003982633,0.009471508,0.004009665,0.0042520426,0.0014946304],"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.00012943374,0.00003570055,0.0005459086,0.00013196582,0.000015665839,0.00020766367,0.00024780195,0.006806796,0.0016209782,0.9693633,0.002383396,0.018511426],"study_design_scores_gemma":[0.000021052885,0.00004581319,0.0003515637,0.00002726985,0.000016261025,0.00014341473,0.00018958803,0.026070066,0.0022443498,0.96576923,0.0050878213,0.000033570974],"about_ca_topic_score_codex":0.0013001171,"about_ca_topic_score_gemma":0.00074660074,"teacher_disagreement_score":0.013605788,"about_ca_system_score_codex":0.0017282186,"about_ca_system_score_gemma":0.0008923027,"threshold_uncertainty_score":0.045515954},"labels":[],"label_agreement":null},{"id":"W2470677901","doi":"10.1016/j.camwa.2016.06.027","title":"Preconditioned GMRES solver on multiple-GPU architecture","year":2016,"lang":"en","type":"article","venue":"Computers & Mathematics with 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":"University of Calgary","funders":"Western Canada Research Grid; CMG Reservoir Simulation Foundation; University of Florida","keywords":"Generalized minimal residual method; Preconditioner; Solver; Parallel computing; Computer science; Multiplication (music); Computational science; CUDA; Iterative method; Algorithm; Mathematics","score_opus":0.010149531260895784,"score_gpt":0.22389634658398527,"score_spread":0.21374681532308948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2470677901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16308774,0.0008514835,0.7818878,0.0010015905,0.0005498243,0.00013841386,0.00088166614,0.009081741,0.042519722],"genre_scores_gemma":[0.4172708,0.0002531169,0.5651633,0.00014825822,0.00007062842,0.00015696777,0.0010574086,0.00048896973,0.015390551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997975,0.000047784415,0.00001397591,0.000034114728,0.000072639756,0.00003410848],"domain_scores_gemma":[0.9997154,0.00004145291,0.000018655144,0.00007058341,0.00012251383,0.00003135416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017575396,0.000554744,0.0006055722,0.00032118932,0.0005481711,0.0006102874,0.0011206821,0.00058320595,0.010819735],"category_scores_gemma":[0.00073824247,0.00028051462,0.000407563,0.00070330896,0.00022260114,0.00062591763,0.00078984944,0.0008082488,0.0018355864],"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.0008255674,0.0002579806,0.003301646,0.0004377177,0.00020083052,0.0008871425,0.0002753909,0.5854237,0.063298635,0.034245197,0.03984942,0.27099684],"study_design_scores_gemma":[0.000051836778,0.000039692364,0.00037066732,0.000008463196,0.000010303672,0.000047406378,0.000025746198,0.9862002,0.00510015,0.002867877,0.005268664,0.000009050316],"about_ca_topic_score_codex":0.0077106347,"about_ca_topic_score_gemma":0.011500226,"teacher_disagreement_score":0.010819735,"about_ca_system_score_codex":0.00038626386,"about_ca_system_score_gemma":0.0012836875,"threshold_uncertainty_score":0.036195636},"labels":[],"label_agreement":null},{"id":"W2472073381","doi":"10.4153/cmb-2016-045-7","title":"Characterizations and Representations of Core and Dual Core Inverses","year":2016,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Core (optical fiber); Dual (grammatical number); Element (criminal law); Inverse; Pure mathematics; Commutative property; Algebra over a field; Order (exchange); Ring (chemistry); Geometry; Linguistics; Computer science; Law","score_opus":0.02388299182852942,"score_gpt":0.2423627912624901,"score_spread":0.21847979943396068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2472073381","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46743417,0.0005307366,0.42158625,0.00060555374,0.00022541326,0.00008338129,0.00025408316,0.00039687642,0.10888358],"genre_scores_gemma":[0.9604885,0.00018693175,0.025806647,0.00013658896,0.00016011826,0.000043893408,0.00019168928,0.00008973387,0.01289588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990932,0.0001542781,0.00006894888,0.00023188128,0.00030300615,0.00014867146],"domain_scores_gemma":[0.99853146,0.00038493265,0.00021447605,0.0002660463,0.00042806554,0.00017505577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087736244,0.00042037238,0.00036703385,0.0014492866,0.0005475818,0.0020709853,0.0005892579,0.0005499298,0.006883077],"category_scores_gemma":[0.002377687,0.00021895864,0.00048182375,0.00057451066,0.0020887612,0.0031443061,0.0016326482,0.0016412602,0.00092250446],"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.000032885313,0.000027395805,0.00029509244,0.000027004427,0.0000041261605,0.00010722036,0.00033429812,0.0004938526,0.0034914433,0.9851959,0.00046416942,0.00952665],"study_design_scores_gemma":[0.000016157004,0.00007729033,0.00040093545,0.00002507795,0.000011924715,0.0005504371,0.00035973775,0.014232315,0.0079824785,0.9654947,0.010818513,0.00003040544],"about_ca_topic_score_codex":0.00022701046,"about_ca_topic_score_gemma":0.00018908642,"teacher_disagreement_score":0.006883077,"about_ca_system_score_codex":0.00044395318,"about_ca_system_score_gemma":0.00026763306,"threshold_uncertainty_score":0.023026228},"labels":[],"label_agreement":null},{"id":"W2477874061","doi":"10.1017/cbo9780511814525.009","title":"Interpolating linear operators","year":2009,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Université Laval","funders":"","keywords":"Mathematics; Computer science","score_opus":0.016108072075761655,"score_gpt":0.20269085561541272,"score_spread":0.18658278353965108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2477874061","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076845093,0.012052603,0.74012446,0.0009673163,0.0024669622,0.00005263033,0.00053741125,0.0015372259,0.23457687],"genre_scores_gemma":[0.16522688,0.017635709,0.33127394,0.0007903496,0.0015932997,0.00018368154,0.0014840765,0.0022364694,0.47957554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973255,0.000056540655,0.000011646302,0.000045937824,0.00012943336,0.000023882854],"domain_scores_gemma":[0.99974793,0.000105338324,0.000009670735,0.000060358634,0.00005619989,0.000020468691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006223874,0.00060182414,0.0005610671,0.0009280029,0.00044402576,0.00097512227,0.0005838853,0.00057206926,0.028821522],"category_scores_gemma":[0.0011839472,0.0003161441,0.00066739623,0.001133115,0.0007985396,0.0016742097,0.0015223136,0.0019756048,0.009255897],"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.00007889745,0.000029958806,0.00017313803,0.0004152308,0.000026061696,0.00008517947,0.00023252853,0.008420803,0.006469575,0.66392916,0.05505515,0.26508436],"study_design_scores_gemma":[0.000020839965,0.000092749564,0.00045796315,0.00023581971,0.00002762564,0.00038487648,0.00010491836,0.06180249,0.009369216,0.57301253,0.35445353,0.00003751172],"about_ca_topic_score_codex":0.00053742796,"about_ca_topic_score_gemma":0.00073136046,"teacher_disagreement_score":0.028821522,"about_ca_system_score_codex":0.00046677244,"about_ca_system_score_gemma":0.00048832333,"threshold_uncertainty_score":0.096417606},"labels":[],"label_agreement":null},{"id":"W2478277416","doi":"10.1017/cbo9780511805790.014","title":"Linear Vector Spaces","year":2009,"lang":"en","type":"other","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Victoria","funders":"","keywords":"Vector (molecular biology); Mathematics; Biology; Genetics","score_opus":0.009131856217248983,"score_gpt":0.2383029626677441,"score_spread":0.2291711064504951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478277416","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061260746,0.03135454,0.6584133,0.0045876494,0.0032528804,0.000096388445,0.0070343586,0.002892703,0.28624213],"genre_scores_gemma":[0.220913,0.0532597,0.17074127,0.0020369117,0.0068368227,0.0005013202,0.02087733,0.001876178,0.52295744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992105,0.00022682063,0.000045537894,0.00017665533,0.0002807919,0.00005982157],"domain_scores_gemma":[0.99919266,0.00024471522,0.00005653902,0.00018217109,0.00025367414,0.00007019859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072570663,0.0012350471,0.0007478099,0.001411662,0.0004525054,0.0024434193,0.0005710947,0.0005870884,0.063738436],"category_scores_gemma":[0.0022504549,0.00032185265,0.0005041889,0.0021338481,0.0007836303,0.0022581525,0.0013130071,0.0020860536,0.04119162],"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.0000606606,0.000043372518,0.00034692953,0.00058050914,0.00006104897,0.000084310035,0.00014915384,0.004925764,0.0021874814,0.44215578,0.25967315,0.28973186],"study_design_scores_gemma":[0.000029623645,0.000101272235,0.0008871048,0.00016858894,0.000027778962,0.0003982089,0.00009174452,0.021193588,0.0022552144,0.5742596,0.40055153,0.000035813617],"about_ca_topic_score_codex":0.00075732183,"about_ca_topic_score_gemma":0.0009183804,"teacher_disagreement_score":0.063738436,"about_ca_system_score_codex":0.00059145066,"about_ca_system_score_gemma":0.0007235194,"threshold_uncertainty_score":0.21322632},"labels":[],"label_agreement":null},{"id":"W2478347486","doi":"10.1063/1.4959228","title":"Using a pruned, nondirect product basis in conjunction with the multi-configuration time-dependent Hartree (MCTDH) method","year":2016,"lang":"en","type":"article","venue":"The Journal of Chemical Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hartree; Basis (linear algebra); Basis function; Hamiltonian (control theory); Pruning; Product (mathematics); Computer science; Mathematics; Mathematical optimization; Physics; Quantum mechanics; Mathematical analysis; Geometry","score_opus":0.024627694519326407,"score_gpt":0.2705192470769302,"score_spread":0.2458915525576038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478347486","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028955353,0.00023930876,0.96575224,0.0001374114,0.00005127691,0.000046995996,0.000058858717,0.0004716884,0.0042868783],"genre_scores_gemma":[0.1788889,0.00029266378,0.81786543,0.000109882545,0.000019970737,0.000114228606,0.00017584418,0.00020351958,0.0023294515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999671,0.00008657215,0.000014041765,0.000035446592,0.00016864885,0.000024366012],"domain_scores_gemma":[0.9995167,0.00017222564,0.000026972935,0.00016010262,0.00010086921,0.000023120072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046804,0.00030203522,0.00052626285,0.00034072026,0.0005463421,0.0006559795,0.0020270273,0.00069724326,0.0022491266],"category_scores_gemma":[0.001230496,0.00034877946,0.0003991794,0.0004504291,0.00047491764,0.0013326223,0.00074378087,0.00083142123,0.00070881],"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.00024638962,0.00016117211,0.0011750603,0.0004531367,0.0000962589,0.00065920246,0.00036279814,0.55972666,0.05417004,0.17692134,0.004216633,0.20181134],"study_design_scores_gemma":[0.000025320136,0.000036694288,0.00014343191,0.000013263354,0.000010721864,0.00010038404,0.000017130498,0.9773712,0.0062704976,0.013049734,0.0029451181,0.000016558068],"about_ca_topic_score_codex":0.0016344766,"about_ca_topic_score_gemma":0.0027536664,"teacher_disagreement_score":0.0022491266,"about_ca_system_score_codex":0.00029620354,"about_ca_system_score_gemma":0.0008627389,"threshold_uncertainty_score":0.007524073},"labels":[],"label_agreement":null},{"id":"W2480621714","doi":"10.1017/cbo9781139226752.009","title":"More advanced results in operator theory","year":2016,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Université Laval","funders":"","keywords":"Operator (biology); Computer science; Mathematics; Biology","score_opus":0.012319311295866345,"score_gpt":0.20178133590604297,"score_spread":0.18946202461017664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2480621714","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024793956,0.07338462,0.08112455,0.0080141,0.008475474,0.000038795308,0.0010114205,0.0007731451,0.8246985],"genre_scores_gemma":[0.04919997,0.057795577,0.03267192,0.003995612,0.008452026,0.00010310082,0.0016722319,0.0009955743,0.84511405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99951804,0.00009939571,0.000019506619,0.000075759905,0.00023272066,0.00005461269],"domain_scores_gemma":[0.99958163,0.00015735553,0.00001868924,0.000080645514,0.00011156381,0.000050127117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074768905,0.0009847573,0.0008109643,0.0017827597,0.0007011991,0.0022177442,0.00063474855,0.0008566753,0.08258846],"category_scores_gemma":[0.001263543,0.00028728048,0.0010432906,0.0022810912,0.0012741776,0.003756641,0.001129282,0.0029475174,0.02805395],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018155224,0.00004859628,0.000104032566,0.0005616872,0.000024481273,0.00008093207,0.00022419597,0.0008020104,0.0013546799,0.5551681,0.33381554,0.10779753],"study_design_scores_gemma":[0.000007549518,0.000021101385,0.00030456856,0.00019436514,0.000008951724,0.00020658811,0.00007729055,0.00092449423,0.00035790598,0.47621718,0.52166706,0.000012765578],"about_ca_topic_score_codex":0.0007727017,"about_ca_topic_score_gemma":0.0015326039,"teacher_disagreement_score":0.08258846,"about_ca_system_score_codex":0.0012523248,"about_ca_system_score_gemma":0.0009664683,"threshold_uncertainty_score":0.27628595},"labels":[],"label_agreement":null},{"id":"W2482762540","doi":"10.14288/1.0080660","title":"On the Hilbert-Pólya and Pair Correlation Conjectures","year":2014,"lang":"en","type":"article","venue":"Open Collections","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Mathematics; Correlation; Combinatorics; Pure mathematics; Geometry","score_opus":0.01057273860933763,"score_gpt":0.22586454329795905,"score_spread":0.2152918046886214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482762540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32448235,0.0076400586,0.45551652,0.034542374,0.0015424787,0.00010668809,0.00053177035,0.00080132176,0.17483637],"genre_scores_gemma":[0.95997816,0.0019285037,0.020514965,0.002426419,0.0021463938,0.00019261574,0.00025879737,0.00019611491,0.01235793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99609816,0.0015940896,0.00008507987,0.0006817459,0.0010054489,0.0005355652],"domain_scores_gemma":[0.966888,0.023604725,0.0017249251,0.0034270342,0.0025143344,0.0018410522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075279293,0.0007233539,0.0017290052,0.0023382418,0.003812838,0.0050609056,0.0022803694,0.003204996,0.010755909],"category_scores_gemma":[0.04024952,0.00065417617,0.0011476781,0.002795335,0.012975351,0.014775402,0.0049550245,0.0060594543,0.001650615],"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.000024113868,0.0000146966895,0.00031602383,0.00001627374,0.000003999707,0.000033615524,0.00008684126,0.0016771761,0.000053832184,0.9930675,0.0022545068,0.0024514804],"study_design_scores_gemma":[0.000010747372,0.000009808961,0.00018747263,0.000018482673,0.0000027348135,0.000042171385,0.000057735528,0.014108689,0.00008182453,0.9841576,0.0013112047,0.000011462065],"about_ca_topic_score_codex":0.0014473185,"about_ca_topic_score_gemma":0.00064121594,"teacher_disagreement_score":0.010755909,"about_ca_system_score_codex":0.0022759538,"about_ca_system_score_gemma":0.0018160804,"threshold_uncertainty_score":0.03981197},"labels":[],"label_agreement":null},{"id":"W2484865016","doi":"10.1142/9789813100558_0002","title":"AN INTRODUCTION TO THE FINITE AND INFINITE DIMENSIONAL REDUCTION METHODS","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes series, Institute For Mathematical Sciences","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Reduction (mathematics); Mathematics; Applied mathematics; Computer science; Geometry","score_opus":0.028551348977368596,"score_gpt":0.30024631096241117,"score_spread":0.27169496198504256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2484865016","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014949123,0.117837705,0.61416155,0.0039887317,0.008638449,0.00008036037,0.0006191688,0.0010826305,0.25209647],"genre_scores_gemma":[0.044631705,0.1179244,0.58089894,0.00452144,0.01407324,0.00038228076,0.0013769375,0.0017654144,0.23442566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999432,0.00012271716,0.00004226222,0.00009886664,0.00027435707,0.000029729517],"domain_scores_gemma":[0.9994438,0.00032508682,0.000022290737,0.00008540456,0.00009623038,0.000027099806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066717615,0.0010832337,0.0011155339,0.0014932454,0.00052263885,0.0020946825,0.0014054914,0.0010499872,0.018528458],"category_scores_gemma":[0.001626192,0.0006871141,0.0011394921,0.0017656997,0.0024675252,0.0024819437,0.0013347727,0.004886041,0.011147109],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019750067,0.000058121463,0.000103902836,0.0005502911,0.000025600128,0.0000847862,0.00019663118,0.0026742057,0.0016748818,0.73089594,0.07976919,0.18394671],"study_design_scores_gemma":[0.0000089796495,0.000024672465,0.00018389401,0.00018295797,0.000010179712,0.00031557752,0.000034154997,0.004636641,0.00058149546,0.55126876,0.4427195,0.000033244785],"about_ca_topic_score_codex":0.00068417296,"about_ca_topic_score_gemma":0.00091792113,"teacher_disagreement_score":0.018528458,"about_ca_system_score_codex":0.00076217804,"about_ca_system_score_gemma":0.0007824159,"threshold_uncertainty_score":0.061983883},"labels":[],"label_agreement":null},{"id":"W2487620220","doi":"10.1016/j.laa.2016.09.032","title":"The uniform normal form of a linear mapping","year":2016,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.011584228406707031,"score_gpt":0.23431611259169166,"score_spread":0.22273188418498463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2487620220","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15875022,0.0017476598,0.6995195,0.003151502,0.0020563498,0.000097295895,0.0009312686,0.00058205205,0.13316415],"genre_scores_gemma":[0.8405165,0.0021285191,0.06859562,0.0010376978,0.0020839307,0.00019256718,0.0008193316,0.0004913986,0.084134445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839526,0.00041614912,0.00010232456,0.0005665525,0.0003472758,0.00017231185],"domain_scores_gemma":[0.9982161,0.0005617828,0.00023146327,0.00025651357,0.0005403965,0.00019382797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012462877,0.00095679285,0.0007031434,0.0022557632,0.0010804515,0.0029640377,0.0010694788,0.0009591577,0.010878443],"category_scores_gemma":[0.004800957,0.0005224329,0.0005258953,0.002253842,0.004134119,0.007913646,0.0023112602,0.0025436939,0.0021494513],"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.00002814238,0.000013873191,0.00010965146,0.000021477324,0.000004869409,0.000046707362,0.00018679738,0.000392729,0.00080288656,0.9857389,0.0017274739,0.010926565],"study_design_scores_gemma":[0.000007083124,0.000024070554,0.00010029962,0.000009414395,0.0000046065456,0.00016946906,0.00006345872,0.0037979854,0.0005693502,0.98841023,0.006830102,0.000013982265],"about_ca_topic_score_codex":0.00065815053,"about_ca_topic_score_gemma":0.00033948215,"teacher_disagreement_score":0.010878443,"about_ca_system_score_codex":0.00067851535,"about_ca_system_score_gemma":0.0006246188,"threshold_uncertainty_score":0.036392033},"labels":[],"label_agreement":null},{"id":"W24877352","doi":"10.1007/bfb0006122","title":"Some numerical problems arising from linear systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in control and information sciences","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Simple (philosophy); Computer science; Linear system; Mathematical optimization; Applied mathematics; Algorithm; Mathematics; Mathematical analysis; Epistemology","score_opus":0.011740292336501373,"score_gpt":0.22666244061923402,"score_spread":0.21492214828273265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24877352","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016565308,0.010120146,0.89227194,0.008144999,0.0017472348,0.00007408622,0.00012958926,0.0001952586,0.07075151],"genre_scores_gemma":[0.45303205,0.011500938,0.42877632,0.0025330489,0.004139602,0.0005262482,0.00043640492,0.0005253276,0.098530054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985286,0.00073130126,0.00009464792,0.00011472885,0.00048530285,0.00004543891],"domain_scores_gemma":[0.9935767,0.005279886,0.00029165403,0.00025933073,0.00047354613,0.00011892597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025765256,0.0010399008,0.0010335526,0.0010684849,0.0011007509,0.0024289675,0.0011729789,0.0028462964,0.0070322235],"category_scores_gemma":[0.022248812,0.000684857,0.00088243646,0.0017833478,0.0036379513,0.0032956395,0.0029621173,0.003800874,0.0007038345],"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.00006497626,0.000044387358,0.00036851494,0.0005095502,0.000033157932,0.00019094034,0.00031367954,0.115102075,0.0008416166,0.831538,0.008048366,0.04294474],"study_design_scores_gemma":[0.0000251661,0.000022669426,0.00016761544,0.0001121919,0.000012330186,0.00014250797,0.00008343454,0.24757117,0.00047741912,0.74043244,0.010933398,0.000019552315],"about_ca_topic_score_codex":0.0012252738,"about_ca_topic_score_gemma":0.0009904206,"teacher_disagreement_score":0.0070322235,"about_ca_system_score_codex":0.0010460479,"about_ca_system_score_gemma":0.00068916776,"threshold_uncertainty_score":0.023525119},"labels":[],"label_agreement":null},{"id":"W2487852097","doi":"10.1007/978-3-319-30379-6_39","title":"Determining Sparse Jacobian Matrices Using Two-Sided Compression: An Algorithm and Lower Bounds","year":2016,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Jacobian matrix and determinant; Matrix (chemical analysis); Sparse matrix; Compression (physics); Algorithm; Set (abstract data type); Mathematics; Computer science; Applied mathematics","score_opus":0.030921133846889135,"score_gpt":0.27309491529453006,"score_spread":0.24217378144764093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2487852097","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004747006,0.0011933122,0.9831056,0.0004124107,0.0002301259,0.00012686019,0.00022262851,0.0012284792,0.008733603],"genre_scores_gemma":[0.05322515,0.0016957734,0.92912185,0.0002818744,0.00063534034,0.0003278645,0.0011961824,0.00060083676,0.012915168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716896,0.00037575554,0.00014988589,0.00044600526,0.0016325362,0.00022685988],"domain_scores_gemma":[0.9910874,0.005351725,0.00034110967,0.0016404697,0.0013507294,0.0002285784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017015524,0.003416469,0.0023238335,0.0025097656,0.0011930367,0.003827706,0.0029546292,0.0026181978,0.015971191],"category_scores_gemma":[0.0155952675,0.0011824189,0.0014573205,0.0035126032,0.0019249024,0.006689042,0.0050124885,0.004977823,0.009979748],"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.00031464634,0.0002890655,0.0009825878,0.00063855585,0.00010112356,0.00034214652,0.00024229381,0.06780332,0.015400513,0.093239486,0.033985194,0.786661],"study_design_scores_gemma":[0.000087711545,0.00017948459,0.00067622797,0.0001539293,0.00008420332,0.0011055695,0.00015543944,0.813657,0.02269162,0.14571491,0.015394018,0.000100014135],"about_ca_topic_score_codex":0.0026074687,"about_ca_topic_score_gemma":0.0051830406,"teacher_disagreement_score":0.015971191,"about_ca_system_score_codex":0.0010905743,"about_ca_system_score_gemma":0.0024099846,"threshold_uncertainty_score":0.053428948},"labels":[],"label_agreement":null},{"id":"W24921706","doi":"10.13001/1081-3810.1120","title":"On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices","year":2004,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":43,"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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Inverse; Multiplicity (mathematics); Graph; Symmetric matrix; Discrete mathematics; Mathematical analysis","score_opus":0.011138583638077884,"score_gpt":0.27106278956923513,"score_spread":0.2599242059311572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24921706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15592475,0.0019678664,0.67151535,0.04404648,0.0025546174,0.00026577743,0.0012089459,0.0007231334,0.12179314],"genre_scores_gemma":[0.75061697,0.0022054324,0.18389532,0.012275443,0.007003955,0.00076757383,0.0029215547,0.00055335,0.03976029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949067,0.0016912661,0.00031264903,0.0014834855,0.0009353875,0.0006704801],"domain_scores_gemma":[0.9503417,0.03524129,0.0034816642,0.005361381,0.00315606,0.0024180578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073183607,0.0011204302,0.001394302,0.0023343496,0.003055319,0.005553247,0.0032678328,0.0062347827,0.018889772],"category_scores_gemma":[0.044987883,0.0008597428,0.0016592845,0.0023279993,0.010058041,0.016076853,0.004689034,0.0061298828,0.0025202073],"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.00027221307,0.00014936941,0.0009711291,0.0001523913,0.000015977532,0.00017813087,0.000575749,0.003601599,0.00055698055,0.9691526,0.012867016,0.011506764],"study_design_scores_gemma":[0.000028628076,0.000037022335,0.00022306574,0.0000292708,0.000005883403,0.00010705843,0.00018333984,0.0068899277,0.00031449422,0.9897569,0.0024051226,0.000019386138],"about_ca_topic_score_codex":0.00068672455,"about_ca_topic_score_gemma":0.0006748555,"teacher_disagreement_score":0.018889772,"about_ca_system_score_codex":0.0015108616,"about_ca_system_score_gemma":0.0011317208,"threshold_uncertainty_score":0.063192606},"labels":[],"label_agreement":null},{"id":"W2492928824","doi":"10.1017/cbo9781139025409.012","title":"Elementary results from vector analysis","year":2013,"lang":"en","type":"other","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"York University","funders":"","keywords":"Vector (molecular biology); Computer science; Mathematics; Biology; Genetics","score_opus":0.008910685539459883,"score_gpt":0.2263912541948784,"score_spread":0.2174805686554185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2492928824","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075781085,0.038978208,0.6206273,0.004688606,0.0020892462,0.00006487694,0.0026412348,0.0013956038,0.32193688],"genre_scores_gemma":[0.38964924,0.10632235,0.22737221,0.0040706745,0.0093660215,0.0005311234,0.009379357,0.002849764,0.25045934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991253,0.00027115477,0.00005731061,0.00014193308,0.0003301318,0.00007414776],"domain_scores_gemma":[0.9985588,0.0006128691,0.000071006885,0.00032749472,0.00034431106,0.000085487845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013236287,0.0011673833,0.0009893713,0.0028582853,0.00068128604,0.0024670686,0.0006942062,0.00048333182,0.021769105],"category_scores_gemma":[0.0041353386,0.0003018392,0.0010238995,0.0033158988,0.0017521714,0.0026795198,0.0015274223,0.002874896,0.012399406],"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.000030426003,0.000030012165,0.0004927809,0.00060466095,0.000073057134,0.00007805586,0.00017336817,0.0023025637,0.001024555,0.7842299,0.06865091,0.1423098],"study_design_scores_gemma":[0.000009322582,0.000020261912,0.0006394662,0.00011502704,0.000024548852,0.00016008504,0.000037334274,0.0030148416,0.0007974278,0.9242209,0.07094434,0.000016467557],"about_ca_topic_score_codex":0.0010666512,"about_ca_topic_score_gemma":0.0011743591,"teacher_disagreement_score":0.021769105,"about_ca_system_score_codex":0.0009841077,"about_ca_system_score_gemma":0.00077232294,"threshold_uncertainty_score":0.072824895},"labels":[],"label_agreement":null},{"id":"W2495761069","doi":"10.1007/978-3-0348-0221-5","title":"A Panorama of Modern Operator Theory and Related Topics","year":2012,"lang":"en","type":"book","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Panorama; Operator (biology); Computer science; Artificial intelligence; Biology","score_opus":0.008622352984746302,"score_gpt":0.2183149556116267,"score_spread":0.2096926026268804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2495761069","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003015751,0.1852019,0.108826995,0.012990619,0.01389047,0.00006419964,0.0006799175,0.0011220352,0.6742081],"genre_scores_gemma":[0.022146048,0.15988426,0.061081063,0.0050125686,0.020613646,0.00013652707,0.0009571893,0.001052827,0.7291159],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997273,0.000028328734,0.000010464981,0.000042028452,0.00017523147,0.000016603934],"domain_scores_gemma":[0.99958545,0.00019952212,0.00001544085,0.000040582956,0.00011569919,0.000043209642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025724768,0.00078979484,0.0006535735,0.0020918208,0.00077276863,0.0028281573,0.0008114885,0.00093234057,0.038758717],"category_scores_gemma":[0.0010228198,0.00032670604,0.00046345234,0.0038696555,0.0012299318,0.0046752566,0.0010634541,0.0022128252,0.015857672],"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.00002204618,0.000040063725,0.00009098652,0.00052685733,0.000011923663,0.00005073052,0.00016492116,0.0008324257,0.0016576793,0.32117766,0.35025287,0.3251718],"study_design_scores_gemma":[0.000004470241,0.000012837508,0.00017556759,0.00013219604,0.0000056348717,0.00018620455,0.000047953632,0.001073542,0.000290598,0.21333338,0.78472364,0.000013899768],"about_ca_topic_score_codex":0.0004766549,"about_ca_topic_score_gemma":0.0013695641,"teacher_disagreement_score":0.038758717,"about_ca_system_score_codex":0.00071382493,"about_ca_system_score_gemma":0.00089122436,"threshold_uncertainty_score":0.12966084},"labels":[],"label_agreement":null},{"id":"W2495950437","doi":"10.1090/fim/020/27","title":"Normalization of intertwining operators","year":2009,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Toronto","funders":"","keywords":"Normalization (sociology); Computer science; Mathematics; Sociology; Social science","score_opus":0.011737478149597969,"score_gpt":0.23809046910373116,"score_spread":0.2263529909541332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2495950437","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027699571,0.004688719,0.30513135,0.0021037634,0.00376002,0.00007695008,0.00022523897,0.000647086,0.65566736],"genre_scores_gemma":[0.35326225,0.00896252,0.18998827,0.0022646703,0.004257857,0.000442856,0.0006885605,0.0017223011,0.4384108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989587,0.0002603337,0.00004999384,0.00023651448,0.00039947708,0.000094831565],"domain_scores_gemma":[0.9993111,0.00014734278,0.00006447484,0.00018474969,0.0002153511,0.000076955956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012151772,0.00090382784,0.00077391055,0.0017884746,0.0015527406,0.0028558255,0.0011106731,0.0010060588,0.012600649],"category_scores_gemma":[0.0023912236,0.00050353643,0.000681574,0.0016707901,0.0037340152,0.0055166516,0.0017777008,0.0034492316,0.0042470647],"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.000005046215,0.0000075457906,0.000014081927,0.000013959168,0.0000017470182,0.000011649427,0.000074768126,0.00013051662,0.00053058367,0.98698086,0.0026011465,0.009628163],"study_design_scores_gemma":[0.000003339901,0.0000051205193,0.000048249552,0.000010727487,0.0000018932486,0.00006172743,0.00003019711,0.00091871904,0.0005166348,0.97407794,0.02431827,0.0000071716972],"about_ca_topic_score_codex":0.0005191628,"about_ca_topic_score_gemma":0.0005860567,"teacher_disagreement_score":0.012600649,"about_ca_system_score_codex":0.0012330173,"about_ca_system_score_gemma":0.00086444797,"threshold_uncertainty_score":0.042153418},"labels":[],"label_agreement":null},{"id":"W2496962463","doi":"10.1142/9789814417099_0067","title":"Extension of Harten's Artificial Compression Method and of an Entropy-based Detector of Discontinuity to Unstructured Triangular Grids, using Arminjon-Viallon's Staggered Central Scheme","year":2012,"lang":"en","type":"book-chapter","venue":"Series in contemporary applied mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Discontinuity (linguistics); Extension (predicate logic); Entropy (arrow of time); Computer science; Mathematics; Materials science; Physics; Thermodynamics; Mathematical analysis","score_opus":0.04513269057032041,"score_gpt":0.2835192916056745,"score_spread":0.2383866010353541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496962463","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004558429,0.00026820233,0.9889714,0.00011725723,0.00014721244,0.000040251245,0.00004018949,0.00018699486,0.005669973],"genre_scores_gemma":[0.1590671,0.00072642,0.822731,0.00015183655,0.00013280577,0.00008664646,0.00012967478,0.00024543406,0.01672913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972254,0.000057386067,0.00001423179,0.000043995733,0.00014649545,0.000015464897],"domain_scores_gemma":[0.9994555,0.00020285066,0.000036119385,0.00014969386,0.00012578239,0.000029975452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004236236,0.00037804656,0.0004692589,0.0009819678,0.00031606905,0.0009724235,0.000932968,0.00077763974,0.0031156673],"category_scores_gemma":[0.0018660912,0.00028068828,0.00046542642,0.0007448374,0.0011395633,0.0011375681,0.001274177,0.0014728445,0.00065143773],"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.00013530951,0.00007434472,0.0004098463,0.0002532328,0.00002908662,0.00014865535,0.0002110223,0.11547823,0.027088197,0.5055406,0.005831516,0.34479994],"study_design_scores_gemma":[0.000014669795,0.00006053008,0.00027194995,0.000024914689,0.0000081983035,0.00027424053,0.00002297741,0.8930331,0.011641887,0.0815153,0.013096811,0.000035398552],"about_ca_topic_score_codex":0.00081872777,"about_ca_topic_score_gemma":0.0008747064,"teacher_disagreement_score":0.0031156673,"about_ca_system_score_codex":0.00043605102,"about_ca_system_score_gemma":0.0006377055,"threshold_uncertainty_score":0.010422885},"labels":[],"label_agreement":null},{"id":"W2497107028","doi":"10.5948/upo9781614445180.009","title":"Calculus: Integration and Differential Equations","year":2000,"lang":"en","type":"book-chapter","venue":"MAA spectrum","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Calculus (dental); Differential calculus; Applied mathematics; Differential (mechanical device); Mathematics; Differential equation; Computer science; Algebra over a field; Mathematical analysis; Pure mathematics; Physics; Medicine; Dentistry; Thermodynamics","score_opus":0.011734801686126497,"score_gpt":0.21639996704525127,"score_spread":0.20466516535912477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2497107028","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054166224,0.16802287,0.1774649,0.00679066,0.007389808,0.000045381938,0.00029781752,0.0006008258,0.6339711],"genre_scores_gemma":[0.1467832,0.09627639,0.059321396,0.0028056,0.012267306,0.00019729714,0.00042967306,0.000678208,0.6812409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976176,0.000043457632,0.0000113118485,0.00003718476,0.00012980154,0.00001654665],"domain_scores_gemma":[0.9997708,0.00009824832,0.000014415402,0.00003226359,0.00006522523,0.000019004718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041081544,0.0011484929,0.0012721714,0.0016395124,0.0008854412,0.003392004,0.0008990904,0.0012315084,0.011108004],"category_scores_gemma":[0.0010471606,0.00046095485,0.0005156005,0.0026309306,0.0020144465,0.0041022995,0.00086534716,0.002766359,0.0044970284],"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.0000036224458,0.000018658218,0.000034211218,0.0001158688,0.000006204894,0.000020383362,0.00012303391,0.000549421,0.00030279026,0.92870706,0.035654925,0.034463823],"study_design_scores_gemma":[0.000004081652,0.000005519184,0.00011213803,0.000051615396,0.0000059493123,0.00008018531,0.00003374767,0.0016518093,0.00011930781,0.8487192,0.14920934,0.0000070520855],"about_ca_topic_score_codex":0.0013827928,"about_ca_topic_score_gemma":0.0019660634,"teacher_disagreement_score":0.011108004,"about_ca_system_score_codex":0.0016666695,"about_ca_system_score_gemma":0.0009726482,"threshold_uncertainty_score":0.03715998},"labels":[],"label_agreement":null},{"id":"W2505409826","doi":"10.1007/0-387-24344-5_4","title":"Problems in Non-Linear Engel Functions","year":2005,"lang":"en","type":"book-chapter","venue":"Advanced studies in theoretical and applied econometrics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Applied mathematics; Econometrics; Economics","score_opus":0.02644476760545443,"score_gpt":0.25901379508246936,"score_spread":0.2325690274770149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2505409826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025729233,0.0058772187,0.87056303,0.015142397,0.0008923464,0.00004223987,0.00037215353,0.00019602464,0.08118525],"genre_scores_gemma":[0.61432534,0.010408117,0.18195997,0.002996723,0.0029709663,0.00040681378,0.00070751674,0.0006055031,0.18561903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982508,0.0010679511,0.00009587876,0.00023334663,0.00025965646,0.000092368005],"domain_scores_gemma":[0.98981726,0.008609465,0.0005185405,0.00045735537,0.0004647132,0.00013274718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038964585,0.0009798594,0.001753438,0.00097181083,0.0013131916,0.0037874738,0.0017776071,0.0038849728,0.011430893],"category_scores_gemma":[0.019776301,0.0009657849,0.0010834964,0.0022169698,0.004008635,0.0070756613,0.002053131,0.0037049851,0.0017446099],"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.0000032875307,0.000007247824,0.00006898213,0.000033997465,0.0000073022807,0.0000357979,0.00007486397,0.005253961,0.000022534088,0.988182,0.0020728325,0.0042370977],"study_design_scores_gemma":[0.0000033875879,0.0000012818605,0.000027928367,0.000010103058,0.0000017061793,0.000020261932,0.000032169915,0.00791893,0.000016264346,0.9903177,0.0016470039,0.0000032114785],"about_ca_topic_score_codex":0.0019298532,"about_ca_topic_score_gemma":0.0010655001,"teacher_disagreement_score":0.011430893,"about_ca_system_score_codex":0.0014988611,"about_ca_system_score_gemma":0.0009836283,"threshold_uncertainty_score":0.038240135},"labels":[],"label_agreement":null},{"id":"W2517490636","doi":"10.12988/ams.2015.55369","title":"Reducibility of the Kampe de Feriet function","year":2015,"lang":"en","type":"article","venue":"Applied Mathematical Sciences","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Research Nova Scotia; Dongguk University","keywords":"Computer science; Mathematics","score_opus":0.03937172935330191,"score_gpt":0.26701184040266346,"score_spread":0.22764011104936155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517490636","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5077125,0.002322042,0.2118097,0.0044663316,0.00084734615,0.00006084617,0.0004206632,0.00044588177,0.2719148],"genre_scores_gemma":[0.92665976,0.0011385396,0.021061936,0.000588967,0.0006905223,0.00005856576,0.00035186307,0.00027274847,0.049177025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949443,0.000119223354,0.000018140985,0.000098563265,0.00017306957,0.00009655277],"domain_scores_gemma":[0.9992379,0.0003170324,0.00008022181,0.00012651221,0.00013650094,0.00010189731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007642399,0.0008123817,0.0009891598,0.0022577797,0.001549962,0.0024094216,0.0009503863,0.001094847,0.008216824],"category_scores_gemma":[0.003369015,0.00035672588,0.001011076,0.00094125856,0.0026660615,0.003382587,0.0015797608,0.003443966,0.0016179442],"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.000031574793,0.000012810989,0.00007701202,0.000021264928,0.000006659698,0.000049882474,0.00011473477,0.0008588646,0.00054931093,0.9927471,0.0010602027,0.004470462],"study_design_scores_gemma":[0.000012508132,0.000014483365,0.00015702685,0.0000117212485,0.0000073322626,0.00013243305,0.000040254523,0.005654747,0.00082703517,0.98967266,0.003454932,0.000014775321],"about_ca_topic_score_codex":0.00084036426,"about_ca_topic_score_gemma":0.00042828254,"teacher_disagreement_score":0.008216824,"about_ca_system_score_codex":0.000986816,"about_ca_system_score_gemma":0.0006113767,"threshold_uncertainty_score":0.027488053},"labels":[],"label_agreement":null},{"id":"W2518208205","doi":"10.1080/03081087.2017.1284740","title":"The complete equivalence canonical form of four matrices over an arbitrary division ring","year":2017,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":17,"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; National Natural Science Foundation of China","keywords":"Sylvester matrix; Equivalence (formal languages); Quaternion; Canonical form; Division ring; Division (mathematics); Matrix equivalence; Ring (chemistry)","score_opus":0.03498697685667304,"score_gpt":0.3052105010019274,"score_spread":0.2702235241452544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518208205","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62689763,0.00051172666,0.2807758,0.0011063463,0.0002936599,0.0001637007,0.00038659514,0.00029691224,0.08956759],"genre_scores_gemma":[0.96332103,0.00023421034,0.025752958,0.00013996773,0.00012453488,0.0000518015,0.00026887044,0.000053177915,0.010053473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910235,0.00016631649,0.00005268153,0.00020555237,0.00024486094,0.00022824551],"domain_scores_gemma":[0.99944395,0.00008364917,0.000121261255,0.00007323602,0.00017359557,0.00010422903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006684927,0.0005504928,0.00040362176,0.0008726902,0.0010434233,0.00168064,0.0005646037,0.0005823333,0.009604158],"category_scores_gemma":[0.0014094723,0.00023876081,0.00053734245,0.0005644864,0.0015828054,0.003660683,0.0014837465,0.0011721993,0.0012512298],"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.000039243787,0.000028887864,0.00040651698,0.000031641688,0.000007398477,0.00021465213,0.00041849306,0.0015733808,0.002823266,0.9809645,0.00096380984,0.01252815],"study_design_scores_gemma":[0.000035066267,0.000096869204,0.00038124877,0.000016303848,0.000010918174,0.00033061355,0.0003681456,0.011515686,0.0057121906,0.96917176,0.01232103,0.00004017474],"about_ca_topic_score_codex":0.0005375968,"about_ca_topic_score_gemma":0.0004144479,"teacher_disagreement_score":0.009604158,"about_ca_system_score_codex":0.0004554103,"about_ca_system_score_gemma":0.0006478577,"threshold_uncertainty_score":0.03212911},"labels":[],"label_agreement":null},{"id":"W2518781103","doi":"10.1016/j.aml.2016.08.019","title":"Positive solutions for a nonlinear algebraic system with nonnegative coefficient matrix","year":2016,"lang":"en","type":"article","venue":"Applied Mathematics Letters","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Cone (formal languages); Algebraic number; Coefficient matrix; Banach space; Operator (biology); Matrix (chemical analysis); Nonlinear system; Zero (linguistics); Algebraic equation; Pure mathematics; Mathematical analysis; Algebra over a field; Algorithm","score_opus":0.009887519453725293,"score_gpt":0.22092802819757335,"score_spread":0.21104050874384805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518781103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20930655,0.0007177871,0.74171686,0.0031315524,0.0005039613,0.00017648502,0.00022963696,0.00019105598,0.044026066],"genre_scores_gemma":[0.893431,0.0006777332,0.06252892,0.00036861774,0.00018726711,0.00025187797,0.00017472853,0.00009932222,0.042280447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970585,0.00009075518,0.000014094499,0.00004762468,0.000100803474,0.00004090247],"domain_scores_gemma":[0.9988543,0.0005935726,0.00018868672,0.00003231129,0.00022192417,0.00010919173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005790129,0.0010473527,0.00056789914,0.0010900352,0.00079855684,0.0017511493,0.00095740607,0.0017873148,0.0061675683],"category_scores_gemma":[0.0037871574,0.0004328594,0.00044890426,0.0006973257,0.001513364,0.0013624531,0.0019397285,0.0015604806,0.00052994926],"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.00012338014,0.000083060535,0.0005104575,0.00031058435,0.000050172064,0.00052354636,0.0004911434,0.13844112,0.014810899,0.82207566,0.0040354375,0.01854453],"study_design_scores_gemma":[0.000049741382,0.00007276785,0.0002363687,0.00004423103,0.000019336214,0.00027851065,0.00024961284,0.69911927,0.0015755991,0.29573676,0.00256275,0.00005499488],"about_ca_topic_score_codex":0.0018923213,"about_ca_topic_score_gemma":0.0016966882,"teacher_disagreement_score":0.0061675683,"about_ca_system_score_codex":0.00070128596,"about_ca_system_score_gemma":0.0010620665,"threshold_uncertainty_score":0.020632565},"labels":[],"label_agreement":null},{"id":"W2525645872","doi":"10.1007/978-3-319-44479-6_6","title":"Gershgorin Disks for Multiple Eigenvalues of Non-negative Matrices","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Eigenvalues and eigenvectors; Multiplicity (mathematics); Diagonal; Mathematics; Matrix (chemical analysis); Pure mathematics; Normal matrix; Square matrix; Combinatorics; Mathematical analysis; Symmetric matrix; Physics; Geometry; Quantum mechanics; Chemistry","score_opus":0.037089264639545656,"score_gpt":0.3143022968923764,"score_spread":0.2772130322528307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525645872","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60618734,0.0035165276,0.3447473,0.003700142,0.0004980218,0.000068602676,0.00038513803,0.00058987545,0.040307045],"genre_scores_gemma":[0.966071,0.0007277997,0.021851419,0.00029533502,0.00026672645,0.00006892756,0.00020553882,0.00016929767,0.010343992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992238,0.00024655755,0.000032048345,0.00018138107,0.00018559513,0.00013062557],"domain_scores_gemma":[0.9943539,0.003458498,0.0006466916,0.00047191454,0.0004089205,0.00066007284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009122355,0.0010398949,0.0011507828,0.002629277,0.0016313042,0.0029924691,0.0015376405,0.0016285821,0.009695914],"category_scores_gemma":[0.0142348325,0.00057719625,0.00050129707,0.0010481252,0.0026196314,0.0038909211,0.0033487345,0.0020919163,0.0017980643],"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.00042698145,0.000054740678,0.0012851787,0.00019227141,0.0000294413,0.00051027455,0.0006288293,0.008995743,0.003923875,0.9549359,0.00599816,0.023018615],"study_design_scores_gemma":[0.000045687277,0.00002894311,0.00039594396,0.000027026872,0.000007861953,0.00028911702,0.00024607134,0.03951148,0.0009900356,0.95614314,0.0022955027,0.000019119903],"about_ca_topic_score_codex":0.00044413752,"about_ca_topic_score_gemma":0.0004740474,"teacher_disagreement_score":0.009695914,"about_ca_system_score_codex":0.00088386994,"about_ca_system_score_gemma":0.00037768183,"threshold_uncertainty_score":0.032436073},"labels":[],"label_agreement":null},{"id":"W2530439354","doi":"","title":"Recover-Restart Strategies for Resilient Parallel Numerical Linear Algebra Solvers","year":2014,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Université de Sherbrooke","funders":"","keywords":"Krylov subspace; Computer science; Generalized minimal residual method; Linear system; Conjugate gradient method; Interpolation (computer graphics); Numerical linear algebra; Linear algebra; Robustness (evolution); Norm (philosophy); Mathematical optimization; Context (archaeology); Parallel computing; Algorithm; Theoretical computer science; Residual; Iterative method; Mathematics; Artificial intelligence","score_opus":0.015215298317458843,"score_gpt":0.24405648471534688,"score_spread":0.22884118639788803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2530439354","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04027027,0.0007336183,0.94491965,0.00094057916,0.0002683372,0.00016080246,0.00019546109,0.0035612627,0.008950068],"genre_scores_gemma":[0.65336794,0.0005084851,0.32756728,0.0006674699,0.00031391336,0.00037543362,0.0008037496,0.0013774936,0.015018227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980399,0.00056019594,0.00011779312,0.0002886401,0.00067986344,0.0003137327],"domain_scores_gemma":[0.99540883,0.0018902078,0.00034032826,0.0014564062,0.0006268508,0.000277348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001949353,0.0020416034,0.0014064374,0.001473052,0.0015312153,0.0019096131,0.0028290558,0.0018510892,0.0096999165],"category_scores_gemma":[0.014306362,0.0008089265,0.0010123975,0.0010908694,0.0018771823,0.003019515,0.004929733,0.0027197255,0.0025129893],"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.00287865,0.0005403317,0.0018348977,0.0005959439,0.00024622914,0.00048591467,0.00051730307,0.46138617,0.027941927,0.13962205,0.026150884,0.33779958],"study_design_scores_gemma":[0.000036933165,0.00008785662,0.00011394012,0.000018499326,0.00002264342,0.00004937455,0.000042661628,0.94075733,0.005451811,0.051765833,0.001637887,0.000015159959],"about_ca_topic_score_codex":0.001507577,"about_ca_topic_score_gemma":0.0033998406,"teacher_disagreement_score":0.0096999165,"about_ca_system_score_codex":0.00087021734,"about_ca_system_score_gemma":0.0014374432,"threshold_uncertainty_score":0.032449424},"labels":[],"label_agreement":null},{"id":"W2533396634","doi":"10.13001/1081-3810.3109","title":"Numerical Range for the Matrix Exponential Function","year":2016,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Regina","funders":"","keywords":"Mathematics; Numerical range; Matrix function; Matrix exponential; Matrix (chemical analysis); Range (aeronautics); Function (biology); Exponential function; Pure mathematics; Mathematical analysis; Applied mathematics; Eigenvalues and eigenvectors; Symmetric matrix; Differential equation","score_opus":0.0085252060231517,"score_gpt":0.24774125764244567,"score_spread":0.23921605161929396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2533396634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106170185,0.0028985143,0.7474285,0.0019078145,0.0003583313,0.000048060523,0.00014947717,0.0006976262,0.14034152],"genre_scores_gemma":[0.9354853,0.0009033096,0.052017376,0.00030715,0.0002988327,0.00009759248,0.0001336966,0.00024862666,0.010508026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890625,0.00033239857,0.000056361918,0.00013967202,0.0004709316,0.00009442258],"domain_scores_gemma":[0.996438,0.0021229857,0.00024240508,0.00036064864,0.00061103224,0.00022486338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018666951,0.00061485654,0.00031844949,0.0014048564,0.0007018242,0.0020771935,0.0008957599,0.0009668087,0.006391754],"category_scores_gemma":[0.01176228,0.00023725268,0.0003499645,0.00059065357,0.0021876197,0.0037529955,0.0020759285,0.0017931106,0.0014625333],"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.0000893533,0.000021611315,0.00034592353,0.00011714898,0.0000075038115,0.00012519443,0.000121542274,0.016136555,0.008494337,0.96066844,0.0011382175,0.012734133],"study_design_scores_gemma":[0.000016537666,0.00006830495,0.0003708383,0.000103892795,0.000009629295,0.0005759557,0.00007330911,0.19447687,0.010346092,0.78688365,0.0070287506,0.000046164096],"about_ca_topic_score_codex":0.00022613685,"about_ca_topic_score_gemma":0.00016974514,"teacher_disagreement_score":0.006391754,"about_ca_system_score_codex":0.0007249639,"about_ca_system_score_gemma":0.0004393987,"threshold_uncertainty_score":0.02138257},"labels":[],"label_agreement":null},{"id":"W2534522533","doi":"","title":"6.6.4 More abstract underlying representations","year":2004,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science","score_opus":0.044451327154010914,"score_gpt":0.32495442910864286,"score_spread":0.28050310195463196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2534522533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008569134,0.0021604544,0.6592095,0.007172748,0.003622942,0.00022997918,0.0045619314,0.0017655083,0.31270784],"genre_scores_gemma":[0.18034908,0.0028755898,0.4712571,0.004268299,0.0029967034,0.0005897331,0.0074273343,0.0021822832,0.3280539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989299,0.00026910158,0.0000712162,0.00018688539,0.0003863001,0.00015659552],"domain_scores_gemma":[0.9991412,0.00012884548,0.000046512167,0.00034653314,0.00026962406,0.00006718344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014639378,0.0011831766,0.00092980074,0.0014209314,0.0011413954,0.0034342795,0.0019093924,0.0016645589,0.11991154],"category_scores_gemma":[0.002788641,0.00035389644,0.002118628,0.0013484637,0.0013436569,0.006018373,0.0017810304,0.0033961267,0.03391858],"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.000046375055,0.0000435812,0.00012869839,0.00010570118,0.000010248061,0.000059601745,0.00012903463,0.0009837515,0.0009251926,0.9515418,0.030059101,0.015966943],"study_design_scores_gemma":[0.000020562527,0.000036914444,0.00022732344,0.00004185173,0.000012903214,0.00016833514,0.0001032812,0.0057138563,0.00090941513,0.841763,0.15097736,0.000025130144],"about_ca_topic_score_codex":0.0016870118,"about_ca_topic_score_gemma":0.0019363656,"teacher_disagreement_score":0.11991154,"about_ca_system_score_codex":0.0009793553,"about_ca_system_score_gemma":0.0007187274,"threshold_uncertainty_score":0.40114403},"labels":[],"label_agreement":null},{"id":"W2537300505","doi":"","title":"Strong semismoothness of fischer-burmeister complementarity function associated with symmetric cones","year":2012,"lang":"en","type":"article","venue":"Journal of nonlinear and convex analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Complementarity (molecular biology); Mathematics; Pure mathematics; Mathematical analysis; Biology","score_opus":0.01826628985828078,"score_gpt":0.25179550406085943,"score_spread":0.23352921420257866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2537300505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37381375,0.0006942294,0.5980391,0.0009662746,0.00008367599,0.000070097965,0.00025867962,0.00021478286,0.025859466],"genre_scores_gemma":[0.94887114,0.00049439457,0.037748933,0.00014081526,0.00011073448,0.00008328734,0.00021260927,0.00009959486,0.012238455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999403,0.00018817205,0.000021566779,0.00012164476,0.00017574223,0.00008989296],"domain_scores_gemma":[0.99644923,0.0018376902,0.00048288653,0.00015156521,0.0006078477,0.00047078458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016516745,0.0010948334,0.0011202508,0.0023355694,0.0010766427,0.0022616468,0.0012521137,0.0014587687,0.002939116],"category_scores_gemma":[0.0062787617,0.0007043741,0.0009433032,0.00085651217,0.0024309116,0.003008847,0.0018204154,0.0022382874,0.00025476314],"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.000087889915,0.000044023924,0.0004809216,0.00006974839,0.000031461757,0.00017288084,0.00017482798,0.028810784,0.0051937904,0.95925015,0.0008029966,0.0048805433],"study_design_scores_gemma":[0.00002154018,0.00006849987,0.0005912406,0.000022333763,0.000017659104,0.00017988698,0.00009408292,0.38214216,0.0013283758,0.61449176,0.0010000553,0.000042377873],"about_ca_topic_score_codex":0.0020617612,"about_ca_topic_score_gemma":0.0015585034,"teacher_disagreement_score":0.002939116,"about_ca_system_score_codex":0.0015578186,"about_ca_system_score_gemma":0.0013492672,"threshold_uncertainty_score":0.011302769},"labels":[],"label_agreement":null},{"id":"W2537877035","doi":"","title":"Preliminary Investigations on Resilient Parallel Numerical Linear Algebra Solvers","year":2014,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Université de Sherbrooke","funders":"","keywords":"Linear algebra; Computer science; Parallel computing; Numerical linear algebra; Computational science; Algebra over a field; Numerical analysis; Mathematics; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.015220505594623884,"score_gpt":0.23479613007289782,"score_spread":0.21957562447827395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2537877035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17733195,0.0057236776,0.70183635,0.0087076295,0.0022901366,0.00062924885,0.0010058888,0.0070324624,0.09544256],"genre_scores_gemma":[0.7207596,0.0031556971,0.23791668,0.0016607026,0.0013043709,0.0003710728,0.001140668,0.0011188035,0.03257238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99610895,0.0015116555,0.00021946173,0.0004913757,0.0012865581,0.00038193198],"domain_scores_gemma":[0.9845974,0.0072833835,0.0008180471,0.0046507707,0.0021816066,0.00046876937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035881891,0.0015205794,0.0009884353,0.0012674773,0.00161695,0.0022584198,0.001846003,0.0010122437,0.019439956],"category_scores_gemma":[0.029419323,0.0005726386,0.0008739549,0.001618727,0.0019092171,0.0047944323,0.002343839,0.0025719346,0.002832628],"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.0029994417,0.0010283964,0.0042934297,0.001986706,0.0002705495,0.00063243235,0.0008909256,0.27813256,0.05311433,0.34719658,0.035699114,0.2737557],"study_design_scores_gemma":[0.00010326176,0.0004841266,0.0012064565,0.00018674269,0.00009437306,0.0004375981,0.00029043827,0.76020753,0.04430569,0.16548775,0.027144782,0.000051210944],"about_ca_topic_score_codex":0.0011868841,"about_ca_topic_score_gemma":0.0016058718,"teacher_disagreement_score":0.019439956,"about_ca_system_score_codex":0.0009445961,"about_ca_system_score_gemma":0.0014159482,"threshold_uncertainty_score":0.06503314},"labels":[],"label_agreement":null},{"id":"W2545052038","doi":"10.1109/icscs.2009.5414164","title":"Performance evaluation of hardware/software codesign of iterative methods of linear systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Saskatchewan","funders":"","keywords":"Computer science; Software; Iterative method; Hardware acceleration; Block (permutation group theory); Jacobi method; Software implementation; Computer hardware; Conjugate gradient method; Gauss–Seidel method; Implementation; Embedded system; Parallel computing; Field-programmable gate array; Algorithm; Mathematics","score_opus":0.05285918200245926,"score_gpt":0.35348095933742135,"score_spread":0.3006217773349621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2545052038","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67759246,0.0009746183,0.30179882,0.00019259304,0.0001630586,0.0002466564,0.00014094735,0.010915042,0.007975861],"genre_scores_gemma":[0.9140945,0.000110576206,0.08309252,0.00004187979,0.000023419801,0.00015322221,0.00021404216,0.0005074003,0.0017623839],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968918,0.0007625337,0.0002143936,0.0003036388,0.0015288776,0.00029879194],"domain_scores_gemma":[0.99033374,0.0046677818,0.0006523299,0.0012343798,0.0028844248,0.00022730266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018633336,0.0009640987,0.0005231206,0.0011381198,0.0004386421,0.00091135025,0.001292082,0.000707127,0.0033609616],"category_scores_gemma":[0.010009402,0.0003599773,0.00043498073,0.0008240945,0.00046118273,0.0008855167,0.00065534184,0.00068563246,0.00082572945],"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.004246305,0.0006936952,0.009854143,0.00075191184,0.00028486628,0.0002446016,0.0004974362,0.21297482,0.13874507,0.0054588127,0.003111744,0.6231367],"study_design_scores_gemma":[0.00013924026,0.0011411568,0.0030738786,0.00002559281,0.00007230459,0.00019230392,0.00006383024,0.80754745,0.18438822,0.00056812447,0.0027432253,0.00004472115],"about_ca_topic_score_codex":0.0017403623,"about_ca_topic_score_gemma":0.0010853347,"teacher_disagreement_score":0.0033609616,"about_ca_system_score_codex":0.001006869,"about_ca_system_score_gemma":0.0011268465,"threshold_uncertainty_score":0.011243522},"labels":[],"label_agreement":null},{"id":"W2549154443","doi":"","title":"Roots of Polynomials: on twisted QR methods for companion matrices and pencils","year":2016,"lang":"en","type":"article","venue":"Nazarbayev University Repository (Nazarbayev University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Matrix pencil; Quadratic growth; Pencil (optics); Mathematics; Polynomial; Companion matrix; Convergence (economics); Matrix (chemical analysis); Polynomial matrix; Matrix polynomial; Applied mathematics; Pure mathematics; Algorithm; Eigenvalues and eigenvectors; Mathematical analysis","score_opus":0.01366980677374087,"score_gpt":0.24572434426293033,"score_spread":0.23205453748918947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549154443","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022920668,0.00010914922,0.99658185,0.000060547158,0.000045080087,0.000032021184,0.000017039163,0.00024904127,0.00061327685],"genre_scores_gemma":[0.075349085,0.0004302225,0.9193372,0.00015885674,0.00009691354,0.00014772477,0.0001515109,0.0005470017,0.003781622],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984415,0.0006817599,0.000086882115,0.00016778713,0.0005152924,0.00010677484],"domain_scores_gemma":[0.99643075,0.001749716,0.00023923971,0.0007039258,0.0007069643,0.00016929321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023271001,0.0012344015,0.0010469342,0.00096938247,0.00048179392,0.0014300484,0.0016272918,0.0010545253,0.0071985023],"category_scores_gemma":[0.011608288,0.0005175548,0.0008708598,0.0012324831,0.0015941133,0.002200068,0.0029062626,0.002318223,0.003426527],"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.00041321237,0.00015208295,0.0011577139,0.00033548143,0.00009813016,0.00038484856,0.00059807854,0.34133753,0.013579583,0.26307487,0.0059593753,0.37290904],"study_design_scores_gemma":[0.00004193723,0.000088153756,0.00007087739,0.000028153716,0.00000781193,0.00008574708,0.00003979571,0.93440473,0.0034152933,0.056705795,0.005089119,0.00002259431],"about_ca_topic_score_codex":0.0021803873,"about_ca_topic_score_gemma":0.002280375,"teacher_disagreement_score":0.0071985023,"about_ca_system_score_codex":0.0005470888,"about_ca_system_score_gemma":0.0011026674,"threshold_uncertainty_score":0.024081409},"labels":[],"label_agreement":null},{"id":"W2549989273","doi":"10.4153/cmb-2016-077-5","title":"The Shifted Classical Circulant and Skew Circulant Splitting Iterative Methods for Toeplitz Matrices","year":2016,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia; China Scholarship Council; National Natural Science Foundation of China","keywords":"Toeplitz matrix; Circulant matrix; Mathematics; Iterative method; Hermitian matrix; Applied mathematics; Skew; Matrix (chemical analysis); Discrete mathematics; Algorithm; Pure mathematics; Computer science","score_opus":0.01670225826648329,"score_gpt":0.28342445840502156,"score_spread":0.26672220013853826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549989273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042479042,0.00054168724,0.95190525,0.00018130118,0.00009603037,0.000048655755,0.000019027646,0.00014536318,0.0045836167],"genre_scores_gemma":[0.43485883,0.00036567613,0.559369,0.0001288585,0.00008751699,0.00010567272,0.00006623572,0.000082321625,0.0049358415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994266,0.000235904,0.000027591876,0.000052750416,0.00022078374,0.000036350935],"domain_scores_gemma":[0.9985078,0.00060666306,0.0001192043,0.00014162963,0.0005031906,0.000121538586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001016078,0.0006030443,0.00043947517,0.0005789169,0.00034676862,0.0005108794,0.0008194267,0.0006974426,0.0014643896],"category_scores_gemma":[0.0030756432,0.00022202377,0.00043493908,0.0005147804,0.0010923877,0.00073310465,0.00086482905,0.0008749319,0.00035487098],"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.00019524965,0.00013306453,0.0014985236,0.00030547482,0.000085130756,0.00022311142,0.00036500714,0.56350815,0.029371982,0.22116949,0.0035067515,0.1796381],"study_design_scores_gemma":[0.0000079657375,0.000022077455,0.0000852257,0.0000067013602,0.000003504696,0.000028285282,0.000011963283,0.98766977,0.002122492,0.009226203,0.0008101053,0.000005780979],"about_ca_topic_score_codex":0.0026692867,"about_ca_topic_score_gemma":0.0029185698,"teacher_disagreement_score":0.0026692867,"about_ca_system_score_codex":0.00056710455,"about_ca_system_score_gemma":0.0011189752,"threshold_uncertainty_score":0.005373597},"labels":[],"label_agreement":null},{"id":"W2553255570","doi":"10.4153/cmb-2016-080-5","title":"Characterizations of Outer Generalized Inverses","year":2016,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Annihilator; Mathematics; Invertible matrix; Inverse; Order (exchange); Pure mathematics; Ring (chemistry); Decomposition; Generalized inverse; Combinatorics; Algebra over a field; Geometry; Chemistry","score_opus":0.01280037081628996,"score_gpt":0.20866329271018125,"score_spread":0.1958629218938913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2553255570","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69233084,0.00079263403,0.1895009,0.00034306882,0.00016762147,0.00006461927,0.00021263065,0.0003476276,0.11624003],"genre_scores_gemma":[0.96738183,0.0002560737,0.016324218,0.00015428934,0.00024300822,0.000028631766,0.00018914024,0.00015708354,0.015265749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990521,0.0001891295,0.000072718554,0.0002048784,0.00029819325,0.00018293319],"domain_scores_gemma":[0.99823713,0.000507294,0.0002803579,0.00023826113,0.00051131396,0.00022557659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079672155,0.0005606271,0.00042678622,0.0017666825,0.00067492144,0.0022914317,0.00038287308,0.0003811809,0.005355396],"category_scores_gemma":[0.002029394,0.00022694057,0.00044015102,0.00060157327,0.0022880253,0.0023406837,0.0014268911,0.0011460236,0.0008652366],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014709565,0.000056661767,0.001339705,0.0000819537,0.000016153424,0.00031570473,0.00064853753,0.001292828,0.017422538,0.957672,0.00080482016,0.020202087],"study_design_scores_gemma":[0.00003138864,0.00021361133,0.0022985914,0.000057706675,0.000034230594,0.0012457405,0.0006009493,0.014384019,0.028436115,0.9219611,0.030667905,0.0000685006],"about_ca_topic_score_codex":0.00024985065,"about_ca_topic_score_gemma":0.00022360454,"teacher_disagreement_score":0.005355396,"about_ca_system_score_codex":0.0004095614,"about_ca_system_score_gemma":0.00022645727,"threshold_uncertainty_score":0.017915547},"labels":[],"label_agreement":null},{"id":"W2554123725","doi":"10.4153/cmb-2018-006-7","title":"Total Nonnegativity and Stable Polynomials","year":2018,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","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":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Homogeneous; Polynomial; Mathematical proof; Action (physics); Orthogonal polynomials; Matrix (chemical analysis); Stability (learning theory); Homogeneous polynomial","score_opus":0.008890448405939354,"score_gpt":0.2109873805572434,"score_spread":0.20209693215130403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2554123725","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8042495,0.00018705173,0.17707507,0.0002899795,0.00006195389,0.00002194514,0.00007742538,0.00010382322,0.017933298],"genre_scores_gemma":[0.9944313,0.000045434557,0.0033564405,0.00002345827,0.000019770918,0.000008089739,0.000024869552,0.000012211169,0.0020784573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993511,0.00013413116,0.000023866114,0.00014357641,0.00021056039,0.00013684464],"domain_scores_gemma":[0.99871373,0.00033148113,0.00022857315,0.000155328,0.00038236438,0.0001884825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062231265,0.0003576954,0.00033580972,0.00054301246,0.000678668,0.0012399926,0.00035940311,0.00024401752,0.0031525388],"category_scores_gemma":[0.0025020943,0.00014694588,0.00027238953,0.00042808868,0.0020481911,0.0010963326,0.0011265529,0.000518556,0.0002596039],"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.00015313934,0.000028352386,0.0014441059,0.00005251534,0.000026580301,0.000351727,0.0005031856,0.01078249,0.025191713,0.94677305,0.00075021747,0.01394291],"study_design_scores_gemma":[0.000039901868,0.00016773028,0.0013705416,0.000018838819,0.000020297117,0.0003140049,0.0004397437,0.11150278,0.017617319,0.8645808,0.0038873882,0.000040689134],"about_ca_topic_score_codex":0.001014988,"about_ca_topic_score_gemma":0.0008204229,"teacher_disagreement_score":0.0031525388,"about_ca_system_score_codex":0.00054970337,"about_ca_system_score_gemma":0.00041091398,"threshold_uncertainty_score":0.010546327},"labels":[],"label_agreement":null},{"id":"W2559181456","doi":"","title":"Fast and backward stable computation of the eigenvalues of matrix polynomials","year":2016,"lang":"en","type":"article","venue":"Nazarbayev University Repository (Nazarbayev University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"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":"Eigenvalues and eigenvectors; Mathematics; Matrix pencil; Pencil (optics); Schur decomposition; Matrix (chemical analysis); Matrix polynomial; Polynomial matrix; Polynomial; Applied mathematics; Pure mathematics; Mathematical analysis; Schur complement","score_opus":0.005677932952263901,"score_gpt":0.1821858252803666,"score_spread":0.17650789232810268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559181456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013705188,0.000057944537,0.98393345,0.000055108656,0.000021143618,0.000031466396,0.000029999856,0.0004953296,0.0016704396],"genre_scores_gemma":[0.26583263,0.00015689497,0.7282225,0.00004699049,0.00002993947,0.000085220185,0.0001408134,0.00029972458,0.0051852725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971145,0.00007522735,0.0000105648305,0.000038661135,0.00013393672,0.000030056648],"domain_scores_gemma":[0.9993845,0.00027911674,0.000043214633,0.000089272944,0.00017380572,0.000030013396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044163543,0.0007358277,0.0005453078,0.0004865976,0.00043438884,0.0007056278,0.00058657385,0.00048031946,0.005910015],"category_scores_gemma":[0.0026516456,0.0002842796,0.0003864633,0.00048594474,0.0005979568,0.0011009381,0.00083000155,0.0008968269,0.001685896],"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.0003900103,0.000112342415,0.0011857183,0.00035973988,0.000057576388,0.00041410723,0.00054382125,0.32047653,0.07571178,0.15621752,0.0049539013,0.43957692],"study_design_scores_gemma":[0.000017855435,0.000043649616,0.00011025647,0.00000841323,0.000002750022,0.00005916148,0.000034300465,0.970334,0.009829354,0.017812869,0.0017367057,0.000010736289],"about_ca_topic_score_codex":0.0016424857,"about_ca_topic_score_gemma":0.0023184954,"teacher_disagreement_score":0.005910015,"about_ca_system_score_codex":0.00032918187,"about_ca_system_score_gemma":0.0008503939,"threshold_uncertainty_score":0.01977098},"labels":[],"label_agreement":null},{"id":"W2560073225","doi":"10.1016/j.laa.2016.12.009","title":"Isospectral matrix flow maintaining staircase structure and total positivity of an initial matrix","year":2016,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Isospectral; Triangular matrix; Matrix (chemical analysis); Eigenvalues and eigenvectors; Commutator; Band matrix; Flow (mathematics); Diagonal matrix; Diagonal; Zero (linguistics); Pure mathematics; Centrosymmetric matrix; Combinatorics; Symmetric matrix; Square matrix; Mathematical analysis; Algebra over a field; Geometry; Invertible matrix; Physics","score_opus":0.00678128212792704,"score_gpt":0.2692309480106629,"score_spread":0.2624496658827358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560073225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20799367,0.00020537344,0.7288218,0.00076932047,0.00035571848,0.00009536398,0.00015544993,0.000573068,0.061030272],"genre_scores_gemma":[0.89135635,0.00033932767,0.061513536,0.00039676795,0.00025147936,0.000117935604,0.00017724434,0.00040682018,0.045440443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978024,0.000047823614,0.000008157806,0.00004988568,0.00006333003,0.000050676776],"domain_scores_gemma":[0.999146,0.00019757106,0.00010706652,0.0001258213,0.0002601792,0.0001633641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051474996,0.0007694979,0.0004619648,0.0012010399,0.0013053867,0.0019025664,0.00089900347,0.00097096676,0.0066526486],"category_scores_gemma":[0.0023633365,0.00034902492,0.0005309914,0.00057538715,0.0015441836,0.003016108,0.0012881408,0.0015127741,0.0010367181],"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.000051181527,0.00007553989,0.00015501553,0.00003923842,0.0000069584207,0.000107755266,0.0001671117,0.0087342765,0.012299422,0.96589744,0.0020806731,0.0103853],"study_design_scores_gemma":[0.000017225235,0.000069359274,0.00022279029,0.000011270168,0.0000065942877,0.00016775526,0.00011757681,0.13975179,0.005957171,0.8508368,0.0028092088,0.00003240734],"about_ca_topic_score_codex":0.0010875678,"about_ca_topic_score_gemma":0.00094553665,"teacher_disagreement_score":0.0066526486,"about_ca_system_score_codex":0.00078209385,"about_ca_system_score_gemma":0.0009855166,"threshold_uncertainty_score":0.022255361},"labels":[],"label_agreement":null},{"id":"W2560568810","doi":"10.1007/s10955-016-1685-7","title":"On the Spectral Gap of a Square Distance Matrix","year":2016,"lang":"en","type":"article","venue":"Journal of Statistical Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Mathematics; Jacobian matrix and determinant; Eigenvalues and eigenvectors; Square (algebra); Conjecture; Matrix (chemical analysis); Square matrix; Computation; Combinatorics; Pure mathematics; Applied mathematics; Symmetric matrix; Physics; Geometry; Algorithm; Quantum mechanics","score_opus":0.015749435467663726,"score_gpt":0.27307978767596713,"score_spread":0.2573303522083034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560568810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45129982,0.0048615756,0.4690579,0.008684336,0.0011166544,0.00007728059,0.00046796934,0.0003683587,0.06406609],"genre_scores_gemma":[0.9578357,0.00160011,0.029625585,0.0010973378,0.0008311457,0.000113601054,0.00029098958,0.00023508804,0.00837038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983891,0.00073988736,0.000058405036,0.00023371394,0.00038852697,0.0001903313],"domain_scores_gemma":[0.97683376,0.01893925,0.0010288958,0.00086372276,0.0011575824,0.0011766552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030268463,0.0011073675,0.0013273812,0.0028889175,0.0011429617,0.001978775,0.0024035263,0.002791658,0.0076758596],"category_scores_gemma":[0.025900837,0.00052538473,0.00047399278,0.0016982129,0.005218004,0.0076612183,0.0041157478,0.0030628343,0.00086182693],"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.00014618972,0.000055561864,0.00034062393,0.00009690226,0.000012207894,0.00011085175,0.0002462367,0.011836507,0.00132868,0.9763435,0.0025035064,0.0069792154],"study_design_scores_gemma":[0.000018244127,0.000035790443,0.00016047478,0.000038636674,0.0000055613596,0.00010686215,0.00010136627,0.093157955,0.00032122945,0.9051475,0.0008848431,0.000021514721],"about_ca_topic_score_codex":0.0010144071,"about_ca_topic_score_gemma":0.00059113087,"teacher_disagreement_score":0.0076758596,"about_ca_system_score_codex":0.0011394786,"about_ca_system_score_gemma":0.00073730457,"threshold_uncertainty_score":0.025678277},"labels":[],"label_agreement":null},{"id":"W2560576838","doi":"10.1016/j.laa.2016.12.010","title":"Spectrally arbitrary pattern extensions","year":2016,"lang":"en","type":"article","venue":"Linear Algebra and its 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":"Redeemer University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Pure mathematics; Algebra over a field","score_opus":0.010352510645153636,"score_gpt":0.23313735312241368,"score_spread":0.22278484247726005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560576838","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37010533,0.00059772877,0.3286497,0.0027934252,0.0010113938,0.0001048523,0.0006372272,0.0012406034,0.29485977],"genre_scores_gemma":[0.8693232,0.00044666263,0.04300778,0.0011203516,0.00057742494,0.00011750963,0.00060059904,0.00049271923,0.08431375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992582,0.0001506057,0.000040976785,0.00020310018,0.00019637593,0.00015067813],"domain_scores_gemma":[0.99885654,0.0002102949,0.00013298482,0.00039493293,0.0002197112,0.0001855131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006004883,0.0006121131,0.0006504553,0.0010326791,0.0016928731,0.0021436918,0.0009235933,0.000970221,0.01593694],"category_scores_gemma":[0.0027847015,0.0003831022,0.00072749105,0.00088829786,0.0019457085,0.004941297,0.0028299545,0.0020872015,0.0028864765],"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.000047253114,0.000028714056,0.00011400937,0.00001987986,0.000004084499,0.000078912955,0.00009711932,0.0003386195,0.0016688947,0.9890941,0.0018244778,0.0066838884],"study_design_scores_gemma":[0.000009459557,0.000010990874,0.000097039425,0.000006085746,0.0000035911348,0.00016862014,0.000061424835,0.002667368,0.00095987617,0.9915543,0.004452638,0.000008501688],"about_ca_topic_score_codex":0.00027722947,"about_ca_topic_score_gemma":0.0003938907,"teacher_disagreement_score":0.01593694,"about_ca_system_score_codex":0.0004541241,"about_ca_system_score_gemma":0.00043463567,"threshold_uncertainty_score":0.053314388},"labels":[],"label_agreement":null},{"id":"W2561160224","doi":"10.1016/j.cma.2016.12.023","title":"Approximation of constrained problems using the PGD method with application to pure Neumann problems","year":2016,"lang":"en","type":"article","venue":"Computer Methods in Applied Mechanics and Engineering","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; King Abdullah University of Science and Technology","keywords":"Constraint (computer-aided design); Mathematics; Mathematical optimization; Affine transformation; Applied mathematics; Von Neumann architecture; Theory of computation; Decomposition method (queueing theory); Decomposition; Computer science; Algorithm; Pure mathematics; Discrete mathematics; Geometry","score_opus":0.01676918746264881,"score_gpt":0.27161686758136083,"score_spread":0.254847680118712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561160224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014758123,0.0004841841,0.97611976,0.000374603,0.00017690014,0.000048931182,0.00006418188,0.00010531716,0.007867948],"genre_scores_gemma":[0.42909744,0.001084436,0.5490691,0.00038996863,0.00029781333,0.00032435587,0.00028207788,0.00036979862,0.019085037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994659,0.0002649519,0.000025583111,0.00004655755,0.00016141661,0.000035579116],"domain_scores_gemma":[0.9985116,0.0009516715,0.00007919852,0.00013730566,0.0002207525,0.0000994353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012067035,0.0008184158,0.0012323821,0.0010691406,0.0006410177,0.0015031062,0.0015072305,0.001400727,0.0027922888],"category_scores_gemma":[0.004096854,0.0004766751,0.0007364061,0.0010653436,0.0017663395,0.0011461928,0.0026541497,0.0015821356,0.00039411022],"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.000102425794,0.00011854731,0.00058995065,0.00033231045,0.000060992206,0.00019007451,0.00014415715,0.58155906,0.0029784592,0.3748357,0.0029210595,0.03616727],"study_design_scores_gemma":[0.0000069124285,0.000006403288,0.000035465677,0.0000062433223,0.0000025734016,0.000013878007,0.0000065164118,0.9715981,0.00020684037,0.027322026,0.000789914,0.00000514289],"about_ca_topic_score_codex":0.0044881697,"about_ca_topic_score_gemma":0.004406955,"teacher_disagreement_score":0.0044881697,"about_ca_system_score_codex":0.0007073194,"about_ca_system_score_gemma":0.0010577096,"threshold_uncertainty_score":0.00934118},"labels":[],"label_agreement":null},{"id":"W2565311378","doi":"10.1109/cdc.1989.70492","title":"The stability robustness of generalized eigenvalues","year":2003,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":10,"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 Toronto","funders":"","keywords":"Robustness (evolution); Eigenvalues and eigenvectors; Perturbation (astronomy); Mathematics; Norm (philosophy); Applied mathematics; Mathematical optimization; Control theory (sociology); Computer science; Artificial intelligence; Physics; Law","score_opus":0.022415339047823866,"score_gpt":0.24489904848646776,"score_spread":0.2224837094386439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2565311378","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12770076,0.00070055464,0.86552316,0.00028087696,0.000116065574,0.000046204386,0.00012167906,0.0001994063,0.0053113387],"genre_scores_gemma":[0.9573596,0.0006590797,0.038648028,0.000071451024,0.00013587512,0.00009934951,0.00015474157,0.00008633677,0.0027854426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985549,0.0004887513,0.00006199817,0.00038597814,0.00040905652,0.0000993451],"domain_scores_gemma":[0.99693227,0.0015929857,0.00061142165,0.00031777998,0.00044922286,0.00009625302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014923349,0.0011388035,0.000746386,0.0011870554,0.00037022048,0.0014917253,0.0007029076,0.00076336646,0.0017643102],"category_scores_gemma":[0.0100564025,0.00026482978,0.0007618952,0.00055995904,0.0013785036,0.0022957418,0.0017253458,0.0007684057,0.00033841294],"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.0006322357,0.000059943563,0.0018023367,0.00039880615,0.00023146532,0.0004683002,0.000246173,0.648178,0.073954314,0.18793169,0.001367828,0.08472898],"study_design_scores_gemma":[0.000015303493,0.00018951425,0.00064597,0.000026247075,0.00002711312,0.00019151098,0.00006832768,0.90620637,0.013104086,0.078372695,0.0011127918,0.00004013048],"about_ca_topic_score_codex":0.0004988465,"about_ca_topic_score_gemma":0.00018796473,"teacher_disagreement_score":0.0017643102,"about_ca_system_score_codex":0.00055911724,"about_ca_system_score_gemma":0.0003767535,"threshold_uncertainty_score":0.007892311},"labels":[],"label_agreement":null},{"id":"W2567189331","doi":"10.1016/j.laa.2018.07.018","title":"Operator Schmidt ranks of bipartite unitary matrices","year":2018,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"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":"H2020 European Research Council; Agence Nationale de la Recherche; Providence Health Care; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Danmarks Frie Forskningsfond; Villum Fonden; Alexander von Humboldt-Stiftung","keywords":"Mathematics; Unitary state; Unitary operator; Bipartite graph; Operator (biology); Operator matrix; Unitary matrix; Algebra over a field; Combinatorics; Pure mathematics; Discrete mathematics; Hilbert space; Law","score_opus":0.010907636180884073,"score_gpt":0.25534282215847764,"score_spread":0.24443518597759356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567189331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3990159,0.0008724062,0.53029376,0.0015594397,0.00041025563,0.00012848641,0.0006535996,0.00087897363,0.06618719],"genre_scores_gemma":[0.93884385,0.00046251493,0.037695393,0.00034841776,0.00038334366,0.00012487744,0.00048649122,0.00024674847,0.021408444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784744,0.0007650516,0.000085603264,0.00025314523,0.00060934474,0.0004393502],"domain_scores_gemma":[0.994111,0.0026001937,0.0006802513,0.0008011826,0.0010025802,0.0008047695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020968874,0.000886018,0.0008224886,0.0021315212,0.0013111288,0.003089852,0.0013296201,0.0012364478,0.010999671],"category_scores_gemma":[0.011795578,0.00048161112,0.00047954085,0.001434654,0.0032997348,0.0044527915,0.0029546183,0.001969593,0.0019135481],"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.00012306885,0.000076426775,0.0004460135,0.00005543493,0.000011556943,0.00008213131,0.0003063632,0.0068306252,0.0026387624,0.9707171,0.002714591,0.015997939],"study_design_scores_gemma":[0.000017104947,0.000046662204,0.0004073489,0.000019414227,0.0000056517856,0.00006908015,0.00013647642,0.043257147,0.0017383485,0.9525193,0.0017419065,0.000041556086],"about_ca_topic_score_codex":0.0007843135,"about_ca_topic_score_gemma":0.0013073406,"teacher_disagreement_score":0.010999671,"about_ca_system_score_codex":0.00074259314,"about_ca_system_score_gemma":0.0015384569,"threshold_uncertainty_score":0.036797583},"labels":[],"label_agreement":null},{"id":"W2568627816","doi":"10.1109/cdc.2016.7798532","title":"Quadratic performance of primal-dual methods with application to secondary frequency control of power systems","year":2016,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quadratic equation; Norm (philosophy); Dual (grammatical number); Computer science; Mathematical optimization; Context (archaeology); Controller (irrigation); Automatic frequency control; Set (abstract data type); Scaling; Optimal control; Control theory (sociology); Mathematics; Control (management); Artificial intelligence","score_opus":0.005724679840442894,"score_gpt":0.2499156448366454,"score_spread":0.24419096499620252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568627816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023785606,0.00071478763,0.9681635,0.00058353314,0.00008740372,0.000036188314,0.000027997225,0.00015688755,0.006444034],"genre_scores_gemma":[0.8461931,0.000749788,0.14844479,0.00010822032,0.00012812628,0.00010355992,0.00005926655,0.000115346265,0.0040977695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991405,0.0004832211,0.00002523174,0.00008241638,0.00020338754,0.00006512526],"domain_scores_gemma":[0.9959204,0.0029383712,0.00022637432,0.00018491574,0.0006427621,0.00008709323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039461246,0.0010815015,0.00091602164,0.00042097352,0.00043352734,0.0011488496,0.00061540323,0.0007770134,0.0026571152],"category_scores_gemma":[0.008847639,0.00033099137,0.0003769901,0.00052276615,0.0012326909,0.00074346265,0.0014081636,0.001785009,0.0002775373],"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.0001019557,0.000059072525,0.000237233,0.000119344,0.000016164413,0.000034560097,0.000060265313,0.96196145,0.0012472381,0.017873794,0.0006598751,0.017628962],"study_design_scores_gemma":[0.0000035122746,0.00001611061,0.000024206562,0.0000026721455,0.0000011011443,0.0000029545704,0.0000037342893,0.9970798,0.000220568,0.0024996598,0.0001441381,0.0000015813785],"about_ca_topic_score_codex":0.0031881386,"about_ca_topic_score_gemma":0.0018224934,"teacher_disagreement_score":0.0039461246,"about_ca_system_score_codex":0.00084974547,"about_ca_system_score_gemma":0.0012807077,"threshold_uncertainty_score":0.020869374},"labels":[],"label_agreement":null},{"id":"W2569934946","doi":"10.1016/j.jsc.2017.07.010","title":"Time and space efficient generators for quasiseparable matrices","year":2017,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Horizon 2020 Framework Programme","keywords":"Mathematics; Linear algebra; Eigenvalues and eigenvectors; Matrix (chemical analysis); Matrix multiplication; Rank (graph theory); Algebra over a field; Block matrix; Vector space; Matrix analysis; Numerical linear algebra; QR decomposition; Linear system; Pure mathematics; Combinatorics","score_opus":0.011764631844205776,"score_gpt":0.2745159109163119,"score_spread":0.2627512790721061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569934946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15568778,0.00029392645,0.82234716,0.00064242247,0.00021970093,0.00018946647,0.0005886969,0.0012875361,0.01874336],"genre_scores_gemma":[0.7136773,0.00018140544,0.25914997,0.0002195184,0.00018432367,0.0003911346,0.0010383292,0.0005949979,0.02456295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991917,0.00023379188,0.00005620935,0.00012731366,0.00024859476,0.00014232776],"domain_scores_gemma":[0.9973744,0.0014647678,0.00020179742,0.00051053794,0.00027113664,0.00017741905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005743678,0.0006334927,0.00049227383,0.00053901185,0.0006730436,0.001493037,0.0010246026,0.00064199313,0.015284213],"category_scores_gemma":[0.004105398,0.00034068225,0.0004447957,0.00083299296,0.0009749454,0.0027082555,0.0018308188,0.001086501,0.0021796746],"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.00090013637,0.00025332868,0.000703133,0.00020083168,0.00002591442,0.00023901126,0.0005643257,0.036942754,0.024312887,0.81060433,0.011342094,0.11391127],"study_design_scores_gemma":[0.00016916476,0.00017785502,0.0002219343,0.000020500887,0.000013339788,0.00013376649,0.00012653663,0.16182461,0.011425262,0.8196276,0.0062299757,0.000029441793],"about_ca_topic_score_codex":0.00046578833,"about_ca_topic_score_gemma":0.0018218706,"teacher_disagreement_score":0.015284213,"about_ca_system_score_codex":0.00058640004,"about_ca_system_score_gemma":0.000943822,"threshold_uncertainty_score":0.05113077},"labels":[],"label_agreement":null},{"id":"W2574441828","doi":"","title":"On the Inverse Of General Cyclic Heptadiagonal Matrices.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Inverse; Pure mathematics; Geometry","score_opus":0.01034055379157038,"score_gpt":0.22177727637863034,"score_spread":0.21143672258705998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574441828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19287437,0.0049369833,0.48788613,0.0025926635,0.0012079211,0.000101444064,0.0006378313,0.0006361786,0.30912638],"genre_scores_gemma":[0.8206302,0.004272799,0.09345657,0.001622842,0.00091861124,0.00011834371,0.0009018322,0.00030535148,0.077773534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946505,0.0001281346,0.000023563976,0.00008822518,0.00017766265,0.00011732038],"domain_scores_gemma":[0.99905866,0.0004403895,0.000096073745,0.00015838916,0.00016488569,0.000081640996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053147523,0.00057425257,0.00047243614,0.0012147351,0.00082097505,0.0014833736,0.00059627503,0.00066084723,0.010268666],"category_scores_gemma":[0.003334434,0.00029170694,0.0003490582,0.0012549919,0.0020851297,0.0028665508,0.001921353,0.0017656065,0.0029978044],"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.00007072141,0.000042556676,0.00032818972,0.00008564819,0.000011613729,0.00013805705,0.0002467283,0.0056131333,0.001779631,0.9480827,0.008798456,0.03480251],"study_design_scores_gemma":[0.0000100409425,0.000021473876,0.00018383852,0.000027881906,0.0000047726026,0.00017603952,0.00010404544,0.012915193,0.0011342318,0.97474784,0.01065815,0.000016472666],"about_ca_topic_score_codex":0.001291064,"about_ca_topic_score_gemma":0.0020659785,"teacher_disagreement_score":0.010268666,"about_ca_system_score_codex":0.00048776667,"about_ca_system_score_gemma":0.00046222715,"threshold_uncertainty_score":0.034352064},"labels":[],"label_agreement":null},{"id":"W2578818765","doi":"","title":"On matrices over roots of unity with vanishing permanent.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Root of unity","score_opus":0.007425058175573334,"score_gpt":0.2230876220072842,"score_spread":0.21566256383171084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578818765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17169476,0.00600944,0.6458885,0.0054840883,0.0012578933,0.0001169961,0.0010048324,0.0015862155,0.1669574],"genre_scores_gemma":[0.8316933,0.0041706446,0.09756495,0.001096435,0.0014991394,0.0001593912,0.0011538863,0.0005663895,0.062095895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990102,0.00026934096,0.000053127296,0.00018111589,0.00024863047,0.00023755115],"domain_scores_gemma":[0.99680126,0.0018441797,0.00035114744,0.0004793103,0.00028694086,0.00023710345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009086832,0.000894141,0.0008017527,0.0020115785,0.0014724252,0.0025612814,0.0010359939,0.0008897697,0.010545373],"category_scores_gemma":[0.0075254035,0.00048770203,0.0004898753,0.0020777807,0.003011566,0.006227539,0.0028749683,0.0026756767,0.0042859586],"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.000083264014,0.00004650566,0.0003317424,0.000110681816,0.000014133372,0.0001437377,0.00028400094,0.005805698,0.001173458,0.948912,0.010347689,0.032747075],"study_design_scores_gemma":[0.000010890912,0.000017077919,0.000092828865,0.00002582282,0.0000044819485,0.00009329293,0.00006953138,0.008410991,0.00048196613,0.98612773,0.004654933,0.000010343969],"about_ca_topic_score_codex":0.0010522607,"about_ca_topic_score_gemma":0.0016917717,"teacher_disagreement_score":0.010545373,"about_ca_system_score_codex":0.0009874156,"about_ca_system_score_gemma":0.0007836568,"threshold_uncertainty_score":0.035277784},"labels":[],"label_agreement":null},{"id":"W2585456897","doi":"","title":"Analysis and Numerical Methods for Algebraic Riccati Equations Associated with Regular M-Matrices","year":2015,"lang":"en","type":"dissertation","venue":"oURspace (University of Regina)","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":"University of Regina","keywords":"Mathematics; Algebraic Riccati equation; Applied mathematics; Algebraic number; Riccati equation; Algebra over a field; Algebraic equation; Pure mathematics; Mathematical analysis; Physics; Differential equation; Nonlinear system","score_opus":0.014501511431137329,"score_gpt":0.2757531681377815,"score_spread":0.2612516567066442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585456897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016932037,0.0010790309,0.9704193,0.0006208079,0.00020884072,0.00007983226,0.000080639526,0.00019450377,0.010385137],"genre_scores_gemma":[0.4289476,0.0020035945,0.541007,0.00033640562,0.0004777883,0.00050678494,0.00030223065,0.0005844663,0.025834141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947745,0.00024031039,0.000029728371,0.000052654737,0.0001578932,0.000041919568],"domain_scores_gemma":[0.9972191,0.0016887136,0.00025145794,0.00019341533,0.00055792107,0.000089436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014862127,0.0008118833,0.0009149697,0.00095103204,0.0005186415,0.0013780633,0.0011462746,0.0012347338,0.0049661836],"category_scores_gemma":[0.0057637324,0.00039868674,0.00094347546,0.00070250005,0.0014583215,0.0013927573,0.0019780658,0.0019609139,0.0010391397],"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.00013989239,0.00013403146,0.0012892064,0.00046131728,0.000104644845,0.0002046483,0.00047808737,0.5448297,0.0084044095,0.3753589,0.0046887053,0.063906364],"study_design_scores_gemma":[0.0000092340515,0.00001654467,0.0001005665,0.000024719899,0.000004859566,0.000024236571,0.000030073603,0.96973497,0.00053668214,0.027809892,0.0016988605,0.000009341403],"about_ca_topic_score_codex":0.0029117102,"about_ca_topic_score_gemma":0.003309633,"teacher_disagreement_score":0.0049661836,"about_ca_system_score_codex":0.0007484159,"about_ca_system_score_gemma":0.0009944353,"threshold_uncertainty_score":0.016613483},"labels":[],"label_agreement":null},{"id":"W2587397918","doi":"","title":"Convexity of symmetric cone trace functions in euclidean Jordan algebras","year":2013,"lang":"en","type":"article","venue":"Journal of nonlinear and convex analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Convexity; TRACE (psycholinguistics); Cone (formal languages); Mathematics; Dual cone and polar cone; Euclidean geometry; Pure mathematics; Euclidean distance; Regular polygon; Geometry; Philosophy; Algorithm","score_opus":0.010053214842090551,"score_gpt":0.23538757913702776,"score_spread":0.22533436429493722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2587397918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44108552,0.0009908421,0.5137259,0.001916706,0.0001295135,0.00007730021,0.00047779793,0.00016614409,0.041430335],"genre_scores_gemma":[0.9557878,0.0010173636,0.0286472,0.00022163083,0.00022910403,0.00009052893,0.0004941262,0.0001782009,0.013334038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897313,0.00042066773,0.000045959565,0.00011164836,0.0002830697,0.00016557195],"domain_scores_gemma":[0.99551105,0.002286053,0.0004612208,0.00024651585,0.00079946814,0.00069573487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023984541,0.0010419948,0.0010623782,0.0022913096,0.0014630745,0.004263021,0.001885435,0.00094427675,0.004586321],"category_scores_gemma":[0.00932897,0.0006341043,0.0008515157,0.0014431415,0.003994203,0.005477308,0.001850573,0.0025872495,0.00050234987],"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.00005790446,0.000029259376,0.0005155611,0.00002798683,0.000010902183,0.00007888017,0.00013803875,0.010106275,0.0008774913,0.98351455,0.0009926769,0.0036503398],"study_design_scores_gemma":[0.000012451275,0.000021077147,0.0004055356,0.000012579655,0.000005713808,0.00005949265,0.000109660454,0.08728906,0.00047161113,0.9108912,0.00070369843,0.000017897615],"about_ca_topic_score_codex":0.0036514627,"about_ca_topic_score_gemma":0.0033555562,"teacher_disagreement_score":0.004586321,"about_ca_system_score_codex":0.0020409797,"about_ca_system_score_gemma":0.0016076051,"threshold_uncertainty_score":0.015342712},"labels":[],"label_agreement":null},{"id":"W2589101395","doi":"10.1090/proc/13801","title":"Complete spectral sets and numerical range","year":2017,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Range (aeronautics); Mathematics; Materials science; Composite material","score_opus":0.01834955242964111,"score_gpt":0.26397162427878457,"score_spread":0.24562207184914345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2589101395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07538047,0.0020451131,0.77228755,0.0014009995,0.0006361991,0.00008010226,0.0007449133,0.0014602335,0.14596447],"genre_scores_gemma":[0.7744526,0.0012334046,0.18387297,0.0010399501,0.0007160032,0.00025740717,0.0011484772,0.0009181256,0.036361005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99607015,0.0010546547,0.00029887955,0.00092505733,0.0012713246,0.00037986116],"domain_scores_gemma":[0.9958448,0.0013600093,0.0003714594,0.00058710837,0.0014085958,0.00042810958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025106957,0.0006998372,0.0006876509,0.0028518764,0.0017526313,0.0041200123,0.0012719563,0.0008309828,0.00880667],"category_scores_gemma":[0.0064943796,0.0004142632,0.001062445,0.0015426964,0.004250062,0.008470536,0.004670819,0.0018881686,0.00291326],"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.000015857093,0.0000072238004,0.000096488526,0.00004086431,0.0000060559896,0.000023366085,0.00020778552,0.0005749987,0.0005691952,0.99010605,0.0008917299,0.0074605015],"study_design_scores_gemma":[0.0000068694994,0.000022629853,0.00016942972,0.000030380466,0.0000070528763,0.00009689261,0.00019623889,0.0043865433,0.001628565,0.97971684,0.013716685,0.000021838428],"about_ca_topic_score_codex":0.0008608744,"about_ca_topic_score_gemma":0.0005947999,"teacher_disagreement_score":0.00880667,"about_ca_system_score_codex":0.0013979139,"about_ca_system_score_gemma":0.0007081402,"threshold_uncertainty_score":0.029461265},"labels":[],"label_agreement":null},{"id":"W2591708875","doi":"","title":"Circuit modeling of unsymmetric matrix equations","year":2002,"lang":"en","type":"article","venue":"International Symposium on Antenna Technology and Applied Electromagnetics","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Manitoba","funders":"","keywords":"Algebraic equation; System of linear equations; Node (physics); Matrix (chemical analysis); Electronic circuit; Linear system; Linear equation; Modified nodal analysis; Electrical network; Nodal analysis; Computer science; Applied mathematics; Topology (electrical circuits); Mathematics; Mathematical analysis; Nonlinear system; Electronic engineering; Physics; Engineering; Electrical engineering","score_opus":0.012958186578828515,"score_gpt":0.22685741580732643,"score_spread":0.2138992292284979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591708875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013699227,0.00014366856,0.97003585,0.00010959244,0.00006647892,0.000046004177,0.00023939267,0.0006935703,0.01496619],"genre_scores_gemma":[0.7120257,0.00084504706,0.25781932,0.00017037979,0.0001221489,0.0002919079,0.000650953,0.0002295472,0.027844971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997472,0.00004811316,0.000011738534,0.00003910043,0.00013229587,0.00002159537],"domain_scores_gemma":[0.9997688,0.000052012743,0.000038212915,0.00004491885,0.00008724296,0.000008741364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002039568,0.00046953163,0.00046904513,0.0003670134,0.00024459916,0.000681211,0.001258109,0.00067208376,0.0048346356],"category_scores_gemma":[0.0006848426,0.00021033225,0.0004271517,0.00045604783,0.00030615256,0.0009930885,0.00037378317,0.0005904802,0.001163388],"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.000055999928,0.00004029763,0.0003376534,0.00014510212,0.000031358697,0.00024917818,0.00015811322,0.68093157,0.02971377,0.24836612,0.003359901,0.03661085],"study_design_scores_gemma":[0.0000040253963,0.00001954627,0.00006116339,0.000004118801,0.0000049177734,0.00005125122,0.000007639239,0.98182684,0.0018816578,0.012295819,0.0038385172,0.0000044159347],"about_ca_topic_score_codex":0.0012302082,"about_ca_topic_score_gemma":0.0015299341,"teacher_disagreement_score":0.0048346356,"about_ca_system_score_codex":0.0003617228,"about_ca_system_score_gemma":0.00050766097,"threshold_uncertainty_score":0.016173422},"labels":[],"label_agreement":null},{"id":"W2592524400","doi":"","title":"Solution bounds for some strictly diagonally dominant symmetric matrix equations","year":2002,"lang":"en","type":"article","venue":"International Symposium on Antenna Technology and Applied Electromagnetics","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Manitoba","funders":"","keywords":"Diagonal; Diagonally dominant matrix; Mathematics; Sign (mathematics); Interval (graph theory); Diagonal matrix; Algebraic number; Iterative method; Matrix (chemical analysis); Scaling; Symmetric matrix; Algebraic equation; Mathematical analysis; Applied mathematics; Upper and lower bounds; Combinatorics; Discrete mathematics; Pure mathematics; Algorithm; Geometry; Invertible matrix; Physics; Nonlinear system","score_opus":0.009181477958934953,"score_gpt":0.23356655321828695,"score_spread":0.224385075259352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592524400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025215225,0.0010024883,0.95104575,0.0010126585,0.00009349571,0.0000812153,0.00011229891,0.00025737513,0.021179438],"genre_scores_gemma":[0.59706855,0.002201458,0.37721604,0.0006497932,0.0002966902,0.0005528633,0.00053508545,0.0005424487,0.02093702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983359,0.0005286794,0.00007451369,0.00017292684,0.0006257792,0.00026231323],"domain_scores_gemma":[0.98891,0.008516258,0.0006081209,0.0004636302,0.0012134549,0.0002886744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003977943,0.0018097742,0.0011289412,0.0013591562,0.0007909611,0.0023939835,0.0013490609,0.001681727,0.0056061274],"category_scores_gemma":[0.020672906,0.0006696338,0.0010352008,0.0008147462,0.002183883,0.0027857106,0.003179824,0.0037833685,0.0011980998],"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.00022496545,0.0001105234,0.00067559246,0.00039551762,0.000056704062,0.00019615793,0.0005465347,0.40268502,0.011746137,0.5439331,0.0039250124,0.03550473],"study_design_scores_gemma":[0.0000131934985,0.000029250714,0.00006796379,0.0000353364,0.0000094277,0.000023174223,0.00003691682,0.89696217,0.0013936303,0.10050102,0.0009160833,0.000011918537],"about_ca_topic_score_codex":0.0020467786,"about_ca_topic_score_gemma":0.002738981,"teacher_disagreement_score":0.0056061274,"about_ca_system_score_codex":0.0015794918,"about_ca_system_score_gemma":0.0013809202,"threshold_uncertainty_score":0.021037579},"labels":[],"label_agreement":null},{"id":"W2593022588","doi":"","title":"On Harary spectral radius with given parameters.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; RADIUS; Physics; Quantum mechanics; Computer science; Eigenvalues and eigenvectors; Computer security","score_opus":0.011960099672384678,"score_gpt":0.23129027841698077,"score_spread":0.2193301787445961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593022588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20329696,0.008304562,0.55043644,0.006247792,0.0010447274,0.00013948974,0.0012823408,0.0018337994,0.22741385],"genre_scores_gemma":[0.90054846,0.0027594185,0.06618289,0.0014266508,0.0010377022,0.00026929876,0.0007738025,0.0008872121,0.026114516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970054,0.001399901,0.000119210796,0.00047810088,0.00056605146,0.0004313502],"domain_scores_gemma":[0.98527944,0.009317598,0.0011244525,0.0017960166,0.0011679627,0.0013144725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031168717,0.0012105025,0.0015777707,0.0034800791,0.0018903149,0.0035084428,0.002902215,0.0025047292,0.014118942],"category_scores_gemma":[0.026641048,0.00060435303,0.0005495452,0.0022423645,0.004455047,0.008618571,0.0057466547,0.0038842882,0.005328236],"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.00015572646,0.000039337,0.00060528616,0.000115626135,0.000022839009,0.00006559703,0.00024270058,0.006757756,0.0012125092,0.9691065,0.009616202,0.012059906],"study_design_scores_gemma":[0.000017516035,0.000022590411,0.0003774461,0.00005249223,0.000015291065,0.00013541507,0.0001302161,0.02847839,0.0007957143,0.96515423,0.004795816,0.000024957992],"about_ca_topic_score_codex":0.0009595882,"about_ca_topic_score_gemma":0.000898464,"teacher_disagreement_score":0.014118942,"about_ca_system_score_codex":0.0017369211,"about_ca_system_score_gemma":0.0007409041,"threshold_uncertainty_score":0.04723257},"labels":[],"label_agreement":null},{"id":"W2593312378","doi":"","title":"A geometric property of the functional associated with general systems of algebraic equations","year":2006,"lang":"en","type":"article","venue":"International Symposium on Antenna Technology and Applied Electromagnetics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Property (philosophy); Simple (philosophy); Point (geometry); Algebraic equation; Mathematical analysis; Algebraic number; Functional equation; Matrix (chemical analysis); Applied mathematics; System of linear equations; Differential equation; Nonlinear system; Geometry; Physics","score_opus":0.005598273779815541,"score_gpt":0.18402423371906998,"score_spread":0.17842595993925445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593312378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046027556,0.00040636552,0.9322747,0.0007842955,0.00017854788,0.000056219404,0.0001713816,0.00025506702,0.019845841],"genre_scores_gemma":[0.7593982,0.0009755813,0.22177537,0.00065683114,0.0006505956,0.0002477067,0.00064457115,0.00053066,0.015120524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987735,0.0003196556,0.00007034356,0.0003556374,0.00036528974,0.00011554426],"domain_scores_gemma":[0.9986034,0.00038975923,0.00031249548,0.00020693829,0.0003825968,0.000104793035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012653236,0.00065780064,0.0005706215,0.0013305766,0.00096488127,0.0016109439,0.0007945922,0.00082299666,0.004621518],"category_scores_gemma":[0.0037792337,0.0002828683,0.0006179938,0.0009829098,0.0036756997,0.00268549,0.0024045636,0.0016718308,0.0010581056],"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.000016486962,0.000008746011,0.00042275185,0.000064019085,0.000011108764,0.00008081795,0.00013766461,0.0076711727,0.0040480564,0.9720499,0.0010879517,0.014401479],"study_design_scores_gemma":[0.00001867964,0.00015235654,0.0011828984,0.000034297012,0.000013676696,0.0009465054,0.00012990204,0.095727645,0.0036126804,0.87001944,0.02811297,0.000048958096],"about_ca_topic_score_codex":0.00085330056,"about_ca_topic_score_gemma":0.00046620058,"teacher_disagreement_score":0.004621518,"about_ca_system_score_codex":0.0006580264,"about_ca_system_score_gemma":0.0006313328,"threshold_uncertainty_score":0.015460491},"labels":[],"label_agreement":null},{"id":"W2593488433","doi":"10.1016/j.laa.2017.02.008","title":"On complex matrix scalings of extremal permanent","year":2017,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Mathematics; Identity matrix; Matrix (chemical analysis); Combinatorics; Characterization (materials science); Pure mathematics; Positive-definite matrix; Abelian group; Block matrix; Regular polygon; Geometry; Eigenvalues and eigenvectors","score_opus":0.02433356974792768,"score_gpt":0.29798276035665683,"score_spread":0.27364919060872916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593488433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47553897,0.003502143,0.3821942,0.00516165,0.0017294104,0.00009534412,0.00051500386,0.0009193632,0.13034396],"genre_scores_gemma":[0.9579601,0.0009308907,0.02214202,0.0006643937,0.00106292,0.000074144526,0.0001977689,0.0003321235,0.016635476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932945,0.00023339012,0.00003030424,0.0001499716,0.00015840126,0.00009850068],"domain_scores_gemma":[0.9968286,0.0014865425,0.00047541468,0.00039789965,0.0003703635,0.00044103226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014995472,0.00087397115,0.00105991,0.0021337385,0.0016420059,0.00258224,0.0012912552,0.0013488207,0.0102611175],"category_scores_gemma":[0.00956528,0.0005218036,0.00063121546,0.0012985979,0.0037670347,0.004540901,0.0020239372,0.002274919,0.00089795986],"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.000025011397,0.000017191112,0.00013938893,0.000029132145,0.0000055795836,0.000058512942,0.0000843585,0.002648795,0.00054398825,0.99154925,0.0015638125,0.0033349977],"study_design_scores_gemma":[0.0000068026498,0.0000124281105,0.00021321201,0.000011820326,0.000003441653,0.00007216464,0.000049813956,0.024393944,0.00021834877,0.9739085,0.0010940525,0.000015380176],"about_ca_topic_score_codex":0.00047415975,"about_ca_topic_score_gemma":0.00055762863,"teacher_disagreement_score":0.0102611175,"about_ca_system_score_codex":0.0008311943,"about_ca_system_score_gemma":0.00045348733,"threshold_uncertainty_score":0.03432685},"labels":[],"label_agreement":null},{"id":"W2594309699","doi":"10.1111/j.1475-3995.2008.00682.x","title":"Characterizing arbitrarily slow convergence in the method of alternating projections","year":2009,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"Canada Research Chairs","keywords":"Mathematics; Hilbert space; Multiplicative function; Trichotomy (philosophy); Convergence (economics); Dominated convergence theorem; Pure mathematics; Mathematical analysis; Compact convergence; Rate of convergence; Computer science","score_opus":0.08092768052822447,"score_gpt":0.42191076915810527,"score_spread":0.3409830886298808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594309699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1080358,0.00058961596,0.88181955,0.0008518219,0.00016327637,0.000118690514,0.00007754085,0.0003325141,0.008011252],"genre_scores_gemma":[0.82907104,0.0006268468,0.16065264,0.0005007324,0.0002674217,0.00071944116,0.00017477902,0.00057796953,0.007409144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944301,0.0032799372,0.00022790814,0.00042359915,0.0011938043,0.0004446367],"domain_scores_gemma":[0.9638005,0.02550093,0.0020485648,0.0026558011,0.004218472,0.0017757516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013426758,0.0015385139,0.001112567,0.0020335317,0.0012399872,0.0021185433,0.0022727835,0.0015089643,0.003665998],"category_scores_gemma":[0.0492453,0.00088214397,0.001241584,0.0006494803,0.004500947,0.0049498524,0.0070716324,0.0038730076,0.0008184868],"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.0007197324,0.00009457036,0.005577422,0.00030416934,0.00017435837,0.00047573893,0.00065650156,0.05371162,0.018146966,0.90357834,0.0022118336,0.014348733],"study_design_scores_gemma":[0.000072550414,0.00024467794,0.0007417576,0.00008615263,0.00003422584,0.00021399149,0.00012701753,0.6618921,0.008496624,0.32549438,0.0025326812,0.00006385477],"about_ca_topic_score_codex":0.00080706476,"about_ca_topic_score_gemma":0.00049730804,"teacher_disagreement_score":0.013426758,"about_ca_system_score_codex":0.0011994815,"about_ca_system_score_gemma":0.0009981571,"threshold_uncertainty_score":0.071008384},"labels":[],"label_agreement":null},{"id":"W2594857936","doi":"10.1145/3055282.3055297","title":"Computing characteristic polynomials of matrices of structured polynomials","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Orthogonal polynomials; Difference polynomials; Discrete orthogonal polynomials; Classical orthogonal polynomials; Algebra over a field; Pure mathematics; Combinatorics","score_opus":0.034678326920184695,"score_gpt":0.31711031432879794,"score_spread":0.28243198740861325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594857936","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.299455,0.00029490748,0.6860877,0.0005104486,0.00011796226,0.000099858866,0.0007025409,0.0007181896,0.012013405],"genre_scores_gemma":[0.86253995,0.00027070125,0.12901516,0.00016886227,0.0001842675,0.000055488777,0.0012396816,0.00018741918,0.0063385163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933976,0.0001014028,0.000027442788,0.00016436962,0.0002005416,0.00016659606],"domain_scores_gemma":[0.99720216,0.0013911941,0.00035557096,0.00039380908,0.00043082595,0.00022646558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053491944,0.00054971356,0.0006431178,0.0010834737,0.0005863187,0.0016328744,0.0011545429,0.0007351131,0.0057067056],"category_scores_gemma":[0.0064303563,0.00030678397,0.0005608823,0.0016600507,0.0010375861,0.004334396,0.0011338892,0.0014652063,0.0012114149],"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.0004943762,0.00030059888,0.0063484665,0.00057326467,0.00007555639,0.00067982206,0.00057790964,0.06610854,0.028713604,0.70911014,0.010643398,0.1763743],"study_design_scores_gemma":[0.000049281807,0.00017421585,0.0013625277,0.000031541585,0.00002239848,0.00045505492,0.0001941177,0.1504406,0.012335108,0.8304573,0.0044355383,0.00004219129],"about_ca_topic_score_codex":0.0007047709,"about_ca_topic_score_gemma":0.001838066,"teacher_disagreement_score":0.0057067056,"about_ca_system_score_codex":0.00063743454,"about_ca_system_score_gemma":0.00085144833,"threshold_uncertainty_score":0.019090831},"labels":[],"label_agreement":null},{"id":"W2597583775","doi":"","title":"Parallel fully coupled Schwarz preconditioners for saddle point problems.","year":2006,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Toronto Metropolitan University","funders":"","keywords":"Schwarz alternating method; Additive Schwarz method; Saddle point; Mathematics; Saddle; Applied mathematics; Mathematical optimization; Geometry; Domain decomposition methods; Finite element method; Engineering; Structural engineering","score_opus":0.01103510263195679,"score_gpt":0.22214618935975466,"score_spread":0.21111108672779788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597583775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031368304,0.00028038648,0.9628376,0.00019798559,0.000074808704,0.000090101865,0.000046571764,0.00032282202,0.0047813784],"genre_scores_gemma":[0.3466791,0.00049094827,0.64681107,0.00012116468,0.00009535463,0.0002933363,0.00018185868,0.000152166,0.005174996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999627,0.00015064735,0.000013610029,0.000027585198,0.00014951735,0.00003161941],"domain_scores_gemma":[0.99924004,0.00036408455,0.00008683442,0.00012273327,0.00012580577,0.000060485585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007889614,0.00078033697,0.0005727324,0.00039011767,0.00056370406,0.00041750658,0.00072632905,0.00066425133,0.0023828936],"category_scores_gemma":[0.0020399867,0.00034977257,0.0006737813,0.00035008747,0.0009014866,0.0006795951,0.0010240166,0.0008494112,0.0005210236],"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.00026480356,0.00017308535,0.0021001045,0.00040918367,0.00013999286,0.00041319447,0.00044264362,0.65014017,0.035893936,0.18627161,0.005376664,0.11837465],"study_design_scores_gemma":[0.000031215404,0.00005650369,0.0001414966,0.0000070187352,0.000009164648,0.00004283915,0.000016937081,0.9802176,0.004362952,0.013028692,0.0020781928,0.0000074705426],"about_ca_topic_score_codex":0.0012958662,"about_ca_topic_score_gemma":0.0017695071,"teacher_disagreement_score":0.0023828936,"about_ca_system_score_codex":0.00025996647,"about_ca_system_score_gemma":0.00061921484,"threshold_uncertainty_score":0.007971585},"labels":[],"label_agreement":null},{"id":"W2597718095","doi":"10.5539/jmr.v9n2p128","title":"A Pilot Included Column Mean Vanishing Matrix","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Column (typography); Matrix (chemical analysis); Property (philosophy); Applied mathematics; Algorithm; Geometry; Chromatography","score_opus":0.1544822466667008,"score_gpt":0.43445415937560117,"score_spread":0.2799719127089004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597718095","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11790074,0.0005271589,0.8697175,0.0003618756,0.0004623068,0.000042997504,0.000117923264,0.0002842773,0.010585196],"genre_scores_gemma":[0.90102243,0.00049737946,0.091239825,0.00020685511,0.00025767976,0.000035018133,0.00012821482,0.000047332334,0.0065652994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978715,0.00006605982,0.0000072593393,0.000047117905,0.000058568923,0.000033898286],"domain_scores_gemma":[0.999366,0.00023298325,0.00009664391,0.000095429656,0.00015054541,0.000058445235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003492907,0.00040489447,0.00037677365,0.00025175788,0.00028392722,0.00046151588,0.00031787224,0.0005667031,0.0023369228],"category_scores_gemma":[0.0013373443,0.00011780322,0.00030011407,0.00041982514,0.00075115386,0.00068044185,0.00028284674,0.00048649576,0.0004203419],"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.0006520928,0.00015566734,0.002612895,0.0004902927,0.00013973811,0.00312959,0.00039024116,0.21373762,0.1613918,0.53317857,0.006208286,0.07791325],"study_design_scores_gemma":[0.00004579726,0.00043030444,0.0012426419,0.000030473238,0.00007010921,0.0021900397,0.00010919039,0.9149017,0.027589984,0.04307713,0.010250702,0.00006190663],"about_ca_topic_score_codex":0.00077944185,"about_ca_topic_score_gemma":0.00052388356,"teacher_disagreement_score":0.0023369228,"about_ca_system_score_codex":0.00019062204,"about_ca_system_score_gemma":0.00035954377,"threshold_uncertainty_score":0.007817745},"labels":[],"label_agreement":null},{"id":"W2599943070","doi":"10.13001/1081-3810.3249","title":"The Enhanced Principal Rank Characteristic Sequence for Hermitian Matrices","year":2017,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"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 Victoria","funders":"","keywords":"Hermitian matrix; Mathematics; Rank (graph theory); Combinatorics; Sequence (biology); Matrix (chemical analysis); Symmetric matrix; Matrix analysis; Pure mathematics; Eigenvalues and eigenvectors; Physics; Quantum mechanics; Chemistry","score_opus":0.015516357366676262,"score_gpt":0.28922071721186376,"score_spread":0.2737043598451875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599943070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31265777,0.00085319293,0.6314039,0.0010034785,0.00020543212,0.0001438598,0.00075543165,0.0004436153,0.05253335],"genre_scores_gemma":[0.88913244,0.00065664283,0.09708834,0.00034861665,0.0002785783,0.00016429365,0.0006075386,0.000086283406,0.011637374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998961,0.00027963988,0.000057101748,0.0002251019,0.00030356474,0.00017351829],"domain_scores_gemma":[0.9958205,0.0015970747,0.00077035103,0.00058845954,0.00081835553,0.00040516426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010461207,0.0004837771,0.0003508165,0.0012605126,0.00056981744,0.0012797919,0.0005639467,0.00067924935,0.0055838823],"category_scores_gemma":[0.006678117,0.00020475098,0.00031100077,0.0009014515,0.0017886882,0.0027726856,0.0010634399,0.0013077823,0.0013595639],"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.00013221394,0.000033850556,0.00076799194,0.00009775834,0.000008088965,0.00019161415,0.00021870357,0.008875789,0.0073660114,0.9559056,0.0018727934,0.024529504],"study_design_scores_gemma":[0.000022690567,0.00015929563,0.00053163833,0.000029937213,0.0000055089095,0.00044929856,0.00008266451,0.046369515,0.00494228,0.9417762,0.0055861,0.00004477497],"about_ca_topic_score_codex":0.00033668565,"about_ca_topic_score_gemma":0.00035350918,"teacher_disagreement_score":0.0055838823,"about_ca_system_score_codex":0.0005069463,"about_ca_system_score_gemma":0.0007926022,"threshold_uncertainty_score":0.018679976},"labels":[],"label_agreement":null},{"id":"W2601553401","doi":"10.48550/arxiv.1703.01325","title":"Decoupled Block-Wise ILU(k) Preconditioner on GPU","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures; CMG Reservoir Simulation Foundation","keywords":"Preconditioner; Triangular matrix; Block (permutation group theory); Factorization; Incomplete LU factorization; Block size; Solver; LU decomposition; Block matrix; Computer science; Matrix (chemical analysis); Diagonal; Mathematics; Algorithm; Matrix decomposition; Parallel computing; Combinatorics; Iterative method; Eigenvalues and eigenvectors; Mathematical optimization; Physics; Geometry; Invertible matrix; Chemistry; Pure mathematics","score_opus":0.05382145925814634,"score_gpt":0.19814076607758382,"score_spread":0.1443193068194375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601553401","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019800076,0.00024214723,0.9638111,0.00023803441,0.00009602603,0.0000571221,0.00017815053,0.003507716,0.012069578],"genre_scores_gemma":[0.23755446,0.00021674867,0.74997777,0.00025965713,0.000057053767,0.00017145397,0.000540688,0.0007406977,0.010481437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959964,0.00008755774,0.000022541846,0.00006511506,0.00015578042,0.000069408285],"domain_scores_gemma":[0.9995448,0.000110746965,0.00004338825,0.00013439443,0.00013287291,0.000033791286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029962292,0.0006347525,0.00076201494,0.0003070049,0.00051756366,0.000725983,0.0010701371,0.0007020289,0.009742377],"category_scores_gemma":[0.0013290726,0.0003151793,0.00048316765,0.0006034919,0.0005010711,0.0009786427,0.0010563879,0.0012140729,0.0025492304],"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.00081586046,0.00022868598,0.0025478797,0.0005109087,0.00014236792,0.0005158568,0.000573612,0.5204314,0.07225766,0.08432088,0.031566758,0.2860881],"study_design_scores_gemma":[0.000054566422,0.000046569225,0.00016807752,0.000014276714,0.000010737256,0.00005699146,0.00003521763,0.9741211,0.010032655,0.0075678686,0.007880702,0.000011289062],"about_ca_topic_score_codex":0.005654045,"about_ca_topic_score_gemma":0.0074835764,"teacher_disagreement_score":0.009742377,"about_ca_system_score_codex":0.00047388277,"about_ca_system_score_gemma":0.001094313,"threshold_uncertainty_score":0.03259152},"labels":[],"label_agreement":null},{"id":"W2603367663","doi":"","title":"A new rank formula for idempotent matrices with applications","year":2002,"lang":"en","type":"article","venue":"Czech Digital Mathematics Library (Institute of Mathematics CAS)","topic":"Matrix Theory and Algorithms","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","keywords":"Idempotence; Idempotent matrix; Rank (graph theory); Mathematics; Combinatorics; Computer science; Algebra over a field; Pure mathematics","score_opus":0.0177838453367214,"score_gpt":0.21876719985015844,"score_spread":0.20098335451343705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603367663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018958231,0.002276083,0.9061063,0.0011553945,0.0013869527,0.000087728724,0.00031069212,0.0006155451,0.06910313],"genre_scores_gemma":[0.44264668,0.0039564646,0.47644678,0.0014350397,0.004074816,0.0003316883,0.0008841074,0.0010677875,0.069156624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870884,0.0003131383,0.000103276725,0.00020174796,0.00055574975,0.00011733439],"domain_scores_gemma":[0.99717367,0.001033515,0.00028338045,0.0004025644,0.0009538887,0.00015303741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016835524,0.0012315648,0.0006377198,0.0023943265,0.0007071707,0.0028602825,0.0010910804,0.00093303865,0.014822448],"category_scores_gemma":[0.008076449,0.00036844736,0.0006075473,0.0020551456,0.0015605852,0.004074694,0.0016052695,0.0024946386,0.00545767],"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.00003954566,0.00004386817,0.00024282202,0.00013466884,0.0000109854445,0.00024395798,0.00015532962,0.003771455,0.0032118112,0.91180277,0.012510736,0.06783209],"study_design_scores_gemma":[0.000018040811,0.00008839627,0.00026286943,0.00006753048,0.000023779468,0.001136553,0.000083632556,0.06152053,0.003970514,0.89646477,0.03630306,0.000060401522],"about_ca_topic_score_codex":0.0003592923,"about_ca_topic_score_gemma":0.00061769463,"teacher_disagreement_score":0.014822448,"about_ca_system_score_codex":0.0006952719,"about_ca_system_score_gemma":0.00070935197,"threshold_uncertainty_score":0.049586058},"labels":[],"label_agreement":null},{"id":"W2607945474","doi":"10.1090/crmp/029/13","title":"Bäcklund transformations for the reduced Maxwell-Bloch equations","year":2001,"lang":"en","type":"book-chapter","venue":"CRM proceedings & lecture notes","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematical physics; Maxwell's equations; Mathematics; Calculus (dental); Classical mechanics; Mathematical analysis; Physics; Medicine","score_opus":0.024199179850678414,"score_gpt":0.24986797761009633,"score_spread":0.22566879775941792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607945474","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19618078,0.007109865,0.33312258,0.0070215897,0.004405447,0.00018578232,0.0006938214,0.0011118867,0.45016825],"genre_scores_gemma":[0.5912003,0.005881567,0.08186696,0.0018253027,0.002373316,0.00027848143,0.00093298324,0.00089974585,0.31474125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997291,0.00006342724,0.000016188304,0.00003181241,0.000118829936,0.00004066845],"domain_scores_gemma":[0.999752,0.000050844093,0.000028331135,0.00005310138,0.0000659024,0.00004984713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005622989,0.00088477787,0.00097242533,0.0015704242,0.0011641007,0.0022706436,0.0011270515,0.0011616445,0.009858738],"category_scores_gemma":[0.0013976364,0.00045615976,0.0010646294,0.001077304,0.001959424,0.003390534,0.0012683047,0.0030267902,0.002381323],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071193863,0.000014416338,0.000013595616,0.000015106046,0.000002800097,0.000019102135,0.000057812264,0.00057611434,0.00060052326,0.9937623,0.0013556861,0.0035754323],"study_design_scores_gemma":[0.000012761067,0.000008294271,0.000067081004,0.00000682882,0.0000028001778,0.000043376895,0.000039384002,0.0058057816,0.00030697006,0.98930407,0.004391483,0.000011209527],"about_ca_topic_score_codex":0.0024902546,"about_ca_topic_score_gemma":0.002040508,"teacher_disagreement_score":0.009858738,"about_ca_system_score_codex":0.0016208343,"about_ca_system_score_gemma":0.00134018,"threshold_uncertainty_score":0.03298074},"labels":[],"label_agreement":null},{"id":"W2609527018","doi":"10.1142/s100538671700013x","title":"A System of Matrix Equations over the Quaternion Algebra with Applications","year":2017,"lang":"en","type":"article","venue":"Algebra Colloquium","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Quaternion; Mathematics; Algebra over a field; Representation (politics); Matrix (chemical analysis); Consistency (knowledge bases); Matrix representation; Expression (computer science); Quaternion algebra; System of linear equations; Current (fluid); Applied mathematics; Pure mathematics; Algebra representation; Mathematical analysis; Discrete mathematics; Division algebra; Geometry; Computer science; Law; Group (periodic table)","score_opus":0.01101486769092788,"score_gpt":0.2563539428283959,"score_spread":0.24533907513746803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609527018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07478435,0.0007207905,0.8852367,0.0012536312,0.00025178413,0.0001241108,0.00020951217,0.0001273285,0.037291802],"genre_scores_gemma":[0.7029216,0.0010437568,0.26774877,0.00036686548,0.0003987246,0.00026812335,0.00040326425,0.00006380659,0.026785092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956924,0.000107973276,0.000027946251,0.000106331754,0.00013923085,0.000049283793],"domain_scores_gemma":[0.99960977,0.0001371755,0.00007365873,0.000034996287,0.00012002191,0.00002444046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065184076,0.00056344544,0.00056675606,0.00041509751,0.0006968995,0.0010783318,0.0007493172,0.00084662583,0.0075915335],"category_scores_gemma":[0.0016682572,0.00020954615,0.00063142664,0.0007068056,0.0009778165,0.0013881723,0.00095111993,0.0010384327,0.0006660326],"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.000026302712,0.000033606088,0.00053466007,0.00013272528,0.000022118329,0.00046671517,0.00024341153,0.06415316,0.005353805,0.91073006,0.0023136989,0.015989633],"study_design_scores_gemma":[0.000054565422,0.00009242654,0.00037474613,0.000039836712,0.000019827794,0.00054645695,0.00018089518,0.4522037,0.002979701,0.531075,0.012395117,0.000037762067],"about_ca_topic_score_codex":0.0017446894,"about_ca_topic_score_gemma":0.0015996973,"teacher_disagreement_score":0.0075915335,"about_ca_system_score_codex":0.00045637792,"about_ca_system_score_gemma":0.00080440665,"threshold_uncertainty_score":0.025396228},"labels":[],"label_agreement":null},{"id":"W2609852684","doi":"10.1090/crmm/002/02","title":"Basic integral transforms","year":2007,"lang":"en","type":"book-chapter","venue":"CRM monograph series","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Computer science","score_opus":0.021455551066277664,"score_gpt":0.23305236940857246,"score_spread":0.2115968183422948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609852684","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039091366,0.008514718,0.08919738,0.001282196,0.0014076428,0.000030079924,0.000237542,0.00044922667,0.89497215],"genre_scores_gemma":[0.092406064,0.014303773,0.049492083,0.0008929641,0.0028538604,0.00011063571,0.0007525452,0.0009395572,0.83824855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997323,0.000033039298,0.000009506502,0.00005349915,0.00014523382,0.000026370484],"domain_scores_gemma":[0.99983346,0.000035483947,0.000009663044,0.00004205761,0.000061397186,0.000017905792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036630852,0.000855341,0.0006438485,0.0016374976,0.00075266534,0.0025511733,0.0008342318,0.0007758045,0.030192267],"category_scores_gemma":[0.00081219483,0.00032934197,0.00037537937,0.0019112026,0.0015368273,0.0030735414,0.0010436852,0.0025268076,0.015611322],"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.0000055157325,0.000015989293,0.000021166843,0.00004383342,0.000002660979,0.000017445245,0.00008262352,0.0002948274,0.0007316095,0.90777266,0.025292397,0.06571934],"study_design_scores_gemma":[0.000004336471,0.000012757418,0.00014883709,0.000048529255,0.0000058907262,0.0002083428,0.000056472687,0.0026202886,0.001337031,0.6914035,0.3041431,0.000010840398],"about_ca_topic_score_codex":0.00049746025,"about_ca_topic_score_gemma":0.0005863042,"teacher_disagreement_score":0.030192267,"about_ca_system_score_codex":0.0010415586,"about_ca_system_score_gemma":0.00055162626,"threshold_uncertainty_score":0.10100317},"labels":[],"label_agreement":null},{"id":"W2614151385","doi":"10.1007/978-3-319-43370-7_10","title":"Erratum to: Fourier Series","year":2017,"lang":"en","type":"erratum","venue":"Applied and numerical harmonic analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kingston Health Sciences Centre","funders":"","keywords":"Series (stratigraphy); Fourier series; Computer science; Mathematics; Geology; Mathematical analysis; Paleontology","score_opus":0.01130048291580745,"score_gpt":0.2458723942381455,"score_spread":0.23457191132233804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614151385","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021248388,0.0014305403,0.001109809,0.03814194,0.942595,0.000026332598,0.0004640619,0.00023795954,0.015781773],"genre_scores_gemma":[0.011929851,0.010695456,0.0061747725,0.050403226,0.33003446,0.00019984246,0.0024643596,0.0019475895,0.58615047],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951879,0.0005369262,0.00074627047,0.00050293386,0.0027357535,0.00029032252],"domain_scores_gemma":[0.98392856,0.0033835704,0.0008163477,0.001131939,0.010079972,0.0006595648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030103177,0.002455143,0.0018988096,0.0058636563,0.0043895743,0.005058311,0.0028795432,0.006187191,0.07094973],"category_scores_gemma":[0.04421132,0.0008706752,0.001280815,0.003282008,0.0025708107,0.0042094314,0.0021273699,0.00882558,0.047156762],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021110909,0.0000091985075,0.0000348671,0.000058292644,0.000005284103,0.000111405236,0.000015729147,0.00004822193,0.000033005428,0.00339823,0.9889764,0.007288152],"study_design_scores_gemma":[0.00002163437,0.000027964907,0.00033823974,0.00029273078,0.000023277991,0.0003799024,0.00009827121,0.000547,0.00036533046,0.008020162,0.98985416,0.000031295924],"about_ca_topic_score_codex":0.0072988896,"about_ca_topic_score_gemma":0.008730123,"teacher_disagreement_score":0.07094973,"about_ca_system_score_codex":0.004438478,"about_ca_system_score_gemma":0.0049567814,"threshold_uncertainty_score":0.23735052},"labels":[],"label_agreement":null},{"id":"W2616864018","doi":"10.1016/j.acha.2017.11.001","title":"Fast and backward stable transforms between spherical harmonic expansions and bivariate Fourier series","year":2017,"lang":"en","type":"preprint","venue":"Applied and Computational Harmonic Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Spherical harmonics; Fourier series; Legendre function; Bivariate analysis; Factorization; Series (stratigraphy); Legendre polynomials; Connection (principal bundle); Fourier transform; Pure mathematics; Matrix (chemical analysis); Harmonic; Hermite polynomials; Mathematical analysis; Physics; Algorithm; Geometry","score_opus":0.019428593199830778,"score_gpt":0.253707941650511,"score_spread":0.23427934845068024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616864018","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010369445,0.0002833127,0.98475873,0.00015709615,0.0001531614,0.000027659604,0.00007957466,0.00018091385,0.0039901426],"genre_scores_gemma":[0.3295595,0.0014938705,0.6450369,0.0003259444,0.00062057225,0.00021403698,0.00053518254,0.0006961074,0.021517888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914134,0.00027812424,0.00003709501,0.00012292282,0.00036925694,0.00005130132],"domain_scores_gemma":[0.9977945,0.0011701615,0.00017611722,0.00029744807,0.00042370704,0.00013809025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019208977,0.0009894219,0.0006356715,0.0015005121,0.00045952862,0.0021192713,0.0010966982,0.0010437111,0.007712956],"category_scores_gemma":[0.010508405,0.0004294917,0.00068251137,0.0015656635,0.00159752,0.0030737869,0.0023607868,0.0024267246,0.0025026714],"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.00018592956,0.000053970987,0.0003562155,0.00010473101,0.00003180252,0.0001257916,0.00026237353,0.025554886,0.010815549,0.8333895,0.00427056,0.12484864],"study_design_scores_gemma":[0.000033409495,0.000059266327,0.00031016517,0.000041028943,0.000018233626,0.00022092756,0.000117495256,0.49931827,0.006089235,0.4855616,0.008190786,0.000039549563],"about_ca_topic_score_codex":0.0007376644,"about_ca_topic_score_gemma":0.0008854247,"teacher_disagreement_score":0.007712956,"about_ca_system_score_codex":0.0005091652,"about_ca_system_score_gemma":0.0006527745,"threshold_uncertainty_score":0.025802433},"labels":[],"label_agreement":null},{"id":"W2617038290","doi":"10.5539/jmr.v9n3p46","title":"Symmetric Boundary Condition for Laplacian on Net of Regular Hexagons","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Laplace operator; Boundary (topology); Fourier series; Hexagonal tiling; Matrix (chemical analysis); Stencil; Mathematical analysis; Boundary value problem; Grid; Geometry","score_opus":0.10395606183935378,"score_gpt":0.4169201910521215,"score_spread":0.3129641292127677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617038290","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38970268,0.00041939018,0.540005,0.0006477829,0.00034316865,0.00007826781,0.0007114947,0.00025986918,0.0678323],"genre_scores_gemma":[0.93026614,0.00026061008,0.05364616,0.00021320273,0.0000832196,0.00008449417,0.00053720496,0.00016052858,0.014748446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972886,0.000055253982,0.00001226032,0.00005444156,0.00009565222,0.00005342483],"domain_scores_gemma":[0.9995982,0.00010707249,0.000056300094,0.00005571852,0.00012291185,0.000059866357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002322121,0.00020216627,0.0002949982,0.00050118455,0.00051228865,0.00079107267,0.0005102567,0.0004260848,0.006459639],"category_scores_gemma":[0.0011539084,0.000119437995,0.00027185274,0.00024498612,0.00065214274,0.00077876734,0.0007113836,0.0004885931,0.00086243596],"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.0001358792,0.00005467601,0.0019649642,0.00013689061,0.00001224959,0.0006528375,0.00015122164,0.06447529,0.017961472,0.8863376,0.005520681,0.022596216],"study_design_scores_gemma":[0.000025198011,0.000068383946,0.0011785284,0.000027999004,0.0000044666285,0.0005293035,0.00030716453,0.6354518,0.0070314384,0.34699503,0.008356392,0.00002437384],"about_ca_topic_score_codex":0.0012018237,"about_ca_topic_score_gemma":0.0010086779,"teacher_disagreement_score":0.006459639,"about_ca_system_score_codex":0.00034340555,"about_ca_system_score_gemma":0.00034833068,"threshold_uncertainty_score":0.021609664},"labels":[],"label_agreement":null},{"id":"W2619795208","doi":"10.71781/15467","title":"Étude d'un système prédateur-proie avec fonction de réponse Holling de type III généralisée","year":2006,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Philosophy; Physics; Humanities; Mathematical physics","score_opus":0.02780369542502187,"score_gpt":0.2904214810686039,"score_spread":0.262617785643582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619795208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22360052,0.0010009924,0.75123286,0.0007951267,0.00038011867,0.000136536,0.00034503193,0.0035682651,0.018940452],"genre_scores_gemma":[0.86050534,0.00034334572,0.11261664,0.00014745205,0.000121998746,0.00011388909,0.00033141943,0.0004181497,0.025401773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988776,0.00017518978,0.00004927685,0.0003067504,0.00038303135,0.00020815375],"domain_scores_gemma":[0.99503654,0.002844913,0.00025563312,0.0006713886,0.0008928746,0.00029866167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016699911,0.0010253745,0.0018860264,0.0011346472,0.002075665,0.004371075,0.002160921,0.0025211964,0.010513161],"category_scores_gemma":[0.00861932,0.0007652095,0.001360121,0.00080735434,0.0026365032,0.0030616827,0.0017351559,0.0017380756,0.0013253576],"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.0019757987,0.00030574552,0.009543272,0.00084184925,0.0003752453,0.002968409,0.0018370973,0.3207081,0.060247928,0.49718973,0.0084737,0.09553317],"study_design_scores_gemma":[0.00013312399,0.0001787587,0.0017529033,0.000031339743,0.000059960323,0.0007631975,0.00018168252,0.92743945,0.018607298,0.04148387,0.009290988,0.000077405064],"about_ca_topic_score_codex":0.01517665,"about_ca_topic_score_gemma":0.008781205,"teacher_disagreement_score":0.01517665,"about_ca_system_score_codex":0.0025910507,"about_ca_system_score_gemma":0.0016901658,"threshold_uncertainty_score":0.03517002},"labels":[],"label_agreement":null},{"id":"W2619876182","doi":"10.1007/s00010-017-0492-9","title":"P-proper splittings","year":2017,"lang":"la","type":"article","venue":"Aequationes Mathematicae","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"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; University of Manitoba","keywords":"Mathematics; Generalization; Positive-definite matrix; Iterative method; Matrix (chemical analysis); Convergence (economics); Sylvester's law of inertia; Applied mathematics; Sylvester matrix; Sylvester equation; Combinatorics; Pure mathematics; Symmetric matrix; Mathematical analysis; Mathematical optimization; Eigenvalues and eigenvectors","score_opus":0.04377787255849006,"score_gpt":0.29666923961915986,"score_spread":0.2528913670606698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619876182","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20095,0.0013891957,0.2224661,0.0056941374,0.0019794253,0.00015227942,0.0009903962,0.0010271958,0.5653513],"genre_scores_gemma":[0.77961886,0.0010061944,0.04249628,0.0016623944,0.0010525325,0.0001494562,0.001165859,0.0008419255,0.17200646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917233,0.00015229106,0.000048401434,0.00024443268,0.00021810234,0.00016453215],"domain_scores_gemma":[0.9989365,0.00024290329,0.00010251739,0.00022885164,0.00022402217,0.00026526375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083734083,0.0009710426,0.00062413083,0.0017990138,0.002550461,0.002783416,0.0008306919,0.0011073933,0.025376907],"category_scores_gemma":[0.0021435553,0.000597427,0.0008117503,0.0012340782,0.0028230813,0.0061720535,0.003296744,0.0037948268,0.0043534813],"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.000044577886,0.000027864196,0.0001697255,0.000030561736,0.000009086611,0.00010011151,0.00021263088,0.00014313831,0.0011611035,0.9855832,0.004972805,0.0075451625],"study_design_scores_gemma":[0.00001300158,0.000011010142,0.00019204326,0.000009196546,0.0000074063746,0.00016988182,0.00009329347,0.0010078079,0.00089877675,0.9880679,0.009523121,0.0000065754593],"about_ca_topic_score_codex":0.00037798495,"about_ca_topic_score_gemma":0.0004775365,"teacher_disagreement_score":0.025376907,"about_ca_system_score_codex":0.00077477284,"about_ca_system_score_gemma":0.00045501566,"threshold_uncertainty_score":0.08489424},"labels":[],"label_agreement":null},{"id":"W2621158338","doi":"10.2514/6.2017-4414","title":"A Hybrid GMRES Solver with Deflation for Ill-conditioned Adjoint Systems for Aerodynamic Shape Optimization","year":2017,"lang":"en","type":"article","venue":"23rd AIAA Computational Fluid Dynamics Conference","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"McGill University","keywords":"Generalized minimal residual method; Solver; Deflation; Aerodynamics; Computer science; Mathematical optimization; Applied mathematics; Control theory (sociology); Mathematics; Aerospace engineering; Algorithm; Iterative method; Engineering; Artificial intelligence","score_opus":0.017689659776137907,"score_gpt":0.25084096379720516,"score_spread":0.23315130402106726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621158338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006706332,0.00006261399,0.9892252,0.00008575288,0.00006936537,0.000045253837,0.00006259895,0.0010905188,0.0026523792],"genre_scores_gemma":[0.08670292,0.000046373632,0.9079224,0.00014947922,0.000054288495,0.00016291591,0.00022610373,0.00045882407,0.00427677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996381,0.00010200599,0.000019254849,0.000035361427,0.00017557347,0.000029732357],"domain_scores_gemma":[0.9994499,0.00021059989,0.00003965275,0.000088755245,0.0001668905,0.00004411577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058262754,0.00071766815,0.0006840814,0.00036264988,0.0004569512,0.0006627628,0.0012793624,0.001301633,0.0076417937],"category_scores_gemma":[0.0015698008,0.0004730668,0.0005941647,0.000357596,0.00045371588,0.0007677477,0.0017031132,0.0014791813,0.0020825288],"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.00038495433,0.00032396227,0.000974519,0.00030900465,0.00011441539,0.00025303292,0.0002124797,0.59484076,0.046650965,0.03254018,0.011181643,0.31221405],"study_design_scores_gemma":[0.000017288081,0.000028642933,0.000052204192,0.0000053027825,0.0000032307519,0.000024274794,0.0000059231893,0.99443465,0.0021732713,0.0013011387,0.0019466907,0.00000742554],"about_ca_topic_score_codex":0.0020454912,"about_ca_topic_score_gemma":0.0035488582,"teacher_disagreement_score":0.0076417937,"about_ca_system_score_codex":0.00022830022,"about_ca_system_score_gemma":0.0009797342,"threshold_uncertainty_score":0.025564313},"labels":[],"label_agreement":null},{"id":"W2622615600","doi":"","title":"Lattice Preconditioning for the Real Relaxation Branch-and-Bound Approach for Integer Least Squares Problems","year":2013,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Toronto; McGill University; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Branch and bound; Bounding overwatch; Integer (computer science); Upper and lower bounds; Mathematical optimization; Algorithm; Discrete mathematics; Computer science","score_opus":0.013439664124862694,"score_gpt":0.2279116183280393,"score_spread":0.2144719542031766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622615600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029189503,0.00009549562,0.9952833,0.00013116605,0.000032805932,0.000022252478,0.000018020608,0.00016362188,0.0013343208],"genre_scores_gemma":[0.08161298,0.00019090227,0.91584396,0.00015369212,0.000057609097,0.00021172267,0.00011291357,0.00017571988,0.0016404797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895155,0.0005008549,0.000040338924,0.00010090894,0.00030925372,0.00009705669],"domain_scores_gemma":[0.9977471,0.0014927076,0.00014378081,0.00023191565,0.00027849575,0.00010600277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017807202,0.0010232783,0.0011195596,0.00062187423,0.00065824215,0.00096094137,0.0010122291,0.0009355725,0.0054973946],"category_scores_gemma":[0.0068884864,0.00041711293,0.0005292966,0.00092372263,0.0012588421,0.00143103,0.0014415955,0.0029555005,0.0014190611],"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.00025467103,0.00012530525,0.0004940323,0.00020975496,0.000034538793,0.0001142472,0.00013003813,0.76407593,0.006525286,0.09042958,0.004686233,0.13292037],"study_design_scores_gemma":[0.000014718124,0.000026743934,0.000025892548,0.000007476308,0.0000022602444,0.000010128002,0.0000092966275,0.98638225,0.00079339516,0.011756608,0.0009665577,0.000004633786],"about_ca_topic_score_codex":0.0027293519,"about_ca_topic_score_gemma":0.00447382,"teacher_disagreement_score":0.0054973946,"about_ca_system_score_codex":0.0006867147,"about_ca_system_score_gemma":0.0017808862,"threshold_uncertainty_score":0.018390596},"labels":[],"label_agreement":null},{"id":"W2626214900","doi":"","title":"Numerical fault tolerant strategies for resilient parallel eigensolvers","year":2016,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Interpolation (computer graphics); Stability (learning theory); Implementation; Numerical stability; State (computer science); Fault (geology); Scale (ratio); Supercomputer; Algorithm; Fault tolerance; Parallel computing; Computer engineering; Distributed computing; Numerical analysis; Mathematics; Artificial intelligence; Machine learning","score_opus":0.01550985431015475,"score_gpt":0.24487188816030053,"score_spread":0.22936203385014578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626214900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090734445,0.000356978,0.89641756,0.00065124733,0.00022761601,0.000080770136,0.00003676231,0.0006734877,0.01082123],"genre_scores_gemma":[0.8946839,0.0002351719,0.09782493,0.00013735508,0.00007930859,0.000097850134,0.000058151036,0.00013269257,0.006750697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997112,0.00006779456,0.00001707009,0.00004123816,0.00011190478,0.000050760773],"domain_scores_gemma":[0.9993123,0.0002359587,0.00012209173,0.00012825782,0.00014672386,0.000054668973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046391066,0.0009877717,0.00062178914,0.00060395914,0.0007323599,0.0007923707,0.00096819823,0.00072321465,0.0049377014],"category_scores_gemma":[0.002509091,0.0002898324,0.00037475437,0.00037418923,0.00087123946,0.00088242476,0.0016553458,0.0008898154,0.00058022636],"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.0003297065,0.00010486273,0.00046192697,0.00016913361,0.00004437153,0.00015084802,0.00017763904,0.84742135,0.023680536,0.03680587,0.0019730963,0.08868064],"study_design_scores_gemma":[0.000015157451,0.00008363833,0.000060776154,0.000008664421,0.000007008664,0.000032056083,0.000037550984,0.98040855,0.003652507,0.014985113,0.0007036179,0.000005392606],"about_ca_topic_score_codex":0.00059506437,"about_ca_topic_score_gemma":0.0009495034,"teacher_disagreement_score":0.0049377014,"about_ca_system_score_codex":0.0003873969,"about_ca_system_score_gemma":0.00041403933,"threshold_uncertainty_score":0.016518295},"labels":[],"label_agreement":null},{"id":"W2695095978","doi":"10.1109/ccece.2017.7946693","title":"Fast estimation of tridiagonal matrices largest eigenvalue","year":2017,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"University of Calgary","funders":"","keywords":"Tridiagonal matrix; Tridiagonal matrix algorithm; Eigenvalues and eigenvectors; Speedup; Matrix (chemical analysis); Computation; Algorithm; MATLAB; Applied mathematics; Computer science; Sparse matrix; Mathematics; Mathematical optimization; Parallel computing; Physics","score_opus":0.015252275642286782,"score_gpt":0.2719339188375359,"score_spread":0.25668164319524917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2695095978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036743637,0.000076198645,0.99505556,0.00003334665,0.000034009998,0.000019881281,0.000021481299,0.00040932655,0.00067578244],"genre_scores_gemma":[0.1178451,0.0003157212,0.87827873,0.000049629885,0.00009742651,0.00013407841,0.00018294391,0.00033942485,0.0027569898],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991379,0.00024740124,0.000038052396,0.00014167956,0.0003753234,0.00005969436],"domain_scores_gemma":[0.9968837,0.0015101688,0.0002557813,0.0004627319,0.0008066948,0.00008095799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008967893,0.001027733,0.00066903734,0.0015843185,0.00047600377,0.0009965673,0.0008299972,0.000614214,0.005011401],"category_scores_gemma":[0.006506479,0.0004074707,0.0005819987,0.0007600167,0.00077330315,0.0016420042,0.0009967809,0.0012956262,0.0023315095],"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.0004599055,0.00011475308,0.0022395565,0.0005490167,0.00010624083,0.0004705163,0.00054466445,0.15571302,0.10325445,0.07270671,0.0069828504,0.6568584],"study_design_scores_gemma":[0.000027008256,0.00010968585,0.00082947005,0.000036219637,0.000015217796,0.00034412052,0.000067955356,0.9366428,0.036234125,0.01935129,0.006297762,0.00004431354],"about_ca_topic_score_codex":0.0009875929,"about_ca_topic_score_gemma":0.0010134885,"teacher_disagreement_score":0.005011401,"about_ca_system_score_codex":0.00028533099,"about_ca_system_score_gemma":0.0008406778,"threshold_uncertainty_score":0.01676482},"labels":[],"label_agreement":null},{"id":"W2734262381","doi":"","title":"Some equalities for generalized inverses of matrix sums and block circulant matrices","year":2001,"lang":"en","type":"article","venue":"Czech digital mathematics library","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"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":"Circulant matrix; Mathematics; Inverse; Block (permutation group theory); Moore–Penrose pseudoinverse; Drazin inverse; Matrix (chemical analysis); Generalized inverse; Combinatorics; Block matrix; Pure mathematics; Algebra over a field; Eigenvalues and eigenvectors; Geometry","score_opus":0.02439548394324602,"score_gpt":0.2499608467588279,"score_spread":0.22556536281558187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734262381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1641335,0.004455006,0.6403266,0.0014039116,0.0012066012,0.0001230422,0.00053652754,0.00027642076,0.18753837],"genre_scores_gemma":[0.8204381,0.0027785315,0.1292074,0.0007510049,0.0012641841,0.00024606392,0.0005697782,0.0003538714,0.044390976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981359,0.00045869447,0.00015886858,0.000309202,0.00070369913,0.00023362706],"domain_scores_gemma":[0.99697304,0.0014217333,0.00035395782,0.00027804996,0.0007821744,0.00019105957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022910272,0.0010578567,0.0004703388,0.0024993822,0.00092462875,0.003163715,0.00074251957,0.0009130212,0.013795949],"category_scores_gemma":[0.008500582,0.00037462005,0.0008928257,0.0017189778,0.0024451946,0.00398938,0.001725139,0.001479487,0.0025246462],"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.000039348608,0.000014915918,0.00018106021,0.000070194,0.000012669856,0.00018311905,0.00026808263,0.0021545629,0.0016920206,0.9769835,0.0019310152,0.016469592],"study_design_scores_gemma":[0.000015375821,0.00004474122,0.00042423952,0.000053815107,0.000016716149,0.00059755746,0.0001539853,0.022503223,0.0034219937,0.9638711,0.00883711,0.000060075872],"about_ca_topic_score_codex":0.000928503,"about_ca_topic_score_gemma":0.0010710567,"teacher_disagreement_score":0.013795949,"about_ca_system_score_codex":0.0008379954,"about_ca_system_score_gemma":0.00051086553,"threshold_uncertainty_score":0.046151996},"labels":[],"label_agreement":null},{"id":"W273520832","doi":"","title":"EXPONENTIAL FUNCTIONS ON TIME SCALES: THEIR ASYMPTOTIC BEHAVIOR AND CALCULATION","year":2003,"lang":"en","type":"article","venue":"Sound Ideas (University of Puget Sound)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Exponential function; Exponential growth; Applied mathematics; Function (biology); Matrix (chemical analysis); Matrix exponential; Exponential formula; Exponential decay; Double exponential function; Mathematical analysis; Differential equation","score_opus":0.010077506586043575,"score_gpt":0.19875737748848998,"score_spread":0.18867987090244642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W273520832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08478952,0.0013399847,0.888269,0.00066887675,0.00021383069,0.000035164005,0.000052115,0.00032989218,0.024301639],"genre_scores_gemma":[0.7867406,0.0027989312,0.18618011,0.0003486666,0.0007121836,0.00013931011,0.00015153614,0.0004468876,0.022481766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996561,0.00010680679,0.000014042787,0.00005654,0.00011502501,0.000051483596],"domain_scores_gemma":[0.9985253,0.00083955284,0.00018401734,0.0001813587,0.00017826713,0.000091437854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001279079,0.00058080704,0.0003168541,0.001255087,0.0005881907,0.0013881088,0.0010102489,0.00090811064,0.004018266],"category_scores_gemma":[0.007965423,0.00023225792,0.00046717102,0.00082351326,0.0019334228,0.0038481625,0.001090898,0.0015565879,0.0006335923],"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.000013417528,0.000013102586,0.00042039846,0.00003514338,0.0000063155644,0.000056678877,0.00009802371,0.008607392,0.00121896,0.97756916,0.00077642256,0.01118499],"study_design_scores_gemma":[0.0000068035383,0.000019906258,0.00038922633,0.000026343683,0.000005976943,0.0000997352,0.000044551285,0.21212971,0.0014737749,0.78164756,0.0041395864,0.000016835067],"about_ca_topic_score_codex":0.00083551765,"about_ca_topic_score_gemma":0.0005664177,"teacher_disagreement_score":0.004018266,"about_ca_system_score_codex":0.0006242644,"about_ca_system_score_gemma":0.0002754495,"threshold_uncertainty_score":0.013442457},"labels":[],"label_agreement":null},{"id":"W2737436214","doi":"","title":"A Note on Tree Realizations of Matrices","year":2005,"lang":"fr","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Polytechnique Montréal","funders":"","keywords":"Realization (probability); Mathematics; Tree (set theory); Combinatorics; Diagonal; Class (philosophy); Metric (unit); Zero (linguistics); Discrete mathematics; Computer science; Geometry; Statistics; Artificial intelligence","score_opus":0.013002952522268818,"score_gpt":0.2488689644061316,"score_spread":0.23586601188386278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737436214","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0774496,0.002150065,0.86470485,0.0012955661,0.00040548248,0.000042336582,0.00034410847,0.00042589338,0.053182125],"genre_scores_gemma":[0.68806803,0.0044069914,0.2799539,0.00093249173,0.0012696123,0.00025529347,0.0010342374,0.00084677106,0.023232693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911374,0.00029498764,0.000041933894,0.00016187361,0.00027130631,0.000116177616],"domain_scores_gemma":[0.9982101,0.0008781001,0.00019825286,0.00023927729,0.00022271066,0.0002515276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071676774,0.0005410209,0.0007674968,0.0006684904,0.0011466253,0.0013710043,0.0006244646,0.0012008334,0.007086028],"category_scores_gemma":[0.0041200067,0.00041652785,0.00069389306,0.0011277662,0.0011742214,0.0024923137,0.0015609284,0.0023280946,0.0016951801],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027566619,0.000011369334,0.00023061468,0.000034453544,0.000008692199,0.0001165794,0.00010402562,0.013889932,0.0022552346,0.9656952,0.0035376046,0.014088592],"study_design_scores_gemma":[0.000009338477,0.00007594565,0.00026741385,0.000024477162,0.0000069628363,0.0001455366,0.000044971854,0.06880217,0.00083288964,0.91369766,0.016070813,0.000021791937],"about_ca_topic_score_codex":0.0011170534,"about_ca_topic_score_gemma":0.001635694,"teacher_disagreement_score":0.007086028,"about_ca_system_score_codex":0.0004902962,"about_ca_system_score_gemma":0.00044449474,"threshold_uncertainty_score":0.023705184},"labels":[],"label_agreement":null},{"id":"W2737531732","doi":"10.4153/cmb-2017-058-4","title":"Remarks on Inner Functions and Optimal Approximants","year":2017,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Algebra over a field","score_opus":0.012921382183148868,"score_gpt":0.22636862869765959,"score_spread":0.21344724651451072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737531732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108370095,0.0036370785,0.7250966,0.018060613,0.0015622297,0.000051191433,0.00025731575,0.0007472667,0.14221759],"genre_scores_gemma":[0.8718543,0.0022940447,0.0919568,0.0029578444,0.0017645705,0.000081114675,0.00014841759,0.0003856134,0.028557327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855655,0.00050952093,0.000046842873,0.00019209828,0.0004872108,0.00020772617],"domain_scores_gemma":[0.9972907,0.0015875533,0.00013002357,0.00038812205,0.00039949146,0.00020406167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003180025,0.0006545915,0.000871572,0.0010039944,0.0012386356,0.001685489,0.001320081,0.0014297828,0.0072015566],"category_scores_gemma":[0.006707087,0.00026253,0.0007439428,0.00058962003,0.0051899073,0.0037135296,0.0027883188,0.0034775832,0.0007341603],"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.00001043143,0.0000069276634,0.000055330504,0.000019953659,0.0000024405722,0.000027204032,0.000056850546,0.0013836625,0.00025618065,0.9949515,0.0011391111,0.0020905584],"study_design_scores_gemma":[0.0000074249483,0.000020216969,0.0001227015,0.000015351743,0.000003635157,0.00004608275,0.00006788322,0.012133445,0.00060931186,0.9805745,0.0063894205,0.000009956622],"about_ca_topic_score_codex":0.0010427311,"about_ca_topic_score_gemma":0.00081853435,"teacher_disagreement_score":0.0072015566,"about_ca_system_score_codex":0.0010940956,"about_ca_system_score_gemma":0.0005036564,"threshold_uncertainty_score":0.024091601},"labels":[],"label_agreement":null},{"id":"W2739956770","doi":"10.48550/arxiv.1708.00585","title":"Projecting onto the intersection of a cone and a sphere","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Cone (formal languages); Intersection (aeronautics); Projection (relational algebra); Ball (mathematics); Mathematics; Dual cone and polar cone; Projector; Pure mathematics; Mathematical analysis; Geometry; Computer science; Algorithm; Computer vision; Regular polygon; Engineering","score_opus":0.06576583824185062,"score_gpt":0.19725891035671714,"score_spread":0.13149307211486652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739956770","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20777078,0.00013615804,0.7625679,0.0001859956,0.000058925878,0.0000932643,0.00020139749,0.00027465427,0.028711027],"genre_scores_gemma":[0.85396355,0.00030630906,0.13663395,0.00013664502,0.00007288262,0.0001551504,0.0005283992,0.00032402578,0.00787901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984786,0.00042718323,0.000076938646,0.00027744716,0.00054498104,0.00019482255],"domain_scores_gemma":[0.99761426,0.0009496537,0.00025764838,0.00036928957,0.00056133757,0.00024794517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018710403,0.0007808681,0.0005688729,0.001471678,0.001094668,0.0027394278,0.00095740665,0.00069613644,0.0072919833],"category_scores_gemma":[0.005841312,0.00035436556,0.00097042066,0.00092110486,0.0031092567,0.003152545,0.0020539097,0.0020870625,0.0007838178],"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.000045709843,0.000028391036,0.0007315483,0.000050110648,0.00001043303,0.00019929551,0.00019614454,0.013785497,0.0024136144,0.9721415,0.00081552844,0.00958213],"study_design_scores_gemma":[0.000015252189,0.000099006495,0.00069052546,0.000044589055,0.000010744875,0.00038831483,0.0002669993,0.21509883,0.0055709747,0.7742069,0.0035647028,0.000043211752],"about_ca_topic_score_codex":0.0012606496,"about_ca_topic_score_gemma":0.00060291786,"teacher_disagreement_score":0.0072919833,"about_ca_system_score_codex":0.0007869034,"about_ca_system_score_gemma":0.0011186529,"threshold_uncertainty_score":0.024394095},"labels":[],"label_agreement":null},{"id":"W2743824295","doi":"10.1007/s00500-017-2764-7","title":"Parallel ILU preconditioners in GPU computation","year":2017,"lang":"en","type":"article","venue":"Soft Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures; CMG Reservoir Simulation Foundation; University of Calgary; Nvidia","keywords":"Preconditioner; Computer science; Parallel computing; Speedup; Block (permutation group theory); Matrix (chemical analysis); Linear system; Sparse matrix; Computational science; Algorithm; Iterative method; Mathematics; Chemistry; Computational chemistry; Combinatorics","score_opus":0.0196105905296612,"score_gpt":0.2833568347330785,"score_spread":0.2637462442034173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743824295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013823374,0.00071225374,0.96644187,0.0007340639,0.0004717352,0.000037599104,0.00008437296,0.00083523017,0.016859537],"genre_scores_gemma":[0.39585197,0.0008447072,0.57523036,0.00045763204,0.0005615721,0.00026646972,0.00023222461,0.001235643,0.025319446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994947,0.00019323335,0.000018359295,0.00004615059,0.00019138379,0.000056207038],"domain_scores_gemma":[0.9991831,0.0003762552,0.00005342898,0.00017281134,0.0001601205,0.000054205088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000611393,0.00049311237,0.00088540453,0.0005440914,0.0007494939,0.001159909,0.0008144664,0.00083868636,0.0060464586],"category_scores_gemma":[0.0030921646,0.000371894,0.0003984223,0.0009967012,0.0012204243,0.0011908902,0.0015462597,0.002331424,0.0013630886],"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.00031158788,0.000121665864,0.0006783861,0.0002650602,0.00005755678,0.00012623961,0.00023600932,0.39546788,0.007838785,0.43093574,0.018258533,0.14570267],"study_design_scores_gemma":[0.000022012684,0.000013961165,0.00008901477,0.000015744605,0.0000061950636,0.0000136191165,0.000020820393,0.91363883,0.0025883291,0.07732503,0.0062597594,0.000006701099],"about_ca_topic_score_codex":0.0027633077,"about_ca_topic_score_gemma":0.0049183103,"teacher_disagreement_score":0.0060464586,"about_ca_system_score_codex":0.0005326708,"about_ca_system_score_gemma":0.0008253311,"threshold_uncertainty_score":0.020227373},"labels":[],"label_agreement":null},{"id":"W2744633433","doi":"10.1016/j.laa.2017.08.006","title":"Bordering for spectrally arbitrary sign patterns","year":2017,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Sign (mathematics); Mathematics; Construct (python library); Extension (predicate logic); Matrix (chemical analysis); Order (exchange); Variation (astronomy); Pure mathematics; Mathematical analysis; Computer science; Physics","score_opus":0.0172722090267168,"score_gpt":0.2746769646109617,"score_spread":0.2574047555842449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744633433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30256343,0.0003642748,0.6347722,0.00090628007,0.00041980908,0.00007778479,0.00020402829,0.00084105466,0.059851266],"genre_scores_gemma":[0.8923645,0.00030208888,0.085706584,0.00053754414,0.0001804903,0.00009174348,0.00032976683,0.00045347572,0.020033792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993094,0.00018200552,0.000040533072,0.00014195815,0.00017935818,0.00014669896],"domain_scores_gemma":[0.9978027,0.00079939765,0.000225105,0.0006235861,0.00028647302,0.0002628907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010026982,0.00044251196,0.00070835784,0.001173156,0.0013070774,0.0023351915,0.0010057095,0.0009680723,0.011192713],"category_scores_gemma":[0.006681132,0.00032262408,0.0005422336,0.00097115315,0.0026557609,0.0047966624,0.0026044433,0.0018797312,0.0014043695],"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.000105159255,0.00003796848,0.0003012879,0.000024493002,0.0000039744564,0.000076663404,0.000117416035,0.0013948388,0.0025787903,0.97608316,0.0015500662,0.017726235],"study_design_scores_gemma":[0.000013969494,0.000019914769,0.00008190659,0.000010373249,0.0000029372043,0.000080932274,0.000058382517,0.017639177,0.0013920959,0.97904736,0.0016429122,0.0000101083415],"about_ca_topic_score_codex":0.00037935923,"about_ca_topic_score_gemma":0.00047610517,"teacher_disagreement_score":0.011192713,"about_ca_system_score_codex":0.00040853253,"about_ca_system_score_gemma":0.0004698307,"threshold_uncertainty_score":0.03744334},"labels":[],"label_agreement":null},{"id":"W2745677781","doi":"10.1016/j.jmaa.2017.08.026","title":"Continuous approximation of linear impulsive systems and a new form of robust stability","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Mathematics; Impulse (physics); Aperiodic graph; Counterexample; Differential equation; Perturbation (astronomy); Mathematical analysis; Ordinary differential equation; Applied mathematics; Control theory (sociology); Computer science; Discrete mathematics; Classical mechanics","score_opus":0.027815850397820436,"score_gpt":0.2758574781638351,"score_spread":0.24804162776601466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745677781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011936225,0.00033317678,0.9789283,0.00023292119,0.00013256496,0.000017087086,0.00002532287,0.00008373847,0.008310702],"genre_scores_gemma":[0.9035894,0.00074030424,0.08425026,0.00017627858,0.0004245813,0.00007966136,0.00007522611,0.00009982667,0.010564382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995413,0.00016331203,0.000025785657,0.0000833655,0.00015627826,0.00002995822],"domain_scores_gemma":[0.99894744,0.0004921215,0.00019522173,0.000126191,0.0001877164,0.000051385807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010677812,0.0006004325,0.0007211469,0.000692549,0.00033325335,0.001533937,0.001171038,0.0010376356,0.0027939966],"category_scores_gemma":[0.003111967,0.00031715847,0.0008409967,0.00051690306,0.0013135575,0.0014027101,0.001480224,0.001621177,0.00028808878],"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.00010615547,0.00006414684,0.00041929603,0.0001458967,0.00011916545,0.00020979962,0.00021922679,0.35898283,0.009075595,0.5969732,0.0014479854,0.032236796],"study_design_scores_gemma":[0.000004777706,0.000028657902,0.000053664535,0.0000055433725,0.000007748277,0.000039104416,0.000009535698,0.96403474,0.00035068457,0.0346149,0.0008423705,0.000008322771],"about_ca_topic_score_codex":0.0006222545,"about_ca_topic_score_gemma":0.0005036775,"teacher_disagreement_score":0.0027939966,"about_ca_system_score_codex":0.0004040591,"about_ca_system_score_gemma":0.0003441679,"threshold_uncertainty_score":0.009346843},"labels":[],"label_agreement":null},{"id":"W2750597507","doi":"10.1016/j.cam.2017.08.008","title":"Efficient computation of tridiagonal matrices largest eigenvalue","year":2017,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tridiagonal matrix; Mathematics; Computation; Eigenvalues and eigenvectors; Tridiagonal matrix algorithm; Sparse matrix; Matrix (chemical analysis); Applied mathematics; Algorithm; Eigenvalue algorithm; Divide-and-conquer eigenvalue algorithm; Power iteration; Numerical analysis; Numerical linear algebra; Band matrix; Square matrix; Symmetric matrix; Mathematical analysis; Iterative method","score_opus":0.017055154788569678,"score_gpt":0.26791135034311514,"score_spread":0.25085619555454547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750597507","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040866654,0.00032413108,0.9477334,0.00036488488,0.00021767482,0.00009048371,0.0002750639,0.0032180825,0.006909562],"genre_scores_gemma":[0.31951126,0.00025788974,0.6688798,0.00016148257,0.00013789185,0.000214928,0.00085500325,0.0008570572,0.009124676],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994198,0.00015054303,0.000037884234,0.0000813632,0.00022310522,0.000087234046],"domain_scores_gemma":[0.99720424,0.0012585324,0.00013462518,0.00046892918,0.0007793786,0.00015431334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006493404,0.000987638,0.0009843858,0.0012402631,0.0009950148,0.0016676625,0.001181345,0.0009191603,0.011196705],"category_scores_gemma":[0.0067108683,0.00042383024,0.0006062727,0.0013361418,0.00053562096,0.0016769441,0.0015017692,0.0012328135,0.0035834832],"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.0010355575,0.0004721443,0.0026071838,0.0007829668,0.00025021553,0.0007818575,0.00074353075,0.23166157,0.044672124,0.11418368,0.046000015,0.55680907],"study_design_scores_gemma":[0.000077799894,0.00007326761,0.00046155995,0.00002380101,0.000020956699,0.00012957532,0.00012466342,0.93917304,0.011321817,0.044393342,0.0041768653,0.000023326817],"about_ca_topic_score_codex":0.002477747,"about_ca_topic_score_gemma":0.006665328,"teacher_disagreement_score":0.011196705,"about_ca_system_score_codex":0.0005140775,"about_ca_system_score_gemma":0.0018593868,"threshold_uncertainty_score":0.03745669},"labels":[],"label_agreement":null},{"id":"W2750797687","doi":"10.13001/1081-3810.3400","title":"A new kind of companion matrix","year":2017,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","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":"Western University","funders":"","keywords":"Mandelbrot set; Mathematics; Matrix (chemical analysis); Pure mathematics; Companion matrix; Combinatorics; Algebra over a field; Discrete mathematics; Polynomial matrix; Polynomial; Matrix polynomial; Mathematical analysis","score_opus":0.010201391416485068,"score_gpt":0.2765194685385296,"score_spread":0.2663180771220445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750797687","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038166743,0.00035774749,0.9309425,0.0005208706,0.0006808695,0.000101239675,0.00023348152,0.00071760075,0.02827888],"genre_scores_gemma":[0.5344569,0.0007872033,0.424036,0.0011502556,0.0009097141,0.00025545334,0.00070111564,0.0006346329,0.037068736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991062,0.00016070981,0.000043378186,0.00022847245,0.00035732202,0.00010387077],"domain_scores_gemma":[0.99875,0.00023627479,0.000121644836,0.00029652915,0.0003892386,0.00020629412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061371835,0.00061858306,0.0005974407,0.0011070158,0.0009723248,0.0013811686,0.00080036453,0.00088992866,0.008303966],"category_scores_gemma":[0.0031972528,0.00035858652,0.0006412865,0.0010203122,0.0014482733,0.0026884573,0.0018975349,0.0018623157,0.0018755257],"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.00010856293,0.000048140704,0.00047529535,0.00010009396,0.000018272953,0.00031960482,0.0002659768,0.0039470745,0.01831052,0.91714853,0.005145946,0.054112054],"study_design_scores_gemma":[0.000059049493,0.00044878534,0.000754535,0.000048019814,0.00003204122,0.0022455107,0.00015714878,0.10733696,0.023851575,0.7681849,0.09676682,0.00011466404],"about_ca_topic_score_codex":0.0003294927,"about_ca_topic_score_gemma":0.00041526472,"teacher_disagreement_score":0.008303966,"about_ca_system_score_codex":0.00049002527,"about_ca_system_score_gemma":0.0007574452,"threshold_uncertainty_score":0.02777952},"labels":[],"label_agreement":null},{"id":"W2751840201","doi":"10.1007/978-0-387-79428-0_9","title":"Unitary Diagonalization and Quadratic Forms","year":2017,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Unitary state; Polynomial; Eigenvalues and eigenvectors; Simple (philosophy); Vector space; Matrix polynomial; Quadratic equation; Pure mathematics; Basis (linear algebra); Space (punctuation); Combinatorics; Characteristic polynomial; Algebra over a field; Discrete mathematics; Mathematical analysis; Computer science; Physics; Geometry","score_opus":0.016692564977831455,"score_gpt":0.23206654212705596,"score_spread":0.21537397714922452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751840201","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004808247,0.019634226,0.25489077,0.0029770574,0.003597013,0.000056186796,0.00032349152,0.0008516481,0.7128614],"genre_scores_gemma":[0.08021376,0.022248926,0.070481,0.0012469351,0.0035883815,0.00014087223,0.0007436851,0.0014002471,0.81993616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967515,0.00006555603,0.000009994171,0.000047214548,0.0001732087,0.000028901142],"domain_scores_gemma":[0.9998118,0.0000604251,0.000011676364,0.00004494495,0.000057002544,0.000014129654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003091549,0.0009687468,0.00058325235,0.0008938135,0.0007467673,0.001766105,0.0006369842,0.00062195276,0.0372729],"category_scores_gemma":[0.0009436611,0.00038148044,0.00029619253,0.001633491,0.0017919452,0.0024618672,0.0011449946,0.0020650034,0.0154636465],"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.00000805816,0.000019681464,0.000024485336,0.00013011514,0.0000040923746,0.000016912461,0.0001097341,0.0010638161,0.00080503646,0.8052266,0.07038506,0.12220638],"study_design_scores_gemma":[0.0000059835716,0.000013053352,0.000084582694,0.00008084958,0.0000037455768,0.00009264041,0.00006096256,0.0028143195,0.0011008107,0.6762946,0.31943288,0.000015503103],"about_ca_topic_score_codex":0.0007653076,"about_ca_topic_score_gemma":0.0012449258,"teacher_disagreement_score":0.0372729,"about_ca_system_score_codex":0.00074863347,"about_ca_system_score_gemma":0.0006888237,"threshold_uncertainty_score":0.124690294},"labels":[],"label_agreement":null},{"id":"W2752582664","doi":"","title":"Can linear collocation ever beat quadratic","year":2017,"lang":"en","type":"book-chapter","venue":"Nottingham Trent University's Institutional Repository (Nottingham Trent Repository)","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":"Trent University; Nottingham Trent University","keywords":"Collocation (remote sensing); Polygon mesh; Mathematics; Applied mathematics; Quadratic equation; Collocation method; Nonlinear system; Convergence (economics); Algorithm; Mathematical analysis; Computer science; Ordinary differential equation; Geometry; Differential equation","score_opus":0.013800962081638331,"score_gpt":0.21230837626631,"score_spread":0.19850741418467166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752582664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020218238,0.0055908766,0.9211849,0.010221208,0.0018130088,0.000039304927,0.00009984538,0.0011148026,0.03971783],"genre_scores_gemma":[0.45785865,0.006717069,0.49094442,0.0028093269,0.00090319454,0.00009356956,0.00019746469,0.0019701165,0.038506173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885046,0.00040153402,0.00005340274,0.00018788982,0.0004048611,0.000101923106],"domain_scores_gemma":[0.9949857,0.0030833667,0.0002658705,0.0009118392,0.000618896,0.00013421351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002399623,0.0004984337,0.0008039599,0.0004269502,0.0005139864,0.002187142,0.0010023745,0.002336407,0.006622196],"category_scores_gemma":[0.018439787,0.00044874405,0.00039206888,0.000730917,0.002373412,0.004738867,0.0018098681,0.0017072936,0.0046989387],"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.00035497785,0.0000498148,0.001533976,0.0007256183,0.00008387858,0.00015891314,0.0010667958,0.095486924,0.010376952,0.4287909,0.036690377,0.42468083],"study_design_scores_gemma":[0.000065587454,0.00018992265,0.0009940952,0.0004526868,0.00004468783,0.00024129367,0.00043134112,0.43325952,0.007774195,0.4197144,0.13674518,0.00008699895],"about_ca_topic_score_codex":0.0030861173,"about_ca_topic_score_gemma":0.003085437,"teacher_disagreement_score":0.006622196,"about_ca_system_score_codex":0.00068995863,"about_ca_system_score_gemma":0.00071068126,"threshold_uncertainty_score":0.022153437},"labels":[],"label_agreement":null},{"id":"W2760683564","doi":"","title":"Recursive Formulae for the Chromatic Polynomials of Complete r-uniform Mixed Interval Hypergraphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Interval (graph theory); Combinatorics; Discrete mathematics","score_opus":0.02427013532681572,"score_gpt":0.2654784851176603,"score_spread":0.2412083497908446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760683564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1388163,0.0012438714,0.74018747,0.0012361022,0.00024481863,0.00015466189,0.0016067951,0.0009667208,0.11554334],"genre_scores_gemma":[0.83190763,0.0007498543,0.13637416,0.00045054653,0.00034703265,0.0002241575,0.0009119076,0.00043936656,0.02859539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992945,0.00016109509,0.00003445094,0.00015876626,0.00022624148,0.00012489475],"domain_scores_gemma":[0.9970095,0.0018730089,0.000263412,0.00026691586,0.00043446277,0.00015274016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010109859,0.0005194905,0.00047239423,0.0019843604,0.0010349941,0.0036031373,0.0018325112,0.00090533134,0.013723611],"category_scores_gemma":[0.007097773,0.0004507762,0.0007805839,0.0021101125,0.0017487853,0.0046668723,0.0012804894,0.0027788973,0.002124954],"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.000025347326,0.000020553569,0.0002322044,0.000050737817,0.000007420987,0.00003502995,0.00018642763,0.0013553026,0.0011664374,0.9827618,0.002304166,0.011854696],"study_design_scores_gemma":[0.00001905359,0.00001446495,0.00046248172,0.000032763604,0.000019000023,0.000110718356,0.0000956733,0.021726603,0.0012778416,0.971038,0.005176572,0.000026914184],"about_ca_topic_score_codex":0.002267265,"about_ca_topic_score_gemma":0.0038842387,"teacher_disagreement_score":0.013723611,"about_ca_system_score_codex":0.002423972,"about_ca_system_score_gemma":0.0006863706,"threshold_uncertainty_score":0.04591006},"labels":[],"label_agreement":null},{"id":"W2764219424","doi":"10.4153/cmb-2017-063-0","title":"Hilbert Transformation and Representation of the <i>ax</i> + <i>b</i> Group","year":2017,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Unit circle; Operator (biology); Hilbert space; Group (periodic table); Pure mathematics; Commutative property; Linear map; Unit (ring theory); Lambda; Transformation (genetics); Semigroup; Combinatorics; Algebra over a field; Discrete mathematics","score_opus":0.011890287012855787,"score_gpt":0.22586006508686243,"score_spread":0.21396977807400663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2764219424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6057845,0.0004845688,0.34329632,0.001760455,0.00033344128,0.00009729524,0.00012059139,0.0002939971,0.04782895],"genre_scores_gemma":[0.9665463,0.00012607027,0.020528017,0.0002470696,0.00015581831,0.000054680888,0.000056134133,0.000054597826,0.012231305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922633,0.00027468932,0.000028780345,0.000119197975,0.00020256136,0.00014837978],"domain_scores_gemma":[0.99917054,0.00023696745,0.00017757506,0.00010571333,0.00013515062,0.00017407502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093959994,0.0003551707,0.00041483698,0.0007058494,0.00070673996,0.0011029688,0.00061221723,0.0006203904,0.0068499614],"category_scores_gemma":[0.0014025631,0.00013561515,0.0005273306,0.00036433124,0.0022575755,0.0015733562,0.0014051963,0.0008880156,0.00070810545],"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.000054151096,0.000028759538,0.00020808024,0.000021955104,0.0000062007225,0.0001766894,0.00033906868,0.0018246868,0.005444395,0.9849717,0.0007408261,0.006183403],"study_design_scores_gemma":[0.000060152557,0.00024742595,0.0005328614,0.000015723039,0.000007788985,0.00034256297,0.00029745785,0.046824027,0.0060532168,0.93764037,0.007933845,0.00004446671],"about_ca_topic_score_codex":0.00061343855,"about_ca_topic_score_gemma":0.0002205252,"teacher_disagreement_score":0.0068499614,"about_ca_system_score_codex":0.00053183245,"about_ca_system_score_gemma":0.0005204944,"threshold_uncertainty_score":0.022915423},"labels":[],"label_agreement":null},{"id":"W2765474069","doi":"10.11650/tjm/171003","title":"Extensions to Chen's Minimizing Equal Mass Parallelogram Solutions","year":2017,"lang":"en","type":"article","venue":"Taiwanese Journal of Mathematics","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":"Queen's University","funders":"","keywords":"Parallelogram; Mathematics; Chen; Extension (predicate logic); Applied mathematics; Mathematical analysis; Calculus (dental); Computer science","score_opus":0.051812521058300316,"score_gpt":0.3034499854511139,"score_spread":0.2516374643928136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765474069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26650402,0.0009677843,0.6722123,0.0015476885,0.00030018596,0.000092487375,0.00016023405,0.00016884318,0.058046393],"genre_scores_gemma":[0.79619235,0.0008408548,0.1666493,0.00068901567,0.00032081633,0.00016847835,0.0002598839,0.0002230418,0.034656264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982446,0.00005467436,0.000009426808,0.000037791942,0.000043763728,0.000029993955],"domain_scores_gemma":[0.9996092,0.00012330251,0.00006649617,0.000034353205,0.00010607205,0.000060662027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005103231,0.00064803625,0.00052673335,0.0006819106,0.0005039861,0.00056408136,0.000832357,0.00080963207,0.004296668],"category_scores_gemma":[0.003218128,0.00019829498,0.0006842323,0.00045701,0.00078397646,0.0011335657,0.001409006,0.00145395,0.00033690655],"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.00012440528,0.00007528146,0.0010846518,0.00015419215,0.000048537226,0.000412147,0.00029968852,0.09234136,0.010794107,0.85644925,0.0037977092,0.034418657],"study_design_scores_gemma":[0.00004276309,0.00012398882,0.00077035,0.00004085233,0.000024475508,0.00030991607,0.00015296463,0.54754126,0.0039688726,0.43918177,0.007799322,0.00004345147],"about_ca_topic_score_codex":0.0008101595,"about_ca_topic_score_gemma":0.0008029179,"teacher_disagreement_score":0.004296668,"about_ca_system_score_codex":0.00040524258,"about_ca_system_score_gemma":0.00044576754,"threshold_uncertainty_score":0.014373779},"labels":[],"label_agreement":null},{"id":"W2765671816","doi":"10.1137/140986566","title":"On the Symmetric Componentwise Relative Backward Error for Linear Systems of Equations","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fondation Sciences et Technologies pour l’Aéronautique et l’Espace","keywords":"Mathematics; Upper and lower bounds; Order (exchange); Applied mathematics; Mathematical analysis","score_opus":0.034737947332930105,"score_gpt":0.32145655974525583,"score_spread":0.2867186124123257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765671816","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005275692,0.0004969978,0.9891627,0.00041470554,0.00023730923,0.00004682362,0.000057419416,0.00019636682,0.004111994],"genre_scores_gemma":[0.45350578,0.002250807,0.52892894,0.0008394929,0.0004284812,0.00050241046,0.00050850946,0.0008760055,0.012159499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964855,0.0012070766,0.00024935318,0.00035908297,0.0014575386,0.00024150444],"domain_scores_gemma":[0.98177576,0.013234072,0.0008267111,0.00138374,0.002446996,0.00033274322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008389208,0.0023589975,0.0012575585,0.0015934183,0.0009247098,0.0018412706,0.0014622415,0.0017953209,0.008262251],"category_scores_gemma":[0.03452754,0.00060930464,0.00096342753,0.00086075265,0.0029957858,0.003706152,0.004859158,0.004148209,0.0025432936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004276378,0.000091960035,0.0009496594,0.0008082176,0.000091743495,0.00030254718,0.00038709276,0.48589584,0.015034488,0.40035796,0.0054296134,0.09022308],"study_design_scores_gemma":[0.000016607484,0.00007805824,0.00017139378,0.0000779199,0.000016896049,0.00008644347,0.00003720661,0.8879693,0.005622118,0.103586935,0.0023031873,0.000033926994],"about_ca_topic_score_codex":0.0020587838,"about_ca_topic_score_gemma":0.0019683843,"teacher_disagreement_score":0.008389208,"about_ca_system_score_codex":0.001331038,"about_ca_system_score_gemma":0.002037845,"threshold_uncertainty_score":0.044366896},"labels":[],"label_agreement":null},{"id":"W2766081437","doi":"10.5539/jmr.v9n6p55","title":"Various Proofs of the Sylvester Criterion for Quadratic Forms","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical proof; Mathematics; Algebraic number; Quadratic equation; Sylvester matrix; Homogeneous; Subject (documents); Mathematics Subject Classification; Algebra over a field; Calculus (dental); Pure mathematics; Combinatorics; Mathematical analysis; Computer science; Polynomial","score_opus":0.11477044793081888,"score_gpt":0.4164771028569123,"score_spread":0.30170665492609344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766081437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018436842,0.003842657,0.8689057,0.002090454,0.0009040239,0.0001663744,0.00051316427,0.00062972546,0.10451111],"genre_scores_gemma":[0.56408465,0.010537722,0.37053546,0.0028779274,0.0034165885,0.00053727854,0.0013581777,0.0011873768,0.045464795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850047,0.00034219289,0.00012400799,0.00020053414,0.00067130785,0.000161484],"domain_scores_gemma":[0.9961409,0.0018989337,0.00032368075,0.00034196474,0.0011260685,0.00016844129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027250086,0.0011327929,0.0006165598,0.0024625184,0.0011328554,0.001570182,0.0013038403,0.0007957682,0.01723482],"category_scores_gemma":[0.007840239,0.00035463675,0.0011160477,0.0019523983,0.0025251445,0.003715939,0.0023130223,0.0033546297,0.0028868031],"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.000021068037,0.000030387024,0.00016584639,0.0002945269,0.000020087624,0.000115878414,0.00018504976,0.0017894354,0.0028444985,0.96480125,0.0057399874,0.02399199],"study_design_scores_gemma":[0.000020367097,0.0000709508,0.00037603916,0.00008414872,0.000024956338,0.00035155416,0.00010340347,0.009096408,0.0078191655,0.9553761,0.026628753,0.000048109738],"about_ca_topic_score_codex":0.00036820682,"about_ca_topic_score_gemma":0.0005349699,"teacher_disagreement_score":0.01723482,"about_ca_system_score_codex":0.001183906,"about_ca_system_score_gemma":0.0008994155,"threshold_uncertainty_score":0.05765623},"labels":[],"label_agreement":null},{"id":"W2767229402","doi":"10.1016/j.laa.2018.02.024","title":"The quasi principal rank characteristic sequence","year":2018,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rank (graph theory); Mathematics; Sequence (biology); Minor (academic); Principal (computer security); Combinatorics; Principal component analysis; Matrix (chemical analysis); Statistics; Law; Computer science; Chemistry","score_opus":0.01857822961522077,"score_gpt":0.2749067109796261,"score_spread":0.25632848136440534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767229402","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3175286,0.003261434,0.52994776,0.007469039,0.001197808,0.000071288654,0.0007765942,0.0007881146,0.1389593],"genre_scores_gemma":[0.9252394,0.0016751369,0.029385837,0.000672187,0.0010929991,0.00007384435,0.00038871416,0.00018750438,0.041284364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934465,0.00018083231,0.00002440298,0.00014911192,0.00018869207,0.000112249],"domain_scores_gemma":[0.9977222,0.0010131637,0.0003118513,0.00020016926,0.00042444127,0.00032807273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008818758,0.0005127117,0.0005397126,0.0020461406,0.0010278837,0.0029447258,0.0007175024,0.00077135494,0.008933994],"category_scores_gemma":[0.0051722536,0.0003523815,0.00030377574,0.0016519765,0.002986365,0.0058686147,0.00142442,0.0021697814,0.0017524142],"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.00004151368,0.000009577374,0.00023746393,0.000027526614,0.0000032396424,0.000032844844,0.000092985385,0.0009133271,0.00070213294,0.9864057,0.0018015556,0.0097321775],"study_design_scores_gemma":[0.000007972478,0.000017247721,0.00018909552,0.000008292881,0.0000025409038,0.00011222456,0.000034296743,0.0055181603,0.0004140934,0.9901877,0.003497467,0.000010883854],"about_ca_topic_score_codex":0.00068004057,"about_ca_topic_score_gemma":0.00042452753,"teacher_disagreement_score":0.008933994,"about_ca_system_score_codex":0.0010271363,"about_ca_system_score_gemma":0.0010776309,"threshold_uncertainty_score":0.0298872},"labels":[],"label_agreement":null},{"id":"W2767896358","doi":"10.1016/j.laa.2017.10.017","title":"Corrigendum to “Companion matrix patterns” [Linear Algebra Appl. 463 (2014) 255–272]","year":2017,"lang":"en","type":"erratum","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University","funders":"","keywords":"Mathematics; Linear algebra; Algebra over a field; Pure mathematics; Matrix (chemical analysis); Geometry","score_opus":0.019015803636281456,"score_gpt":0.2812313560670193,"score_spread":0.26221555243073785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767896358","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018532491,0.0031842655,0.002035428,0.048500523,0.929632,0.000060690956,0.0013288584,0.000598231,0.014474569],"genre_scores_gemma":[0.011515153,0.014345504,0.007686109,0.08331853,0.31577268,0.00038823337,0.005286824,0.0019474685,0.55973953],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9943552,0.00086166966,0.0007139944,0.0010767204,0.0024928602,0.0004996797],"domain_scores_gemma":[0.98419017,0.0027029656,0.00080091343,0.001435296,0.010065076,0.00080568646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029498783,0.0025504467,0.0026575816,0.005162094,0.0040757856,0.004347343,0.004980152,0.005600548,0.13986583],"category_scores_gemma":[0.033145025,0.0012605505,0.0030369817,0.0039099082,0.0026377712,0.0050577736,0.0032103811,0.0063714534,0.08055578],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026061647,0.00000777063,0.000031643136,0.000103887214,0.000011703943,0.000073731375,0.00001317282,0.00004385901,0.000048477363,0.0017681884,0.992968,0.0049034865],"study_design_scores_gemma":[0.0000338134,0.000040075865,0.000729387,0.00022896634,0.000037716145,0.00025530305,0.000049542716,0.0003802631,0.00044105132,0.0075259157,0.99022394,0.000053963875],"about_ca_topic_score_codex":0.016585724,"about_ca_topic_score_gemma":0.023934577,"teacher_disagreement_score":0.13986583,"about_ca_system_score_codex":0.005280665,"about_ca_system_score_gemma":0.003776154,"threshold_uncertainty_score":0.46789783},"labels":[],"label_agreement":null},{"id":"W2771141647","doi":"10.1016/j.jsc.2019.07.012","title":"Computing lower rank approximations of matrix polynomials","year":2019,"lang":"en","type":"preprint","venue":"Journal of Symbolic Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Rank (graph theory); Matrix (chemical analysis); Matrix polynomial; Robustness (evolution); Quadratic growth; Polynomial matrix; Singular value; Dimension (graph theory); Polynomial; Combinatorics; Applied mathematics; Discrete mathematics; Algorithm; Mathematical analysis; Eigenvalues and eigenvectors","score_opus":0.01577575626765196,"score_gpt":0.29284427614761577,"score_spread":0.2770685198799638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771141647","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16267742,0.0005754854,0.81758636,0.00088444736,0.00035712947,0.00007421135,0.00050771737,0.001922377,0.015414815],"genre_scores_gemma":[0.65720886,0.00040454697,0.32488802,0.0002676538,0.00028127775,0.000083078085,0.0009862686,0.0005495772,0.01533077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867046,0.00037527486,0.00005499849,0.00014083051,0.000585941,0.00017250505],"domain_scores_gemma":[0.9946983,0.0032926998,0.00029160397,0.0008462702,0.00066686457,0.00020425125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012548172,0.0009799084,0.001152661,0.0015552294,0.0005934165,0.0029745318,0.0010309343,0.00097093993,0.010447866],"category_scores_gemma":[0.014947689,0.00047113711,0.0004879736,0.001681687,0.0011436958,0.0027489369,0.0015504498,0.0021771186,0.0025618102],"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.0014603983,0.0004583932,0.0023400413,0.00057245244,0.00013422019,0.00035277355,0.00059880695,0.336061,0.016566735,0.30391476,0.019022932,0.31851754],"study_design_scores_gemma":[0.000045607263,0.00009065141,0.00019923663,0.000028097202,0.000014731031,0.00006673515,0.00010575537,0.8814361,0.005126139,0.10984406,0.0030276487,0.000015252921],"about_ca_topic_score_codex":0.0022964366,"about_ca_topic_score_gemma":0.004868071,"teacher_disagreement_score":0.010447866,"about_ca_system_score_codex":0.0008303014,"about_ca_system_score_gemma":0.0010004101,"threshold_uncertainty_score":0.034951568},"labels":[],"label_agreement":null},{"id":"W2774352756","doi":"10.1016/j.laa.2017.11.034","title":"A unified approach to operator monotone functions","year":2017,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monotone polygon; Operator (biology); Pseudo-monotone operator; Algebra over a field; Pure mathematics; Finite-rank operator; Banach space; Operator space","score_opus":0.020227866654039018,"score_gpt":0.2639810175465126,"score_spread":0.24375315089247357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774352756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031737913,0.001002228,0.9806678,0.0007940981,0.00034001571,0.000023016588,0.000059192014,0.00007954635,0.01386039],"genre_scores_gemma":[0.23423582,0.0054142606,0.7040125,0.0020959692,0.0042816093,0.00044918703,0.00033698394,0.00041824064,0.04875546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998451,0.0005396652,0.00009703238,0.0002321884,0.0005537533,0.00012643526],"domain_scores_gemma":[0.9988834,0.00040850136,0.0000777446,0.00019394925,0.000324767,0.00011166347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019303361,0.0013863386,0.0016898899,0.0032441942,0.0014658706,0.003532675,0.0026288468,0.0019099177,0.0073803747],"category_scores_gemma":[0.003616008,0.0007056893,0.002142145,0.0032298507,0.003184602,0.008634548,0.0038930615,0.0040794355,0.0019201392],"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.0000034936468,0.000011471449,0.000019170287,0.000020453659,0.0000052762653,0.000016663505,0.000054248492,0.00112673,0.00027253167,0.99305797,0.000897227,0.004514642],"study_design_scores_gemma":[0.0000045506226,0.000014904134,0.000025234445,0.000011418105,0.000006902195,0.000038859947,0.000026130445,0.022916762,0.00014551991,0.9701578,0.006642554,0.000009358372],"about_ca_topic_score_codex":0.0008737697,"about_ca_topic_score_gemma":0.0011307084,"teacher_disagreement_score":0.0073803747,"about_ca_system_score_codex":0.0013689995,"about_ca_system_score_gemma":0.0011821848,"threshold_uncertainty_score":0.024689794},"labels":[],"label_agreement":null},{"id":"W2774833929","doi":"10.1090/mcom/3347","title":"A fast and stable test to check if a weakly diagonally dominant matrix is a nonsingular M-matrix","year":2017,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":22,"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":"University of Waterloo","keywords":"Mathematics; Diagonally dominant matrix; Invertible matrix; Matrix (chemical analysis); Combinatorics; Involutory matrix; Matrix splitting; Pure mathematics; Diagonal matrix; Square matrix; Symmetric matrix; Diagonal; Geometry; Physics","score_opus":0.012328509168133423,"score_gpt":0.28892491946286514,"score_spread":0.2765964102947317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774833929","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19556193,0.0003303356,0.78530884,0.0014595042,0.00035355476,0.00040407458,0.0018859159,0.004648795,0.010047068],"genre_scores_gemma":[0.7725552,0.000105639476,0.21874489,0.00072804803,0.00028018287,0.0003088576,0.00267994,0.00048647338,0.0041107894],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996292,0.0006125324,0.0002709956,0.00087880064,0.0014510081,0.0004946666],"domain_scores_gemma":[0.9734613,0.0145161515,0.001995974,0.0032431085,0.0054418445,0.0013415947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019590904,0.0012365244,0.0011194092,0.0018267445,0.0012278038,0.0015830782,0.001658485,0.0013908758,0.008478738],"category_scores_gemma":[0.023040162,0.00053057424,0.0012433408,0.0009810723,0.0020436018,0.003790485,0.0030467962,0.0018084111,0.0036492157],"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.0058447802,0.0010377812,0.08195599,0.0009198379,0.00048674346,0.0025025678,0.00085041416,0.04983835,0.19336969,0.17067908,0.040628634,0.45188624],"study_design_scores_gemma":[0.00045566095,0.0022752509,0.0077531347,0.00010808425,0.00011927198,0.001709418,0.0005516312,0.61548334,0.121628575,0.23834485,0.011301521,0.00026930726],"about_ca_topic_score_codex":0.0013900753,"about_ca_topic_score_gemma":0.0020445483,"teacher_disagreement_score":0.008478738,"about_ca_system_score_codex":0.000694157,"about_ca_system_score_gemma":0.0024684386,"threshold_uncertainty_score":0.028364182},"labels":[],"label_agreement":null},{"id":"W2775086291","doi":"","title":"Explicit pseudo-transient continuation","year":2013,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":13,"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":"Continuation; Transient (computer programming); Computer science; Programming language","score_opus":0.009260044676851134,"score_gpt":0.2152406917800093,"score_spread":0.20598064710315817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775086291","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010827675,0.00007871038,0.9823406,0.0001378047,0.000093821254,0.00003788004,0.000022548042,0.00031765422,0.0061432384],"genre_scores_gemma":[0.5892623,0.00022769727,0.39483592,0.00023631155,0.00008920874,0.0002571137,0.00009872483,0.00035222192,0.014640529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996105,0.00012998219,0.000022644783,0.000052297393,0.00014157472,0.00004306813],"domain_scores_gemma":[0.9989586,0.00041011896,0.00008399127,0.0002503767,0.00023212416,0.00006488386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083935715,0.0005262814,0.0005431098,0.0005508037,0.0004951375,0.0010945988,0.0010400976,0.0009994236,0.0063725044],"category_scores_gemma":[0.004402154,0.00031149422,0.00046754794,0.00045429252,0.0012724173,0.0014659697,0.0021640584,0.0011420436,0.0010012038],"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.00035373878,0.0001245255,0.0010793874,0.00025042318,0.000043272896,0.0003085722,0.00030652777,0.35666457,0.01662552,0.47173232,0.0044076,0.14810354],"study_design_scores_gemma":[0.00002135458,0.000037407866,0.000080073696,0.000023446824,0.000005571669,0.000047743928,0.000013669631,0.9701883,0.0030287863,0.023313291,0.003230197,0.000010112262],"about_ca_topic_score_codex":0.0006934009,"about_ca_topic_score_gemma":0.00072451984,"teacher_disagreement_score":0.0063725044,"about_ca_system_score_codex":0.0005494056,"about_ca_system_score_gemma":0.0009463608,"threshold_uncertainty_score":0.021318197},"labels":[],"label_agreement":null},{"id":"W2775700832","doi":"10.1515/spma-2017-0022","title":"A counterexample to the Drury permanent conjecture","year":2017,"lang":"en","type":"article","venue":"Special Matrices","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"University of Guelph","funders":"","keywords":"Counterexample; Conjecture; Mathematics; Positive-definite matrix; Matrix (chemical analysis); Combinatorics; Semidefinite programming; Pure mathematics; Discrete mathematics; Mathematical optimization","score_opus":0.01422740743193453,"score_gpt":0.2618586584246281,"score_spread":0.24763125099269354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775700832","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78522015,0.00083554717,0.090955414,0.024781778,0.0012668343,0.000054289492,0.00075352687,0.0010870488,0.09504551],"genre_scores_gemma":[0.99096346,0.0001369739,0.004434407,0.00074863713,0.00032485742,0.000032669024,0.0002021085,0.00005122384,0.003105559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997764,0.0005990164,0.000094158146,0.0005196687,0.0006004726,0.00042269196],"domain_scores_gemma":[0.98871595,0.0075691557,0.0009845437,0.001381717,0.00065863424,0.0006900252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002047021,0.00044429905,0.0010109787,0.0013983054,0.0021230683,0.003059602,0.0013728733,0.002658861,0.010778643],"category_scores_gemma":[0.012289593,0.00042139008,0.0005616658,0.0012334138,0.0051318225,0.0038622553,0.0034139275,0.0030164274,0.0008708328],"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.00032631448,0.00006743436,0.0012432452,0.00007724114,0.00001982525,0.0006374196,0.00035413672,0.0044965157,0.0015677682,0.973696,0.011555252,0.0059587224],"study_design_scores_gemma":[0.00013230139,0.000080020014,0.0006905252,0.00003806339,0.000016605067,0.0007403437,0.00030905163,0.032570407,0.002458616,0.9532831,0.009639976,0.000041053358],"about_ca_topic_score_codex":0.00041092903,"about_ca_topic_score_gemma":0.00037759996,"teacher_disagreement_score":0.010778643,"about_ca_system_score_codex":0.00087083736,"about_ca_system_score_gemma":0.00049612555,"threshold_uncertainty_score":0.036058128},"labels":[],"label_agreement":null},{"id":"W2782251509","doi":"","title":"Robust domain decomposition methods for non-symmetric problems","year":2016,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Safran Electronics (Canada)","funders":"","keywords":"Computer science; Domain decomposition methods; Decomposition; Physics; Finite element method; Chemistry","score_opus":0.022684768624852664,"score_gpt":0.28389894348001166,"score_spread":0.26121417485515896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782251509","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017025814,0.00049891166,0.99662906,0.00014931495,0.00009211448,0.000010910563,0.000028103648,0.00006542662,0.0008235109],"genre_scores_gemma":[0.16898264,0.0027247749,0.8138529,0.00030017435,0.0005610367,0.00027425154,0.00047427515,0.0004755628,0.012354374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992787,0.0002918041,0.00002905516,0.00011797577,0.00023066177,0.000051812527],"domain_scores_gemma":[0.9981483,0.0012547529,0.0001190075,0.00015783773,0.0002399018,0.00008025105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016803328,0.001378786,0.0013018202,0.00066613324,0.0002870568,0.0011371104,0.0008406614,0.0012427481,0.0032136755],"category_scores_gemma":[0.005304476,0.0005712166,0.0010688539,0.0006802885,0.0011494232,0.0012171001,0.0019436226,0.002806358,0.001012712],"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.00022374741,0.0000942697,0.00035111676,0.00062787876,0.00018565274,0.00015237278,0.000113826834,0.64613473,0.017103244,0.14365005,0.013512758,0.17785038],"study_design_scores_gemma":[0.000011486263,0.000025129779,0.00006503887,0.000019182635,0.000009239407,0.00002802804,0.000010733754,0.9683024,0.0013403879,0.027239485,0.0029399607,0.000008880265],"about_ca_topic_score_codex":0.0010996509,"about_ca_topic_score_gemma":0.0010247485,"teacher_disagreement_score":0.0032136755,"about_ca_system_score_codex":0.00042040268,"about_ca_system_score_gemma":0.000662934,"threshold_uncertainty_score":0.01075083},"labels":[],"label_agreement":null},{"id":"W2782871778","doi":"10.22215/etd/2017-11853","title":"Cooperative Linear-Quadratic Mean Field Control and Hamiltonian Matrix Analysis","year":2017,"lang":"en","type":"dissertation","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Carleton University","funders":"","keywords":"Mathematics; Algebraic Riccati equation; Linear-quadratic-Gaussian control; Riccati equation; Linear-quadratic regulator; Eigenvalues and eigenvectors; Applied mathematics; Uniqueness; Algebraic number; Optimal control; Mathematical optimization; Mathematical analysis; Differential equation","score_opus":0.007664408170985754,"score_gpt":0.28669466243723835,"score_spread":0.2790302542662526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782871778","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025087906,0.00057221914,0.9625308,0.00063310226,0.0000841514,0.000035029712,0.000029937706,0.00003945959,0.010987299],"genre_scores_gemma":[0.9202049,0.00085371814,0.066083305,0.00021561827,0.00021245933,0.00017610793,0.00005007419,0.000044270673,0.012159574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994823,0.00020489117,0.000014269666,0.00011075123,0.00013266467,0.000055091674],"domain_scores_gemma":[0.99900335,0.00055203616,0.00017087482,0.00005877543,0.00015313382,0.00006184511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013276783,0.00071306684,0.00074706343,0.0005081965,0.00041086538,0.0008953754,0.000949195,0.00081786624,0.002107947],"category_scores_gemma":[0.0029666203,0.00024624015,0.00057991006,0.00038617477,0.002308972,0.0011161047,0.0015426272,0.0010906018,0.00018815661],"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.00002359478,0.0000349732,0.00028823107,0.00010932695,0.00004418944,0.000059862137,0.00014631823,0.22947605,0.0021998426,0.75719774,0.00072695955,0.009693007],"study_design_scores_gemma":[0.000012181116,0.000059975166,0.000147764,0.0000130609305,0.0000106044245,0.000025101306,0.000037363512,0.7915109,0.00043987727,0.20650461,0.0012250148,0.000013538776],"about_ca_topic_score_codex":0.0021720312,"about_ca_topic_score_gemma":0.0011390764,"teacher_disagreement_score":0.0021720312,"about_ca_system_score_codex":0.0009469697,"about_ca_system_score_gemma":0.0008267747,"threshold_uncertainty_score":0.007051766},"labels":[],"label_agreement":null},{"id":"W2783349907","doi":"10.1007/978-3-319-69164-0_18","title":"Immanants of unitary matrices and their submatrices","year":2017,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Block matrix; Unitary state; Connection (principal bundle); Representation (politics); Unitary matrix; Matrix (chemical analysis); Block (permutation group theory); Algebra over a field; Pure mathematics; Mathematics; Unitary representation; Matrix representation; Group (periodic table); Combinatorics; Physics; Geometry; Quantum mechanics; Chemistry; Law; Lie group; Political science","score_opus":0.01679448028112242,"score_gpt":0.22476240650470497,"score_spread":0.20796792622358254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783349907","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010747426,0.015277563,0.41788,0.001332757,0.00456572,0.00006342194,0.0004246445,0.00069325906,0.5490152],"genre_scores_gemma":[0.14578009,0.020997684,0.23103419,0.0016547319,0.005880291,0.00025787187,0.0011774705,0.0016820426,0.59153557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996532,0.00006704482,0.000018652721,0.00007345688,0.0001601025,0.00002742774],"domain_scores_gemma":[0.9996898,0.00012969755,0.00002294082,0.00006444468,0.00007261482,0.00002048492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031615133,0.001048777,0.0004356439,0.0009973575,0.0006071525,0.0021515428,0.0007482611,0.0005913997,0.016512016],"category_scores_gemma":[0.001292266,0.00043582267,0.00041308804,0.0012176035,0.00165355,0.002880629,0.0010954599,0.002613208,0.008793402],"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.000012374445,0.000011846284,0.000035800702,0.000099090714,0.000004014353,0.000042591,0.0001689947,0.00045899377,0.0016749538,0.9011015,0.019173319,0.0772166],"study_design_scores_gemma":[0.0000038446983,0.000018371406,0.0001015316,0.000063997264,0.0000044216176,0.00024411814,0.00006780526,0.0023308536,0.001459084,0.81765914,0.17803241,0.000014522587],"about_ca_topic_score_codex":0.00025971874,"about_ca_topic_score_gemma":0.00042967804,"teacher_disagreement_score":0.016512016,"about_ca_system_score_codex":0.000351514,"about_ca_system_score_gemma":0.0003536415,"threshold_uncertainty_score":0.055238187},"labels":[],"label_agreement":null},{"id":"W2787435769","doi":"10.1007/jhep04(2018)138","title":"Supereigenvalue models and topological recursion","year":2018,"lang":"en","type":"article","venue":"Journal of High Energy Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Simple (philosophy); Recursion (computer science); Conjunction (astronomy); Topological quantum number; Topology (electrical circuits); Topological entropy in physics; Correlation function (quantum field theory); Limit (mathematics)","score_opus":0.0213181940873123,"score_gpt":0.24316960367146334,"score_spread":0.22185140958415103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787435769","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5883193,0.0010516237,0.3403929,0.0010143411,0.0002759447,0.000056753463,0.00015265546,0.00052899466,0.06820748],"genre_scores_gemma":[0.9725677,0.0002467374,0.020239064,0.00014822616,0.00006599638,0.00005081066,0.0000796815,0.00011283078,0.006489029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995788,0.000121843004,0.000016727463,0.000031777858,0.00016122528,0.00008975174],"domain_scores_gemma":[0.99945825,0.00019545536,0.000059355465,0.000098737975,0.00010082397,0.00008742671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008224545,0.00037244076,0.0006963452,0.001650707,0.001099177,0.0016247365,0.0017772,0.001117864,0.0044628493],"category_scores_gemma":[0.0026019316,0.000290126,0.0006427814,0.0010685292,0.0016763894,0.003383722,0.0015619961,0.0012851047,0.0004749448],"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.0000056699537,0.000012326569,0.00014245545,0.000011921292,0.0000032063022,0.000043625903,0.00003208531,0.0068708337,0.00048513236,0.9907962,0.00026106936,0.0013354876],"study_design_scores_gemma":[0.0000049723762,0.000007923119,0.00009938136,0.0000069008015,0.0000021606588,0.000047252506,0.000026165288,0.1886257,0.0003835728,0.81022644,0.00056065415,0.000008862985],"about_ca_topic_score_codex":0.0013415323,"about_ca_topic_score_gemma":0.001971798,"teacher_disagreement_score":0.0044628493,"about_ca_system_score_codex":0.00080384,"about_ca_system_score_gemma":0.0007498554,"threshold_uncertainty_score":0.014929652},"labels":[],"label_agreement":null},{"id":"W2789849740","doi":"10.3934/naco.2018007","title":"&lt;inline-formula&gt;&lt;tex-math id=\"M1\"&gt;\\begin{document} $\\mathcal{L}_{∞}$ \\end{document}&lt;/tex-math&gt;&lt;/inline-formula&gt;-norm computation for large-scale descriptor systems using structured iterative eigensolvers","year":2018,"lang":"en","type":"article","venue":"Numerical Algebra Control and Optimization","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":"","keywords":"Computation; Eigenvalues and eigenvectors; Norm (philosophy); Pencil (optics); Matrix norm; Mathematics; Iterative method; Iterative refinement; Matrix pencil; Upper and lower bounds; Algorithm; Applied mathematics; Discrete mathematics; Combinatorics; Computer science; Mathematical analysis; Physics","score_opus":0.00909950472901929,"score_gpt":0.24067775353300944,"score_spread":0.23157824880399014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789849740","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00955754,0.00044195424,0.7302815,0.0017994121,0.0013484437,0.0004482154,0.015140619,0.055999238,0.18498313],"genre_scores_gemma":[0.12498245,0.0009463995,0.5848312,0.0013659688,0.0003403583,0.0011259463,0.020904386,0.11156745,0.15393585],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939644,0.00008404916,0.000029494577,0.00008014262,0.00033553407,0.000074265496],"domain_scores_gemma":[0.99878126,0.00045532794,0.00008512237,0.00025888873,0.000339136,0.0000803017],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006812032,0.0017299041,0.0010960794,0.0011108732,0.0007939587,0.002848276,0.002268168,0.0016760023,0.43656605],"category_scores_gemma":[0.0033329576,0.00065889274,0.0009402152,0.0013840352,0.0011332835,0.0024892478,0.0021413248,0.002332358,0.1923487],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023850567,0.00022347725,0.0012883907,0.0016184333,0.00009227523,0.00079712726,0.0005206741,0.03833722,0.023720507,0.11712346,0.5782897,0.23775026],"study_design_scores_gemma":[0.00024788952,0.000084710315,0.0007013388,0.00025628673,0.000022652224,0.0004507288,0.00036242144,0.32490844,0.043225728,0.06607658,0.56357664,0.00008674],"about_ca_topic_score_codex":0.0027162356,"about_ca_topic_score_gemma":0.0067736832,"teacher_disagreement_score":0.56343395,"about_ca_system_score_codex":0.0014357946,"about_ca_system_score_gemma":0.0015851295,"threshold_uncertainty_score":0.80367017},"labels":[],"label_agreement":null},{"id":"W2791301386","doi":"","title":"Zigzag form over families of parametric matrices","year":2014,"lang":"en","type":"article","venue":"Dialnet (Universidad de la Rioja)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Zigzag; Mathematics; Parametric statistics; Combinatorics; Business; Geometry; Statistics","score_opus":0.0059068530379861,"score_gpt":0.22399317303040303,"score_spread":0.21808631999241693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791301386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42921898,0.0005074654,0.50636566,0.000848652,0.0001803486,0.000096469594,0.0004428096,0.0006911418,0.06164849],"genre_scores_gemma":[0.87665486,0.0005330487,0.08555603,0.00022658554,0.0001797004,0.00014999016,0.00042303946,0.00027688994,0.0359997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912924,0.00025565946,0.000038775128,0.00021096987,0.00024836452,0.00011697556],"domain_scores_gemma":[0.998803,0.0004912235,0.0001935242,0.00017638756,0.0001744826,0.0001614222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007186346,0.00077598344,0.00058844354,0.0018937448,0.001215539,0.0023646792,0.0008483726,0.0007040895,0.008022457],"category_scores_gemma":[0.0025410808,0.00039800754,0.00059557956,0.0014397517,0.0014859488,0.002571833,0.0019510476,0.0017409521,0.0015156557],"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.00006856494,0.000028453562,0.00035560527,0.00002739606,0.000011428831,0.00011157968,0.00024192216,0.0028262215,0.0017933196,0.9751116,0.0011473268,0.018276604],"study_design_scores_gemma":[0.00002478417,0.00004933077,0.00018611044,0.000017194265,0.000010162307,0.00022179645,0.00012804243,0.016086683,0.0012668448,0.97629046,0.0056981333,0.00002033746],"about_ca_topic_score_codex":0.00062020327,"about_ca_topic_score_gemma":0.00077726826,"teacher_disagreement_score":0.008022457,"about_ca_system_score_codex":0.0008021191,"about_ca_system_score_gemma":0.00046826107,"threshold_uncertainty_score":0.026837766},"labels":[],"label_agreement":null},{"id":"W2794018658","doi":"","title":"The higher Balaban index on weighted matrix.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Matrix (chemical analysis); Computer science; Composite material; World Wide Web","score_opus":0.008168347400594788,"score_gpt":0.24365536849622052,"score_spread":0.23548702109562572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794018658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26809725,0.0049043396,0.38816804,0.0045914254,0.0026375465,0.00009338139,0.0007385224,0.0006896165,0.33007985],"genre_scores_gemma":[0.88009226,0.0019948077,0.049683753,0.0016093614,0.0014336328,0.0001433751,0.00041059696,0.00037684964,0.06425527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986142,0.00036620264,0.00007408659,0.00022130218,0.00048192445,0.00024235781],"domain_scores_gemma":[0.9966163,0.0011101586,0.00041773546,0.000618585,0.0006654212,0.0005718592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015580502,0.00068167894,0.0009658787,0.0036934898,0.0017729831,0.0038924094,0.0013204684,0.0013285594,0.013279647],"category_scores_gemma":[0.0072443453,0.0003553292,0.00058626616,0.002311645,0.0030496423,0.0074926945,0.0030666469,0.0027516626,0.0032624882],"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.00002294785,0.000012983168,0.00014081722,0.000026448179,0.00000425434,0.000030433655,0.00006119637,0.00039382404,0.0006204221,0.9916003,0.0017032566,0.0053832037],"study_design_scores_gemma":[0.000006003255,0.000014219728,0.00012794265,0.000018017246,0.000003886075,0.00008313978,0.000030992403,0.0051031783,0.000579519,0.99007976,0.0039392696,0.000014132838],"about_ca_topic_score_codex":0.0007742414,"about_ca_topic_score_gemma":0.0010259032,"teacher_disagreement_score":0.013279647,"about_ca_system_score_codex":0.0014071882,"about_ca_system_score_gemma":0.00073734566,"threshold_uncertainty_score":0.044424832},"labels":[],"label_agreement":null},{"id":"W2794421871","doi":"10.11575/prism/30592","title":"Reliable Krylov-based Algorithms for Matrix Null Space","year":2004,"lang":"en","type":"article","venue":"PRISM (University of Calgary)","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Computer science; Mathematics; Matrix (chemical analysis); Space (punctuation)","score_opus":0.010218496742355889,"score_gpt":0.21365949759050934,"score_spread":0.20344100084815345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794421871","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002748625,0.00010458248,0.99369955,0.000066847046,0.000018132368,0.00004308288,0.00007464187,0.0020578308,0.0011866904],"genre_scores_gemma":[0.053230617,0.00018800367,0.9419745,0.00005511176,0.000043947723,0.00027545998,0.00044656813,0.0007403368,0.0030454346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973859,0.00063376175,0.00015826669,0.00024039712,0.0013728585,0.00020874554],"domain_scores_gemma":[0.99216086,0.0032690028,0.0005718831,0.001987852,0.0018320295,0.0001783741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021703835,0.0015488046,0.0013144803,0.0019247587,0.0010699023,0.002042831,0.0027134933,0.001325341,0.008868831],"category_scores_gemma":[0.013128294,0.0010584242,0.0011113205,0.0020121366,0.0014374084,0.003932472,0.0031003656,0.002731255,0.0070895073],"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.0005672607,0.0001495041,0.0011902422,0.00041809856,0.00008514557,0.00013886919,0.0003858272,0.3352301,0.013304596,0.19088763,0.011142451,0.44650018],"study_design_scores_gemma":[0.000078561774,0.000058867776,0.0001063325,0.00002535532,0.000009385595,0.00004067922,0.00004379716,0.92371666,0.0052045253,0.06522198,0.005467732,0.000026111282],"about_ca_topic_score_codex":0.0032263463,"about_ca_topic_score_gemma":0.0048035434,"teacher_disagreement_score":0.008868831,"about_ca_system_score_codex":0.0011440461,"about_ca_system_score_gemma":0.0023538508,"threshold_uncertainty_score":0.029669225},"labels":[],"label_agreement":null},{"id":"W2795999852","doi":"10.1051/m2an/2018048","title":"Nonintrusive approximation of parametrized limits of matrix power algorithms – application to matrix inverses and log-determinants","year":2018,"lang":"en","type":"article","venue":"ESAIM Mathematical Modelling and Numerical Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Safran Electronics (Canada)","funders":"","keywords":"Interpolation (computer graphics); Inverse; Logarithm; Matrix (chemical analysis); Approximation error; Spouge's approximation; Approximation algorithm; Work (physics)","score_opus":0.01749563750013142,"score_gpt":0.28732455171988125,"score_spread":0.2698289142197498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795999852","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017715586,0.00025400423,0.9794064,0.00009154684,0.000026233514,0.000019703311,0.000015174134,0.00025859516,0.0022127586],"genre_scores_gemma":[0.5739277,0.0006857272,0.4189947,0.00012574212,0.00009359042,0.00012834292,0.00011384864,0.00057314406,0.005357116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986864,0.0005989764,0.000055044125,0.00015034879,0.00043916175,0.000070136935],"domain_scores_gemma":[0.9894091,0.007324983,0.0008195799,0.0016065628,0.00064409914,0.00019559325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025971085,0.0008120419,0.0006010174,0.0009796708,0.00035041888,0.0016667711,0.0014260787,0.0009727839,0.00269476],"category_scores_gemma":[0.02427119,0.00041593742,0.0004969993,0.00064581976,0.0018268618,0.003153789,0.002304784,0.0019668841,0.00069794065],"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.00016232608,0.0001285324,0.0016674678,0.0002899497,0.00005417129,0.0004321112,0.0005188387,0.47944623,0.012341659,0.43392903,0.0012449574,0.06978473],"study_design_scores_gemma":[0.0000031366278,0.000018960172,0.0000908724,0.000016072763,0.0000032531148,0.00007363495,0.000012440173,0.95810676,0.0027976115,0.038113587,0.00075525895,0.00000848359],"about_ca_topic_score_codex":0.00052053883,"about_ca_topic_score_gemma":0.0005342336,"teacher_disagreement_score":0.00269476,"about_ca_system_score_codex":0.0005827456,"about_ca_system_score_gemma":0.00056205085,"threshold_uncertainty_score":0.013734996},"labels":[],"label_agreement":null},{"id":"W2798346250","doi":"10.1016/j.laa.2018.09.023","title":"The generalized numerical range of a set of matrices","year":2018,"lang":"en","type":"preprint","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"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":"University of Waterloo; Simons Foundation; National Natural Science Foundation of China; National Sleep Foundation; Hong Kong Polytechnic University; National Science Foundation","keywords":"Numerical range; Combinatorics; Convexity; Convex hull; Mathematics; Algebraic number; Regular polygon; Star (game theory); Convex set; Discrete mathematics; Geometry; Mathematical analysis; Convex optimization","score_opus":0.01864231580642995,"score_gpt":0.280699043792737,"score_spread":0.2620567279863071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798346250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25724804,0.0022328233,0.7052512,0.0012890329,0.00023989765,0.00004491827,0.0008051003,0.00064013567,0.032248836],"genre_scores_gemma":[0.9185392,0.00087576464,0.074366055,0.00033484786,0.0004023282,0.00008851044,0.00043013282,0.00012977463,0.0048335292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788386,0.0006734414,0.00012616355,0.00047245782,0.00067027175,0.00017370154],"domain_scores_gemma":[0.994989,0.0026110744,0.0006738954,0.00059880194,0.0007298571,0.0003973341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012757763,0.0007673988,0.00070295914,0.0024789139,0.000574847,0.003183945,0.0011796773,0.00072140124,0.0038096083],"category_scores_gemma":[0.009903463,0.0003038334,0.0005327508,0.0017043364,0.0027225993,0.0040630233,0.0023614021,0.0016185966,0.00075136364],"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.00024981945,0.00003559494,0.0014308644,0.00023366151,0.000057819456,0.0003072334,0.00049612555,0.01489274,0.012977129,0.9303265,0.0015705248,0.03742198],"study_design_scores_gemma":[0.000022848162,0.00009638618,0.00063204253,0.00007573206,0.00002566887,0.00051872846,0.00017743761,0.060833663,0.0053731557,0.92557496,0.0066229245,0.000046434066],"about_ca_topic_score_codex":0.00029068752,"about_ca_topic_score_gemma":0.00018190777,"teacher_disagreement_score":0.0038096083,"about_ca_system_score_codex":0.00043701398,"about_ca_system_score_gemma":0.00041371348,"threshold_uncertainty_score":0.012744367},"labels":[],"label_agreement":null},{"id":"W2799666808","doi":"10.1007/978-981-13-0146-9_6","title":"Structured Matrices and Their Generalized Inverses","year":2018,"lang":"en","type":"book-chapter","venue":"Developments in mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Toeplitz matrix; Vandermonde matrix; Circulant matrix; Mathematics; Diagonal; Cauchy distribution; Matrix (chemical analysis); Algebra over a field; Pure mathematics; Combinatorics; Eigenvalues and eigenvectors; Mathematical analysis; Physics; Geometry","score_opus":0.021081654209811385,"score_gpt":0.23483934080212385,"score_spread":0.21375768659231245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799666808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009177248,0.021829473,0.5195769,0.002246529,0.0048759617,0.000054568718,0.00030906557,0.00071127707,0.4412189],"genre_scores_gemma":[0.1293259,0.03392943,0.22503367,0.0021638474,0.0045226132,0.00022985158,0.0007257668,0.00093822053,0.6031308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975115,0.00005052643,0.000010725797,0.000051198425,0.00012132502,0.000015092714],"domain_scores_gemma":[0.9997466,0.00009263194,0.000019986272,0.000054016124,0.00007392739,0.000012820695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026315977,0.00080150564,0.00038287474,0.0009548646,0.0004351377,0.0017829345,0.0005040548,0.00059598644,0.0139952535],"category_scores_gemma":[0.00110162,0.0004005685,0.00040876787,0.0012066914,0.0015799882,0.0021561063,0.0007789978,0.0018864386,0.0060213692],"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.000005967838,0.0000067760675,0.000014985027,0.00007990318,0.0000046007726,0.000027361411,0.00012171527,0.0011637331,0.0009874345,0.92417294,0.01620559,0.057208944],"study_design_scores_gemma":[0.0000049385235,0.000014500752,0.000056333676,0.0000516459,0.0000042142406,0.00014873203,0.000056069803,0.002533738,0.00063760154,0.81567025,0.18081088,0.000011050417],"about_ca_topic_score_codex":0.0003346507,"about_ca_topic_score_gemma":0.0006153871,"teacher_disagreement_score":0.0139952535,"about_ca_system_score_codex":0.00041529065,"about_ca_system_score_gemma":0.00044538354,"threshold_uncertainty_score":0.046818793},"labels":[],"label_agreement":null},{"id":"W2804706646","doi":"10.1016/j.laa.2020.08.022","title":"On the spectral structure of Jordan-Kronecker products of symmetric and skew-symmetric matrices","year":2020,"lang":"en","type":"preprint","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Interlacing; Eigenvalues and eigenvectors; Mathematics; Combinatorics; Kronecker delta; Spectrum (functional analysis); Skew-symmetric matrix; Rank (graph theory); Conjecture; Symmetric matrix; Physics; Square matrix","score_opus":0.01523489492953752,"score_gpt":0.24256113699091086,"score_spread":0.22732624206137333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804706646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41911358,0.0027361354,0.52733004,0.0017123228,0.00053181034,0.000053993044,0.0003968069,0.00021137095,0.047913983],"genre_scores_gemma":[0.93056554,0.0017148558,0.051305864,0.00047537126,0.0007008628,0.00008589038,0.00044657255,0.00018005175,0.014525055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882513,0.00047277968,0.000065054555,0.00018598235,0.00031836997,0.00013268611],"domain_scores_gemma":[0.9915923,0.0044768997,0.0009691574,0.00067245885,0.001491925,0.0007972729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024524704,0.00094537856,0.00075001625,0.0023513506,0.0014326785,0.003550206,0.0014541405,0.0012863887,0.006069822],"category_scores_gemma":[0.011673145,0.00056615216,0.00052206457,0.0019984115,0.0042184093,0.006706153,0.0020293177,0.0018882442,0.0011872244],"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.000053833875,0.00004971157,0.00043148888,0.00003280799,0.0000062519266,0.0000636215,0.00032593514,0.0025758585,0.0009555127,0.9872902,0.0010491093,0.007165542],"study_design_scores_gemma":[0.000006430398,0.000023605218,0.00019187933,0.000020616482,0.000003860777,0.00008419827,0.0001118727,0.022092113,0.0003854571,0.97592205,0.0011400442,0.000017828335],"about_ca_topic_score_codex":0.00073145947,"about_ca_topic_score_gemma":0.00089292525,"teacher_disagreement_score":0.006069822,"about_ca_system_score_codex":0.0006444965,"about_ca_system_score_gemma":0.00081895647,"threshold_uncertainty_score":0.020305514},"labels":[],"label_agreement":null},{"id":"W2806308536","doi":"10.1145/3325111","title":"A Faster Hafnian Formula for Complex Matrices and Its Benchmarking on a Supercomputer","year":2019,"lang":"en","type":"preprint","venue":"ACM Journal of Experimental Algorithmics","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Supercomputer; Parallelizable manifold; Parallel computing; Benchmarking; Computer science; Titan (rocket family); Embarrassingly parallel; Matrix (chemical analysis); Computational science; FLOPS; Algorithm; Parallel algorithm; Physics; Chemistry","score_opus":0.04067249351576445,"score_gpt":0.30627419484057744,"score_spread":0.265601701324813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806308536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17024374,0.0022310244,0.76512647,0.0012070113,0.00072059355,0.00020864862,0.0013140186,0.009632631,0.04931586],"genre_scores_gemma":[0.47423336,0.000835111,0.514487,0.00031849474,0.00020886958,0.0002834798,0.0020346695,0.0017427948,0.005856118],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978192,0.00034941547,0.00011547317,0.00019523775,0.0013369055,0.00018375256],"domain_scores_gemma":[0.99522984,0.0015122419,0.0002174366,0.0013371005,0.0015139757,0.00018936493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020092365,0.0009214266,0.0009518249,0.002790696,0.00077982334,0.0013085802,0.0020885644,0.0011120511,0.008843496],"category_scores_gemma":[0.012044482,0.00028829926,0.0005828864,0.003919073,0.00083279656,0.0038490873,0.0011308183,0.0013874024,0.0016657249],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005473287,0.0004112145,0.004004014,0.00058462704,0.0001290134,0.00028063127,0.000465844,0.26957458,0.01621711,0.24743935,0.039288647,0.4210576],"study_design_scores_gemma":[0.00009347919,0.0001204173,0.001052108,0.000051900406,0.00002087542,0.0001277976,0.00007790319,0.8943,0.010599528,0.07771759,0.015792249,0.000046130765],"about_ca_topic_score_codex":0.007955493,"about_ca_topic_score_gemma":0.0062308777,"teacher_disagreement_score":0.008843496,"about_ca_system_score_codex":0.0014297339,"about_ca_system_score_gemma":0.0014628216,"threshold_uncertainty_score":0.029584467},"labels":[],"label_agreement":null},{"id":"W2810171908","doi":"10.1070/rm9892","title":"Integral norm discretization and related problems","year":2019,"lang":"en","type":"article","venue":"Russian Mathematical Surveys","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":58,"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":"Generalitat de Catalunya; Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación; Ministry of Education and Science of the Russian Federation; Centres de Recerca de Catalunya","keywords":"Mathematics; Discretization; Norm (philosophy); Applied mathematics; Algebra over a field; Mathematical economics; Calculus (dental); Pure mathematics; Mathematical analysis; Law; Political science; Medicine","score_opus":0.00750721445071233,"score_gpt":0.21644033907024868,"score_spread":0.20893312461953634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810171908","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027058005,0.0034127918,0.9359594,0.0012377003,0.0004889641,0.00002722903,0.00012572494,0.00013056555,0.03155961],"genre_scores_gemma":[0.6035319,0.0043922365,0.3640965,0.0005931066,0.0008958149,0.0001521247,0.0005299263,0.00025879237,0.025549604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987826,0.00046263853,0.00006275892,0.00017430523,0.0004400258,0.00007769302],"domain_scores_gemma":[0.9981768,0.0010910773,0.0001286498,0.00019665547,0.000307215,0.0000995528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018056597,0.00033100398,0.0007838144,0.0009579216,0.00057201914,0.0016838154,0.0010413388,0.00086654926,0.0037213266],"category_scores_gemma":[0.0052054455,0.00021365132,0.0005219581,0.0012292695,0.002332732,0.0025807777,0.001572367,0.0020111173,0.0004640947],"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.000019773091,0.00001345171,0.00014117069,0.00008644779,0.0000084578105,0.000039182585,0.0000652785,0.018459354,0.0005657991,0.9640981,0.0012138911,0.01528909],"study_design_scores_gemma":[0.0000055198134,0.000015840878,0.000095852396,0.000039816787,0.0000044108037,0.00006437675,0.00004600737,0.15094627,0.0005522146,0.8433099,0.0049123345,0.0000075264866],"about_ca_topic_score_codex":0.0009571686,"about_ca_topic_score_gemma":0.00062904623,"teacher_disagreement_score":0.0037213266,"about_ca_system_score_codex":0.0014824944,"about_ca_system_score_gemma":0.0005726691,"threshold_uncertainty_score":0.012449086},"labels":[],"label_agreement":null},{"id":"W2891961001","doi":"","title":"Gradient Descent Meets Shift-and-Invert Preconditioning for Eigenvector Computation","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Gradient descent; Leverage (statistics); Eigenvalues and eigenvectors; Algorithm; Computation; Solver; Rate of convergence; Computer science; Mathematical optimization; Mathematics; Applied mathematics; Key (lock)","score_opus":0.019729116493819976,"score_gpt":0.2599810769652536,"score_spread":0.2402519604714336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891961001","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005082441,0.00012177779,0.9905896,0.00021717417,0.00008052621,0.00005473691,0.000038863804,0.00048668904,0.0033281941],"genre_scores_gemma":[0.14893346,0.00040580428,0.843308,0.00020098542,0.00018641814,0.00024117997,0.00023025715,0.00055272126,0.0059412234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991248,0.00030440834,0.00005051096,0.000112300535,0.00030031177,0.00010775835],"domain_scores_gemma":[0.9981437,0.00076881703,0.00013502716,0.0003924178,0.00044263233,0.00011740273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001211839,0.0014641923,0.0010205543,0.00059157977,0.00067594147,0.001150574,0.00069983787,0.0012154886,0.008246063],"category_scores_gemma":[0.008069454,0.000461141,0.00062770594,0.0007612181,0.0013819003,0.0018165135,0.0016586367,0.0026877462,0.003695424],"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.00045640607,0.00020100642,0.0015533951,0.000512004,0.00009801158,0.00046109178,0.00037108568,0.34641042,0.03289412,0.27446204,0.02150214,0.32107824],"study_design_scores_gemma":[0.000027284917,0.00006401469,0.00012321761,0.000018479268,0.00000577736,0.00009745354,0.000026298672,0.9369149,0.00636143,0.051898662,0.004451249,0.000011282938],"about_ca_topic_score_codex":0.0022515012,"about_ca_topic_score_gemma":0.0032218408,"teacher_disagreement_score":0.008246063,"about_ca_system_score_codex":0.00048394315,"about_ca_system_score_gemma":0.001923107,"threshold_uncertainty_score":0.027585804},"labels":[],"label_agreement":null},{"id":"W2891979638","doi":"10.28924/2291-8639-16-2018-673","title":"µ−Values for Matrices Corresponding to Symmetries in Control Systems","year":2018,"lang":"en","type":"article","venue":"International Journal of 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":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Homogeneous space; Control (management); Pure mathematics; Algebra over a field; Computer science; Geometry; Artificial intelligence","score_opus":0.009292866349617202,"score_gpt":0.3029788206986956,"score_spread":0.2936859543490784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891979638","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14758518,0.00048308235,0.83836013,0.0003779433,0.00014764672,0.000069136644,0.0001072475,0.00024788955,0.012621754],"genre_scores_gemma":[0.93527263,0.00034133802,0.060228102,0.000111881745,0.00005477453,0.0000749159,0.00013982497,0.000074342184,0.0037020915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996177,0.00008143574,0.000018273739,0.00006447003,0.00017453851,0.00004352756],"domain_scores_gemma":[0.9990102,0.00039171672,0.0002461147,0.00011335552,0.000179172,0.000059434587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065581285,0.00060374563,0.00039117792,0.00059450604,0.0004179436,0.00092045346,0.0004353425,0.0006473831,0.0034848945],"category_scores_gemma":[0.0036110703,0.00020376357,0.00043489094,0.0002864152,0.0011825592,0.0011042036,0.0005823062,0.0010843049,0.00035948158],"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.00010234956,0.00007541617,0.0015815863,0.0002575481,0.00004985237,0.00029515702,0.00027403995,0.34340355,0.018636521,0.6068513,0.0012079915,0.027264718],"study_design_scores_gemma":[0.000006105106,0.00006037597,0.00034781135,0.000019829651,0.0000056009926,0.00007570143,0.00004885573,0.87789756,0.0028141853,0.11782465,0.00088477693,0.000014452777],"about_ca_topic_score_codex":0.0017860178,"about_ca_topic_score_gemma":0.0011465378,"teacher_disagreement_score":0.0034848945,"about_ca_system_score_codex":0.00047842105,"about_ca_system_score_gemma":0.0006012144,"threshold_uncertainty_score":0.011658192},"labels":[],"label_agreement":null},{"id":"W2893675364","doi":"10.1016/j.cam.2018.09.001","title":"A simultaneous decomposition for seven matrices with applications","year":2018,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Quaternion; Matrix (chemical analysis); Decomposition; Quaternion algebra; Algebra over a field; Numerical range; Matrix decomposition; Set (abstract data type); Combinatorics; Pure mathematics; Eigenvalues and eigenvectors; Geometry; Division algebra","score_opus":0.008556282202034247,"score_gpt":0.2646661752207739,"score_spread":0.25610989301873965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893675364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02986319,0.00029033207,0.95176494,0.0003011373,0.00037737668,0.0000914975,0.0001809815,0.00024235953,0.016888173],"genre_scores_gemma":[0.26905203,0.0007015019,0.70131075,0.00027306614,0.00035872616,0.00023298811,0.000787616,0.00028037367,0.0270029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942774,0.00012123605,0.000038558785,0.000113839036,0.00019945297,0.000099148725],"domain_scores_gemma":[0.9991211,0.0002504277,0.00004883166,0.00011159986,0.0003598614,0.00010814515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005368681,0.0015181531,0.000591043,0.0011837346,0.00071616546,0.0012375779,0.00092767394,0.00080296304,0.010654586],"category_scores_gemma":[0.0018406108,0.00038692963,0.0011325021,0.0014026681,0.00074442365,0.0013202765,0.001661795,0.0018041468,0.0034549434],"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.00028831736,0.00020567242,0.0006790755,0.00047510164,0.00006364985,0.0006690704,0.00069759507,0.028566012,0.036269788,0.5668278,0.017993174,0.34726474],"study_design_scores_gemma":[0.00007572359,0.0003722876,0.0007528417,0.0001006256,0.0000859171,0.0009236505,0.0005530763,0.3382144,0.016149344,0.59094083,0.051760223,0.000071016766],"about_ca_topic_score_codex":0.0007816465,"about_ca_topic_score_gemma":0.0010532261,"teacher_disagreement_score":0.010654586,"about_ca_system_score_codex":0.00023445749,"about_ca_system_score_gemma":0.00070249505,"threshold_uncertainty_score":0.03564316},"labels":[],"label_agreement":null},{"id":"W2894966397","doi":"10.1145/3282678.3282680","title":"Comprehensive anti-derivatives and parametric continuity","year":2018,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Western University","funders":"","keywords":"Parametric statistics; Software; Computer science; Applied mathematics; Mathematics; Calculus (dental); Mathematical optimization; Programming language; Statistics","score_opus":0.039728391059332374,"score_gpt":0.30970397895029883,"score_spread":0.26997558789096643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894966397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012170793,0.00044617578,0.95280224,0.00046886603,0.00028144542,0.00002901219,0.00014756976,0.0026808397,0.030973125],"genre_scores_gemma":[0.3785431,0.0010269205,0.5868231,0.00044692043,0.00036690765,0.00009483509,0.0004262485,0.0051876665,0.027084291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987423,0.00023063227,0.000100667225,0.0001899905,0.0006374128,0.00009891371],"domain_scores_gemma":[0.9977196,0.00074979645,0.00013186749,0.0008970779,0.0003424025,0.0001592075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001775285,0.00081513566,0.00065763545,0.0012299856,0.0010321371,0.004170359,0.0016521487,0.0010324961,0.016094333],"category_scores_gemma":[0.0067564426,0.0005800378,0.00094806694,0.0010278393,0.002012059,0.005697614,0.003721873,0.002697609,0.004134879],"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.000103678125,0.000035304995,0.0005657349,0.00014928638,0.000021425367,0.0005345001,0.00037912544,0.0047507472,0.0076485123,0.90637934,0.005754312,0.073677935],"study_design_scores_gemma":[0.000022311346,0.00005081049,0.000360892,0.0000839494,0.000021064208,0.0010684594,0.00011669434,0.06058689,0.017043099,0.8451333,0.0754494,0.000063191874],"about_ca_topic_score_codex":0.00039627758,"about_ca_topic_score_gemma":0.00043318735,"teacher_disagreement_score":0.016094333,"about_ca_system_score_codex":0.00050733256,"about_ca_system_score_gemma":0.00061644614,"threshold_uncertainty_score":0.053840876},"labels":[],"label_agreement":null},{"id":"W2897363410","doi":"10.1016/j.laa.2019.01.012","title":"On directional derivatives of trace functionals of the form A↦Tr(Pf(A))","year":2019,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Positive-definite matrix; Differentiable function; Mathematics; TRACE (psycholinguistics); Function (biology); Matrix (chemical analysis); Directional derivative; Combinatorics; Pure mathematics; Mathematical analysis; Chemistry; Physics; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.008822227586996717,"score_gpt":0.23298151277666396,"score_spread":0.22415928518966724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897363410","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25427836,0.0034615814,0.6829732,0.0025316041,0.0006986428,0.000041216346,0.0003607728,0.00036579635,0.05528886],"genre_scores_gemma":[0.8846727,0.0036734585,0.06282714,0.0007783912,0.0008658047,0.00007194682,0.00046114987,0.00061161566,0.046037696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999348,0.00022567798,0.000029512055,0.00011615467,0.00018829165,0.000092307935],"domain_scores_gemma":[0.99720204,0.0011854991,0.00034859378,0.00022678086,0.0006149799,0.0004222056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019651703,0.0010010188,0.00070489186,0.0023305635,0.0011161801,0.0023028245,0.0011442008,0.001286167,0.0058308016],"category_scores_gemma":[0.0066841547,0.00047473705,0.0006273166,0.0017256334,0.0032266052,0.0055550775,0.0018882307,0.002479796,0.00089255266],"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.000033101987,0.000022595714,0.0003420845,0.000030680858,0.000008335456,0.0000736303,0.00018079164,0.0022226844,0.0014886054,0.98662984,0.0010874135,0.007880255],"study_design_scores_gemma":[0.000010858621,0.000037727754,0.00052859436,0.000033207958,0.00000986752,0.00017425085,0.000118686396,0.052744444,0.0010684292,0.941778,0.0034625211,0.000033465574],"about_ca_topic_score_codex":0.0016395639,"about_ca_topic_score_gemma":0.0020610325,"teacher_disagreement_score":0.0058308016,"about_ca_system_score_codex":0.0011024078,"about_ca_system_score_gemma":0.00084877847,"threshold_uncertainty_score":0.019505978},"labels":[],"label_agreement":null},{"id":"W2901431373","doi":"10.1016/j.compfluid.2018.11.016","title":"A dynamically deflated GMRES adjoint solver for aerodynamic shape optimization","year":2018,"lang":"en","type":"article","venue":"Computers & Fluids","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":"Bombardier (Canada); McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Bombardier","keywords":"Generalized minimal residual method; Solver; Airfoil; Krylov subspace; Jacobian matrix and determinant; Aerodynamics; Computer science; Lagrange multiplier; NACA airfoil; Mathematical optimization; Linear system; Applied mathematics; Discretization; Mathematics; Iterative method; Reynolds number; Mathematical analysis; Aerospace engineering","score_opus":0.009704927945804206,"score_gpt":0.236745789256965,"score_spread":0.22704086131116077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901431373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009327884,0.00007345609,0.98073775,0.00015861113,0.0001876828,0.000056855813,0.00012772395,0.0025760897,0.0067539527],"genre_scores_gemma":[0.097439006,0.000059784685,0.8923394,0.00024882864,0.0000714267,0.00013622401,0.000338404,0.00089017226,0.008476757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997625,0.000047366695,0.000009372995,0.000025070902,0.00013380771,0.000021804113],"domain_scores_gemma":[0.99971265,0.000071640134,0.000017278104,0.000045196397,0.00011797075,0.00003520496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035596424,0.0005307235,0.00056883553,0.0002910849,0.00043383037,0.0005713805,0.0012744259,0.0011285379,0.009693313],"category_scores_gemma":[0.0010470719,0.00037773026,0.00045227405,0.00030146504,0.0003608213,0.00053137896,0.0015286658,0.0013440633,0.003177148],"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.00030387694,0.0003052674,0.0009145157,0.00021223984,0.00008113031,0.0003346391,0.00016498799,0.50316966,0.057749037,0.03873814,0.022065455,0.3759611],"study_design_scores_gemma":[0.00002971785,0.000029753835,0.00008186829,0.000006712274,0.0000044242424,0.000043263426,0.000008860633,0.9892396,0.0028209027,0.002488455,0.005236169,0.000010219555],"about_ca_topic_score_codex":0.0017577928,"about_ca_topic_score_gemma":0.0034307856,"teacher_disagreement_score":0.009693313,"about_ca_system_score_codex":0.0002193705,"about_ca_system_score_gemma":0.00097511214,"threshold_uncertainty_score":0.03242743},"labels":[],"label_agreement":null},{"id":"W2909233240","doi":"10.28924/2291-8639-17-2019-33","title":"Computing Lower Bounds of µ-Values for a Class of Rotary Electrical Machines","year":2019,"lang":"en","type":"article","venue":"International Journal of 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":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Singular value; Robustness (evolution); MATLAB; Computation; Mathematics; Class (philosophy); Control theory (sociology); DC motor; Stability (learning theory); Applied mathematics; Computer science; Control (management); Algorithm; Artificial intelligence; Machine learning; Electrical engineering","score_opus":0.0056759104419760635,"score_gpt":0.2820978588422714,"score_spread":0.2764219484002953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909233240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05100667,0.000773361,0.94320935,0.00018675489,0.000052390064,0.000022305348,0.00014502213,0.00033453447,0.004269484],"genre_scores_gemma":[0.75048786,0.0008428555,0.24367051,0.00012528095,0.00014329533,0.00012880728,0.00094926235,0.00029409162,0.0033580952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991642,0.00012818477,0.000042342705,0.0001831931,0.00039203966,0.00009019733],"domain_scores_gemma":[0.9950511,0.0034413498,0.0004373721,0.00039220796,0.00054729474,0.00013068263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013097622,0.0009140134,0.00070996635,0.0016264933,0.0004196383,0.0013764257,0.00082521193,0.00088025094,0.0036918495],"category_scores_gemma":[0.012123104,0.00027282044,0.0006699555,0.00065453816,0.0008173255,0.0016689753,0.00093570224,0.0015004491,0.00080338353],"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.0005058918,0.00013243739,0.0030682122,0.00061729853,0.00012035755,0.0003351556,0.00026974425,0.61131513,0.033352543,0.180114,0.0031371335,0.16703206],"study_design_scores_gemma":[0.000009688685,0.0001261292,0.0007369663,0.000049527807,0.000013176396,0.00014097888,0.000032067248,0.9035902,0.008691473,0.08457871,0.0020078954,0.000023199229],"about_ca_topic_score_codex":0.0004221393,"about_ca_topic_score_gemma":0.00044140627,"teacher_disagreement_score":0.0036918495,"about_ca_system_score_codex":0.0005654697,"about_ca_system_score_gemma":0.00035666773,"threshold_uncertainty_score":0.0123505},"labels":[],"label_agreement":null},{"id":"W2912158652","doi":"10.1016/j.jat.2010.06.007","title":"Triangular expansions","year":2010,"lang":"en","type":"article","venue":"Journal of Approximation Theory","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Operator (biology); Applied mathematics; Linear operators; Type (biology); Mathematical analysis","score_opus":0.008481458228009086,"score_gpt":0.2407388875432381,"score_spread":0.23225742931522902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912158652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011629618,0.00083727733,0.7264742,0.0012630537,0.0015625111,0.00011366443,0.0006707273,0.0010030717,0.2564458],"genre_scores_gemma":[0.3057869,0.0018641963,0.40530363,0.0019107537,0.0017340431,0.00039730585,0.0027832207,0.0021621208,0.27805775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908006,0.00022727407,0.00003872695,0.00015719786,0.00040398887,0.00009280026],"domain_scores_gemma":[0.9986186,0.00038738092,0.000054779506,0.00042820658,0.00043231415,0.000078660574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006935324,0.0008025055,0.0007723008,0.0013518243,0.00097540853,0.00233756,0.0011173876,0.001026386,0.06334238],"category_scores_gemma":[0.0049574794,0.0004322098,0.0007035211,0.0015936602,0.0011922409,0.0029304146,0.0016905464,0.0030947807,0.016131736],"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.00004727645,0.000051748717,0.000099143384,0.00006190304,0.000012236556,0.000044376593,0.000090966416,0.0046892953,0.0019188394,0.86753607,0.032500457,0.09294771],"study_design_scores_gemma":[0.000023440036,0.000033434746,0.00013659023,0.000037465503,0.000014754754,0.00016916839,0.00007614747,0.08142973,0.002441878,0.86468387,0.050933067,0.000020427105],"about_ca_topic_score_codex":0.00089832145,"about_ca_topic_score_gemma":0.0017830033,"teacher_disagreement_score":0.06334238,"about_ca_system_score_codex":0.000619466,"about_ca_system_score_gemma":0.0006012783,"threshold_uncertainty_score":0.21190137},"labels":[],"label_agreement":null},{"id":"W2912262202","doi":"10.1007/978-3-030-14640-5_9","title":"Which Quartic Polynomials Have a Hyperbolic Antiderivative?","year":2019,"lang":"en","type":"book-chapter","venue":"Trends in mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Quartic function; Mathematics; Polynomial; Matrix polynomial; Quadratic function; Cubic function; Derivative (finance); Quadratic equation; Degree (music); Stable polynomial; Mathematical analysis; Pure mathematics; Alternating polynomial; Geometry; Physics","score_opus":0.031205748825791725,"score_gpt":0.27340536184188885,"score_spread":0.24219961301609713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912262202","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.142055,0.0077062687,0.08901227,0.016138,0.00659369,0.00003237717,0.0004159621,0.00043268318,0.73761374],"genre_scores_gemma":[0.79831165,0.005860678,0.017909985,0.0028427062,0.0024920402,0.000026072443,0.0002298465,0.00041216303,0.17191479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998375,0.000021861051,0.0000074204117,0.00003985959,0.000058474983,0.000034846384],"domain_scores_gemma":[0.9995092,0.00011456848,0.00006429192,0.00013238742,0.00011445097,0.000064982996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040940213,0.00029723524,0.00042400093,0.00060736696,0.0008856534,0.0019691573,0.00064396975,0.00070993387,0.015266948],"category_scores_gemma":[0.0016164082,0.00023990637,0.0003328869,0.0008778835,0.0023788468,0.005274387,0.00069297187,0.0020799104,0.0042210743],"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.000013971369,0.0000060699826,0.00008247705,0.000028107574,0.0000021519477,0.000026270647,0.00009209354,0.00009562461,0.00044359275,0.983799,0.0038217371,0.011588911],"study_design_scores_gemma":[0.00000829522,0.000012690275,0.00016374324,0.000025761521,0.0000042445163,0.00019691435,0.00013959444,0.00060816936,0.0004936787,0.96012807,0.038211096,0.000007848702],"about_ca_topic_score_codex":0.0005151532,"about_ca_topic_score_gemma":0.00068812,"teacher_disagreement_score":0.015266948,"about_ca_system_score_codex":0.0006444597,"about_ca_system_score_gemma":0.00041152784,"threshold_uncertainty_score":0.051073074},"labels":[],"label_agreement":null},{"id":"W2913285917","doi":"10.1016/j.cam.2019.01.006","title":"Add–sub pivoting triangular factorization for symmetric matrix","year":2019,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Triangular matrix; Factorization; Matrix (chemical analysis); Matrix decomposition; Combinatorics; LU decomposition; Algebra over a field; Pure mathematics; Eigenvalues and eigenvectors; Algorithm; Invertible matrix","score_opus":0.011227558111371543,"score_gpt":0.24674780699226134,"score_spread":0.2355202488808898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913285917","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008808699,0.00026806194,0.98292625,0.0001891693,0.0002471413,0.000083987325,0.00027055523,0.0007199815,0.0064862883],"genre_scores_gemma":[0.23366253,0.00067719206,0.7421389,0.00039628078,0.000435226,0.00022241975,0.0015414386,0.00044454835,0.020481404],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992461,0.0001611495,0.000036592035,0.00012863407,0.00031319383,0.00011436576],"domain_scores_gemma":[0.9986027,0.00039404203,0.00009031133,0.00042046263,0.00039609594,0.000096415126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066917314,0.0010278535,0.00072536233,0.0005542242,0.000674698,0.0010418926,0.00075420766,0.00059453206,0.016137913],"category_scores_gemma":[0.003408534,0.00035248196,0.00067803054,0.0007876269,0.0009952271,0.0011950162,0.0012485535,0.0014154157,0.0058694407],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051460956,0.00027964177,0.0011256145,0.0008344097,0.000104368824,0.00056390156,0.00042290424,0.10152429,0.033331268,0.22545043,0.072520636,0.5633279],"study_design_scores_gemma":[0.000085527325,0.00035938915,0.00056838273,0.00007847524,0.00004230233,0.00054009847,0.0002796375,0.6630797,0.023077043,0.27373126,0.038094856,0.000063251464],"about_ca_topic_score_codex":0.0026044336,"about_ca_topic_score_gemma":0.0052812058,"teacher_disagreement_score":0.016137913,"about_ca_system_score_codex":0.00035131766,"about_ca_system_score_gemma":0.0011690285,"threshold_uncertainty_score":0.05398673},"labels":[],"label_agreement":null},{"id":"W2914308990","doi":"","title":"On the use of low-rank arithmetic to reduce the complexity of parallel sparse linear solvers based on direct factorization techniques","year":2018,"lang":"en","type":"preprint","venue":"Oskar-Bordeaux (Universite de Bordeaux)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Preconditioner; Solver; Computer science; Memory footprint; Linear system; Block (permutation group theory); Sparse matrix; Rank (graph theory); Matrix-free methods; Incomplete LU factorization; Parallel computing; Kernel (algebra); Granularity; Algorithm; Theoretical computer science; Iterative method; Matrix decomposition; Mathematics; Eigenvalues and eigenvectors","score_opus":0.0558826148687074,"score_gpt":0.27130009593711846,"score_spread":0.21541748106841105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914308990","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0467227,0.0029547769,0.92967373,0.00076192844,0.00018909316,0.0001217055,0.00011790501,0.002940289,0.016517926],"genre_scores_gemma":[0.30710727,0.0038343065,0.6739354,0.0004517008,0.00023731991,0.0002032453,0.00048539796,0.00054419646,0.013201229],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993241,0.00012456003,0.000031544238,0.00006762299,0.0003648778,0.00008729151],"domain_scores_gemma":[0.9986494,0.0006094926,0.00010292929,0.000277605,0.00031488013,0.000045607223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006220215,0.0008565529,0.00061993767,0.00070518715,0.00046988734,0.0011172737,0.00085141143,0.0005915386,0.0050334716],"category_scores_gemma":[0.0033131312,0.0003238796,0.00055672554,0.00077346823,0.00070597616,0.0015760867,0.0010802236,0.0010774281,0.0018529783],"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.0007404607,0.00026940161,0.0013541572,0.0008224039,0.000106927306,0.00042379633,0.00041541114,0.20708755,0.07664655,0.061277915,0.0129006775,0.6379548],"study_design_scores_gemma":[0.0000993501,0.00042050012,0.00049013423,0.00008829852,0.00004685114,0.00028882475,0.00008586301,0.92191225,0.04087586,0.014479299,0.021167075,0.000045682023],"about_ca_topic_score_codex":0.003094984,"about_ca_topic_score_gemma":0.005441713,"teacher_disagreement_score":0.0050334716,"about_ca_system_score_codex":0.00037422328,"about_ca_system_score_gemma":0.0012224772,"threshold_uncertainty_score":0.01683861},"labels":[],"label_agreement":null},{"id":"W2914740836","doi":"10.2514/6.2019-0495.c1","title":"Correction: Application of Modal Truncation Vectors to the Mixed and Fixed Boundary Dynamic Math Models","year":2019,"lang":"en","type":"article","venue":"AIAA Scitech 2019 Forum","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Modal; Truncation (statistics); Boundary (topology); Computer science; Applied mathematics; Mathematics; Calculus (dental); Mathematical analysis; Machine learning","score_opus":0.0039031603374736104,"score_gpt":0.2118410493057119,"score_spread":0.20793788896823828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914740836","genre_codex":"editorial","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005929804,0.0008503928,0.010733552,0.023707204,0.9544467,0.00005022476,0.002149364,0.0016909807,0.005778522],"genre_scores_gemma":[0.0932606,0.005786532,0.070997335,0.04353471,0.35428673,0.00043459793,0.0063039474,0.0073765237,0.41801897],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99606824,0.000717302,0.00066329,0.0006280807,0.0015666644,0.0003564299],"domain_scores_gemma":[0.96897787,0.006009822,0.0011485805,0.0037601187,0.018829277,0.0012744061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027304552,0.0024618697,0.0022117821,0.0055669914,0.003030829,0.003922861,0.004243761,0.006091407,0.10165717],"category_scores_gemma":[0.065594986,0.0011489284,0.0024249235,0.004087672,0.003009848,0.005043846,0.002795614,0.0077646603,0.031089574],"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.00008130443,0.000011339809,0.00009611282,0.00025276875,0.000027508278,0.00019973602,0.000059554834,0.00051283295,0.0001899567,0.014027664,0.9741175,0.010423595],"study_design_scores_gemma":[0.00009720861,0.000048646616,0.0011203692,0.00026501567,0.00005470253,0.0008701254,0.00016166591,0.009635311,0.0016292341,0.034217544,0.9517819,0.00011836127],"about_ca_topic_score_codex":0.014386331,"about_ca_topic_score_gemma":0.01677996,"teacher_disagreement_score":0.10165717,"about_ca_system_score_codex":0.0036674354,"about_ca_system_score_gemma":0.004019125,"threshold_uncertainty_score":0.3400771},"labels":[],"label_agreement":null},{"id":"W2924691308","doi":"10.1137/19m1245505","title":"The Block Rational Arnoldi Method","year":2020,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Engineering and Physical Sciences Research Council","keywords":"Orthonormal basis; Mathematics; Applied mathematics; Eigenvalues and eigenvectors; Block (permutation group theory); Arnoldi iteration; Krylov subspace; MATLAB; Rational function; Stability (learning theory); Generalized minimal residual method; Elliptic rational functions; Mathematical optimization; Pure mathematics; Computer science; Iterative method; Combinatorics","score_opus":0.012178461811036483,"score_gpt":0.2954704634421431,"score_spread":0.2832920016311066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2924691308","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005209646,0.00031217863,0.97212964,0.00015149928,0.0001133776,0.000053321462,0.00015431254,0.00057404535,0.02130186],"genre_scores_gemma":[0.26572743,0.0012851674,0.6789336,0.00026020434,0.00013909093,0.00030204403,0.0005646667,0.001070834,0.051716886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996637,0.000084170555,0.000012889557,0.00003820496,0.00015211928,0.00004896126],"domain_scores_gemma":[0.9996619,0.000089966845,0.000028304788,0.00007892025,0.000113712165,0.00002712695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036960866,0.00040285333,0.0006839076,0.0004345862,0.00036796086,0.0010065559,0.00085453165,0.0007349877,0.011665402],"category_scores_gemma":[0.0012201988,0.00029965033,0.0004651434,0.0003519333,0.000569966,0.000987146,0.0010074127,0.0010291655,0.0053827064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015542307,0.000049002352,0.0005986692,0.0002721756,0.000038166967,0.00015253383,0.00020129677,0.20113894,0.027982624,0.57504743,0.014581824,0.17978193],"study_design_scores_gemma":[0.000028025233,0.00004554983,0.00019837733,0.000034105487,0.000012280528,0.00012482503,0.000034203953,0.89113307,0.0053461376,0.06658484,0.036430247,0.000028392715],"about_ca_topic_score_codex":0.0019905127,"about_ca_topic_score_gemma":0.0015939379,"teacher_disagreement_score":0.011665402,"about_ca_system_score_codex":0.0004142261,"about_ca_system_score_gemma":0.0009144433,"threshold_uncertainty_score":0.03902465},"labels":[],"label_agreement":null},{"id":"W2938239180","doi":"10.1007/978-3-030-04088-8_6","title":"The Derivative of the Matrix Geometric Mean with an Application to the Nonnegative Decomposition of Tensor Grids","year":2019,"lang":"en","type":"book-chapter","venue":"Springer INdAM series","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thomson Reuters (Canada)","funders":"","keywords":"Mathematics; Matrix (chemical analysis); Euclidean geometry; Tensor (intrinsic definition); Positive-definite matrix; Euclidean distance matrix; Decomposition; Cartesian tensor; Grid; Euclidean distance; Combinatorics; Pure mathematics; Geometry; Mathematical analysis; Tensor density; Tensor field; Exact solutions in general relativity; Physics","score_opus":0.007943527900854138,"score_gpt":0.23707648482570712,"score_spread":0.22913295692485297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2938239180","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009972578,0.0049805506,0.96566343,0.0013210783,0.0012152066,0.000018219163,0.00013847825,0.0002519757,0.01643849],"genre_scores_gemma":[0.32399076,0.01358128,0.6063559,0.0010282026,0.004291358,0.00013104193,0.00033747975,0.0014966602,0.04878734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995677,0.0001777641,0.000023083992,0.00009729954,0.00010485382,0.000029281568],"domain_scores_gemma":[0.9982834,0.00092126935,0.00015161152,0.00017417641,0.00030354058,0.00016605375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015396673,0.00097575155,0.0008901364,0.0016042137,0.0006203398,0.0021833563,0.0011993136,0.0012275418,0.004558387],"category_scores_gemma":[0.005550735,0.0005174088,0.0010088393,0.0022437996,0.0026582894,0.0030424397,0.0018111513,0.0026980964,0.00088183384],"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.000021217009,0.000019499554,0.00014032611,0.00008068186,0.000012813866,0.000058180725,0.0001088894,0.013112668,0.0017171935,0.9521928,0.0055482197,0.026987419],"study_design_scores_gemma":[0.0000044953877,0.000023515406,0.00023499546,0.00002894431,0.000010143776,0.00014231137,0.000038672126,0.18459085,0.00051554595,0.80138546,0.012997575,0.000027544467],"about_ca_topic_score_codex":0.0018062494,"about_ca_topic_score_gemma":0.002237837,"teacher_disagreement_score":0.004558387,"about_ca_system_score_codex":0.0010058269,"about_ca_system_score_gemma":0.0008021765,"threshold_uncertainty_score":0.015249312},"labels":[],"label_agreement":null},{"id":"W2942686117","doi":"10.1016/j.laa.2019.04.028","title":"Real higher rank numerical ranges and ellipsoids","year":2019,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Numerical range; Mathematics; Ellipsoid; Affine space; Range (aeronautics); Dimension (graph theory); Numerical analysis; Rank (graph theory); Hermitian matrix; Matrix (chemical analysis); Affine transformation; Combinatorics; Mathematical analysis; Geometry; Pure mathematics","score_opus":0.008765844271779928,"score_gpt":0.24066471994933475,"score_spread":0.23189887567755482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942686117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09360017,0.0027937985,0.8388582,0.0023428167,0.0003200791,0.00005623818,0.0006395599,0.00046083724,0.060928296],"genre_scores_gemma":[0.84611565,0.0017669003,0.13148746,0.00068129436,0.00064640236,0.00009689593,0.00059412245,0.00027773474,0.018333515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970636,0.0010239405,0.00018812585,0.00047094145,0.0010591364,0.00019417703],"domain_scores_gemma":[0.984909,0.008739404,0.0021875144,0.0014894758,0.0019506653,0.0007239515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026152334,0.00073879247,0.0007337655,0.0028383364,0.00088708027,0.004441486,0.0011159398,0.0008750299,0.012308633],"category_scores_gemma":[0.028232198,0.00052001764,0.00048805645,0.0022524258,0.0039642146,0.0057297847,0.0028587135,0.0026346822,0.002167958],"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.000055302004,0.000014524293,0.00035423183,0.00007903385,0.00000762655,0.000076854325,0.00016081412,0.005213524,0.00085777306,0.9732798,0.0024126284,0.017487952],"study_design_scores_gemma":[0.000007949705,0.000016721922,0.00021595231,0.000033366887,0.0000040785603,0.00025381488,0.000091983806,0.016429374,0.00083585887,0.97697544,0.0051115225,0.00002399525],"about_ca_topic_score_codex":0.00038559537,"about_ca_topic_score_gemma":0.00029876886,"teacher_disagreement_score":0.012308633,"about_ca_system_score_codex":0.00056133425,"about_ca_system_score_gemma":0.00033502004,"threshold_uncertainty_score":0.04117644},"labels":[],"label_agreement":null},{"id":"W2949136445","doi":"10.1002/jcd.21302","title":"New Results on D‐Optimal Matrices","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Construct (python library); Matrix (chemical analysis); Matrix analysis; Order (exchange); Algebra over a field","score_opus":0.026848153183403035,"score_gpt":0.2711175042299427,"score_spread":0.24426935104653966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949136445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32276478,0.001195484,0.5537001,0.0012577006,0.0006765695,0.00013150393,0.0005615703,0.000505682,0.11920659],"genre_scores_gemma":[0.84566087,0.0004930835,0.1417739,0.00068023853,0.00020009678,0.00011603786,0.0004572924,0.00011755031,0.010500962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992943,0.00015929795,0.000042899126,0.00011629185,0.00029597885,0.00009120585],"domain_scores_gemma":[0.9985977,0.0006161866,0.00014039704,0.00025235774,0.0002183439,0.00017514003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007641733,0.0006243527,0.00047943043,0.0010893549,0.00054639106,0.0012345909,0.0007203827,0.0005281699,0.008941305],"category_scores_gemma":[0.0030765089,0.00038127517,0.0003767203,0.0006296545,0.0013514792,0.0013567118,0.0013047869,0.0014929163,0.00090044114],"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.00018875903,0.000089439556,0.0005984781,0.00016571855,0.000013870443,0.00007042474,0.00009242672,0.017085452,0.0126342,0.9348735,0.0032568185,0.030930819],"study_design_scores_gemma":[0.000107275504,0.00022308614,0.0005044277,0.000059864724,0.000015273345,0.00022184057,0.00008341648,0.09939229,0.015337795,0.86761767,0.016399253,0.000037779184],"about_ca_topic_score_codex":0.0002795956,"about_ca_topic_score_gemma":0.00044233145,"teacher_disagreement_score":0.008941305,"about_ca_system_score_codex":0.0008313428,"about_ca_system_score_gemma":0.00062827993,"threshold_uncertainty_score":0.029911578},"labels":[],"label_agreement":null},{"id":"W2949701447","doi":"10.48550/arxiv.1208.1811","title":"Singular Vector Perturbation under Gaussian Noise","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"University of British Columbia","funders":"","keywords":"Gaussian noise; Singular value; Mathematics; Gaussian; Dimension (graph theory); Distribution (mathematics); Noise (video); Noise reduction; Applied mathematics; Mathematical analysis; Eigenvalues and eigenvectors; Algorithm; Computer science; Physics; Pure mathematics; Artificial intelligence","score_opus":0.049193868581700266,"score_gpt":0.18625085036658676,"score_spread":0.13705698178488648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949701447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079530366,0.00044538142,0.9126228,0.00070807105,0.00015729683,0.00002752626,0.00013862042,0.0003007024,0.0060692634],"genre_scores_gemma":[0.9324687,0.0012105012,0.054932576,0.00034972423,0.0004386738,0.00007726057,0.000364546,0.00017593845,0.009982117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880433,0.00036472283,0.000039390365,0.00023218861,0.00040597038,0.00015336549],"domain_scores_gemma":[0.99363786,0.0035401091,0.0007611364,0.000737393,0.0009951952,0.00032825948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018098361,0.0009797721,0.0009821759,0.0012291577,0.00049728196,0.00104409,0.0008148766,0.0008814197,0.0018349855],"category_scores_gemma":[0.013172582,0.00027024717,0.0005017708,0.00097569247,0.0024785555,0.0018767035,0.0016241728,0.0016045626,0.00052192324],"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.00021628886,0.000097087235,0.002166301,0.00018953675,0.00008703093,0.00063099066,0.00020550174,0.47010425,0.017892934,0.4774709,0.0032083031,0.027730767],"study_design_scores_gemma":[0.0000043775312,0.000028493849,0.0005392805,0.000012014934,0.0000069053694,0.00007405982,0.000026384489,0.9114121,0.0023613144,0.08516579,0.00035030823,0.000018992656],"about_ca_topic_score_codex":0.0015959486,"about_ca_topic_score_gemma":0.0010920668,"teacher_disagreement_score":0.0018349855,"about_ca_system_score_codex":0.00074684847,"about_ca_system_score_gemma":0.00068585697,"threshold_uncertainty_score":0.009571433},"labels":[],"label_agreement":null},{"id":"W2949724562","doi":"10.48550/arxiv.1402.5890","title":"A Test Matrix for an Inverse Eigenvalue Problem","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Bishop's University","funders":"","keywords":"Inverse; Eigenvalues and eigenvectors; Mathematics; Matrix (chemical analysis); Diagonal matrix; Square matrix; Symmetric matrix; Diagonal; Combinatorics; Pure mathematics; Applied mathematics; Physics; Geometry","score_opus":0.060527368881479866,"score_gpt":0.2089539985177754,"score_spread":0.14842662963629555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949724562","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0748059,0.00014592487,0.8893963,0.0014938974,0.00032584302,0.00010637878,0.00018308195,0.00036159527,0.033181127],"genre_scores_gemma":[0.65212876,0.00019877261,0.32011628,0.0005326805,0.00019726939,0.00044952673,0.00041161568,0.0004244378,0.0255406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995426,0.000157645,0.0000135557975,0.000057688096,0.00017532865,0.00005321744],"domain_scores_gemma":[0.9987072,0.0007395759,0.00009246065,0.00012499742,0.00019771457,0.00013799805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081725273,0.000757399,0.0006368928,0.00067688385,0.00087429024,0.001196905,0.0011261168,0.0020175714,0.011696162],"category_scores_gemma":[0.004724921,0.0003820529,0.00048573146,0.00037949922,0.002029251,0.0016235652,0.0019135316,0.0014281962,0.0017069556],"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.00028088628,0.00015611238,0.0007992806,0.00023180201,0.000029764153,0.0008412829,0.00027343823,0.1297515,0.02252512,0.80762213,0.0087175155,0.028771102],"study_design_scores_gemma":[0.000057687466,0.00010295737,0.00014385348,0.000025039551,0.0000065491604,0.00021451653,0.0001327211,0.762751,0.006650922,0.22542284,0.004456403,0.000035538116],"about_ca_topic_score_codex":0.00070427207,"about_ca_topic_score_gemma":0.0006309481,"teacher_disagreement_score":0.011696162,"about_ca_system_score_codex":0.00037450844,"about_ca_system_score_gemma":0.00072328397,"threshold_uncertainty_score":0.03912753},"labels":[],"label_agreement":null},{"id":"W2949767920","doi":"10.48550/arxiv.1606.00545","title":"Development of Krylov and AMG linear solvers for large-scale sparse matrices on GPUs","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Calgary","funders":"","keywords":"Krylov subspace; Solver; Computer science; Parallel computing; Computational science; Generalized minimal residual method; Sparse matrix; Linear system; CUDA; Acceleration; Iterative method; Algorithm; Mathematics; Chemistry; Programming language","score_opus":0.04889334877075371,"score_gpt":0.20066749259851036,"score_spread":0.15177414382775664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949767920","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009445219,0.00034181587,0.9833556,0.00030407563,0.00009006169,0.00007643071,0.00010373068,0.0010857511,0.0051972982],"genre_scores_gemma":[0.05893496,0.0004438738,0.9375073,0.0000872482,0.00005916156,0.00013496677,0.0002516901,0.00029333177,0.0022874775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933004,0.00015320945,0.000038085203,0.00008777897,0.00033816017,0.00005268268],"domain_scores_gemma":[0.9992624,0.00013156855,0.000053160125,0.00015785577,0.00032983528,0.00006520456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064307364,0.00068879215,0.0008407287,0.00060179696,0.000630683,0.0009339525,0.0013297974,0.00083317596,0.002552456],"category_scores_gemma":[0.0018673304,0.0004847003,0.0008086055,0.0009801917,0.00069462776,0.0012683378,0.0016093241,0.0018783164,0.0013051188],"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.00009380533,0.00014929574,0.002105587,0.0005711365,0.00012238348,0.0003279559,0.00041057283,0.42726535,0.048576437,0.20292632,0.0140372,0.30341396],"study_design_scores_gemma":[0.000016987318,0.000026082009,0.0001834933,0.000022940942,0.000006511063,0.0000846819,0.00002670735,0.9586572,0.007977131,0.015484187,0.01749964,0.000014474025],"about_ca_topic_score_codex":0.0030542442,"about_ca_topic_score_gemma":0.0033989183,"teacher_disagreement_score":0.0030542442,"about_ca_system_score_codex":0.0006129012,"about_ca_system_score_gemma":0.0014990023,"threshold_uncertainty_score":0.008538783},"labels":[],"label_agreement":null},{"id":"W2949824413","doi":"10.48550/arxiv.1212.6461","title":"On algebraic Riccati equations associated with M-Matrices","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algebraic Riccati equation; Riccati equation; Invertible matrix; Mathematics; Matrix (chemical analysis); Matrix difference equation; Pure mathematics; Linear-quadratic regulator; Algebraic solution; Algebraic number; Applied mathematics; Algebraic equation; Mathematical analysis; Optimal control; Differential equation; Mathematical optimization; Physics; Ordinary differential equation; Differential algebraic equation","score_opus":0.054896732537545206,"score_gpt":0.18507709258814367,"score_spread":0.13018036005059846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949824413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12167344,0.0013561997,0.84991616,0.001038289,0.00012760102,0.00007102939,0.00018333044,0.0001037006,0.025530232],"genre_scores_gemma":[0.86076504,0.0019412182,0.12187699,0.00030789772,0.00029649003,0.00016945401,0.0005568766,0.00009120807,0.01399493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994655,0.00022193485,0.000022465321,0.00009819827,0.00011483092,0.00007700955],"domain_scores_gemma":[0.99884015,0.0005981563,0.00024503516,0.00007499238,0.00016335085,0.00007826404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000762198,0.0013283252,0.00082106545,0.0010201358,0.0006873833,0.0009243367,0.0008750123,0.0011893768,0.0026505236],"category_scores_gemma":[0.0037715419,0.00034986145,0.00066790654,0.0012124128,0.0020293891,0.0013567499,0.001755048,0.001343426,0.00066156],"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.000041475956,0.000044243698,0.0009249535,0.00012784782,0.000031617827,0.00042099066,0.0002304223,0.12063564,0.004486261,0.86027527,0.0016508054,0.011130436],"study_design_scores_gemma":[0.000015706157,0.000028326327,0.00024823,0.000019516992,0.000008118292,0.00010269909,0.000059758462,0.5082598,0.0007764668,0.4887215,0.0017368577,0.000023082086],"about_ca_topic_score_codex":0.0030872372,"about_ca_topic_score_gemma":0.002646274,"teacher_disagreement_score":0.0030872372,"about_ca_system_score_codex":0.00062676764,"about_ca_system_score_gemma":0.00053996034,"threshold_uncertainty_score":0.008866906},"labels":[],"label_agreement":null},{"id":"W2950178340","doi":"10.48550/arxiv.0802.1375","title":"Autoconjugate representers for linear monotone operators","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Mathematics; Linear operators; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.04794840277327951,"score_gpt":0.2947098059941688,"score_spread":0.2467614032208893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950178340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11432404,0.00037294027,0.86414826,0.00042632633,0.000050156636,0.00003661435,0.000108143744,0.00016427826,0.02036923],"genre_scores_gemma":[0.8499897,0.00083845126,0.12492813,0.00028838924,0.00015156892,0.00016508951,0.0002221285,0.00018075477,0.02323571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994579,0.00016520818,0.000022650116,0.00010304053,0.00019621017,0.00005501163],"domain_scores_gemma":[0.9990337,0.00045863772,0.00014883128,0.00010191283,0.00017453406,0.000082290164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008989332,0.0004952196,0.00035672655,0.00084377045,0.00048831006,0.0013668837,0.0005511835,0.000859199,0.0052941297],"category_scores_gemma":[0.0026738974,0.00023880432,0.00064278167,0.00055262743,0.0013988541,0.0022802155,0.0013307629,0.0015407137,0.00095621235],"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.000017058492,0.000014386132,0.00013192944,0.00002592852,0.0000050457033,0.000048176367,0.00015739625,0.0066148485,0.0034760598,0.9782581,0.00055550033,0.010695741],"study_design_scores_gemma":[0.000011904081,0.00006842418,0.00014936154,0.000017444698,0.0000066748466,0.0002008245,0.000097079224,0.17063841,0.0034745703,0.81898904,0.0063258503,0.000020413481],"about_ca_topic_score_codex":0.00023757684,"about_ca_topic_score_gemma":0.00021062464,"teacher_disagreement_score":0.0052941297,"about_ca_system_score_codex":0.00074493245,"about_ca_system_score_gemma":0.0003525964,"threshold_uncertainty_score":0.017710686},"labels":[],"label_agreement":null},{"id":"W2950235445","doi":"10.48550/arxiv.1607.04514","title":"Black Box Linear Algebra: Extending Wiedemann's Analysis of a Sparse Matrix Preconditioner for Computations over Small Fields","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Calgary","funders":"","keywords":"Preconditioner; Linear algebra; Computation; Algebra over a field; Mathematics; Black box; Matrix (chemical analysis); Sparse matrix; Computational science; Computer science; Pure mathematics; Algorithm; Physics; Linear system; Mathematical analysis; Geometry; Artificial intelligence; Materials science","score_opus":0.057490937919829115,"score_gpt":0.23026533153951395,"score_spread":0.17277439361968483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950235445","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010785921,0.00013155965,0.9849963,0.00041198678,0.00007076396,0.000050459937,0.00005852244,0.00018461264,0.0033098862],"genre_scores_gemma":[0.358712,0.0008861487,0.6223534,0.0008345574,0.0006261977,0.000475839,0.00029119136,0.0005583973,0.015262318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977527,0.00087413343,0.00006375679,0.00027194945,0.0008632964,0.00017418363],"domain_scores_gemma":[0.99010205,0.0066405986,0.00057806383,0.0014538012,0.00088818924,0.00033726203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046889363,0.0012042056,0.0015517813,0.0018919278,0.000944841,0.0011064981,0.0015713591,0.0011192445,0.00456394],"category_scores_gemma":[0.015597604,0.0005616888,0.001298846,0.0013125077,0.0036994077,0.004867491,0.0022067535,0.003611889,0.0011218388],"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.0002608247,0.00011161894,0.0011116571,0.00015131508,0.000061469356,0.00015480285,0.00024931275,0.17245552,0.0060662874,0.77848464,0.002973733,0.03791883],"study_design_scores_gemma":[0.000027460459,0.00005808021,0.00015318349,0.000025167194,0.000009001324,0.000027033877,0.000016796652,0.60882586,0.0027751373,0.38512897,0.0029366552,0.000016631802],"about_ca_topic_score_codex":0.0012870547,"about_ca_topic_score_gemma":0.0012089487,"teacher_disagreement_score":0.0046889363,"about_ca_system_score_codex":0.0009529074,"about_ca_system_score_gemma":0.0011596517,"threshold_uncertainty_score":0.024797738},"labels":[],"label_agreement":null},{"id":"W2950321107","doi":"10.48550/arxiv.math/0406372","title":"Estimates of the remainder in Taylor's theorem using the Henstock--Kurzweil integral","year":2004,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 the Fraser Valley","funders":"","keywords":"Remainder; Chinese remainder theorem; Mathematics; Taylor series; Taylor's theorem; Pure mathematics; Mathematical economics; Arithmetic; Mathematical analysis; Discrete mathematics","score_opus":0.04029678136090467,"score_gpt":0.27862802579368456,"score_spread":0.2383312444327799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950321107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060535394,0.0019367206,0.9250785,0.00069053133,0.00024587207,0.000030892115,0.00016324967,0.0002910698,0.011027858],"genre_scores_gemma":[0.6420268,0.005164904,0.31921926,0.00036178,0.00089304714,0.00020310805,0.00062606327,0.000976656,0.030528428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906486,0.00035703098,0.000046828078,0.000117371186,0.00031815592,0.000095815034],"domain_scores_gemma":[0.99544454,0.002639638,0.0003670684,0.0004292432,0.0007669088,0.00035264716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004768069,0.0015622386,0.0010893937,0.0020363512,0.00066729,0.0014570437,0.0013181249,0.00075458357,0.00242935],"category_scores_gemma":[0.013292725,0.0003400098,0.0010064676,0.0008229649,0.0023809073,0.0038456407,0.0023240093,0.0026030666,0.0012570824],"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.00037462005,0.00006759454,0.0018793255,0.00038210244,0.00009519286,0.00037060922,0.00044779427,0.07405911,0.017023504,0.8590164,0.004149204,0.042134564],"study_design_scores_gemma":[0.000020782645,0.00014699128,0.0013190954,0.00010293185,0.00005347628,0.0002793054,0.00013446012,0.6141995,0.011168582,0.3642169,0.008269186,0.000088721295],"about_ca_topic_score_codex":0.0013918743,"about_ca_topic_score_gemma":0.0012285566,"teacher_disagreement_score":0.004768069,"about_ca_system_score_codex":0.0011876385,"about_ca_system_score_gemma":0.00074796274,"threshold_uncertainty_score":0.025216281},"labels":[],"label_agreement":null},{"id":"W2950455840","doi":"10.48550/arxiv.1602.03590","title":"Spectral characterization of matchings in graphs","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Calgary","funders":"","keywords":"Combinatorics; Mathematics; Skew; Matching (statistics); Characterization (materials science); Cograph; Graph; Discrete mathematics; Rank (graph theory); Line graph; Pathwidth; Computer science; Physics","score_opus":0.027701813949372454,"score_gpt":0.17052082229827956,"score_spread":0.1428190083489071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950455840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5992792,0.0006640606,0.362587,0.0008635605,0.00010824112,0.00007690347,0.00069233694,0.0005121657,0.03521649],"genre_scores_gemma":[0.97464174,0.00020578687,0.021569848,0.00011872132,0.00015972211,0.000059341837,0.00031100464,0.00007055598,0.0028632407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993011,0.00018419191,0.000036855385,0.00017554106,0.00019316774,0.0001091529],"domain_scores_gemma":[0.99702674,0.0013640298,0.00052010245,0.00034472896,0.00038506326,0.00035930198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006624862,0.0005148351,0.00040335962,0.002318395,0.0006089148,0.0015789157,0.00064648234,0.0007003386,0.004861649],"category_scores_gemma":[0.0046125683,0.00023627387,0.0003937298,0.0011235966,0.0015199237,0.0027696919,0.001287335,0.0007867084,0.000780073],"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.00029120382,0.00010490008,0.0022212316,0.00012904973,0.000019483781,0.00016140052,0.00045566537,0.023371967,0.028467305,0.9142694,0.0024179814,0.02809038],"study_design_scores_gemma":[0.000019491836,0.00006966967,0.0010660823,0.00003379019,0.00000919178,0.00026756522,0.00020234515,0.11093172,0.006821501,0.87726045,0.0032931147,0.000025089097],"about_ca_topic_score_codex":0.00023373011,"about_ca_topic_score_gemma":0.00017711832,"teacher_disagreement_score":0.004861649,"about_ca_system_score_codex":0.0007227623,"about_ca_system_score_gemma":0.0002917798,"threshold_uncertainty_score":0.016263843},"labels":[],"label_agreement":null},{"id":"W2950705130","doi":"10.26421/qic11.9-10-6","title":"Deciding unitary equivalence between matrix polynomials and sets of bipartite quantum states","year":2011,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Mathematics; Bipartite graph; Unitary matrix; Unitary state; Combinatorics; Equivalence (formal languages); Circular ensemble; Matrix (chemical analysis); Discrete mathematics; Complete bipartite graph; Pure mathematics; Graph","score_opus":0.03611720263423395,"score_gpt":0.2821634803894887,"score_spread":0.24604627775525473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950705130","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5889287,0.00032965795,0.39233616,0.0036647583,0.00016097717,0.0003442338,0.0010110793,0.001049679,0.0121747535],"genre_scores_gemma":[0.9484971,0.00010331679,0.048709717,0.0003036832,0.00011053998,0.00013252482,0.00088315085,0.00008912649,0.0011707561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98667824,0.005459875,0.0008934076,0.0027274808,0.0027427792,0.0014981194],"domain_scores_gemma":[0.9479779,0.04326391,0.0021756545,0.004223372,0.0014276131,0.00093160704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005468432,0.0004873663,0.0013328615,0.0011150568,0.0019990108,0.0043019913,0.0026816027,0.00263536,0.0062167128],"category_scores_gemma":[0.04150958,0.00071010675,0.0013511408,0.0013118009,0.0042324094,0.010851544,0.005071729,0.0038687552,0.0005596501],"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.00232135,0.00085952855,0.0055781915,0.0004858407,0.00023713327,0.00083710067,0.0015522855,0.0751431,0.0135293165,0.7980533,0.006019103,0.0953837],"study_design_scores_gemma":[0.00021302076,0.00017499163,0.0007693767,0.000031608884,0.000052759882,0.00022527603,0.0004022559,0.17498037,0.01239332,0.80923927,0.0014647971,0.000052989366],"about_ca_topic_score_codex":0.0012710036,"about_ca_topic_score_gemma":0.001121043,"teacher_disagreement_score":0.0062167128,"about_ca_system_score_codex":0.002012085,"about_ca_system_score_gemma":0.0016172719,"threshold_uncertainty_score":0.028920174},"labels":[],"label_agreement":null},{"id":"W2951348896","doi":"10.48550/arxiv.math/0103061","title":"Extension dimensional approximation theorem","year":2001,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Extension (predicate logic); Mathematics; Mathematical economics; Calculus (dental); Computer science; Medicine","score_opus":0.03426694512156317,"score_gpt":0.26023015333646965,"score_spread":0.22596320821490648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951348896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22384357,0.0013107877,0.69967616,0.0019724346,0.00028673856,0.00010082523,0.00077586726,0.000435303,0.07159829],"genre_scores_gemma":[0.91474164,0.0008105177,0.06319457,0.0005192153,0.00014960048,0.00019142241,0.00075383595,0.00008680186,0.019552309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926347,0.000118750584,0.000036178943,0.00020096413,0.0002577624,0.00012282254],"domain_scores_gemma":[0.9989334,0.00045318276,0.00008407225,0.00018423602,0.00020288647,0.00014223886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000853754,0.0004854401,0.0007343919,0.00079276867,0.0009339325,0.0017855793,0.0011806857,0.00071151135,0.006174678],"category_scores_gemma":[0.004578841,0.00023605816,0.00086703914,0.0009906787,0.0012553767,0.0035394211,0.003049235,0.0023684022,0.0006814532],"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.00006290819,0.00002117139,0.0010151492,0.000067856825,0.000023288176,0.00008257226,0.00023716567,0.0041035535,0.0017734681,0.9747205,0.0019752264,0.015917208],"study_design_scores_gemma":[0.000028162249,0.000092232745,0.0013416273,0.000051315084,0.000032907865,0.0005662244,0.00030292524,0.122476235,0.0028484657,0.8507859,0.021443078,0.000030940388],"about_ca_topic_score_codex":0.0011633493,"about_ca_topic_score_gemma":0.0006739968,"teacher_disagreement_score":0.006174678,"about_ca_system_score_codex":0.0011451255,"about_ca_system_score_gemma":0.0004553285,"threshold_uncertainty_score":0.020656347},"labels":[],"label_agreement":null},{"id":"W2951512882","doi":"10.82308/8903","title":"Electron transport in nano devices: mathematical introduction and preconditioning","year":2009,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","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":"McGill University","keywords":"Eigenvalues and eigenvectors; Iterative method; Computation; Applied mathematics; Physics; Mathematics; Density matrix; Resolvent; Algorithm; Computer science; Quantum mechanics; Mathematical analysis","score_opus":0.008518996406669444,"score_gpt":0.21895591708011033,"score_spread":0.21043692067344089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951512882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039423127,0.010911192,0.941143,0.0036898607,0.0013142816,0.0001118187,0.00025713112,0.00021201943,0.038418308],"genre_scores_gemma":[0.1656848,0.044734705,0.71129626,0.0038460246,0.003616458,0.0011101307,0.00044479885,0.0006103498,0.06865635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996146,0.000101435915,0.000028328861,0.00006836732,0.00016264786,0.000024566814],"domain_scores_gemma":[0.99957377,0.00022616576,0.00003674761,0.000073706884,0.00007652149,0.000013139841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063919264,0.0006429122,0.00059415307,0.00060980517,0.00067815586,0.0011182751,0.00088221923,0.001306679,0.008041016],"category_scores_gemma":[0.0017174059,0.00042429063,0.00071581855,0.00092302624,0.0016152944,0.0028153236,0.0013083558,0.002159881,0.0020265672],"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.000014837377,0.000023951965,0.000080520425,0.00030359792,0.0000061328174,0.00010380533,0.00015057852,0.028444128,0.0026445063,0.93928903,0.006371143,0.022567842],"study_design_scores_gemma":[0.000011183872,0.000048246893,0.00015880889,0.00012636196,0.0000071480517,0.00016550593,0.000041537238,0.1576441,0.0015430537,0.7542211,0.086009994,0.000022917657],"about_ca_topic_score_codex":0.00087270176,"about_ca_topic_score_gemma":0.00083535013,"teacher_disagreement_score":0.008041016,"about_ca_system_score_codex":0.0005468777,"about_ca_system_score_gemma":0.00062356866,"threshold_uncertainty_score":0.026899934},"labels":[],"label_agreement":null},{"id":"W2951744002","doi":"10.4230/lipics.itcs.2023.69","title":"A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"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":"Air Force Office of Scientific Research; European Commission; Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Microsoft Research; National Science Foundation","keywords":"Solver; Inverse; Diagonally dominant matrix; Linear system; System of linear equations; Matrix (chemical analysis); Sequence (biology); Mathematics; Moore–Penrose pseudoinverse; Product (mathematics); Algorithm; Combinatorics; Sparse matrix; Graph; Inverse problem; Applied mathematics; Mathematical optimization; Mathematical analysis; Physics; Pure mathematics; Geometry; Invertible matrix","score_opus":0.04530350033200764,"score_gpt":0.19394453739191644,"score_spread":0.1486410370599088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951744002","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024741288,0.00033966752,0.9626494,0.0005348982,0.00012145746,0.0002400829,0.0001812386,0.003555853,0.007636105],"genre_scores_gemma":[0.22556804,0.00012702122,0.765434,0.000553623,0.000102529964,0.00050780777,0.00095631025,0.00058589375,0.0061647655],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993,0.00013487377,0.00004143316,0.00020099871,0.00020363486,0.000119065306],"domain_scores_gemma":[0.9986091,0.0008055119,0.00008875377,0.00017664972,0.00021018887,0.00010967134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076650205,0.0014633572,0.0013319288,0.0012669765,0.000885756,0.0014613242,0.0023800114,0.0021017753,0.013095344],"category_scores_gemma":[0.0053247623,0.00067854865,0.0009150774,0.0013381909,0.0008973586,0.0021482583,0.0019907174,0.002526466,0.0024295591],"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.00042641457,0.0005273047,0.0014086417,0.00039535784,0.00008274183,0.0001987969,0.00029783556,0.44465467,0.006583808,0.06609478,0.02499592,0.45433372],"study_design_scores_gemma":[0.00009276657,0.00006825796,0.000067562716,0.000011058105,0.000008318901,0.00004296006,0.000035494937,0.9664338,0.00071973144,0.031010186,0.0014994985,0.000010243884],"about_ca_topic_score_codex":0.0045186384,"about_ca_topic_score_gemma":0.0064366567,"teacher_disagreement_score":0.013095344,"about_ca_system_score_codex":0.001117635,"about_ca_system_score_gemma":0.001707079,"threshold_uncertainty_score":0.04380828},"labels":[],"label_agreement":null},{"id":"W2951919232","doi":"10.2514/6.2019-2954","title":"Multidimensional Diagonal-Norm Summation-by-Parts Operators on Quadrilateral Elements","year":2019,"lang":"en","type":"article","venue":"AIAA Aviation 2019 Forum","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quadrilateral; Diagonal; Norm (philosophy); Mathematics; Algebra over a field; Mathematical analysis; Computer science; Pure mathematics; Engineering; Structural engineering; Geometry; Finite element method","score_opus":0.0048491574316070615,"score_gpt":0.22572047437324094,"score_spread":0.2208713169416339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951919232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013197591,0.00027327426,0.9683248,0.00023698751,0.00043099263,0.000042322015,0.00009706887,0.0002114735,0.017185478],"genre_scores_gemma":[0.28188372,0.00085249834,0.6768157,0.00057795725,0.00029965432,0.00020352905,0.00049050216,0.00078237406,0.038094115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992945,0.00026305436,0.00004262082,0.00006770442,0.0002720102,0.000060148803],"domain_scores_gemma":[0.99882084,0.00044117527,0.000078199184,0.00022880115,0.00033414576,0.000096862575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012302746,0.00088301685,0.0006682628,0.0009309457,0.0004846728,0.0018399548,0.0016340759,0.0009577368,0.00917595],"category_scores_gemma":[0.0031664122,0.00032074627,0.00052349444,0.0013705179,0.0014001029,0.0017864225,0.0016995708,0.001657849,0.0018821724],"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.00013889546,0.00010469712,0.00024375238,0.00015004308,0.000028811017,0.00013009453,0.00022527418,0.054949995,0.007133825,0.8528946,0.0066206027,0.07737937],"study_design_scores_gemma":[0.000019679417,0.000039123723,0.00011002258,0.000032200627,0.000008922896,0.00008334336,0.000073194795,0.6047173,0.0036374028,0.38111895,0.01013592,0.000023973009],"about_ca_topic_score_codex":0.00086068735,"about_ca_topic_score_gemma":0.0018971737,"teacher_disagreement_score":0.00917595,"about_ca_system_score_codex":0.00057831104,"about_ca_system_score_gemma":0.0005635641,"threshold_uncertainty_score":0.03069663},"labels":[],"label_agreement":null},{"id":"W2951998030","doi":"10.1051/m2an/2018048/pdf","title":"Nonintrusive approximation of parametrized limits of matrix power algorithms – application to matrix inverses and log-determinants","year":2019,"lang":"en","type":"article","venue":"Springer Link (Chiba Institute of Technology)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Safran Electronics (Canada)","funders":"","keywords":"Mathematics; Interpolation (computer graphics); Logarithm; Inverse; Matrix (chemical analysis); Applied mathematics; Approximation error; Algorithm; Affine transformation; Mathematical analysis; Computer science; Pure mathematics; Geometry","score_opus":0.009443246146090777,"score_gpt":0.2577361175949487,"score_spread":0.24829287144885792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951998030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01870506,0.00021321437,0.97845024,0.00009090737,0.000026314692,0.0000200362,0.000016464328,0.0003436372,0.0021341373],"genre_scores_gemma":[0.5316617,0.0005305642,0.4615618,0.00010992136,0.00009127883,0.00011598656,0.00013011377,0.0005972284,0.0052013923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998654,0.00063703075,0.000055112203,0.00014778922,0.0004344007,0.000071588845],"domain_scores_gemma":[0.98895967,0.0074781477,0.00083664776,0.0018293239,0.00068250176,0.00021366781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002496147,0.00079534785,0.0005557482,0.0010688457,0.00032179683,0.0015642985,0.0014257168,0.00089058396,0.0028702603],"category_scores_gemma":[0.024798939,0.0004129042,0.00046641435,0.0006797383,0.0016940864,0.003112507,0.0022826174,0.0019495914,0.00074355584],"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.00017683645,0.00014269189,0.0019021512,0.0002785046,0.00005825038,0.0004100252,0.00047702852,0.49679253,0.012962903,0.39385846,0.0016832008,0.091257386],"study_design_scores_gemma":[0.0000026998991,0.0000167485,0.00008864453,0.00001284936,0.0000024084707,0.000060358725,0.00000972592,0.9659548,0.0025474476,0.030653311,0.00064457586,0.0000064844908],"about_ca_topic_score_codex":0.00054632075,"about_ca_topic_score_gemma":0.0006281674,"teacher_disagreement_score":0.0028702603,"about_ca_system_score_codex":0.00062563136,"about_ca_system_score_gemma":0.0005403975,"threshold_uncertainty_score":0.013201058},"labels":[],"label_agreement":null},{"id":"W2952021459","doi":"10.48550/arxiv.0810.3343","title":"The rate of convergence of the Walk on Spheres Algorithm","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Toronto","funders":"","keywords":"SPHERES; Convergence (economics); Rate of convergence; Algorithm; Computer science; Mathematics; Physics; Economics; Computer security; Key (lock); Macroeconomics","score_opus":0.026590463191354736,"score_gpt":0.2461943819671475,"score_spread":0.21960391877579274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952021459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13286334,0.0018449815,0.85144794,0.0011533406,0.00018655915,0.00022736043,0.00023235426,0.0008226988,0.011221478],"genre_scores_gemma":[0.77734,0.0021295324,0.2059102,0.00039719086,0.00026168404,0.0006605265,0.0007368337,0.0010226513,0.011541351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99483573,0.0025285024,0.00022623863,0.0007191307,0.0012110703,0.00047925196],"domain_scores_gemma":[0.94708914,0.039580524,0.0025873694,0.0039916774,0.0051444895,0.0016068636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012141833,0.00127509,0.0015730604,0.0023619898,0.0010490833,0.00265932,0.0027618508,0.0018355376,0.0051219016],"category_scores_gemma":[0.07920013,0.0004927797,0.0010997651,0.001112954,0.0033307201,0.00567026,0.003373278,0.0032577745,0.0012833709],"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.0008215788,0.00014763414,0.008724256,0.00047889605,0.00024948295,0.00025063287,0.0007849091,0.36391485,0.008181098,0.5608603,0.004225278,0.05136116],"study_design_scores_gemma":[0.00003193167,0.00014230053,0.00067121186,0.0000676947,0.0000300406,0.00014297824,0.00009908177,0.9113352,0.0049320743,0.08078033,0.0017247348,0.000042487038],"about_ca_topic_score_codex":0.0017692476,"about_ca_topic_score_gemma":0.0008811963,"teacher_disagreement_score":0.012141833,"about_ca_system_score_codex":0.0017382114,"about_ca_system_score_gemma":0.0017175621,"threshold_uncertainty_score":0.06421292},"labels":[],"label_agreement":null},{"id":"W2952088158","doi":"10.1108/hff-10-2018-0586","title":"GCRO with dynamic deflated restarting for solving adjoint systems of equations for aerodynamic shape optimization","year":2019,"lang":"en","type":"article","venue":"International Journal of Numerical Methods for Heat &amp Fluid Flow","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":"","keywords":"Generalized minimal residual method; Solver; Mathematics; Convergence (economics); Applied mathematics; Mathematical optimization; Computer science; Residual; Algorithm","score_opus":0.023997513755224506,"score_gpt":0.3486275720352935,"score_spread":0.32463005828006897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952088158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013837937,0.00017929058,0.98134434,0.0000823273,0.00003925648,0.00004503933,0.00002996209,0.0006548615,0.0037870577],"genre_scores_gemma":[0.27864888,0.0002147161,0.71485317,0.00015462885,0.000050889794,0.0002162609,0.00018016156,0.00062405167,0.0050572515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996816,0.000109496556,0.000013798267,0.00003806537,0.00013380827,0.000023226436],"domain_scores_gemma":[0.9995993,0.00013623865,0.00006947422,0.0000890056,0.00008698369,0.000019058916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043308435,0.00053032197,0.00041348574,0.00033182453,0.00033547453,0.0004859679,0.0006829177,0.0005341692,0.0030778341],"category_scores_gemma":[0.0011648245,0.00025074772,0.0005296905,0.00026104992,0.00056444947,0.00047594888,0.0008946429,0.0009017337,0.00095148984],"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.00019309013,0.00012063078,0.00130991,0.00028089012,0.00007643345,0.00021620122,0.00021946352,0.71105486,0.041164637,0.035279244,0.0031838084,0.20690078],"study_design_scores_gemma":[0.000011552907,0.000047113364,0.00016572347,0.000013144013,0.000004730712,0.000054741402,0.000014885798,0.98787457,0.004596488,0.0020647077,0.005140145,0.000012172421],"about_ca_topic_score_codex":0.002297973,"about_ca_topic_score_gemma":0.002738201,"teacher_disagreement_score":0.0030778341,"about_ca_system_score_codex":0.00024765683,"about_ca_system_score_gemma":0.0006297424,"threshold_uncertainty_score":0.010296404},"labels":[],"label_agreement":null},{"id":"W2952468968","doi":"10.48550/arxiv.1112.5717","title":"Rank-profile revealing Gaussian elimination and the CUP matrix decomposition","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"University of Waterloo","funders":"","keywords":"Gaussian elimination; Matrix (chemical analysis); Rank (graph theory); Algorithm; Matrix decomposition; Block matrix; Gaussian; Mathematics; Computation; Inverse; Transformation (genetics); Transformation matrix; Block (permutation group theory); Matrix multiplication; Combinatorics; Geometry","score_opus":0.03717078215085931,"score_gpt":0.20445964174709738,"score_spread":0.16728885959623807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952468968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013707761,0.00021599048,0.98063296,0.00019947831,0.00004932267,0.000065415734,0.00013537676,0.00069675915,0.004296948],"genre_scores_gemma":[0.31151417,0.0007108802,0.67685246,0.0004231082,0.00021591093,0.00024705232,0.00087852095,0.0004787444,0.0086792195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880075,0.00029891336,0.00004684535,0.0001689223,0.00047681885,0.00020779601],"domain_scores_gemma":[0.9980075,0.0006621135,0.00015031925,0.0005988778,0.00047783848,0.00010348677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001413231,0.0009772182,0.0008513997,0.0016728473,0.0010153034,0.0017168042,0.00085924775,0.00054726953,0.004123181],"category_scores_gemma":[0.0068194126,0.00034442014,0.000910636,0.0022999626,0.0021045704,0.0029080415,0.0021440652,0.0017007387,0.002036482],"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.00022816364,0.000097911616,0.00080836593,0.00013940223,0.000029230523,0.0001627407,0.00027209168,0.03832048,0.0051424094,0.7218836,0.012583078,0.22033255],"study_design_scores_gemma":[0.00003220651,0.00008906014,0.00042537192,0.00004198306,0.00002453102,0.0003271776,0.00011953875,0.39696303,0.01719447,0.5721176,0.012613298,0.000051701794],"about_ca_topic_score_codex":0.0017509183,"about_ca_topic_score_gemma":0.0016289388,"teacher_disagreement_score":0.004123181,"about_ca_system_score_codex":0.00079559116,"about_ca_system_score_gemma":0.0015495538,"threshold_uncertainty_score":0.013793409},"labels":[],"label_agreement":null},{"id":"W2952596876","doi":"10.48550/arxiv.math/0604229","title":"On Pseudospectra of Matrix Polynomials and their Boundaries","year":2006,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Leverhulme Trust","keywords":"Mathematics; Matrix (chemical analysis); Pure mathematics; Orthogonal polynomials; Algebra over a field; Mathematical analysis; Materials science","score_opus":0.02574397387807101,"score_gpt":0.18234512288540541,"score_spread":0.1566011490073344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952596876","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.634028,0.0020060954,0.33878794,0.0010966742,0.00010274617,0.000056851673,0.00021739109,0.00027897628,0.02342531],"genre_scores_gemma":[0.9645041,0.0011285581,0.029675767,0.00018523658,0.00032560268,0.000070675065,0.000262599,0.00013407602,0.003713361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802727,0.000580922,0.0000813767,0.00036067478,0.0006949246,0.00025475453],"domain_scores_gemma":[0.97861195,0.014446347,0.0024089923,0.0012129763,0.0015234472,0.001796171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022651537,0.00086610357,0.0009218441,0.0038594864,0.0014293765,0.0023140393,0.0011722215,0.0015363744,0.0049739014],"category_scores_gemma":[0.021442724,0.0004743087,0.00060577044,0.0016865556,0.0043633142,0.0071249325,0.0033153284,0.002897146,0.00059249025],"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.00017681948,0.00007237085,0.0026734474,0.00015639408,0.00001572706,0.00029493627,0.0007632179,0.007795598,0.010046211,0.9579593,0.00082207756,0.0192238],"study_design_scores_gemma":[0.000026316038,0.00016097068,0.003086653,0.00006975068,0.00001638991,0.00043880608,0.00033189252,0.0795825,0.0034914108,0.91033584,0.0024090195,0.000050466904],"about_ca_topic_score_codex":0.000437467,"about_ca_topic_score_gemma":0.00028738458,"teacher_disagreement_score":0.0049739014,"about_ca_system_score_codex":0.0007008624,"about_ca_system_score_gemma":0.0003200248,"threshold_uncertainty_score":0.016639292},"labels":[],"label_agreement":null},{"id":"W2952741639","doi":"10.48550/arxiv.1701.00396","title":"Time and space efficient generators for quasiseparable matrices","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Linear algebra; Eigenvalues and eigenvectors; Matrix (chemical analysis); Mathematics; Matrix multiplication; Rank (graph theory); Algebra over a field; Block matrix; QR decomposition; Vector space; Numerical linear algebra; Matrix analysis; Quadratic equation; Linear system; Pure mathematics; Combinatorics","score_opus":0.03853908712855347,"score_gpt":0.1958313798723515,"score_spread":0.15729229274379802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952741639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053094696,0.00023946879,0.93363035,0.0002687777,0.00011584694,0.00009217741,0.0003532411,0.0005785297,0.01162682],"genre_scores_gemma":[0.5713327,0.00040214547,0.3981693,0.00021877201,0.00021283427,0.000405407,0.0012155651,0.0005826464,0.027460657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992667,0.00016206522,0.000046366888,0.00013084474,0.00028903043,0.0001051305],"domain_scores_gemma":[0.99850804,0.00054281973,0.00018930141,0.00041641746,0.0002266104,0.00011680287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005173834,0.0005354954,0.00038914487,0.0008552664,0.00061123306,0.001814456,0.0009360786,0.00057757134,0.011503204],"category_scores_gemma":[0.003606767,0.00032760148,0.00054736424,0.0008199344,0.0014706966,0.0024853365,0.0019129207,0.0012690345,0.0030464416],"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.00016731762,0.000063270716,0.00038917724,0.00009631765,0.000009381118,0.00010082497,0.0003119875,0.025979567,0.009411052,0.9035291,0.0044275774,0.055514522],"study_design_scores_gemma":[0.000046003992,0.00008071419,0.00015977265,0.00001985262,0.0000049050336,0.00013353248,0.00008525036,0.21266809,0.0064967694,0.77138734,0.008893354,0.000024444676],"about_ca_topic_score_codex":0.00056364416,"about_ca_topic_score_gemma":0.0010284582,"teacher_disagreement_score":0.011503204,"about_ca_system_score_codex":0.0006056992,"about_ca_system_score_gemma":0.0006598017,"threshold_uncertainty_score":0.03848201},"labels":[],"label_agreement":null},{"id":"W2952869115","doi":"10.11575/prism/30593","title":"Selecting Algorithms for Black Box Matrices: Checking for Matrix Properties That Can Simplify Computations","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"University of Calgary","funders":"","keywords":"Computation; Matrix (chemical analysis); Black box; Algorithm; Computer science; Field (mathematics); Selection (genetic algorithm); Mathematics; Artificial intelligence","score_opus":0.1164054762990682,"score_gpt":0.2353359451568668,"score_spread":0.1189304688577986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952869115","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024798043,0.00016636009,0.96601003,0.00034291,0.00015383726,0.00026921477,0.00011637899,0.0042164777,0.003926759],"genre_scores_gemma":[0.26998678,0.00022696426,0.7227353,0.00038889912,0.00016345253,0.00050752005,0.0006017514,0.0026303218,0.0027590073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98767555,0.004114229,0.0008448772,0.0020734041,0.0043031555,0.0009887558],"domain_scores_gemma":[0.9246569,0.039822005,0.0065175598,0.019222962,0.008515543,0.0012650727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0131557025,0.0020715077,0.0017739445,0.0016915986,0.002364615,0.0046255277,0.0026363602,0.00246063,0.011778236],"category_scores_gemma":[0.09244077,0.0014061996,0.0014571798,0.0011971833,0.0035389438,0.008897707,0.003575862,0.0041282554,0.0054924693],"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.002558776,0.00074506825,0.009435194,0.001234975,0.00023036059,0.001186766,0.00091676693,0.12640263,0.09185961,0.41476837,0.023187282,0.32747427],"study_design_scores_gemma":[0.0002088906,0.00034399304,0.0006279057,0.00026093415,0.000058485373,0.0003496585,0.00021750186,0.5319049,0.085321404,0.37070253,0.0099051725,0.00009872555],"about_ca_topic_score_codex":0.00078778714,"about_ca_topic_score_gemma":0.0010793617,"teacher_disagreement_score":0.0131557025,"about_ca_system_score_codex":0.0015142809,"about_ca_system_score_gemma":0.0041732355,"threshold_uncertainty_score":0.06957483},"labels":[],"label_agreement":null},{"id":"W2953179741","doi":"10.48550/arxiv.math/0404347","title":"Generalized Hadamard Product and the Derivatives of Spectral Functions","year":2004,"lang":"en","type":"preprint","venue":"ArXiv.org","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 Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hadamard transform; Product (mathematics); Hadamard product; Mathematics; Mathematical economics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.02831140877572498,"score_gpt":0.24947450503755583,"score_spread":0.22116309626183084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953179741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1405841,0.00224095,0.82769406,0.001004781,0.00032363832,0.000028722397,0.00012165998,0.00031566524,0.02768636],"genre_scores_gemma":[0.8821034,0.0012231751,0.10298672,0.00032904596,0.00036207846,0.000051151488,0.00011500396,0.00020768755,0.012621708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991673,0.00025152642,0.000042587035,0.00014578224,0.00028301406,0.0001097272],"domain_scores_gemma":[0.9980798,0.0007447864,0.00023273198,0.0002977809,0.00045814167,0.00018676888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013217228,0.0006003341,0.00062170945,0.0016309618,0.00073037704,0.0020513027,0.0010884766,0.0010441049,0.003219309],"category_scores_gemma":[0.00534662,0.0002836553,0.0005575306,0.0011729226,0.0027962949,0.004340869,0.0010821976,0.0014321778,0.0006710491],"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.000014061007,0.0000086940945,0.00016154737,0.000023950466,0.0000048794013,0.0000787494,0.00010657455,0.0068799728,0.00075233943,0.9855747,0.0003855094,0.006009043],"study_design_scores_gemma":[0.0000046904706,0.000023011778,0.00020236416,0.000015253171,0.0000044568433,0.00015220194,0.000051850122,0.090844825,0.00091594004,0.90412635,0.0036351427,0.00002394654],"about_ca_topic_score_codex":0.0008427997,"about_ca_topic_score_gemma":0.0005241093,"teacher_disagreement_score":0.003219309,"about_ca_system_score_codex":0.00097118516,"about_ca_system_score_gemma":0.00056533306,"threshold_uncertainty_score":0.010769665},"labels":[],"label_agreement":null},{"id":"W2953398301","doi":"10.13001/1081-3810.3839","title":"Non-sparse Companion Matrices","year":2019,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","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":"Redeemer University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Companion matrix; Mathematics; Matrix (chemical analysis); Simple (philosophy); Integer matrix; Realization (probability); Matrix analysis; Combinatorics; Polynomial; Polynomial matrix; Discrete mathematics; Matrix polynomial; Algebra over a field; Pure mathematics; Symmetric matrix; Nonnegative matrix; Eigenvalues and eigenvectors; Mathematical analysis","score_opus":0.006020204244693108,"score_gpt":0.23034148273373148,"score_spread":0.22432127848903838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953398301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1423262,0.00044149873,0.82763314,0.00047560403,0.00014221334,0.00009983521,0.00035637798,0.00069223775,0.027832868],"genre_scores_gemma":[0.82093245,0.00046570232,0.15868197,0.00025863198,0.00018706592,0.00012119942,0.0008468643,0.00019438741,0.018311674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992519,0.00015085733,0.000044256318,0.00018379348,0.0002605932,0.00010849485],"domain_scores_gemma":[0.99734724,0.0008713775,0.00038678755,0.00068481546,0.0004993455,0.00021040028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054635404,0.0006507207,0.00048766672,0.00057682063,0.0006162787,0.00096204254,0.0006661907,0.00073590444,0.0076052686],"category_scores_gemma":[0.005501896,0.00032849438,0.0003305483,0.0005303457,0.0010235669,0.0021789705,0.0012429287,0.0013089298,0.0019166898],"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.00018301286,0.00006639016,0.0007891034,0.00020285013,0.000019131072,0.00057220575,0.00036790204,0.021197556,0.028053476,0.8846432,0.0059012324,0.05800381],"study_design_scores_gemma":[0.000038409136,0.0002109145,0.00083352136,0.000035822562,0.000015346706,0.0011778144,0.00019783787,0.1503706,0.017440211,0.80757904,0.022048054,0.000052458527],"about_ca_topic_score_codex":0.00026243116,"about_ca_topic_score_gemma":0.00047564344,"teacher_disagreement_score":0.0076052686,"about_ca_system_score_codex":0.0003811814,"about_ca_system_score_gemma":0.0005135992,"threshold_uncertainty_score":0.025442123},"labels":[],"label_agreement":null},{"id":"W2955754353","doi":"10.33434/cams.512796","title":"Standard and Corrected Numerical Differentiation Formulae","year":2019,"lang":"en","type":"article","venue":"Communications in Advanced Mathematical Sciences","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":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Numerical differentiation; Truncation error; Truncation (statistics); Numerical integration; Mathematics; Automatic differentiation; Numerical analysis; Applied mathematics; Backward differentiation formula; Order (exchange); Calculus (dental); Mathematical analysis; Algorithm; Statistics; Differential equation; Computation; Ordinary differential equation","score_opus":0.02114197047406183,"score_gpt":0.3095503982354236,"score_spread":0.2884084277613617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955754353","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045325146,0.0031747585,0.9466612,0.0008484977,0.003845465,0.00019828649,0.0006000029,0.0013873893,0.038751934],"genre_scores_gemma":[0.11511931,0.0040599084,0.82435703,0.0014445792,0.0010239449,0.00050487486,0.00092430494,0.0016569578,0.050909042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99466175,0.00086297333,0.0004456765,0.0006275577,0.0031694814,0.00023253317],"domain_scores_gemma":[0.9940719,0.0013345071,0.00039205508,0.001587705,0.0024992772,0.00011466535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00328106,0.0010867759,0.00093326444,0.0020508214,0.0007832622,0.0030249848,0.0028920427,0.0020993024,0.0145181315],"category_scores_gemma":[0.024189677,0.0003989177,0.0009055526,0.0018210887,0.0017770437,0.0031672644,0.0017168844,0.0028487511,0.008257786],"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.000112222246,0.000046014207,0.0004828944,0.0004904832,0.000029149862,0.0002825082,0.00017145566,0.022117443,0.009351613,0.80094934,0.03486196,0.13110496],"study_design_scores_gemma":[0.000057695255,0.0001324857,0.0005685565,0.00040637024,0.000069938076,0.001219926,0.00010126044,0.20949194,0.020210512,0.53161,0.23597182,0.00015941476],"about_ca_topic_score_codex":0.0010664206,"about_ca_topic_score_gemma":0.0009820425,"teacher_disagreement_score":0.0145181315,"about_ca_system_score_codex":0.0014026567,"about_ca_system_score_gemma":0.0017175686,"threshold_uncertainty_score":0.04856801},"labels":[],"label_agreement":null},{"id":"W2962704689","doi":"10.13001/1081-3810.3436","title":"Refined Inertia of Matrix Patterns","year":2017,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Redeemer University","funders":"","keywords":"Digraph; Mathematics; Eigenvalues and eigenvectors; Matrix (chemical analysis); Class (philosophy); Order (exchange); Property (philosophy); Combinatorics; Inertia; Matrix analysis; Pure mathematics; Computer science; Physics; Classical mechanics; Artificial intelligence","score_opus":0.009638604857215034,"score_gpt":0.27288219778819467,"score_spread":0.26324359293097965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962704689","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71849626,0.00016698717,0.25416264,0.00015260167,0.00007400138,0.00005410454,0.00012444002,0.00030247305,0.026466452],"genre_scores_gemma":[0.9686309,0.000102774255,0.024266075,0.000060722745,0.000053110456,0.000047473208,0.00013620466,0.00009865734,0.006604221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994974,0.0000792334,0.000036549296,0.00011080679,0.00013776982,0.00013816654],"domain_scores_gemma":[0.9985864,0.0003319355,0.0002883468,0.00039345078,0.00021227992,0.00018768203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033984258,0.0003425293,0.00036348196,0.000704262,0.0006224897,0.0009071261,0.00048614418,0.00044542283,0.006261135],"category_scores_gemma":[0.002830653,0.0003104672,0.00043063387,0.00040410206,0.0016929319,0.0021848413,0.0012854408,0.00071129476,0.00070867693],"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.0002089991,0.000047736983,0.0034213408,0.00009479094,0.00001750669,0.00055317837,0.00074054266,0.019237846,0.033567447,0.9124247,0.0012163938,0.028469468],"study_design_scores_gemma":[0.000055471774,0.0002888045,0.0040971977,0.000040005343,0.000023295619,0.0007023122,0.000406465,0.117227405,0.013944328,0.8524404,0.010704699,0.00006957654],"about_ca_topic_score_codex":0.0005562073,"about_ca_topic_score_gemma":0.00076934317,"teacher_disagreement_score":0.006261135,"about_ca_system_score_codex":0.00028054137,"about_ca_system_score_gemma":0.0002881061,"threshold_uncertainty_score":0.020945609},"labels":[],"label_agreement":null},{"id":"W2963248211","doi":"10.4153/cmb-2015-049-4","title":"Factoring a Quadratic Operator as a Product of Two Positive Contractions","year":2015,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Multiplication operator; Operator (biology); Bounded operator; Quasinormal operator; Product (mathematics); Unitary operator; Shift operator; Compact operator; Factoring; Finite-rank operator; Pure mathematics; Bounded function; Hilbert space; Operator space; Quadratic equation; Algebra over a field; Mathematical analysis; Banach space","score_opus":0.020915341617729438,"score_gpt":0.2635711437668774,"score_spread":0.24265580214914798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963248211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.340389,0.00020859316,0.63688296,0.0006270809,0.00033315422,0.00008989226,0.00007169556,0.0003029001,0.02109467],"genre_scores_gemma":[0.9056419,0.00011080461,0.08005994,0.000281712,0.00022799749,0.00010137774,0.000096036354,0.00021034843,0.0132698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990984,0.00022560162,0.000048525457,0.00019242956,0.00028142252,0.00015365223],"domain_scores_gemma":[0.99863213,0.0003852091,0.00016512649,0.00017368498,0.00029693558,0.00034698768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012408332,0.0005380625,0.00043194764,0.00038391145,0.00056443096,0.0009497549,0.00052338716,0.0005584951,0.007846054],"category_scores_gemma":[0.0021963406,0.00026212735,0.00062124536,0.00033368572,0.0019583874,0.002262231,0.0017349768,0.0010055423,0.0007449921],"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.0005799978,0.00015902567,0.0014686616,0.00016987514,0.000044593966,0.001155347,0.00083023426,0.009312361,0.06901133,0.88133615,0.0038759634,0.032056343],"study_design_scores_gemma":[0.00013696641,0.00086370046,0.0017297205,0.00007887975,0.000043410288,0.0014571291,0.00058863114,0.1998484,0.01966314,0.75703055,0.018464934,0.00009450352],"about_ca_topic_score_codex":0.00024525393,"about_ca_topic_score_gemma":0.00023714389,"teacher_disagreement_score":0.007846054,"about_ca_system_score_codex":0.00026046566,"about_ca_system_score_gemma":0.00041733964,"threshold_uncertainty_score":0.02624768},"labels":[],"label_agreement":null},{"id":"W2963444657","doi":"10.2514/6.2019-3708","title":"GCRO with Dynamic Deflated Restarting for Solving Adjoint Systems of Equations for Aerodynamic Shape Optimization","year":2019,"lang":"en","type":"article","venue":"AIAA Aviation 2019 Forum","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"McGill University","funders":"","keywords":"Aerodynamics; Computer science; Mathematical optimization; Applied mathematics; Control theory (sociology); Mathematics; Aerospace engineering; Artificial intelligence; Engineering; Control (management)","score_opus":0.007370322009462381,"score_gpt":0.23093068975980957,"score_spread":0.22356036775034718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963444657","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009496639,0.00015347486,0.9866659,0.00007028708,0.000033272176,0.000037510443,0.000024231682,0.00058497716,0.0029336088],"genre_scores_gemma":[0.2102408,0.00018904379,0.7838432,0.00014915127,0.000050890052,0.0002051407,0.00018301707,0.0006027253,0.004535954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999665,0.00012397337,0.00001491676,0.00003945037,0.00013167493,0.000024967012],"domain_scores_gemma":[0.99960023,0.00015652331,0.000059942347,0.00008527232,0.00007920483,0.000018835346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047867742,0.0006667544,0.0004857685,0.00036236443,0.0003474387,0.00048720324,0.00080127193,0.00067212246,0.0026759084],"category_scores_gemma":[0.0013001425,0.0003028556,0.0005609585,0.00031377317,0.00063040626,0.0005513892,0.0009874104,0.0010539803,0.0009513724],"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.00016779921,0.000108546155,0.0008691216,0.00022799963,0.000069827816,0.00017347281,0.000211071,0.7550722,0.031993024,0.03656477,0.0028905466,0.17165165],"study_design_scores_gemma":[0.000009871142,0.000034349738,0.00009269476,0.000008126009,0.0000036659987,0.000036451114,0.000010113058,0.9911504,0.0032266052,0.0019095312,0.0035080696,0.000010125951],"about_ca_topic_score_codex":0.002761843,"about_ca_topic_score_gemma":0.0035635163,"teacher_disagreement_score":0.002761843,"about_ca_system_score_codex":0.0002848966,"about_ca_system_score_gemma":0.0006476599,"threshold_uncertainty_score":0.008951843},"labels":[],"label_agreement":null},{"id":"W2963458156","doi":"10.1016/j.laa.2012.11.016","title":"Fischer type determinantal inequalities for accretive–dissipative matrices","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":50,"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 Waterloo","funders":"","keywords":"Mathematics; Dissipative system; Type (biology); Matrix (chemical analysis); Pure mathematics; Combinatorics; Mathematical analysis; Algebra over a field; Physics; Chemistry; Thermodynamics","score_opus":0.02759485612494702,"score_gpt":0.30093263294860445,"score_spread":0.27333777682365745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963458156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10315766,0.0021665231,0.7792738,0.003185036,0.00044331633,0.00006815822,0.00071098324,0.00016005401,0.11083458],"genre_scores_gemma":[0.90093535,0.0018701721,0.05827208,0.000978742,0.00044807317,0.00013931724,0.00048319824,0.0001067724,0.036766253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991216,0.00026579306,0.0000449446,0.00016110852,0.00025766343,0.0001489557],"domain_scores_gemma":[0.99682873,0.0020120097,0.00026130324,0.00016321214,0.00046196562,0.00027269236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019013861,0.001339607,0.00081145874,0.0020585437,0.0011507965,0.002352071,0.0014600668,0.001302269,0.010370887],"category_scores_gemma":[0.0060907514,0.00052130996,0.0009611492,0.0014413169,0.0035662942,0.0038360842,0.0025003417,0.0034476044,0.0008945935],"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.000018707298,0.000008658713,0.0001253324,0.00003213352,0.000008444392,0.00003748719,0.00009228326,0.004530069,0.00080942875,0.990877,0.00079167134,0.0026688706],"study_design_scores_gemma":[0.0000069388907,0.000012971233,0.00018625027,0.000013041538,0.0000065736017,0.00003900895,0.000046980374,0.034670357,0.00046507514,0.9629082,0.0016231394,0.000021340433],"about_ca_topic_score_codex":0.0024246294,"about_ca_topic_score_gemma":0.004327418,"teacher_disagreement_score":0.010370887,"about_ca_system_score_codex":0.0021821111,"about_ca_system_score_gemma":0.00091533817,"threshold_uncertainty_score":0.034694076},"labels":[],"label_agreement":null},{"id":"W2963794320","doi":"10.23638/lmcs-15(3:3)2019","title":"Subspace-Invariant AC$^0$ Formulas","year":2019,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Invariant (physics); Mathematics; Invariant subspace problem; Subspace topology; Pure mathematics; Invariant subspace; Mathematical analysis; Mathematical physics; Linear subspace; Banach space","score_opus":0.15129058932569903,"score_gpt":0.5019648049511604,"score_spread":0.3506742156254613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963794320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4481385,0.00040859007,0.45834765,0.0007995001,0.00019627507,0.00014570174,0.0010508428,0.0037142406,0.087198764],"genre_scores_gemma":[0.8910825,0.00020743888,0.09305614,0.0004497554,0.00010534721,0.00012861185,0.00097571994,0.00048816737,0.013506355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993024,0.00009783211,0.00003176983,0.00015682506,0.00020336888,0.00020782782],"domain_scores_gemma":[0.99940157,0.00017768575,0.00006187153,0.00020869875,0.00009602894,0.000054178898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038156664,0.0004695551,0.00035098608,0.00041358388,0.00058460754,0.0010176823,0.0010692659,0.0003526359,0.010773372],"category_scores_gemma":[0.0013527914,0.00023010137,0.0007490663,0.00039713265,0.0012058774,0.0021558765,0.0018431409,0.0013809142,0.0014830375],"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.00039154128,0.0001549822,0.0019541325,0.000200069,0.00003899644,0.00029060218,0.00029413035,0.015570436,0.03080643,0.84565234,0.005440024,0.0992064],"study_design_scores_gemma":[0.0000794563,0.00024319146,0.0010155423,0.000028316159,0.00007305735,0.00023572566,0.00013018404,0.15065923,0.06935303,0.758966,0.019162342,0.000053869986],"about_ca_topic_score_codex":0.0015885244,"about_ca_topic_score_gemma":0.002120764,"teacher_disagreement_score":0.010773372,"about_ca_system_score_codex":0.00083182694,"about_ca_system_score_gemma":0.00078475603,"threshold_uncertainty_score":0.036040485},"labels":[],"label_agreement":null},{"id":"W2964220986","doi":"10.13001/ela.2021.4975","title":"Generalized Standard Triples for Algebraic Linearizations of Matrix Polynomials","year":2021,"lang":"en","type":"preprint","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Western University","funders":"Universidad de Alcalá","keywords":"Combinatorics; Mathematics; Polynomial; Order (exchange); Matrix (chemical analysis); Eigenvalues and eigenvectors; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.014153262761410266,"score_gpt":0.288571903447922,"score_spread":0.27441864068651173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964220986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1704246,0.0005614112,0.6036086,0.0010179115,0.0009382334,0.00024167883,0.00088451186,0.0020900576,0.22023307],"genre_scores_gemma":[0.84444594,0.0005316554,0.09404041,0.00093513576,0.00047594824,0.00035770153,0.0009993477,0.00088556844,0.057328306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926955,0.00014788269,0.000038913575,0.00013879211,0.00023028138,0.00017456093],"domain_scores_gemma":[0.99953496,0.00005944398,0.00006876197,0.00007923706,0.00019071662,0.000066835106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005278187,0.00085527054,0.00043284948,0.0014774399,0.001339454,0.001797249,0.0008856627,0.0005618848,0.015421916],"category_scores_gemma":[0.0012035089,0.0003596554,0.0008782056,0.00090617756,0.0020506168,0.0020264005,0.0014261691,0.0015168216,0.0050340975],"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.000024292242,0.000018719049,0.000086657594,0.00004156719,0.0000084104395,0.000106194755,0.00021997077,0.0015034252,0.0021963213,0.9811918,0.002794474,0.011808169],"study_design_scores_gemma":[0.00002077552,0.00006556704,0.00021053749,0.000031811942,0.000010257515,0.00022207056,0.00028799305,0.012148439,0.0040514707,0.96150476,0.021383097,0.00006322893],"about_ca_topic_score_codex":0.0015082777,"about_ca_topic_score_gemma":0.0016843998,"teacher_disagreement_score":0.015421916,"about_ca_system_score_codex":0.0011515559,"about_ca_system_score_gemma":0.0007610309,"threshold_uncertainty_score":0.051591456},"labels":[],"label_agreement":null},{"id":"W2964243499","doi":"10.2478/spma-2014-0010","title":"Bilinear characterizations of companion matrices","year":2014,"lang":"en","type":"article","venue":"Special Matrices","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Victoria","funders":"","keywords":"Bilinear interpolation; Mathematics; Bilinear form; Type (biology); Bilinear map; Pure mathematics; Algebra over a field; Statistics; Geology","score_opus":0.009055364507476205,"score_gpt":0.22970060009011656,"score_spread":0.22064523558264035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964243499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3016396,0.0005917957,0.6371285,0.0005272289,0.00028871692,0.000084147956,0.00036204117,0.0004537708,0.058924265],"genre_scores_gemma":[0.9747011,0.00022922704,0.015857756,0.00014731375,0.00025594424,0.000041748728,0.00018613646,0.00008085657,0.008499937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990283,0.00022365316,0.000047178193,0.0001781463,0.00034610956,0.00017669624],"domain_scores_gemma":[0.996786,0.000832559,0.0005587589,0.00050901953,0.00081551704,0.00049817265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007682684,0.0006030575,0.00045298875,0.001928396,0.0006728576,0.0019461763,0.0004397851,0.00055303157,0.008820564],"category_scores_gemma":[0.0046363105,0.00022517468,0.0004370046,0.0010132949,0.0015169767,0.0028368428,0.0018116098,0.0013348083,0.0010777459],"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.000086076136,0.000049175604,0.00086522993,0.00005928678,0.000013095829,0.0002747869,0.0004712579,0.0048810258,0.006675005,0.97011524,0.0020487998,0.014461],"study_design_scores_gemma":[0.000011549155,0.00010159472,0.0005349927,0.000020410807,0.000006268719,0.00053192145,0.00024870198,0.048416402,0.0049629947,0.9384282,0.0067102,0.000026826428],"about_ca_topic_score_codex":0.0002497711,"about_ca_topic_score_gemma":0.00018186372,"teacher_disagreement_score":0.008820564,"about_ca_system_score_codex":0.00043431658,"about_ca_system_score_gemma":0.00031044648,"threshold_uncertainty_score":0.029507697},"labels":[],"label_agreement":null},{"id":"W2964248269","doi":"10.1145/3054948","title":"SYM-ILDL","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"University of British Columbia; University of Pennsylvania","keywords":"Preconditioner; Factorization; Mathematical software; Computer science; Code (set theory); Positive-definite matrix; Symmetric matrix; Incomplete LU factorization; Matching (statistics); Skew; Mathematics; Iterative method; Applied mathematics; Parallel computing; Computational science; Algorithm; Software; Matrix decomposition; Set (abstract data type); Physics; Eigenvalues and eigenvectors","score_opus":0.02624809734640182,"score_gpt":0.2798962179493537,"score_spread":0.2536481206029519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964248269","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014709381,0.0004821316,0.78828394,0.0004968958,0.0005372146,0.0002547763,0.01313232,0.11712853,0.06497482],"genre_scores_gemma":[0.13597548,0.0004622749,0.73072976,0.0009000682,0.00022864927,0.001009954,0.03978828,0.04407288,0.04683267],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999138,0.00017415121,0.000060403094,0.00013450897,0.00037683625,0.00011605796],"domain_scores_gemma":[0.9984785,0.00049659656,0.00010158146,0.00028701447,0.00052595313,0.00011042359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097096997,0.001370687,0.0012660252,0.00087309314,0.00075465697,0.001612384,0.0025576975,0.0010146193,0.0814416],"category_scores_gemma":[0.0040606023,0.0006612001,0.0010890783,0.0008172811,0.00055858586,0.001686982,0.0020814796,0.0019999747,0.030281093],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067747984,0.00030672507,0.004395019,0.0013408997,0.00020764647,0.0005316365,0.0003402381,0.1216137,0.01615331,0.081431665,0.53737426,0.23562743],"study_design_scores_gemma":[0.00031872382,0.00012390818,0.0007693513,0.000104218714,0.000035130455,0.00024420486,0.00010182994,0.76639986,0.016733484,0.03248996,0.18259603,0.0000833307],"about_ca_topic_score_codex":0.0029464415,"about_ca_topic_score_gemma":0.0048355996,"teacher_disagreement_score":0.0814416,"about_ca_system_score_codex":0.00071240054,"about_ca_system_score_gemma":0.0014917196,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2967425770","doi":"10.1080/03081087.2019.1684873","title":"Higher rank numerical ranges of Jordan-like matrices","year":2019,"lang":"en","type":"preprint","venue":"Linear and Multilinear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rank (graph theory); Eigenvalues and eigenvectors; Mathematics; Characterization (materials science); Block (permutation group theory); Combinatorics; Numerical range; Range (aeronautics); Jordan matrix; Alpha (finance); Numerical analysis; Physics; Pure mathematics; Mathematical analysis; Statistics; Materials science; Optics; Quantum mechanics","score_opus":0.01607395792606067,"score_gpt":0.2677448405882698,"score_spread":0.25167088266220916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967425770","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52455217,0.00067556556,0.41790065,0.00057009514,0.0000913576,0.000057449906,0.0004921321,0.00052782847,0.055132758],"genre_scores_gemma":[0.9588791,0.00021343361,0.03353164,0.00014751159,0.00015993552,0.0000636364,0.00032863396,0.00011836172,0.0065578185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871004,0.00032313235,0.0000700555,0.00021448128,0.00050325657,0.00017907306],"domain_scores_gemma":[0.9963858,0.0012710175,0.0008123003,0.00042566875,0.00068801636,0.00041722026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008510197,0.00053712813,0.00033125683,0.0014849338,0.0005662695,0.002077304,0.0006524822,0.0004698889,0.007949779],"category_scores_gemma":[0.005914393,0.00020431844,0.00034497175,0.00073314586,0.001879545,0.0030633556,0.0013451845,0.0012255533,0.0015984685],"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.00015286043,0.00007346553,0.0022902207,0.00015154434,0.00001745612,0.00040623732,0.0006420458,0.008446249,0.024372324,0.9433199,0.001838503,0.01828917],"study_design_scores_gemma":[0.0000248477,0.00012309404,0.0015195282,0.000048840033,0.0000095577225,0.00088576344,0.0003571748,0.037516084,0.017227028,0.9355577,0.006668003,0.000062314495],"about_ca_topic_score_codex":0.00011589105,"about_ca_topic_score_gemma":0.00014037888,"teacher_disagreement_score":0.007949779,"about_ca_system_score_codex":0.00027832694,"about_ca_system_score_gemma":0.0001966531,"threshold_uncertainty_score":0.026594639},"labels":[],"label_agreement":null},{"id":"W2972815894","doi":"10.13001/1081-3810.3950","title":"Consistency of Quaternion Matrix Equations $AX^{\\star}-XB=C$ and $X-AX^\\star B=C$","year":2019,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":18,"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; National Natural Science Foundation of China","keywords":"Transpose; Star (game theory); Quaternion; Mathematics; Uniqueness; Matrix (chemical analysis); Complex conjugate; Positive-definite matrix; Hermitian matrix; Pure mathematics; Combinatorics; Mathematical analysis; Physics; Geometry; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.007281889495071087,"score_gpt":0.2452739567139639,"score_spread":0.23799206721889282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972815894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12367094,0.00088503317,0.8195805,0.0016463313,0.00078283064,0.00015861046,0.0005547685,0.00031542496,0.052405566],"genre_scores_gemma":[0.7942553,0.0008599408,0.17481844,0.00081416,0.00038070494,0.00038038794,0.0012566055,0.00040707883,0.0268274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981523,0.0006262187,0.00012465281,0.00041169106,0.0005102657,0.00017486469],"domain_scores_gemma":[0.99750024,0.00092178927,0.0004925902,0.00024163444,0.00071996794,0.00012367459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020854215,0.00057673623,0.0006934623,0.0009587572,0.0009821769,0.002625361,0.0013273269,0.0012920481,0.007270552],"category_scores_gemma":[0.008830645,0.00047837658,0.0009234085,0.0009578217,0.0025159004,0.0029113505,0.0015504395,0.0017671696,0.0017626808],"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.00006526906,0.000030243707,0.0008733186,0.00010794164,0.000028846503,0.00016544588,0.00035335537,0.0077551287,0.003430725,0.9683546,0.003976843,0.014858307],"study_design_scores_gemma":[0.00006833378,0.000086132415,0.0007504114,0.000044898363,0.000019847044,0.00032140565,0.00025801398,0.11969791,0.004791372,0.8653587,0.008538319,0.000064542626],"about_ca_topic_score_codex":0.0013583053,"about_ca_topic_score_gemma":0.0009376026,"teacher_disagreement_score":0.007270552,"about_ca_system_score_codex":0.000586469,"about_ca_system_score_gemma":0.0013038849,"threshold_uncertainty_score":0.02432239},"labels":[],"label_agreement":null},{"id":"W2974541616","doi":"10.32370/ia_2019_09_1","title":"THE G0EDEL THEOREM AND THE LORENTZ CONTRACTION","year":2019,"lang":"en","type":"article","venue":"Intellectual Archive","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Contraction (grammar); Length contraction; Lorentz transformation; Mathematics; Physics; Classical mechanics; Philosophy; Linguistics","score_opus":0.005679603112357709,"score_gpt":0.20717202163418277,"score_spread":0.20149241852182506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974541616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104832545,0.0043418165,0.6253245,0.007129442,0.0012667988,0.000073172974,0.00044170255,0.00030036128,0.25628966],"genre_scores_gemma":[0.8326896,0.0028520485,0.10824206,0.00224271,0.001344615,0.00018492372,0.0003636039,0.00035522474,0.05172517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992093,0.0002750367,0.000031662916,0.00016817467,0.00021716727,0.0000986509],"domain_scores_gemma":[0.99932206,0.00024950368,0.00007974921,0.00011452409,0.00016619767,0.00006804612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014444992,0.00055308774,0.0006824135,0.0013993211,0.0012399151,0.0017120994,0.0009364149,0.0008591032,0.006978577],"category_scores_gemma":[0.004017335,0.00022960805,0.0006788649,0.0009859077,0.004696502,0.0034558547,0.0021727579,0.0021897503,0.0019264512],"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.000005513724,0.0000024594358,0.00005584448,0.000013633679,0.0000024030678,0.000022488664,0.000060335366,0.0003831689,0.00013616211,0.99414104,0.0009875095,0.004189313],"study_design_scores_gemma":[0.0000039472525,0.0000057177785,0.00007748371,0.000006440963,0.0000012462298,0.00004570723,0.00001943684,0.0026785035,0.0001456989,0.9935197,0.0034906664,0.000005412586],"about_ca_topic_score_codex":0.00093064405,"about_ca_topic_score_gemma":0.00044830018,"teacher_disagreement_score":0.006978577,"about_ca_system_score_codex":0.0009123429,"about_ca_system_score_gemma":0.0007105864,"threshold_uncertainty_score":0.02334565},"labels":[],"label_agreement":null},{"id":"W2979140977","doi":"10.1137/20m1358955","title":"Fast Interpolation-Based Globality Certificates for Computing Kreiss Constants and the Distance to Uncontrollability","year":2021,"lang":"en","type":"preprint","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; York University; Courant Institute of Mathematical Sciences, New York University; National Science Foundation","keywords":"Interpolation (computer graphics); Mathematics; Eigenvalues and eigenvectors; Variable (mathematics); Convergence (economics); Function (biology); State (computer science); Algorithm; Applied mathematics; Computer science; Mathematical analysis; Image (mathematics)","score_opus":0.01250953728077803,"score_gpt":0.29944874033121316,"score_spread":0.28693920305043513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979140977","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014662409,0.000094601644,0.982451,0.000049914837,0.00002408844,0.000037131853,0.000042321306,0.00093243545,0.0017061165],"genre_scores_gemma":[0.43702793,0.00019307277,0.5593011,0.00006491012,0.00003493956,0.0001760769,0.00030861548,0.0006563378,0.002236996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900025,0.000166048,0.000052917123,0.00014100874,0.0005020819,0.00013772717],"domain_scores_gemma":[0.9970247,0.0012621913,0.0003988733,0.00050166686,0.0006711969,0.00014132651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014207351,0.0011597886,0.0012254314,0.0015289852,0.0006552347,0.0014758362,0.0017014511,0.00084522244,0.004053412],"category_scores_gemma":[0.006657421,0.0005160184,0.0010114571,0.0008890489,0.0016689491,0.0021841563,0.002159847,0.002483479,0.0010683398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032038646,0.00007941571,0.0021662135,0.0002567684,0.00006862849,0.00015353937,0.00026149003,0.74931747,0.017343767,0.09095663,0.0016858901,0.1373899],"study_design_scores_gemma":[0.000016253178,0.000051970655,0.00019327384,0.00001627525,0.0000050464646,0.000026343825,0.00002331333,0.97538996,0.007985148,0.015168213,0.0011030837,0.00002113915],"about_ca_topic_score_codex":0.0026240118,"about_ca_topic_score_gemma":0.0032322262,"teacher_disagreement_score":0.004053412,"about_ca_system_score_codex":0.0011052702,"about_ca_system_score_gemma":0.0019422531,"threshold_uncertainty_score":0.013559997},"labels":[],"label_agreement":null},{"id":"W2980201261","doi":"10.1137/19m1238265","title":"Implementing a smooth exact penalty function for equality-constrained nonlinear optimization","year":2019,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; University of British Columbia","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Institutes of Health","keywords":"Penalty method; Mathematical optimization; Constrained optimization; Mathematics; Nonlinear system; Optimization problem; Function (biology); Nonlinear programming; Factorization; Kernel (algebra); Algorithm; Computer science","score_opus":0.04175934025392116,"score_gpt":0.2032963055962008,"score_spread":0.16153696534227963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980201261","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026945756,0.000031722917,0.9957365,0.00007040306,0.000020004034,0.00001797199,0.00001452755,0.00019306074,0.0012213007],"genre_scores_gemma":[0.10183373,0.00012044523,0.89355075,0.0001270453,0.000029574305,0.000122032354,0.00011440244,0.00033978568,0.0037622126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940073,0.00016470149,0.000028167726,0.00007624603,0.00025794786,0.000072233954],"domain_scores_gemma":[0.99919623,0.00032788134,0.00007362918,0.0001791008,0.00017634175,0.00004694164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010562923,0.0008116829,0.0007811561,0.00047759022,0.00051941426,0.0008133627,0.0012087753,0.0013673746,0.0027964688],"category_scores_gemma":[0.0031888583,0.00036976163,0.00060602283,0.0005609965,0.0010199351,0.0012347954,0.001904575,0.0019137238,0.001285655],"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.000054294058,0.00007041574,0.00053908315,0.00009232032,0.000022370792,0.00012974741,0.000072993294,0.8254819,0.010904193,0.08944081,0.0024420435,0.07074993],"study_design_scores_gemma":[0.000004799392,0.000012716293,0.000035611076,0.000004049433,0.0000013195823,0.000017360768,0.0000037948143,0.9899906,0.0017789544,0.0066080987,0.001536944,0.000005756695],"about_ca_topic_score_codex":0.0026462234,"about_ca_topic_score_gemma":0.0027795592,"teacher_disagreement_score":0.0027964688,"about_ca_system_score_codex":0.00050612236,"about_ca_system_score_gemma":0.0013243292,"threshold_uncertainty_score":0.009355128},"labels":[],"label_agreement":null},{"id":"W2982637102","doi":"10.5539/jmr.v11n6p1","title":"Criteria for H-Matrices Based on γ−Diagonally Dominant Matrix","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hujiang Foundation of China","keywords":"Diagonally dominant matrix; Mathematics; Diagonal; Matrix (chemical analysis); Diagonal matrix; Main diagonal; Matrix splitting; Principal (computer security); Band matrix; Block matrix; Order (exchange); Square matrix; Applied mathematics; Combinatorics; Algebra over a field; Pure mathematics; Symmetric matrix; Geometry; Computer science; Eigenvalues and eigenvectors","score_opus":0.06756347354773647,"score_gpt":0.41584961689682803,"score_spread":0.3482861433490916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982637102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012895893,0.00056232256,0.976699,0.0001937419,0.0000947845,0.000115088726,0.00010145857,0.00019610925,0.009141698],"genre_scores_gemma":[0.4229713,0.000944661,0.5661549,0.00033317503,0.00037261524,0.0003344618,0.00044621053,0.0002449485,0.008197833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99603784,0.0011263853,0.0003092697,0.00060787785,0.00165072,0.00026787585],"domain_scores_gemma":[0.9917528,0.0028982733,0.0006851144,0.00051043625,0.003742027,0.00041144967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002718741,0.0013980856,0.00074754196,0.0033320547,0.001525065,0.0026375228,0.0010424823,0.0010982639,0.0062432433],"category_scores_gemma":[0.014012438,0.00042725613,0.0005886301,0.0013133348,0.0023937102,0.004087955,0.0020237572,0.0014030982,0.0018373391],"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.0005118467,0.00013448535,0.006655921,0.0012165362,0.00010058569,0.00074689335,0.0014327959,0.082621455,0.05170383,0.5602828,0.015132688,0.27946007],"study_design_scores_gemma":[0.00013782947,0.0004325136,0.0029749183,0.00026063953,0.000066927685,0.001262793,0.001100785,0.5998176,0.03509234,0.32268515,0.03584785,0.00032061717],"about_ca_topic_score_codex":0.0024696612,"about_ca_topic_score_gemma":0.0023484877,"teacher_disagreement_score":0.0062432433,"about_ca_system_score_codex":0.0010619274,"about_ca_system_score_gemma":0.0012514241,"threshold_uncertainty_score":0.020885706},"labels":[],"label_agreement":null},{"id":"W2988877209","doi":"10.1137/19m1298317","title":"On Fixed-Point, Krylov, and $2\\times 2$ Block Preconditioners for Nonsymmetric Problems","year":2020,"lang":"en","type":"preprint","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy","keywords":"Preconditioner; Schur complement; Mathematics; Generalized minimal residual method; Block (permutation group theory); Applied mathematics; Discretization; Block matrix; Krylov subspace; Convergence (economics); Linear system; Iterative method; Mathematical optimization; Mathematical analysis; Eigenvalues and eigenvectors; Combinatorics","score_opus":0.013297441913497467,"score_gpt":0.2782597135055652,"score_spread":0.26496227159206776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2988877209","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011771248,0.0011701428,0.9720839,0.0004151655,0.0001346428,0.00006980787,0.00006423923,0.0002038886,0.01408707],"genre_scores_gemma":[0.25764555,0.0034423643,0.7180573,0.0003974556,0.00042302816,0.0004257666,0.0002767648,0.0005155971,0.018816156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988199,0.00058027275,0.000036235342,0.00008705183,0.00039932714,0.00007723553],"domain_scores_gemma":[0.99793184,0.0013231041,0.00014207687,0.00021645117,0.00030840083,0.00007822329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020384581,0.001072438,0.0007199775,0.0008719828,0.0006067008,0.0007193431,0.0006458723,0.0009680455,0.003944395],"category_scores_gemma":[0.006719634,0.00036138104,0.00061824213,0.0008101592,0.0025546097,0.0014351658,0.0016845103,0.0025158585,0.0011655526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014971624,0.00005990652,0.00040671488,0.0002492171,0.00003146266,0.00016930484,0.000344926,0.2972095,0.009390889,0.6248607,0.0038147236,0.063313015],"study_design_scores_gemma":[0.000015124975,0.000051192947,0.00014601438,0.00003686049,0.0000062645404,0.000028293656,0.00002674412,0.8901048,0.0021883515,0.10110399,0.006277893,0.0000145346885],"about_ca_topic_score_codex":0.005804315,"about_ca_topic_score_gemma":0.0054771677,"teacher_disagreement_score":0.005804315,"about_ca_system_score_codex":0.0007789124,"about_ca_system_score_gemma":0.0015869689,"threshold_uncertainty_score":0.013195336},"labels":[],"label_agreement":null},{"id":"W2991934832","doi":"10.48550/arxiv.1911.02421","title":"Optimal and Approximate Solutions to Linear Quadratic Regulation of a Class of Graphon Dynamical Systems","year":2019,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"McGill University","funders":"","keywords":"Quadratic equation; Scalar (mathematics); Mathematics; Dynamical systems theory; Eigenvalues and eigenvectors; Optimal control; Linear dynamical system; Applied mathematics; Class (philosophy); Linear system; Representation (politics); Pure mathematics; Discrete mathematics; Mathematical optimization; Mathematical analysis; Computer science; Physics","score_opus":0.02626936965169436,"score_gpt":0.17293057865671455,"score_spread":0.1466612090050202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991934832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11119655,0.0005177686,0.87968016,0.0006413072,0.00004812826,0.000059417085,0.000056089222,0.00014736476,0.007653124],"genre_scores_gemma":[0.9618697,0.00025690053,0.034554552,0.00010456699,0.000034477667,0.00011174195,0.00006972709,0.000035529927,0.0029628219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959415,0.0001761682,0.000014159745,0.00009122315,0.00006888025,0.000055411267],"domain_scores_gemma":[0.9986259,0.0010134268,0.00015563563,0.00004811753,0.000103850245,0.000053238906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010442367,0.00073322695,0.00073151285,0.00038996415,0.00036928235,0.0009806462,0.0005756266,0.0012563847,0.0014337252],"category_scores_gemma":[0.0038318373,0.00030422438,0.00047117032,0.000300167,0.0016006998,0.001088006,0.0011333568,0.0010261461,0.00012846687],"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.000038100356,0.000026517895,0.00029030524,0.00007612499,0.000023105356,0.000057099765,0.00008182152,0.93606436,0.001607202,0.056738444,0.00037648776,0.0046204496],"study_design_scores_gemma":[0.0000054663196,0.0000147771625,0.00004549295,0.0000032103042,0.0000020045743,0.000005257154,0.000011731745,0.9887761,0.00014925314,0.01087077,0.00011229512,0.000003623085],"about_ca_topic_score_codex":0.0036817924,"about_ca_topic_score_gemma":0.0021883599,"teacher_disagreement_score":0.0036817924,"about_ca_system_score_codex":0.0008405053,"about_ca_system_score_gemma":0.00065227423,"threshold_uncertainty_score":0.007320702},"labels":[],"label_agreement":null},{"id":"W2993693851","doi":"10.48550/arxiv.1912.01063","title":"On the linear convergence of circumcentered isometry methods","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"","keywords":"Mathematics; Linear subspace; Isometry (Riemannian geometry); Intersection (aeronautics); Affine transformation; Hilbert space; Operator (biology); Generalization; Fixed point; Linear map; Convergence (economics); Affine space; Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.08960989759832454,"score_gpt":0.23649331948165425,"score_spread":0.1468834218833297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2993693851","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013399509,0.0015883382,0.97384506,0.00049714354,0.00013841667,0.00006603103,0.000044206758,0.00018465529,0.010236566],"genre_scores_gemma":[0.35783404,0.005010678,0.60660017,0.0011484475,0.0006495505,0.0007405832,0.0004814868,0.0010547413,0.026480393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966673,0.0016975502,0.00014762074,0.0003780235,0.00087134656,0.00023815862],"domain_scores_gemma":[0.98795766,0.008203495,0.00060257176,0.0007885248,0.0019804663,0.00046733522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066472935,0.0015540436,0.0010830681,0.002265527,0.0009016675,0.001729752,0.0016155221,0.0013449846,0.0043269205],"category_scores_gemma":[0.023264354,0.0006254042,0.0017053912,0.0010649784,0.0036447414,0.0031113192,0.005291198,0.005133383,0.001585485],"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.0001959767,0.00010743144,0.0020276299,0.0004114366,0.0000820887,0.00022951231,0.0008214145,0.10894482,0.007031082,0.8094533,0.0033177577,0.067377575],"study_design_scores_gemma":[0.00002605301,0.00017658694,0.00045285907,0.0001651996,0.000025806146,0.00013347698,0.00015752019,0.73970747,0.0033688168,0.24879219,0.0069422075,0.000051838942],"about_ca_topic_score_codex":0.0021302386,"about_ca_topic_score_gemma":0.0014670842,"teacher_disagreement_score":0.0066472935,"about_ca_system_score_codex":0.0012921221,"about_ca_system_score_gemma":0.001315577,"threshold_uncertainty_score":0.03515464},"labels":[],"label_agreement":null},{"id":"W2995746186","doi":"10.36478/jeasci.2019.693.700","title":"Performance of Quarter-Sweep SOR Iteration with Cubic B–Spline Scheme for Solving Two-Point Boundary Value Problems","year":2019,"lang":"en","type":"article","venue":"Journal of Engineering and Applied Sciences","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Monotone cubic interpolation; Mathematics; Boundary value problem; Quarter (Canadian coin); Scheme (mathematics); Applied mathematics; Value (mathematics); Mathematical analysis; Mathematical optimization; Statistics","score_opus":0.00612089985661372,"score_gpt":0.2041282711834794,"score_spread":0.1980073713268657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995746186","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84763527,0.00073405687,0.13578568,0.00049850415,0.00026285934,0.00006568952,0.0002184553,0.0021130287,0.012686385],"genre_scores_gemma":[0.9201533,0.00014617515,0.07658824,0.0000661559,0.00002045361,0.000038562426,0.00026515112,0.00021193807,0.0025100783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994734,0.00019115827,0.000030233432,0.000049141843,0.00015161371,0.00010449526],"domain_scores_gemma":[0.99794954,0.0010472408,0.000118316755,0.00020423076,0.00048813835,0.00019248585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009770539,0.00057773065,0.0011745285,0.00036314045,0.00061927654,0.00073972024,0.0011039143,0.0012034086,0.0040994524],"category_scores_gemma":[0.0031651154,0.0003086098,0.00043624706,0.00054851297,0.0005743629,0.000680484,0.0008732,0.0008768858,0.000458295],"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.0034570738,0.00086131005,0.005892762,0.0005733503,0.00014704617,0.00034858764,0.00049837556,0.82990915,0.03180652,0.00528728,0.004619082,0.11659937],"study_design_scores_gemma":[0.000027514869,0.000079847996,0.0002765241,0.0000054430548,0.0000039570527,0.00002013142,0.000034045577,0.9971992,0.0019462701,0.00018731195,0.00021370551,0.0000060420534],"about_ca_topic_score_codex":0.006361795,"about_ca_topic_score_gemma":0.005001034,"teacher_disagreement_score":0.006361795,"about_ca_system_score_codex":0.00029050768,"about_ca_system_score_gemma":0.0012554169,"threshold_uncertainty_score":0.013714075},"labels":[],"label_agreement":null},{"id":"W2996907814","doi":"10.5539/jmr.v12n1p1","title":"Analytic Solutions of the Eigenvalues of Mathieu’s Equation","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Matrix (chemical analysis); Eigenfunction; Mathematical analysis; Mathieu function; Prime (order theory); Mathematical physics; Quantum mechanics; Physics; Chemistry","score_opus":0.14488013323815582,"score_gpt":0.37606423311949183,"score_spread":0.231184099881336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996907814","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4773406,0.0027032597,0.18715483,0.0051033553,0.00075674045,0.00017865113,0.0004467405,0.00050723914,0.32580855],"genre_scores_gemma":[0.91023743,0.00086367,0.023911437,0.00046459364,0.00038729876,0.00018392857,0.00028047577,0.00019052309,0.06348066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996357,0.00007596047,0.00001553117,0.000048458205,0.00011992594,0.000104481835],"domain_scores_gemma":[0.9995111,0.0001241887,0.00008693397,0.000025076937,0.00014552801,0.00010720038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044964364,0.0010825739,0.000668862,0.0016341935,0.0009876546,0.0020743604,0.0010301562,0.0018844922,0.010994821],"category_scores_gemma":[0.0027084283,0.00043609904,0.00065417617,0.0008463443,0.0017079074,0.0018427673,0.0015228804,0.0013850551,0.0014898124],"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.00008627164,0.000052287185,0.00036760594,0.00008671426,0.000023483502,0.00041842458,0.00053884124,0.020472849,0.004922976,0.96125764,0.004502235,0.0072707515],"study_design_scores_gemma":[0.000090381596,0.00005367838,0.0009897562,0.00007270904,0.000016098553,0.00040482474,0.0006558186,0.2996087,0.0025267152,0.6876291,0.007839347,0.00011281583],"about_ca_topic_score_codex":0.0028039492,"about_ca_topic_score_gemma":0.0015546068,"teacher_disagreement_score":0.010994821,"about_ca_system_score_codex":0.001717428,"about_ca_system_score_gemma":0.0009580791,"threshold_uncertainty_score":0.03678137},"labels":[],"label_agreement":null},{"id":"W2999924267","doi":"10.1137/19m1255409","title":"A Scalable Approximate Inverse Block Preconditioner for an Incompressible Magnetohydrodynamics Model Problem","year":2020,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":19,"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":"Preconditioner; Discretization; Mathematics; Curl (programming language); Applied mathematics; Finite element method; Compressibility; Inverse; Multigrid method; Mathematical analysis; Mathematical optimization; Iterative method; Partial differential equation; Computer science; Geometry; Physics","score_opus":0.03366435852616984,"score_gpt":0.267063065870316,"score_spread":0.23339870734414614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999924267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011183338,0.000058780694,0.98536277,0.0001954163,0.00004066187,0.00003607396,0.000075202304,0.00049318006,0.002554558],"genre_scores_gemma":[0.15408763,0.00014374506,0.8398709,0.00011407229,0.00006830706,0.00021697136,0.0003328779,0.00026357593,0.0049018976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971503,0.00006480117,0.000009702879,0.00002928415,0.00015733152,0.000023866793],"domain_scores_gemma":[0.9996964,0.0001011789,0.000033699598,0.00007063809,0.0000623143,0.00003577713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039550485,0.0004640049,0.00079279864,0.00018098063,0.00036067015,0.00050780544,0.00080015685,0.0010151326,0.003232901],"category_scores_gemma":[0.0010658696,0.00028360015,0.00035907776,0.00025316988,0.0004348715,0.0007042254,0.0011030744,0.0012759871,0.0010524633],"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.00019332493,0.000108481974,0.00051998073,0.00016181765,0.000032953343,0.0002254987,0.00014737938,0.8086391,0.051725384,0.051957306,0.0056538517,0.080634974],"study_design_scores_gemma":[0.000015964983,0.000018409315,0.000035917757,0.000002929011,0.000001917477,0.000012985879,0.000004935615,0.993789,0.002102537,0.002169971,0.0018418245,0.0000036439753],"about_ca_topic_score_codex":0.0026399298,"about_ca_topic_score_gemma":0.003192395,"teacher_disagreement_score":0.003232901,"about_ca_system_score_codex":0.0003294101,"about_ca_system_score_gemma":0.0011167369,"threshold_uncertainty_score":0.010815144},"labels":[],"label_agreement":null},{"id":"W3005231002","doi":"","title":"Approximate Distance Oracles Revisited","year":2002,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Carleton University","funders":"","keywords":"Combinatorics; Spanner; Mathematics; Path (computing); Constant (computer programming); Binary logarithm; Space (punctuation); Shortest path problem; Discrete mathematics; Computer science; Graph","score_opus":0.016339450515538357,"score_gpt":0.2236668663576698,"score_spread":0.20732741584213144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005231002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08546504,0.0067824135,0.86317134,0.0090382,0.0005060392,0.00027800334,0.002274872,0.0048441016,0.027639989],"genre_scores_gemma":[0.7357128,0.0032543074,0.23687245,0.0021258546,0.0010144798,0.00036721633,0.0041802,0.0006101911,0.015862493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919952,0.001954828,0.00054331106,0.0015010202,0.0029359288,0.0010697221],"domain_scores_gemma":[0.9766207,0.012429351,0.001281513,0.007580446,0.0015499403,0.0005381057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040262262,0.0012031227,0.0030292475,0.0014148483,0.0013485356,0.004397152,0.0051496513,0.0036624726,0.01603962],"category_scores_gemma":[0.031234428,0.00083047664,0.0014244757,0.005041351,0.002395778,0.02018199,0.0056545893,0.0061874515,0.0036631306],"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.002007481,0.00067296915,0.004533549,0.0009376886,0.00018477465,0.0005295099,0.0005715389,0.12402641,0.0081741,0.53272486,0.039191905,0.2864453],"study_design_scores_gemma":[0.00023527275,0.00031800574,0.0013854649,0.00010379073,0.00008823949,0.0012444012,0.0003011289,0.46072987,0.0076328367,0.5065202,0.021374011,0.00006680151],"about_ca_topic_score_codex":0.0025745279,"about_ca_topic_score_gemma":0.002299318,"teacher_disagreement_score":0.01603962,"about_ca_system_score_codex":0.0024448202,"about_ca_system_score_gemma":0.0017470814,"threshold_uncertainty_score":0.05365783},"labels":[],"label_agreement":null},{"id":"W3007534944","doi":"10.5556/j.tkjm.51.2020.2871","title":"Bounds for uniform resolvent conditions","year":2020,"lang":"en","type":"article","venue":"Tamkang Journal of Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Lakehead University","funders":"","keywords":"Mathematics; Resolvent; Resolvent formalism; Banach space; Finite-rank operator; Bounded operator; Bounded function; C0-semigroup; Pure mathematics; Operator (biology); Compact operator; Mathematical analysis; Discrete mathematics; Extension (predicate logic)","score_opus":0.03390628025276047,"score_gpt":0.27951039493832036,"score_spread":0.2456041146855599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007534944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060207084,0.0077112885,0.87409824,0.0014696515,0.0006595494,0.0001282724,0.00038568708,0.00043900945,0.05490134],"genre_scores_gemma":[0.7859719,0.007755935,0.18112351,0.0014131047,0.0024605202,0.00057893654,0.00096513535,0.0010233407,0.018707685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99120116,0.0025601492,0.00064839824,0.0015619776,0.0028379946,0.0011903916],"domain_scores_gemma":[0.9603501,0.026265176,0.0022994939,0.0023422723,0.0065011675,0.0022418934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012210898,0.0025877908,0.0019108406,0.005493035,0.0019852775,0.004532991,0.0030795876,0.002200559,0.011337535],"category_scores_gemma":[0.05604528,0.0010700317,0.002724388,0.00269711,0.005743748,0.018886715,0.007362148,0.007985516,0.0020901205],"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.00016626784,0.00006905673,0.0007367098,0.00034465236,0.00007151698,0.00034686012,0.00044959926,0.00758476,0.00584983,0.96619284,0.001835379,0.01635251],"study_design_scores_gemma":[0.00002440424,0.00019082296,0.0007821614,0.00023594926,0.00008636787,0.00049610494,0.00021498099,0.1079303,0.0103860665,0.8737413,0.0058294456,0.00008198877],"about_ca_topic_score_codex":0.0004975959,"about_ca_topic_score_gemma":0.0004228429,"teacher_disagreement_score":0.012210898,"about_ca_system_score_codex":0.0017953542,"about_ca_system_score_gemma":0.0011008354,"threshold_uncertainty_score":0.064578116},"labels":[],"label_agreement":null},{"id":"W3010520837","doi":"10.1063/1.5117143","title":"The asymptotic iteration method revisited","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":20,"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 Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eigenvalues and eigenvectors; Iterative method; Power iteration; Asymptotology; Asymptotic analysis; Asymptotic analysis; Inverse iteration; Method of matched asymptotic expansions","score_opus":0.02395422705764538,"score_gpt":0.28628855318091156,"score_spread":0.2623343261232662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010520837","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055328156,0.0022561413,0.95306104,0.0009910988,0.00042670575,0.000034073168,0.00003303237,0.00033184342,0.03733326],"genre_scores_gemma":[0.38210136,0.004739145,0.5641362,0.0014872486,0.0011371105,0.00033620585,0.0001714478,0.00084012793,0.04505124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773043,0.0011217408,0.00008387272,0.00017594441,0.0007562856,0.00013173431],"domain_scores_gemma":[0.9976738,0.0013302435,0.00010398709,0.00035685208,0.00044117137,0.000093975876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021314675,0.0005228215,0.00093410606,0.0010947046,0.00072486623,0.0015007199,0.0012284553,0.0013004154,0.0059914915],"category_scores_gemma":[0.009743859,0.0003665712,0.0009059151,0.0009782573,0.0024802939,0.0026017618,0.0019586093,0.0030753287,0.0019589523],"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.000024860274,0.000020982201,0.00019495205,0.00008855944,0.00001593566,0.000059403854,0.00009531298,0.016059339,0.0011909954,0.9377108,0.0037295904,0.04080928],"study_design_scores_gemma":[0.000019475752,0.000049112758,0.00014376079,0.00007520586,0.000011141825,0.00029203488,0.000030717336,0.28387204,0.0017233905,0.6905091,0.023244442,0.000029581282],"about_ca_topic_score_codex":0.0012377182,"about_ca_topic_score_gemma":0.00088433415,"teacher_disagreement_score":0.0059914915,"about_ca_system_score_codex":0.0008482149,"about_ca_system_score_gemma":0.0017121141,"threshold_uncertainty_score":0.020043552},"labels":[],"label_agreement":null},{"id":"W3011552233","doi":"10.1007/s00220-020-03720-5","title":"Optimal Bounds on the Positivity of a Matrix from a Few Moments","year":2020,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Austrian Science Fund","keywords":"Semidefinite programming; Hermitian matrix; Hilbert space; Orthonormal basis; Dimension (graph theory); Relaxation (psychology); Positive-definite matrix; Matrix (chemical analysis); Moment problem; Tensor (intrinsic definition)","score_opus":0.059788387105167345,"score_gpt":0.31956884567068317,"score_spread":0.2597804585655158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011552233","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03611613,0.0024540294,0.9307249,0.0031144517,0.0004054069,0.00007564603,0.00043661063,0.00047695133,0.026195858],"genre_scores_gemma":[0.68729854,0.005869011,0.28548777,0.0020744798,0.002510492,0.0006105079,0.0010726986,0.001371734,0.013704724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960594,0.0017777745,0.00014014773,0.000556996,0.0009980979,0.0004676454],"domain_scores_gemma":[0.9421731,0.047829892,0.0018352736,0.00346692,0.0026015074,0.0020934423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076669008,0.0036550523,0.0022219708,0.0029956817,0.0015010994,0.004684485,0.003396038,0.0029524642,0.009614191],"category_scores_gemma":[0.047024958,0.0016815508,0.0014177245,0.0022658252,0.0065283417,0.01116909,0.0073342677,0.0090350825,0.00254701],"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.0010011309,0.00020841025,0.0007540957,0.00078694813,0.0001009373,0.00025856117,0.0004980619,0.100511014,0.0176534,0.81732106,0.010495574,0.05041085],"study_design_scores_gemma":[0.00004905519,0.00012203509,0.0003464287,0.00015290713,0.00003628387,0.00014791208,0.00007411402,0.31304917,0.0046111248,0.6785551,0.0027928292,0.00006296601],"about_ca_topic_score_codex":0.00066298357,"about_ca_topic_score_gemma":0.0010521414,"teacher_disagreement_score":0.009614191,"about_ca_system_score_codex":0.0018651125,"about_ca_system_score_gemma":0.0019803876,"threshold_uncertainty_score":0.040546954},"labels":[],"label_agreement":null},{"id":"W3012513449","doi":"10.1016/j.jcp.2020.109380","title":"Optimization of multidimensional diagonal-norm summation-by-parts operators on simplices","year":2020,"lang":"en","type":"article","venue":"Journal of Computational Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Diagonal; Summation by parts; Mathematics; Norm (philosophy); Applied mathematics; Algebra over a field; Pure mathematics; Mathematical optimization; Mathematical analysis; Calculus (dental); Geometry","score_opus":0.013733896854173977,"score_gpt":0.2456686955133986,"score_spread":0.23193479865922462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012513449","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044505905,0.00040301343,0.94309896,0.00092925644,0.00028321025,0.00009528262,0.00014475771,0.00030290344,0.010236597],"genre_scores_gemma":[0.47411302,0.0003948525,0.51018083,0.00057240936,0.00021533064,0.00037775922,0.0005418603,0.00090265577,0.012701295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893016,0.00048319498,0.00004823301,0.00013765672,0.00026509113,0.00013567074],"domain_scores_gemma":[0.9956527,0.0028908884,0.00016537547,0.0003523753,0.0005225729,0.00041607395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025839957,0.0013431194,0.002206807,0.0009915002,0.0010413388,0.0026790944,0.0029712443,0.0032522439,0.0066667865],"category_scores_gemma":[0.008402597,0.0010477289,0.001050667,0.0012396512,0.002446946,0.0028019752,0.0033563313,0.0026121468,0.0008685043],"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.00029100516,0.00032867893,0.00047323445,0.00029589498,0.000100171936,0.00013341586,0.00015230336,0.80071175,0.0032279422,0.147038,0.007189391,0.040058173],"study_design_scores_gemma":[0.000011489929,0.000016760785,0.00002543431,0.0000072889216,0.0000036061895,0.0000075561115,0.000018371275,0.9798282,0.0002600254,0.019510228,0.00030522846,0.000005821108],"about_ca_topic_score_codex":0.0030153235,"about_ca_topic_score_gemma":0.0051463866,"teacher_disagreement_score":0.0066667865,"about_ca_system_score_codex":0.0015439433,"about_ca_system_score_gemma":0.0020306837,"threshold_uncertainty_score":0.022302628},"labels":[],"label_agreement":null},{"id":"W3023253130","doi":"10.1090/conm/750","title":"Linear and Multilinear Algebra and Function Spaces","year":2020,"lang":"en","type":"book","venue":"Contemporary mathematics - American Mathematical Society","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Multilinear map; Mathematics; Multilinear algebra; Algebra over a field; Pure mathematics; Function (biology); Cellular algebra; Algebra representation","score_opus":0.025166886723828837,"score_gpt":0.25084723346696286,"score_spread":0.22568034674313403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023253130","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00228552,0.06339943,0.058709692,0.0037951786,0.006005102,0.000034628032,0.0005209643,0.00064288836,0.86460656],"genre_scores_gemma":[0.021275457,0.031777833,0.017082382,0.0009977565,0.0049311556,0.000089908885,0.0005123262,0.00046345306,0.9228696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997398,0.000044895874,0.000009871743,0.000037301863,0.00015094396,0.000017083054],"domain_scores_gemma":[0.999726,0.000111729314,0.000017150038,0.00003954865,0.00007783237,0.000027707794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002700298,0.001315188,0.00084474747,0.0017254864,0.0010034359,0.0034944057,0.0006715879,0.0006040987,0.052181143],"category_scores_gemma":[0.0007851203,0.00041620078,0.0003767747,0.004957823,0.0015865004,0.004342075,0.0009912428,0.0022355553,0.024628444],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010723235,0.000027411323,0.00005085959,0.00023404651,0.000008074138,0.000024402838,0.00014435437,0.0008724741,0.0007411325,0.59416914,0.2676099,0.1361075],"study_design_scores_gemma":[0.000003909193,0.000016508291,0.00020320354,0.00008676295,0.0000055782602,0.00010392923,0.00006637568,0.0015661666,0.00026702555,0.34247985,0.6551899,0.000010861396],"about_ca_topic_score_codex":0.0009467333,"about_ca_topic_score_gemma":0.0016416672,"teacher_disagreement_score":0.052181143,"about_ca_system_score_codex":0.0010368505,"about_ca_system_score_gemma":0.0010769803,"threshold_uncertainty_score":0.17456329},"labels":[],"label_agreement":null},{"id":"W3024576917","doi":"10.1002/mma.6508","title":"The generalized quaternion matrix equation <i>A</i><i>X</i><i>B</i>+<i>C</i><i>X</i><sup>⋆</sup><i>D</i>=<i>E</i>","year":2020,"lang":"en","type":"article","venue":"Mathematical Methods in the Applied Sciences","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Outstanding Youth Science Fund Project of National Natural Science Foundation of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Quaternion; Mathematics; Uniqueness; Transpose; Matrix (chemical analysis); Conjugate; Complex conjugate; Pure mathematics; Hermitian matrix; Mathematical analysis; Mathematical physics; Combinatorics; Geometry; Physics; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.0722272714493639,"score_gpt":0.36357139731637395,"score_spread":0.29134412586701003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3024576917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09416109,0.0026790686,0.8526301,0.0021196736,0.0009294988,0.00007148789,0.00012646597,0.00009033823,0.04719228],"genre_scores_gemma":[0.777004,0.0035858445,0.16332935,0.0007674303,0.00055227475,0.000113641545,0.00020053159,0.00008238744,0.054364555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982685,0.000043452223,0.000010771406,0.000045770073,0.000051949333,0.000021209196],"domain_scores_gemma":[0.99984014,0.000034375465,0.000035554505,0.000016163613,0.00005653553,0.000017299184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033804082,0.00046105354,0.00026961663,0.00027721678,0.00031288268,0.000945661,0.00039865955,0.0008680368,0.0039631776],"category_scores_gemma":[0.00077724975,0.0001354487,0.00033447848,0.0003424694,0.00094113074,0.0017250642,0.00064803654,0.00078542,0.00049211737],"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.000019382453,0.00001037943,0.0003519226,0.00009985242,0.000014245487,0.00023975885,0.00021375783,0.016162656,0.01071155,0.95383424,0.0022540323,0.016088208],"study_design_scores_gemma":[0.000032485463,0.000096337855,0.0006220526,0.000049148748,0.000020502908,0.0010216392,0.00039207717,0.2926224,0.006749585,0.66486984,0.033458963,0.00006502625],"about_ca_topic_score_codex":0.0011382841,"about_ca_topic_score_gemma":0.0006768074,"teacher_disagreement_score":0.0039631776,"about_ca_system_score_codex":0.00031412396,"about_ca_system_score_gemma":0.0004747122,"threshold_uncertainty_score":0.013258159},"labels":[],"label_agreement":null},{"id":"W3027395381","doi":"10.1137/20m1364485","title":"A Rational Even-IRA Algorithm for the Solution of $T$-Even Polynomial Eigenvalue Problems","year":2021,"lang":"en","type":"preprint","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University","keywords":"Krylov subspace; Matrix polynomial; Eigenvalues and eigenvectors; Arnoldi iteration; Mathematics; Polynomial; Linearization; Generalized minimal residual method; Block (permutation group theory); Divide-and-conquer eigenvalue algorithm; Applied mathematics; Skew; Algorithm; Iterative method; Computer science; Combinatorics; Mathematical analysis; Nonlinear system","score_opus":0.01656604732290797,"score_gpt":0.28514096886321605,"score_spread":0.2685749215403081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027395381","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003618625,0.00007399566,0.99354845,0.00004373541,0.000023163837,0.000027752238,0.000030040193,0.00086079974,0.0017733742],"genre_scores_gemma":[0.06683179,0.00012695172,0.92948645,0.00006815095,0.000031285566,0.00011507949,0.00022937181,0.0005674057,0.002543467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996234,0.00008960274,0.000019286323,0.000065696084,0.00013569111,0.00006618268],"domain_scores_gemma":[0.9995906,0.00016052667,0.000035744564,0.0000898805,0.000090811984,0.00003253313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005124764,0.0007402745,0.000790146,0.00063196884,0.0004078028,0.00069430843,0.0010594316,0.0005872381,0.008852621],"category_scores_gemma":[0.0015976431,0.00035688814,0.00065999886,0.0004905026,0.0006244197,0.00087511615,0.0014012955,0.0013275904,0.004229464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031537862,0.00018821203,0.0009574553,0.00045894648,0.000077088545,0.00027625985,0.00032035584,0.2929879,0.021299321,0.12901133,0.010894732,0.543213],"study_design_scores_gemma":[0.000038730934,0.00004436654,0.00008302376,0.0000126196,0.0000068838276,0.00006628677,0.0000374407,0.96817523,0.002895527,0.023016749,0.005607703,0.000015389096],"about_ca_topic_score_codex":0.0015389498,"about_ca_topic_score_gemma":0.0024657443,"teacher_disagreement_score":0.008852621,"about_ca_system_score_codex":0.00033734945,"about_ca_system_score_gemma":0.0010436146,"threshold_uncertainty_score":0.029614985},"labels":[],"label_agreement":null},{"id":"W3028748455","doi":"10.1109/lcsys.2020.2998430","title":"Stackelberg Strategy for Uncertain Markov Jump Delay Stochastic Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Control Systems Letters","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":"University of Waterloo","funders":"Japan Society for the Promotion of Science","keywords":"Stackelberg competition; Mathematical optimization; Convergence (economics); Mathematics; Markov chain; Sequence (biology); Set (abstract data type); Upper and lower bounds; Computer science; Applied mathematics; Mathematical economics","score_opus":0.022507603967989252,"score_gpt":0.23892391971460844,"score_spread":0.21641631574661918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028748455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042556293,0.0003150746,0.9524113,0.00018507343,0.000035540364,0.00004327484,0.000053490574,0.000056441946,0.00434364],"genre_scores_gemma":[0.9702565,0.00037791912,0.025992084,0.00006861813,0.000028593111,0.00013121896,0.00007480034,0.0000133525755,0.0030569115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919194,0.0002478671,0.000048549722,0.00019634867,0.00019080413,0.00012440479],"domain_scores_gemma":[0.9993205,0.00035754064,0.00013347474,0.000025635118,0.000108414686,0.00005450617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012125878,0.0011397777,0.0009938215,0.00042638934,0.0004916199,0.0014698299,0.0008457071,0.0010703895,0.0015266701],"category_scores_gemma":[0.0017532787,0.00032945094,0.0007674427,0.00044036083,0.0011080628,0.001154946,0.0011916312,0.0010024532,0.00016337371],"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.00010428938,0.000029918072,0.0006717391,0.00011393462,0.00008681488,0.0002644929,0.00013964955,0.8360061,0.0044459216,0.14828908,0.0003963582,0.009451657],"study_design_scores_gemma":[0.000010534775,0.000051191055,0.00007847809,0.000005700499,0.000012422698,0.000018352943,0.00001591526,0.98447305,0.00051636284,0.014439302,0.00036921183,0.00000941504],"about_ca_topic_score_codex":0.0054403944,"about_ca_topic_score_gemma":0.0027004108,"teacher_disagreement_score":0.0054403944,"about_ca_system_score_codex":0.0013198622,"about_ca_system_score_gemma":0.0012223491,"threshold_uncertainty_score":0.010817409},"labels":[],"label_agreement":null},{"id":"W3032866416","doi":"10.1007/s11786-020-00495-9","title":"Common Factors in Fraction-Free Matrix Decompositions","year":2020,"lang":"en","type":"preprint","venue":"Mathematics in Computer Science","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Western University","funders":"Austrian Science Fund","keywords":"Fraction (chemistry); Mathematics; Matrix (chemical analysis); Reduction (mathematics); Decomposition; LU decomposition; Triangular matrix; Computation; Gauss; Combinatorics; Matrix decomposition; Statistics; Eigenvalues and eigenvectors; Algorithm; Pure mathematics; Physics; Geometry","score_opus":0.031848626257712925,"score_gpt":0.31158528619534986,"score_spread":0.27973665993763697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3032866416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17925128,0.00043947776,0.8078969,0.00027307804,0.00011757273,0.00008509686,0.0001973042,0.0006299354,0.011109292],"genre_scores_gemma":[0.87725526,0.0002505152,0.11536686,0.00015698324,0.00011953594,0.000120791236,0.00028247957,0.00036623236,0.0060812416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984818,0.00044970104,0.00007594802,0.00023769986,0.00054881594,0.00020608184],"domain_scores_gemma":[0.99594045,0.001816763,0.00043811218,0.00096990995,0.00063372287,0.00020105406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019808195,0.00078314205,0.0007548137,0.0016687664,0.0007467727,0.0018057998,0.00074566616,0.0006038924,0.008068553],"category_scores_gemma":[0.010841537,0.00035629256,0.000727351,0.00074584916,0.0022355714,0.0022073793,0.0011404352,0.0008986511,0.0011587202],"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.00014688108,0.000061035644,0.00097557507,0.000120745855,0.000029738738,0.00026693515,0.00042066665,0.05245414,0.006297415,0.9093592,0.0021114768,0.027756166],"study_design_scores_gemma":[0.00001960504,0.00006075134,0.00047526124,0.000027151082,0.000010901946,0.00012766426,0.00009999137,0.37625045,0.0058013024,0.61410165,0.0029915993,0.00003373983],"about_ca_topic_score_codex":0.0014465965,"about_ca_topic_score_gemma":0.0010235914,"teacher_disagreement_score":0.008068553,"about_ca_system_score_codex":0.0006441533,"about_ca_system_score_gemma":0.0005767665,"threshold_uncertainty_score":0.026992023},"labels":[],"label_agreement":null},{"id":"W3035088831","doi":"10.3390/math8060978","title":"A Study of the Second-Kind Multivariate Pseudo-Chebyshev Functions of Fractional Degree","year":2020,"lang":"en","type":"article","venue":"Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"University of Victoria","funders":"","keywords":"Mathematics; Root (linguistics); Degree (music); Matrix (chemical analysis); Class (philosophy); Multivariate statistics; Chebyshev filter; Pure mathematics; Applied mathematics; Value (mathematics); Singular value; Mathematical analysis; Statistics; Physics; Computer science; Eigenvalues and eigenvectors","score_opus":0.05961559981662393,"score_gpt":0.269397360782937,"score_spread":0.2097817609663131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035088831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24395776,0.006572705,0.71709627,0.0012350805,0.00035983915,0.000022976494,0.00005662482,0.00009485251,0.030603908],"genre_scores_gemma":[0.9466981,0.0025567804,0.039678615,0.00016899053,0.00041336427,0.00001871305,0.000038158676,0.000053552034,0.010373708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999796,0.000069120935,0.000005430031,0.0000318938,0.000059400612,0.00003814535],"domain_scores_gemma":[0.9992524,0.00038488655,0.00008570842,0.00006705361,0.00014096311,0.00006895658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066815957,0.00056617614,0.0004825773,0.00082356663,0.00053887244,0.0009857198,0.00045913368,0.0007340477,0.0013949635],"category_scores_gemma":[0.0024880522,0.00015160785,0.00045576706,0.0007219906,0.0011180062,0.0018244192,0.00046846428,0.0012679495,0.00021993325],"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.000050041104,0.00002747167,0.0006006929,0.000092129165,0.000016678228,0.0002053208,0.00015730876,0.028165312,0.0069534457,0.94372,0.00079626136,0.019215377],"study_design_scores_gemma":[0.000016945542,0.000089234294,0.0013366088,0.000052117655,0.000021675498,0.00069456745,0.00016814852,0.58363897,0.0059248256,0.39612237,0.011887988,0.00004652589],"about_ca_topic_score_codex":0.0007923103,"about_ca_topic_score_gemma":0.00035310906,"teacher_disagreement_score":0.0013949635,"about_ca_system_score_codex":0.0005475513,"about_ca_system_score_gemma":0.00045884118,"threshold_uncertainty_score":0.0046666265},"labels":[],"label_agreement":null},{"id":"W3035167793","doi":"","title":"Linear Adjoint Sensitivity Analysis of the Time-Dependent Schrödinger Equation","year":2019,"lang":"en","type":"article","venue":"2019 International Applied Computational Electromagnetics Society Symposium (ACES)","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":"McMaster University","funders":"","keywords":"Adjoint equation; Sensitivity (control systems); Mathematics; Applied mathematics; Schrödinger equation; Function (biology); Mathematical analysis; Partial differential equation; Engineering","score_opus":0.004499674768370897,"score_gpt":0.209997729885958,"score_spread":0.2054980551175871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035167793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015032939,0.00008530432,0.98048913,0.00015351409,0.000020014137,0.000032892225,0.00002602044,0.00012930117,0.0040308167],"genre_scores_gemma":[0.8729391,0.00022596991,0.121771604,0.00017708592,0.000032382017,0.00019873597,0.000085438114,0.0001156154,0.00445408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992994,0.00034305945,0.000017255172,0.000073258816,0.00021641173,0.000050559116],"domain_scores_gemma":[0.9985941,0.0010396917,0.000096619464,0.00006965341,0.0001716055,0.000028178994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016782864,0.0007825851,0.0005697251,0.00054237206,0.00033679607,0.0010790465,0.00057212956,0.00089783064,0.0019976394],"category_scores_gemma":[0.0035338958,0.00036581332,0.00068964675,0.00024655138,0.0011188334,0.0007752192,0.0013009326,0.00087566173,0.00021048391],"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.000035209832,0.000024858458,0.00022405367,0.000056707635,0.000022937535,0.00005807025,0.000044338958,0.9628227,0.0060300985,0.024522476,0.00021180106,0.0059467335],"study_design_scores_gemma":[0.0000021212154,0.000008328251,0.000030701034,0.0000027009626,0.0000024306821,0.0000069698985,0.0000029550736,0.99548894,0.00082798925,0.003498726,0.00012394966,0.000004199041],"about_ca_topic_score_codex":0.0015478869,"about_ca_topic_score_gemma":0.0007118738,"teacher_disagreement_score":0.0019976394,"about_ca_system_score_codex":0.000684443,"about_ca_system_score_gemma":0.00078405865,"threshold_uncertainty_score":0.008875728},"labels":[],"label_agreement":null},{"id":"W3036170074","doi":"10.1007/s11075-021-01108-7","title":"A simple extrapolation method for clustered eigenvalues","year":2021,"lang":"en","type":"preprint","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Directorate for Mathematical and Physical Sciences; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Extrapolation; Eigenvalues and eigenvectors; Simple (philosophy); Convergence (economics); Power iteration; Mathematics; Applied mathematics; Inverse iteration; Mathematical optimization; Mathematical analysis; Iterative method; Physics","score_opus":0.034278272300960505,"score_gpt":0.3303777501401693,"score_spread":0.29609947783920876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036170074","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004687502,0.00017817083,0.99103206,0.00009243531,0.00019443806,0.000052773183,0.00005466446,0.0006063371,0.0031015442],"genre_scores_gemma":[0.118239455,0.00045632466,0.86340535,0.00025971598,0.00023552611,0.00028343787,0.00020344168,0.00085869874,0.016057925],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995197,0.00016847737,0.00002153637,0.000054684286,0.00020727419,0.000028245218],"domain_scores_gemma":[0.9988726,0.00041817402,0.000050262828,0.00025906131,0.0003207421,0.00007918583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009641543,0.0007764583,0.0009218626,0.0011006271,0.00064372213,0.00071953336,0.0016331389,0.0013356596,0.009795145],"category_scores_gemma":[0.004151979,0.00035748063,0.0007807048,0.0011067848,0.0006406967,0.0015086799,0.0016711926,0.0016326383,0.0037446576],"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.000510788,0.00040460695,0.0009853571,0.00081559015,0.00017176715,0.00057757396,0.00048574738,0.22136232,0.05068471,0.23648547,0.020881563,0.46663454],"study_design_scores_gemma":[0.000039078655,0.000060790917,0.0001982828,0.000049826063,0.000021601401,0.00014281733,0.000034192348,0.9305382,0.004691767,0.055498276,0.008695732,0.00002952094],"about_ca_topic_score_codex":0.0007733864,"about_ca_topic_score_gemma":0.0012066868,"teacher_disagreement_score":0.009795145,"about_ca_system_score_codex":0.00030649663,"about_ca_system_score_gemma":0.00058438163,"threshold_uncertainty_score":0.03276807},"labels":[],"label_agreement":null},{"id":"W3037249508","doi":"10.48336/jvv7-8440","title":"Effective fine structure constant","year":2020,"lang":"en","type":"dissertation","venue":"Memorial University Research Repository (Memorial University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Memorial University of Newfoundland","funders":"","keywords":"Constant (computer programming); Loop (graph theory); Topology (electrical circuits); Energy (signal processing); Function (biology); Order (exchange); Mathematics; Physics; Mathematical analysis; Computer science; Quantum mechanics; Combinatorics","score_opus":0.013105110919181451,"score_gpt":0.24769947526291905,"score_spread":0.2345943643437376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037249508","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10847091,0.004733754,0.3108206,0.0017240816,0.00126276,0.0001303685,0.00073826854,0.001287139,0.57083213],"genre_scores_gemma":[0.7870355,0.0038804244,0.060812876,0.0012566682,0.0006426644,0.0003140483,0.00081353704,0.0015934216,0.14365084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939895,0.000066341825,0.00001671055,0.00010668302,0.00030679427,0.00010457011],"domain_scores_gemma":[0.9993824,0.00019543958,0.000037452788,0.00012836997,0.0001707578,0.000085653955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005458973,0.0008327267,0.00083223014,0.0022151594,0.001371865,0.0018902988,0.001740185,0.0011841834,0.02052074],"category_scores_gemma":[0.0022432713,0.00034346516,0.00071775063,0.0008421427,0.0010586038,0.002585568,0.0012028264,0.001513953,0.0037888398],"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.00002179417,0.000042565727,0.00027512485,0.00014717205,0.00002565418,0.00017187739,0.00012930222,0.01168291,0.0043174443,0.96804315,0.003364737,0.011778335],"study_design_scores_gemma":[0.00002872647,0.00004329397,0.0013992676,0.00011135626,0.000036795995,0.0005333753,0.00009122552,0.12878987,0.006715008,0.83823824,0.023939708,0.00007303764],"about_ca_topic_score_codex":0.0012209627,"about_ca_topic_score_gemma":0.001491312,"teacher_disagreement_score":0.02052074,"about_ca_system_score_codex":0.001382068,"about_ca_system_score_gemma":0.0009211628,"threshold_uncertainty_score":0.068648756},"labels":[],"label_agreement":null},{"id":"W3037721576","doi":"","title":"A Tight and Unified Analysis of Gradient-Based Methods for a Whole Spectrum of Differentiable Games.","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Differentiable function; Computer science; Spectrum (functional analysis); Mathematical optimization; Mathematics; Physics; Mathematical analysis","score_opus":0.1016578330645837,"score_gpt":0.3708106973623068,"score_spread":0.2691528642977231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037721576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026306903,0.0011309291,0.99026114,0.0004962054,0.00013235974,0.00007492295,0.000042069914,0.00009451623,0.0051371567],"genre_scores_gemma":[0.33732337,0.004049433,0.6269045,0.0012819938,0.00097381405,0.0010678209,0.0003941266,0.0011136493,0.02689122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964412,0.0019368007,0.0001386602,0.00035220548,0.0008432955,0.00028793517],"domain_scores_gemma":[0.9865155,0.009934863,0.0005130233,0.00069264777,0.0015947567,0.0007492273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007907452,0.0026518663,0.0024795118,0.0022686094,0.0011830048,0.0030045672,0.003933966,0.0033116876,0.006955343],"category_scores_gemma":[0.032729294,0.0012802839,0.0022836362,0.0014250429,0.0033144904,0.0055948016,0.0057518883,0.0065082917,0.0012085382],"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.00012770445,0.00017501133,0.0006438888,0.0003794299,0.00016356657,0.00013738449,0.00023816232,0.20282272,0.0015272107,0.7425998,0.009154691,0.042030353],"study_design_scores_gemma":[0.000012442705,0.000050710514,0.00015264945,0.000063869404,0.000026024094,0.000034286906,0.000023846278,0.84851617,0.00020059689,0.14882138,0.0020799094,0.00001815443],"about_ca_topic_score_codex":0.005744274,"about_ca_topic_score_gemma":0.0053843404,"teacher_disagreement_score":0.007907452,"about_ca_system_score_codex":0.0024643615,"about_ca_system_score_gemma":0.0031708542,"threshold_uncertainty_score":0.041819096},"labels":[],"label_agreement":null},{"id":"W3039694558","doi":"10.1063/1.5144623","title":"Supersymmetric generalized power functions","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","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":"Université du Québec à Trois-Rivières","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Power (physics); Mathematics; Mathematical economics; Physics; Quantum mechanics","score_opus":0.027448652091921905,"score_gpt":0.24856621617056507,"score_spread":0.22111756407864316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039694558","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61573017,0.00088837754,0.31082225,0.00044625843,0.00024324347,0.00005250655,0.00013474353,0.0001847545,0.0714977],"genre_scores_gemma":[0.96533084,0.00047916415,0.019526633,0.00010435583,0.00014128044,0.00003649997,0.000105265215,0.000074103606,0.014201829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997681,0.00006805858,0.0000103759285,0.00003919959,0.00006881935,0.000045511282],"domain_scores_gemma":[0.99964726,0.000081401115,0.00007840014,0.000051907118,0.000086658154,0.000054395394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042701716,0.00052483764,0.00039813755,0.0010459144,0.00042826848,0.0011088368,0.0006653218,0.0004986502,0.0035637957],"category_scores_gemma":[0.0011998478,0.00016512873,0.000408298,0.00063217967,0.0010492392,0.0016373269,0.00054227596,0.00078395446,0.0005631544],"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.000025198693,0.000013766564,0.00019680192,0.000025526577,0.0000069165612,0.00016654232,0.00010197562,0.0068207695,0.005688801,0.98000014,0.00042394077,0.0065295896],"study_design_scores_gemma":[0.00002113666,0.00006805062,0.0006940283,0.000026688529,0.000013483259,0.0005219994,0.00017737046,0.22006908,0.0050648204,0.7666755,0.0066324156,0.00003548908],"about_ca_topic_score_codex":0.0003559654,"about_ca_topic_score_gemma":0.0003082743,"teacher_disagreement_score":0.0035637957,"about_ca_system_score_codex":0.00048880995,"about_ca_system_score_gemma":0.0003451066,"threshold_uncertainty_score":0.011922061},"labels":[],"label_agreement":null},{"id":"W3040204415","doi":"10.1016/j.jmaa.2020.124332","title":"The Karpelevič region revisited","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University College Dublin","keywords":"Mathematics; Eigenvalues and eigenvectors; Order (exchange); Matrix (chemical analysis); Combinatorics; Pure mathematics; Boundary (topology); Argument (complex analysis); Mathematical analysis; Physics","score_opus":0.017175639714539514,"score_gpt":0.2548183850144974,"score_spread":0.23764274529995788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040204415","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2933249,0.018945666,0.112387076,0.01746659,0.0010132659,0.000043663455,0.0005650193,0.0003640688,0.5558897],"genre_scores_gemma":[0.97281116,0.002691534,0.0060971053,0.0007997719,0.0005828761,0.000039812905,0.000103771294,0.00007423573,0.016799774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996038,0.00012944938,0.000014347535,0.00007292863,0.00007890949,0.00010062318],"domain_scores_gemma":[0.9984688,0.0008904118,0.00022518633,0.00009318261,0.00016342473,0.0001589628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077967695,0.0004304578,0.0008330473,0.0016645716,0.0019790763,0.002918399,0.0012214612,0.0010609754,0.0098748095],"category_scores_gemma":[0.0057306,0.00034312936,0.000512963,0.0010901521,0.0027304539,0.00339431,0.0021488694,0.002938586,0.0013000594],"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.000029714482,0.000004569536,0.00007060438,0.000024340303,0.0000044550707,0.000051124305,0.000060493323,0.0008216068,0.00019663193,0.9955011,0.0011739067,0.0020613808],"study_design_scores_gemma":[0.000023553896,0.0000075873068,0.00013196966,0.000024028146,0.000005811496,0.00015498734,0.00008041381,0.0052085742,0.00019232207,0.99055886,0.003602545,0.0000093725685],"about_ca_topic_score_codex":0.001361623,"about_ca_topic_score_gemma":0.00083563355,"teacher_disagreement_score":0.0098748095,"about_ca_system_score_codex":0.0011069309,"about_ca_system_score_gemma":0.0010341973,"threshold_uncertainty_score":0.033034563},"labels":[],"label_agreement":null},{"id":"W3040495802","doi":"10.2172/1635086","title":"Initial Exploration of the Use of Mixed Precision in Iterative Solvers (B639388 Subcontract Quarter I Report)","year":2020,"lang":"en","type":"report","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Computation; Subspace topology; Computer science; Krylov subspace; Remainder; Intersection (aeronautics); Focus (optics); Algorithm; Iterative method; Mathematics; Engineering; Arithmetic; Artificial intelligence; Transport engineering; Physics; Geography","score_opus":0.1102958736016235,"score_gpt":0.31746430434531475,"score_spread":0.20716843074369123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040495802","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09106685,0.004880776,0.6988314,0.011585012,0.0009864748,0.0007071569,0.001385867,0.005369345,0.18518716],"genre_scores_gemma":[0.2865095,0.002962877,0.6775342,0.000999028,0.00027851074,0.0009380117,0.0020876755,0.0017203698,0.026969865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9915726,0.003945954,0.00019940257,0.00041018656,0.0035272671,0.000344568],"domain_scores_gemma":[0.9805345,0.01146316,0.00040950347,0.0024262893,0.004597079,0.00056951714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012476949,0.0006595266,0.00061493507,0.0008490907,0.00094552716,0.003655542,0.0013612275,0.0009226073,0.01310688],"category_scores_gemma":[0.030695414,0.0005796029,0.0005588604,0.0015647425,0.00092044333,0.0027614199,0.0022822306,0.0022199168,0.00322293],"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.0012619041,0.0009907812,0.0039997273,0.0009725105,0.00009505572,0.00027309608,0.0010086306,0.062128827,0.012728236,0.26847997,0.115654685,0.5324065],"study_design_scores_gemma":[0.00032011914,0.0011774942,0.002738738,0.0010348632,0.00006567826,0.00022821662,0.0008427367,0.60956085,0.042549632,0.14940679,0.19197005,0.00010489322],"about_ca_topic_score_codex":0.0032169474,"about_ca_topic_score_gemma":0.005554132,"teacher_disagreement_score":0.01310688,"about_ca_system_score_codex":0.0013488746,"about_ca_system_score_gemma":0.0027548582,"threshold_uncertainty_score":0.0659852},"labels":[],"label_agreement":null},{"id":"W3046922746","doi":"10.48550/arxiv.2008.01012","title":"The Largest Entry in the Inverse of a Vandermonde Matrix","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Vandermonde matrix; Inverse; Matrix (chemical analysis); Mathematics; Combinatorics; Value (mathematics); Absolute (philosophy); Physics; Statistics; Geometry; Chemistry; Philosophy; Eigenvalues and eigenvectors; Theology","score_opus":0.05168541906583105,"score_gpt":0.19520457134481362,"score_spread":0.14351915227898257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046922746","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44867757,0.0014151064,0.5208921,0.0018516382,0.0003357768,0.00007295551,0.0011161701,0.0006122883,0.025026362],"genre_scores_gemma":[0.8975574,0.00070974283,0.09232262,0.0003030495,0.00036539274,0.00012552126,0.0007720724,0.00024490073,0.0075993114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989963,0.00023070106,0.0000526435,0.0002928461,0.0002734545,0.00015410845],"domain_scores_gemma":[0.99182445,0.0051195864,0.0010462689,0.0007015546,0.0008850611,0.0004230732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011760667,0.00091252546,0.00065254,0.0013889426,0.0005821865,0.001564511,0.0009703859,0.0008324534,0.004544474],"category_scores_gemma":[0.013347222,0.00035810718,0.00032703322,0.0009236491,0.0020848021,0.0036598293,0.0010856036,0.001368392,0.0009527067],"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.00070661836,0.00023797184,0.008057611,0.00058747776,0.00009173459,0.0009616642,0.00091223494,0.060734577,0.07699524,0.7757038,0.009657601,0.06535354],"study_design_scores_gemma":[0.000037284295,0.00029692895,0.00391836,0.00013683991,0.000037708105,0.0011944186,0.00032105274,0.2745953,0.03642193,0.6759497,0.0069290604,0.00016142144],"about_ca_topic_score_codex":0.00045944907,"about_ca_topic_score_gemma":0.0004940529,"teacher_disagreement_score":0.004544474,"about_ca_system_score_codex":0.00044153127,"about_ca_system_score_gemma":0.00055341335,"threshold_uncertainty_score":0.015202761},"labels":[],"label_agreement":null},{"id":"W3047080367","doi":"10.1137/19m1290991","title":"BiLQ: An Iterative Method for Nonsymmetric Linear Systems with a Quasi-Minimum Error Property","year":2020,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lanczos resampling; Mathematics; Residual; Applied mathematics; Tridiagonal matrix; Lanczos algorithm; Linear system; Monotonic function; Norm (philosophy); Eigenvalues and eigenvectors; Mathematical optimization; Mathematical analysis; Algorithm","score_opus":0.027447030609016324,"score_gpt":0.324059853564332,"score_spread":0.29661282295531566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047080367","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015046636,0.000074197866,0.9962483,0.00008548368,0.0000351145,0.000031543626,0.00003348668,0.00089400675,0.0010931413],"genre_scores_gemma":[0.07581807,0.00011911375,0.9181412,0.00023342189,0.00005069431,0.00032769094,0.00027357144,0.0010986901,0.0039376086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929535,0.00024397648,0.00002967407,0.000054317683,0.00031410783,0.000062534884],"domain_scores_gemma":[0.9990134,0.00039298774,0.00012224313,0.00011723695,0.00028890098,0.000065226115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013452587,0.0009612202,0.0010039815,0.00050949195,0.0004913583,0.00074255106,0.001771425,0.0011291843,0.0058813393],"category_scores_gemma":[0.0030304499,0.0006226173,0.0006698814,0.0005010933,0.000933252,0.00097168726,0.0022665714,0.0017641473,0.0025967984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023793231,0.0001328092,0.0008580402,0.00070184475,0.000101175625,0.00021624536,0.0003257168,0.73968834,0.021612916,0.06132599,0.01436502,0.1604339],"study_design_scores_gemma":[0.000025850095,0.000031695403,0.000047407233,0.000012763427,0.0000033305264,0.000017338041,0.000010006918,0.9908619,0.0017375071,0.0036961394,0.003546482,0.000009530236],"about_ca_topic_score_codex":0.0026730723,"about_ca_topic_score_gemma":0.0031174438,"teacher_disagreement_score":0.0058813393,"about_ca_system_score_codex":0.0004547041,"about_ca_system_score_gemma":0.0015006069,"threshold_uncertainty_score":0.019675016},"labels":[],"label_agreement":null},{"id":"W306917649","doi":"10.13001/1081-3810.3010","title":"Sparse spectrally arbitrary patterns","year":2015,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Redeemer University","funders":"","keywords":"Mathematics; Jacobian matrix and determinant; Monic polynomial; Matrix (chemical analysis); Order (exchange); Nilpotent matrix; Companion matrix; Zero (linguistics); Pure mathematics; Eigenvalues and eigenvectors; Polynomial; Combinatorics; Mathematical analysis; Polynomial matrix; Matrix polynomial; Applied mathematics; Symmetric matrix; Matrix function; Physics","score_opus":0.015614961687269835,"score_gpt":0.24412826624810127,"score_spread":0.22851330456083144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W306917649","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7767829,0.00018528859,0.18049407,0.00054379576,0.0001248235,0.00008219983,0.00030773671,0.00044006604,0.041039113],"genre_scores_gemma":[0.96563685,0.00006947212,0.02663869,0.00013318747,0.00004188041,0.000043618482,0.00022797416,0.00009420864,0.0071141147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996563,0.00006994522,0.000018426783,0.000069246526,0.00010183261,0.00008408898],"domain_scores_gemma":[0.99901223,0.00025558638,0.00017606126,0.00022617562,0.0001941747,0.00013589971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002214563,0.00036966574,0.00034655826,0.00051673333,0.0006722673,0.0007321167,0.0005629213,0.00055529125,0.0065748366],"category_scores_gemma":[0.0025891303,0.00023005312,0.00026723582,0.00048413116,0.0010740669,0.0012427504,0.00083342526,0.00069913256,0.0007031045],"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.0003628111,0.0001657374,0.0066066794,0.00019921213,0.000032557786,0.00174148,0.0006559862,0.02479983,0.05179305,0.86481965,0.0061440445,0.04267894],"study_design_scores_gemma":[0.00006742679,0.00021843113,0.003311043,0.00003501787,0.000018967517,0.0016402095,0.0006031019,0.18998976,0.019581407,0.7724463,0.012028432,0.00006005573],"about_ca_topic_score_codex":0.00053288514,"about_ca_topic_score_gemma":0.0010658335,"teacher_disagreement_score":0.0065748366,"about_ca_system_score_codex":0.00028203247,"about_ca_system_score_gemma":0.0003727935,"threshold_uncertainty_score":0.021995008},"labels":[],"label_agreement":null},{"id":"W3080851565","doi":"10.4153/s0008439520000648","title":"Variational principles for symplectic eigenvalues","year":2020,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hermitian matrix; Symplectic geometry; Eigenvalues and eigenvectors; Diagonal; Positive-definite matrix; Pure mathematics; Diagonal matrix; Matrix (chemical analysis); Mathematical physics; Algebra over a field; Combinatorics; Geometry; Quantum mechanics; Physics","score_opus":0.03569559929741888,"score_gpt":0.23322874707977417,"score_spread":0.19753314778235528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080851565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13335371,0.0007004127,0.79073024,0.0025042207,0.00019825523,0.00007061031,0.00019096938,0.00010777059,0.07214378],"genre_scores_gemma":[0.901842,0.00049509003,0.07037823,0.0005673075,0.0002313866,0.00016839836,0.00014477347,0.00025257035,0.025920277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999388,0.00022004184,0.000021332444,0.00009868463,0.00017787746,0.00009411238],"domain_scores_gemma":[0.99881893,0.0005962493,0.00012598721,0.00012111507,0.0001732324,0.00016448087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019191817,0.0005543697,0.0005709017,0.0008954987,0.0010379668,0.0014063168,0.00088085426,0.0009683869,0.0066844746],"category_scores_gemma":[0.0041036303,0.000431255,0.000663822,0.00038775158,0.0028133285,0.001998207,0.002337333,0.0016114708,0.00064598134],"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.000005416125,0.000005692595,0.00008167906,0.000012988619,0.00000485527,0.000021797196,0.00004721963,0.0056964406,0.0004901688,0.99147755,0.00061065995,0.0015455924],"study_design_scores_gemma":[0.000006722362,0.000012209318,0.00011913082,0.000012476393,0.0000018295498,0.000027326521,0.000039342085,0.09328063,0.00023808435,0.9044657,0.0017892858,0.0000074295463],"about_ca_topic_score_codex":0.000974003,"about_ca_topic_score_gemma":0.0011626154,"teacher_disagreement_score":0.0066844746,"about_ca_system_score_codex":0.0010633164,"about_ca_system_score_gemma":0.0007957841,"threshold_uncertainty_score":0.022361815},"labels":[],"label_agreement":null},{"id":"W3083409701","doi":"10.1137/20m1365326","title":"A Multiprecision Derivative-Free Schur--Parlett Algorithm for Computing Matrix Functions","year":2021,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Engineering and Physical Sciences Research Council; Royal Society","keywords":"Schur decomposition; Mathematics; Algebra over a field; Matrix (chemical analysis); Matrix function; Schur product theorem; Schur's theorem; Decomposition; Algorithm; Schur complement; Pure mathematics; Symmetric matrix; Eigenvalues and eigenvectors","score_opus":0.012377535516921378,"score_gpt":0.294455632274379,"score_spread":0.2820780967574576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083409701","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018559052,0.00009317226,0.992833,0.0000712534,0.000050651808,0.0000575603,0.00008754853,0.0023844957,0.002566264],"genre_scores_gemma":[0.03749354,0.00010718842,0.9565713,0.00008899538,0.00004104113,0.00023499677,0.00032196002,0.0007995618,0.0043414314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891186,0.00019468844,0.00006467425,0.00012575868,0.000607758,0.000095309726],"domain_scores_gemma":[0.9981232,0.0005805505,0.000118347285,0.00035402837,0.0007467755,0.000077073375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015180532,0.001458332,0.0010636881,0.0014874529,0.0012332457,0.0017434227,0.0023104674,0.0012217206,0.017397398],"category_scores_gemma":[0.00593974,0.00056911533,0.000902043,0.0014716702,0.00086986006,0.0019074669,0.0014118213,0.0020602334,0.010625775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004017847,0.00016822445,0.000969152,0.0004619187,0.0001054986,0.00028008025,0.00029766574,0.15281174,0.019331772,0.21422549,0.03279525,0.57815146],"study_design_scores_gemma":[0.00010982099,0.0001041951,0.00021909585,0.000051491555,0.000020974801,0.00018649086,0.000043235123,0.9086466,0.020865919,0.044505153,0.025185922,0.00006119697],"about_ca_topic_score_codex":0.0033902184,"about_ca_topic_score_gemma":0.006395856,"teacher_disagreement_score":0.017397398,"about_ca_system_score_codex":0.001336835,"about_ca_system_score_gemma":0.0024467958,"threshold_uncertainty_score":0.05820012},"labels":[],"label_agreement":null},{"id":"W3092356021","doi":"10.5539/jmr.v12n5p43","title":"A short note on determinantal representation of stable polynomials","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hermitian matrix; Representation (politics); Substitution (logic); Identity (music); Polynomial; Zero (linguistics); Algebra over a field; Pure mathematics; Combinatorics; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.1479130156929789,"score_gpt":0.419667799225592,"score_spread":0.27175478353261306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092356021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10669912,0.009923503,0.66057676,0.009849671,0.008536233,0.000046790778,0.0003728679,0.0008589889,0.2031361],"genre_scores_gemma":[0.84089226,0.0081965765,0.09423475,0.004775008,0.006930582,0.000046374564,0.00036582953,0.0005957779,0.043963008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993611,0.00021328179,0.000038016744,0.00009447584,0.00021988552,0.00007323567],"domain_scores_gemma":[0.99897265,0.0005880951,0.00006629634,0.0001401677,0.00015722188,0.00007555641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011756271,0.0004626772,0.00043975006,0.0007014307,0.00078690297,0.0016537423,0.0005607695,0.0006113429,0.0071737873],"category_scores_gemma":[0.002998567,0.00022798308,0.00052050385,0.0009937751,0.0017250295,0.0027475385,0.001950799,0.0025726121,0.0016523493],"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.000023315457,0.00001588533,0.00017039606,0.00009794732,0.0000064920714,0.00022680691,0.00025536286,0.0006471762,0.0023924967,0.9756929,0.005428834,0.015042334],"study_design_scores_gemma":[0.00001149117,0.00008919898,0.00039589073,0.000033021257,0.000010597475,0.00046520893,0.00011243861,0.0062372144,0.0024195574,0.9500247,0.04017355,0.000026978936],"about_ca_topic_score_codex":0.0005941211,"about_ca_topic_score_gemma":0.0004431188,"teacher_disagreement_score":0.0071737873,"about_ca_system_score_codex":0.0004296551,"about_ca_system_score_gemma":0.00036561285,"threshold_uncertainty_score":0.023998678},"labels":[],"label_agreement":null},{"id":"W3094776125","doi":"10.48550/arxiv.2010.15554","title":"Investigation of the PPT Squared Conjecture for High Dimensions","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Conjecture; Mathematics; Square (algebra); Statistics; Mathematical economics; Combinatorics; Geometry","score_opus":0.06480592813057474,"score_gpt":0.1785855805063808,"score_spread":0.11377965237580605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094776125","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54610896,0.0013628585,0.3074014,0.014730189,0.0008942648,0.00013004597,0.00049268716,0.00067084667,0.12820876],"genre_scores_gemma":[0.9598467,0.00044236387,0.03140024,0.0009420694,0.00047356088,0.000104821826,0.0002420923,0.00007741735,0.006470659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752396,0.0008930002,0.000086127344,0.000442328,0.0007147835,0.00033982162],"domain_scores_gemma":[0.9900788,0.0060268603,0.00077623094,0.0017351243,0.0006721545,0.00071074377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024284662,0.0007703893,0.0010109633,0.00095160224,0.0019611472,0.0036031099,0.001680249,0.0023339775,0.007511008],"category_scores_gemma":[0.013756449,0.00051724433,0.0007833238,0.0008275164,0.0069001876,0.008644235,0.0059501864,0.0054877624,0.0006784394],"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.000052995278,0.000023981569,0.0004091159,0.000041497417,0.0000062947347,0.00008406662,0.00010465303,0.0032967008,0.00079168135,0.99208236,0.0012824449,0.0018241772],"study_design_scores_gemma":[0.000026389509,0.000028553763,0.00013836585,0.000016593114,0.0000042528895,0.000097803495,0.00006839196,0.038480505,0.00078893284,0.9587972,0.001537988,0.000015055817],"about_ca_topic_score_codex":0.00050631707,"about_ca_topic_score_gemma":0.00037228919,"teacher_disagreement_score":0.007511008,"about_ca_system_score_codex":0.0012101036,"about_ca_system_score_gemma":0.00091771863,"threshold_uncertainty_score":0.025126874},"labels":[],"label_agreement":null},{"id":"W3097324804","doi":"10.46298/hrj.2020.6603","title":"Multiplicatively dependent vectors with coordinates algebraic numbers","year":2020,"lang":"en","type":"article","venue":"Hardy-Ramanujan Journal","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Algebraic number; Mathematics; Point (geometry); Degree (music); Property (philosophy); Log-polar coordinates; Combinatorics; Generalized coordinates; Pure mathematics; Physics; Mathematical analysis; Geometry","score_opus":0.01353891289733376,"score_gpt":0.2126500746548171,"score_spread":0.19911116175748336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097324804","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76391274,0.0006800379,0.21221648,0.0005156351,0.0002510996,0.000078616715,0.00026193194,0.0001914217,0.021892136],"genre_scores_gemma":[0.9456467,0.0005271142,0.04144763,0.00018464694,0.0002974478,0.00013492488,0.00045317633,0.00006339707,0.011244903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982998,0.00036011141,0.00007350897,0.00042044694,0.0006301612,0.00021598669],"domain_scores_gemma":[0.99702567,0.0008185879,0.00069699547,0.00042113292,0.00066474476,0.00037292505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092982734,0.0008248361,0.00059237925,0.0013497163,0.0012626793,0.0024744633,0.0013560711,0.00057831936,0.003193093],"category_scores_gemma":[0.008050294,0.00041907924,0.00043180477,0.0009688663,0.0019070193,0.0025828776,0.0042493558,0.002139854,0.00085618324],"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.00034731074,0.0000855038,0.00507958,0.00013893998,0.00006890516,0.00037737924,0.0008495998,0.009599517,0.027980322,0.93520236,0.0017232418,0.018547358],"study_design_scores_gemma":[0.00018732676,0.0014966037,0.009529159,0.000121713005,0.00021285283,0.001934497,0.0014916579,0.1124144,0.07688863,0.7379861,0.057504714,0.00023236324],"about_ca_topic_score_codex":0.0006197837,"about_ca_topic_score_gemma":0.00046019536,"teacher_disagreement_score":0.003193093,"about_ca_system_score_codex":0.00082514045,"about_ca_system_score_gemma":0.00047076828,"threshold_uncertainty_score":0.010681927},"labels":[],"label_agreement":null},{"id":"W3104879845","doi":"10.1088/1751-8121/ab7c1c","title":"On the singularities of the R–R AdS <sub>3</sub> × S <sup>3</sup> × T <sup>4</sup> S matrix","year":2020,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and Theoretical","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Science and Technology Facilities Council","keywords":"Physics; Matrix (chemical analysis); Combinatorics; Mathematics; Chemistry","score_opus":0.011130701743908065,"score_gpt":0.2216047037195464,"score_spread":0.21047400197563834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104879845","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88790333,0.00025559138,0.09075502,0.0006929887,0.00007346087,0.000026305104,0.00004261945,0.0002683622,0.019982344],"genre_scores_gemma":[0.9874164,0.00008452812,0.008796076,0.00007359348,0.000027009031,0.000013454118,0.00002813819,0.00005749252,0.0035033764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99985814,0.000050394487,0.000005768658,0.000017714676,0.00004042065,0.000027545566],"domain_scores_gemma":[0.9994331,0.00023770839,0.000100652636,0.0000631633,0.000052905074,0.00011238876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056384865,0.0004931406,0.0004181293,0.0010129267,0.0006917132,0.0010270199,0.000751403,0.0009349826,0.004102874],"category_scores_gemma":[0.002024836,0.00023978058,0.00044679234,0.00032920888,0.0015511821,0.0014326744,0.0006620507,0.00071104465,0.00051450275],"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.00020952149,0.000063057225,0.0012155839,0.000077690966,0.000015135667,0.0011689302,0.00041410787,0.019201245,0.015662549,0.95387995,0.0012942853,0.006797949],"study_design_scores_gemma":[0.00005917056,0.00008187777,0.0010308946,0.000039637023,0.000010813118,0.0007520204,0.00021675689,0.34131834,0.007358024,0.6478462,0.0012447806,0.0000415417],"about_ca_topic_score_codex":0.00074777997,"about_ca_topic_score_gemma":0.00063419435,"teacher_disagreement_score":0.004102874,"about_ca_system_score_codex":0.00044439672,"about_ca_system_score_gemma":0.00026390073,"threshold_uncertainty_score":0.013725519},"labels":[],"label_agreement":null},{"id":"W3104908947","doi":"10.22541/au.160526726.64455910/v1","title":"Least-squares solutions of the generalized reduced biquaternion matrix equations","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Manitoba","funders":"","keywords":"Mathematics; Matrix (chemical analysis); Representation (politics); Applied mathematics; Matrix representation; Least-squares function approximation; Linear least squares; Algebra over a field; Pure mathematics; Algorithm; Singular value decomposition; Statistics; Physics; Group (periodic table)","score_opus":0.05569353493695403,"score_gpt":0.2932007692613639,"score_spread":0.23750723432440987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104908947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030428383,0.0001750528,0.99500126,0.000117373354,0.00004010954,0.0000136697945,0.000039474256,0.0001269019,0.0014433885],"genre_scores_gemma":[0.123292714,0.00086792494,0.86527175,0.00017626776,0.000099756784,0.00012287837,0.00036196713,0.00025078206,0.009555982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928266,0.00024923368,0.000039539707,0.00014902036,0.00023587835,0.000043709533],"domain_scores_gemma":[0.99928135,0.00024946115,0.00011136735,0.000113755515,0.00022676945,0.000017261493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009283198,0.0010346279,0.000749489,0.00050634384,0.00029050658,0.00091440155,0.0009673841,0.00089536,0.0042904196],"category_scores_gemma":[0.003371991,0.00037609343,0.00056967,0.00086182356,0.0007406252,0.0015478595,0.0008574782,0.0012371324,0.0016207411],"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.00009122248,0.00003976263,0.0005826744,0.00046903983,0.000103910934,0.00020543681,0.00026002756,0.53100115,0.025219146,0.2239776,0.0072084065,0.21084166],"study_design_scores_gemma":[0.000014259538,0.000029995857,0.00022482139,0.00002228969,0.000011414508,0.000118861855,0.000050782186,0.94218856,0.0045223385,0.04378504,0.009003939,0.000027669237],"about_ca_topic_score_codex":0.0017716222,"about_ca_topic_score_gemma":0.0018938908,"teacher_disagreement_score":0.0042904196,"about_ca_system_score_codex":0.00034449404,"about_ca_system_score_gemma":0.00073784613,"threshold_uncertainty_score":0.014352918},"labels":[],"label_agreement":null},{"id":"W3107222777","doi":"10.1088/2399-6528/ab31da","title":"Matrix logarithms and range of the exponential maps for the symmetry groups SL(2,R),SL(2,C) , and the Lorentz group","year":2019,"lang":"en","type":"article","venue":"Journal of Physics Communications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Algorithm; Physics; Mathematics","score_opus":0.0151000598454302,"score_gpt":0.2557345233920072,"score_spread":0.240634463546577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107222777","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7792463,0.0023289977,0.07076746,0.002985356,0.0003222077,0.000066945686,0.00038065392,0.00067476026,0.14322735],"genre_scores_gemma":[0.9788921,0.00047202752,0.005198732,0.00017118675,0.00032486964,0.000047478123,0.0001724427,0.00009747575,0.014623742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955934,0.0001081638,0.000025279562,0.00007795347,0.00014547106,0.00008375325],"domain_scores_gemma":[0.9987613,0.00045918633,0.00019589566,0.000082218394,0.00020723685,0.00029419173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088743074,0.0005968397,0.00042944707,0.002590612,0.0010934423,0.002841334,0.000989476,0.0007562256,0.009257559],"category_scores_gemma":[0.0038702805,0.00028142866,0.0005135136,0.0009801362,0.0021197936,0.0049834945,0.0014850484,0.0017563642,0.0014679045],"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.000054533954,0.000043226308,0.000242039,0.00002943724,0.0000039821043,0.00021884678,0.0003369494,0.000835587,0.0014478103,0.990906,0.00097143836,0.0049101347],"study_design_scores_gemma":[0.000026995018,0.000040317205,0.0005041008,0.000019830737,0.0000038953,0.00028884347,0.00016946775,0.007476837,0.0011018116,0.9881086,0.0022313548,0.000028004039],"about_ca_topic_score_codex":0.0008135902,"about_ca_topic_score_gemma":0.0004668067,"teacher_disagreement_score":0.009257559,"about_ca_system_score_codex":0.0010604433,"about_ca_system_score_gemma":0.00050663255,"threshold_uncertainty_score":0.03096962},"labels":[],"label_agreement":null},{"id":"W3114754715","doi":"10.1016/j.jmaa.2020.124893","title":"Asymptotic properties of neutral type linear systems","year":2020,"lang":"en","type":"preprint","venue":"Journal of Mathematical Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homogeneous; Bounded function; Exponential stability; Type (biology); Mathematics; Exponential function; Stability (learning theory); Class (philosophy); Term (time); Matrix (chemical analysis); Combinatorics; Mathematical analysis; Applied mathematics; Pure mathematics; Physics; Materials science; Nonlinear system; Quantum mechanics; Computer science","score_opus":0.03451063861328303,"score_gpt":0.26812720568706727,"score_spread":0.23361656707378425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114754715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3320744,0.001484217,0.58299625,0.0021975886,0.0003481742,0.00009387994,0.00042729187,0.00047305558,0.07990518],"genre_scores_gemma":[0.9727604,0.00073212635,0.009059797,0.00026669507,0.00031872682,0.00009436717,0.0002899214,0.000095826,0.016382197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934536,0.00025330507,0.000024669445,0.000086325184,0.00019267053,0.00009772358],"domain_scores_gemma":[0.9923977,0.004702508,0.00063154154,0.00027329964,0.001511541,0.0004834302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001527517,0.0006557248,0.000684579,0.0013909704,0.0006532565,0.0019764258,0.00094576634,0.00089400593,0.009719489],"category_scores_gemma":[0.0135772135,0.00034766053,0.0005109115,0.0006428751,0.001810734,0.002404543,0.0017403607,0.0016027533,0.00091073656],"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.0001770195,0.00009107344,0.0016528429,0.0001744124,0.000049183032,0.0001775851,0.00031076247,0.036515918,0.005781631,0.9387523,0.0033646184,0.012952587],"study_design_scores_gemma":[0.000039377315,0.00009300369,0.00076637225,0.000043139265,0.000021027025,0.00022947925,0.00016173607,0.36841238,0.0013540285,0.6272694,0.001571795,0.000038264854],"about_ca_topic_score_codex":0.00094946765,"about_ca_topic_score_gemma":0.00055569864,"teacher_disagreement_score":0.009719489,"about_ca_system_score_codex":0.0010503638,"about_ca_system_score_gemma":0.000803149,"threshold_uncertainty_score":0.03251493},"labels":[],"label_agreement":null},{"id":"W3118236707","doi":"10.5539/jmr.v13n1p1","title":"A Feasible Approach to Determine the Optimal Relaxation Parameters in Each Iteration for the SOR Method","year":2021,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Relaxation (psychology); Iterative method; Mathematical optimization; Interval (graph theory); Applied mathematics; Function (biology); Matrix (chemical analysis); Projection (relational algebra); Value (mathematics); Algorithm; Combinatorics; Statistics","score_opus":0.17977522143662342,"score_gpt":0.42004551351248864,"score_spread":0.24027029207586523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118236707","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010218712,0.00007807193,0.9980889,0.00004795042,0.000014520574,0.00002632312,0.000007347533,0.00005355979,0.00066133315],"genre_scores_gemma":[0.065632835,0.00038527377,0.9321245,0.00008330779,0.000049730083,0.00031991943,0.00007064882,0.0001524698,0.0011812984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841213,0.0007889488,0.000082436614,0.00021569112,0.00040143018,0.00009924285],"domain_scores_gemma":[0.9980527,0.0012083419,0.00018063436,0.00014284774,0.0003483042,0.00006723549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026603409,0.0015520517,0.0012501469,0.0010026419,0.00064945157,0.0010614091,0.0013084462,0.0013579451,0.0043036607],"category_scores_gemma":[0.0064285505,0.000872016,0.0011912312,0.00073518953,0.0011829219,0.0015961712,0.0014846043,0.0025387215,0.0009931646],"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.00018754874,0.000105650106,0.00043123928,0.0004755754,0.00006486668,0.00016170148,0.00021943613,0.8135827,0.009937018,0.08333934,0.0019619865,0.08953287],"study_design_scores_gemma":[0.000017171995,0.00005578794,0.000047766807,0.00003475746,0.000010658308,0.000047078804,0.000022223907,0.9871159,0.001831565,0.008805079,0.0019929297,0.000019069945],"about_ca_topic_score_codex":0.0012776258,"about_ca_topic_score_gemma":0.0013128676,"teacher_disagreement_score":0.0043036607,"about_ca_system_score_codex":0.0004713217,"about_ca_system_score_gemma":0.0019095106,"threshold_uncertainty_score":0.014397204},"labels":[],"label_agreement":null},{"id":"W3120523256","doi":"10.1016/j.jmaa.2021.125566","title":"Exponential stability of systems of vector delay differential equations with applications to second order equations","year":2021,"lang":"en","type":"preprint","venue":"Journal of Mathematical Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Order (exchange); Differential equation; Exponential function; Matrix (chemical analysis); Exponential stability; Combinatorics; Mathematical analysis; Hurwitz matrix; Delay differential equation; Stability (learning theory); Physics; Quantum mechanics","score_opus":0.023095973118078088,"score_gpt":0.2726357101568076,"score_spread":0.2495397370387295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120523256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16548389,0.004063572,0.8057937,0.0017660568,0.0004552649,0.000060227474,0.00012338515,0.0001421504,0.022111857],"genre_scores_gemma":[0.97389686,0.0014628965,0.010898408,0.00008816322,0.00014592591,0.00005716868,0.00005788666,0.000036299727,0.013356415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978477,0.000073511685,0.000011366915,0.000042171192,0.000060438044,0.000027863756],"domain_scores_gemma":[0.99857974,0.00086121407,0.0001312125,0.000040965057,0.00033338816,0.00005349937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064427726,0.0007012666,0.000627148,0.0006585082,0.0003796275,0.0016761858,0.00046726302,0.00082428736,0.002427624],"category_scores_gemma":[0.00354544,0.0002341673,0.00039447314,0.000698083,0.00092756207,0.00088131014,0.0011990623,0.0009541338,0.00016851885],"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.00024288146,0.00008743633,0.001428658,0.0002602445,0.00007790459,0.00022522004,0.0006170823,0.5131894,0.013837109,0.42773682,0.0021983525,0.04009892],"study_design_scores_gemma":[0.00001255,0.000028957213,0.00023176057,0.000012489168,0.0000071564714,0.000044184173,0.00005041864,0.9293488,0.00063724036,0.06848152,0.0011337645,0.000011055603],"about_ca_topic_score_codex":0.0021941783,"about_ca_topic_score_gemma":0.0011735081,"teacher_disagreement_score":0.002427624,"about_ca_system_score_codex":0.00061315566,"about_ca_system_score_gemma":0.00070536725,"threshold_uncertainty_score":0.008121252},"labels":[],"label_agreement":null},{"id":"W3121081385","doi":"10.1016/j.laa.2020.12.019","title":"Corrigendum to “Total positivity of sums, Hadamard products and Hadamard powers: Results and counterexamples” [Linear Algebra Appl. 520 (2017) 242–259]","year":2021,"lang":"en","type":"erratum","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Hadamard transform; Counterexample; Mathematics; Linear algebra; Hadamard three-lines theorem; Algebra over a field; Pure mathematics; Hadamard product; Discrete mathematics; Mathematical analysis","score_opus":0.021010256871651558,"score_gpt":0.25500735058405244,"score_spread":0.23399709371240088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121081385","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005539061,0.0060085147,0.0050820457,0.10906821,0.821069,0.00005699779,0.0018737846,0.00078056124,0.05550702],"genre_scores_gemma":[0.026696453,0.015128444,0.012506986,0.09685787,0.20402585,0.00029449514,0.0039309985,0.003047029,0.63751185],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949809,0.00088967173,0.00052403484,0.00088041567,0.0023975193,0.00032758783],"domain_scores_gemma":[0.9871314,0.0038861502,0.0005065241,0.0010417899,0.0069544963,0.0004797426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025987604,0.0020379082,0.002270973,0.0039039054,0.004311502,0.004416474,0.0033503503,0.003910629,0.09133409],"category_scores_gemma":[0.03155956,0.000999169,0.0020383496,0.0031952278,0.003358016,0.005061199,0.0024142184,0.0070249187,0.042635452],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023451268,0.000009132042,0.000038705704,0.000096308504,0.000011330942,0.000107543434,0.00003216233,0.00006611263,0.000048117596,0.0078979675,0.9870728,0.004596287],"study_design_scores_gemma":[0.000035782796,0.000024453977,0.0007334892,0.00025252724,0.000048267655,0.0004609946,0.000095667805,0.0007222749,0.0004495712,0.037780367,0.9593342,0.00006233047],"about_ca_topic_score_codex":0.017652333,"about_ca_topic_score_gemma":0.023073087,"teacher_disagreement_score":0.09133409,"about_ca_system_score_codex":0.0052035,"about_ca_system_score_gemma":0.0028750477,"threshold_uncertainty_score":0.30554295},"labels":[],"label_agreement":null},{"id":"W3122570226","doi":"","title":"Second-order approximation of dynamic models without the use of tensors","year":2010,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hessian matrix; Fortran; Code (set theory); Representation (politics); Computer science; Order (exchange); USable; MATLAB; Matrix representation; Key (lock); Matrix (chemical analysis); Applied mathematics; Algorithm; Source code; Computational science; Programming language; Theoretical computer science; Algebra over a field; Mathematics; Pure mathematics; Physics","score_opus":0.047006670626060516,"score_gpt":0.303268090078801,"score_spread":0.2562614194527405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122570226","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034058555,0.0003988901,0.9903561,0.0002445406,0.00009712164,0.000015289006,0.00008571584,0.00017040875,0.0052261604],"genre_scores_gemma":[0.45322376,0.004045607,0.4738418,0.0007349727,0.0006390683,0.0003350288,0.0009832864,0.00072355627,0.065472834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995466,0.00012512895,0.00002189084,0.00007577479,0.00017095666,0.000059514667],"domain_scores_gemma":[0.9988991,0.0004844548,0.0001718358,0.0002160766,0.00014985871,0.000078751276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011374826,0.0012293345,0.0011606545,0.0010875325,0.00043458102,0.0015237927,0.0013460463,0.0013244811,0.0046697147],"category_scores_gemma":[0.0042178347,0.0006645784,0.0015343379,0.0009716451,0.0009730064,0.0024399976,0.0014988768,0.0024116028,0.0019137529],"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.000034264525,0.00005196253,0.00042095935,0.00016906284,0.000057686193,0.00016469117,0.00017475223,0.47609597,0.003630712,0.49287874,0.0043423343,0.021978823],"study_design_scores_gemma":[0.0000028620375,0.000009519459,0.00007261708,0.0000094462775,0.0000053301687,0.00004081779,0.000010896723,0.93451315,0.0003671512,0.06178024,0.0031760717,0.000011860372],"about_ca_topic_score_codex":0.007982775,"about_ca_topic_score_gemma":0.006654455,"teacher_disagreement_score":0.007982775,"about_ca_system_score_codex":0.0010029514,"about_ca_system_score_gemma":0.0012117467,"threshold_uncertainty_score":0.015872598},"labels":[],"label_agreement":null},{"id":"W3124030041","doi":"10.1137/20m1347139","title":"On the Asymptotic Linear Convergence Speed of Anderson Acceleration, Nesterov Acceleration, and Nonlinear GMRES","year":2021,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":26,"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":"Generalized minimal residual method; Acceleration; Mathematics; Convergence (economics); Nonlinear system; Applied mathematics; Mathematical analysis; Linear system; Classical mechanics; Physics","score_opus":0.032217476640193365,"score_gpt":0.2748762159755561,"score_spread":0.24265873933536275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124030041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06237616,0.015474251,0.83449316,0.008277542,0.0020314532,0.00016566683,0.00031501063,0.00094298564,0.07592371],"genre_scores_gemma":[0.7208902,0.009204668,0.22968514,0.0025052114,0.0024868457,0.0006353166,0.0006195138,0.0020104623,0.031962678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959092,0.0018674443,0.00018161783,0.00033795479,0.0013015856,0.00040216476],"domain_scores_gemma":[0.9552834,0.034413505,0.0013043017,0.002053264,0.005818733,0.0011267962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010077711,0.0023428604,0.0015132546,0.00319797,0.0014452608,0.0020839344,0.0019810295,0.0018500254,0.0069984384],"category_scores_gemma":[0.06803969,0.0008777413,0.0015040003,0.0019828244,0.0049098833,0.0065024737,0.0053813714,0.007550177,0.0014195464],"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.0014575055,0.00021781556,0.003942737,0.00077143515,0.00015597812,0.00039621262,0.0007559784,0.1844726,0.0084065,0.6518155,0.021099841,0.12650804],"study_design_scores_gemma":[0.000080635196,0.00011877104,0.0011219473,0.00021877275,0.000058749294,0.00012979633,0.00011103424,0.777167,0.0031594082,0.21315758,0.004608355,0.000067885456],"about_ca_topic_score_codex":0.0063275634,"about_ca_topic_score_gemma":0.0043749213,"teacher_disagreement_score":0.010077711,"about_ca_system_score_codex":0.0015480098,"about_ca_system_score_gemma":0.0021931252,"threshold_uncertainty_score":0.053296685},"labels":[],"label_agreement":null},{"id":"W3125294762","doi":"","title":"A Note on Imposing Local Curvature in Generalized Leontief Models","year":2005,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Calgary","funders":"","keywords":"Hessian matrix; Exploit; Reciprocal; Curvature; Mathematics; Matrix (chemical analysis); Order (exchange); Function (biology); Mathematical economics; Applied mathematics; Mathematical optimization; Computer science; Economics; Geometry","score_opus":0.02964186794866933,"score_gpt":0.3137443526151806,"score_spread":0.2841024846665112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125294762","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12087349,0.0016823409,0.80169517,0.0064700632,0.00028525552,0.00015016936,0.0004246742,0.00082739716,0.06759147],"genre_scores_gemma":[0.88855785,0.0015133345,0.09063697,0.0013945706,0.0004059471,0.00017550743,0.0003007609,0.0004961746,0.01651886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99707067,0.0015112805,0.00013911002,0.0004160479,0.00050994504,0.00035304006],"domain_scores_gemma":[0.9901016,0.0040424056,0.0012181737,0.002704476,0.001221898,0.00071148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047821593,0.0013373903,0.0025492543,0.0010683363,0.0017207044,0.00207299,0.001965837,0.0025589583,0.008910563],"category_scores_gemma":[0.01936909,0.0009658438,0.002842388,0.0010286792,0.0039983387,0.005607603,0.0055211266,0.0054742177,0.0015658112],"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.000021481705,0.00001912201,0.0012710224,0.00006286085,0.000049670576,0.00031048284,0.00035651072,0.022347903,0.0008399018,0.96668667,0.0016651115,0.0063693374],"study_design_scores_gemma":[0.000035721354,0.00006944924,0.0009485563,0.000055879915,0.000040423514,0.00039092405,0.0001321202,0.093843676,0.00087453675,0.89447755,0.009040465,0.00009077613],"about_ca_topic_score_codex":0.0078063915,"about_ca_topic_score_gemma":0.0063759563,"teacher_disagreement_score":0.008910563,"about_ca_system_score_codex":0.001824706,"about_ca_system_score_gemma":0.0018735763,"threshold_uncertainty_score":0.02980882},"labels":[],"label_agreement":null},{"id":"W3125793900","doi":"10.1109/anzcc50923.2020.9318352","title":"Solving Least Squares for Linear Equations over Strongly Connected Directed Networks","year":2020,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Applied mathematics; Mathematics","score_opus":0.0260065708253342,"score_gpt":0.2569414131785719,"score_spread":0.2309348423532377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125793900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033258377,0.0001049773,0.99590635,0.0001157095,0.00002010214,0.000019047502,0.000027540194,0.00012493129,0.00035543164],"genre_scores_gemma":[0.35980046,0.0007415449,0.63102055,0.00025245102,0.00016479741,0.00048989337,0.0005007154,0.00018243532,0.0068471082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989747,0.0003828708,0.000048739086,0.00027809988,0.00022527936,0.000090311296],"domain_scores_gemma":[0.99641305,0.0028837512,0.00020236685,0.00011566884,0.00032473277,0.000060349044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015016949,0.0013176034,0.0011095401,0.00061845395,0.0005114212,0.0011556823,0.0012587281,0.0019583567,0.0023014762],"category_scores_gemma":[0.006828119,0.0007582176,0.0008036826,0.00096467294,0.0011154494,0.0012304228,0.0016625664,0.0020461017,0.00053850224],"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.00003556254,0.000015078819,0.0002655346,0.00007275834,0.00002611212,0.00003740232,0.000040005394,0.97484833,0.00062654633,0.006974564,0.0003451438,0.016713042],"study_design_scores_gemma":[0.0000057270363,0.0000057747397,0.000022748869,0.0000028263878,0.0000016729718,0.0000035739656,0.0000049087935,0.9962108,0.00015035649,0.0033877653,0.00020189039,0.0000020561545],"about_ca_topic_score_codex":0.011203654,"about_ca_topic_score_gemma":0.008562317,"teacher_disagreement_score":0.011203654,"about_ca_system_score_codex":0.0012347944,"about_ca_system_score_gemma":0.0017247808,"threshold_uncertainty_score":0.022276878},"labels":[],"label_agreement":null},{"id":"W3125836064","doi":"","title":"An Efficient Estimation for Switching Regression Models: A Monte Carlo Study","year":2009,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Monte Carlo method; Estimator; Mathematics; Weighting; Applied mathematics; Covariance; Mathematical optimization; Measure (data warehouse); Covariance matrix; Algorithm; Computer science; Statistics","score_opus":0.04127411278122576,"score_gpt":0.3505826837952566,"score_spread":0.3093085710140308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125836064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017467156,0.00045484782,0.9807382,0.00020455956,0.000014209217,0.000043314692,0.00001942792,0.000067709356,0.000990498],"genre_scores_gemma":[0.6061422,0.0018146428,0.38721246,0.0002248534,0.00016681114,0.0003993486,0.00019538256,0.00016453127,0.0036796525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617636,0.0028108505,0.000086588414,0.00032127718,0.00046124042,0.0001437039],"domain_scores_gemma":[0.95796144,0.038571995,0.0010738899,0.0012275323,0.00095659134,0.00020850931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011564885,0.0007067483,0.0016462471,0.00130769,0.0006129114,0.0012923656,0.0016009057,0.0016858893,0.0024249535],"category_scores_gemma":[0.04236895,0.0008085835,0.0010932242,0.0013769364,0.0015589664,0.0025993378,0.0013297683,0.0023565385,0.00028251336],"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.0000772851,0.00007960907,0.0020147657,0.00008618989,0.00009985414,0.00009560024,0.000103321494,0.8005569,0.00072667236,0.17243356,0.00056885957,0.023157347],"study_design_scores_gemma":[0.000011723722,0.00002390458,0.00018089516,0.000014075191,0.000010972186,0.000020761332,0.00000656963,0.9827995,0.00017669934,0.016425015,0.0003203089,0.000009563205],"about_ca_topic_score_codex":0.0043481356,"about_ca_topic_score_gemma":0.0032069646,"teacher_disagreement_score":0.011564885,"about_ca_system_score_codex":0.0011268111,"about_ca_system_score_gemma":0.0011361479,"threshold_uncertainty_score":0.061161637},"labels":[],"label_agreement":null},{"id":"W3130375914","doi":"10.1145/3452143.3465547","title":"Equivalences for Linearizations of Matrix Polynomials","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"University of Waterloo","funders":"","keywords":"Unimodular matrix; Eigenvalues and eigenvectors; Combinatorics; Mathematics; Matrix polynomial; Dimension (graph theory); Polynomial; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.030941664442441837,"score_gpt":0.31657083513077694,"score_spread":0.2856291706883351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130375914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100528345,0.00022227636,0.837396,0.00052587077,0.0002264996,0.00022414191,0.00019936831,0.0010105021,0.059666988],"genre_scores_gemma":[0.815259,0.0003205957,0.16714503,0.00048904755,0.0003490788,0.00019995349,0.0003481708,0.00050298084,0.015386169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963965,0.0009626779,0.00025395362,0.0007232106,0.0011385477,0.00052516884],"domain_scores_gemma":[0.9965731,0.0011730652,0.00032772863,0.00089059974,0.00070206623,0.00033343327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027276766,0.0005352872,0.0004744005,0.0013186346,0.0010234992,0.0026254673,0.0010770547,0.0006577822,0.013308583],"category_scores_gemma":[0.010052539,0.00041380693,0.0009308494,0.00065537245,0.0039319023,0.004980275,0.0029266567,0.0030727466,0.0028779705],"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.000021172753,0.000027322238,0.00020621304,0.000032507658,0.000004082064,0.00005748648,0.00025853908,0.0015800818,0.0017948797,0.9833921,0.0008113769,0.01181434],"study_design_scores_gemma":[0.000019816893,0.00009016376,0.00033209578,0.000025430427,0.000004577771,0.00011900211,0.00020761382,0.026069518,0.004724496,0.95915985,0.0092166215,0.000030690047],"about_ca_topic_score_codex":0.00065437914,"about_ca_topic_score_gemma":0.0005609158,"teacher_disagreement_score":0.013308583,"about_ca_system_score_codex":0.0011411645,"about_ca_system_score_gemma":0.0006264717,"threshold_uncertainty_score":0.04452163},"labels":[],"label_agreement":null},{"id":"W3130990978","doi":"10.1515/spma-2020-0126","title":"An elementary proof of Chollet’s permanent conjecture for 4 × 4 real matrices","year":2021,"lang":"en","type":"article","venue":"Special Matrices","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Lakehead University","funders":"","keywords":"Elementary proof; Mathematics; Statement (logic); Conjecture; Simple (philosophy); Algebra over a field; Linear algebra; Positive-definite matrix; Combinatorics; Pure mathematics; Discrete mathematics; Eigenvalues and eigenvectors","score_opus":0.010987940630807078,"score_gpt":0.26684363093154295,"score_spread":0.25585569030073585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130990978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22678395,0.0010927349,0.5790387,0.0059342114,0.0018368408,0.00015727956,0.0012857778,0.0013898318,0.18248075],"genre_scores_gemma":[0.89392966,0.0005455083,0.0762612,0.0014324836,0.0008512987,0.00014270423,0.000501051,0.00032341495,0.026012681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919015,0.00013123873,0.000035463483,0.00016572232,0.00031587828,0.00016150955],"domain_scores_gemma":[0.9965305,0.001995376,0.0002482251,0.0004978652,0.00044921873,0.0002789111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015663272,0.0008757568,0.0008207643,0.0010880755,0.0007164658,0.0015719966,0.0010682101,0.00079988805,0.024754073],"category_scores_gemma":[0.0053269095,0.0004346734,0.00085554726,0.0007555611,0.002812229,0.0030148134,0.0028107585,0.0032543577,0.0029550777],"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.0001655797,0.000081762635,0.0004289708,0.00021347913,0.000027520213,0.0003871799,0.00021344025,0.0065605845,0.006236443,0.9515093,0.014438159,0.019737598],"study_design_scores_gemma":[0.000056272744,0.000097002376,0.00056654064,0.00003060926,0.000011042761,0.00015280406,0.00006406197,0.020483932,0.004405372,0.96251553,0.011584967,0.000031919273],"about_ca_topic_score_codex":0.00056175067,"about_ca_topic_score_gemma":0.0007053528,"teacher_disagreement_score":0.024754073,"about_ca_system_score_codex":0.0008674452,"about_ca_system_score_gemma":0.00072567695,"threshold_uncertainty_score":0.08281064},"labels":[],"label_agreement":null},{"id":"W3132105698","doi":"10.4230/lipics.icalp.2021.9","title":"Almost-Linear-Time Weighted 𝓁_p-Norm Solvers in Slightly Dense Graphs via Sparsification","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Norm (philosophy); Mathematics; Combinatorics; Discrete mathematics; Political science","score_opus":0.03625541734926808,"score_gpt":0.18036644943992014,"score_spread":0.14411103209065207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132105698","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012871388,0.0002178808,0.9774949,0.00055826147,0.00007904496,0.00008809176,0.00029565874,0.0024346625,0.005960124],"genre_scores_gemma":[0.1839613,0.00022694857,0.8041344,0.00048361847,0.0001297503,0.00035354754,0.0016254829,0.0012409331,0.007843986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999079,0.00024972265,0.000045318764,0.00022812765,0.00024997882,0.0001477447],"domain_scores_gemma":[0.9973496,0.0016397277,0.00015792742,0.00046926638,0.00026368082,0.00011973421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010709914,0.00244561,0.0013116972,0.0005443922,0.0004988558,0.0013478699,0.0019128332,0.0014292247,0.011145023],"category_scores_gemma":[0.0072639673,0.00078049354,0.0011735125,0.0009817072,0.0010898795,0.0027865137,0.0025502248,0.0030543052,0.0032272066],"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.00048189273,0.0001852662,0.00096227595,0.00048299,0.00011489153,0.00023259202,0.00028103325,0.672988,0.007084688,0.07960582,0.028728435,0.20885214],"study_design_scores_gemma":[0.000046194426,0.000036504727,0.00006566535,0.000017263752,0.000010715393,0.000038243896,0.00004085997,0.94538826,0.0015393238,0.05086955,0.0019396966,0.000007785139],"about_ca_topic_score_codex":0.0036822157,"about_ca_topic_score_gemma":0.009868601,"teacher_disagreement_score":0.011145023,"about_ca_system_score_codex":0.0010600464,"about_ca_system_score_gemma":0.0013817884,"threshold_uncertainty_score":0.037283838},"labels":[],"label_agreement":null},{"id":"W3134222445","doi":"10.4153/s0008439521000102","title":"Some matrix inequalities of log-majorization type","year":2021,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Majorization; Mathematics; Type (biology); Inequality; Eigenvalues and eigenvectors; Sequence (biology); Matrix (chemical analysis); Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.015312633565729001,"score_gpt":0.24085221637890664,"score_spread":0.22553958281317762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134222445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11061164,0.0035361503,0.79255056,0.0041031153,0.00057309103,0.00012328793,0.00081321475,0.00036437574,0.08732459],"genre_scores_gemma":[0.9289825,0.0011872587,0.044860553,0.0013006965,0.0007667164,0.00020784208,0.00039695945,0.00013895852,0.0221585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878293,0.00030597163,0.000056100955,0.00024845728,0.0003466372,0.0002600286],"domain_scores_gemma":[0.9948696,0.0029160315,0.0005645512,0.00025253906,0.0010971501,0.0003001762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015153238,0.00073679286,0.00064452447,0.0011141022,0.00056188216,0.0014593424,0.0012325235,0.00076748355,0.011006728],"category_scores_gemma":[0.007015834,0.00028307067,0.0006100252,0.0010663866,0.0013738686,0.0022146576,0.001247287,0.0029084259,0.00085296115],"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.00017364886,0.00006482438,0.0008755992,0.00022850913,0.000040143535,0.00035217174,0.00016172955,0.012598786,0.010757911,0.9446477,0.008830673,0.021268176],"study_design_scores_gemma":[0.000053978638,0.0001407739,0.0019532598,0.00006404928,0.00002776715,0.00044788868,0.00014552844,0.29956374,0.0057368036,0.6807506,0.011059165,0.00005634714],"about_ca_topic_score_codex":0.0010663058,"about_ca_topic_score_gemma":0.00095778477,"teacher_disagreement_score":0.011006728,"about_ca_system_score_codex":0.0013589737,"about_ca_system_score_gemma":0.0005787897,"threshold_uncertainty_score":0.036821246},"labels":[],"label_agreement":null},{"id":"W3136240306","doi":"10.13001/ela.2021.5361","title":"Spectral theory for self-adjoint quadratic eigenvalue problems - a review","year":2021,"lang":"en","type":"review","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; European Regional Development Fund; Euskal Herriko Unibertsitatea; Ministerio de Ciencia, Innovación y Universidades","keywords":"Mathematics; Hermitian matrix; Eigenvalues and eigenvectors; Lambda; Canonical form; Polynomial; Pure mathematics; Matrix (chemical analysis); Combinatorics; Mathematical analysis; Quantum mechanics","score_opus":0.023936926911975073,"score_gpt":0.3078404321934674,"score_spread":0.28390350528149233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136240306","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016078257,0.95294935,0.015457349,0.0014665719,0.0011872042,0.000014432964,0.000063542604,0.000052567462,0.027201125],"genre_scores_gemma":[0.023711314,0.9573473,0.007756287,0.00096442783,0.0040799836,0.000046782836,0.00017147575,0.00007442272,0.0058480618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995957,0.00010273033,0.000031831838,0.000096675154,0.00013258513,0.000040469433],"domain_scores_gemma":[0.99939704,0.0003765034,0.00003843245,0.000038878617,0.0001114794,0.000037633898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007446819,0.0010973759,0.0015110112,0.00238135,0.0008861013,0.0019849732,0.0015802875,0.0018662286,0.0046033366],"category_scores_gemma":[0.001121676,0.00061316206,0.0009021281,0.003104222,0.002209605,0.003373071,0.0014453413,0.0033925297,0.0033888542],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050746734,0.0002404005,0.00048706622,0.010193245,0.000101336256,0.0002324657,0.0005091211,0.0044684457,0.0020981238,0.628678,0.04256599,0.31037506],"study_design_scores_gemma":[0.000012287376,0.00011717358,0.0010339123,0.0029976647,0.000044983306,0.0010957747,0.00028908154,0.004517076,0.0010682816,0.32932013,0.6594222,0.00008142108],"about_ca_topic_score_codex":0.00069598487,"about_ca_topic_score_gemma":0.00051831314,"teacher_disagreement_score":0.0046033366,"about_ca_system_score_codex":0.0012384475,"about_ca_system_score_gemma":0.0009878131,"threshold_uncertainty_score":0.015399635},"labels":[],"label_agreement":null},{"id":"W3140838583","doi":"10.1017/9781108762366.006","title":"Green’s Functions Using Decoupling Methods","year":2020,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Western University","funders":"","keywords":"Decoupling (probability); Content (measure theory); Computer science; Database; Mathematics; Engineering; Control engineering","score_opus":0.04871807527890156,"score_gpt":0.2555914442220369,"score_spread":0.20687336894313532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140838583","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004173532,0.0056148567,0.77290744,0.001098649,0.0010881315,0.00005123437,0.0004108183,0.0009886252,0.21366663],"genre_scores_gemma":[0.11549357,0.013817778,0.4951572,0.0010010556,0.00064967613,0.00029336754,0.0012826665,0.0033844481,0.36892015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996835,0.000079113364,0.000010405063,0.0000376644,0.00015820886,0.000031095053],"domain_scores_gemma":[0.999754,0.00007570816,0.0000114007635,0.00006548783,0.00007118468,0.000022231958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005337053,0.0011822528,0.0009683315,0.0015565315,0.0006661117,0.0014484739,0.0012953226,0.00090979895,0.022484722],"category_scores_gemma":[0.0012048658,0.0005064341,0.0010147798,0.0014117971,0.001018176,0.0018493843,0.0019132212,0.0024489998,0.013301803],"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.000021636995,0.000020663205,0.00005758679,0.0002273084,0.000020719226,0.000055615565,0.000106853346,0.01478337,0.0032909724,0.8702059,0.03127255,0.07993684],"study_design_scores_gemma":[0.000012052084,0.000015442998,0.00015778378,0.000089854664,0.000011262128,0.00014915009,0.00003894793,0.07731142,0.0024768095,0.7940424,0.12566566,0.000029174655],"about_ca_topic_score_codex":0.0012634589,"about_ca_topic_score_gemma":0.0018349419,"teacher_disagreement_score":0.022484722,"about_ca_system_score_codex":0.00089430413,"about_ca_system_score_gemma":0.0009092691,"threshold_uncertainty_score":0.07521886},"labels":[],"label_agreement":null},{"id":"W3142357617","doi":"10.1007/s10092-022-00502-4","title":"Structural backward stability in rational eigenvalue problems solved via block Kronecker linearizations","year":2023,"lang":"en","type":"article","venue":"CALCOLO","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"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":"Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España; Cree Board of Health and Social Services of James Bay","keywords":"Lambda; Matrix pencil; Mathematics; Eigenvalues and eigenvectors; Combinatorics; Kronecker delta; Matrix (chemical analysis); Polynomial; Mathematical analysis; Physics","score_opus":0.03309252086056048,"score_gpt":0.26219167556769296,"score_spread":0.2290991547071325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3142357617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14756212,0.00034039322,0.8168987,0.0006661227,0.00017890566,0.00006565817,0.0000784325,0.00033133777,0.033878434],"genre_scores_gemma":[0.87461865,0.00044896625,0.09912844,0.00022057508,0.0001371553,0.00015974086,0.00012647659,0.00034423766,0.024815906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999539,0.00020674024,0.00001685474,0.00004189401,0.00013878968,0.000056777706],"domain_scores_gemma":[0.99826556,0.0011646644,0.0001293195,0.00011292039,0.00022438576,0.00010304105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011909816,0.0007836299,0.00080421654,0.0011088158,0.0009471076,0.0018269741,0.0009905593,0.00078431756,0.007294704],"category_scores_gemma":[0.0056937737,0.00047456016,0.0005568078,0.0007612529,0.0025999919,0.0025051439,0.0017232726,0.0018814801,0.001096799],"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.00007032875,0.000062900384,0.00021585119,0.00006860342,0.000011571859,0.000046929494,0.00021724994,0.051748678,0.0016793322,0.9334596,0.0012711287,0.011147855],"study_design_scores_gemma":[0.00002042121,0.000030510588,0.0000556706,0.000017671264,0.000004919775,0.000016948192,0.00007846247,0.40224004,0.0009333226,0.59564644,0.00094222924,0.000013233788],"about_ca_topic_score_codex":0.0018344554,"about_ca_topic_score_gemma":0.0027012378,"teacher_disagreement_score":0.007294704,"about_ca_system_score_codex":0.0007450823,"about_ca_system_score_gemma":0.0009885291,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W3145864822","doi":"","title":"A NOTE ON THE STOCHASTIC ROOTS OF STOCHASTIC MATRICES","year":2003,"lang":"zh","type":"article","venue":"系统科学与系统工程学报(英文版)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Dalhousie University","funders":"","keywords":"Mathematics; Root (linguistics); Continuous-time stochastic process; Stochastic modelling; Matrix (chemical analysis); Applied mathematics; Stochastic process; Stochastic optimization; Stochastic differential equation; Mathematical optimization; Statistics","score_opus":0.016154754870023106,"score_gpt":0.2514418949697846,"score_spread":0.23528714009976148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3145864822","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020365776,0.0042318935,0.9410636,0.0043281876,0.0014753862,0.000020299818,0.00007996754,0.00023919271,0.028195674],"genre_scores_gemma":[0.6925055,0.0132418545,0.2504921,0.0043571824,0.0070858765,0.00010013245,0.00019858812,0.0009660297,0.031052828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987771,0.00045780244,0.000056691104,0.0002011481,0.00042617792,0.000081104175],"domain_scores_gemma":[0.9939229,0.004671771,0.00032470247,0.000419929,0.0005115048,0.00014921885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024114777,0.0006513759,0.0007591014,0.00076601317,0.000767133,0.0012372319,0.0009661732,0.0016083063,0.0051868604],"category_scores_gemma":[0.015407333,0.00034211873,0.0008330144,0.00088275014,0.0025524888,0.0045053335,0.0016129821,0.0036295573,0.00091231376],"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.00001742847,0.000011858962,0.00022079346,0.00009313477,0.000011077915,0.00018532008,0.00013715771,0.021865241,0.001517851,0.9624886,0.0040852604,0.009366418],"study_design_scores_gemma":[0.000010732857,0.00004719896,0.0002521789,0.000045033736,0.000009424104,0.00017185319,0.00004136731,0.1125026,0.0014332801,0.8693795,0.016071774,0.000035096735],"about_ca_topic_score_codex":0.0010227647,"about_ca_topic_score_gemma":0.00077664596,"teacher_disagreement_score":0.0051868604,"about_ca_system_score_codex":0.00046892287,"about_ca_system_score_gemma":0.0005402584,"threshold_uncertainty_score":0.017351747},"labels":[],"label_agreement":null},{"id":"W3148022066","doi":"10.5555/1164085.1164088","title":"A constructive methodology of Lyapunov function of composite systems with nonlinear interconnection term","year":2006,"lang":"en","type":"article","venue":"International Journal of Robotics and Automation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lyapunov function; Interconnection; Term (time); Nonlinear system; Constructive; Composite number; Computer science; Control theory (sociology); Mathematics; Control (management); Algorithm; Artificial intelligence; Telecommunications; Physics; Process (computing)","score_opus":0.013641004420319134,"score_gpt":0.25634121068136795,"score_spread":0.24270020626104882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3148022066","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052253593,0.00014130984,0.99831045,0.000033123462,0.000031191397,0.0000129182,0.000008198757,0.000045399447,0.00089483085],"genre_scores_gemma":[0.18480337,0.0011923262,0.803042,0.00016883515,0.0003122825,0.00046256487,0.00015094475,0.000245285,0.009622405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940324,0.00028734852,0.00003035244,0.00009283462,0.00015223213,0.000033999633],"domain_scores_gemma":[0.9994649,0.00020576526,0.000046432553,0.000059476788,0.00019982501,0.00002351871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00118966,0.0014647131,0.0009320945,0.0013542467,0.00063359534,0.0010621616,0.0011421622,0.00073775614,0.003372305],"category_scores_gemma":[0.0017409107,0.00046043823,0.0012648086,0.00057900656,0.0011351893,0.0014842517,0.0011255253,0.001692413,0.0011023366],"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.000048817146,0.00004751892,0.00029510361,0.00062615634,0.00011300913,0.00030235283,0.00037001935,0.23306419,0.023822686,0.6193253,0.0041529234,0.117831916],"study_design_scores_gemma":[0.000015067882,0.00015558847,0.00013872745,0.0000601891,0.00003274079,0.00019372496,0.000043710854,0.81374377,0.0044036736,0.17149869,0.009670512,0.00004348417],"about_ca_topic_score_codex":0.00072632835,"about_ca_topic_score_gemma":0.0008925722,"teacher_disagreement_score":0.003372305,"about_ca_system_score_codex":0.0006399207,"about_ca_system_score_gemma":0.0007554927,"threshold_uncertainty_score":0.01128149},"labels":[],"label_agreement":null},{"id":"W31505300","doi":"","title":"Barycentric Hermite Interpolants for Event Location in Initial-Value Problems","year":2008,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Hermite interpolation; Mathematics; Eigenvalues and eigenvectors; Hermite polynomials; Barycentric coordinate system; Polynomial; Polynomial interpolation; Applied mathematics; Pure mathematics; Mathematical analysis; Geometry; Linear interpolation","score_opus":0.022033749471694543,"score_gpt":0.2727034554619588,"score_spread":0.2506697059902642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31505300","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002268235,0.00012488173,0.99464476,0.00007290388,0.000035220914,0.00002057963,0.000044270295,0.00017450548,0.0026146967],"genre_scores_gemma":[0.17274067,0.0007640789,0.8140249,0.00013730375,0.00013534701,0.00023970236,0.00030119176,0.00067751575,0.010979305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935967,0.0002214471,0.000030442574,0.00006724737,0.00026044267,0.000060761507],"domain_scores_gemma":[0.9987676,0.0007385151,0.00008718485,0.00014421478,0.00019457922,0.00006795509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002281992,0.00084124197,0.0008611624,0.000811049,0.0005767657,0.0013743353,0.0015289977,0.0009226834,0.0070107295],"category_scores_gemma":[0.0055020787,0.0005004787,0.000943271,0.00094167877,0.0012091789,0.001321101,0.0018900224,0.003158842,0.0020608618],"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.00018197288,0.0000614862,0.00058220275,0.0002334146,0.00002465969,0.00011655887,0.00023828585,0.33606917,0.004989777,0.57051665,0.003645318,0.08334055],"study_design_scores_gemma":[0.0000153041,0.000028012104,0.00005618947,0.00003014014,0.0000052254777,0.000023546952,0.000026163892,0.928536,0.0019783005,0.062270157,0.007017002,0.000013899727],"about_ca_topic_score_codex":0.0029333825,"about_ca_topic_score_gemma":0.003657286,"teacher_disagreement_score":0.0070107295,"about_ca_system_score_codex":0.0011079462,"about_ca_system_score_gemma":0.0012964001,"threshold_uncertainty_score":0.023453236},"labels":[],"label_agreement":null},{"id":"W3152578670","doi":"10.4153/s0008439521000217","title":"On finite sections of the multiplicative Hilbert inequalities","year":2021,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Multiplicative function; Pure mathematics; Inequality; Mathematical analysis","score_opus":0.01529653875614166,"score_gpt":0.2242879631450317,"score_spread":0.20899142438889004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3152578670","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77298695,0.0006655627,0.20062524,0.0008754006,0.00009042045,0.000025898977,0.00006936573,0.00012431556,0.024536854],"genre_scores_gemma":[0.9879717,0.00026319365,0.0069212955,0.00007822104,0.00013095088,0.000027013348,0.00004477452,0.00004713692,0.004515768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993549,0.00028191306,0.000016875967,0.00008015427,0.00015324804,0.000112891816],"domain_scores_gemma":[0.99222046,0.0054193595,0.00063041574,0.0002833425,0.000773505,0.00067285786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00181262,0.0005721598,0.00045484654,0.0018870078,0.00059370586,0.0013677595,0.00085122645,0.0006103396,0.005702938],"category_scores_gemma":[0.011256113,0.00029426278,0.00033837132,0.0004507399,0.002572435,0.0030893672,0.0012630522,0.0015153901,0.00039862463],"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.000039969094,0.000027405491,0.0007364213,0.000030991236,0.000010989291,0.0001463997,0.00021047426,0.009268454,0.0034185443,0.982841,0.0004465058,0.0028227963],"study_design_scores_gemma":[0.00001413749,0.000059095946,0.0015190903,0.000037468464,0.000007345143,0.0001790525,0.00017455648,0.17189083,0.0020714016,0.82311827,0.00090132863,0.000027443823],"about_ca_topic_score_codex":0.00082754594,"about_ca_topic_score_gemma":0.00046697556,"teacher_disagreement_score":0.005702938,"about_ca_system_score_codex":0.00089720555,"about_ca_system_score_gemma":0.0004014359,"threshold_uncertainty_score":0.019078255},"labels":[],"label_agreement":null},{"id":"W3165709060","doi":"10.1186/s13663-021-00708-1","title":"Projecting onto rectangular matrices with prescribed row and column sums","year":2021,"lang":"en","type":"article","venue":"Fixed Point Theory and Algorithms for Sciences and Engineering","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":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Column (typography); Projection (relational algebra); Mathematics; Set (abstract data type); Inverse; Consistency (knowledge bases); Matrix (chemical analysis); Operator (biology); Square (algebra); Hilbert space; Algebra over a field; Combinatorics; Applied mathematics; Pure mathematics; Discrete mathematics; Algorithm; Computer science; Geometry","score_opus":0.010807802308638172,"score_gpt":0.22533475629986605,"score_spread":0.21452695399122787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165709060","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07286917,0.00009320018,0.92002714,0.00009357424,0.000054332657,0.000049701594,0.000088205496,0.0003447281,0.0063799405],"genre_scores_gemma":[0.6418866,0.00021533981,0.35317084,0.00015181668,0.00006327997,0.00010679621,0.000298174,0.00018862367,0.003918559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992073,0.00020331172,0.000042230564,0.00014449899,0.00030660792,0.00009597329],"domain_scores_gemma":[0.9983829,0.0006797279,0.00016365535,0.00031833223,0.0003479657,0.0001074169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008376441,0.0005625209,0.0005369874,0.00055838225,0.00027138635,0.000866902,0.0006131136,0.000365397,0.0045929654],"category_scores_gemma":[0.004344362,0.0002594814,0.00035224948,0.0005328778,0.0014603372,0.0012923356,0.001201893,0.0009941563,0.0007515867],"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.00031463226,0.000079895646,0.0015427949,0.00024124027,0.000048507936,0.00042100763,0.00021788651,0.1890632,0.056632083,0.6601845,0.003246538,0.08800763],"study_design_scores_gemma":[0.00002805877,0.00011392515,0.00046726275,0.000031528223,0.000008291918,0.00023572115,0.00007469412,0.81205857,0.027582312,0.15691225,0.0024496936,0.000037723585],"about_ca_topic_score_codex":0.0005544595,"about_ca_topic_score_gemma":0.00038716834,"teacher_disagreement_score":0.0045929654,"about_ca_system_score_codex":0.0002409041,"about_ca_system_score_gemma":0.00057486753,"threshold_uncertainty_score":0.015364945},"labels":[],"label_agreement":null},{"id":"W3166442000","doi":"","title":"ZZ Cyg - Fundamental Parameters","year":2012,"lang":"en","type":"article","venue":"NPARC","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Physics; Astrophysics","score_opus":0.01889375465552293,"score_gpt":0.2444781587221217,"score_spread":0.22558440406659877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166442000","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045890205,0.0023042958,0.081550285,0.03286032,0.02015568,0.0010984273,0.014118176,0.009126853,0.79289585],"genre_scores_gemma":[0.36142683,0.0016573626,0.020876762,0.0028133893,0.0068589034,0.00066141994,0.009879614,0.0040390147,0.59178674],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9964044,0.00055495364,0.0001591284,0.0009038601,0.0013174939,0.0006600808],"domain_scores_gemma":[0.98629075,0.0017410158,0.0007588214,0.003712152,0.005441698,0.0020555481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020795965,0.0011706733,0.001615185,0.002396235,0.0024648719,0.006407967,0.002013177,0.0029850518,0.24155976],"category_scores_gemma":[0.021003341,0.00049385655,0.0006581283,0.0020459343,0.0018771027,0.006175968,0.0038032674,0.0026996674,0.13909669],"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.00088222837,0.000114474155,0.0029554854,0.0006042426,0.00004891647,0.0004899124,0.0003083304,0.0013488713,0.010212894,0.286096,0.51015204,0.18678656],"study_design_scores_gemma":[0.00017860129,0.00009432635,0.003402777,0.00013890606,0.00003765277,0.000781036,0.0003163894,0.00410602,0.009808716,0.3131805,0.6678352,0.00011990231],"about_ca_topic_score_codex":0.000573904,"about_ca_topic_score_gemma":0.0006115352,"teacher_disagreement_score":0.24155976,"about_ca_system_score_codex":0.0016602712,"about_ca_system_score_gemma":0.0033755407,"threshold_uncertainty_score":0.8080979},"labels":[],"label_agreement":null},{"id":"W3169508329","doi":"10.4153/s0008439521000394","title":"Spectral distribution of symmetrized circulant matrices","year":2021,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Toeplitz matrix; Mathematics; Eigenvalues and eigenvectors; Spectrum (functional analysis); Pure mathematics; Distribution (mathematics); Simple (philosophy); Symmetrization; Combinatorics; Algebra over a field; Mathematical analysis","score_opus":0.009313502791662324,"score_gpt":0.21150726436026213,"score_spread":0.2021937615685998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169508329","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5833635,0.00039743568,0.38851127,0.00042084078,0.000120987446,0.00004997677,0.00053913123,0.00067541515,0.025921402],"genre_scores_gemma":[0.9747133,0.00014598461,0.019468522,0.000083565385,0.00006153492,0.000023422537,0.00024198393,0.00012842579,0.005133226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978775,0.000042047188,0.000007269909,0.000031852716,0.00008393017,0.000047207704],"domain_scores_gemma":[0.9988293,0.00035960367,0.00012885845,0.00014924965,0.00041805877,0.00011497724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047441793,0.00034772765,0.0002592188,0.0013724446,0.00039416619,0.0008812349,0.00054857804,0.00041155572,0.0070597534],"category_scores_gemma":[0.0024092568,0.00013820162,0.00016689688,0.00066960475,0.00093411404,0.000938166,0.0003407339,0.00038588938,0.00079072674],"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.00017350355,0.00007756171,0.00280265,0.00009142192,0.000025735048,0.00065997965,0.00025284901,0.103231676,0.03908403,0.8236442,0.0050392263,0.024917047],"study_design_scores_gemma":[0.000021899563,0.00004093535,0.003226676,0.000024873645,0.000006656237,0.00030842551,0.00012680981,0.76487166,0.011095222,0.21768525,0.0025373744,0.000054298584],"about_ca_topic_score_codex":0.001198416,"about_ca_topic_score_gemma":0.0011232204,"teacher_disagreement_score":0.0070597534,"about_ca_system_score_codex":0.000599615,"about_ca_system_score_gemma":0.0004023452,"threshold_uncertainty_score":0.023617208},"labels":[],"label_agreement":null},{"id":"W3183771210","doi":"10.1090/proc/15523","title":"Algebraic degree in spatial matricial numerical ranges of linear operators","year":2021,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; University of Waterloo; University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Degree (music); Mathematics; Algebraic number; Linear operators; Pure mathematics; Mathematical analysis; Physics","score_opus":0.01394806673691374,"score_gpt":0.24963719148603175,"score_spread":0.23568912474911802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183771210","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81481344,0.00047322732,0.13090464,0.000889908,0.00011875752,0.0000582793,0.0004403503,0.00041194123,0.051889367],"genre_scores_gemma":[0.9823742,0.00023875797,0.0103389565,0.00010051583,0.00012367916,0.000042824628,0.00024648034,0.0001020662,0.006432657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849725,0.00025217817,0.00008411869,0.00024614087,0.00055876403,0.000361537],"domain_scores_gemma":[0.9974371,0.0009271793,0.00039114372,0.00027812633,0.0005219701,0.0004443213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010296421,0.00058841356,0.00052386004,0.0019733713,0.0010917105,0.0031044835,0.0008140264,0.00060998823,0.009080197],"category_scores_gemma":[0.0054463553,0.00031924984,0.00068221445,0.0009943282,0.0032390328,0.0055702394,0.0027450689,0.0017106232,0.001096539],"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.00006958957,0.000023140325,0.00074190483,0.000057568894,0.000008551737,0.00011492008,0.0003497309,0.0016868148,0.002819713,0.9879457,0.0005611319,0.0056212842],"study_design_scores_gemma":[0.000025742082,0.00011176957,0.0018361955,0.000034330515,0.00001559769,0.00038786643,0.00043288717,0.021940375,0.006917112,0.96370804,0.004532026,0.000058154033],"about_ca_topic_score_codex":0.0007706471,"about_ca_topic_score_gemma":0.00059339276,"teacher_disagreement_score":0.009080197,"about_ca_system_score_codex":0.001074185,"about_ca_system_score_gemma":0.00063661364,"threshold_uncertainty_score":0.030376315},"labels":[],"label_agreement":null},{"id":"W3183856668","doi":"10.1002/nla.2399","title":"ODE‐based double‐preconditioning for solving linear systems Aαx=b and f(A)x=b","year":2021,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Carleton University; Statistics Canada","funders":"","keywords":"Ode; Mathematics; Linear system; Computation; Applied mathematics; Ordinary differential equation; Extension (predicate logic); Matrix (chemical analysis); Linear differential equation; System of linear equations; Coefficient matrix; Algebraic number; Algebra over a field; Algorithm; Differential equation; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.016190170580138406,"score_gpt":0.2607405617680234,"score_spread":0.244550391187885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183856668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047104962,0.0001221925,0.9470642,0.00014956383,0.000112248046,0.000039849598,0.0000692027,0.00041484772,0.0049229073],"genre_scores_gemma":[0.58194023,0.0002067009,0.4099239,0.000074810014,0.000075285236,0.00011831273,0.0002120105,0.00016495009,0.00728379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986804,0.00003393817,0.000007775584,0.000014486984,0.00005236812,0.000023424986],"domain_scores_gemma":[0.9997427,0.00009369722,0.000023460676,0.00003635616,0.00007344812,0.000030361649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033421358,0.0003449293,0.0005520712,0.00026052006,0.0002523036,0.00033951763,0.0003757372,0.00045459383,0.0025677616],"category_scores_gemma":[0.00087766815,0.00013268112,0.0002885503,0.00024729676,0.00045805893,0.0003678253,0.00062246836,0.000707666,0.00041780178],"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.00027978938,0.00015767998,0.0013370281,0.00039683792,0.000063249354,0.00029200665,0.00023323533,0.6888878,0.093371116,0.059545502,0.003433771,0.15200202],"study_design_scores_gemma":[0.0000101481755,0.000035122554,0.00014613061,0.000006210973,0.0000032342082,0.00002118972,0.000008891541,0.9888362,0.007426728,0.0018646724,0.0016369886,0.0000044610833],"about_ca_topic_score_codex":0.0021903745,"about_ca_topic_score_gemma":0.0024503784,"teacher_disagreement_score":0.0025677616,"about_ca_system_score_codex":0.00027506924,"about_ca_system_score_gemma":0.0007445737,"threshold_uncertainty_score":0.008590043},"labels":[],"label_agreement":null},{"id":"W3185358762","doi":"10.1093/imrn/rnac074","title":"Abelianization of Matrix Orthogonal Polynomials","year":2022,"lang":"en","type":"preprint","venue":"International Mathematics Research Notices","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Riemann sphere; Mathematics; Riemann surface; Scalar (mathematics); Padé approximant; Pure mathematics; Point (geometry); Riemann hypothesis; Matrix (chemical analysis); Mathematical analysis; Orthogonal polynomials; Algebra over a field; Geometry","score_opus":0.0839326846768358,"score_gpt":0.4187600007201967,"score_spread":0.3348273160433609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185358762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7800234,0.00030976936,0.16444747,0.0006276249,0.00024115751,0.000037333877,0.00009769631,0.00020973658,0.0540058],"genre_scores_gemma":[0.98282593,0.00013556943,0.0068611545,0.000059949696,0.00013429267,0.000011407259,0.000036951624,0.000035987814,0.0098987315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996741,0.00006503377,0.000010124628,0.00007517591,0.00010875258,0.000066749744],"domain_scores_gemma":[0.9996369,0.00006221339,0.000066171706,0.0000483401,0.000095919,0.00009048613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002605434,0.0002879084,0.00028204132,0.0010415958,0.00042348047,0.0014120472,0.0002854028,0.00030095904,0.0055721067],"category_scores_gemma":[0.00095467165,0.00010158004,0.0002470969,0.00037164715,0.001159312,0.0012720769,0.000941034,0.0007101758,0.00062360615],"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.000035246278,0.000018769944,0.000248537,0.000013204693,0.0000039051133,0.00009865343,0.00011044361,0.0016118258,0.0058432384,0.98562324,0.00031970328,0.006073157],"study_design_scores_gemma":[0.000029280798,0.00019466573,0.0015243517,0.000020615333,0.000010058672,0.0006949051,0.00034928316,0.05673977,0.009792456,0.9188715,0.011744997,0.000028083281],"about_ca_topic_score_codex":0.00023390491,"about_ca_topic_score_gemma":0.00014640238,"teacher_disagreement_score":0.0055721067,"about_ca_system_score_codex":0.00040383422,"about_ca_system_score_gemma":0.00015855621,"threshold_uncertainty_score":0.018640578},"labels":[],"label_agreement":null},{"id":"W3185886855","doi":"10.1287/moor.2023.1382","title":"A Semismooth Newton-Type Method for the Nearest Doubly Stochastic Matrix Problem","year":2023,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Quadratic growth; Jacobian matrix and determinant; Invertible matrix; Differentiable function; Matrix (chemical analysis); Newton's method; Applied mathematics; Convergence (economics); Type (biology); Rate of convergence; Upper and lower bounds; Mathematical optimization; Mathematical analysis; Nonlinear system; Pure mathematics; Computer science","score_opus":0.11297380170013353,"score_gpt":0.444277015250635,"score_spread":0.33130321355050146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185886855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055864598,0.00009467045,0.9926301,0.00012223118,0.000039035738,0.000033127588,0.000016751204,0.00006468259,0.0014127827],"genre_scores_gemma":[0.22438067,0.00036497883,0.7608355,0.0002037826,0.00013886513,0.00029171977,0.00019402245,0.00025669602,0.013333768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995295,0.00016408943,0.000019582274,0.00007183031,0.00017530561,0.000039821934],"domain_scores_gemma":[0.99902344,0.00048280245,0.00010679763,0.000065252774,0.00021342638,0.000108239605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011779537,0.0008349578,0.0010070556,0.0006679686,0.00049735425,0.0007280993,0.0011293881,0.0018508619,0.0026192688],"category_scores_gemma":[0.0025967923,0.000489278,0.0009096933,0.00041473735,0.0011545153,0.0011970778,0.0015259978,0.0018691337,0.0007025824],"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.000150889,0.00012983674,0.0009666764,0.00029509646,0.000078386256,0.00027580652,0.00025390415,0.81030166,0.01761579,0.10658842,0.0032252602,0.060118373],"study_design_scores_gemma":[0.0000063286316,0.000023642675,0.00003078917,0.000004905227,0.0000028796549,0.000020172725,0.0000048913903,0.9949935,0.0004769361,0.0037037316,0.0007261797,0.0000059668064],"about_ca_topic_score_codex":0.0036020742,"about_ca_topic_score_gemma":0.0032378032,"teacher_disagreement_score":0.0036020742,"about_ca_system_score_codex":0.00071736705,"about_ca_system_score_gemma":0.0016134275,"threshold_uncertainty_score":0.0087623},"labels":[],"label_agreement":null},{"id":"W3186175341","doi":"10.5539/jmr.v13n4p77","title":"Functions Preserving Orthogonality of Hermitian Matrices","year":2021,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Orthogonality; Mathematics; Hermitian matrix; Characterization (materials science); Pure mathematics; Hermitian function; Algebra over a field; Geometry","score_opus":0.09967360040279624,"score_gpt":0.38572784026113244,"score_spread":0.2860542398583362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186175341","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22472262,0.0003847104,0.75173783,0.00034604792,0.00018427827,0.00009359417,0.00022451305,0.00025455112,0.022051867],"genre_scores_gemma":[0.91759795,0.0006506101,0.07007142,0.00029158473,0.00030553533,0.00015353292,0.0003979869,0.00028232991,0.010249008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886864,0.00032358462,0.000059627982,0.00018175565,0.00031494568,0.00025137185],"domain_scores_gemma":[0.99683076,0.0010177441,0.00037610665,0.0003841708,0.0010255517,0.00036572176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015589768,0.0010843069,0.00066825224,0.0017918028,0.0008197141,0.0016333885,0.000495526,0.00062308623,0.003992028],"category_scores_gemma":[0.007260186,0.00024347533,0.0005967186,0.0009494093,0.0022382322,0.0029650878,0.001465415,0.0014118549,0.0008335928],"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.000114283794,0.000054495315,0.0007482513,0.00011024599,0.00002894517,0.0002552811,0.00031063095,0.0059002717,0.023509854,0.9224585,0.0019429682,0.044566292],"study_design_scores_gemma":[0.000036718313,0.00028364474,0.001239693,0.000041160187,0.000025361272,0.00090076897,0.0003880641,0.08640542,0.029891713,0.8739471,0.006761884,0.00007849265],"about_ca_topic_score_codex":0.0005642583,"about_ca_topic_score_gemma":0.00030868367,"teacher_disagreement_score":0.003992028,"about_ca_system_score_codex":0.00051552407,"about_ca_system_score_gemma":0.0006662282,"threshold_uncertainty_score":0.013354659},"labels":[],"label_agreement":null},{"id":"W3186276368","doi":"10.1137/20m1363030","title":"<scp>TriCG</scp> and <scp>TriMR</scp>: Two Iterative Methods for Symmetric Quasi-definite Systems","year":2021,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données","keywords":"Block (permutation group theory); Orthogonality; Mathematics; Positive-definite matrix; Applied mathematics; Linear system; Discretization; Algorithm; Iterative method; Matrix (chemical analysis); Residual; Combinatorics; Mathematical analysis; Eigenvalues and eigenvectors; Geometry; Chemistry; Physics","score_opus":0.036946277966386026,"score_gpt":0.3395706004214072,"score_spread":0.30262432245502113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186276368","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004364279,0.00022948874,0.9862991,0.00025507197,0.00015532145,0.00006844414,0.00019038933,0.0042685894,0.004169334],"genre_scores_gemma":[0.043032866,0.0001904107,0.94924104,0.00027997186,0.00005978674,0.00018640383,0.00054007303,0.0018366809,0.0046328334],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991794,0.00023837166,0.000044323468,0.00008552059,0.00038359078,0.00006884143],"domain_scores_gemma":[0.9979558,0.00046772326,0.0002678498,0.00057315285,0.00061969645,0.000115828705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012242963,0.0008599111,0.00070271804,0.00064770656,0.0004923513,0.00089227804,0.0015186295,0.0010712184,0.0068396986],"category_scores_gemma":[0.0030611998,0.000553214,0.0007559295,0.00072307925,0.0010227268,0.0008329049,0.0013183741,0.0017721251,0.0040385323],"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.00024745314,0.00025146527,0.0011629501,0.0007587589,0.00014977205,0.00038831212,0.0005350781,0.286588,0.047320824,0.09821383,0.07797402,0.4864095],"study_design_scores_gemma":[0.00006735405,0.00008319074,0.00028903864,0.000039732142,0.000012058606,0.00020041713,0.0000344638,0.9377566,0.024613427,0.010592712,0.026253853,0.00005719699],"about_ca_topic_score_codex":0.003128817,"about_ca_topic_score_gemma":0.0038615968,"teacher_disagreement_score":0.0068396986,"about_ca_system_score_codex":0.00043133678,"about_ca_system_score_gemma":0.0013536924,"threshold_uncertainty_score":0.022881031},"labels":[],"label_agreement":null},{"id":"W3193071954","doi":"10.51201/jusst/21/08360","title":"Study on Truncation and Roundoff Errors in Numerical Methods","year":2021,"lang":"en","type":"article","venue":"Journal of University of Shanghai for Science and Technology","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Truncation error; Round-off error; Truncation (statistics); Mathematics; Applied mathematics; Computer science; Statistics; Algorithm","score_opus":0.02153686802744422,"score_gpt":0.30133656021514404,"score_spread":0.27979969218769984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193071954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016595704,0.013011746,0.9263181,0.0027156046,0.0016357173,0.00012313253,0.00014012805,0.00036043036,0.039099388],"genre_scores_gemma":[0.56056905,0.020749727,0.3669709,0.002066224,0.0037305139,0.0005564991,0.00039171716,0.001770374,0.043194998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991113,0.0039094943,0.00056190963,0.0007075795,0.0033076326,0.00040035625],"domain_scores_gemma":[0.94963497,0.03820503,0.0026674587,0.004036394,0.0049103596,0.0005458036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013661462,0.0013113705,0.001421887,0.0017695694,0.0014263672,0.002798645,0.0021366125,0.002071844,0.005023702],"category_scores_gemma":[0.078049324,0.00059849565,0.0014948266,0.0015210196,0.0049032834,0.005372173,0.0032268967,0.004855816,0.0012082246],"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.00011944328,0.000051499206,0.0020006506,0.0006705892,0.000076661105,0.0002990498,0.00068478513,0.09620379,0.0016095191,0.85986835,0.003547425,0.034868333],"study_design_scores_gemma":[0.000025521043,0.00013797519,0.0007930963,0.0006784094,0.00005582916,0.00029794514,0.00014627876,0.56259644,0.003307584,0.40971997,0.022146082,0.0000949505],"about_ca_topic_score_codex":0.0026753894,"about_ca_topic_score_gemma":0.0010479729,"teacher_disagreement_score":0.013661462,"about_ca_system_score_codex":0.0020485353,"about_ca_system_score_gemma":0.0017974449,"threshold_uncertainty_score":0.07224959},"labels":[],"label_agreement":null},{"id":"W3194795622","doi":"10.1109/antem51107.2021.9518546","title":"Alternate Minimizations for an Approximate Solution of General Systems of Linear Algebraic Equations","year":2021,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"University of Manitoba","funders":"","keywords":"Minification; Linear system; Simple (philosophy); Algebraic equation; System of linear equations; Computation; Applied mathematics; Mathematics; Algebraic number; Point (geometry); Linear equation; Computer science; Mathematical analysis; Mathematical optimization; Algorithm; Nonlinear system; Geometry","score_opus":0.03551240651033219,"score_gpt":0.2836183003764983,"score_spread":0.24810589386616613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194795622","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00685426,0.00013898229,0.99070275,0.00010340951,0.00003648458,0.000029650724,0.000019228884,0.000077598896,0.0020375878],"genre_scores_gemma":[0.10484616,0.00024488647,0.8901827,0.00010963161,0.00007985041,0.00025887424,0.000099729754,0.0002573162,0.003920867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898285,0.0004489938,0.000053213516,0.000099685276,0.0003744633,0.000040846277],"domain_scores_gemma":[0.99905986,0.00048304434,0.00008384436,0.00014514997,0.00018295643,0.000045152497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021280178,0.00097088586,0.00078620855,0.0008329191,0.0004473233,0.000656814,0.0011269711,0.0011912545,0.0031732016],"category_scores_gemma":[0.004570134,0.00044296778,0.00079841603,0.000588955,0.0010509267,0.001534424,0.001594804,0.0015438881,0.00095835474],"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.00029814744,0.00016362437,0.00086475856,0.00066993886,0.00013810467,0.00029645418,0.00044302136,0.25180787,0.04068811,0.5203641,0.0053969114,0.17886883],"study_design_scores_gemma":[0.000017057248,0.00008134416,0.00018843284,0.000027300748,0.000014895229,0.0001311341,0.000027571345,0.93490684,0.0036962263,0.05644194,0.004446044,0.000021160498],"about_ca_topic_score_codex":0.0005537194,"about_ca_topic_score_gemma":0.0011472448,"teacher_disagreement_score":0.0031732016,"about_ca_system_score_codex":0.00043609986,"about_ca_system_score_gemma":0.00057392754,"threshold_uncertainty_score":0.011254191},"labels":[],"label_agreement":null},{"id":"W3195954217","doi":"10.5539/jmr.v13n5p1","title":"Lower Bounds of the Smallest Singular Value of Matrices","year":2021,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Singular value; Hermitian matrix; TRACE (psycholinguistics); Upper and lower bounds; Matrix norm; Combinatorics; Value (mathematics); Matrix (chemical analysis); Euclidean geometry; Norm (philosophy); Complex matrix; Pure mathematics; Eigenvalues and eigenvectors; Mathematical analysis; Geometry; Statistics; Law","score_opus":0.05446158766527369,"score_gpt":0.35190749921352493,"score_spread":0.29744591154825123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195954217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0354262,0.00887967,0.94004405,0.0016140727,0.0005188641,0.00004641366,0.00028146812,0.00061735895,0.012571837],"genre_scores_gemma":[0.6880075,0.0077304486,0.287709,0.0010782329,0.00221461,0.0002259532,0.0010636344,0.0010113318,0.010959257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99633056,0.0009077702,0.00017994268,0.00068713987,0.0014384827,0.00045619396],"domain_scores_gemma":[0.98110366,0.0120658,0.0013839174,0.0020423485,0.0021872888,0.0012168874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037843878,0.0032382233,0.0015426398,0.0028157881,0.0011229828,0.002818753,0.0023687086,0.0019495664,0.0050731874],"category_scores_gemma":[0.025359888,0.0006044195,0.000990901,0.0014483519,0.0032807135,0.0052394234,0.0031158156,0.0060041137,0.0014967915],"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.000977181,0.0003261707,0.0052389344,0.0016439776,0.00031298146,0.0009877916,0.00061203045,0.23636475,0.06794765,0.52065676,0.013711074,0.15122071],"study_design_scores_gemma":[0.000026759068,0.00027411114,0.0015857265,0.00016878545,0.00005557064,0.00047936718,0.00012340225,0.6458468,0.016387593,0.3285293,0.006416016,0.000106590924],"about_ca_topic_score_codex":0.0006489479,"about_ca_topic_score_gemma":0.0009471533,"teacher_disagreement_score":0.0050731874,"about_ca_system_score_codex":0.0010174317,"about_ca_system_score_gemma":0.0007562656,"threshold_uncertainty_score":0.020013988},"labels":[],"label_agreement":null},{"id":"W3197718549","doi":"","title":"On convergence of a least-squares kansa's method for the modified helmholtz equations","year":2009,"lang":"en","type":"article","venue":"Advances in Applied Mathematics and Mechanics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Convergence (economics); Mathematics; Least-squares function approximation; Helmholtz equation; Applied mathematics; Mathematical analysis; Economics; Boundary value problem; Statistics","score_opus":0.017773256554190514,"score_gpt":0.2966771354524424,"score_spread":0.27890387889825186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197718549","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00429534,0.00033605448,0.9935004,0.00021992129,0.00011880055,0.000042555774,0.000029621668,0.00011822491,0.0013390705],"genre_scores_gemma":[0.118352,0.0010286025,0.8658532,0.00036849303,0.00019745955,0.000511591,0.00028806028,0.00059710647,0.012803523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806994,0.0010709414,0.000082343075,0.00018848211,0.0005044966,0.000083886065],"domain_scores_gemma":[0.985862,0.010679968,0.00034049148,0.0004851295,0.0022833361,0.00034908266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071029393,0.0014810953,0.0012650742,0.0012160387,0.0008240937,0.0013728426,0.002479836,0.0022722292,0.0043041916],"category_scores_gemma":[0.026469024,0.0007950599,0.0015790932,0.0007732037,0.0026297485,0.0022910612,0.0039222105,0.003972434,0.0013281502],"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.00070216914,0.00019939883,0.0022132588,0.0008959622,0.00027758497,0.00027097767,0.0008222654,0.5415664,0.018615166,0.2638124,0.00692405,0.16370048],"study_design_scores_gemma":[0.00001804119,0.000057800717,0.00021581596,0.00003943103,0.000017564673,0.000048396203,0.00004489773,0.9735107,0.0011871955,0.022426773,0.0024026593,0.00003075836],"about_ca_topic_score_codex":0.00504771,"about_ca_topic_score_gemma":0.004235461,"teacher_disagreement_score":0.0071029393,"about_ca_system_score_codex":0.0007746986,"about_ca_system_score_gemma":0.0018950424,"threshold_uncertainty_score":0.037564397},"labels":[],"label_agreement":null},{"id":"W3198894241","doi":"10.1088/1742-6596/2000/1/012007","title":"QSSOR and cubic non-polynomial spline method for the solution of two-point boundary value problems","year":2021,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Algonquin College","funders":"","keywords":"Mathematics; Monotone cubic interpolation; Spline (mechanical); Successive over-relaxation; Boundary value problem; Cubic Hermite spline; Applied mathematics; Polynomial; Cubic function; Spline interpolation; B-spline; Perfect spline; Mathematical analysis; Mathematical optimization; Thin plate spline; Iterative method; Polynomial interpolation; Local convergence","score_opus":0.021631612899786924,"score_gpt":0.28391048649958367,"score_spread":0.26227887359979674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198894241","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02853511,0.00052305986,0.9664561,0.00010882116,0.00009317817,0.00005639815,0.00003877641,0.00041650858,0.0037720497],"genre_scores_gemma":[0.4293905,0.00089204963,0.56347835,0.000070491835,0.000061067294,0.00019095046,0.00015133989,0.00022999942,0.0055352794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964166,0.00012257457,0.000016510663,0.000023397894,0.00016576826,0.000030041627],"domain_scores_gemma":[0.9991258,0.00046087455,0.000057145277,0.00006704921,0.0002471407,0.000041994754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079576444,0.00040444446,0.00071041,0.00058483635,0.0003684925,0.00046324826,0.0007413699,0.000630845,0.0030101016],"category_scores_gemma":[0.0016191677,0.00025077473,0.0006260157,0.0007436543,0.00057069963,0.0004918571,0.00062763476,0.0010016756,0.000622947],"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.00023186018,0.00016584274,0.0014625838,0.0007394864,0.000056836143,0.00023949273,0.00029527018,0.8090876,0.026338432,0.034149304,0.0018678325,0.1253654],"study_design_scores_gemma":[0.000011614197,0.000036419347,0.000070933944,0.000009492079,0.0000031116988,0.000023709485,0.000015385138,0.9961128,0.00157482,0.001217723,0.0009190712,0.0000048626885],"about_ca_topic_score_codex":0.0032810785,"about_ca_topic_score_gemma":0.0028158177,"teacher_disagreement_score":0.0032810785,"about_ca_system_score_codex":0.00027718244,"about_ca_system_score_gemma":0.0012233305,"threshold_uncertainty_score":0.0100697875},"labels":[],"label_agreement":null},{"id":"W3203646126","doi":"10.13001/ela.2021.4991","title":"Generalized Commutators and the Moore-Penrose Inverse","year":2021,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","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":"Carleton University","funders":"Division of Mathematical Sciences; Fields Institute for Research in Mathematical Sciences","keywords":"Mathematics; Commutator; Combinatorics; Inverse; Kernel (algebra); Conjecture; Rank (graph theory); Matrix (chemical analysis); Operator (biology); TRACE (psycholinguistics); Algebra over a field; Pure mathematics","score_opus":0.0066310965750864806,"score_gpt":0.23013447642621795,"score_spread":0.22350337985113147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203646126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28798106,0.0027590222,0.5504666,0.0015096475,0.0007908968,0.000067562374,0.00029605223,0.0007160598,0.15541305],"genre_scores_gemma":[0.8938453,0.0012501173,0.06909445,0.0007695931,0.0006952051,0.00010494711,0.00023701655,0.00021789265,0.033785466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992269,0.00017123937,0.000050005594,0.00020590016,0.00021980084,0.0001261322],"domain_scores_gemma":[0.99931,0.00014198478,0.00011590604,0.00016224051,0.00017611409,0.00009379762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061940256,0.00062187394,0.00058066484,0.0008582571,0.0008668417,0.0016905713,0.0007379713,0.0009133366,0.0059123803],"category_scores_gemma":[0.0016127863,0.00027119467,0.00070156506,0.0006393343,0.0026108464,0.0033043944,0.0013072274,0.0014846022,0.001551169],"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.000015366146,0.000010386293,0.000073943214,0.000026670608,0.000004774827,0.00010640068,0.00018237997,0.0008372035,0.0009972268,0.99305266,0.00059254485,0.0041003185],"study_design_scores_gemma":[0.000006844595,0.000033497923,0.00008527418,0.000012581312,0.0000035566704,0.0002175869,0.0000604278,0.010179544,0.0013156785,0.98246735,0.0055986024,0.000019025229],"about_ca_topic_score_codex":0.0007261366,"about_ca_topic_score_gemma":0.00052494975,"teacher_disagreement_score":0.0059123803,"about_ca_system_score_codex":0.0006118655,"about_ca_system_score_gemma":0.0004428293,"threshold_uncertainty_score":0.019778907},"labels":[],"label_agreement":null},{"id":"W3204625658","doi":"10.1007/s10898-021-01092-1","title":"A modified simplex partition algorithm to test copositivity","year":2021,"lang":"lv","type":"article","venue":"Journal of Global Optimization","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Algorithm; Artificial intelligence; Computer science","score_opus":0.013537403692048278,"score_gpt":0.2680999470426928,"score_spread":0.25456254335064454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204625658","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06982936,0.00017329234,0.9137311,0.00032149898,0.00010613807,0.0004470873,0.0007211324,0.0034143156,0.011256041],"genre_scores_gemma":[0.29571697,0.00011412938,0.694582,0.0002428517,0.000075601485,0.0005310904,0.0026131938,0.0015356168,0.0045886426],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99514174,0.0012855431,0.00036837292,0.0010286464,0.001704579,0.0004711254],"domain_scores_gemma":[0.982678,0.010654016,0.00095941947,0.002113177,0.0030463024,0.0005490827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030293453,0.0018330179,0.0015383514,0.002784066,0.0014507336,0.0038325093,0.0024928404,0.0017321851,0.017895652],"category_scores_gemma":[0.028001634,0.0011670864,0.0022525298,0.002014623,0.0022041574,0.005290362,0.0035959168,0.0024956116,0.003413079],"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.0016929272,0.0010446153,0.013329537,0.00061455753,0.0004911919,0.0005652355,0.00061835477,0.27794638,0.012306677,0.24080203,0.02525892,0.42532948],"study_design_scores_gemma":[0.00012527667,0.00020983155,0.0006053526,0.0000568938,0.000047567213,0.0001668379,0.00014535895,0.87437296,0.008820134,0.11137716,0.0040286216,0.000044051758],"about_ca_topic_score_codex":0.005016045,"about_ca_topic_score_gemma":0.0045146397,"teacher_disagreement_score":0.017895652,"about_ca_system_score_codex":0.0014802389,"about_ca_system_score_gemma":0.002788266,"threshold_uncertainty_score":0.059866905},"labels":[],"label_agreement":null},{"id":"W3205435467","doi":"10.26434/chemrxiv-2021-qb2jb","title":"Computing vibrational energy levels by solving linear equations using a tensor method with an imposed rank","year":2021,"lang":"en","type":"preprint","venue":"ChemRxiv","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Rank (graph theory); Tensor (intrinsic definition); Mathematics; Basis (linear algebra); Applied mathematics; Orthogonalization; Tensor product; Realization (probability); Basis function; Hamiltonian (control theory); System of linear equations; Algorithm; Mathematical optimization; Mathematical analysis; Pure mathematics; Combinatorics; Geometry","score_opus":0.048763444950717744,"score_gpt":0.30753027520169535,"score_spread":0.2587668302509776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205435467","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016946325,0.000075466036,0.9772704,0.00020262027,0.00004015941,0.000059575075,0.0001359117,0.0007034279,0.0045661074],"genre_scores_gemma":[0.100830056,0.00018123655,0.8928833,0.00008280294,0.00004485915,0.00017359776,0.0002630353,0.00042571526,0.005115484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994777,0.00016178793,0.000032836284,0.000058154073,0.0002243852,0.000045216642],"domain_scores_gemma":[0.99919575,0.00036781005,0.000067591485,0.00017550649,0.00015136893,0.00004201636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000913851,0.0008873335,0.0007501656,0.0006464118,0.00064006896,0.0011043603,0.0010929207,0.0007618066,0.007861269],"category_scores_gemma":[0.0021764196,0.0004422499,0.0008402406,0.00095845666,0.0009987378,0.0014949207,0.001009927,0.0018369369,0.0020719592],"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.00017103406,0.00022763699,0.0012598363,0.00050527614,0.00012366216,0.00024846703,0.0004484998,0.4346129,0.04453247,0.33869442,0.0065303375,0.1726454],"study_design_scores_gemma":[0.000026784734,0.000048369748,0.000117174255,0.000011171098,0.0000076029014,0.00004364878,0.000042400243,0.9547793,0.0060185594,0.035401378,0.0034879586,0.00001554184],"about_ca_topic_score_codex":0.0038524382,"about_ca_topic_score_gemma":0.004450942,"teacher_disagreement_score":0.007861269,"about_ca_system_score_codex":0.00055962906,"about_ca_system_score_gemma":0.0014508159,"threshold_uncertainty_score":0.026298523},"labels":[],"label_agreement":null},{"id":"W3206113677","doi":"10.1016/j.laa.2021.10.011","title":"The critical point and the p-norm of the Hilbert L-matrix","year":2021,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Norm (philosophy); Matrix norm; Matrix (chemical analysis); Pure mathematics; Property (philosophy); Combinatorics; Eigenvalues and eigenvectors; Physics","score_opus":0.006530986885801081,"score_gpt":0.25381657895831083,"score_spread":0.24728559207250975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206113677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21548076,0.005191986,0.69493425,0.008901504,0.001140143,0.000076058874,0.0003678207,0.0003218087,0.07358578],"genre_scores_gemma":[0.9208061,0.0022124078,0.052918416,0.00080594403,0.0014233438,0.00014094236,0.0002744102,0.00022071383,0.021197712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990594,0.00038748223,0.000034840457,0.00018919562,0.0002244657,0.00010451305],"domain_scores_gemma":[0.99483347,0.002832206,0.00047056077,0.0002237167,0.0009720693,0.00066786923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00196568,0.00093527307,0.00075715873,0.002679497,0.0012278705,0.003062533,0.0014624853,0.0017519796,0.0060845544],"category_scores_gemma":[0.011434633,0.00036278387,0.000428385,0.0012542043,0.0069791065,0.0062378235,0.0023495783,0.0035116267,0.0009502908],"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.000036463054,0.000013356488,0.0001298114,0.000035360288,0.0000056719346,0.00005746453,0.000119112316,0.0014729042,0.0008628291,0.9925271,0.001142617,0.003597198],"study_design_scores_gemma":[0.000007939304,0.000018926587,0.000075309006,0.000015159084,0.0000023992566,0.000053246564,0.000045548975,0.016581496,0.0004883145,0.9816388,0.001059792,0.000012956906],"about_ca_topic_score_codex":0.0010560126,"about_ca_topic_score_gemma":0.00057377573,"teacher_disagreement_score":0.0060845544,"about_ca_system_score_codex":0.00111546,"about_ca_system_score_gemma":0.0010881983,"threshold_uncertainty_score":0.020354867},"labels":[],"label_agreement":null},{"id":"W3207358118","doi":"10.1017/9781108762366.007","title":"Linear Response Theory and Green’s Functions","year":2020,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Western University","funders":"","keywords":"Green S; Mathematics; Mathematical analysis","score_opus":0.01732150109494347,"score_gpt":0.19386380155754143,"score_spread":0.17654230046259797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207358118","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004229888,0.07618872,0.34943354,0.009126521,0.0028908201,0.000041178508,0.0006709699,0.0012429616,0.5561754],"genre_scores_gemma":[0.13692749,0.059045393,0.076645084,0.0040842877,0.002133854,0.0002577037,0.0010459026,0.0014802618,0.71838003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996407,0.00012120095,0.000007655608,0.000042387146,0.0001512448,0.000036875514],"domain_scores_gemma":[0.9995938,0.00024228897,0.000016789709,0.000052130854,0.000075535645,0.000019414669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054187136,0.00080319954,0.00091495755,0.0009538016,0.0004453821,0.0016201386,0.00080780376,0.0014313535,0.03209462],"category_scores_gemma":[0.0013729321,0.0003714348,0.0006151379,0.0015227245,0.001618922,0.0013743868,0.0008430475,0.0022123978,0.013646492],"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.000016627808,0.000017838594,0.000046056448,0.0003414072,0.000018209224,0.000059191247,0.00009526759,0.0064452486,0.0011279575,0.8623587,0.08244527,0.047028195],"study_design_scores_gemma":[0.000005591877,0.000015994654,0.00013495138,0.00011585362,0.0000058007413,0.00011640272,0.000045693858,0.010142287,0.0004785742,0.8877599,0.10116256,0.000016389455],"about_ca_topic_score_codex":0.0009543461,"about_ca_topic_score_gemma":0.0009509329,"teacher_disagreement_score":0.03209462,"about_ca_system_score_codex":0.001031792,"about_ca_system_score_gemma":0.00072420406,"threshold_uncertainty_score":0.10736722},"labels":[],"label_agreement":null},{"id":"W3208255915","doi":"10.21468/scipostphyslectnotes.46","title":"Introduction to Monte Carlo for matrix models","year":2022,"lang":"en","type":"article","venue":"SciPost Physics Lecture Notes","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Institut Périmètre de physique théorique; Ontario Ministry of Economic Development and Innovation; Government of Canada; Ministero dello Sviluppo Economico; Innovation, Science and Economic Development Canada","keywords":"Python (programming language); Laptop; Monte Carlo method; Computer science; Matrix (chemical analysis); Applied mathematics; Statistical physics; Range (aeronautics); Algorithm; Mathematics; Physics; Statistics; Engineering","score_opus":0.012355764263715825,"score_gpt":0.24983189331042652,"score_spread":0.2374761290467107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208255915","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087981194,0.0031557092,0.97409964,0.0015134566,0.00046706456,0.00008254643,0.00045038766,0.0013490057,0.018002376],"genre_scores_gemma":[0.06431281,0.009299807,0.8986749,0.002104744,0.002926945,0.001074584,0.0011745333,0.003918688,0.016512942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99653924,0.0016426188,0.00017083724,0.00036557316,0.0011117859,0.0001699787],"domain_scores_gemma":[0.99055684,0.006915962,0.0003621233,0.0011099788,0.0007712922,0.0002837593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040846467,0.0017618345,0.0015979216,0.002245502,0.0012829376,0.003128091,0.0031518976,0.00272677,0.02178437],"category_scores_gemma":[0.015510441,0.001223961,0.0027085673,0.0030626522,0.002853473,0.005299813,0.0032425171,0.0081119,0.0075211166],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021193171,0.000060662405,0.0005022459,0.00033629002,0.0000647928,0.0001395063,0.00018443076,0.029842202,0.000726595,0.91103995,0.01875031,0.03833163],"study_design_scores_gemma":[0.000013650951,0.000018668175,0.00022101638,0.00015559701,0.000011406536,0.00020653514,0.000015412656,0.111395776,0.00049990945,0.8234306,0.063990444,0.000040969277],"about_ca_topic_score_codex":0.0025233028,"about_ca_topic_score_gemma":0.0020935803,"teacher_disagreement_score":0.02178437,"about_ca_system_score_codex":0.0017292827,"about_ca_system_score_gemma":0.0016857025,"threshold_uncertainty_score":0.07287598},"labels":[],"label_agreement":null},{"id":"W3209471044","doi":"10.5281/zenodo.4667718","title":"hpcng/singularity: Singularity 3.7.3","year":2021,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Tellabs (Canada)","funders":"","keywords":"Singularity; Essential singularity; Mathematics; Mathematical analysis","score_opus":0.028932955962944845,"score_gpt":0.24265141552842354,"score_spread":0.2137184595654787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209471044","genre_codex":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012834559,0.0004167061,0.071145825,0.00084472727,0.0004308713,0.00017613999,0.0200634,0.8438824,0.0617565],"genre_scores_gemma":[0.030374909,0.00081700966,0.056804188,0.0020671498,0.0003884143,0.0005277374,0.07106021,0.75989985,0.078060605],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99806744,0.00017544847,0.00014216598,0.00023101822,0.0011134091,0.0002704676],"domain_scores_gemma":[0.9955628,0.0008713518,0.00022019337,0.001308794,0.00175209,0.00028487586],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019917144,0.0020384786,0.0013754921,0.001841573,0.0009599303,0.0039916546,0.00477052,0.002265001,0.39691412],"category_scores_gemma":[0.014248683,0.0025085374,0.0016633668,0.00171496,0.0009538247,0.005501828,0.003805277,0.0045534153,0.42844316],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017344803,0.000033318443,0.00039127344,0.00027660516,0.000022557957,0.000108074135,0.00010069448,0.000553769,0.0018781025,0.006443086,0.96649116,0.023527917],"study_design_scores_gemma":[0.00025744003,0.00006329262,0.001010837,0.00022160527,0.00002963253,0.0005352205,0.000054931344,0.008167072,0.010337692,0.019009234,0.96017945,0.00013361417],"about_ca_topic_score_codex":0.0032365199,"about_ca_topic_score_gemma":0.0030925015,"teacher_disagreement_score":0.39691412,"about_ca_system_score_codex":0.0015062733,"about_ca_system_score_gemma":0.0016331224,"threshold_uncertainty_score":0.8602288},"labels":[],"label_agreement":null},{"id":"W3209787410","doi":"10.1093/imanum/drac077","title":"Eigenvalue bounds for double saddle-point systems","year":2022,"lang":"en","type":"article","venue":"IMA Journal of Numerical Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Saddle point; Saddle; Diagonal; Multiplicity (mathematics); Algebraic number; Bounded function; Mathematical analysis; Applied mathematics; Pure mathematics; Geometry; Mathematical optimization","score_opus":0.017950343079521446,"score_gpt":0.2654112594101623,"score_spread":0.24746091633064085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209787410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08613469,0.00044941617,0.9016536,0.00023612272,0.00006801093,0.000031153293,0.00006891244,0.00022867385,0.01112949],"genre_scores_gemma":[0.9580165,0.00027588883,0.039251134,0.00006174673,0.000047530742,0.00007502808,0.00010144506,0.00009893258,0.0020717748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995223,0.00012403502,0.00002267466,0.00006913788,0.00018914814,0.000072777344],"domain_scores_gemma":[0.9970017,0.0015066101,0.0003645103,0.0002519691,0.0006900333,0.00018514018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011897689,0.0007410591,0.00078132737,0.0014149863,0.0004899335,0.0010145961,0.00061249384,0.00058175134,0.0032812797],"category_scores_gemma":[0.006660329,0.0002755023,0.00034598188,0.00040588126,0.0011555745,0.0011036446,0.0014608608,0.0009218288,0.00044169035],"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.00015027347,0.000043646538,0.0015578304,0.00019879772,0.000058384358,0.00031528712,0.00024755936,0.5264964,0.017753331,0.42936882,0.002169185,0.021640433],"study_design_scores_gemma":[0.0000029933872,0.00001919333,0.0002216304,0.000022689497,0.0000036582442,0.00003920124,0.000026938842,0.93879235,0.0015068451,0.058787756,0.00056672376,0.000009974105],"about_ca_topic_score_codex":0.0005306319,"about_ca_topic_score_gemma":0.00048603571,"teacher_disagreement_score":0.0032812797,"about_ca_system_score_codex":0.00048220236,"about_ca_system_score_gemma":0.00034033993,"threshold_uncertainty_score":0.010976911},"labels":[],"label_agreement":null},{"id":"W3211417038","doi":"10.13140/rg.2.2.24069.68326","title":"GPMR: An Iterative Method for Unsymmetric Partitioned Linear Systems","year":2021,"lang":"en","type":"preprint","venue":"PolyPublie (École Polytechnique de Montréal)","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":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données","keywords":"Generalized minimal residual method; Block (permutation group theory); Orthogonality; Linear system; Mathematics; Iterative method; Residual; Computer science; Iterative and incremental development; Matrix (chemical analysis); Algorithm; Applied mathematics; Combinatorics; Mathematical analysis","score_opus":0.02081017120613563,"score_gpt":0.28499082640325923,"score_spread":0.2641806551971236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211417038","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095836597,0.000061655985,0.9975387,0.000056674675,0.00002686826,0.00002368503,0.000035114343,0.00065507955,0.0006439343],"genre_scores_gemma":[0.031639237,0.0001480099,0.9641823,0.00010339311,0.00003878159,0.00016813695,0.0001864302,0.0006161477,0.0029174609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999356,0.0002498617,0.000024930936,0.0000754295,0.00025719326,0.00003662011],"domain_scores_gemma":[0.9992235,0.00037113807,0.00007809347,0.00012254292,0.0001659309,0.000038732953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008080855,0.0010242977,0.0008173267,0.00043330344,0.00032934762,0.0005648093,0.0013833217,0.0012024507,0.0063434825],"category_scores_gemma":[0.0027612834,0.0005699399,0.0006849614,0.00055642315,0.0007010097,0.00086954475,0.0018001932,0.0020268383,0.002933282],"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.00016196462,0.000074102754,0.00047017328,0.00055240805,0.00013160236,0.0003435108,0.00035677454,0.67252725,0.03266504,0.046593066,0.014483983,0.23164016],"study_design_scores_gemma":[0.00002657478,0.000047122066,0.00006270195,0.00001869188,0.000006807897,0.00008390985,0.000013612659,0.9800014,0.0040764282,0.005729652,0.009919461,0.000013633056],"about_ca_topic_score_codex":0.0016793014,"about_ca_topic_score_gemma":0.0022971828,"teacher_disagreement_score":0.0063434825,"about_ca_system_score_codex":0.00024857302,"about_ca_system_score_gemma":0.0010531457,"threshold_uncertainty_score":0.021221042},"labels":[],"label_agreement":null},{"id":"W3216676078","doi":"10.1016/j.laa.2022.07.012","title":"Conjectured DXZ decompositions of a unitary matrix","year":2022,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"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":"National Research Council Canada; Canada Research Chairs; New Brunswick Innovation Foundation","keywords":"Mathematics; Unitary state; Unitary matrix; Matrix (chemical analysis); Conjecture; Dimension (graph theory); Block matrix; Set (abstract data type); Matrix decomposition; Decomposition; Combinatorics; Decomposition theorem; Algebra over a field; Discrete mathematics; Pure mathematics; Law","score_opus":0.007967023992535774,"score_gpt":0.25174854572252087,"score_spread":0.2437815217299851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216676078","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53689945,0.00070730306,0.34762177,0.005063897,0.0010639938,0.00011549753,0.001176158,0.00077635684,0.10657559],"genre_scores_gemma":[0.9296135,0.00035855736,0.04179259,0.0011705029,0.00055670773,0.00011330447,0.00084510015,0.00025795933,0.025291769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992588,0.00016414798,0.000038809976,0.00018539268,0.00018566163,0.00016711818],"domain_scores_gemma":[0.99863017,0.00050583546,0.00015272388,0.0002698413,0.00018511532,0.00025633015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010761342,0.00096714403,0.0007832588,0.0011318324,0.0012962606,0.0032859598,0.0009966932,0.0013243229,0.014415432],"category_scores_gemma":[0.0040835002,0.00045733294,0.00071211375,0.00086287083,0.0027070916,0.0035834596,0.0022426578,0.002559227,0.0022693444],"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.00006952242,0.000024222347,0.0002604421,0.000025846546,0.000004611014,0.00006200903,0.00017520724,0.0008182667,0.0011820989,0.98991746,0.0025218045,0.004938633],"study_design_scores_gemma":[0.000023186598,0.000020522508,0.00016794697,0.000014162967,0.0000036801848,0.000095431475,0.000107511994,0.006411135,0.00080608745,0.9897843,0.0025535878,0.000012455974],"about_ca_topic_score_codex":0.00062046456,"about_ca_topic_score_gemma":0.0004382682,"teacher_disagreement_score":0.014415432,"about_ca_system_score_codex":0.0006972243,"about_ca_system_score_gemma":0.00063266035,"threshold_uncertainty_score":0.04822445},"labels":[],"label_agreement":null},{"id":"W330206521","doi":"10.1007/978-0-387-68276-1_20","title":"Extremal Representations of Matrix Functions","year":2010,"lang":"en","type":"book-chapter","venue":"Springer series in statistics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Eigenvalues and eigenvectors; Representation (politics); Simple (philosophy); Mathematics; Yield (engineering); Matrix (chemical analysis); Function (biology); Pure mathematics; Matrix function; Applied mathematics; Algebra over a field; Symmetric matrix; Physics","score_opus":0.01729680218949425,"score_gpt":0.27306203017506603,"score_spread":0.2557652279855718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W330206521","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053963516,0.01873317,0.6705474,0.0027040315,0.0014146947,0.000038733317,0.0004576817,0.0006969982,0.25144368],"genre_scores_gemma":[0.67526895,0.01908762,0.17517938,0.0010316715,0.006334224,0.0002060138,0.000867967,0.00092125987,0.12110291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965894,0.00009822317,0.000015604415,0.00006222669,0.00012250213,0.000042489584],"domain_scores_gemma":[0.9993962,0.00029569416,0.00007361105,0.000098647426,0.00008452774,0.000051403596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005381895,0.00086464203,0.00088362664,0.0021947757,0.0006128752,0.0030090327,0.0009704451,0.0011682375,0.008824287],"category_scores_gemma":[0.0021137965,0.0004687843,0.00061076984,0.0014609979,0.0017395713,0.003063003,0.00091955456,0.0027333496,0.0020043126],"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.000005167574,0.0000050241943,0.000025123009,0.00002450067,0.000003041724,0.000012108626,0.00004085329,0.000962607,0.00036758356,0.9862132,0.0025460229,0.009794682],"study_design_scores_gemma":[0.000002178995,0.000005421612,0.00007686938,0.000013384086,0.00000216362,0.00006573086,0.000016199194,0.008807009,0.00012416735,0.98569995,0.005179663,0.0000073330702],"about_ca_topic_score_codex":0.00022179015,"about_ca_topic_score_gemma":0.00024038191,"teacher_disagreement_score":0.008824287,"about_ca_system_score_codex":0.00058583805,"about_ca_system_score_gemma":0.00029541977,"threshold_uncertainty_score":0.029520214},"labels":[],"label_agreement":null},{"id":"W334892658","doi":"","title":"QUARTER-SYMMETRIC SEMI-METRIC CONNECTION ON SASAKIAN MANIFOLD","year":2007,"lang":"en","type":"article","venue":"Tensor. New series","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Metric connection; Connection (principal bundle); Quarter (Canadian coin); Metric (unit); Mathematics; Manifold (fluid mechanics); Geology; Geometry; Fundamental theorem of Riemannian geometry; Engineering; History; Mechanical engineering; Operations management","score_opus":0.012852866322395946,"score_gpt":0.2369618084790253,"score_spread":0.22410894215662935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W334892658","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73530024,0.0014403948,0.18753502,0.002337665,0.0012088547,0.000060538034,0.00057100976,0.00059346546,0.07095283],"genre_scores_gemma":[0.9522607,0.00078091345,0.018127132,0.00027053693,0.00045942352,0.00003732514,0.00038244532,0.00015830035,0.027523214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998242,0.000038045644,0.00000734292,0.00004108955,0.000056849072,0.000032422282],"domain_scores_gemma":[0.99960274,0.000040155464,0.000072574716,0.00006151423,0.000096106545,0.00012686547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002255135,0.00036679424,0.00045610435,0.0011351407,0.0008300415,0.001130213,0.00061236025,0.00075517455,0.008353807],"category_scores_gemma":[0.00084202114,0.0001771391,0.0002854703,0.00050361775,0.0008574071,0.0022854721,0.001096878,0.0007973246,0.0012032206],"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.00006476433,0.00002775607,0.00062376255,0.000043360385,0.000011143772,0.00021031247,0.00018427399,0.002517208,0.004439104,0.97340447,0.004975875,0.0134980865],"study_design_scores_gemma":[0.000011752811,0.000058122827,0.00087783486,0.0000091734155,0.0000074376776,0.00043641392,0.00016092118,0.039943606,0.0010023557,0.94951403,0.007956573,0.000021879407],"about_ca_topic_score_codex":0.00071570976,"about_ca_topic_score_gemma":0.00078846834,"teacher_disagreement_score":0.008353807,"about_ca_system_score_codex":0.00055820803,"about_ca_system_score_gemma":0.00041252119,"threshold_uncertainty_score":0.027946234},"labels":[],"label_agreement":null},{"id":"W340250899","doi":"10.13001/1081-3810.1173","title":"Schur complements of matrices with acyclic bipartite graphs","year":2005,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Schur complement; Combinatorics; Sign (mathematics); Bipartite graph; Invertible matrix; Factorization; Inverse; Matrix (chemical analysis); Discrete mathematics; Pure mathematics; Graph; Mathematical analysis; Algorithm; Geometry","score_opus":0.00782412159649532,"score_gpt":0.24721593812946457,"score_spread":0.23939181653296926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W340250899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17566341,0.00064790586,0.73319304,0.00054038723,0.0002478527,0.00033973897,0.0013683739,0.0009903628,0.08700897],"genre_scores_gemma":[0.79282606,0.00091194233,0.17396688,0.0004531867,0.0002677687,0.0006558716,0.0021018998,0.0002775773,0.028538862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847513,0.0005009922,0.00006412877,0.00021991739,0.0004740924,0.00026566393],"domain_scores_gemma":[0.99719185,0.0010982663,0.00044562202,0.00035075183,0.0006604597,0.00025306674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009663698,0.000992806,0.0005431755,0.0022282954,0.0012050638,0.0023541152,0.00087470934,0.00082005514,0.0111813415],"category_scores_gemma":[0.0053435955,0.0005399555,0.0006253312,0.0020047764,0.0023126681,0.0022839557,0.0017343105,0.0009943272,0.0015618592],"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.00009129934,0.00003277111,0.0002529735,0.00006878839,0.000013402592,0.00022733258,0.00013946762,0.018050672,0.0023349896,0.9567297,0.0025239373,0.019534776],"study_design_scores_gemma":[0.00001926061,0.00004122951,0.00021346375,0.000036325207,0.000010685001,0.00015624,0.00012495149,0.08717866,0.002544876,0.8989343,0.010712704,0.000027186925],"about_ca_topic_score_codex":0.0030229161,"about_ca_topic_score_gemma":0.0041870587,"teacher_disagreement_score":0.0111813415,"about_ca_system_score_codex":0.0010781474,"about_ca_system_score_gemma":0.0012953467,"threshold_uncertainty_score":0.03740537},"labels":[],"label_agreement":null},{"id":"W344607830","doi":"10.13001/1081-3810.1387","title":"Refined inertially and spectrally arbitrary zero-nonzero patterns","year":2010,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":13,"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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Zero (linguistics); Mathematics; Eigenvalues and eigenvectors; Inertia; Zero order; Matrix (chemical analysis); Order (exchange); Mathematical analysis; Pure mathematics; Physics; Applied mathematics; First order; Classical mechanics; Quantum mechanics","score_opus":0.004421461717682794,"score_gpt":0.21843429756039076,"score_spread":0.21401283584270797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W344607830","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74048305,0.00029412817,0.19138433,0.00026534192,0.0001479789,0.00004686523,0.00019555396,0.0003001945,0.06688258],"genre_scores_gemma":[0.9583674,0.00015837433,0.027877508,0.000081846316,0.00007670513,0.000035587887,0.0002479451,0.000101579615,0.013053149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945265,0.000088901616,0.00004077921,0.00009548181,0.0001818914,0.00014025257],"domain_scores_gemma":[0.99901855,0.00018993525,0.00016827892,0.00030981915,0.0001939727,0.000119373944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040439935,0.0004171074,0.00034372884,0.0007075183,0.0006463345,0.0009446146,0.00051393005,0.00034456054,0.004875989],"category_scores_gemma":[0.00199815,0.00026244193,0.00043488352,0.00048487633,0.0018688489,0.0015757424,0.001094313,0.0007816907,0.0007621835],"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.00017845906,0.00003248094,0.0016322111,0.00005486203,0.0000094611505,0.00042969544,0.0004528989,0.0053169997,0.018283881,0.9554241,0.001462917,0.01672198],"study_design_scores_gemma":[0.00004294263,0.000121259385,0.0024607137,0.00002698285,0.000021702926,0.0006922438,0.0003160282,0.05142303,0.018107204,0.9162135,0.010515323,0.00005911779],"about_ca_topic_score_codex":0.0006399128,"about_ca_topic_score_gemma":0.00080319645,"teacher_disagreement_score":0.004875989,"about_ca_system_score_codex":0.00028918264,"about_ca_system_score_gemma":0.0003307428,"threshold_uncertainty_score":0.016311824},"labels":[],"label_agreement":null},{"id":"W345026329","doi":"","title":"Modified Newton's Algorithm for Computing the Group Inverses of Singular Toeplitz Matrices","year":2006,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Toeplitz matrix; Newton's method; Power iteration; Convergence (economics); Matrix (chemical analysis); Rank (graph theory); Group (periodic table); Fixed-point iteration; Algorithm; Computation; Iterative method; Applied mathematics; Algebra over a field; Pure mathematics; Mathematical analysis; Fixed point; Combinatorics; Nonlinear system","score_opus":0.01280830233121174,"score_gpt":0.23573314434186168,"score_spread":0.22292484201064994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W345026329","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019029856,0.00011802758,0.9967349,0.000039770403,0.00006490041,0.00003096108,0.000021213491,0.0002270435,0.0008602028],"genre_scores_gemma":[0.03471737,0.00022182065,0.96035403,0.000031784297,0.000048055506,0.00012936932,0.00009894082,0.00012457008,0.004274127],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995421,0.0001019329,0.00002161424,0.000052226536,0.00025215477,0.000030089757],"domain_scores_gemma":[0.9994993,0.00017221131,0.000047622514,0.00008263711,0.00016952831,0.000028657712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005254303,0.00085238105,0.0008058728,0.00073000544,0.00043869475,0.00066287146,0.0011483227,0.00087576476,0.0038564752],"category_scores_gemma":[0.0019906245,0.00037548784,0.000697216,0.0008802078,0.0006143141,0.0008960407,0.0006250696,0.0012345373,0.0015380423],"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.0002493654,0.00008661523,0.00076075876,0.00037580193,0.00015339724,0.00034883711,0.00027453332,0.35958844,0.032461893,0.094069116,0.012070093,0.4995611],"study_design_scores_gemma":[0.000029194296,0.00007107416,0.00030620827,0.0000151917175,0.000013593463,0.00019236673,0.00002058676,0.9625446,0.007367585,0.01544684,0.0139574725,0.000035285706],"about_ca_topic_score_codex":0.002599072,"about_ca_topic_score_gemma":0.00480994,"teacher_disagreement_score":0.0038564752,"about_ca_system_score_codex":0.00046594915,"about_ca_system_score_gemma":0.0012721149,"threshold_uncertainty_score":0.012901187},"labels":[],"label_agreement":null},{"id":"W350056888","doi":"10.13001/1081-3810.1640","title":"Techniques for identifying inertially arbitrary patterns","year":2013,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University; Discovery Centre; University of Victoria; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Jacobian matrix and determinant; Mathematics; Nilpotent; Applied mathematics; Matrix (chemical analysis); Eigenvalues and eigenvectors; Algorithm; Algebra over a field; Pure mathematics; Physics","score_opus":0.012218735288437896,"score_gpt":0.26284107341778207,"score_spread":0.25062233812934415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W350056888","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011228871,0.00012073226,0.9744441,0.00022782861,0.00016389406,0.000049129925,0.000035090718,0.000468496,0.013261863],"genre_scores_gemma":[0.2655813,0.000630334,0.7146508,0.0003600125,0.00027784504,0.00026407113,0.00023534863,0.00063958956,0.017360639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978515,0.00050910027,0.0001900578,0.00040027493,0.0008618574,0.0001872185],"domain_scores_gemma":[0.9952714,0.0012384892,0.00052792183,0.0019203437,0.00090276,0.00013905698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017174501,0.0006557735,0.00048477371,0.0021099015,0.0015769041,0.0017236032,0.0016011626,0.0007963148,0.010552421],"category_scores_gemma":[0.009056805,0.00050205644,0.0007053374,0.0015279846,0.00362461,0.005494267,0.003336601,0.0023335568,0.0035388947],"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.000053491236,0.000024913103,0.00061560137,0.00012550612,0.00001165222,0.00017453636,0.00087512675,0.0011607456,0.0119171515,0.88907766,0.002376007,0.09358756],"study_design_scores_gemma":[0.000026117628,0.00008529929,0.0006419788,0.00007231239,0.000020180349,0.00093051855,0.00050733564,0.024138998,0.032480977,0.8920538,0.048961442,0.00008109168],"about_ca_topic_score_codex":0.00033845936,"about_ca_topic_score_gemma":0.00053252536,"teacher_disagreement_score":0.010552421,"about_ca_system_score_codex":0.00042103673,"about_ca_system_score_gemma":0.0007564404,"threshold_uncertainty_score":0.035301387},"labels":[],"label_agreement":null},{"id":"W358189445","doi":"","title":"STATE SPACE DYNAMICS AND ENTROPY (The structure of operator algebras and its applications)","year":2003,"lang":"en","type":"article","venue":"Kyoto University Research Information Repository (Kyoto University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"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","keywords":"Entropy (arrow of time); State space; Mathematics; Operator (biology); Statistical physics; Computer science; Algebra over a field; Pure mathematics; Physics; Quantum mechanics; Statistics","score_opus":0.006918813620773408,"score_gpt":0.21171081030046418,"score_spread":0.20479199667969078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W358189445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34027722,0.013813081,0.546675,0.009020506,0.0009197389,0.00006221327,0.00076587626,0.00025487793,0.088211514],"genre_scores_gemma":[0.9667395,0.0028199987,0.020418078,0.00027285004,0.00067956006,0.00006691224,0.00015327235,0.00006053301,0.008789374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995535,0.00015162327,0.00002534744,0.00009699993,0.00010989101,0.00006264644],"domain_scores_gemma":[0.99876934,0.0007246654,0.00015877152,0.0000972979,0.00014173269,0.000108107895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010274114,0.00034324796,0.0006313415,0.0011206896,0.0007917876,0.0024354185,0.0007357968,0.00095099176,0.0044286577],"category_scores_gemma":[0.0037524535,0.00034046164,0.00053089095,0.0011804821,0.0032792636,0.006085765,0.0015687937,0.0014673957,0.0003530096],"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.000008809373,0.000007370397,0.00011332142,0.000016692258,0.0000040506015,0.000013679845,0.00006776773,0.0015273866,0.00044820644,0.9952715,0.00032814604,0.0021931946],"study_design_scores_gemma":[0.0000028378022,0.000005839821,0.00012710468,0.000005245711,0.0000020743953,0.00001982552,0.000017482767,0.010122975,0.00014366329,0.98900723,0.0005399612,0.0000058141136],"about_ca_topic_score_codex":0.0005976628,"about_ca_topic_score_gemma":0.00044921436,"teacher_disagreement_score":0.0044286577,"about_ca_system_score_codex":0.00079688564,"about_ca_system_score_gemma":0.0005120738,"threshold_uncertainty_score":0.0148153305},"labels":[],"label_agreement":null},{"id":"W397639302","doi":"10.13001/1081-3810.1624","title":"On the Kemeny constant and stationary distribution vector for a Markov chain","year":2014,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Markov chain; Constant (computer programming); Stationary distribution; Distribution (mathematics); Chain (unit); Continuous-time Markov chain; Markov property; Applied mathematics; Combinatorics; Statistical physics; Pure mathematics; Mathematical analysis; Markov model; Statistics; Computer science; Physics","score_opus":0.005698658319957989,"score_gpt":0.2231411339679574,"score_spread":0.2174424756479994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W397639302","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16905203,0.0032431623,0.79158556,0.0025656088,0.00020489108,0.00012555248,0.00070018444,0.0003188809,0.03220411],"genre_scores_gemma":[0.91624063,0.0033690054,0.063504264,0.00062504906,0.00051712245,0.0003028215,0.0005359478,0.00023170839,0.014673492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980715,0.0005799303,0.00008148304,0.0004210405,0.00041899522,0.0004270669],"domain_scores_gemma":[0.97351223,0.020815937,0.0019866277,0.0008196093,0.0014328777,0.0014327499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038426407,0.0012543334,0.0011597743,0.0031706763,0.0019722541,0.0023574189,0.0018330485,0.0015373447,0.00901924],"category_scores_gemma":[0.029631983,0.000585821,0.0008503837,0.002578324,0.0051004402,0.0062192227,0.002279786,0.0033786204,0.0015853732],"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.0000968884,0.00003116676,0.00068165996,0.00007123034,0.00001972438,0.00012588204,0.00022868172,0.030104557,0.0011816657,0.95999753,0.0014046204,0.0060564177],"study_design_scores_gemma":[0.000022714805,0.00004836245,0.00054951204,0.00007406419,0.00001646966,0.00011314375,0.000111393456,0.21675158,0.00092863163,0.7793208,0.0019882515,0.000075114534],"about_ca_topic_score_codex":0.005050326,"about_ca_topic_score_gemma":0.0034864764,"teacher_disagreement_score":0.00901924,"about_ca_system_score_codex":0.003147098,"about_ca_system_score_gemma":0.002746824,"threshold_uncertainty_score":0.030172288},"labels":[],"label_agreement":null},{"id":"W4200582650","doi":"10.1515/spma-2021-0151","title":"On some reciprocal matrices with elliptical components of their Kippenhahn curves","year":2021,"lang":"en","type":"article","venue":"Special Matrices","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"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; New York University Abu Dhabi","keywords":"Reciprocal; Mathematics; Tridiagonal matrix; Corollary; Ellipse; Rank (graph theory); Diagonal; Matrix (chemical analysis); Pure mathematics; Diagonally dominant matrix; Range (aeronautics); Numerical range; Combinatorics; Geometry; Eigenvalues and eigenvectors; Invertible matrix","score_opus":0.013972957080190647,"score_gpt":0.23441146371163982,"score_spread":0.22043850663144918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200582650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5574601,0.000592945,0.37588146,0.00046198978,0.00006861009,0.00008724662,0.00025932508,0.0004640324,0.064724326],"genre_scores_gemma":[0.95181626,0.00030969962,0.039182853,0.000091162576,0.00008508249,0.00006653003,0.0001848453,0.00010327709,0.008160347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924517,0.00022972938,0.00003860045,0.000104118895,0.00027094534,0.00011147426],"domain_scores_gemma":[0.9969796,0.0015303238,0.00046409568,0.00029506552,0.00047703367,0.00025385033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091684604,0.0005171135,0.00030920323,0.0019346497,0.00061339996,0.0014109449,0.0004770624,0.0005703861,0.0075201914],"category_scores_gemma":[0.008477989,0.00023076555,0.00034539527,0.00091357506,0.0017601354,0.0018477576,0.00089802576,0.00076007243,0.0014092133],"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.00008016559,0.000025457324,0.00073096756,0.000046871304,0.000006236783,0.00020912653,0.0003431085,0.010416461,0.0044460054,0.9612518,0.0013397634,0.021104028],"study_design_scores_gemma":[0.000031560616,0.00009925995,0.0009829876,0.00005397267,0.000007671902,0.0010068567,0.0003163143,0.12518415,0.008360157,0.85457516,0.009324184,0.0000578091],"about_ca_topic_score_codex":0.00045963377,"about_ca_topic_score_gemma":0.0002792873,"teacher_disagreement_score":0.0075201914,"about_ca_system_score_codex":0.00053072727,"about_ca_system_score_gemma":0.0002040988,"threshold_uncertainty_score":0.02515757},"labels":[],"label_agreement":null},{"id":"W4205414010","doi":"10.1016/s0024-3795(04)00005-9","title":"Numerical solution of a quadratic eigenvalue problem*1","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Eigenvalues and eigenvectors; Mathematics; Positive-definite matrix; Quadratic equation; Symmetry (geometry); Matrix (chemical analysis); The Imaginary; Mathematical analysis; Pure mathematics; Physics; Quantum mechanics; Geometry; Chemistry","score_opus":0.011131930889933668,"score_gpt":0.2461416482281522,"score_spread":0.23500971733821854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205414010","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16077274,0.0003528069,0.8040938,0.0015432503,0.0005176429,0.00009123356,0.00013304925,0.0006361341,0.031859286],"genre_scores_gemma":[0.7761231,0.00012622515,0.2130497,0.0001683963,0.000108993816,0.00012687204,0.00013693799,0.00020706799,0.009952714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970055,0.0001139492,0.000012678131,0.000037297264,0.000101023026,0.000034561966],"domain_scores_gemma":[0.99871755,0.0007858094,0.00008440358,0.0000994211,0.00024189288,0.000070900416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007863587,0.0004051435,0.0007147947,0.00043120564,0.00073559594,0.0009182614,0.0007040456,0.0015194728,0.0051351464],"category_scores_gemma":[0.004144212,0.00031023583,0.0002633395,0.00057538715,0.0009016422,0.0010774235,0.0011859987,0.00094203505,0.0005229197],"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.00029457474,0.00017711817,0.0008560983,0.000245408,0.000037660462,0.00020834204,0.00025009294,0.86654073,0.008834585,0.085493416,0.0044920905,0.032569773],"study_design_scores_gemma":[0.000014716319,0.000021986594,0.00008046881,0.0000056818712,0.0000018758171,0.000016524618,0.00002020958,0.9916202,0.00068341795,0.0069904453,0.00053889974,0.0000056409895],"about_ca_topic_score_codex":0.00220505,"about_ca_topic_score_gemma":0.0017680798,"teacher_disagreement_score":0.0051351464,"about_ca_system_score_codex":0.00035407126,"about_ca_system_score_gemma":0.00075039157,"threshold_uncertainty_score":0.017178774},"labels":[],"label_agreement":null},{"id":"W4205979227","doi":"10.1007/978-3-030-52815-7_1","title":"Vector Spaces","year":2021,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"","keywords":"Eigenvalues and eigenvectors; Rank (graph theory); Matrix (chemical analysis); Combinatorics; Set (abstract data type); Mathematics; Vector space; Linear algebra; Real number; Algebra over a field; Discrete mathematics; Pure mathematics; Computer science; Physics; Geometry","score_opus":0.015600189254617392,"score_gpt":0.22161696189405586,"score_spread":0.20601677263943846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205979227","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00147369,0.0125523945,0.059708185,0.0011371656,0.0018538889,0.000030317358,0.0007540311,0.00056728267,0.92192304],"genre_scores_gemma":[0.02073351,0.008559813,0.015733225,0.00038035683,0.0010604574,0.000065852364,0.00094207027,0.0004147535,0.95211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997514,0.00004313989,0.000009005452,0.000044777094,0.00013194047,0.000019695039],"domain_scores_gemma":[0.99985456,0.00003428331,0.000007763986,0.0000322875,0.000052614305,0.000018524432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020360919,0.0010797164,0.0006063276,0.0012688877,0.0007526865,0.0030064804,0.0005759633,0.00043944042,0.07264909],"category_scores_gemma":[0.00052939774,0.0003172377,0.00025045383,0.002288206,0.0010979223,0.002535501,0.001012166,0.0016708394,0.03909321],"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.000010368288,0.000016342201,0.00003726251,0.0001365314,0.000006134466,0.00001849472,0.00014968151,0.00064619805,0.0008445266,0.64708996,0.20192356,0.1491209],"study_design_scores_gemma":[0.000002288466,0.000010399946,0.000089829664,0.00004809909,0.000003145726,0.00006604846,0.000054167944,0.000856426,0.0004196838,0.24022307,0.7582207,0.0000061755363],"about_ca_topic_score_codex":0.0008346066,"about_ca_topic_score_gemma":0.0014003082,"teacher_disagreement_score":0.07264909,"about_ca_system_score_codex":0.0007298107,"about_ca_system_score_gemma":0.0005488686,"threshold_uncertainty_score":0.24303544},"labels":[],"label_agreement":null},{"id":"W4205991653","doi":"10.1016/s0024-3795(03)00899-1","title":"On polynomial numerical hulls of normal matrices","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Hull; Matrix polynomial; Hermitian matrix; Polynomial; Hyperbola; Numerical range; Numerical analysis; Convergence (economics); Polynomial matrix; Combinatorics; Order (exchange); Stable polynomial; Mathematical analysis; Pure mathematics; Alternating polynomial; Geometry","score_opus":0.007320233662388528,"score_gpt":0.23900340023247402,"score_spread":0.23168316657008547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205991653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21662065,0.00089160854,0.7234608,0.001197189,0.00025992587,0.000057177145,0.00041619583,0.0005681511,0.05652827],"genre_scores_gemma":[0.8832197,0.00125093,0.080694124,0.00025221123,0.0005539212,0.00005737559,0.00094803347,0.00032918237,0.032694455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864095,0.00031647092,0.00005060257,0.00022227303,0.00054630265,0.0002233672],"domain_scores_gemma":[0.9935813,0.003672403,0.0006600539,0.00057562144,0.0008793331,0.00063124695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013331654,0.00096150866,0.0010192032,0.0020694772,0.0013331452,0.0029945113,0.0014869806,0.0007078187,0.008006573],"category_scores_gemma":[0.012070929,0.0006107349,0.00078361493,0.0022594312,0.00450633,0.007076774,0.0031958837,0.0035645391,0.0015283761],"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.00014095934,0.000045155382,0.00054267474,0.00005905221,0.000008863708,0.00007797665,0.0003950116,0.01018198,0.0013294498,0.9651532,0.0025928924,0.019472804],"study_design_scores_gemma":[0.000014560995,0.000038660564,0.0002956717,0.000018781933,0.0000068495538,0.00007410921,0.00012973358,0.050800856,0.0010256366,0.9444128,0.0031637393,0.000018658817],"about_ca_topic_score_codex":0.00280482,"about_ca_topic_score_gemma":0.0024225265,"teacher_disagreement_score":0.008006573,"about_ca_system_score_codex":0.0013263103,"about_ca_system_score_gemma":0.00059867563,"threshold_uncertainty_score":0.026784658},"labels":[],"label_agreement":null},{"id":"W4206269833","doi":"10.1016/j.laa.2009.10.005","title":"Max-algebra and pairwise comparison matrices, II","year":2009,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Toeplitz matrix; Reciprocal; Transitive relation; Matrix (chemical analysis); Pairwise comparison; Eigenvalues and eigenvectors; Combinatorics; Matrix function; Algebra over a field; Matrix analysis; Pure mathematics; Symmetric matrix; Statistics","score_opus":0.011799223125653539,"score_gpt":0.25739084506251264,"score_spread":0.2455916219368591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206269833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030614221,0.0046149353,0.91960585,0.0029449489,0.00087839185,0.0000732648,0.0006122837,0.0004052164,0.04025083],"genre_scores_gemma":[0.6389556,0.0037070299,0.31403455,0.0018555135,0.0031705578,0.00049553317,0.0013175686,0.00042163703,0.036042035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964426,0.0018423633,0.00014352245,0.00069482304,0.00063742185,0.00023932196],"domain_scores_gemma":[0.99291056,0.0043642754,0.0006277164,0.0008702463,0.0008417729,0.00038544263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004560722,0.0008545003,0.0012719223,0.0017130662,0.0019693316,0.003198586,0.0020361159,0.00089357805,0.010017211],"category_scores_gemma":[0.014270633,0.0005110983,0.0012027714,0.003155377,0.0036905399,0.0076397876,0.0022262204,0.003399204,0.0018058702],"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.000035651516,0.000024144172,0.000167573,0.000051962164,0.000017517032,0.000016911607,0.000073541145,0.0019380306,0.00034864747,0.9775008,0.0031294893,0.01669576],"study_design_scores_gemma":[0.0000036894703,0.000014501341,0.00009962497,0.000008310996,0.0000038235266,0.000032015247,0.000017663293,0.005721461,0.00018586054,0.99176323,0.0021421243,0.000007708658],"about_ca_topic_score_codex":0.00061750517,"about_ca_topic_score_gemma":0.000515687,"teacher_disagreement_score":0.010017211,"about_ca_system_score_codex":0.0012954873,"about_ca_system_score_gemma":0.0012825156,"threshold_uncertainty_score":0.033510923},"labels":[],"label_agreement":null},{"id":"W4206819046","doi":"10.1016/s0024-3795(04)00037-0","title":"The spectral radius of a multivariate sampling operator","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal College of Physicians and Surgeons of Canada; Mount Royal University","funders":"","keywords":"Mathematics; Combinatorics; Spectral radius; Operator (biology); Integer (computer science); Hilbert space; Matrix (chemical analysis); RADIUS; Polynomial; Multivariate statistics; Natural number; Function (biology); Discrete mathematics; Pure mathematics; Mathematical analysis; Eigenvalues and eigenvectors; Statistics; Physics","score_opus":0.014883575060169208,"score_gpt":0.26728981824907194,"score_spread":0.25240624318890276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206819046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11049777,0.0009538698,0.874247,0.0012086078,0.0001545701,0.000035759596,0.0001657947,0.00042143377,0.012315238],"genre_scores_gemma":[0.9094877,0.0013448638,0.07877587,0.00042334423,0.0006204476,0.000104720915,0.0001899228,0.00044494442,0.008608195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728274,0.0012529524,0.000093566916,0.00046790353,0.00069659104,0.00020631388],"domain_scores_gemma":[0.98521775,0.009789192,0.001449474,0.0011734914,0.001308683,0.0010612917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033784825,0.00090875325,0.00130751,0.0020257507,0.00080517237,0.0025119162,0.0015261424,0.0016119413,0.0051674293],"category_scores_gemma":[0.022391967,0.00060008897,0.00056023936,0.0011669424,0.0037828456,0.0047982424,0.003099682,0.0016019295,0.0008916083],"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.00023463009,0.000050251256,0.00069908256,0.00012068108,0.00004577576,0.00010487204,0.00020566814,0.024935283,0.009616215,0.94252944,0.0017434341,0.01971478],"study_design_scores_gemma":[0.00003026266,0.00006736962,0.0009822323,0.000042604315,0.000029101513,0.00043848352,0.0001302319,0.38231343,0.0048835217,0.6073769,0.0036318244,0.0000741227],"about_ca_topic_score_codex":0.0006828578,"about_ca_topic_score_gemma":0.00036136346,"teacher_disagreement_score":0.0051674293,"about_ca_system_score_codex":0.0009379708,"about_ca_system_score_gemma":0.00092267455,"threshold_uncertainty_score":0.017867327},"labels":[],"label_agreement":null},{"id":"W4206986784","doi":"10.1090/mbk/139/33","title":"Two factorisation methods based on modern algebra","year":2021,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Algebra over a field; Factorization; Computer science; Mathematics; Pure mathematics; Algorithm","score_opus":0.025831860041063325,"score_gpt":0.3026285165339392,"score_spread":0.2767966564928759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206986784","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042940252,0.0032533533,0.9039292,0.0011662433,0.0016903094,0.00004712795,0.00008601823,0.000507072,0.085026704],"genre_scores_gemma":[0.12767403,0.0045857816,0.69153696,0.0012390121,0.002221901,0.00019496105,0.0002804965,0.0012524264,0.17101444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992244,0.00022431595,0.000034775203,0.00014752008,0.00029987094,0.000069193055],"domain_scores_gemma":[0.999463,0.00020068839,0.000023355458,0.00016004503,0.000118766366,0.000034168555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008695323,0.0009634487,0.00087141216,0.0020511437,0.001096924,0.0023332704,0.0011158244,0.0011434975,0.017967261],"category_scores_gemma":[0.0025454853,0.00046352082,0.0012457727,0.0017105932,0.0030681866,0.0041767783,0.0018687138,0.0028823414,0.0049757096],"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.000020721038,0.000020923884,0.000034877747,0.00005599575,0.000009251753,0.000019989926,0.00012652278,0.0010303212,0.0010243932,0.9340637,0.0055109304,0.058082346],"study_design_scores_gemma":[0.0000132975265,0.000023130908,0.000087347355,0.000029167379,0.000008780675,0.00011192211,0.000040583276,0.008934684,0.0012064716,0.9254554,0.06406722,0.000022103854],"about_ca_topic_score_codex":0.0006719394,"about_ca_topic_score_gemma":0.0007585981,"teacher_disagreement_score":0.017967261,"about_ca_system_score_codex":0.0008779855,"about_ca_system_score_gemma":0.00059469923,"threshold_uncertainty_score":0.060106456},"labels":[],"label_agreement":null},{"id":"W4211235443","doi":"10.1017/9781108762366.010","title":"Applications of Diagrammatic Methods","year":2020,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Western University","funders":"","keywords":"Diagrammatic reasoning; Computer science; Content (measure theory); Information retrieval; Human–computer interaction; World Wide Web; Mathematics; Programming language","score_opus":0.02182760078574421,"score_gpt":0.2384877446321519,"score_spread":0.2166601438464077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211235443","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001253878,0.0142764505,0.81863856,0.0015782309,0.001320012,0.00007007803,0.000333385,0.0016651853,0.16086419],"genre_scores_gemma":[0.08888542,0.031082503,0.7366774,0.0011012523,0.0015835469,0.00047169742,0.0012538254,0.0022718962,0.13667245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99865746,0.00048269256,0.00008063468,0.0001890766,0.00052465714,0.000065498476],"domain_scores_gemma":[0.99851245,0.0008649537,0.00005014203,0.00031633486,0.00020165654,0.000054526223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012549404,0.0009364567,0.0007385172,0.0022355407,0.0009980663,0.0027543618,0.0013271075,0.0010273223,0.054129284],"category_scores_gemma":[0.004242689,0.0006024867,0.0013322674,0.0022810043,0.0018299817,0.003176141,0.002338748,0.0024100407,0.01680631],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014554606,0.000020419797,0.000121047415,0.00049967,0.000025684247,0.00007355857,0.00019015482,0.0040211305,0.000868235,0.78949064,0.035070393,0.16960447],"study_design_scores_gemma":[0.000008422069,0.000010323887,0.000069218455,0.00013527201,0.000007972319,0.00015747521,0.000034850764,0.010495895,0.0008578202,0.76198214,0.22622862,0.000011911516],"about_ca_topic_score_codex":0.00078320026,"about_ca_topic_score_gemma":0.00096587464,"teacher_disagreement_score":0.054129284,"about_ca_system_score_codex":0.0013937498,"about_ca_system_score_gemma":0.0010022679,"threshold_uncertainty_score":0.18108052},"labels":[],"label_agreement":null},{"id":"W4211253693","doi":"10.1090/crmp/054","title":"Corrigendum to our paper: Birational transformations of weighted graphs","year":2009,"lang":"en","type":"book","venue":"ArXiv.org","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Ottawa","funders":"","keywords":"Corollary; Affine transformation; Mathematics; Algebraic geometry; Algebraic number; Dimension of an algebraic variety; Affine geometry; Algebraic surface; Affine geometry of curves; Function field of an algebraic variety; Geometry; Algebra over a field; Pure mathematics; Affine space; Mathematical analysis","score_opus":0.026519157002527636,"score_gpt":0.24191353182201306,"score_spread":0.21539437481948542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211253693","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040609865,0.016286124,0.036611065,0.06386918,0.47703114,0.0000989098,0.001383898,0.0018834161,0.39877528],"genre_scores_gemma":[0.03268989,0.011432726,0.0074013514,0.011030001,0.049057133,0.0001095401,0.0013731855,0.0014231955,0.88548297],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994615,0.00007422982,0.000025417192,0.00012484918,0.00027083865,0.000043236676],"domain_scores_gemma":[0.9984225,0.00041740137,0.00005496135,0.0002026499,0.00075902924,0.00014350486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005585656,0.0007364633,0.0006900862,0.001644517,0.0011191219,0.0020587328,0.000981172,0.0010664352,0.099427804],"category_scores_gemma":[0.00418524,0.00029069636,0.0007200433,0.0017986054,0.00095784635,0.0022891609,0.0008306919,0.002332751,0.038939666],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001066185,0.000012014233,0.00004985863,0.00013232221,0.000009058696,0.00007050048,0.00003491944,0.000305821,0.00044431497,0.03561139,0.9324428,0.030876266],"study_design_scores_gemma":[0.000008753911,0.000027752803,0.0004641771,0.00007702969,0.000022281914,0.0003759973,0.000044036387,0.00071410974,0.0011827174,0.052716993,0.94434404,0.000022118109],"about_ca_topic_score_codex":0.0016591034,"about_ca_topic_score_gemma":0.0031529134,"teacher_disagreement_score":0.099427804,"about_ca_system_score_codex":0.0016580155,"about_ca_system_score_gemma":0.00069741474,"threshold_uncertainty_score":0.33261913},"labels":[],"label_agreement":null},{"id":"W4213076614","doi":"10.1090/ulect/070/09","title":"The Bratteli-Elliott-Krieger theorem","year":2018,"lang":"en","type":"book-chapter","venue":"University lecture series","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Mathematical economics","score_opus":0.005133019122270434,"score_gpt":0.16640854748554756,"score_spread":0.16127552836327713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213076614","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008991543,0.019804144,0.20578085,0.008325087,0.003825271,0.00003874607,0.000499454,0.0005265841,0.7522084],"genre_scores_gemma":[0.3246085,0.03640125,0.116476126,0.0066132424,0.0042058825,0.00023596821,0.0008646699,0.0012916959,0.50930274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999461,0.000096043805,0.000025151938,0.00014691781,0.0001905865,0.00008033742],"domain_scores_gemma":[0.9993513,0.000277516,0.000041719464,0.00012961272,0.00014664468,0.000053247815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085817947,0.0010517922,0.00084252626,0.0019387272,0.0015483099,0.0032522068,0.0011722568,0.0016104747,0.021358903],"category_scores_gemma":[0.003363125,0.0005547273,0.00081551715,0.0021324109,0.0036234532,0.005742994,0.0020554047,0.0046876324,0.013113006],"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.000013483657,0.000009110535,0.00004418571,0.000063037085,0.000005598201,0.000023943894,0.000071789465,0.00033545942,0.00029828612,0.9541403,0.020142352,0.024852466],"study_design_scores_gemma":[0.000005065582,0.0000049551936,0.00007466556,0.00003041228,0.0000054997176,0.0000820201,0.000021132493,0.00063192274,0.00031575083,0.9417106,0.05710815,0.000009849628],"about_ca_topic_score_codex":0.0010249121,"about_ca_topic_score_gemma":0.0012537075,"teacher_disagreement_score":0.021358903,"about_ca_system_score_codex":0.001283844,"about_ca_system_score_gemma":0.0009370704,"threshold_uncertainty_score":0.07145268},"labels":[],"label_agreement":null},{"id":"W4214508519","doi":"10.1002/mma.8141","title":"Delay dynamic equations on isolated time scales and the relevance of one‐periodic coefficients","year":2022,"lang":"en","type":"article","venue":"Mathematical Methods in the Applied Sciences","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":"McMaster University","funders":"","keywords":"Mathematics; Constant (computer programming); Constant coefficients; Nonlinear system; Dynamic equation; Coefficient matrix; Mathematical analysis; Independent equation; Matrix (chemical analysis); Delay differential equation; Differential equation; Applied mathematics; Eigenvalues and eigenvectors; Physics; Computer science","score_opus":0.029405780800841334,"score_gpt":0.33765099249695596,"score_spread":0.30824521169611463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214508519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22461677,0.002427156,0.73521864,0.00085664424,0.00044104672,0.00004547091,0.00014704937,0.00008563926,0.03616159],"genre_scores_gemma":[0.94205785,0.0015627836,0.043480348,0.00015243057,0.00021892512,0.00006106909,0.00006684382,0.00004917233,0.012350676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999062,0.000016007421,0.0000045092875,0.000026291846,0.000030758398,0.000016283835],"domain_scores_gemma":[0.99966085,0.00013503394,0.0000918989,0.00003455842,0.000046811834,0.00003087486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020451353,0.00032829493,0.0003304525,0.0003234513,0.00021693773,0.0005506423,0.0005166708,0.000403768,0.002043847],"category_scores_gemma":[0.0009881081,0.00016370835,0.00030506027,0.00025226586,0.0008264206,0.0010083762,0.00059223786,0.0009439835,0.00019567301],"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.000026109828,0.000023834133,0.00057933124,0.00011581169,0.000019848769,0.00035337583,0.000144832,0.053873736,0.014602523,0.91772,0.0007645241,0.01177609],"study_design_scores_gemma":[0.00002864028,0.000052151383,0.0008381786,0.000035765,0.000020640293,0.00030129947,0.00008685206,0.5465685,0.004962695,0.4404063,0.0066639567,0.000034989916],"about_ca_topic_score_codex":0.0009109636,"about_ca_topic_score_gemma":0.00058303087,"teacher_disagreement_score":0.002043847,"about_ca_system_score_codex":0.0003600087,"about_ca_system_score_gemma":0.00044879876,"threshold_uncertainty_score":0.0068373084},"labels":[],"label_agreement":null},{"id":"W4214875645","doi":"10.5539/jmr.v14n2p1","title":"A Proof of the Sylvester Criterion for Quadratic Forms via Optimality Conditions for Quadratic Functions","year":2022,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Quadratic equation; Quadratic function; Definite quadratic form; Quadratic form (statistics); Isotropic quadratic form; Binary quadratic form; Sylvester's law of inertia; Legendre symbol; Applied mathematics; Sylvester matrix; Quadratic programming; Pure mathematics; Combinatorics; Mathematical analysis; Mathematical optimization; Symmetric matrix; Geometry; Polynomial; Eigenvalues and eigenvectors","score_opus":0.09397238570039,"score_gpt":0.39526022296249524,"score_spread":0.30128783726210523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214875645","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009459161,0.00037745875,0.9554308,0.0008951778,0.0003405892,0.00007450807,0.0002666682,0.0002811243,0.03287452],"genre_scores_gemma":[0.4410905,0.0019841632,0.5126503,0.0019901118,0.0013759844,0.00039951404,0.0007733036,0.00091460923,0.038821504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991385,0.00012607472,0.00005173204,0.00012711422,0.00042390687,0.00013273126],"domain_scores_gemma":[0.9977913,0.00081842,0.0001370706,0.00013583178,0.0009950117,0.00012249757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014380689,0.0013101558,0.0007492797,0.001220536,0.00075140514,0.0011103617,0.00071802357,0.0010202121,0.013708601],"category_scores_gemma":[0.0042217416,0.00045936066,0.0008269306,0.00076165097,0.0017998128,0.002058012,0.001718662,0.003214343,0.0033404122],"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.000024464314,0.000041706186,0.00017796207,0.00013263681,0.000015527496,0.00015028544,0.0001458927,0.009841975,0.009952387,0.9481876,0.0070804493,0.024249164],"study_design_scores_gemma":[0.00003176569,0.00011267437,0.0004464829,0.000048588827,0.000013034984,0.00027405875,0.00006508883,0.05778517,0.008212058,0.9099675,0.023003355,0.000040272334],"about_ca_topic_score_codex":0.00087075727,"about_ca_topic_score_gemma":0.0009378958,"teacher_disagreement_score":0.013708601,"about_ca_system_score_codex":0.00089425815,"about_ca_system_score_gemma":0.0012436718,"threshold_uncertainty_score":0.045859814},"labels":[],"label_agreement":null},{"id":"W4221139439","doi":"10.1103/physrevb.106.024510","title":"Algebraic canonical quantization of lumped superconducting networks","year":2022,"lang":"en","type":"article","venue":"Physical review. B./Physical review. B","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":"Canada First Research Excellence Fund; Eusko Jaurlaritza","keywords":"Symplectic geometry; Quantization (signal processing); Geometric quantization; Mathematics; Constructive; Algebraic number; Hamiltonian (control theory); Algebra over a field; Canonical quantization; Pure mathematics; Topology (electrical circuits); Quantum; Computer science; Algorithm; Mathematical analysis; Quantum mechanics; Physics; Mathematical optimization; Combinatorics","score_opus":0.019539376214288078,"score_gpt":0.3450305982147146,"score_spread":0.3254912220004265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221139439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08543632,0.00047666265,0.87445617,0.00072862057,0.00023940876,0.000077257435,0.00014389663,0.0002476561,0.03819407],"genre_scores_gemma":[0.8048893,0.0009692372,0.18330298,0.00016974045,0.00013883026,0.00013324477,0.0001372067,0.00010832786,0.010151114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973184,0.00009320185,0.00001489122,0.000046467194,0.0000908554,0.000022826553],"domain_scores_gemma":[0.99967587,0.000077817625,0.000035811558,0.000077843826,0.00009767128,0.00003484846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049355015,0.00026688597,0.0003272687,0.00056214404,0.00053191814,0.0012482579,0.00078240054,0.00037859424,0.0040635597],"category_scores_gemma":[0.0013157787,0.00018122654,0.00029192228,0.000422664,0.0016220316,0.0020990097,0.00082172366,0.00078640034,0.0004463696],"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.0000035535168,0.000004030404,0.000028591145,0.000010693658,0.0000016369473,0.000010334239,0.000031586842,0.0055773696,0.00055095815,0.9904503,0.00021651169,0.0031143583],"study_design_scores_gemma":[0.000008524559,0.000013881215,0.00004080667,0.00000998439,0.0000028343761,0.000043654174,0.000039767634,0.13365263,0.0011451184,0.8615597,0.0034735824,0.000009566157],"about_ca_topic_score_codex":0.00037447384,"about_ca_topic_score_gemma":0.0005716504,"teacher_disagreement_score":0.0040635597,"about_ca_system_score_codex":0.00047542425,"about_ca_system_score_gemma":0.00055366504,"threshold_uncertainty_score":0.013593912},"labels":[],"label_agreement":null},{"id":"W4224272980","doi":"10.1016/j.laa.2022.04.009","title":"The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph","year":2022,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Science and Technology, Taiwan; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Lemma (botany); Bifurcation; Eigenvalues and eigenvectors; Combinatorics; Graph; Inverse; Discrete mathematics; Nonlinear system; Geometry","score_opus":0.024091032215272062,"score_gpt":0.2435759500894707,"score_spread":0.21948491787419863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224272980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11304562,0.0014600235,0.81840456,0.005410928,0.00055225205,0.00011477032,0.0002622348,0.00032522585,0.060424436],"genre_scores_gemma":[0.9141745,0.001884539,0.057417016,0.0015476485,0.00090921624,0.0004799243,0.00044563413,0.0003430667,0.022798453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991486,0.00034596145,0.00004556557,0.00014799135,0.00021672355,0.000094996154],"domain_scores_gemma":[0.9924638,0.005869857,0.00041533588,0.00033209607,0.00056639523,0.00035249905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002045904,0.00084625155,0.001181601,0.0022500993,0.001472554,0.002680194,0.001172827,0.001923095,0.008425605],"category_scores_gemma":[0.012227664,0.0005888613,0.0014340592,0.0012369079,0.0032907329,0.0058945767,0.003567957,0.004107777,0.0011821273],"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.000069432404,0.00003567192,0.00045965458,0.00009945914,0.000029680315,0.00016589974,0.00028381654,0.006758901,0.0034023782,0.97730416,0.0033331832,0.008057846],"study_design_scores_gemma":[0.00002661491,0.000029647477,0.0002726472,0.00002576648,0.000014151825,0.00012116796,0.000089413035,0.059815176,0.00089428003,0.9367334,0.0019561069,0.000021728694],"about_ca_topic_score_codex":0.0005653277,"about_ca_topic_score_gemma":0.00045235557,"teacher_disagreement_score":0.008425605,"about_ca_system_score_codex":0.0008783148,"about_ca_system_score_gemma":0.00062248413,"threshold_uncertainty_score":0.02818644},"labels":[],"label_agreement":null},{"id":"W4226026780","doi":"10.1007/s11075-022-01304-z","title":"Approximating the diagonal of a Hessian: which sample set of points should be used","year":2022,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Hessian matrix; Mathematics; Diagonal; Diagonal matrix; Matrix (chemical analysis); Main diagonal; Simplex; Combinatorics; Sample (material); Band matrix; Set (abstract data type); Block matrix; Applied mathematics; Mathematical analysis; Symmetric matrix; Square matrix; Geometry; Eigenvalues and eigenvectors; Computer science","score_opus":0.04604667643643701,"score_gpt":0.2855975527531398,"score_spread":0.2395508763167028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226026780","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048161596,0.0004334477,0.9476625,0.0009813104,0.00009212235,0.00012281217,0.0003129916,0.00070775236,0.0015254086],"genre_scores_gemma":[0.35754436,0.00054501684,0.6381,0.00029964582,0.000097196316,0.0002108701,0.0008694871,0.00051598897,0.001817404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991381,0.00024733547,0.00005199084,0.00018760333,0.0002864901,0.00008840634],"domain_scores_gemma":[0.99700433,0.0011364161,0.00019580504,0.00047237528,0.0010154458,0.00017566468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017994463,0.00076477503,0.0013211784,0.0010466374,0.000737073,0.0013400358,0.0016955611,0.0023358879,0.004576796],"category_scores_gemma":[0.02084702,0.0007907607,0.0006184622,0.0008878722,0.0011329952,0.0029109477,0.0009823294,0.0016631902,0.0018879961],"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.0012473096,0.000524229,0.013074598,0.0010312838,0.00019963969,0.00019617293,0.0003597123,0.3363677,0.02920771,0.030323135,0.016091159,0.5713774],"study_design_scores_gemma":[0.0001236757,0.00012552916,0.0024495719,0.00021325491,0.000049337057,0.00011698341,0.00016658485,0.9562079,0.0136252185,0.024347639,0.0025388126,0.000035597204],"about_ca_topic_score_codex":0.0062532187,"about_ca_topic_score_gemma":0.0067136316,"teacher_disagreement_score":0.0062532187,"about_ca_system_score_codex":0.0006914051,"about_ca_system_score_gemma":0.0015826765,"threshold_uncertainty_score":0.015310943},"labels":[],"label_agreement":null},{"id":"W4226475036","doi":"10.1007/978-3-030-99372-6_8","title":"A Hybrid Synchronization Mechanism for Parallel Sparse Triangular Solve","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Synchronization (alternating current); sync; Data synchronization; Set (abstract data type); Parallel computing; Sparse matrix; Algorithm; Theoretical computer science; Wireless sensor network","score_opus":0.015603290893889043,"score_gpt":0.23415461465705276,"score_spread":0.21855132376316372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226475036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01185306,0.00016678192,0.97533685,0.000106561405,0.00017579463,0.000086140906,0.00013605517,0.00565198,0.006486813],"genre_scores_gemma":[0.3288097,0.00023825587,0.64564836,0.0003261812,0.00026172918,0.00051237753,0.0006969458,0.0015277583,0.02197877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917966,0.00014881755,0.00006183243,0.00016486508,0.0003318177,0.00011303284],"domain_scores_gemma":[0.99853694,0.0003184178,0.00009732221,0.0007003698,0.00026320913,0.000083682025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000834854,0.00076239055,0.0009701623,0.0009706458,0.0010096229,0.0013844663,0.0033986773,0.00092409016,0.015924944],"category_scores_gemma":[0.002262343,0.0006931429,0.0005413804,0.0019415619,0.0007634203,0.0022135528,0.003313558,0.0012815173,0.0032343655],"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.0027741306,0.00048036716,0.001107761,0.00042059665,0.00022749939,0.000323196,0.00048232087,0.0903119,0.10930677,0.18879241,0.03776753,0.56800544],"study_design_scores_gemma":[0.00036436698,0.0003485665,0.0003553114,0.00003492225,0.00007807102,0.00022095063,0.00008873399,0.8590968,0.048342124,0.064439304,0.026558435,0.00007239288],"about_ca_topic_score_codex":0.0013367726,"about_ca_topic_score_gemma":0.0019692904,"teacher_disagreement_score":0.015924944,"about_ca_system_score_codex":0.0006140837,"about_ca_system_score_gemma":0.00084002526,"threshold_uncertainty_score":0.053274214},"labels":[],"label_agreement":null},{"id":"W4229650096","doi":"10.1007/978-1-4419-9467-7","title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","year":2011,"lang":"en","type":"book","venue":"CMS books in mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2897,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Hilbert space; Constructive; Mathematics; Monotone polygon; Convex analysis; Regular polygon; Exposition (narrative); Pure mathematics; Subderivative; Operator (biology); Point (geometry); Convex optimization; Algebra over a field; Computer science; Geometry","score_opus":0.015107297105865615,"score_gpt":0.23455081602763955,"score_spread":0.21944351892177394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229650096","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043107113,0.09032111,0.1536031,0.0054815547,0.0031260282,0.0000549137,0.0007170722,0.00051461253,0.7418709],"genre_scores_gemma":[0.076180406,0.08849159,0.10064572,0.002406008,0.007388455,0.00034156814,0.0013324876,0.0008293468,0.72238445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997731,0.000032249416,0.000007855226,0.000026993855,0.00014676437,0.00001311962],"domain_scores_gemma":[0.9997038,0.00016346981,0.0000145328095,0.000024441522,0.00007359902,0.000019996818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029027098,0.0009608078,0.00088733854,0.0011791234,0.0005321453,0.002327117,0.0006468003,0.00064935896,0.020861285],"category_scores_gemma":[0.00094124285,0.00042164323,0.0004735484,0.0023233448,0.001186579,0.0024919156,0.0005703154,0.0024148284,0.00658515],"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.00001212204,0.000023381739,0.000055335313,0.0003030077,0.000016235941,0.00003831408,0.000112632726,0.0020924795,0.0011963182,0.7755485,0.14105117,0.07955053],"study_design_scores_gemma":[0.000009883696,0.000017805165,0.00042883717,0.00012791362,0.00001113281,0.00014299194,0.00005317729,0.005520209,0.00046050068,0.71389526,0.27931446,0.000017868224],"about_ca_topic_score_codex":0.0009093791,"about_ca_topic_score_gemma":0.0016691588,"teacher_disagreement_score":0.020861285,"about_ca_system_score_codex":0.0009496292,"about_ca_system_score_gemma":0.00092024525,"threshold_uncertainty_score":0.06978798},"labels":[],"label_agreement":null},{"id":"W4230443182","doi":"10.1109/pica.1989.39017","title":"Application of sparse eigenvalue techniques to the small signal stability analysis of large power systems","year":2003,"lang":"en","type":"article","venue":"","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":"University of Toronto","funders":"Shanghai Educational Development Foundation","keywords":"Eigenvalues and eigenvectors; Stability (learning theory); Complex plane; Electric power system; Computer science; SIGNAL (programming language); Power (physics); Algorithm; Point (geometry); Power iteration; Mathematics; Iterative method; Machine learning","score_opus":0.016119851100921068,"score_gpt":0.25078905468163865,"score_spread":0.23466920358071758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230443182","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047901263,0.00010351345,0.99388003,0.000077134544,0.00002221941,0.000011123769,0.0000071401873,0.00011178477,0.0009969593],"genre_scores_gemma":[0.23683703,0.00063036266,0.7583158,0.00007293137,0.00015001667,0.00010137345,0.000060432718,0.000112316804,0.0037196826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997298,0.000100531026,0.000011455371,0.00002470272,0.000121084784,0.000012441284],"domain_scores_gemma":[0.9990916,0.00057426945,0.00007732693,0.00010145935,0.00013370838,0.000021572278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004448648,0.00060858525,0.00042011283,0.00081518694,0.00031516157,0.0004780434,0.00032724437,0.00041714733,0.0017543524],"category_scores_gemma":[0.0020572923,0.0002793121,0.00040240408,0.0005585997,0.00066608784,0.0007931881,0.0006196009,0.000577935,0.00050668715],"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.00012049886,0.000088858505,0.0008612745,0.00024141614,0.00010851523,0.00027893373,0.00039667092,0.5183403,0.04196012,0.098284915,0.0037707912,0.33554775],"study_design_scores_gemma":[0.000011905606,0.00005374372,0.00017496196,0.000009781187,0.0000071580016,0.000106451334,0.000028034492,0.9576124,0.0055640694,0.033894375,0.0025247675,0.000012373615],"about_ca_topic_score_codex":0.00047496991,"about_ca_topic_score_gemma":0.0007457528,"teacher_disagreement_score":0.0017543524,"about_ca_system_score_codex":0.00017375458,"about_ca_system_score_gemma":0.00027492188,"threshold_uncertainty_score":0.005868852},"labels":[],"label_agreement":null},{"id":"W4230536645","doi":"10.1007/978-0-387-68276-1_9","title":"Matrix Theory","year":2010,"lang":"en","type":"book-chapter","venue":"Springer series in statistics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Majorization; Mathematics; Schur's theorem; Pure mathematics; Eigenvalues and eigenvectors; Hermitian matrix; Context (archaeology); Matrix (chemical analysis); Matrix function; Algebra over a field; Symmetric matrix; Complex Hadamard matrix; Block matrix; Diagonal; Hadamard product; Schur product theorem; Variety (cybernetics); Combinatorics; Hadamard transform; Schur decomposition; Schur complement; Hadamard matrix; Mathematical analysis; Physics","score_opus":0.010923523756909664,"score_gpt":0.25121356546235374,"score_spread":0.24029004170544407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230536645","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042012506,0.02916888,0.37139782,0.004041406,0.005854027,0.00006188155,0.0010779178,0.0011311633,0.58306575],"genre_scores_gemma":[0.12569033,0.026445782,0.07817778,0.002308844,0.0072365617,0.00026531442,0.0014348015,0.0010569609,0.7573835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963903,0.000071343195,0.00001335953,0.000073487514,0.00017906418,0.000023663615],"domain_scores_gemma":[0.99969697,0.000091172165,0.000019229337,0.00007744723,0.00009287121,0.000022404876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029623008,0.0011142807,0.0011355354,0.0018297656,0.00068508973,0.0023337933,0.00070762273,0.000947359,0.035216175],"category_scores_gemma":[0.001162189,0.00042484634,0.00045712566,0.0020563428,0.0013123032,0.002110439,0.00093450746,0.0019648091,0.018513229],"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.000004738623,0.000011810117,0.000044238193,0.00009932647,0.000009860421,0.000028390337,0.00006525579,0.0011955692,0.00054634246,0.8647809,0.07407656,0.05913707],"study_design_scores_gemma":[0.000003996423,0.000010891599,0.00012141404,0.000040855168,0.000008027256,0.00014542534,0.00002517674,0.0060737664,0.00039555988,0.8312539,0.16190988,0.000011050506],"about_ca_topic_score_codex":0.000689285,"about_ca_topic_score_gemma":0.0009253677,"teacher_disagreement_score":0.035216175,"about_ca_system_score_codex":0.0006629545,"about_ca_system_score_gemma":0.00051228376,"threshold_uncertainty_score":0.11780989},"labels":[],"label_agreement":null},{"id":"W4230628202","doi":"10.1007/978-1-4939-7131-2_100272","title":"Determinant of a Matrix","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Matrix (chemical analysis); Computer science; Mathematics; Materials science; Composite material","score_opus":0.014133393465733389,"score_gpt":0.24824597342927796,"score_spread":0.23411257996354456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230628202","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018576257,0.005909766,0.35140404,0.0028970868,0.004805429,0.00006685989,0.0005986264,0.0008361361,0.6149058],"genre_scores_gemma":[0.3960486,0.0107962005,0.09972999,0.0016289043,0.0051017595,0.00015401778,0.00091900263,0.0012418029,0.48437977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996762,0.000054948712,0.000011531307,0.0000740785,0.00015939608,0.000023730916],"domain_scores_gemma":[0.9995943,0.00014258988,0.000022540198,0.00006571597,0.00013824702,0.0000366867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025391756,0.0006074839,0.00042981424,0.0011788101,0.0004557195,0.0019356488,0.00037359862,0.0005648338,0.016490674],"category_scores_gemma":[0.0013214885,0.00026371988,0.00033257986,0.00086616457,0.0012523112,0.0013677661,0.0008733922,0.0014611754,0.0057365554],"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.00000973793,0.0000137938605,0.000085540814,0.000075533426,0.000008479475,0.00005425645,0.00012757887,0.0015364614,0.0021205624,0.92164934,0.029262902,0.045055732],"study_design_scores_gemma":[0.0000055263936,0.000024768096,0.0002559946,0.00003862258,0.000008304807,0.0003109719,0.0000614264,0.007426764,0.0017171223,0.8382058,0.15192574,0.000018963847],"about_ca_topic_score_codex":0.0004865498,"about_ca_topic_score_gemma":0.00048847764,"teacher_disagreement_score":0.016490674,"about_ca_system_score_codex":0.00049199286,"about_ca_system_score_gemma":0.00054245116,"threshold_uncertainty_score":0.05516678},"labels":[],"label_agreement":null},{"id":"W4231198179","doi":"10.1007/978-1-4939-7131-2_100698","title":"Multilayered Network","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Materials science; Computer science","score_opus":0.018123467384276976,"score_gpt":0.2271012820667791,"score_spread":0.20897781468250212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231198179","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072970907,0.008928743,0.7386692,0.0030206037,0.002050064,0.00004849371,0.00089098257,0.0019608494,0.23713405],"genre_scores_gemma":[0.13040133,0.016977884,0.28849655,0.0011044146,0.001680214,0.00018277735,0.0024297587,0.00092005363,0.557807],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998847,0.000015719945,0.0000055059245,0.00003519733,0.00004701499,0.0000118815515],"domain_scores_gemma":[0.9998292,0.00005182856,0.0000104826495,0.00003360288,0.000058719874,0.000016132683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021497707,0.00061361253,0.00035273173,0.00060586777,0.0003103583,0.0010185868,0.00058515277,0.00058685604,0.02196099],"category_scores_gemma":[0.00089334854,0.00025494734,0.00027547262,0.00069002504,0.0003575815,0.0019796065,0.0008644653,0.0011087038,0.009455193],"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.000050145274,0.00004070182,0.00018205367,0.00033162787,0.000045495017,0.00007848092,0.000066593,0.035156816,0.0053719026,0.25306958,0.12090041,0.5847061],"study_design_scores_gemma":[0.000008570254,0.00003975132,0.00046841605,0.00019243888,0.00005419533,0.00024036663,0.000041696665,0.14745943,0.0058683213,0.4109194,0.43466732,0.00004006523],"about_ca_topic_score_codex":0.0009668865,"about_ca_topic_score_gemma":0.0018009354,"teacher_disagreement_score":0.02196099,"about_ca_system_score_codex":0.00051901065,"about_ca_system_score_gemma":0.00040514584,"threshold_uncertainty_score":0.0734669},"labels":[],"label_agreement":null},{"id":"W4232180178","doi":"10.1007/978-1-4939-7131-2_100707","title":"Multiplication of Vector and Matrix","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Multiplication (music); Matrix multiplication; Vector (molecular biology); Matrix (chemical analysis); Arithmetic; Mathematics; Computer science; Algebra over a field; Pure mathematics; Combinatorics; Physics; Biology; Materials science; Genetics","score_opus":0.013683590057510369,"score_gpt":0.24431473161518377,"score_spread":0.2306311415576734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232180178","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030789636,0.02492354,0.4166293,0.0025542623,0.011654395,0.000086864085,0.0005934623,0.0016834363,0.53879577],"genre_scores_gemma":[0.06855232,0.018279308,0.19057511,0.0018530409,0.0068371627,0.0002459026,0.0011561636,0.001512578,0.71098846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920374,0.00015721851,0.00004476691,0.00020372188,0.00034152446,0.00004902688],"domain_scores_gemma":[0.9996099,0.00013361721,0.000022688282,0.00008848073,0.00012181589,0.000023600272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004906845,0.0015390663,0.00071897125,0.0013025823,0.0007171606,0.0028925487,0.0009812803,0.00077544904,0.04163448],"category_scores_gemma":[0.001783887,0.00044408414,0.0005325261,0.0020864953,0.0021131327,0.0037523573,0.0014760843,0.001809434,0.023666188],"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.000020818039,0.000010995431,0.000053034633,0.00022469398,0.00001053576,0.000049200244,0.00017453452,0.000630591,0.0015770668,0.76849896,0.08852655,0.14022307],"study_design_scores_gemma":[0.0000063980815,0.000030131987,0.000099925936,0.00008277659,0.000008280672,0.00029027034,0.0000472518,0.002491191,0.0014324561,0.32821625,0.6672782,0.00001696302],"about_ca_topic_score_codex":0.0006455978,"about_ca_topic_score_gemma":0.00089399784,"teacher_disagreement_score":0.04163448,"about_ca_system_score_codex":0.0007976335,"about_ca_system_score_gemma":0.0007172454,"threshold_uncertainty_score":0.13928115},"labels":[],"label_agreement":null},{"id":"W4232539515","doi":"10.23952/jnva.5.2021.2.03","title":"A parameterized three-operator splitting algorithm and its expansion","year":2021,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities","keywords":"Parameterized complexity; Algorithm; Operator (biology); Operator splitting; Computer science; Mathematics; Applied mathematics","score_opus":0.013221342630982518,"score_gpt":0.2530746178280767,"score_spread":0.2398532751970942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232539515","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00403359,0.000037915444,0.9951035,0.000034318815,0.000012615535,0.000019225958,0.000011140244,0.000072398,0.0006753598],"genre_scores_gemma":[0.13063867,0.0001258106,0.8664181,0.000073860145,0.000029128727,0.00017872684,0.00012760113,0.00012651278,0.0022815582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995121,0.00013010482,0.000034456203,0.000103702296,0.00016706013,0.000052687552],"domain_scores_gemma":[0.9994536,0.0001597704,0.000042249998,0.00008346979,0.0002105826,0.000050366412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085603894,0.00069150596,0.00069589104,0.0005935474,0.0005024078,0.0006358114,0.0014757224,0.0010110885,0.0028231659],"category_scores_gemma":[0.0018356644,0.00028562194,0.0007295906,0.0008401037,0.0007691794,0.0014507904,0.0014523546,0.0012981807,0.00063621154],"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.00020873133,0.00011731948,0.001015436,0.00016278088,0.00005710458,0.00023038422,0.00029434208,0.44728565,0.034120794,0.1939067,0.0034391293,0.31916165],"study_design_scores_gemma":[0.000016450977,0.000028324777,0.000054752927,0.000004743089,0.0000043923837,0.000050387876,0.000012987051,0.98344135,0.001949302,0.013160349,0.001264629,0.000012383766],"about_ca_topic_score_codex":0.002462016,"about_ca_topic_score_gemma":0.0017300401,"teacher_disagreement_score":0.0028231659,"about_ca_system_score_codex":0.0005475265,"about_ca_system_score_gemma":0.0012361524,"threshold_uncertainty_score":0.009444475},"labels":[],"label_agreement":null},{"id":"W4232786831","doi":"10.1002/3527607773.ch10","title":"Numerical Methods","year":2005,"lang":"en","type":"other","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Overdetermined system; Mathematics; Conjugate gradient method; Underdetermined system; System of linear equations; QR decomposition; Applied mathematics; Cholesky decomposition; Preconditioner; Polynomial; Iterative method; Eigenvalues and eigenvectors; Mathematical analysis; Algorithm","score_opus":0.014374009316470522,"score_gpt":0.32507325429450706,"score_spread":0.3106992449780365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232786831","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017519908,0.011718386,0.6305282,0.0038606613,0.008490604,0.0007988981,0.004364788,0.0051307078,0.33335572],"genre_scores_gemma":[0.05110762,0.01684734,0.5731237,0.0031151543,0.002470931,0.0023374634,0.0073941606,0.0032841705,0.34031942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99767464,0.0005085769,0.00018314586,0.00036762786,0.0011498379,0.00011618721],"domain_scores_gemma":[0.997962,0.0005628349,0.000111461566,0.0005127662,0.00079713506,0.000053687312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001984282,0.0014914334,0.0015542709,0.0020937677,0.0013471787,0.0056865355,0.0029643732,0.0026275057,0.11118208],"category_scores_gemma":[0.007677288,0.00069998094,0.0015676746,0.0024543947,0.0014669201,0.004484017,0.0037926985,0.0023384155,0.048669957],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006278051,0.000059568894,0.00058950885,0.0008843746,0.00006779141,0.0001071078,0.00023862964,0.02038392,0.0011886337,0.48537186,0.16765969,0.32338607],"study_design_scores_gemma":[0.000035350058,0.000038793947,0.000345333,0.0005500956,0.000022462924,0.00014312434,0.00015379826,0.030277492,0.001267549,0.13449177,0.83262587,0.000048442933],"about_ca_topic_score_codex":0.002266236,"about_ca_topic_score_gemma":0.001871636,"teacher_disagreement_score":0.11118208,"about_ca_system_score_codex":0.0014738791,"about_ca_system_score_gemma":0.0028160803,"threshold_uncertainty_score":0.3719411},"labels":[],"label_agreement":null},{"id":"W4232978751","doi":"10.1109/intmag.1997.597694","title":"Universal Matrices For High Order Finite Elements In Nonlinear Magnetic Field Problems","year":2005,"lang":"en","type":"article","venue":"1997 IEEE International Magnetics Conference (INTERMAG'97)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Nonlinear system; Finite field; Order (exchange); Field (mathematics); Finite element method; Computer science; Applied mathematics; Mathematics; Physics; Pure mathematics; Engineering; Discrete mathematics; Structural engineering; Quantum mechanics","score_opus":0.021489396350904577,"score_gpt":0.26136290020952535,"score_spread":0.23987350385862077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232978751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016883457,0.00060741126,0.9759439,0.00030530154,0.000112258145,0.000035850408,0.000036481782,0.00015306222,0.00592223],"genre_scores_gemma":[0.5380518,0.0013784183,0.44363767,0.00032874255,0.0002860693,0.00030353814,0.00020564623,0.00038758013,0.015420538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993612,0.00028280885,0.000039168917,0.00006489349,0.00019988125,0.000051972158],"domain_scores_gemma":[0.9975073,0.0014507173,0.00021846607,0.000252425,0.00035653063,0.00021467044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015663853,0.0007453543,0.0007506505,0.0013697618,0.00078474596,0.001318673,0.0014590918,0.0011646781,0.0037225715],"category_scores_gemma":[0.008395037,0.00054885604,0.0004887592,0.0009240025,0.0023380304,0.0024988472,0.0024323333,0.0021395558,0.00063560513],"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.000037654674,0.000040844378,0.0001791048,0.00012916623,0.000014090235,0.00005254425,0.0002409367,0.03635453,0.0019495216,0.92881775,0.0013803338,0.030803572],"study_design_scores_gemma":[0.000009563189,0.000016833807,0.00005034079,0.00002997032,0.0000043548603,0.000033508335,0.00006839736,0.22568496,0.0007670379,0.7704776,0.002846058,0.0000114086515],"about_ca_topic_score_codex":0.001206226,"about_ca_topic_score_gemma":0.0024001366,"teacher_disagreement_score":0.0037225715,"about_ca_system_score_codex":0.00076808763,"about_ca_system_score_gemma":0.00063223543,"threshold_uncertainty_score":0.012453258},"labels":[],"label_agreement":null},{"id":"W4234469903","doi":"10.1109/spects.2015.7285288","title":"Approximate Mean Value Analysis for multi-core systems","year":2015,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"McMaster University","funders":"","keywords":"Computer science; Core (optical fiber); Multi-core processor; Computer performance; Stability (learning theory); Distributed computing; Algorithm; Parallel computing; Machine learning","score_opus":0.09166105585291608,"score_gpt":0.3048508274942056,"score_spread":0.21318977164128955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234469903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039396025,0.00018928367,0.994928,0.000082719846,0.0000189367,0.000013288736,0.000021933505,0.00012550238,0.00068071],"genre_scores_gemma":[0.5933799,0.001069192,0.39961383,0.0002695404,0.00015438818,0.00028957715,0.00028468028,0.00033880337,0.004599961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989992,0.00038780304,0.000038839502,0.000121321675,0.00035097287,0.00010190804],"domain_scores_gemma":[0.9947937,0.0038042546,0.00030346852,0.00032287856,0.0006757103,0.00009994549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024165716,0.0007965656,0.0008868859,0.0010671288,0.0005450953,0.001058748,0.0014644314,0.0009949185,0.00247172],"category_scores_gemma":[0.011037477,0.0004778896,0.00091881363,0.0009608444,0.0010060766,0.001786636,0.0009600039,0.0016427705,0.0004372771],"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.000027308319,0.000021398373,0.0006371596,0.00006495459,0.000027660328,0.00003858244,0.000045995348,0.9293941,0.0015190695,0.050967503,0.0007136115,0.016542733],"study_design_scores_gemma":[6.8214354e-7,0.0000021995852,0.000026446463,0.0000016366894,8.3113144e-7,0.000003061768,0.0000020784855,0.99377006,0.00009798185,0.0059724227,0.00012113287,0.0000013934783],"about_ca_topic_score_codex":0.005508177,"about_ca_topic_score_gemma":0.002888647,"teacher_disagreement_score":0.005508177,"about_ca_system_score_codex":0.0012866411,"about_ca_system_score_gemma":0.0012110636,"threshold_uncertainty_score":0.0127801895},"labels":[],"label_agreement":null},{"id":"W4234770754","doi":"10.14232/actasm-013-821-3","title":"Hiroshima’s theorem and matrix norm inequalities","year":2015,"lang":"en","type":"article","venue":"Acta Scientiarum Mathematicarum","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":20,"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 Waterloo; University of Victoria","funders":"","keywords":"Mathematics; Norm (philosophy); Inequality; Pure mathematics; Calculus (dental); Mathematical analysis","score_opus":0.02786917884636361,"score_gpt":0.27145868929164957,"score_spread":0.24358951044528596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234770754","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0510561,0.016580869,0.7404333,0.022602675,0.0030653374,0.000050072984,0.0005128598,0.0001380695,0.1655607],"genre_scores_gemma":[0.73830694,0.018170947,0.1526513,0.0047647855,0.005452769,0.00030604211,0.0005616573,0.00023822337,0.07954736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993474,0.0002359987,0.000028896986,0.00014988866,0.00016830092,0.00006942162],"domain_scores_gemma":[0.99817395,0.0011629538,0.00011700702,0.00014061412,0.00031481695,0.00009061473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018403366,0.0009883435,0.0009965426,0.0016109125,0.0010792998,0.0017175538,0.0014677717,0.001266953,0.0068664597],"category_scores_gemma":[0.005882089,0.00038757676,0.0010673623,0.0018367053,0.0030976508,0.005274074,0.0022972748,0.0050386824,0.0007150222],"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.000036987338,0.000014816121,0.00012288614,0.00009537153,0.000023747732,0.00006587433,0.00014731157,0.0019259105,0.00064075575,0.9846976,0.0027635924,0.0094651785],"study_design_scores_gemma":[0.00001431242,0.00001315239,0.00020734845,0.000015099781,0.000012636521,0.0000549117,0.000044210738,0.009880403,0.00024084245,0.98170805,0.0077980496,0.000011105206],"about_ca_topic_score_codex":0.00268572,"about_ca_topic_score_gemma":0.0019052995,"teacher_disagreement_score":0.0068664597,"about_ca_system_score_codex":0.0011693286,"about_ca_system_score_gemma":0.00077570765,"threshold_uncertainty_score":0.022970557},"labels":[],"label_agreement":null},{"id":"W4235922633","doi":"10.1090/conm/638/12810","title":"A survey on preservers of spectra and local spectra","year":2015,"lang":"en","type":"other","venue":"Contemporary mathematics - American Mathematical Society","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Université Laval","funders":"","keywords":"Mathematics; Spectral line; Physics; Quantum mechanics","score_opus":0.03720240955803057,"score_gpt":0.27567784220097746,"score_spread":0.2384754326429469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235922633","genre_codex":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12343527,0.39655194,0.19429745,0.0066435756,0.0010469974,0.000077697296,0.00081978197,0.0005135515,0.27661377],"genre_scores_gemma":[0.5280676,0.37128976,0.054858346,0.0018199635,0.0051509924,0.00012695242,0.0015375278,0.00038219898,0.036766727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934214,0.00014330907,0.000051045234,0.0001737324,0.00022005293,0.000069721544],"domain_scores_gemma":[0.9988004,0.00070795795,0.00010372397,0.00014824202,0.00014196085,0.00009774996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011260401,0.00060041965,0.00083302986,0.003889635,0.0010823223,0.0024950076,0.000644299,0.0007200405,0.0067455773],"category_scores_gemma":[0.0018968704,0.00041979493,0.00046956431,0.005179563,0.0020270564,0.008508253,0.0016727973,0.0019324485,0.0012758718],"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.000028286948,0.000038207614,0.0010894696,0.00077200384,0.000019762692,0.00013622182,0.0006434522,0.00074830634,0.0012744886,0.8973352,0.005951573,0.09196309],"study_design_scores_gemma":[0.000008535387,0.00008368059,0.0016749963,0.00033696037,0.000023211016,0.0012866573,0.0004958327,0.002006548,0.0012971617,0.82552356,0.16722794,0.000035002195],"about_ca_topic_score_codex":0.0004196119,"about_ca_topic_score_gemma":0.00030557055,"teacher_disagreement_score":0.0067455773,"about_ca_system_score_codex":0.00079614134,"about_ca_system_score_gemma":0.0006311505,"threshold_uncertainty_score":0.0225662},"labels":[],"label_agreement":null},{"id":"W4236363547","doi":"10.1080/02331930108844541","title":"Application of topological degree theory to semi-definite complementarity problem","year":2001,"lang":"en","type":"article","venue":"Optimization","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Complementarity theory; Degree (music); Complementarity (molecular biology); Existential quantification; Positive-definite matrix; Mixed complementarity problem; Topology (electrical circuits); Discrete mathematics; Combinatorics; Eigenvalues and eigenvectors; Nonlinear system","score_opus":0.026746375495248637,"score_gpt":0.26535763986386823,"score_spread":0.2386112643686196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236363547","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1509211,0.0015268101,0.80819046,0.0016788195,0.00011932962,0.00003400728,0.000062612526,0.000063050786,0.037403822],"genre_scores_gemma":[0.9523718,0.0011523159,0.04151271,0.00009096359,0.00016459744,0.000051967436,0.00005561654,0.000023238925,0.004576821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960405,0.00016300175,0.000016157823,0.000046998524,0.00011581649,0.000053911313],"domain_scores_gemma":[0.99878913,0.0007144547,0.00014319195,0.000067883746,0.00015758415,0.00012770854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078796403,0.00036475484,0.00044185587,0.0011839422,0.00077553955,0.0012950815,0.00047664714,0.00054231804,0.0014809734],"category_scores_gemma":[0.002693677,0.00017866628,0.00054958364,0.0007871497,0.0020885644,0.0019468812,0.0020336804,0.0008896548,0.00011229898],"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.000013293954,0.0000069279804,0.00024751457,0.000038669004,0.00001048034,0.00006153309,0.000091489346,0.023452867,0.00099946,0.9694697,0.0002900502,0.0053180717],"study_design_scores_gemma":[0.0000069513226,0.000029605355,0.00023325755,0.000014032459,0.0000063137877,0.00009079278,0.00007976206,0.1834698,0.00056469947,0.8131864,0.0023062741,0.000012138708],"about_ca_topic_score_codex":0.00064627966,"about_ca_topic_score_gemma":0.00047986044,"teacher_disagreement_score":0.0014809734,"about_ca_system_score_codex":0.0008519925,"about_ca_system_score_gemma":0.0005039051,"threshold_uncertainty_score":0.0061816573},"labels":[],"label_agreement":null},{"id":"W4236713235","doi":"10.1142/9789814656054_0003","title":"Linear Equations in Infinite Matrices","year":2015,"lang":"en","type":"book-chapter","venue":"WORLD SCIENTIFIC eBooks","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Applied mathematics; Mathematical analysis","score_opus":0.05452539813702259,"score_gpt":0.273197193182593,"score_spread":0.2186717950455704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236713235","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008186901,0.018728428,0.39813393,0.004952348,0.00404952,0.000044955137,0.00052687334,0.0007113174,0.5646657],"genre_scores_gemma":[0.12101959,0.026756568,0.09238139,0.0018469723,0.0051848176,0.00021852982,0.0011677188,0.0010455709,0.75037885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996629,0.000076460405,0.000017386235,0.000040519073,0.00017994632,0.000022849697],"domain_scores_gemma":[0.9997259,0.00013647192,0.000019631247,0.000035081423,0.00006514471,0.00001772612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034951876,0.0013176699,0.0006939552,0.0009118784,0.0005135373,0.0016795509,0.0006920245,0.00072091055,0.019571193],"category_scores_gemma":[0.0013279414,0.0004915496,0.00058319286,0.0014980214,0.0014436494,0.0023747864,0.0012016515,0.0025353911,0.007356934],"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.000005355578,0.000017540664,0.000035177396,0.00012348469,0.000008945354,0.00002992008,0.00014476184,0.004408413,0.00071665214,0.9095012,0.03898977,0.046018712],"study_design_scores_gemma":[0.000008438506,0.0000114177865,0.00008081092,0.00008761826,0.0000069462117,0.00007581716,0.000044524557,0.013906962,0.0007006794,0.86235535,0.12270522,0.000016193379],"about_ca_topic_score_codex":0.0011120802,"about_ca_topic_score_gemma":0.0013517097,"teacher_disagreement_score":0.019571193,"about_ca_system_score_codex":0.000826301,"about_ca_system_score_gemma":0.0007076596,"threshold_uncertainty_score":0.065472126},"labels":[],"label_agreement":null},{"id":"W4236832359","doi":"10.1007/978-1-0716-0843-2_8","title":"Minimax Methods","year":2021,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Minimax; Mathematical optimization; Mathematics; Computer science; Mathematical economics","score_opus":0.03036882817616554,"score_gpt":0.31722828217359994,"score_spread":0.2868594539974344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236832359","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001467046,0.010990234,0.7091781,0.0017970749,0.0020635992,0.00007405257,0.0006350713,0.0012651798,0.2725296],"genre_scores_gemma":[0.0411785,0.010602973,0.31228256,0.0018410871,0.0019799215,0.00058237434,0.0013482289,0.0034247255,0.6267597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993555,0.00019540115,0.000024716372,0.000116069285,0.00027173868,0.000036594713],"domain_scores_gemma":[0.99939084,0.00031820234,0.000027479495,0.00013194636,0.00009690186,0.000034655706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010161869,0.0015764319,0.0019876077,0.00109984,0.0007542626,0.0021028076,0.0016817629,0.0017399323,0.074406825],"category_scores_gemma":[0.0035927559,0.0006854205,0.0007556411,0.0017237869,0.001114055,0.0019394711,0.00210153,0.003707385,0.027849864],"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.000051009625,0.00006967908,0.000081962615,0.0004134876,0.000052392326,0.000031920095,0.000066108885,0.01508403,0.0013330295,0.51763433,0.16991538,0.29526672],"study_design_scores_gemma":[0.000044104032,0.000056627894,0.00023496537,0.00023673756,0.00003359968,0.00017654404,0.000033829736,0.091092914,0.0015589515,0.61979717,0.2866968,0.00003786601],"about_ca_topic_score_codex":0.0005176276,"about_ca_topic_score_gemma":0.0009069938,"teacher_disagreement_score":0.074406825,"about_ca_system_score_codex":0.00055446033,"about_ca_system_score_gemma":0.0006885769,"threshold_uncertainty_score":0.24891567},"labels":[],"label_agreement":null},{"id":"W4236909416","doi":"10.1109/.2001.980511","title":"Multiobjective H/sup 2//H/sup ∞/ by Banach space operator theory","year":2002,"lang":"en","type":"article","venue":"Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Ottawa","funders":"","keywords":"Banach space; Finite-rank operator; Mathematics; Compact operator; Operator space; Pseudo-monotone operator; Operator (biology); Strictly singular operator; Multiplication operator; C0-semigroup; Duality (order theory); Norm (philosophy); Approximation property; Discrete mathematics; Shift operator; Pure mathematics; Combinatorics; Hilbert space; Computer science","score_opus":0.012806805956972487,"score_gpt":0.2236753620275354,"score_spread":0.21086855607056293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236909416","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010792798,0.0007921863,0.98181045,0.00015916,0.00003907681,0.00003693806,0.000026048525,0.00003947749,0.0063038096],"genre_scores_gemma":[0.5323945,0.0017754489,0.45294324,0.00019459327,0.00015001152,0.00039481441,0.000119265766,0.00011228177,0.011915719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995011,0.00022662127,0.00002178696,0.00006612852,0.00013930848,0.000044988905],"domain_scores_gemma":[0.9996753,0.00017532415,0.000048030848,0.000018398685,0.000060043145,0.000022987373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001365827,0.001045603,0.0007047219,0.0005966756,0.00028783455,0.0011329293,0.00064929406,0.0005637081,0.0016379943],"category_scores_gemma":[0.0013872742,0.0003487063,0.0009483701,0.0007129292,0.0010400722,0.0013301242,0.0015984046,0.0012100259,0.0002737736],"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.000085729924,0.00008714559,0.0004812355,0.00034681932,0.00014072066,0.0001462909,0.00017211818,0.49696144,0.010357198,0.41500214,0.002676509,0.07354265],"study_design_scores_gemma":[0.000013317022,0.00010676039,0.00015599235,0.0000365646,0.000015137324,0.000082266895,0.000038229104,0.78250515,0.0017426361,0.2130231,0.002264562,0.000016241187],"about_ca_topic_score_codex":0.0006369132,"about_ca_topic_score_gemma":0.0006526585,"teacher_disagreement_score":0.0016379943,"about_ca_system_score_codex":0.00089889247,"about_ca_system_score_gemma":0.0007615402,"threshold_uncertainty_score":0.0072232485},"labels":[],"label_agreement":null},{"id":"W4238260137","doi":"10.1007/978-3-319-43370-7_2","title":"Fourier Series","year":2016,"lang":"en","type":"book-chapter","venue":"Applied and numerical harmonic analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kingston Health Sciences Centre","funders":"","keywords":"Series (stratigraphy); Fourier series; Applied mathematics; Mathematics; Computer science; Calculus (dental); Mathematical analysis; Geology","score_opus":0.00938931353592865,"score_gpt":0.20782847755135414,"score_spread":0.1984391640154255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238260137","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022452872,0.0151098985,0.086819045,0.0015245196,0.004520726,0.000037596878,0.0003683182,0.0005484153,0.8888262],"genre_scores_gemma":[0.05066719,0.017291194,0.030989237,0.00066824735,0.0041383565,0.00010177376,0.000576732,0.0008347517,0.89473253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995222,0.00006031175,0.000018287454,0.000088370514,0.00028345795,0.000027473727],"domain_scores_gemma":[0.9996929,0.00007154682,0.000017672184,0.000078003,0.00011398202,0.00002599407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040863908,0.0012016549,0.0007911979,0.0023739857,0.0007399392,0.0031603454,0.00075258646,0.0008532688,0.05637935],"category_scores_gemma":[0.0015596383,0.00030796614,0.000360844,0.0017395464,0.0015270981,0.0031851728,0.0013599078,0.002088317,0.029969035],"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.00001045959,0.000013918304,0.00004932218,0.00014966955,0.0000077630175,0.000036059766,0.00014018232,0.0007246671,0.0015304559,0.78835285,0.06308532,0.14589937],"study_design_scores_gemma":[0.000004770003,0.000014163668,0.00019562281,0.00011077815,0.000006813193,0.00029173744,0.00007149408,0.0033731505,0.0012244723,0.34124634,0.6534454,0.000015217818],"about_ca_topic_score_codex":0.0004917828,"about_ca_topic_score_gemma":0.0006191579,"teacher_disagreement_score":0.05637935,"about_ca_system_score_codex":0.0009292097,"about_ca_system_score_gemma":0.00059022807,"threshold_uncertainty_score":0.1886077},"labels":[],"label_agreement":null},{"id":"W4238639264","doi":"10.1007/978-1-4939-7131-2_100314","title":"Eigenvalue and Eigenvector – Characteristic Value and Characteristic Vector","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Eigenvalues and eigenvectors; Mathematics; Value (mathematics); Pure mathematics; Statistics; Physics","score_opus":0.01189493612510842,"score_gpt":0.21240104031221366,"score_spread":0.20050610418710524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238639264","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004190351,0.026022218,0.30444863,0.003475492,0.0058773193,0.00004758205,0.0004209986,0.0011179565,0.6543994],"genre_scores_gemma":[0.06680954,0.020093316,0.08441662,0.0011906337,0.005720277,0.00014603755,0.00074968755,0.0018921676,0.81898177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996393,0.00006117458,0.00001374427,0.00008525182,0.00017813816,0.000022432874],"domain_scores_gemma":[0.9995597,0.00018156251,0.00002553374,0.00006550965,0.00013902783,0.000028708244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003542757,0.0011047003,0.00067531137,0.0019307606,0.000712739,0.002772616,0.0006676287,0.0008614566,0.031763718],"category_scores_gemma":[0.0017047144,0.00037325616,0.00031947243,0.0023827448,0.0018312285,0.0034922843,0.000879942,0.0017202032,0.020731019],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010337615,0.000015011306,0.000066950095,0.00016148498,0.0000071374493,0.000031706222,0.0001516577,0.0011876144,0.0011605864,0.71914035,0.09514211,0.18292506],"study_design_scores_gemma":[0.0000022408076,0.000009439012,0.00015097465,0.0000691455,0.000004205467,0.00015649894,0.00005483266,0.002447138,0.00089590263,0.6563995,0.339793,0.00001707674],"about_ca_topic_score_codex":0.0004362144,"about_ca_topic_score_gemma":0.0006789717,"teacher_disagreement_score":0.031763718,"about_ca_system_score_codex":0.000793455,"about_ca_system_score_gemma":0.00065805117,"threshold_uncertainty_score":0.10626018},"labels":[],"label_agreement":null},{"id":"W4239250771","doi":"10.1007/978-1-4614-6170-8_100185","title":"Determinant of a Matrix","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Matrix (chemical analysis); Computer science; Materials science; Composite material","score_opus":0.011296283699729586,"score_gpt":0.23599267353552586,"score_spread":0.22469638983579626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239250771","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017462399,0.0062577818,0.3515482,0.00262861,0.0042791343,0.00006181706,0.00054318015,0.0007641499,0.61645466],"genre_scores_gemma":[0.3787179,0.011528323,0.103751265,0.0014941255,0.004565257,0.00014217553,0.0008394707,0.0011380687,0.49782345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996886,0.000054209657,0.000011146785,0.00006755102,0.00015609039,0.00002236739],"domain_scores_gemma":[0.9996418,0.00012784598,0.000019962898,0.000057543974,0.00012199986,0.000030739182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024354125,0.00058890117,0.00042154215,0.0011646089,0.0004462088,0.0018180644,0.00036675174,0.00053662155,0.015679743],"category_scores_gemma":[0.001194454,0.0002598525,0.00031662852,0.0008889676,0.0012524538,0.0013269661,0.0008240423,0.0014004157,0.005233728],"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.000008970821,0.000013065109,0.00008524804,0.00007122496,0.000008181185,0.000057095443,0.0001282015,0.0016503454,0.0021113313,0.91765696,0.02921559,0.0489938],"study_design_scores_gemma":[0.000005159113,0.000022307175,0.00025058913,0.000038266928,0.000007764625,0.0003201204,0.00006223615,0.0077291587,0.0017213288,0.8351311,0.15469313,0.000018779365],"about_ca_topic_score_codex":0.0005188838,"about_ca_topic_score_gemma":0.0005689421,"teacher_disagreement_score":0.015679743,"about_ca_system_score_codex":0.00048747595,"about_ca_system_score_gemma":0.00053022895,"threshold_uncertainty_score":0.052453995},"labels":[],"label_agreement":null},{"id":"W4239662419","doi":"10.5948/upo9781614445159.007","title":"Integral Calculus","year":2013,"lang":"en","type":"book-chapter","venue":"MAA spectrum","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Calculus (dental); Mathematics; Medicine; Dentistry","score_opus":0.010164394972534126,"score_gpt":0.20532453678973248,"score_spread":0.19516014181719835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239662419","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027071338,0.005627473,0.038618177,0.0016214828,0.0007286048,0.000014882499,0.00009669485,0.00017913833,0.9504064],"genre_scores_gemma":[0.1468439,0.009137405,0.01817275,0.0010053662,0.0020801416,0.00007908036,0.00024239333,0.00042255403,0.8220165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99965274,0.00005572613,0.000010597753,0.00005570881,0.00019018582,0.00003501849],"domain_scores_gemma":[0.9998294,0.00004588754,0.000009902501,0.000034632616,0.000061538274,0.000018674627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033367905,0.0006697062,0.00055074075,0.0013426194,0.0014166596,0.0033436632,0.00074483204,0.0007024187,0.028038543],"category_scores_gemma":[0.0009000529,0.00025045406,0.0003729268,0.0012170868,0.002285449,0.0037410834,0.0012652719,0.0022667667,0.008154397],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017639168,0.0000042392967,0.000009166134,0.000012345102,0.000001121095,0.000005304334,0.00006242125,0.00006908474,0.00010482004,0.98088247,0.008455686,0.010391628],"study_design_scores_gemma":[0.0000019718977,0.0000027997064,0.00005214943,0.000023512854,0.0000026844368,0.000046905872,0.000043391683,0.00049674493,0.00015787914,0.8500511,0.14911704,0.0000037632049],"about_ca_topic_score_codex":0.0010802632,"about_ca_topic_score_gemma":0.0012063552,"teacher_disagreement_score":0.028038543,"about_ca_system_score_codex":0.001910546,"about_ca_system_score_gemma":0.0007840609,"threshold_uncertainty_score":0.09379822},"labels":[],"label_agreement":null},{"id":"W4240245484","doi":"10.2307/2695613","title":"Bidiagonal Factorizations of Totally Nonnegative Matrices","year":2001,"lang":"en","type":"article","venue":"American Mathematical Monthly","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Graph; Matrix (chemical analysis); Algebraic number; Degree (music); Algebra over a field; Linear algebra; Mathematics education; Combinatorics; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.010708467795596796,"score_gpt":0.25014676726206947,"score_spread":0.23943829946647266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240245484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18836619,0.0011373375,0.7009992,0.0012737515,0.0011942714,0.00023021156,0.0029629592,0.001287596,0.10254841],"genre_scores_gemma":[0.7174543,0.0010165146,0.21477614,0.00046791742,0.00037294353,0.0002370562,0.0034311505,0.00052566687,0.061718263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994961,0.000089498244,0.00003446443,0.000091080416,0.0001805626,0.00010832718],"domain_scores_gemma":[0.99864715,0.000308388,0.00015008704,0.00017881248,0.00043420095,0.0002814089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042905242,0.00075177004,0.0005182773,0.0011735415,0.00070843316,0.0015897017,0.0003425203,0.00036656178,0.029193722],"category_scores_gemma":[0.0029047732,0.00031849928,0.00047747866,0.0007569769,0.00066974893,0.0014818693,0.0011001287,0.00074739376,0.0054415767],"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.00063687057,0.000113953865,0.0018608082,0.0005079856,0.00003950546,0.000684559,0.0006820931,0.013584816,0.022984726,0.7565872,0.07151551,0.130802],"study_design_scores_gemma":[0.000080017,0.0001611807,0.0015590623,0.00011288166,0.000015885344,0.0011335283,0.00054363563,0.09341151,0.0049285297,0.84375656,0.05421017,0.00008703226],"about_ca_topic_score_codex":0.0011098704,"about_ca_topic_score_gemma":0.0016270849,"teacher_disagreement_score":0.029193722,"about_ca_system_score_codex":0.0003816645,"about_ca_system_score_gemma":0.00036096407,"threshold_uncertainty_score":0.09766275},"labels":[],"label_agreement":null},{"id":"W4241378950","doi":"10.1007/978-1-4614-6170-8_100817","title":"Multiplication of Vector and Matrix","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Multiplication (music); Matrix multiplication; Arithmetic; Matrix (chemical analysis); Computer science; Mathematics; Physics; Materials science; Combinatorics","score_opus":0.011136478772986382,"score_gpt":0.23318570326557556,"score_spread":0.22204922449258918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241378950","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029402794,0.02329273,0.42508683,0.0021014311,0.009685349,0.00008570401,0.00051002385,0.0014823189,0.5348154],"genre_scores_gemma":[0.06537194,0.017623277,0.2029536,0.0016265349,0.005471821,0.00023565373,0.00097491255,0.0012893563,0.704453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923897,0.00015303092,0.000043730426,0.00018569689,0.00033189528,0.00004668515],"domain_scores_gemma":[0.99965644,0.00011920198,0.00001982878,0.000076666336,0.000108047796,0.000019860556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000471905,0.0014824782,0.0007176819,0.0012845664,0.00070116605,0.0026693095,0.0009842607,0.0007274238,0.03791199],"category_scores_gemma":[0.0015709148,0.00042586488,0.0005089505,0.0020876117,0.0020946525,0.003541031,0.001398715,0.001713301,0.020421827],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019383177,0.000010505797,0.000051353178,0.00020905802,0.000010193751,0.000055132292,0.00018151499,0.00068798184,0.0016448522,0.76811403,0.079581484,0.14943449],"study_design_scores_gemma":[0.0000062326044,0.00003051973,0.00010186429,0.000082711755,0.000008176541,0.00031958293,0.00005084219,0.0027854072,0.0015360528,0.32783175,0.66722935,0.000017493647],"about_ca_topic_score_codex":0.00070964877,"about_ca_topic_score_gemma":0.00104322,"teacher_disagreement_score":0.03791199,"about_ca_system_score_codex":0.0007905094,"about_ca_system_score_gemma":0.00070032023,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4241478021","doi":"10.1088/978-1-627-05419-5ch5","title":"Numerical integration","year":2014,"lang":"en","type":"book-chapter","venue":"Morgan & Claypool Publishers eBooks","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science","score_opus":0.012743157558168992,"score_gpt":0.20806570605937766,"score_spread":0.19532254850120867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241478021","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001940892,0.0033314605,0.66830605,0.0006242829,0.0015626218,0.00012137286,0.0011619597,0.005354928,0.31759644],"genre_scores_gemma":[0.042471204,0.0031818869,0.36825994,0.00042316865,0.00040758355,0.0004468418,0.0025311701,0.0037879955,0.5784902],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999463,0.000069897964,0.000028955918,0.00008136144,0.00031981833,0.00003701227],"domain_scores_gemma":[0.9994266,0.00009034413,0.000018023273,0.00017695627,0.0002615638,0.000026586316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056455954,0.0009617667,0.0013843238,0.0011860083,0.00084304553,0.0018161909,0.0015864883,0.0010122615,0.099520676],"category_scores_gemma":[0.0020379461,0.00058127195,0.00071061216,0.0014246141,0.00054056005,0.0015972165,0.0018072212,0.001899145,0.06086707],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042463274,0.00005435571,0.00020704829,0.0003621686,0.000039901974,0.000083214574,0.00012707732,0.019588314,0.004284367,0.25964475,0.14799474,0.56757164],"study_design_scores_gemma":[0.00003298119,0.000035275058,0.00041717186,0.00018755207,0.000036618636,0.0002378231,0.00006560456,0.121590845,0.008102002,0.11551534,0.7537313,0.000047516107],"about_ca_topic_score_codex":0.0027813364,"about_ca_topic_score_gemma":0.003880084,"teacher_disagreement_score":0.099520676,"about_ca_system_score_codex":0.00064394146,"about_ca_system_score_gemma":0.0009939498,"threshold_uncertainty_score":0.33292985},"labels":[],"label_agreement":null},{"id":"W4241703480","doi":"10.1007/978-1-4614-6170-8_100188","title":"Invertible (Nonsingular) Matrices","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Invertible matrix; Mathematics; Pure mathematics","score_opus":0.012907551094355792,"score_gpt":0.21464606958184126,"score_spread":0.20173851848748547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241703480","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035249717,0.010077937,0.46024555,0.001228617,0.003218455,0.00005204473,0.00059530523,0.0016108782,0.51944625],"genre_scores_gemma":[0.054046486,0.01948903,0.19176444,0.0011134329,0.002437592,0.000096031494,0.0012105223,0.0010838475,0.7287586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99970764,0.00002976274,0.000011889976,0.00007108518,0.00016036596,0.000019194838],"domain_scores_gemma":[0.99973816,0.000091633905,0.000016118573,0.000049174087,0.00009314779,0.000011731511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023084786,0.00093734363,0.00038737713,0.0007339708,0.00033606865,0.0016598325,0.0005559503,0.00048612565,0.0443406],"category_scores_gemma":[0.0009268783,0.00030484018,0.00028745472,0.0009987026,0.00092581124,0.0017535457,0.0007791147,0.0015535095,0.029979004],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021578262,0.000032076972,0.000070943344,0.0004427819,0.000011966517,0.00010124457,0.00019497561,0.0021665199,0.008416098,0.5218747,0.088861205,0.3778059],"study_design_scores_gemma":[0.000008687418,0.00002566866,0.00015997828,0.00011231718,0.000009364734,0.00034534387,0.00007329119,0.0044972957,0.0056329113,0.36176136,0.62735337,0.000020492731],"about_ca_topic_score_codex":0.0003163986,"about_ca_topic_score_gemma":0.0006459472,"teacher_disagreement_score":0.0443406,"about_ca_system_score_codex":0.00028876387,"about_ca_system_score_gemma":0.00038485005,"threshold_uncertainty_score":0.14833415},"labels":[],"label_agreement":null},{"id":"W4243377782","doi":"10.1007/978-1-4939-7131-2_100551","title":"Invertible (Nonsingular) Matrices","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Invertible matrix; Mathematics; Pure mathematics","score_opus":0.016239368489185835,"score_gpt":0.22664384217785083,"score_spread":0.210404473688665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243377782","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036585003,0.010146787,0.43512195,0.0015404124,0.004296601,0.000057058183,0.0006981012,0.0019208799,0.5425597],"genre_scores_gemma":[0.054110285,0.019452376,0.17267346,0.0012866033,0.0032639108,0.00010432438,0.0014438848,0.0013010469,0.74636406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99967885,0.000032007676,0.000013322452,0.00008309351,0.00017098922,0.000021756345],"domain_scores_gemma":[0.999681,0.00010724599,0.00001980177,0.0000611018,0.00011509054,0.000015731033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025340897,0.0009646519,0.0003879581,0.0007470132,0.0003561808,0.0017938814,0.0005616859,0.00051561894,0.05167815],"category_scores_gemma":[0.0011009392,0.00031407695,0.00031185348,0.00097109855,0.00093921204,0.0018876833,0.00083325536,0.0016516392,0.036519554],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002322277,0.000034024986,0.00007206298,0.00048795535,0.000012274253,0.00009630144,0.0001994126,0.0018551014,0.007818619,0.5333173,0.104363054,0.35172057],"study_design_scores_gemma":[0.000008963036,0.000026145974,0.00014626759,0.00011339467,0.000009412909,0.00031912836,0.00006968277,0.0038120195,0.004967936,0.3466833,0.64382404,0.00001970134],"about_ca_topic_score_codex":0.00029115955,"about_ca_topic_score_gemma":0.00055586075,"teacher_disagreement_score":0.05167815,"about_ca_system_score_codex":0.00029848615,"about_ca_system_score_gemma":0.00041888116,"threshold_uncertainty_score":0.17288065},"labels":[],"label_agreement":null},{"id":"W4243544963","doi":"10.1007/978-1-4614-8453-0_10","title":"Numerical Integration","year":2013,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science","score_opus":0.014565706818252349,"score_gpt":0.22084828876400575,"score_spread":0.2062825819457534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243544963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016196587,0.004601821,0.6896916,0.00086369814,0.0017368217,0.00008510341,0.00041714997,0.0020361242,0.29894802],"genre_scores_gemma":[0.057416067,0.006388974,0.3498106,0.0009512265,0.0009654721,0.00036732867,0.0015233891,0.0025064123,0.58007056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951947,0.000060881615,0.000019175566,0.000067227666,0.00030796757,0.000025278843],"domain_scores_gemma":[0.99967957,0.000069868714,0.000012991452,0.00008204041,0.0001379735,0.000017518225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044425332,0.0009476551,0.0011125178,0.0009938475,0.00065630657,0.0014364047,0.0012638705,0.000876795,0.053380314],"category_scores_gemma":[0.0015278879,0.00038342754,0.00059502636,0.00097466813,0.0007605224,0.0014412845,0.0018255248,0.0018755158,0.03185251],"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.000040320945,0.00004814367,0.00012733083,0.00035495718,0.000033149587,0.00005556998,0.000103556944,0.020521645,0.004834798,0.4465132,0.09663135,0.43073598],"study_design_scores_gemma":[0.000025246605,0.000031716903,0.00026491014,0.00022187657,0.000027982678,0.00021323585,0.00004765546,0.12822017,0.0071613076,0.28940406,0.57433933,0.000042586165],"about_ca_topic_score_codex":0.0013434126,"about_ca_topic_score_gemma":0.0017134161,"teacher_disagreement_score":0.053380314,"about_ca_system_score_codex":0.00070899236,"about_ca_system_score_gemma":0.00070019445,"threshold_uncertainty_score":0.17857492},"labels":[],"label_agreement":null},{"id":"W4243905397","doi":"10.1007/978-1-4939-7131-2_100008","title":"Addition and Subtraction of Matrices","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Subtraction; Computer science; Mathematics; Arithmetic","score_opus":0.01223551968890267,"score_gpt":0.2186542187150079,"score_spread":0.20641869902610524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243905397","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008239965,0.01887526,0.3746829,0.001788992,0.0071847495,0.000075173695,0.00033956274,0.0012304183,0.5875829],"genre_scores_gemma":[0.1671092,0.022468435,0.29327834,0.002615149,0.0060371975,0.0001992332,0.0010979836,0.0016733615,0.5055212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992299,0.00013687398,0.000037363632,0.00021328917,0.00032392584,0.00005865268],"domain_scores_gemma":[0.99947244,0.00019773403,0.000029164907,0.00011101112,0.00015218201,0.000037456764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055812206,0.0014373391,0.00073512294,0.0016660548,0.0010526668,0.0032003634,0.0013617214,0.00074240455,0.021507705],"category_scores_gemma":[0.0023505779,0.00056104676,0.0008650108,0.0019878678,0.0027659026,0.004303287,0.0019024787,0.0027259714,0.0136558395],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003521944,0.000014187323,0.000056462646,0.00020225102,0.000014512496,0.00006327684,0.00017315506,0.0007941298,0.0025782725,0.85555553,0.022198545,0.118314534],"study_design_scores_gemma":[0.0000068380855,0.000021267784,0.00008130227,0.00005020748,0.000011294675,0.0002882222,0.000044497952,0.0012171521,0.0024417937,0.80422705,0.19159326,0.00001708437],"about_ca_topic_score_codex":0.0004606669,"about_ca_topic_score_gemma":0.00063775596,"teacher_disagreement_score":0.021507705,"about_ca_system_score_codex":0.00075364613,"about_ca_system_score_gemma":0.000744169,"threshold_uncertainty_score":0.071950436},"labels":[],"label_agreement":null},{"id":"W4244394274","doi":"10.1017/s0021900200020015","title":"On the convergence and limits of certain matrix sequences arising in quasi-birth-and-death Markov chains","year":2001,"lang":"en","type":"article","venue":"Journal of Applied Probability","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":"Dalhousie University","funders":"","keywords":"Mathematics; Markov chain; Sequence (biology); Matrix (chemical analysis); Stochastic matrix; Limit (mathematics); Convergence (economics); Applied mathematics; Limit of a sequence; Boundary (topology); Rate of convergence; Markov process; Birth–death process; Mathematical analysis; Statistics","score_opus":0.02380851750277468,"score_gpt":0.26208043253747343,"score_spread":0.23827191503469874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244394274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3368618,0.0014359567,0.64850247,0.0012099816,0.00008724997,0.00011454363,0.00013464707,0.0002664637,0.011386874],"genre_scores_gemma":[0.90990096,0.0016540968,0.08163617,0.00025711095,0.00013332331,0.000335946,0.00020847828,0.00014511414,0.005728767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991787,0.00035820092,0.000050840532,0.00012539752,0.0001795733,0.000107217165],"domain_scores_gemma":[0.9743429,0.01852536,0.0024785805,0.00067524385,0.0024750738,0.0015028678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004386491,0.00076191913,0.0007987227,0.0018263219,0.001286216,0.0019560002,0.0014639986,0.0015901255,0.0029106543],"category_scores_gemma":[0.034516566,0.00051759527,0.0007147119,0.0010285499,0.0038414926,0.003931525,0.0019685782,0.0020191188,0.00037288058],"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.00011614764,0.000082405946,0.0024792098,0.00016271937,0.000032445387,0.00042103077,0.0008404958,0.12967165,0.0042191786,0.853913,0.0007138258,0.007347916],"study_design_scores_gemma":[0.000019030349,0.000052569034,0.00047903857,0.000052284893,0.000011075634,0.00014518584,0.00018369808,0.71866184,0.0014604252,0.278264,0.00063562905,0.0000350814],"about_ca_topic_score_codex":0.0032981075,"about_ca_topic_score_gemma":0.00238583,"teacher_disagreement_score":0.004386491,"about_ca_system_score_codex":0.0015418614,"about_ca_system_score_gemma":0.0010018331,"threshold_uncertainty_score":0.023198247},"labels":[],"label_agreement":null},{"id":"W4244669781","doi":"10.1017/cbo9781316451090.009","title":"Numerical optimization","year":2016,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science","score_opus":0.013734078555813878,"score_gpt":0.18702725180178503,"score_spread":0.17329317324597115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244669781","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023891928,0.012213892,0.7819084,0.0029712864,0.0017874843,0.00013446613,0.0016343923,0.0014033356,0.19555765],"genre_scores_gemma":[0.15268372,0.01890602,0.5003257,0.0019573944,0.0015374187,0.0010305216,0.0056333384,0.0033466783,0.3145793],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992887,0.00018970271,0.00004777481,0.00014791545,0.00026590444,0.000059999034],"domain_scores_gemma":[0.99908006,0.00040007257,0.000059244463,0.00015362786,0.00025656988,0.000050485676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010942557,0.0013036999,0.0014763065,0.0008281415,0.00057472923,0.0020804894,0.0012427251,0.0015446512,0.06440815],"category_scores_gemma":[0.004390475,0.00042411737,0.0011954221,0.001187164,0.0008813584,0.0015378806,0.0020404223,0.0020387094,0.022841142],"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.0001359532,0.0000896692,0.00065866904,0.0013945859,0.00016766717,0.000113573544,0.0000992841,0.21386883,0.0023646294,0.2737315,0.20410971,0.3032659],"study_design_scores_gemma":[0.000054566324,0.00006695291,0.0005138609,0.0004173868,0.00005410865,0.00016953042,0.00007070146,0.51592946,0.002178849,0.23472866,0.24577107,0.00004486989],"about_ca_topic_score_codex":0.0021286833,"about_ca_topic_score_gemma":0.0027603526,"teacher_disagreement_score":0.06440815,"about_ca_system_score_codex":0.0008917451,"about_ca_system_score_gemma":0.0011847719,"threshold_uncertainty_score":0.21546674},"labels":[],"label_agreement":null},{"id":"W4245459596","doi":"10.1002/9781119517566.ch5","title":"Tensors on Vector Spaces","year":2019,"lang":"en","type":"other","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Alberta","funders":"","keywords":"Tensor product; Mathematics; Covariant transformation; Covariance and contravariance of vectors; Pure mathematics; Tensor (intrinsic definition); Algebra over a field; Invariants of tensors; Algebraic number; Tensor contraction; Basis (linear algebra); Pullback; Tensor product of Hilbert spaces; Simple (philosophy); Tensor field; Vector space; Mathematical analysis; Geometry","score_opus":0.009628777080540035,"score_gpt":0.22836752935842058,"score_spread":0.21873875227788056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245459596","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015556606,0.039418906,0.38589573,0.006048713,0.0056313463,0.00012587522,0.0017481303,0.0010328725,0.54454184],"genre_scores_gemma":[0.3470125,0.052331477,0.23676835,0.0040045218,0.010720714,0.0004606127,0.0045452625,0.0020751595,0.34208134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846613,0.0005026324,0.00010820915,0.0002768683,0.00050182734,0.00014433576],"domain_scores_gemma":[0.99906784,0.00031835807,0.0001007474,0.00015766903,0.00024755948,0.00010781912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011194582,0.0013128683,0.00066203525,0.0029997677,0.0016772122,0.005177917,0.0007024384,0.0010059912,0.019094653],"category_scores_gemma":[0.0023509816,0.00046016288,0.0008185149,0.002738847,0.0038374967,0.0059644827,0.0026189997,0.0030308622,0.009059039],"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.0000022408567,0.0000025270137,0.000032511045,0.00003503712,0.0000025256431,0.000020891273,0.00017938038,0.00014559508,0.0002637722,0.9879034,0.0047255186,0.0066866716],"study_design_scores_gemma":[0.0000016235771,0.000012317111,0.00013895391,0.00006071709,0.0000035214714,0.00016886026,0.00010118045,0.00076428015,0.00031932056,0.7491544,0.24926603,0.000008810621],"about_ca_topic_score_codex":0.0011149538,"about_ca_topic_score_gemma":0.0009165578,"teacher_disagreement_score":0.019094653,"about_ca_system_score_codex":0.001668467,"about_ca_system_score_gemma":0.00086275826,"threshold_uncertainty_score":0.06387794},"labels":[],"label_agreement":null},{"id":"W4245461568","doi":"10.22215/etd/2020-14136","title":"On The Numerical Computation of Aᵅx=b","year":2020,"lang":"en","type":"dissertation","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Carleton University","funders":"","keywords":"Ode; Computation; Linear system; Matrix (chemical analysis); Mathematics; Root (linguistics); Algorithm; Computer science; Applied mathematics; Algebra over a field; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.013087096052292779,"score_gpt":0.2598983887364971,"score_spread":0.24681129268420435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245461568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023069724,0.001599103,0.95305455,0.00061631366,0.00047170772,0.000039137674,0.000101386526,0.0003391746,0.020708904],"genre_scores_gemma":[0.37122604,0.0035227365,0.58413124,0.0004929998,0.00032076714,0.000121379126,0.0002735639,0.00030640187,0.039604876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984896,0.000032582226,0.0000064507667,0.000025990343,0.00006896756,0.000016991227],"domain_scores_gemma":[0.99973816,0.00014869227,0.000015959953,0.00003288712,0.000050034854,0.000014257511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043398736,0.00050006504,0.00044290652,0.0003942207,0.00045592265,0.00051333394,0.00033366057,0.00054091203,0.004366234],"category_scores_gemma":[0.0017893253,0.00018193813,0.0002784432,0.00050894765,0.0008636765,0.00079917756,0.0006808865,0.0010117972,0.0008399652],"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.00023580874,0.00007367449,0.0007762991,0.00049543777,0.000054473887,0.00017877473,0.0003363936,0.3142074,0.032424703,0.37495533,0.013236295,0.26302543],"study_design_scores_gemma":[0.000019800267,0.00005685358,0.00036978562,0.00004888766,0.000010182899,0.00006874155,0.000027333619,0.906874,0.007861699,0.065417126,0.019229189,0.000016432165],"about_ca_topic_score_codex":0.0023284436,"about_ca_topic_score_gemma":0.002071983,"teacher_disagreement_score":0.004366234,"about_ca_system_score_codex":0.00029676745,"about_ca_system_score_gemma":0.00048818396,"threshold_uncertainty_score":0.014606535},"labels":[],"label_agreement":null},{"id":"W4246006172","doi":"10.5948/9781614441199.010","title":"Numeration Systems","year":2015,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science","score_opus":0.02501180180961324,"score_gpt":0.2518333083599182,"score_spread":0.22682150655030495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246006172","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002165718,0.003390715,0.0829981,0.0016700814,0.0019265931,0.000044389104,0.000432331,0.0006399463,0.90673214],"genre_scores_gemma":[0.055240743,0.0037726136,0.030054634,0.00049184234,0.0010051791,0.00015740268,0.0007540436,0.0007172895,0.90780634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994567,0.00009750349,0.000031493953,0.00011909305,0.0002517949,0.000043518266],"domain_scores_gemma":[0.99971515,0.00006118278,0.000014257482,0.00008393889,0.00010213165,0.00002330214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004237803,0.00088054576,0.00091727235,0.001557175,0.001329643,0.0042081783,0.0008832605,0.0008569052,0.11637438],"category_scores_gemma":[0.0017156383,0.00037258337,0.0005510072,0.0019678841,0.0015989032,0.0036221123,0.0024531705,0.0020361238,0.039543603],"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.0000080571635,0.000012052678,0.000049044513,0.00008714468,0.000005096188,0.000021390008,0.00012987641,0.00086676015,0.00048165236,0.8463448,0.058858164,0.0931359],"study_design_scores_gemma":[0.0000062949725,0.000010358257,0.000105931154,0.000065567045,0.000004827872,0.00007477437,0.00004775438,0.0031152247,0.000556766,0.48859885,0.5074047,0.000008929911],"about_ca_topic_score_codex":0.0009841748,"about_ca_topic_score_gemma":0.0010848913,"teacher_disagreement_score":0.11637438,"about_ca_system_score_codex":0.0017128413,"about_ca_system_score_gemma":0.00081835454,"threshold_uncertainty_score":0.38931108},"labels":[],"label_agreement":null},{"id":"W4246624957","doi":"10.1017/cbo9781139226752.013","title":"Hankel operators","year":2016,"lang":"he","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Université Laval","funders":"","keywords":"Computer science; Content (measure theory); Information retrieval; Mathematics; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.019231081785924423,"score_gpt":0.19846116805357053,"score_spread":0.1792300862676461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246624957","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008417526,0.016270002,0.14402398,0.0026984354,0.0025380088,0.00003808493,0.0010079263,0.0009713154,0.8240347],"genre_scores_gemma":[0.12981828,0.017166093,0.037655283,0.00095670513,0.0017139434,0.00007046196,0.00088465837,0.00068822195,0.81104636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979657,0.00003638948,0.000008296031,0.000039745224,0.00009683633,0.00002213609],"domain_scores_gemma":[0.99974257,0.000089633504,0.000013671406,0.00005089897,0.000076895914,0.00002632894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036282366,0.00053444447,0.00035611205,0.00088295416,0.00043295676,0.0012758558,0.00031834625,0.00043174016,0.045949273],"category_scores_gemma":[0.00092147716,0.00018814996,0.0002857734,0.00078087405,0.000822705,0.0021128743,0.00062331225,0.001164397,0.01259862],"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.000019650297,0.000013347101,0.000062333194,0.00018597476,0.000009766512,0.000054530516,0.00019357874,0.000976888,0.0022005558,0.8052636,0.08523617,0.105783656],"study_design_scores_gemma":[0.00000785331,0.000027605372,0.00040166595,0.00008485305,0.000009176635,0.00029596494,0.000097082455,0.0046358756,0.0028143441,0.6279532,0.36364996,0.000022388816],"about_ca_topic_score_codex":0.00048845063,"about_ca_topic_score_gemma":0.0006528377,"teacher_disagreement_score":0.045949273,"about_ca_system_score_codex":0.00042590997,"about_ca_system_score_gemma":0.00048844365,"threshold_uncertainty_score":0.15371567},"labels":[],"label_agreement":null},{"id":"W4247222287","doi":"10.3765/salt.v0i0.2491","title":"Infinitivals With \"too\": Degree Operator Scope and Parasitic Gaps","year":2015,"lang":"en","type":"article","venue":"Proceedings from Semantics and Linguistic Theory","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"McGill University","funders":"","keywords":"Scope (computer science); Degree (music); Operator (biology); Computer science; Mathematics; Biology; Programming language; Physics; Genetics","score_opus":0.02549493340909914,"score_gpt":0.24366983469746165,"score_spread":0.2181749012883625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247222287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1706579,0.002701034,0.46605512,0.007852448,0.0015014262,0.00008571688,0.0005405804,0.0012046242,0.34940115],"genre_scores_gemma":[0.96084434,0.00053976174,0.023520764,0.00053010025,0.0003511151,0.000046245532,0.00020534536,0.00041630768,0.013546005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986582,0.00036347337,0.00009572535,0.00038155267,0.0002648489,0.00023615736],"domain_scores_gemma":[0.9957195,0.0023334993,0.00027310342,0.0010201295,0.000466008,0.00018780922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016306745,0.0006840488,0.0006877256,0.0009777732,0.0028228625,0.0040662796,0.0015045732,0.0015860511,0.013303273],"category_scores_gemma":[0.00882999,0.00067883387,0.0013007165,0.0014431505,0.007382513,0.016763264,0.0056327754,0.004136666,0.0015104171],"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.000027404301,0.0000081215185,0.000245235,0.00004673696,0.000006353999,0.00012526858,0.0007113882,0.00024348994,0.0003956822,0.99299777,0.0009309583,0.004261466],"study_design_scores_gemma":[0.0000060694465,0.000008954352,0.00015118974,0.000028593595,0.000014926731,0.00023945782,0.00035526694,0.0014536233,0.000694899,0.9900215,0.0070128352,0.000012648342],"about_ca_topic_score_codex":0.0007629829,"about_ca_topic_score_gemma":0.0010118396,"teacher_disagreement_score":0.013303273,"about_ca_system_score_codex":0.0010867681,"about_ca_system_score_gemma":0.00075588125,"threshold_uncertainty_score":0.044503927},"labels":[],"label_agreement":null},{"id":"W4247409105","doi":"10.1142/s0218396x01001510","title":"AILU FOR HELMHOLTZ PROBLEMS: A NEW PRECONDITIONER BASED ON THE ANALYTIC PARABOLIC FACTORIZATION","year":2001,"lang":"en","type":"article","venue":"Journal of Computational Acoustics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Preconditioner; Factorization; Incomplete LU factorization; Operator (biology); Applied mathematics; Mathematics; Helmholtz free energy; Block (permutation group theory); Incomplete Cholesky factorization; Computer science; Matrix decomposition; Mathematical optimization; Algorithm; Iterative method; Physics; Combinatorics; Eigenvalues and eigenvectors","score_opus":0.0229813282865195,"score_gpt":0.2601423768195702,"score_spread":0.2371610485330507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247409105","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054383897,0.00021807001,0.9917584,0.00016207519,0.000072205425,0.000042818177,0.000034537134,0.00031482108,0.0019587334],"genre_scores_gemma":[0.08860816,0.0005602261,0.904544,0.00017592778,0.0001527116,0.00030481024,0.00010783004,0.00019318238,0.0053532203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999521,0.00014706499,0.00002073062,0.000051830382,0.00021276025,0.000046515117],"domain_scores_gemma":[0.99956125,0.00020648769,0.000039138074,0.000055558765,0.00009073721,0.000046878067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085000665,0.0006831185,0.00069256115,0.0005081911,0.00051428535,0.00060518854,0.0007396674,0.0013771954,0.0025479815],"category_scores_gemma":[0.0019963079,0.00029666815,0.0004558266,0.00048186808,0.0009381281,0.0012752606,0.0015044305,0.0015384298,0.0012350007],"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.00048301343,0.00020152736,0.000764547,0.00063992204,0.000069978785,0.00032056976,0.00054318673,0.36711702,0.12544037,0.22830231,0.008275987,0.2678415],"study_design_scores_gemma":[0.00005243137,0.00011769785,0.00009808612,0.000021990643,0.000010284342,0.00006167787,0.000031220956,0.9566953,0.013949799,0.020063486,0.00887526,0.000022664113],"about_ca_topic_score_codex":0.0013952685,"about_ca_topic_score_gemma":0.0014896024,"teacher_disagreement_score":0.0025479815,"about_ca_system_score_codex":0.00035109336,"about_ca_system_score_gemma":0.0010711377,"threshold_uncertainty_score":0.008523822},"labels":[],"label_agreement":null},{"id":"W4247944334","doi":"10.1017/cbo9780511810183.028","title":"Fourier transforms","year":2010,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Trent University","funders":"","keywords":"Mathematics","score_opus":0.013376313652861654,"score_gpt":0.18447013098885412,"score_spread":0.17109381733599247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247944334","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00335409,0.028077574,0.46088848,0.0024337403,0.0062437826,0.00007314132,0.003014451,0.0036142303,0.49230054],"genre_scores_gemma":[0.04976224,0.03581999,0.14159934,0.0010779311,0.0029728892,0.00015272657,0.0056146644,0.0026203298,0.7603799],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996481,0.00004378197,0.0000162636,0.00007573271,0.00018828228,0.000027893817],"domain_scores_gemma":[0.99958295,0.00011121425,0.00002169436,0.00010884828,0.00014975535,0.000025574007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004913232,0.0008886924,0.00064664223,0.0018886323,0.00044498927,0.001923559,0.0007091941,0.0009580726,0.13428119],"category_scores_gemma":[0.0018044353,0.00032081752,0.00053671206,0.001721994,0.00063790183,0.0026038713,0.0010052454,0.0015763155,0.09304368],"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.000067808825,0.000032067906,0.00016484909,0.0005611233,0.00003078933,0.00014103181,0.00015879619,0.0028036067,0.0088694,0.23955679,0.23779435,0.5098194],"study_design_scores_gemma":[0.000010100984,0.000033007127,0.0005624645,0.00019639665,0.000014228011,0.00076298893,0.000088722714,0.0075878645,0.0062899967,0.11531344,0.8691081,0.000032675012],"about_ca_topic_score_codex":0.0004928776,"about_ca_topic_score_gemma":0.00062404637,"teacher_disagreement_score":0.13428119,"about_ca_system_score_codex":0.00041002163,"about_ca_system_score_gemma":0.00039988672,"threshold_uncertainty_score":0.44921535},"labels":[],"label_agreement":null},{"id":"W4248759904","doi":"10.1007/978-1-4614-8453-0_7","title":"Iterative Methods","year":2013,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Power iteration; Iterative method; Inverse iteration; Computer science; Eigenvalues and eigenvectors; Mathematical optimization; Arnoldi iteration; Algorithm; Mathematics; Applied mathematics","score_opus":0.027104956545410668,"score_gpt":0.30113180756022107,"score_spread":0.2740268510148104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248759904","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007646574,0.0042259395,0.85135925,0.00036139583,0.0008268927,0.00006919494,0.0002342058,0.001360919,0.14079747],"genre_scores_gemma":[0.027242528,0.0067102253,0.52927834,0.0006369612,0.00087008113,0.0003887514,0.0010501505,0.0025667138,0.4312563],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999244,0.00015413752,0.000028555382,0.00012045504,0.00041251388,0.000040358547],"domain_scores_gemma":[0.9993678,0.00022125995,0.000021126276,0.000151658,0.00020944497,0.000028838274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068182,0.0015521175,0.0010712811,0.0013827974,0.00071043096,0.0016497957,0.0016014567,0.0013148598,0.055379346],"category_scores_gemma":[0.0022123589,0.00065217476,0.0009257764,0.0014632404,0.0010510114,0.001617834,0.0020164328,0.0021075327,0.039488055],"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.000037509137,0.000051880033,0.00012192989,0.00047661376,0.000054079697,0.000062977095,0.00018375325,0.013035915,0.0036346265,0.29453662,0.13086681,0.5569373],"study_design_scores_gemma":[0.00002690462,0.000053117434,0.00022229571,0.00028100342,0.000037757683,0.00040531403,0.00006409582,0.0709785,0.0068870867,0.2678207,0.65316325,0.00005997444],"about_ca_topic_score_codex":0.00086355396,"about_ca_topic_score_gemma":0.0015269214,"teacher_disagreement_score":0.055379346,"about_ca_system_score_codex":0.0005834125,"about_ca_system_score_gemma":0.0008588429,"threshold_uncertainty_score":0.18526238},"labels":[],"label_agreement":null},{"id":"W4248844813","doi":"10.1007/978-0-387-68276-1_10","title":"Numerical Analysis","year":2010,"lang":"en","type":"book-chapter","venue":"Springer series in statistics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Majorization; Mathematics; Matrix norm; Invariant (physics); Pure mathematics; Matrix (chemical analysis); Schur complement; Combinatorics; Mathematical physics; Physics; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.011942995117671894,"score_gpt":0.2475964889508703,"score_spread":0.23565349383319842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248844813","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002678864,0.004899602,0.72188485,0.0017991337,0.0019701982,0.00009124337,0.0009484016,0.001975778,0.2637519],"genre_scores_gemma":[0.15866457,0.00935694,0.30513564,0.0018840629,0.0029150674,0.00079907896,0.0030091738,0.0021752394,0.5160603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993259,0.00015018288,0.00003297935,0.00013879266,0.00031251195,0.000039681116],"domain_scores_gemma":[0.9987866,0.0003619349,0.000060255647,0.00041017626,0.00033976603,0.000041212046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077557465,0.0008258274,0.0010342929,0.0016260248,0.0005588514,0.0021045513,0.00080718775,0.00096561835,0.05641875],"category_scores_gemma":[0.0054169,0.0003139078,0.0006034741,0.0014698172,0.000961093,0.0017036508,0.0014211513,0.0015969564,0.031183377],"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.000030468815,0.000035642108,0.00029409735,0.00019698362,0.000027915366,0.00004862907,0.00008193124,0.0137804905,0.0020277435,0.6838129,0.08430825,0.21535493],"study_design_scores_gemma":[0.000017786826,0.000028538621,0.0005670733,0.000121285964,0.000024268948,0.00020004954,0.000046464338,0.12236001,0.0027249542,0.65635496,0.21753047,0.000024072646],"about_ca_topic_score_codex":0.0005491174,"about_ca_topic_score_gemma":0.0005297597,"teacher_disagreement_score":0.05641875,"about_ca_system_score_codex":0.0006583121,"about_ca_system_score_gemma":0.0007762756,"threshold_uncertainty_score":0.18873954},"labels":[],"label_agreement":null},{"id":"W4249386351","doi":"10.1007/978-1-4614-6170-8_100189","title":"Multiplication of Matrices","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Multiplication (music); Arithmetic; Computer science; Mathematics; Combinatorics","score_opus":0.01272860227201952,"score_gpt":0.22591089063932984,"score_spread":0.21318228836731032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249386351","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004872801,0.01378639,0.43410295,0.0014012468,0.00478773,0.00009442648,0.0005706056,0.0014093347,0.5389745],"genre_scores_gemma":[0.087373786,0.015581841,0.2626331,0.0011614572,0.0033670901,0.00024072274,0.001543213,0.0012391813,0.6268596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943477,0.00010431429,0.000028210652,0.00014518187,0.00024799688,0.000039418497],"domain_scores_gemma":[0.99968576,0.00009446311,0.00001777101,0.00007214638,0.000107211745,0.000022635539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033560072,0.0012231901,0.0005388206,0.0010766182,0.00069406274,0.002522986,0.00077711424,0.0005212814,0.038214423],"category_scores_gemma":[0.0012576137,0.00040270208,0.0005059275,0.0016590537,0.001345684,0.0025670608,0.0014257242,0.0014869494,0.019644022],"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.000020623007,0.0000141889295,0.00007065351,0.00025543303,0.000015300993,0.000061839964,0.00025235867,0.000990046,0.0036778634,0.7347014,0.07272107,0.18721923],"study_design_scores_gemma":[0.0000067628807,0.00002964369,0.00012274484,0.000084563544,0.000008554807,0.00029257804,0.000053876673,0.0023911782,0.0023833043,0.3836139,0.6109979,0.000014888877],"about_ca_topic_score_codex":0.0004802352,"about_ca_topic_score_gemma":0.00075761235,"teacher_disagreement_score":0.038214423,"about_ca_system_score_codex":0.0006465769,"about_ca_system_score_gemma":0.000544481,"threshold_uncertainty_score":0.12783998},"labels":[],"label_agreement":null},{"id":"W4249918542","doi":"10.1007/978-1-4939-7131-2_100640","title":"Matrix Factorization","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Factorization; Computer science; Algebra over a field; Mathematics; Pure mathematics; Algorithm","score_opus":0.015196148643478435,"score_gpt":0.2416219041678389,"score_spread":0.22642575552436048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249918542","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013149698,0.014152104,0.5697028,0.0021406333,0.0038843937,0.00015364116,0.0016192603,0.0052776947,0.40175453],"genre_scores_gemma":[0.02545285,0.01972144,0.29814556,0.0016678412,0.0033334182,0.000313001,0.00534541,0.0025269166,0.6434936],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994721,0.00006877916,0.0000194206,0.00014379362,0.00025780738,0.00003813234],"domain_scores_gemma":[0.9995246,0.000115459356,0.000020017042,0.00013639864,0.00017065268,0.00003291037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047293623,0.0019764672,0.0008630341,0.0016507155,0.0008961568,0.0027502666,0.001040481,0.00097576453,0.12631094],"category_scores_gemma":[0.0017224835,0.00057850406,0.00075886276,0.002041784,0.0008374833,0.003077887,0.0016576548,0.0019363491,0.12176428],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003293949,0.00004502183,0.00006127559,0.0004462716,0.000026680988,0.0000614773,0.00011094381,0.0022619138,0.004174546,0.119757645,0.3630463,0.509975],"study_design_scores_gemma":[0.000010700754,0.0000344936,0.00012510072,0.00016314375,0.000015741889,0.000283923,0.000066566965,0.0071136546,0.0034629633,0.14119363,0.8475031,0.000027054517],"about_ca_topic_score_codex":0.00073708675,"about_ca_topic_score_gemma":0.0012847988,"teacher_disagreement_score":0.12631094,"about_ca_system_score_codex":0.0005423581,"about_ca_system_score_gemma":0.000762708,"threshold_uncertainty_score":0.42255223},"labels":[],"label_agreement":null},{"id":"W4249918628","doi":"10.1007/978-0-387-73988-5_3","title":"Scalar Derivatives in Hilbert Spaces","year":2008,"lang":"en","type":"book-chapter","venue":"Springer optimization and its applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Scalar (mathematics); Mathematics; Hilbert space; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.013773044673752679,"score_gpt":0.22495954811635901,"score_spread":0.21118650344260634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249918628","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008508948,0.08031626,0.36103466,0.0038348883,0.005025105,0.0000398547,0.00042341906,0.00088069035,0.5399361],"genre_scores_gemma":[0.15342061,0.04896573,0.086399764,0.0010635338,0.0051459875,0.000117289965,0.00044507443,0.00096877787,0.70347315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997961,0.000042327763,0.000010705718,0.000030001627,0.00010996529,0.0000109142675],"domain_scores_gemma":[0.9998499,0.000051646923,0.000012157834,0.00003057587,0.000040430343,0.000015298867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034733588,0.00089321967,0.00085679704,0.0010851197,0.00040866694,0.001860134,0.0005003249,0.0007256057,0.010107705],"category_scores_gemma":[0.0005982698,0.000410752,0.00031444753,0.0021757372,0.0012614807,0.0024816557,0.0007082907,0.0018873456,0.0039947988],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005953967,0.000014554667,0.000028887613,0.00012851342,0.0000076214224,0.000023191493,0.0000836974,0.0023348213,0.0010955523,0.89398444,0.035530876,0.06676183],"study_design_scores_gemma":[0.000004373339,0.000019387866,0.00021151575,0.000054717202,0.0000085842985,0.00010545499,0.000035234778,0.010550096,0.0008988271,0.77213997,0.21595514,0.000016714324],"about_ca_topic_score_codex":0.0005609738,"about_ca_topic_score_gemma":0.0008616733,"teacher_disagreement_score":0.010107705,"about_ca_system_score_codex":0.0007460944,"about_ca_system_score_gemma":0.0004621899,"threshold_uncertainty_score":0.033813596},"labels":[],"label_agreement":null},{"id":"W4250952068","doi":"10.1007/978-0-387-77487-9_3","title":"Partial Algebras","year":2008,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Geology; Pure mathematics; Mathematics","score_opus":0.018650676021066844,"score_gpt":0.21980988134381668,"score_spread":0.20115920532274983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250952068","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015456773,0.0028602695,0.021827776,0.0010462431,0.00060702726,0.00002528154,0.00021657233,0.00021693573,0.97165424],"genre_scores_gemma":[0.0395045,0.0039269906,0.010366916,0.00051317434,0.0006445361,0.00007407858,0.000551535,0.0002417573,0.9441765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979264,0.000037471844,0.000007892534,0.00003364266,0.0001076364,0.000020789379],"domain_scores_gemma":[0.99988496,0.000022258377,0.000005476526,0.000028553757,0.000044583267,0.000014160083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021230982,0.00066713383,0.00046047597,0.000990573,0.0012364407,0.0023322515,0.0005595688,0.00042356987,0.05869824],"category_scores_gemma":[0.0004736371,0.00033084938,0.00032452494,0.0013765714,0.0014627672,0.0038872766,0.00096704264,0.0017258084,0.018440433],"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.000004233224,0.000009106136,0.000015649099,0.000046182064,0.0000021561377,0.000009152131,0.000113926566,0.0001389228,0.00027679632,0.9122432,0.05433187,0.032808747],"study_design_scores_gemma":[0.0000029057524,0.0000053435997,0.000056525932,0.00003139916,0.0000031399327,0.00006221245,0.00005787617,0.00038380577,0.00033441035,0.51256585,0.48649165,0.0000048579195],"about_ca_topic_score_codex":0.0009933335,"about_ca_topic_score_gemma":0.001933694,"teacher_disagreement_score":0.05869824,"about_ca_system_score_codex":0.0012178383,"about_ca_system_score_gemma":0.0008655253,"threshold_uncertainty_score":0.19636518},"labels":[],"label_agreement":null},{"id":"W4251743199","doi":"10.1007/978-1-4614-6170-8_100135","title":"Multilayered Network","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.014222912643021049,"score_gpt":0.21441504136989015,"score_spread":0.2001921287268691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251743199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069945655,0.008409102,0.74971145,0.0025973727,0.0015900288,0.00004359864,0.0007833799,0.0016947039,0.22817577],"genre_scores_gemma":[0.12580484,0.016293617,0.29451597,0.0009815592,0.0013602765,0.00017060031,0.0020671983,0.00081192015,0.55799407],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998903,0.000015457792,0.000005297399,0.000032271477,0.0000454706,0.000011297379],"domain_scores_gemma":[0.99984443,0.00004764568,0.000009720056,0.000030002966,0.00005405908,0.000014045595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020627688,0.00059169537,0.00034874884,0.00060336915,0.00030461708,0.0009578774,0.0005648712,0.00054649444,0.02063037],"category_scores_gemma":[0.00081077195,0.00025442793,0.0002570177,0.0007009629,0.00035307792,0.0018505281,0.000806889,0.0010314834,0.00807436],"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.00004344379,0.00003695641,0.00017559266,0.0002877766,0.00004158542,0.00007625662,0.00006768261,0.036327194,0.004911441,0.25180957,0.11297088,0.59325165],"study_design_scores_gemma":[0.000008231909,0.000036597936,0.00046665702,0.00018388843,0.00005074002,0.00024580475,0.000044982924,0.15542252,0.005845289,0.41787532,0.41977918,0.00004077347],"about_ca_topic_score_codex":0.001076772,"about_ca_topic_score_gemma":0.0021198955,"teacher_disagreement_score":0.02063037,"about_ca_system_score_codex":0.00050958816,"about_ca_system_score_gemma":0.00039626306,"threshold_uncertainty_score":0.06901544},"labels":[],"label_agreement":null},{"id":"W4251897698","doi":"10.1090/fic/040/16","title":"On Ringel-Hall algebras","year":2004,"lang":"en","type":"other","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Lecture hall; Epistemology; Philosophy; Geography; Archaeology","score_opus":0.008315693677716082,"score_gpt":0.22613115116032084,"score_spread":0.21781545748260475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251897698","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083000004,0.0057626814,0.21404529,0.005917094,0.0016598216,0.00011971326,0.0010351161,0.0017516294,0.6867086],"genre_scores_gemma":[0.5995115,0.004660305,0.05130089,0.0010081095,0.0020986486,0.00012832532,0.0012121649,0.00048423838,0.33959585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940944,0.00017745937,0.000020246338,0.00010563297,0.00018662897,0.00010060141],"domain_scores_gemma":[0.999305,0.00025914528,0.000057649966,0.00016349702,0.00012209143,0.000092616465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052370207,0.00068901374,0.0005846878,0.0016263548,0.001465498,0.0027573865,0.0009420549,0.000548146,0.039154463],"category_scores_gemma":[0.001823097,0.00024991878,0.0003565596,0.002706358,0.001814031,0.0041912477,0.0016744145,0.0015349984,0.00673141],"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.000044514294,0.000034789715,0.000112657,0.00006525299,0.000006777823,0.000027093278,0.00008338602,0.0012161128,0.00049700885,0.9386456,0.01648471,0.04278208],"study_design_scores_gemma":[0.000019465084,0.000014491291,0.00012492029,0.000025015934,0.000009586602,0.00005883229,0.000059034006,0.0055349586,0.0011082317,0.9562868,0.036747187,0.000011489669],"about_ca_topic_score_codex":0.0012816027,"about_ca_topic_score_gemma":0.0016099351,"teacher_disagreement_score":0.039154463,"about_ca_system_score_codex":0.0011814254,"about_ca_system_score_gemma":0.0010043958,"threshold_uncertainty_score":0.13098472},"labels":[],"label_agreement":null},{"id":"W4251924279","doi":"10.1007/978-0-387-79428-0_3","title":"Matrices","year":2017,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Simple (philosophy); Algebra over a field; Matrix (chemical analysis); Computer science; Mathematics; Pure mathematics; Philosophy; Epistemology; Chemistry","score_opus":0.019294692971541367,"score_gpt":0.24269964332326263,"score_spread":0.22340495035172125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251924279","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020637505,0.00386818,0.1066424,0.0013699209,0.0039143385,0.00008122808,0.0015285932,0.001763832,0.8787677],"genre_scores_gemma":[0.024744824,0.0042028753,0.032146487,0.0007764783,0.0016158815,0.00011574043,0.0018685834,0.0010487321,0.93348044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99965954,0.000032045264,0.000013025407,0.00008289878,0.00018572049,0.000026892076],"domain_scores_gemma":[0.9997315,0.00003783711,0.000015614165,0.000058597674,0.0001278638,0.000028550492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017917108,0.0011087793,0.0004319254,0.0015662794,0.0008794696,0.002661881,0.00069183914,0.00053875096,0.15628566],"category_scores_gemma":[0.00093989546,0.00034267138,0.00032328605,0.0015326514,0.0008460685,0.0022312412,0.0011925305,0.0014938206,0.10550703],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023386232,0.000021002803,0.00006041356,0.00020717244,0.000008091011,0.00005621087,0.0001328193,0.00082996476,0.0038825264,0.51220334,0.26109117,0.22148384],"study_design_scores_gemma":[0.000004276648,0.000012810729,0.000067936475,0.000040624098,0.000003823726,0.00014297025,0.00003605537,0.00074189465,0.0016402926,0.119878784,0.8774214,0.000009092861],"about_ca_topic_score_codex":0.0006843771,"about_ca_topic_score_gemma":0.0011911262,"teacher_disagreement_score":0.15628566,"about_ca_system_score_codex":0.0005622955,"about_ca_system_score_gemma":0.0005557744,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4252133650","doi":"10.1007/978-3-319-48311-5_5","title":"Fejér Monotonicity and Fixed Point Iterations","year":2017,"lang":"en","type":"book-chapter","venue":"CMS books in mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","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, Okanagan Campus; University of British Columbia","funders":"","keywords":"Monotonic function; Monotone polygon; Sequence (biology); Fixed point; Convergence (economics); Mathematics; Point (geometry); Set (abstract data type); Applied mathematics; Discrete mathematics; Mathematical analysis; Computer science; Geometry","score_opus":0.025246649606469187,"score_gpt":0.2550007998378913,"score_spread":0.22975415023142212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252133650","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07631124,0.013240809,0.5440492,0.001869963,0.00061364553,0.00008886055,0.00028413,0.0002892642,0.36325285],"genre_scores_gemma":[0.5788496,0.010782635,0.25790393,0.0010552959,0.00075223437,0.00028793342,0.000444096,0.00024327004,0.14968096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996369,0.0000938744,0.000019364541,0.000070014605,0.00013652511,0.000043272485],"domain_scores_gemma":[0.99961025,0.00019189171,0.000025252464,0.000035153553,0.00011511126,0.000022351758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007823294,0.00043996517,0.00040235824,0.00084288325,0.0006332307,0.0009782293,0.0004835397,0.00068396924,0.0039846175],"category_scores_gemma":[0.0019556205,0.00024125003,0.00042145737,0.00063556153,0.0017362376,0.0020888767,0.0006903819,0.0014735886,0.0011475469],"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.000010202728,0.0000068966806,0.0000649248,0.000058606638,0.000003855042,0.00004758147,0.00011995773,0.002260485,0.0016708651,0.9761485,0.0019321278,0.017676132],"study_design_scores_gemma":[0.000006482216,0.000049537128,0.0003314571,0.000073230614,0.0000056776535,0.00028145852,0.00007720736,0.015663676,0.001968915,0.946905,0.034621026,0.000016363225],"about_ca_topic_score_codex":0.0006273307,"about_ca_topic_score_gemma":0.0006409898,"teacher_disagreement_score":0.0039846175,"about_ca_system_score_codex":0.0007043469,"about_ca_system_score_gemma":0.0004526372,"threshold_uncertainty_score":0.013329923},"labels":[],"label_agreement":null},{"id":"W4252361573","doi":"10.1109/intmag.1997.597693","title":"An Error Indicator For The Calculation Of Global Quantities By The P-adaptive Finite Element Method","year":2005,"lang":"en","type":"article","venue":"1997 IEEE International Magnetics Conference (INTERMAG'97)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Finite element method; Computer science; Applied mathematics; Algorithm; Mathematics; Structural engineering; Engineering","score_opus":0.04516604954576666,"score_gpt":0.3319758779023435,"score_spread":0.28680982835657687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252361573","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014788862,0.00006552805,0.99794,0.000032462784,0.00004057233,0.000009184834,0.000010577093,0.00017845255,0.00024426117],"genre_scores_gemma":[0.11267496,0.00023629515,0.88399017,0.00008039093,0.000081576734,0.00016616721,0.00012909954,0.0006449129,0.001996433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971318,0.001072626,0.00023327164,0.000275918,0.0011880544,0.000098359546],"domain_scores_gemma":[0.99039793,0.0052845045,0.00069117895,0.0011048996,0.0022644587,0.00025706043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062964596,0.000987727,0.0010313272,0.0014659131,0.0005931739,0.0015767472,0.0019019264,0.0013975452,0.0016055531],"category_scores_gemma":[0.02211904,0.00039824215,0.00059191196,0.0011400811,0.0014936457,0.0020113506,0.0024704284,0.0026293797,0.0008290341],"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.0009935731,0.00022417499,0.0030849753,0.00064259354,0.0001743519,0.00017284947,0.00024019316,0.37424582,0.043376524,0.13091151,0.005661042,0.44027236],"study_design_scores_gemma":[0.0000138583455,0.00006064986,0.00024805477,0.000030101322,0.000016966895,0.00004651703,0.0000084187905,0.9831124,0.0075628953,0.00750096,0.0013779971,0.000021261616],"about_ca_topic_score_codex":0.0011658997,"about_ca_topic_score_gemma":0.0008885518,"teacher_disagreement_score":0.0062964596,"about_ca_system_score_codex":0.00049663254,"about_ca_system_score_gemma":0.0011903583,"threshold_uncertainty_score":0.033299267},"labels":[],"label_agreement":null},{"id":"W4252478775","doi":"10.1142/9789814656054_0023","title":"Transformation to Canonical Form for Uniform Asymptotic Expansions","year":2015,"lang":"en","type":"book-chapter","venue":"WORLD SCIENTIFIC eBooks","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Transformation (genetics); Mathematics; Pure mathematics; Canonical transformation; Physics; Quantum mechanics; Chemistry","score_opus":0.04342036437839331,"score_gpt":0.27144235124123606,"score_spread":0.22802198686284275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252478775","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012845698,0.0019268115,0.6534204,0.0014335217,0.0026328883,0.00008214114,0.00020638073,0.0010003158,0.3264518],"genre_scores_gemma":[0.2914097,0.006372626,0.33759817,0.0028385937,0.00601934,0.0004903558,0.0007984128,0.004921687,0.34955117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992348,0.00024355348,0.000038979,0.0001219188,0.00029894715,0.00006182841],"domain_scores_gemma":[0.9994499,0.00012985675,0.000026551896,0.00014786764,0.00020047536,0.000045226858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010406639,0.0011200791,0.0008435988,0.0016644258,0.0009345645,0.0025207803,0.0012247027,0.0011008542,0.020475645],"category_scores_gemma":[0.0031451061,0.00045449805,0.00077816163,0.0013179127,0.0024712486,0.00431047,0.0019704583,0.0034675999,0.008239919],"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.0000055124187,0.000009712499,0.000011724743,0.000020124786,0.0000018745334,0.000014734423,0.00004871023,0.00033848608,0.00045821015,0.9819425,0.0043748347,0.012773582],"study_design_scores_gemma":[0.000004386524,0.000012962307,0.00003669928,0.000023612769,0.0000036274228,0.00011416402,0.000031091546,0.00803957,0.0006370795,0.96472,0.026363833,0.000012944666],"about_ca_topic_score_codex":0.000433329,"about_ca_topic_score_gemma":0.0005272776,"teacher_disagreement_score":0.020475645,"about_ca_system_score_codex":0.0007673363,"about_ca_system_score_gemma":0.000522549,"threshold_uncertainty_score":0.068497896},"labels":[],"label_agreement":null},{"id":"W4252498726","doi":"10.1007/978-1-4939-7131-2_100706","title":"Multiplication of Matrices","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Multiplication (music); Arithmetic; Computer science; Matrix multiplication; Mathematics; Physics; Combinatorics","score_opus":0.01592087894108685,"score_gpt":0.2379189077796867,"score_spread":0.22199802883859984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252498726","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053058476,0.014214909,0.4402581,0.0016669562,0.0056409673,0.00009984374,0.0006791886,0.001596889,0.5305373],"genre_scores_gemma":[0.095463544,0.016086591,0.26256567,0.0013531583,0.004153162,0.00026995668,0.0018549394,0.0014279748,0.6168249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940956,0.000107394946,0.000029620798,0.00016123397,0.00025034833,0.000041829902],"domain_scores_gemma":[0.9996357,0.0001090528,0.000021086726,0.00008403297,0.0001228717,0.000027270818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035347312,0.001267163,0.0005538421,0.0010964067,0.00071416516,0.0027531453,0.00078502233,0.0005615759,0.040377077],"category_scores_gemma":[0.0014337943,0.00042172402,0.0005391784,0.0016581726,0.0013731093,0.0027160652,0.0015125242,0.0015930951,0.021913733],"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.00002253077,0.000014445734,0.00007181444,0.00027458466,0.000015828238,0.000057498244,0.00024766754,0.0009352894,0.0035629082,0.75263554,0.07430055,0.1678613],"study_design_scores_gemma":[0.000007102163,0.00003164844,0.00012581385,0.00008433501,0.000009102814,0.00028058587,0.000052126736,0.0022902356,0.0022763496,0.40441567,0.5904121,0.000014874818],"about_ca_topic_score_codex":0.00043985195,"about_ca_topic_score_gemma":0.0006444563,"teacher_disagreement_score":0.040377077,"about_ca_system_score_codex":0.0006519725,"about_ca_system_score_gemma":0.0005629969,"threshold_uncertainty_score":0.1350748},"labels":[],"label_agreement":null},{"id":"W4252806961","doi":"10.1080/14432471.2020.1809972","title":"Issue 207","year":2020,"lang":"en","type":"article","venue":"Preview","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Condor Petroleum (Canada)","funders":"","keywords":"Computer science","score_opus":0.028130895472651275,"score_gpt":0.26896809871130595,"score_spread":0.24083720323865468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252806961","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046503567,0.0050251544,0.002026994,0.009578368,0.06169495,0.00017950466,0.0024005012,0.0013700837,0.91725934],"genre_scores_gemma":[0.0006835075,0.001063281,0.00027781204,0.0017457897,0.0045178104,0.00002567371,0.0006508442,0.00018606755,0.99084926],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999172,0.00006454627,0.000028977343,0.00011026775,0.0005320027,0.000092317554],"domain_scores_gemma":[0.99790907,0.00020170427,0.00008653157,0.00023864371,0.0010113387,0.0005526953],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010546423,0.00115237,0.0007278832,0.0034243928,0.0013006049,0.00653488,0.0015280334,0.0020807607,0.65209025],"category_scores_gemma":[0.0027674774,0.00038122703,0.0006997175,0.0019484422,0.0005296869,0.0023639626,0.0016952448,0.0020264622,0.561083],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017598348,0.00002611913,0.00006091987,0.00008424888,0.0000025979232,0.000023889077,0.000009547984,0.00002831298,0.00020817862,0.0020956723,0.93923634,0.058206595],"study_design_scores_gemma":[0.000003493722,0.000008458554,0.00013782647,0.000051684736,0.0000017347411,0.000024664616,0.0000130372255,0.00003763883,0.00008655233,0.0005917699,0.999041,0.0000021601415],"about_ca_topic_score_codex":0.0028828897,"about_ca_topic_score_gemma":0.008618713,"teacher_disagreement_score":0.34790975,"about_ca_system_score_codex":0.0012134636,"about_ca_system_score_gemma":0.0022525394,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4253090555","doi":"10.1007/978-3-662-46898-2_2","title":"Mathematical Preliminaries","year":2015,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Mathematics; Calculus (dental); Medicine; Orthodontics","score_opus":0.03747060379628775,"score_gpt":0.25081887735328157,"score_spread":0.21334827355699382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253090555","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013655303,0.013318818,0.07359197,0.0051573217,0.003129618,0.00007901308,0.001377233,0.000329778,0.9016508],"genre_scores_gemma":[0.05391567,0.034971435,0.047439072,0.0059279706,0.006853991,0.00061715103,0.0032791886,0.00078329694,0.8462122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99950564,0.000108157576,0.000026332544,0.000105182815,0.0002011534,0.000053566037],"domain_scores_gemma":[0.9996476,0.00013135017,0.000028702065,0.000054840344,0.00011008734,0.000027325583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057667686,0.00150356,0.0007407428,0.002144452,0.0015172376,0.0028774256,0.0013075549,0.0009883078,0.079649955],"category_scores_gemma":[0.0016463811,0.00042834788,0.00051802816,0.0025579408,0.0018396449,0.0034759243,0.0015080244,0.0028280132,0.04815023],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005506398,0.000014970539,0.000024579125,0.0001669472,0.0000030763765,0.000025364092,0.000119360375,0.0003090337,0.00022113431,0.8689495,0.09842625,0.03173425],"study_design_scores_gemma":[0.000002703144,0.000009132983,0.000066069006,0.0000969939,0.000003865817,0.000080337486,0.00006806824,0.00046690775,0.00013250655,0.44507942,0.5539866,0.00000746886],"about_ca_topic_score_codex":0.0014167804,"about_ca_topic_score_gemma":0.001717262,"teacher_disagreement_score":0.079649955,"about_ca_system_score_codex":0.0013528785,"about_ca_system_score_gemma":0.0010776981,"threshold_uncertainty_score":0.26645565},"labels":[],"label_agreement":null},{"id":"W4253510993","doi":"10.1002/nla.258.abs","title":"On the growth factor in Gaussian elimination for generalized Higham matrices","year":2002,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Gaussian elimination; Positive-definite matrix; Hermitian matrix; Mathematics; Gaussian; Matrix (chemical analysis); Class (philosophy); Factor (programming language); Combinatorics; Pure mathematics; Computer science; Physics; Chemistry","score_opus":0.01661374818348609,"score_gpt":0.2450198333137332,"score_spread":0.2284060851302471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253510993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15809013,0.0042273365,0.78506106,0.0033004596,0.0006380026,0.0001247787,0.00018981026,0.0008170773,0.047551382],"genre_scores_gemma":[0.88428676,0.0037052487,0.08714555,0.00088215433,0.0007027683,0.0002668326,0.00035158475,0.0005959399,0.022063116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976393,0.0009304945,0.00006528758,0.00019396018,0.0007925316,0.00037849107],"domain_scores_gemma":[0.9761752,0.017775824,0.001149991,0.001448279,0.0024572946,0.0009935505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004600713,0.001612219,0.0009940545,0.0018098096,0.0014849748,0.0018792051,0.0011855746,0.0015602792,0.006416315],"category_scores_gemma":[0.03267874,0.00045278826,0.00073134416,0.0013051212,0.005008751,0.004897421,0.003160141,0.0031857418,0.0020681974],"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.0003950225,0.000082117454,0.0021377841,0.00024827398,0.00003978635,0.0004223321,0.0004497728,0.054869946,0.0063258866,0.8826679,0.009374245,0.042986993],"study_design_scores_gemma":[0.000040984643,0.00011497572,0.00054176274,0.0001022589,0.000022528153,0.0003709684,0.00011582281,0.33622426,0.0059674657,0.65116245,0.005264387,0.00007214779],"about_ca_topic_score_codex":0.0023401757,"about_ca_topic_score_gemma":0.0021456848,"teacher_disagreement_score":0.006416315,"about_ca_system_score_codex":0.0014697326,"about_ca_system_score_gemma":0.0012133595,"threshold_uncertainty_score":0.024331212},"labels":[],"label_agreement":null},{"id":"W4253548843","doi":"10.1093/jicru_1.3.73","title":"Appendix 2: Conversion Coefficients for Operational Quantities","year":2001,"lang":"en","type":"article","venue":"Journal of the ICRU","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hydro One (Canada)","funders":"","keywords":"Appendix; Computer science; Geology","score_opus":0.018476217954302317,"score_gpt":0.2604724767888986,"score_spread":0.2419962588345963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253548843","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004050398,0.002230375,0.80866987,0.0015603274,0.0064448304,0.00074955233,0.018756555,0.006072955,0.15146519],"genre_scores_gemma":[0.07041515,0.0023944254,0.75780755,0.0015365194,0.00230735,0.0015638912,0.019579729,0.012698815,0.13169661],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99836665,0.00044714354,0.00015197304,0.00020580571,0.0007062862,0.00012218741],"domain_scores_gemma":[0.9906086,0.0044065937,0.00022579268,0.0010470542,0.003583328,0.00012864053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016619271,0.0019871925,0.0009527167,0.00290744,0.0009718256,0.0017373685,0.002062285,0.0020062402,0.25901842],"category_scores_gemma":[0.020446416,0.00076540717,0.0009905989,0.0027008448,0.00081355916,0.00390635,0.0011872171,0.003001157,0.10546142],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018121745,0.00014607485,0.00036613582,0.00097246206,0.000024365387,0.00026366243,0.00018961521,0.004409989,0.0047053476,0.3147831,0.53028065,0.14367744],"study_design_scores_gemma":[0.00011454226,0.00008560309,0.0011791765,0.00045540152,0.000040861363,0.001272176,0.00015327141,0.030577835,0.0167877,0.2495688,0.6995789,0.0001857356],"about_ca_topic_score_codex":0.002016244,"about_ca_topic_score_gemma":0.0024930504,"teacher_disagreement_score":0.25901842,"about_ca_system_score_codex":0.0010354148,"about_ca_system_score_gemma":0.0016623741,"threshold_uncertainty_score":0.86650294},"labels":[],"label_agreement":null},{"id":"W4255350394","doi":"10.1080/1063719021000042347","title":"A parallel divide and conquer algorithm for non symmetric tridiAgonal toeplitz systems using conjugate gradient","year":2002,"lang":"en","type":"article","venue":"Parallel algorithms 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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Tridiagonal matrix; Toeplitz matrix; Conjugate gradient method; Divide and conquer algorithms; Mathematics; Transpose; Diagonal; Tridiagonal matrix algorithm; Biconjugate gradient method; Band matrix; Matrix (chemical analysis); Positive-definite matrix; Algorithm; Complex conjugate; Symmetric matrix; Applied mathematics; Conjugate residual method; Computer science; Square matrix; Mathematical analysis; Pure mathematics; Gradient descent; Geometry; Eigenvalues and eigenvectors","score_opus":0.029549206045522528,"score_gpt":0.2601528262754053,"score_spread":0.2306036202298828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255350394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011135175,0.00011739231,0.98607475,0.00014479367,0.00003531105,0.000067980414,0.000020041078,0.0009874655,0.0014171092],"genre_scores_gemma":[0.09573749,0.000068017594,0.8999396,0.000076334916,0.00003953694,0.00019611733,0.00008103283,0.00013610767,0.0037258684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996439,0.00007975511,0.000018489573,0.000071257724,0.00013026402,0.000056336936],"domain_scores_gemma":[0.99946123,0.00025750406,0.000045719706,0.000062286395,0.00013378373,0.000039439245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007114144,0.00093818933,0.0010440447,0.0007554398,0.0010435103,0.0008892793,0.001299102,0.0010212472,0.005926797],"category_scores_gemma":[0.0013811154,0.0004585683,0.00041591006,0.0009070954,0.00084298843,0.001089319,0.0010815695,0.0010920605,0.0012858534],"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.0006428808,0.00032116615,0.00087426364,0.00017568478,0.00012680894,0.00030624503,0.00028851483,0.41195533,0.01752673,0.04160804,0.008959402,0.51721483],"study_design_scores_gemma":[0.00007502666,0.000036721947,0.000050011717,0.0000028510153,0.0000070512524,0.00003176211,0.000019570343,0.98989236,0.0024586578,0.006159055,0.0012606996,0.0000062806594],"about_ca_topic_score_codex":0.0070894673,"about_ca_topic_score_gemma":0.010223467,"teacher_disagreement_score":0.0070894673,"about_ca_system_score_codex":0.000773459,"about_ca_system_score_gemma":0.0015623143,"threshold_uncertainty_score":0.019827068},"labels":[],"label_agreement":null},{"id":"W4281384728","doi":"10.1007/s00025-024-02333-x","title":"Young-Type Matrix Units for Non-Propagating Partition Algebra Submodules","year":2024,"lang":"en","type":"article","venue":"Results in Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Partition (number theory); Mathematics; Algebra over a field; Type (biology); Matrix (chemical analysis); Linear algebra; Matrix algebra; Pure mathematics; Physics; Combinatorics; Geometry; Chemistry; Geology; Quantum mechanics; Eigenvalues and eigenvectors","score_opus":0.02760554831029929,"score_gpt":0.2950291593711895,"score_spread":0.26742361106089024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281384728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34108227,0.00083767046,0.48720488,0.0015586428,0.0021469737,0.00019808815,0.0003724162,0.0009675397,0.16563159],"genre_scores_gemma":[0.82776004,0.00056712475,0.058544513,0.0009665582,0.0012384357,0.0002568942,0.00033431718,0.00086603785,0.10946624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992623,0.00016882621,0.00004135935,0.00014525926,0.00020765624,0.00017467506],"domain_scores_gemma":[0.9986438,0.00035991083,0.00018916996,0.000179915,0.000222265,0.00040496053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013133485,0.0010726138,0.0009744852,0.0025035704,0.0024546445,0.0037825329,0.0019625784,0.0015529986,0.016845813],"category_scores_gemma":[0.0027938532,0.00066144083,0.001081623,0.0012941123,0.0030748157,0.006547727,0.0025060093,0.0029833296,0.0036100447],"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.000012904529,0.000018001338,0.00004130824,0.000011473335,0.0000032824728,0.000029383222,0.00010833442,0.00013319898,0.00059204176,0.9968888,0.00050521735,0.0016560678],"study_design_scores_gemma":[0.000008632177,0.000014469223,0.00007258191,0.0000067910764,0.000004074772,0.00006392095,0.00005923426,0.002418252,0.00068976096,0.99516076,0.001490123,0.00001140664],"about_ca_topic_score_codex":0.0003766438,"about_ca_topic_score_gemma":0.00058595114,"teacher_disagreement_score":0.016845813,"about_ca_system_score_codex":0.0009650315,"about_ca_system_score_gemma":0.00070957135,"threshold_uncertainty_score":0.05635488},"labels":[],"label_agreement":null},{"id":"W4281666975","doi":"10.1007/s10107-022-01860-1","title":"Exact computation of an error bound for the balanced linear complementarity problem with unique solution","year":2022,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Invertible matrix; Upper and lower bounds; Computation; Complementarity (molecular biology); Linear complementarity problem; Regular polygon; Diagonal; Inverse; Norm (philosophy); Combinatorics; Applied mathematics; Discrete mathematics; Algorithm; Pure mathematics; Nonlinear system; Mathematical analysis","score_opus":0.03566716938258509,"score_gpt":0.30660469221253256,"score_spread":0.2709375228299475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281666975","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0136378,0.0004095593,0.978933,0.00046068308,0.00017781074,0.000031226624,0.000058930236,0.00023183682,0.006059198],"genre_scores_gemma":[0.5069003,0.0004880117,0.48173746,0.00039438086,0.00018378951,0.00030268263,0.00028009724,0.0005963123,0.009116972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985405,0.00042962682,0.000048327165,0.00022619886,0.0005584244,0.00019699015],"domain_scores_gemma":[0.99181926,0.0062547824,0.00030728593,0.00045798707,0.0009115546,0.00024912012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035272276,0.0014318383,0.0016212194,0.001314374,0.00094054855,0.0024013286,0.0016552615,0.0025632423,0.008079605],"category_scores_gemma":[0.019767052,0.000854252,0.00084490277,0.001123998,0.0017781749,0.0028712798,0.0038900375,0.0032015808,0.0009971068],"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.00025523108,0.00012287278,0.0004964474,0.00033441334,0.000066454835,0.000100070974,0.00018247016,0.73959696,0.004668849,0.18938635,0.0045676315,0.060222227],"study_design_scores_gemma":[0.000010098158,0.00001787595,0.00006357102,0.000024146884,0.0000053234007,0.000014527861,0.000019252584,0.96737915,0.0007875111,0.031086076,0.00058292033,0.000009481937],"about_ca_topic_score_codex":0.0038644462,"about_ca_topic_score_gemma":0.0043867016,"teacher_disagreement_score":0.008079605,"about_ca_system_score_codex":0.0020112502,"about_ca_system_score_gemma":0.0026160544,"threshold_uncertainty_score":0.027029037},"labels":[],"label_agreement":null},{"id":"W4283010495","doi":"10.22541/au.165546187.71089356/v1","title":"A new complex structure-preserving method for QSVD","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Manitoba","funders":"","keywords":"Quaternion; Singular value decomposition; Matrix (chemical analysis); Mathematics; Algebra over a field; Unitary state; Matrix decomposition; Algorithm; Multiplication (music); Matrix multiplication; Pure mathematics; Type (biology); Combinatorics; Geometry","score_opus":0.04811746963293513,"score_gpt":0.3413752937546836,"score_spread":0.2932578241217485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283010495","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010656739,0.000061197905,0.9982566,0.000034223067,0.00003070631,0.00001760858,0.000020585378,0.00014784599,0.00036555275],"genre_scores_gemma":[0.042698093,0.00019334795,0.9538679,0.00008790576,0.00006505272,0.000083524006,0.00021264664,0.00021466527,0.0025769023],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955875,0.00006837922,0.000025501737,0.00008034176,0.00023814128,0.000028807608],"domain_scores_gemma":[0.99958163,0.00010163437,0.000029198653,0.00008841025,0.00017024238,0.000028879815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056347175,0.0006585807,0.000644796,0.00094555697,0.00041139743,0.001288247,0.0011239965,0.00068374246,0.0052451054],"category_scores_gemma":[0.0013091299,0.00032710368,0.00069964683,0.0008613606,0.0006148243,0.0013508571,0.0010736699,0.0012446145,0.0018899102],"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.00018352669,0.00010785428,0.00085697934,0.00028480997,0.00009115492,0.00012454505,0.00020571408,0.14901964,0.05827954,0.10302956,0.0060235453,0.6817931],"study_design_scores_gemma":[0.00002660432,0.000040532446,0.0001269277,0.000010590363,0.000008381158,0.000076490884,0.000020613528,0.96916705,0.0070087104,0.013241914,0.010256993,0.000015214009],"about_ca_topic_score_codex":0.0017946161,"about_ca_topic_score_gemma":0.00192146,"teacher_disagreement_score":0.0052451054,"about_ca_system_score_codex":0.0004820803,"about_ca_system_score_gemma":0.0010744435,"threshold_uncertainty_score":0.017546654},"labels":[],"label_agreement":null},{"id":"W4283124190","doi":"10.2172/1872699","title":"Mixed Precision Numerical Linear Algebra (Final Report)","year":2022,"lang":"en","type":"report","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Univerzita Karlova v Praze; Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Linear algebra; Quarter (Canadian coin); Computer science; Algebra over a field; Algorithm; Applied mathematics; Computational science; Mathematics; Pure mathematics; Geography; Geometry; Archaeology","score_opus":0.05738091156638798,"score_gpt":0.3068324531542986,"score_spread":0.2494515415879106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283124190","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009831896,0.0077183535,0.20427895,0.012230077,0.025849132,0.0015828841,0.053338923,0.0096006375,0.6755692],"genre_scores_gemma":[0.038826305,0.0038367943,0.09741797,0.0016677394,0.0038722667,0.0013443622,0.053976666,0.0047067567,0.79435134],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934482,0.0011100393,0.0001670106,0.00053733215,0.004253759,0.0004837389],"domain_scores_gemma":[0.99076825,0.0009590251,0.00023026647,0.0014582812,0.005944362,0.0006397401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007186092,0.0011384349,0.0007901784,0.0019194485,0.0009966001,0.0046564336,0.0015444005,0.0009487583,0.0974324],"category_scores_gemma":[0.008233676,0.0005773649,0.00066623423,0.0018128142,0.00061410514,0.0015296333,0.0019994902,0.0022929672,0.08697454],"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.00014869338,0.00011289224,0.00039498787,0.00018296034,0.000029278513,0.000045567023,0.000049658112,0.0012436784,0.0015901345,0.026892867,0.8974243,0.07188507],"study_design_scores_gemma":[0.00006343613,0.00016853212,0.0015138563,0.000119851735,0.000019933328,0.00014592962,0.00004775208,0.0049186586,0.00945871,0.010884469,0.9726342,0.000024742689],"about_ca_topic_score_codex":0.0040855138,"about_ca_topic_score_gemma":0.007525407,"teacher_disagreement_score":0.0974324,"about_ca_system_score_codex":0.0017530768,"about_ca_system_score_gemma":0.004180149,"threshold_uncertainty_score":0.3259439},"labels":[],"label_agreement":null},{"id":"W4283331824","doi":"10.36227/techrxiv.20113430.v1","title":"Direct Solution of the Stochastic Inverse Eigenvalue Problem for Complex-Valued Eigenspectra","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Innovation Cluster (Canada)","funders":"Carl and Emily Fuchs Foundation","keywords":"Eigenvalues and eigenvectors; Markov chain; Matrix (chemical analysis); Generalization; Stochastic matrix; Mathematics; Inverse; Applied mathematics; Inverse problem; Mathematical optimization; Computer science; Mathematical analysis","score_opus":0.03972135846574088,"score_gpt":0.27101386428627905,"score_spread":0.23129250582053817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283331824","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009714476,0.00004733475,0.98579246,0.00013032577,0.000023134944,0.000020476926,0.00002269639,0.00006720724,0.0041818726],"genre_scores_gemma":[0.31333414,0.000263444,0.6714272,0.0001993585,0.000079001555,0.00022387029,0.00012971082,0.00020057596,0.014142677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971825,0.00008956955,0.000011089951,0.00005092405,0.00010082155,0.000029371733],"domain_scores_gemma":[0.99926096,0.00044436692,0.000074732336,0.00008130706,0.000103266924,0.000035419893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006593255,0.0005764362,0.00048438943,0.00038896466,0.0003706296,0.0006966727,0.00057307753,0.001038929,0.0047873203],"category_scores_gemma":[0.0025030524,0.0003641805,0.0006236893,0.00030942322,0.0011169806,0.0008981314,0.0014248379,0.0010668703,0.0008308981],"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.00005295625,0.00008207431,0.00047372648,0.00017805315,0.000035482586,0.0002597555,0.0002396851,0.48806116,0.013869188,0.45997286,0.0027966527,0.033978462],"study_design_scores_gemma":[0.00000984638,0.000016351838,0.000046134293,0.000008930585,0.0000029685111,0.000055848428,0.000024914467,0.92366546,0.0019186835,0.07259594,0.0016476717,0.000007221746],"about_ca_topic_score_codex":0.000738367,"about_ca_topic_score_gemma":0.0010031821,"teacher_disagreement_score":0.0047873203,"about_ca_system_score_codex":0.00039705788,"about_ca_system_score_gemma":0.00082732004,"threshold_uncertainty_score":0.016015172},"labels":[],"label_agreement":null},{"id":"W4283724098","doi":"10.1142/s0218127422300178","title":"Islands Supporting ACIM for Two-Dimensional Map","year":2022,"lang":"en","type":"article","venue":"International Journal of Bifurcation and Chaos","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Disjoint sets; Mathematics; Geometry; Combinatorics; Computer science","score_opus":0.011903009265915834,"score_gpt":0.2913049402243361,"score_spread":0.2794019309584203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283724098","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95437706,0.0001935687,0.026543863,0.0002889501,0.000036573823,0.000020953423,0.00016497249,0.00019817607,0.018176002],"genre_scores_gemma":[0.99588794,0.000027994001,0.0034992786,0.00001567444,0.000007995618,0.000013885354,0.00007320295,0.0000107378055,0.00046331657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998778,0.000022590457,0.0000066758034,0.000020268038,0.000042828535,0.000029807632],"domain_scores_gemma":[0.99853075,0.00069575803,0.00020289833,0.00017308565,0.00016658539,0.00023092431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002445257,0.00022893192,0.00028229042,0.0007962427,0.00056184735,0.0008325688,0.00046891594,0.0004767369,0.006489551],"category_scores_gemma":[0.003574678,0.000124418,0.00021879231,0.0002497761,0.0008071347,0.00085549464,0.0012211028,0.0004403871,0.00035897148],"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.0018545138,0.0002751024,0.026369378,0.0010320831,0.00016693471,0.0032938884,0.0013395328,0.24641384,0.11395558,0.5513257,0.0063433074,0.047630116],"study_design_scores_gemma":[0.000092236216,0.00019565923,0.007283519,0.000043421504,0.000035028115,0.0006096665,0.00037759525,0.8695271,0.013626903,0.10541897,0.0027501702,0.00003967635],"about_ca_topic_score_codex":0.00067359227,"about_ca_topic_score_gemma":0.00039935258,"teacher_disagreement_score":0.006489551,"about_ca_system_score_codex":0.00023380031,"about_ca_system_score_gemma":0.00019189458,"threshold_uncertainty_score":0.02170968},"labels":[],"label_agreement":null},{"id":"W4283804589","doi":"10.5539/jmr.v14n4p1","title":"Accurate Eigenvalues for the Sturm-Liouville Problems, Involving Generalized and Periodic Ones","year":2022,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Dirichlet boundary condition; Boundary value problem; Mathematical analysis; Variable (mathematics); Eigenfunction; Sturm–Liouville theory; Uniqueness; Dirichlet eigenvalue; Nonlinear system; Boundary (topology); Mixed boundary condition; Applied mathematics; Dirichlet's principle","score_opus":0.13701703521382885,"score_gpt":0.37974844902522054,"score_spread":0.24273141381139168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283804589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034961414,0.00054446526,0.95248663,0.0002872162,0.00023831347,0.00004093406,0.000043906795,0.00024812887,0.011149015],"genre_scores_gemma":[0.62473744,0.0008743919,0.35445303,0.00016684289,0.0001988773,0.0001775002,0.0002314121,0.00030688802,0.018853657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970895,0.0000684319,0.000022059676,0.000048151254,0.00012082422,0.000031608553],"domain_scores_gemma":[0.9995091,0.00018621783,0.00005498796,0.00008301564,0.00013708245,0.000029759836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005347329,0.0007322325,0.00061073434,0.00067095004,0.00060806406,0.00091377745,0.00079781335,0.0010346585,0.004101923],"category_scores_gemma":[0.0022198036,0.00030785546,0.0007086472,0.00047208046,0.00093733333,0.0017778794,0.00086305913,0.0011178944,0.000864205],"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.00010651775,0.00007079769,0.0015777752,0.00056838704,0.000048035632,0.0005192154,0.00054179336,0.38381436,0.022055821,0.48536006,0.0054139467,0.09992329],"study_design_scores_gemma":[0.000008844683,0.000018542249,0.00017571336,0.000020738269,0.0000056070626,0.00009276298,0.00006719584,0.9410177,0.0025188266,0.05333278,0.0027246196,0.000016755408],"about_ca_topic_score_codex":0.0014030741,"about_ca_topic_score_gemma":0.0014422573,"teacher_disagreement_score":0.004101923,"about_ca_system_score_codex":0.00045097154,"about_ca_system_score_gemma":0.0007879129,"threshold_uncertainty_score":0.0137223005},"labels":[],"label_agreement":null},{"id":"W4285179989","doi":"10.23952/jano.4.2022.2.01","title":"A Special Issue on Projection and Splitting Methods and Their Applications","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Projection (relational algebra); Computer science; Algorithm","score_opus":0.009304687153161816,"score_gpt":0.2711098398652638,"score_spread":0.26180515271210203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285179989","genre_codex":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037800807,0.23399904,0.35163203,0.01757388,0.22721481,0.00025304806,0.00068630883,0.0009404297,0.16392043],"genre_scores_gemma":[0.040343083,0.2089913,0.17934583,0.0064347964,0.32351148,0.00047343163,0.002035737,0.0025995346,0.23626487],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99834335,0.0003807121,0.00014463658,0.00038001564,0.0006729831,0.0000782872],"domain_scores_gemma":[0.9968329,0.0015196188,0.00014939505,0.00034544233,0.00083799276,0.00031468167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024663447,0.0016679871,0.0015559869,0.0022094618,0.0012429014,0.0037683893,0.0014670857,0.0027672446,0.035804745],"category_scores_gemma":[0.0069881235,0.00067300064,0.0014471263,0.0030937719,0.0018827566,0.003392897,0.0023694308,0.0059612724,0.01577725],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010369976,0.00012524452,0.0005246777,0.0010875977,0.00013175304,0.0003032238,0.00016990262,0.008298291,0.0016153452,0.15716667,0.5053962,0.32507744],"study_design_scores_gemma":[0.000016519743,0.00008648415,0.000472212,0.00046355557,0.000037070335,0.00070678256,0.000057033267,0.018924063,0.00068491994,0.11661139,0.8619006,0.000039392395],"about_ca_topic_score_codex":0.0006568353,"about_ca_topic_score_gemma":0.00066927396,"teacher_disagreement_score":0.035804745,"about_ca_system_score_codex":0.0007926346,"about_ca_system_score_gemma":0.0011784318,"threshold_uncertainty_score":0.11977881},"labels":[],"label_agreement":null},{"id":"W4285345591","doi":"10.33774/chemrxiv-2021-qb2jb","title":"Computing vibrational energy levels by solving linear equations using a tensor method with an imposed rank","year":2021,"lang":"en","type":"preprint","venue":"","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":"Queen's University","funders":"Compute Canada","keywords":"Rank (graph theory); Tensor (intrinsic definition); Basis (linear algebra); Mathematics; Applied mathematics; Tensor product; Orthogonalization; Realization (probability); Basis function; Hamiltonian (control theory); Algorithm; Mathematical analysis; Mathematical optimization; Pure mathematics; Combinatorics; Geometry","score_opus":0.048616348289086814,"score_gpt":0.31551267979910735,"score_spread":0.26689633151002057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285345591","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019775657,0.00007488786,0.97460425,0.0001804454,0.000040688883,0.000055426397,0.000113035996,0.00060440693,0.004551206],"genre_scores_gemma":[0.12281637,0.00019229573,0.8703979,0.0000796459,0.000046876587,0.00016353393,0.00023555847,0.00042650755,0.0056412695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994911,0.00015252687,0.000031881005,0.000055148197,0.00022172813,0.000047583806],"domain_scores_gemma":[0.99923205,0.0003423845,0.00006648693,0.00016935455,0.00014792003,0.000041840667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008412793,0.0008719138,0.0007752872,0.0006353568,0.00062860723,0.0010665257,0.0010770012,0.00073553115,0.007648635],"category_scores_gemma":[0.0020827546,0.00043705766,0.0008426403,0.00093807763,0.0010568328,0.0015299261,0.0010133885,0.0018077354,0.0018799253],"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.00016913442,0.00021774859,0.0011939555,0.0004810152,0.000115795156,0.0002509423,0.00045284998,0.44717506,0.046437886,0.3423175,0.005126845,0.15606132],"study_design_scores_gemma":[0.000026657719,0.000053906853,0.0001185664,0.000010788467,0.0000084741205,0.000045561967,0.000044703862,0.9527044,0.00634117,0.037359856,0.0032692545,0.000016661894],"about_ca_topic_score_codex":0.0037201496,"about_ca_topic_score_gemma":0.004349409,"teacher_disagreement_score":0.007648635,"about_ca_system_score_codex":0.000533113,"about_ca_system_score_gemma":0.0013666807,"threshold_uncertainty_score":0.02558726},"labels":[],"label_agreement":null},{"id":"W4286898919","doi":"","title":"Exact computation of an error bound for a generalized linear complementarity problem with unique solution","year":2021,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Université de Sherbrooke","funders":"","keywords":"Computation; Complementarity (molecular biology); Applied mathematics; Mathematics; Linear complementarity problem; Complementarity theory; Mathematical optimization; Algorithm; Physics; Nonlinear system","score_opus":0.026509532265143913,"score_gpt":0.2739318634375262,"score_spread":0.24742233117238227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286898919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010575452,0.00019685116,0.98560345,0.00023168979,0.000053697124,0.00002174042,0.000032085856,0.00008686263,0.0031981138],"genre_scores_gemma":[0.40920174,0.00057286915,0.58235306,0.0002745655,0.00012511299,0.0003130148,0.0002905101,0.00045616933,0.006412927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794394,0.0006097129,0.000085393986,0.00032736576,0.0007883856,0.000245213],"domain_scores_gemma":[0.99272364,0.0055218455,0.00031804922,0.00048071373,0.0007814103,0.0001742706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039397515,0.0013635884,0.0014230357,0.001063604,0.0006917201,0.0019658015,0.0012612105,0.0016330975,0.004561112],"category_scores_gemma":[0.019805232,0.0005476598,0.0006319998,0.0009851636,0.0022367216,0.0030003637,0.0036279282,0.0023829525,0.0007938206],"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.00019906556,0.00004904541,0.00050994614,0.00025218105,0.0000518949,0.0001597611,0.00017908613,0.6337387,0.0060416167,0.2961392,0.0020104677,0.060669083],"study_design_scores_gemma":[0.000010042306,0.00003220241,0.0000756004,0.000034104803,0.000005248959,0.000032136235,0.000030721865,0.90859294,0.0019774844,0.08824716,0.0009472871,0.000015070628],"about_ca_topic_score_codex":0.0021147896,"about_ca_topic_score_gemma":0.0018694737,"teacher_disagreement_score":0.004561112,"about_ca_system_score_codex":0.0016706891,"about_ca_system_score_gemma":0.0015928032,"threshold_uncertainty_score":0.020835638},"labels":[],"label_agreement":null},{"id":"W4287084115","doi":"","title":"Finite Develpments in the Lambda Calculus","year":2021,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Lambda; Calculus (dental); Mathematics; Church encoding; Typed lambda calculus; Lambda calculus; Pure mathematics; Algebra over a field; Simply typed lambda calculus; Physics; Discrete mathematics; Medicine; Dentistry; Optics","score_opus":0.01572006848909816,"score_gpt":0.2333206490361377,"score_spread":0.21760058054703954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287084115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22864668,0.0017926984,0.68649566,0.0027761303,0.00032537896,0.00006181297,0.00031280497,0.0011542453,0.07843471],"genre_scores_gemma":[0.9105259,0.0007615956,0.055433318,0.00031142042,0.000326857,0.000084752166,0.00018792495,0.00029707473,0.03207121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978138,0.0005306319,0.000107816144,0.00037630778,0.00074344414,0.00042799866],"domain_scores_gemma":[0.9952614,0.0030606324,0.0002472677,0.00045211927,0.0005713775,0.0004072352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027231716,0.0006616347,0.0009281465,0.0016155635,0.002716635,0.005036441,0.0017198217,0.0011231337,0.0043231156],"category_scores_gemma":[0.0067622494,0.0007677733,0.0012629866,0.0014297271,0.004239163,0.007490011,0.0030108069,0.003351016,0.0007917506],"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.000034171244,0.000013464513,0.00009129433,0.000022531083,0.0000061440433,0.00007862118,0.0002487212,0.0017303326,0.0007087749,0.99367744,0.00039242906,0.0029960219],"study_design_scores_gemma":[0.000010767156,0.0000070173824,0.000051113413,0.000007198361,0.000008673164,0.00003553936,0.000041742624,0.009728266,0.0008949697,0.9869806,0.0022227718,0.000011250615],"about_ca_topic_score_codex":0.0032790708,"about_ca_topic_score_gemma":0.0022068995,"teacher_disagreement_score":0.005036441,"about_ca_system_score_codex":0.003294725,"about_ca_system_score_gemma":0.0013784302,"threshold_uncertainty_score":0.02390498},"labels":[],"label_agreement":null},{"id":"W4287115209","doi":"","title":"H-phi formulation for the efficient simulation of superconductors","year":2021,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Polytechnique Montréal","funders":"","keywords":"Superconductivity; Computer science; Materials science; Physics; Condensed matter physics","score_opus":0.020731379966216542,"score_gpt":0.25142319199953134,"score_spread":0.2306918120333148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287115209","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0772898,0.00040063597,0.86084133,0.0012365797,0.00024522707,0.00013245092,0.00046871282,0.0007244286,0.058660872],"genre_scores_gemma":[0.8022027,0.00037116083,0.16814539,0.00048411102,0.00022315199,0.00045023588,0.0004440227,0.00066706387,0.027012227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979395,0.000096530326,0.000005987594,0.000017416212,0.000052036972,0.000034054246],"domain_scores_gemma":[0.99930596,0.0003825672,0.0000398275,0.000079159014,0.00012436228,0.00006813659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005534247,0.0005080865,0.00076634093,0.0003818903,0.00053272315,0.000983349,0.0012396666,0.0012052808,0.012280844],"category_scores_gemma":[0.0015581094,0.0003570525,0.0003865403,0.0005041444,0.00080157624,0.0009317846,0.0011058004,0.0011535634,0.0011168848],"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.00016257381,0.00006276512,0.00037785742,0.000110884954,0.000032839573,0.00014427422,0.000096504205,0.7507863,0.0025588234,0.2318015,0.0035668972,0.010298801],"study_design_scores_gemma":[0.000014503062,0.000008072308,0.000029203655,0.0000034208153,0.0000016869483,0.00000579194,0.000012812977,0.9741621,0.00025156175,0.024849165,0.00065929367,0.0000023550258],"about_ca_topic_score_codex":0.0025105379,"about_ca_topic_score_gemma":0.0028160522,"teacher_disagreement_score":0.012280844,"about_ca_system_score_codex":0.00065260875,"about_ca_system_score_gemma":0.00084814057,"threshold_uncertainty_score":0.041083515},"labels":[],"label_agreement":null},{"id":"W4288066759","doi":"10.1080/0025570x.2022.2094169","title":"A Unified Treatment for the Inverses of <i>M</i>-Matrices and Scalars","year":2022,"lang":"en","type":"article","venue":"Mathematics Magazine","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Ontario Tech University","funders":"","keywords":"Mathematics; Invertible matrix; Algebraic number; Algebra over a field; Pure mathematics; Element (criminal law); Elementary proof; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.024353201500157604,"score_gpt":0.2514082622643222,"score_spread":0.22705506076416462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288066759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009838705,0.0023697193,0.86569303,0.002414335,0.0011053374,0.000049100177,0.00011319992,0.00016320855,0.11825339],"genre_scores_gemma":[0.40507174,0.005945698,0.50546706,0.0037034894,0.0041025802,0.00036517775,0.0003206483,0.00065000216,0.07437372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906474,0.00029751955,0.000070044836,0.00015304713,0.00029737488,0.00011734711],"domain_scores_gemma":[0.9992231,0.00024841868,0.00008788894,0.00019283112,0.0001924079,0.000055345132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015396732,0.0011982756,0.00061985845,0.0018461769,0.0012934093,0.002424108,0.0013488047,0.0015701692,0.0073490674],"category_scores_gemma":[0.002841626,0.00050085835,0.0012243331,0.0010150418,0.00376699,0.0058963043,0.001670429,0.003713339,0.0023004308],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037643558,0.0000042639226,0.000016294938,0.000013876352,0.0000010274123,0.000039487542,0.000057492627,0.00055875507,0.0005137569,0.99613106,0.0007171629,0.0019429659],"study_design_scores_gemma":[0.0000056367467,0.000028632805,0.000047162426,0.000025241676,0.0000034712982,0.00012750782,0.000057683028,0.009630278,0.0006217155,0.9705894,0.01885043,0.0000129331565],"about_ca_topic_score_codex":0.00067112787,"about_ca_topic_score_gemma":0.0010057152,"teacher_disagreement_score":0.0073490674,"about_ca_system_score_codex":0.00080450287,"about_ca_system_score_gemma":0.00077877846,"threshold_uncertainty_score":0.024585128},"labels":[],"label_agreement":null},{"id":"W4288095797","doi":"10.48550/arxiv.1910.01069","title":"Fast Interpolation-based Globality Certificates for Computing Kreiss\\n Constants and the Distance to Uncontrollability","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"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; Constant (computer programming); Applied mathematics; Computer science; Mathematical analysis; Image (mathematics)","score_opus":0.04215687304099522,"score_gpt":0.20477123276995704,"score_spread":0.16261435972896182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288095797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018163133,0.00010013262,0.97864497,0.00005495818,0.000023362994,0.000037716298,0.000046636083,0.0010042643,0.0019248443],"genre_scores_gemma":[0.41098726,0.00016683972,0.58539176,0.00006949563,0.000031159372,0.00016114299,0.0003149905,0.00061107596,0.0022662722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991013,0.00014869025,0.000046288795,0.00013842495,0.00043207477,0.00013322713],"domain_scores_gemma":[0.9974832,0.0010705054,0.0003472065,0.0004351051,0.0005243881,0.00013962114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013842474,0.0011225668,0.0011973018,0.0015172845,0.0006026981,0.0014396345,0.0017618237,0.000908452,0.0040716575],"category_scores_gemma":[0.005880115,0.0004799462,0.0009779801,0.0008329505,0.001670817,0.002016574,0.0020990048,0.0022698846,0.0010862045],"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.00032966057,0.00010245048,0.002588382,0.00025571237,0.000070017966,0.00014519326,0.0002572497,0.728795,0.014904247,0.09795224,0.0017782853,0.1528217],"study_design_scores_gemma":[0.000014603444,0.000046688434,0.00017133825,0.00001491313,0.000004371751,0.000020624091,0.000020115749,0.9796893,0.0060514016,0.012987873,0.00096029224,0.00001852715],"about_ca_topic_score_codex":0.0030505732,"about_ca_topic_score_gemma":0.0039833253,"teacher_disagreement_score":0.0040716575,"about_ca_system_score_codex":0.0010215372,"about_ca_system_score_gemma":0.0019956212,"threshold_uncertainty_score":0.013621032},"labels":[],"label_agreement":null},{"id":"W4291130300","doi":"","title":"Permuting Sparse Rectangular Matrices into Block-Diagonal Form","year":2002,"lang":"en","type":"article","venue":"University of North Texas Digital Library (University of North Texas)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Diagonal; Block (permutation group theory); Block matrix; Sparse matrix; Mathematics; Computer science; Combinatorics; Algorithm; Algebra over a field; Arithmetic; Pure mathematics; Physics; Chemistry; Geometry; Computational chemistry; Eigenvalues and eigenvectors","score_opus":0.009716038823290338,"score_gpt":0.16307350403983945,"score_spread":0.1533574652165491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291130300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012385866,0.00007011013,0.9838393,0.00010762267,0.00006350022,0.00006510486,0.000079891775,0.00040173432,0.0029869198],"genre_scores_gemma":[0.1574327,0.00030511591,0.8333416,0.00021902334,0.000076515185,0.00018328486,0.00047358315,0.00025315923,0.0077151535],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993061,0.00022115432,0.000040106206,0.00018305598,0.00017128821,0.00007829203],"domain_scores_gemma":[0.9985061,0.00063118234,0.00016880679,0.00040816914,0.00022808711,0.00005767336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007302789,0.00084966206,0.0007109464,0.0006084252,0.00045435491,0.0008671758,0.0006605054,0.0005570836,0.007391999],"category_scores_gemma":[0.0033608403,0.000352467,0.0006160614,0.000947908,0.00073034083,0.0016582018,0.0009701285,0.0008874591,0.002632226],"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.00030273618,0.00018666589,0.0009668407,0.0004351509,0.000094510106,0.00031525188,0.0003585648,0.31314066,0.049220853,0.17810099,0.010047477,0.44683036],"study_design_scores_gemma":[0.000061118575,0.00024286345,0.00028684398,0.000031521453,0.00003458717,0.00024053632,0.0001792121,0.8645397,0.020741763,0.096612036,0.016993374,0.00003637451],"about_ca_topic_score_codex":0.0016435981,"about_ca_topic_score_gemma":0.0025337697,"teacher_disagreement_score":0.007391999,"about_ca_system_score_codex":0.00032994946,"about_ca_system_score_gemma":0.0007901099,"threshold_uncertainty_score":0.024728656},"labels":[],"label_agreement":null},{"id":"W4292754582","doi":"10.1007/978-3-031-08655-7_43","title":"Szlenk derivation and applications","year":2022,"lang":"pl","type":"book-chapter","venue":"Monografie matematyczne","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science","score_opus":0.018637222336708534,"score_gpt":0.23049747097482554,"score_spread":0.211860248638117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292754582","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005905352,0.007241381,0.1283184,0.0038628448,0.002349502,0.00006769434,0.0006140463,0.0004146926,0.85122603],"genre_scores_gemma":[0.17510141,0.0120753525,0.08003647,0.0022204984,0.0016997395,0.00025588166,0.001213804,0.0014055473,0.72599137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961394,0.00010350932,0.000021960735,0.00007832123,0.00014452125,0.000037785645],"domain_scores_gemma":[0.99980515,0.00004311416,0.000010088959,0.000045540146,0.000082485996,0.000013608432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035357138,0.0007781969,0.00071318063,0.0017146603,0.0016703225,0.0021538106,0.001025126,0.00088934967,0.037689593],"category_scores_gemma":[0.0011429155,0.00041766022,0.00071407907,0.0020476612,0.0015575405,0.0027018415,0.0023056616,0.0025991003,0.022286436],"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.000009864848,0.000010017024,0.00003047319,0.000073923446,0.000005570732,0.000050275536,0.00011713495,0.0002989714,0.0004805941,0.9443861,0.019219384,0.035317633],"study_design_scores_gemma":[0.00000502894,0.000005424399,0.00011907975,0.000031945518,0.0000064237565,0.0001372674,0.000043693086,0.0011185547,0.00064546947,0.8144547,0.18342066,0.000011771448],"about_ca_topic_score_codex":0.0010837297,"about_ca_topic_score_gemma":0.0010945143,"teacher_disagreement_score":0.037689593,"about_ca_system_score_codex":0.0013746264,"about_ca_system_score_gemma":0.0007783467,"threshold_uncertainty_score":0.12608427},"labels":[],"label_agreement":null},{"id":"W4295027350","doi":"10.1007/s11856-022-2349-8","title":"A graph-theoretic approach to a conjecture of Dixon and Pressman","year":2022,"lang":"en","type":"article","venue":"Israel Journal of Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Dimension (graph theory); Integer (computer science); Graph; Field (mathematics); Algebra over a field; Discrete mathematics; Pure mathematics","score_opus":0.012432733268811738,"score_gpt":0.22985720838746276,"score_spread":0.21742447511865104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295027350","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102170944,0.0069225226,0.28397298,0.21819648,0.008642242,0.0001848414,0.0013460503,0.00081735797,0.37774652],"genre_scores_gemma":[0.85558975,0.004716384,0.06419888,0.018998694,0.007860769,0.0002945728,0.001367939,0.0003693576,0.046603747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768555,0.0009043195,0.00007937267,0.0005063773,0.00053210417,0.00029225275],"domain_scores_gemma":[0.98954016,0.0070685386,0.00039965188,0.0012483734,0.0013004398,0.00044286778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002574239,0.0010743707,0.0015788856,0.0052829375,0.0060972497,0.0053774985,0.003908759,0.0053223334,0.022727493],"category_scores_gemma":[0.014828493,0.0010148986,0.0017038869,0.006335511,0.00830569,0.020613786,0.004434883,0.0067518298,0.0021666526],"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.000020737438,0.000020617603,0.00007999124,0.000025769814,0.0000043054924,0.000019880315,0.000100103454,0.0005498732,0.000056933866,0.9908586,0.006364735,0.0018983613],"study_design_scores_gemma":[0.000008614191,0.0000041778194,0.00003586064,0.000010681387,0.0000037841094,0.000012969744,0.000042670697,0.0015109311,0.00004539539,0.99409926,0.0042198794,0.0000059314552],"about_ca_topic_score_codex":0.0042866934,"about_ca_topic_score_gemma":0.0023448754,"teacher_disagreement_score":0.022727493,"about_ca_system_score_codex":0.0030541313,"about_ca_system_score_gemma":0.0013597549,"threshold_uncertainty_score":0.07603103},"labels":[],"label_agreement":null},{"id":"W4296868162","doi":"10.1007/978-3-031-12616-1_3","title":"Iterative Solvers for Mixed Problems","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Mathematics; Applied mathematics; Calculus (dental); Iterative method; Mathematical optimization; Algebra over a field; Pure mathematics; Medicine","score_opus":0.020532769558980046,"score_gpt":0.2443481289422573,"score_spread":0.22381535938327726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296868162","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009921219,0.0014567547,0.97668755,0.00014852082,0.00020569263,0.000026692185,0.00006983772,0.0005629202,0.019849915],"genre_scores_gemma":[0.040364183,0.0022515568,0.90136737,0.0002558565,0.000319889,0.00033694497,0.000506558,0.0011406798,0.05345697],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999393,0.00017822951,0.00003015875,0.00006656642,0.00029841138,0.00003366416],"domain_scores_gemma":[0.99916065,0.0004935942,0.00003630874,0.00011762214,0.00015768442,0.000034170014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006605041,0.0013686795,0.00092683156,0.0007074697,0.0004645769,0.0016773903,0.0014726642,0.0013379514,0.018289372],"category_scores_gemma":[0.0031710153,0.0008255163,0.0010374848,0.001137417,0.0008903832,0.0017994718,0.002462357,0.002953663,0.007332275],"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.00012383034,0.00009582447,0.00024950138,0.0009674002,0.00017302955,0.00013745255,0.00023121874,0.10945641,0.009584482,0.37419948,0.051957555,0.45282376],"study_design_scores_gemma":[0.00004906282,0.00005280838,0.000114346556,0.00013516417,0.000035230605,0.00020957709,0.000040750685,0.6728477,0.005027654,0.23985322,0.08160527,0.000029305467],"about_ca_topic_score_codex":0.0006831875,"about_ca_topic_score_gemma":0.00136984,"teacher_disagreement_score":0.018289372,"about_ca_system_score_codex":0.00040897148,"about_ca_system_score_gemma":0.0006059922,"threshold_uncertainty_score":0.06118399},"labels":[],"label_agreement":null},{"id":"W4298274294","doi":"10.48550/arxiv.1402.0216","title":"Singular value decomposition of a finite Hilbert transform defined on\\n several intervals and the interior problem of tomography: the Riemann-Hilbert\\n problem approach","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Singular value; Method of steepest descent; Riemann hypothesis; Mathematical analysis; Singular value decomposition; Lambda; Singular solution; Matrix (chemical analysis); Hilbert transform; Riemann–Hilbert problem; Order (exchange); Pure mathematics; Eigenvalues and eigenvectors","score_opus":0.020810708500271575,"score_gpt":0.18544552768803735,"score_spread":0.16463481918776576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298274294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18349096,0.0009223663,0.78587615,0.0013168937,0.00013369539,0.000033915505,0.0000714813,0.00014012078,0.028014392],"genre_scores_gemma":[0.9041064,0.0010418994,0.07736549,0.0001718584,0.00025626516,0.00006643404,0.00016134491,0.0001456461,0.016684745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967134,0.00013092783,0.000013613879,0.000044581437,0.00008783886,0.000051798095],"domain_scores_gemma":[0.99866104,0.00062853727,0.000200324,0.00010728975,0.0002028451,0.0001999316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012864051,0.0006795598,0.0004723762,0.0014121252,0.0005325312,0.0013814891,0.0009262017,0.00072913046,0.0026609974],"category_scores_gemma":[0.004741953,0.00024279633,0.0005271841,0.00049216475,0.003026898,0.0024682446,0.0017292151,0.0022022298,0.00033306947],"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.000020891935,0.000020741334,0.00041334744,0.000041033512,0.000009563037,0.00016041678,0.00016119028,0.015246353,0.002211539,0.97664183,0.00040492372,0.004668225],"study_design_scores_gemma":[0.0000068963013,0.000021622964,0.00036339636,0.000027971126,0.0000059580607,0.00013337331,0.00009877304,0.3856669,0.00160231,0.6110715,0.0009839899,0.000017217102],"about_ca_topic_score_codex":0.0011641962,"about_ca_topic_score_gemma":0.00072907587,"teacher_disagreement_score":0.0026609974,"about_ca_system_score_codex":0.0008217687,"about_ca_system_score_gemma":0.000589579,"threshold_uncertainty_score":0.008901894},"labels":[],"label_agreement":null},{"id":"W4298552850","doi":"","title":"Method for determining relaxation factor for modified Newton-Raphson method for non-linear systems","year":2011,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Center for Diagnosis and Research on Alzheimer's Disease","funders":"","keywords":"Relaxation (psychology); Newton's method; Applied mathematics; Factor (programming language); Linear system; Computer science; Mathematics; Mathematical optimization; Mathematical analysis; Nonlinear system; Physics","score_opus":0.04635057427887312,"score_gpt":0.30420875420779775,"score_spread":0.2578581799289246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298552850","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002027705,0.00018620108,0.995464,0.000072933944,0.000100054436,0.00004700059,0.00005869373,0.000282045,0.0017613696],"genre_scores_gemma":[0.049015213,0.00029859148,0.9435495,0.00009588862,0.00010497282,0.00032933673,0.00022687174,0.00056657306,0.0058130776],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924064,0.00028687654,0.00003315894,0.0001008499,0.00028802242,0.00005050448],"domain_scores_gemma":[0.9981542,0.0009170708,0.00010397329,0.00016516272,0.00057612226,0.00008339555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011583704,0.0008888905,0.0007895307,0.0010524422,0.0005581343,0.00069332856,0.0014126094,0.0010262002,0.010210008],"category_scores_gemma":[0.004380839,0.0003682293,0.00083077064,0.00066325563,0.0005669684,0.00096892775,0.001032994,0.002209713,0.002516142],"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.00075757934,0.00032153793,0.001887928,0.0017010751,0.00022747916,0.00040430328,0.0006158619,0.17751043,0.04185292,0.14545229,0.02684207,0.6024266],"study_design_scores_gemma":[0.000054307275,0.000112383466,0.0005430497,0.00007513403,0.00004228684,0.00015922128,0.000057124027,0.9478623,0.0088945385,0.026203431,0.015955767,0.0000404496],"about_ca_topic_score_codex":0.0020144342,"about_ca_topic_score_gemma":0.0027836703,"teacher_disagreement_score":0.010210008,"about_ca_system_score_codex":0.0004575477,"about_ca_system_score_gemma":0.0011601825,"threshold_uncertainty_score":0.034155905},"labels":[],"label_agreement":null},{"id":"W4299834804","doi":"10.5281/zenodo.1310023","title":"hpcng/singularity: Singularity 3.7.3","year":2021,"lang":"en","type":"article","venue":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Tellabs (Canada)","funders":"","keywords":"Singularity; Mathematics; Geometry","score_opus":0.011989510215358075,"score_gpt":0.23056408243615728,"score_spread":0.2185745722207992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299834804","genre_codex":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012476224,0.00038510535,0.06814002,0.00081623474,0.00043440136,0.0001947757,0.02039406,0.84405774,0.064330064],"genre_scores_gemma":[0.029250478,0.0008415794,0.058523946,0.002114884,0.0003797083,0.0005828355,0.07981159,0.7397754,0.08871951],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980817,0.00015759634,0.00013846935,0.00022726142,0.00112464,0.00027039612],"domain_scores_gemma":[0.9956447,0.00078798813,0.00021565788,0.0012819215,0.0017802615,0.00028957432],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019186356,0.0020697156,0.0013861696,0.0018548789,0.0010255967,0.0039856853,0.0049340622,0.0021519759,0.40515786],"category_scores_gemma":[0.014276061,0.0025620344,0.0016964516,0.00177416,0.00095134426,0.0057346355,0.0039655743,0.0045184838,0.44170105],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015185114,0.00003239752,0.00036723225,0.00023791,0.000019399296,0.00009791539,0.00009387523,0.00047643142,0.0016852015,0.005465067,0.9690118,0.022360953],"study_design_scores_gemma":[0.00024199024,0.000061113744,0.0010117658,0.00021353245,0.000028604836,0.0005091975,0.00005883914,0.008019502,0.010175673,0.01796808,0.96157545,0.00013638617],"about_ca_topic_score_codex":0.003566035,"about_ca_topic_score_gemma":0.0035949328,"teacher_disagreement_score":0.40515786,"about_ca_system_score_codex":0.0015298824,"about_ca_system_score_gemma":0.0017519013,"threshold_uncertainty_score":0.8484701},"labels":[],"label_agreement":null},{"id":"W4304184215","doi":"10.1515/spma-2022-0173","title":"The complete positivity of symmetric tridiagonal and pentadiagonal matrices","year":2022,"lang":"en","type":"article","venue":"Special Matrices","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":"Brandon University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Tridiagonal matrix; Mathematics; Rank (graph theory); Tridiagonal matrix algorithm; Mathematical proof; Simple (philosophy); Matrix (chemical analysis); Combinatorics; Decomposition; Pure mathematics; Algebra over a field; Discrete mathematics; Eigenvalues and eigenvectors","score_opus":0.011534552550661714,"score_gpt":0.22789823440937074,"score_spread":0.21636368185870902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4304184215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1431247,0.00023017911,0.81541145,0.00060832314,0.00020465115,0.00009758041,0.00030299427,0.00026859643,0.03975158],"genre_scores_gemma":[0.890845,0.00026764025,0.09922609,0.0003528023,0.00016661196,0.00016408725,0.0002928856,0.00011572714,0.008569124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861443,0.00040929904,0.00008470927,0.00019078773,0.00043705368,0.00026364333],"domain_scores_gemma":[0.9964619,0.0009455,0.00045847512,0.00060937385,0.0010088305,0.0005158802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017042082,0.00068156753,0.00047182856,0.0010387136,0.0007574167,0.0018277715,0.00045171392,0.0005456715,0.0062213982],"category_scores_gemma":[0.0054866956,0.00035575338,0.000540277,0.0006492946,0.0026651323,0.0018842653,0.0018324543,0.0016229593,0.0012374057],"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.000059378428,0.000022810742,0.00048273723,0.000048350896,0.000009797091,0.00025410278,0.00030427263,0.0053288066,0.0066407654,0.97437626,0.0025561482,0.009916632],"study_design_scores_gemma":[0.000017916052,0.000058716643,0.00055456563,0.000034768127,0.0000099968665,0.00057900423,0.0002521635,0.06043815,0.007234921,0.92379284,0.0069919885,0.000035003275],"about_ca_topic_score_codex":0.00041397856,"about_ca_topic_score_gemma":0.00041052772,"teacher_disagreement_score":0.0062213982,"about_ca_system_score_codex":0.00036660474,"about_ca_system_score_gemma":0.00061344117,"threshold_uncertainty_score":0.02081263},"labels":[],"label_agreement":null},{"id":"W43115652","doi":"10.1023/a:1021975414321","title":"Factorised Preconditionings of Successive Approximations in Finite Precision","year":2001,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Linear map; Mathematics; Operator (biology); Matrix (chemical analysis); Applied mathematics; Transformation (genetics); Linear system; System of linear equations; Transformation matrix; Numerical analysis; Computer science; Calculus (dental); Mathematical analysis; Pure mathematics; Physics","score_opus":0.016736023984367084,"score_gpt":0.25884864634894533,"score_spread":0.24211262236457826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43115652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033329304,0.00038305865,0.95869815,0.00017314836,0.00036990704,0.0000471671,0.000075661104,0.0007105016,0.0062131183],"genre_scores_gemma":[0.40665784,0.0006263973,0.57986766,0.00012671342,0.00023057268,0.00013795678,0.00024490335,0.00065072987,0.011457183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920183,0.00032156278,0.000047098,0.00006606701,0.0002927466,0.00007078004],"domain_scores_gemma":[0.998086,0.00082017505,0.00015121812,0.00044386915,0.0004062107,0.000092623624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011362826,0.0008826904,0.00076915516,0.00066212105,0.00042942906,0.0010146202,0.00097118976,0.00090471614,0.008405049],"category_scores_gemma":[0.0064877807,0.0003981457,0.0005718875,0.0010482192,0.0011944586,0.001301915,0.0011998313,0.0015048368,0.0015336025],"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.0010030292,0.0001901927,0.0007087901,0.00042384054,0.00011730329,0.00027211723,0.00049515394,0.36172733,0.033485785,0.28007743,0.009854929,0.3116441],"study_design_scores_gemma":[0.0000350112,0.000103527505,0.00012852655,0.00002380985,0.0000140279435,0.000054164175,0.000036864127,0.94248503,0.008021981,0.04426925,0.0048095686,0.00001822906],"about_ca_topic_score_codex":0.0026083803,"about_ca_topic_score_gemma":0.0049402537,"teacher_disagreement_score":0.008405049,"about_ca_system_score_codex":0.00046778106,"about_ca_system_score_gemma":0.00076669926,"threshold_uncertainty_score":0.028117716},"labels":[],"label_agreement":null},{"id":"W4311941380","doi":"10.1137/21m1449579","title":"Linear Asymptotic Convergence of Anderson Acceleration: Fixed-Point Analysis","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Fixed point; Lipschitz continuity; Differentiable function; Acceleration; Mathematical analysis; Convergence (economics); Applied mathematics; Function (biology); Weak convergence; Physics; Computer science","score_opus":0.011014498051144848,"score_gpt":0.2730494077438461,"score_spread":0.26203490969270127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311941380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16936156,0.0019443247,0.8013602,0.00091928133,0.0002435472,0.00012976135,0.0000835243,0.0006254795,0.025332399],"genre_scores_gemma":[0.91160953,0.00079499814,0.07238403,0.00032734495,0.00013231584,0.00020822893,0.00015252424,0.00029023705,0.014100672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995486,0.0001574239,0.000017628729,0.000053731044,0.00014483991,0.000077714365],"domain_scores_gemma":[0.99680305,0.0015172636,0.00039798184,0.00026177138,0.0007461028,0.00027379667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019461606,0.00084023416,0.0005731685,0.0011360067,0.00064565724,0.00080508145,0.0011112521,0.00087029446,0.0044938126],"category_scores_gemma":[0.010840234,0.00032115658,0.0008379068,0.00035620033,0.0019627486,0.0014509506,0.0016203708,0.0016607519,0.00078941527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021238107,0.00010077711,0.0042709596,0.0003687792,0.000102252896,0.00035287172,0.00041445292,0.2682447,0.011079079,0.68270355,0.00366605,0.028484091],"study_design_scores_gemma":[0.0000120896,0.0000558229,0.00046358255,0.000040328847,0.000009531646,0.00005492386,0.000031644577,0.9458578,0.0015475588,0.050559495,0.0013516895,0.000015470418],"about_ca_topic_score_codex":0.0035415175,"about_ca_topic_score_gemma":0.0022481647,"teacher_disagreement_score":0.0044938126,"about_ca_system_score_codex":0.001232365,"about_ca_system_score_gemma":0.0011623418,"threshold_uncertainty_score":0.015033245},"labels":[],"label_agreement":null},{"id":"W4312105420","doi":"10.1016/j.cam.2022.114996","title":"Eigenvalue bounds for saddle-point systems with singular leading blocks","year":2022,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Saddle point; Eigenvalues and eigenvectors; Saddle; Positive-definite matrix; Singular value; Matrix (chemical analysis); Block (permutation group theory); Singular point of a curve; Mathematical analysis; Applied mathematics; Combinatorics; Geometry; Mathematical optimization","score_opus":0.014576209393344811,"score_gpt":0.23361957571822667,"score_spread":0.21904336632488186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312105420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049908422,0.0023593905,0.89493513,0.0020846026,0.00039619874,0.00008307978,0.00021571625,0.00051395444,0.049503468],"genre_scores_gemma":[0.8697397,0.0028026595,0.1052267,0.000675448,0.00073519227,0.00041333472,0.0005887391,0.00078869954,0.019029543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988637,0.00039940156,0.0000520072,0.00012648813,0.00038762364,0.0001708291],"domain_scores_gemma":[0.98553735,0.0111547625,0.0005281188,0.00072663516,0.0014164092,0.00063678715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032675737,0.0016805409,0.0016649972,0.0018840322,0.0013955868,0.0029083705,0.0016407163,0.0014922667,0.008829485],"category_scores_gemma":[0.018985135,0.0006600768,0.00074752845,0.0010084982,0.0026390273,0.003938405,0.0040548462,0.0034658357,0.0017817206],"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.00030749143,0.0002038198,0.0009858154,0.0004986455,0.0001086357,0.00021900293,0.0005664985,0.27430382,0.007270122,0.67967325,0.009725234,0.02613774],"study_design_scores_gemma":[0.000010294143,0.000026970747,0.00020378391,0.00006180882,0.0000137005645,0.00003259691,0.000072924086,0.728803,0.000819843,0.26902997,0.00090335263,0.000021898077],"about_ca_topic_score_codex":0.0013323937,"about_ca_topic_score_gemma":0.0017358433,"teacher_disagreement_score":0.008829485,"about_ca_system_score_codex":0.0010080683,"about_ca_system_score_gemma":0.0012086983,"threshold_uncertainty_score":0.029537559},"labels":[],"label_agreement":null},{"id":"W4312704013","doi":"10.1007/978-3-030-95864-0_7","title":"Chapter 7: Rectangular Matrix-Variate Distributions","year":2022,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Western University; McGill University","funders":"","keywords":"Random variate; Positive-definite matrix; Hermitian matrix; Dirichlet distribution; Mathematics; Matrix (chemical analysis); Gaussian; Pure mathematics; Mathematical analysis; Statistics; Physics; Materials science; Eigenvalues and eigenvectors","score_opus":0.013003331472402492,"score_gpt":0.23120463631557775,"score_spread":0.21820130484317526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312704013","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057269726,0.026262721,0.46562606,0.0044879685,0.0027991603,0.00008720718,0.0011048433,0.0010641227,0.49284098],"genre_scores_gemma":[0.1336093,0.04232623,0.12573327,0.0026182963,0.0050774766,0.0002314808,0.0021546579,0.0021669571,0.6860824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995968,0.0000908894,0.000013299753,0.00010040851,0.00017263475,0.00002590523],"domain_scores_gemma":[0.9991321,0.0004854758,0.000033066073,0.00010264098,0.00020947568,0.00003724294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006600784,0.0006797959,0.00052809645,0.00083050743,0.00054594985,0.0023958303,0.0006803309,0.00073895295,0.033919003],"category_scores_gemma":[0.002501147,0.00041781354,0.0004850028,0.0014776721,0.0010732434,0.0021011713,0.00079588505,0.0021292767,0.016370859],"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.000015049354,0.00001812332,0.00012897507,0.00017607042,0.000014450839,0.00007501263,0.00017366304,0.0052519627,0.0009126159,0.8250777,0.09731481,0.07084158],"study_design_scores_gemma":[0.000004288098,0.000017099263,0.00033792848,0.00020296467,0.0000099930485,0.00037796132,0.000059947262,0.014549372,0.0009421032,0.5579005,0.42557636,0.000021499252],"about_ca_topic_score_codex":0.0010739149,"about_ca_topic_score_gemma":0.001194944,"teacher_disagreement_score":0.033919003,"about_ca_system_score_codex":0.0010700302,"about_ca_system_score_gemma":0.0006498165,"threshold_uncertainty_score":0.113470376},"labels":[],"label_agreement":null},{"id":"W4312970462","doi":"10.23952/jnva.6.2022.2.01","title":"A Special Issue on Recent Trends in Numerical Algorithms and Their Applications","year":2022,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Algorithm","score_opus":0.012506166876372208,"score_gpt":0.26735209468952925,"score_spread":0.25484592781315707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312970462","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013520112,0.14618509,0.014940737,0.018450791,0.7790594,0.00014125882,0.0005685764,0.00061095523,0.03869127],"genre_scores_gemma":[0.005484022,0.09384198,0.0064395373,0.005196319,0.83198303,0.00013077623,0.0009898087,0.0008028484,0.0551316],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970969,0.00043352568,0.00027871664,0.0005598422,0.0014424929,0.00018844352],"domain_scores_gemma":[0.9877979,0.0051981253,0.00071007916,0.000687029,0.0041231844,0.0014837025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025443123,0.0017775901,0.0023634566,0.003772194,0.0012788457,0.005737725,0.0018517817,0.0023785592,0.066422254],"category_scores_gemma":[0.0099790795,0.0005715937,0.0013483244,0.0031173355,0.0010653995,0.004353818,0.0018182875,0.0047366456,0.023866959],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006893494,0.00008062732,0.00024864372,0.001006181,0.00006714267,0.00008965681,0.00003638076,0.00055719796,0.0006409057,0.006786996,0.88218516,0.108232215],"study_design_scores_gemma":[0.000016966711,0.00008793458,0.00051651796,0.000408053,0.00004527253,0.00035138897,0.000031426127,0.0018339346,0.00034142195,0.009307073,0.98703605,0.000023923656],"about_ca_topic_score_codex":0.00042301384,"about_ca_topic_score_gemma":0.00088978873,"teacher_disagreement_score":0.066422254,"about_ca_system_score_codex":0.0012351696,"about_ca_system_score_gemma":0.0020877556,"threshold_uncertainty_score":0.22220457},"labels":[],"label_agreement":null},{"id":"W4313244103","doi":"10.3390/sym15010040","title":"Matrix Equation’s Reflexive and Anti-Reflexive Solutions over Quaternions","year":2022,"lang":"en","type":"article","venue":"Symmetry","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Fundo para o Desenvolvimento das Ciências e da Tecnologia; Natural Sciences and Engineering Research Council of Canada; Wuyi University; National Natural Science Foundation of China","keywords":"Reflexivity; Quaternion; Matrix (chemical analysis); Mathematics; Representation (politics); Pure mathematics; Algebra over a field; Reflection (computer programming); Computer science; Geometry; Sociology","score_opus":0.03025442067743393,"score_gpt":0.3004296236696212,"score_spread":0.2701752029921873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313244103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04983381,0.000582175,0.9289111,0.00064756384,0.0001967161,0.00006624625,0.00009666868,0.00015537352,0.019510262],"genre_scores_gemma":[0.69989055,0.001659615,0.26811478,0.00048773774,0.000437075,0.00023009686,0.00035282545,0.0003318043,0.028495558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944454,0.00014181416,0.000041701398,0.00013813973,0.00015549769,0.0000783217],"domain_scores_gemma":[0.9993036,0.00019623376,0.00016924477,0.00006581715,0.00020783202,0.00005718194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011240398,0.0010241269,0.0006776242,0.00071143574,0.00041513427,0.0012739374,0.0009058388,0.0012307727,0.0060629244],"category_scores_gemma":[0.0039482806,0.0003381836,0.00077678764,0.0006961948,0.0014054948,0.0028635687,0.0013329579,0.0015466212,0.0012756834],"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.00006975337,0.00004746507,0.00081675226,0.00019080617,0.00004133452,0.000606508,0.00038181455,0.044448104,0.0136092985,0.90560406,0.0033441808,0.030839892],"study_design_scores_gemma":[0.000051774692,0.000092094466,0.00034364255,0.000054203036,0.000022302213,0.0006590472,0.00022066741,0.47320557,0.008320756,0.51061726,0.0063471384,0.00006556566],"about_ca_topic_score_codex":0.0009219465,"about_ca_topic_score_gemma":0.00064057764,"teacher_disagreement_score":0.0060629244,"about_ca_system_score_codex":0.00035363153,"about_ca_system_score_gemma":0.000638907,"threshold_uncertainty_score":0.020282507},"labels":[],"label_agreement":null},{"id":"W4315782800","doi":"10.1142/13324","title":"Differential Calculus","year":2023,"lang":"en","type":"book","venue":"WORLD SCIENTIFIC eBooks","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Calculus (dental); Differential calculus; Differential (mechanical device); Mathematics; Computer science; Pure mathematics; Physics; Medicine","score_opus":0.020545912498039325,"score_gpt":0.238700279270695,"score_spread":0.21815436677265568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315782800","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019509719,0.0037727652,0.0363368,0.0014801029,0.0011382495,0.000017438526,0.00020888438,0.00022857361,0.9548662],"genre_scores_gemma":[0.057401855,0.004047049,0.009362891,0.00066529174,0.0013590581,0.00004429778,0.0002646359,0.0002762761,0.9265786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99980146,0.00002835792,0.0000063739,0.00003511139,0.00010994689,0.00001892218],"domain_scores_gemma":[0.99988973,0.00002400472,0.000005905239,0.000022000633,0.000043454867,0.000014802395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019450615,0.0005931115,0.00051329506,0.0012225687,0.0009820492,0.0021437937,0.00052177673,0.00047057244,0.04076298],"category_scores_gemma":[0.0005431012,0.0002195218,0.00034655893,0.0011133914,0.0011703678,0.0020348944,0.0010190809,0.0015125581,0.013709819],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033266888,0.0000058444925,0.000015649537,0.000027166729,0.0000019567563,0.000013227045,0.000062159714,0.00015456603,0.00028555424,0.93853366,0.038249828,0.022647133],"study_design_scores_gemma":[0.0000036010388,0.0000064442224,0.000080807426,0.000016706626,0.0000037065183,0.00007649628,0.000030902018,0.0007961724,0.00024296354,0.6670726,0.33166513,0.000004433795],"about_ca_topic_score_codex":0.00091230153,"about_ca_topic_score_gemma":0.0010769967,"teacher_disagreement_score":0.04076298,"about_ca_system_score_codex":0.0012793062,"about_ca_system_score_gemma":0.00060700293,"threshold_uncertainty_score":0.13636577},"labels":[],"label_agreement":null},{"id":"W4318977049","doi":"10.1007/978-3-031-10602-6_2","title":"Background on Linear Algebra","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Algebra over a field; Linear algebra; Mathematics; Pure mathematics; Geometry","score_opus":0.04020133119048004,"score_gpt":0.2593812468884509,"score_spread":0.21917991569797085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318977049","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036971364,0.01940251,0.021380601,0.0023390008,0.0019503054,0.000036155947,0.00044063642,0.00039860798,0.9536824],"genre_scores_gemma":[0.00666309,0.02009809,0.009787526,0.0015042602,0.0028061743,0.00007901025,0.0005626966,0.00041212485,0.9580871],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99961734,0.00007062773,0.000015514557,0.00006284589,0.00019672584,0.000036930287],"domain_scores_gemma":[0.99963725,0.00015836788,0.000014876115,0.00005074792,0.00010361148,0.000035172812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038900672,0.0014720109,0.0009406817,0.0025640056,0.0014303419,0.00304326,0.0011149474,0.0009794086,0.16662554],"category_scores_gemma":[0.0008785722,0.000737927,0.00059400557,0.004988668,0.001625654,0.0036628349,0.0012134493,0.0031267772,0.102820896],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010687032,0.000060847393,0.000042507017,0.00040343497,0.000007890577,0.000043305725,0.0002182322,0.0007191046,0.0006341617,0.4169389,0.43231708,0.14860386],"study_design_scores_gemma":[0.0000026726168,0.000010039509,0.000089682195,0.00013475737,0.0000030395333,0.000062770756,0.000038033955,0.0003249443,0.0001665122,0.13699965,0.86216027,0.00000761354],"about_ca_topic_score_codex":0.0016982129,"about_ca_topic_score_gemma":0.0040880153,"teacher_disagreement_score":0.16662554,"about_ca_system_score_codex":0.0015012923,"about_ca_system_score_gemma":0.0012238042,"threshold_uncertainty_score":0.557418},"labels":[],"label_agreement":null},{"id":"W4319725279","doi":"10.13001/ela.2023.7209","title":"Flat portions on the boundary of the numerical range of a 5 × 5 companion matrix","year":2023,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","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":"York University; New York University Abu Dhabi","keywords":"Numerical range; Mathematics; Boundary (topology); Conjecture; Matrix (chemical analysis); Range (aeronautics); Complex matrix; Numerical analysis; Pure mathematics; Combinatorics; Mathematical analysis; Algebra over a field","score_opus":0.011616387272249422,"score_gpt":0.25954353528803936,"score_spread":0.24792714801578994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319725279","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9577543,0.00011433708,0.022943098,0.00011568089,0.000020766962,0.000017238233,0.00010421417,0.00010337201,0.018826952],"genre_scores_gemma":[0.9936777,0.0000395215,0.0042872783,0.000016349562,0.000012634939,0.000013429827,0.00015800731,0.000011887767,0.0017832664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941576,0.00010477722,0.00004474094,0.00010931804,0.00020628286,0.00011909851],"domain_scores_gemma":[0.9981086,0.00070545415,0.00033949036,0.0002602799,0.00022764695,0.00035858972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035201214,0.00033275617,0.0003018202,0.0009343152,0.000959949,0.0010761233,0.0005276861,0.0004893281,0.007561391],"category_scores_gemma":[0.0030157936,0.00020531872,0.0002791018,0.00044356906,0.0015115854,0.0013775082,0.00091876026,0.00057069556,0.00056926644],"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.0016833447,0.00021029823,0.022688055,0.00030857525,0.000058316564,0.0038968937,0.0014288425,0.026912848,0.113027066,0.7433141,0.0036547144,0.082816966],"study_design_scores_gemma":[0.00012329359,0.00079676666,0.032376565,0.00012793769,0.00007134488,0.006517574,0.001838453,0.16331404,0.09478829,0.6866644,0.013189261,0.00019210926],"about_ca_topic_score_codex":0.0003435272,"about_ca_topic_score_gemma":0.0003166687,"teacher_disagreement_score":0.007561391,"about_ca_system_score_codex":0.00025157555,"about_ca_system_score_gemma":0.00027729027,"threshold_uncertainty_score":0.025295377},"labels":[],"label_agreement":null},{"id":"W4320003271","doi":"10.18280/mmep.090621","title":"Some New Properties on Block Matrices Using MATLAB Code","year":2022,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"MATLAB; Block (permutation group theory); Matrix (chemical analysis); Code (set theory); Computer science; Algebra over a field; Matrix analysis; Algorithm; Mathematics; Pure mathematics; Programming language; Combinatorics; Eigenvalues and eigenvectors","score_opus":0.04188854835203007,"score_gpt":0.21306801744152182,"score_spread":0.17117946908949175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320003271","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046184347,0.00073168107,0.98071665,0.00020344612,0.00019884839,0.000043350603,0.00034054456,0.0009149956,0.012231963],"genre_scores_gemma":[0.19072425,0.003248768,0.7759995,0.0006294143,0.0007052652,0.0004796947,0.0019464996,0.0030289963,0.023237564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991233,0.0002191631,0.00006360833,0.00013259743,0.00039081232,0.000070540664],"domain_scores_gemma":[0.9980704,0.0007892807,0.00023928101,0.00023349166,0.00058840925,0.00007918294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009554006,0.0009994293,0.0005534872,0.0015278051,0.000429268,0.0012487075,0.00069013063,0.00070803356,0.0154858995],"category_scores_gemma":[0.0060337167,0.0004338151,0.00087414816,0.0014237426,0.0009734803,0.0025529296,0.000941303,0.0016363839,0.005690918],"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.00019631394,0.00009869947,0.0016501417,0.0009146819,0.00009282972,0.000918546,0.00059886556,0.079362415,0.036935594,0.6717498,0.024782868,0.18269925],"study_design_scores_gemma":[0.000034795994,0.00018028845,0.0013941573,0.00018818773,0.000048958405,0.0013840747,0.00013611223,0.51091576,0.018047687,0.36469564,0.10287733,0.00009711484],"about_ca_topic_score_codex":0.0015671619,"about_ca_topic_score_gemma":0.0015040804,"teacher_disagreement_score":0.0154858995,"about_ca_system_score_codex":0.0004487316,"about_ca_system_score_gemma":0.0006431242,"threshold_uncertainty_score":0.051805556},"labels":[],"label_agreement":null},{"id":"W4320015545","doi":"10.2139/ssrn.4341094","title":"Relative Entropy (Re) Based Lti System Modeling Equipped with Time Delay Estimation and Online Modeling","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Estimation; Computer science; LTI system theory; Control theory (sociology); Mathematics; Engineering; Linear system; Control (management); Artificial intelligence","score_opus":0.011822656803947828,"score_gpt":0.23570155947526603,"score_spread":0.2238789026713182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320015545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008950636,0.00015500373,0.98850805,0.00007158818,0.000031673168,0.000014805694,0.00008463336,0.00024902783,0.0019345259],"genre_scores_gemma":[0.94391793,0.0004475236,0.048609223,0.00009205258,0.00007162174,0.00012347316,0.00042052017,0.00013704509,0.0061805453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993855,0.0001815383,0.00003150324,0.00016812766,0.00016709536,0.000066228546],"domain_scores_gemma":[0.9988348,0.00060455606,0.00018751703,0.00015337892,0.00019171086,0.00002804689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000823083,0.0013971912,0.0014467088,0.0004542962,0.00039491412,0.0010596385,0.0010182924,0.00089180586,0.0023313055],"category_scores_gemma":[0.0025050687,0.00045430768,0.0010347097,0.0005624118,0.0007310974,0.0017124979,0.001170098,0.0015118056,0.0007109962],"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.00008095201,0.000028486398,0.00025792824,0.00010122814,0.00004908831,0.00009646295,0.00006270663,0.9576123,0.0049870573,0.02085581,0.00041084603,0.01545714],"study_design_scores_gemma":[0.0000017176437,0.000021659065,0.00008452472,0.0000037986802,0.000008658632,0.00001610904,0.0000026541832,0.99639314,0.00066291465,0.0026393528,0.00015865942,0.0000067526485],"about_ca_topic_score_codex":0.0034737973,"about_ca_topic_score_gemma":0.0025628277,"teacher_disagreement_score":0.0034737973,"about_ca_system_score_codex":0.00059214054,"about_ca_system_score_gemma":0.0005654856,"threshold_uncertainty_score":0.0077990294},"labels":[],"label_agreement":null},{"id":"W4321483255","doi":"10.1016/j.laa.2023.02.013","title":"New lower bounds on the minimum singular value of a matrix","year":2023,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Singular value; Mathematics; Eigenvalues and eigenvectors; Positive-definite matrix; Combinatorics; Rank (graph theory); Matrix (chemical analysis); Upper and lower bounds; Linear subspace; Mathematical analysis; Pure mathematics; Physics","score_opus":0.012665443869687494,"score_gpt":0.263980765313743,"score_spread":0.2513153214440555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321483255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015684914,0.010791342,0.94253427,0.002881904,0.0013973879,0.0000584918,0.000605073,0.00072861597,0.025318023],"genre_scores_gemma":[0.4035075,0.014616771,0.53758234,0.0035637084,0.010106229,0.0006793982,0.0027191401,0.0022303688,0.024994569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932957,0.0016930036,0.0003635381,0.0012243773,0.0027599256,0.00066350715],"domain_scores_gemma":[0.94760394,0.038744174,0.0021133758,0.0050602914,0.0046382025,0.001840047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007219337,0.0044884207,0.0026538938,0.006829981,0.0015362925,0.006984739,0.0051619513,0.0037642028,0.012634099],"category_scores_gemma":[0.05595294,0.0016170108,0.0020536685,0.005407451,0.0047912886,0.01217232,0.0065151462,0.012628771,0.004429379],"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.0010332512,0.00047754205,0.00236149,0.001313183,0.00031658052,0.00049093965,0.00047592237,0.13858746,0.022109142,0.64360106,0.029369915,0.15986352],"study_design_scores_gemma":[0.000045121793,0.00017330544,0.0009778815,0.00032238345,0.00009962212,0.00036820048,0.00010149771,0.47972327,0.0061182296,0.4990662,0.012889516,0.000114740054],"about_ca_topic_score_codex":0.00091150746,"about_ca_topic_score_gemma":0.0016948623,"teacher_disagreement_score":0.012634099,"about_ca_system_score_codex":0.0023536629,"about_ca_system_score_gemma":0.00138541,"threshold_uncertainty_score":0.042265296},"labels":[],"label_agreement":null},{"id":"W4323065617","doi":"10.2140/involve.2022.15.843","title":"Null vectors, Schur complements, and Parter vertices","year":2022,"lang":"en","type":"article","venue":"Involve a Journal of Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Pure mathematics; Computer science","score_opus":0.024200944082599107,"score_gpt":0.2504124308286851,"score_spread":0.226211486746086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323065617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.388257,0.0006586256,0.4189098,0.0015770749,0.00061756786,0.00017092956,0.00076202524,0.0006002399,0.18844676],"genre_scores_gemma":[0.90917337,0.000431214,0.030699367,0.0004320055,0.00024201651,0.0001282564,0.00066358544,0.00037894648,0.057851292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988972,0.00029342645,0.000031320524,0.00015705462,0.00038191778,0.00023911204],"domain_scores_gemma":[0.99726605,0.0011823752,0.00029481444,0.00033944423,0.0004791247,0.00043820313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011528905,0.0010364185,0.0010233441,0.0030015493,0.0026031868,0.0048916293,0.0012891712,0.0015373732,0.020242648],"category_scores_gemma":[0.006409148,0.0006346884,0.00083139783,0.0013579295,0.0037391947,0.0043677203,0.0024727958,0.0030407798,0.0025432308],"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.00006610619,0.000025621533,0.00017834753,0.000015922416,0.000007301712,0.000058094334,0.00007262048,0.001050242,0.00057290756,0.99162054,0.0012638777,0.005068533],"study_design_scores_gemma":[0.000008286887,0.000015747464,0.000096721,0.000008432942,0.000004284061,0.000044783195,0.00007465763,0.0069016675,0.0005580171,0.99096596,0.001309825,0.000011638803],"about_ca_topic_score_codex":0.0011479006,"about_ca_topic_score_gemma":0.0014564812,"teacher_disagreement_score":0.020242648,"about_ca_system_score_codex":0.0008528466,"about_ca_system_score_gemma":0.0009189988,"threshold_uncertainty_score":0.067718446},"labels":[],"label_agreement":null},{"id":"W4323825473","doi":"10.1137/21m1459265","title":"GPMR: An Iterative Method for Unsymmetric Partitioned Linear Systems","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Generalized minimal residual method; Mathematics; Linear system; Block (permutation group theory); Residual; Iterative method; Applied mathematics; Matrix (chemical analysis); Iterative and incremental development; Algorithm; Computer science; Combinatorics; Mathematical analysis","score_opus":0.022835013793807476,"score_gpt":0.35252663118409694,"score_spread":0.32969161739028946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323825473","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010701289,0.00007689535,0.99724317,0.00006369458,0.000031035743,0.000022867896,0.000043578122,0.0008009665,0.0006475123],"genre_scores_gemma":[0.034545466,0.00016930571,0.9610434,0.000113521106,0.000043100696,0.00015999732,0.0002674444,0.00078548404,0.0028722961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993771,0.00022466689,0.000024370398,0.00007363583,0.0002603943,0.0000398279],"domain_scores_gemma":[0.9992422,0.0003447661,0.00008101235,0.0001136487,0.00017804396,0.00004033966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007565478,0.001022021,0.000852606,0.00041570555,0.00032574407,0.0005924327,0.0015442359,0.0011497736,0.0057310397],"category_scores_gemma":[0.0027037093,0.00054346863,0.0007221193,0.0005003485,0.0006384724,0.00097123324,0.0017587929,0.0020211798,0.0025472522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019096959,0.00008589552,0.0005182337,0.0006109535,0.000147687,0.00032721605,0.00033974118,0.661333,0.038717445,0.03789809,0.016729716,0.24310109],"study_design_scores_gemma":[0.00003341328,0.00005512534,0.00007329071,0.000022183915,0.000009565773,0.00009355136,0.000015597856,0.97777414,0.0052977875,0.005337327,0.011270736,0.000017207474],"about_ca_topic_score_codex":0.001722536,"about_ca_topic_score_gemma":0.0022611022,"teacher_disagreement_score":0.0057310397,"about_ca_system_score_codex":0.00022574866,"about_ca_system_score_gemma":0.0010611785,"threshold_uncertainty_score":0.019172251},"labels":[],"label_agreement":null},{"id":"W4353055925","doi":"10.1016/j.laa.2023.03.008","title":"On the Hadamard-Fischer inequality, the inclusion-exclusion formula, and bipartite graphs","year":2023,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bipartite graph; Combinatorics; Discrete mathematics; Hadamard's inequality; Hadamard transform; Complete bipartite graph; Vertex (graph theory); Complex Hadamard matrix; Hadamard matrix; Graph","score_opus":0.021000429882258653,"score_gpt":0.27009154421508863,"score_spread":0.24909111433283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4353055925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18718925,0.008411369,0.63571787,0.013354178,0.0013407306,0.00006597438,0.0007248443,0.00026048446,0.15293524],"genre_scores_gemma":[0.9276076,0.003112995,0.04976659,0.0019498598,0.0014833052,0.00014691046,0.000440204,0.00012736673,0.015365148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998384,0.000673903,0.00006319431,0.00021946071,0.00042886403,0.00023065884],"domain_scores_gemma":[0.99160904,0.0066609546,0.0003566741,0.00039195523,0.00068119395,0.0003001258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033362887,0.0009619902,0.0017147533,0.002339152,0.0020554878,0.0028057883,0.0024328944,0.00234852,0.0060947943],"category_scores_gemma":[0.014025239,0.0004986055,0.00091048796,0.003263526,0.005808381,0.00772025,0.0024294758,0.0045039477,0.0007570415],"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.000029377712,0.00001571858,0.0001168162,0.000029754356,0.0000067775322,0.00003544163,0.000060501578,0.0030568214,0.0002552934,0.99171466,0.0013708604,0.00330791],"study_design_scores_gemma":[0.0000059166764,0.0000039990277,0.00004310946,0.000007943579,0.000002137233,0.00001329793,0.000015693062,0.01251502,0.00006760464,0.9869437,0.00037471103,0.0000068308477],"about_ca_topic_score_codex":0.0043873284,"about_ca_topic_score_gemma":0.0042618476,"teacher_disagreement_score":0.0060947943,"about_ca_system_score_codex":0.002090981,"about_ca_system_score_gemma":0.0012899234,"threshold_uncertainty_score":0.02038908},"labels":[],"label_agreement":null},{"id":"W4360942255","doi":"10.1093/nsr/nwad083","title":"Fast algorithms for singular value decomposition and the inverse of nearly low-rank matrices","year":2023,"lang":"en","type":"article","venue":"National Science Review","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Singular value decomposition; Rank (graph theory); Inverse; Decomposition; Mathematics; Singular value; Value (mathematics); Applied mathematics; Algorithm; Combinatorics; Statistics; Physics; Chemistry; Geometry; Eigenvalues and eigenvectors","score_opus":0.02209570406689831,"score_gpt":0.32871377938963137,"score_spread":0.30661807532273305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360942255","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005520771,0.0007815216,0.9972378,0.00018875435,0.00011467926,0.000022025706,0.000031398,0.00022529768,0.00084642693],"genre_scores_gemma":[0.025025083,0.0026632496,0.96785253,0.00026809436,0.00047253212,0.00018666004,0.00032777575,0.00024103047,0.00296297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997834,0.0006195275,0.00011335571,0.0003511335,0.00094588357,0.00013604554],"domain_scores_gemma":[0.99462944,0.002735862,0.00034439666,0.00094531185,0.0012264095,0.00011865164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002996713,0.002247167,0.0019588443,0.0018404741,0.0007472108,0.0030054387,0.0019333508,0.0018074766,0.005167373],"category_scores_gemma":[0.015100779,0.0010277345,0.0012928101,0.002278746,0.0017653467,0.00432413,0.0021095052,0.0045945984,0.004155281],"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.00020779313,0.00012588312,0.000542895,0.00089245476,0.00017654822,0.00012557376,0.00022320698,0.123953745,0.011079316,0.39777118,0.019189898,0.44571155],"study_design_scores_gemma":[0.000071509756,0.00013492972,0.00019479047,0.0001476668,0.000027710967,0.00023095107,0.00006331958,0.6020475,0.0071779853,0.36672637,0.023112167,0.00006514814],"about_ca_topic_score_codex":0.001660491,"about_ca_topic_score_gemma":0.0018705584,"teacher_disagreement_score":0.005167373,"about_ca_system_score_codex":0.0008259498,"about_ca_system_score_gemma":0.001986853,"threshold_uncertainty_score":0.01728654},"labels":[],"label_agreement":null},{"id":"W4360979776","doi":"10.1007/s10474-023-01301-1","title":"Smaller Gershgorin disks for multiple eigenvalues of complex matrices","year":2023,"lang":"en","type":"article","venue":"Acta Mathematica Academiae Scientiarum Hungaricae","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Eigenvalues and eigenvectors; Mathematics; Normal matrix; Spectrum of a matrix; Matrix (chemical analysis); Pure mathematics; Complex matrix; Combinatorics; Mathematical analysis; Matrix differential equation; Chemistry; Physics; Quantum mechanics; Chromatography","score_opus":0.058257356568287705,"score_gpt":0.3074060863680185,"score_spread":0.24914872979973082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360979776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7425045,0.0026069179,0.2142518,0.0017873045,0.00049934763,0.00007616506,0.00031879407,0.00038325496,0.037571896],"genre_scores_gemma":[0.9635379,0.0005203662,0.025595387,0.00019289885,0.00020044557,0.00009305589,0.0001767683,0.00016069938,0.009522477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918264,0.0002702925,0.000043524637,0.00018798062,0.00021189965,0.000103644394],"domain_scores_gemma":[0.99309546,0.0046735746,0.0006070762,0.0005334576,0.00039475976,0.00069559395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092999305,0.00091896206,0.0011327313,0.0031473644,0.0010750756,0.0027882298,0.001397442,0.0014366754,0.012774886],"category_scores_gemma":[0.0119939055,0.00044916128,0.0005513776,0.0007732287,0.0019105059,0.0027196347,0.0023098467,0.0018768384,0.0012968453],"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.00094970595,0.000118879616,0.0011967343,0.00034566078,0.000046414018,0.0008444137,0.0011597443,0.009833395,0.016139451,0.93371564,0.004382973,0.031267036],"study_design_scores_gemma":[0.0001896645,0.00016223296,0.0020977752,0.00006321996,0.000029686033,0.0011353755,0.00081714377,0.065975,0.00594228,0.91662955,0.0068977647,0.0000602897],"about_ca_topic_score_codex":0.00024343262,"about_ca_topic_score_gemma":0.00020580892,"teacher_disagreement_score":0.012774886,"about_ca_system_score_codex":0.00062605244,"about_ca_system_score_gemma":0.00025400307,"threshold_uncertainty_score":0.042736232},"labels":[],"label_agreement":null},{"id":"W4362580740","doi":"10.28924/2291-8639-21-2023-31","title":"A Combined Conjugate Gradient Quasi-Newton Method with Modification BFGS Formula","year":2023,"lang":"en","type":"article","venue":"International Journal of 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":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Conjugate gradient method; Conjugate residual method; Derivation of the conjugate gradient method; Nonlinear conjugate gradient method; Biconjugate gradient method; Broyden–Fletcher–Goldfarb–Shanno algorithm; Gradient descent; Conjugate; Mathematics; Gradient method; Biconjugate gradient stabilized method; Convergence (economics); Newton's method in optimization; Applied mathematics; Mathematical optimization; Mathematical analysis; Computer science; Iterative method; Local convergence; Artificial intelligence","score_opus":0.014359913905572676,"score_gpt":0.3096878841327451,"score_spread":0.29532797022717244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362580740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023322336,0.0002544496,0.99379903,0.00017780463,0.0001525841,0.000073928044,0.000055269575,0.00027975687,0.0028749406],"genre_scores_gemma":[0.09341534,0.00062136335,0.8929625,0.00024045457,0.00015619725,0.00036463345,0.00022519272,0.0002959538,0.011718363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999376,0.00017619932,0.000031133965,0.000075643606,0.00030194083,0.000039184444],"domain_scores_gemma":[0.99959344,0.00010673696,0.000028648275,0.000042329317,0.00020161185,0.000027243983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062429026,0.0006635914,0.0010819543,0.0006930563,0.0006618485,0.0008019984,0.0012102287,0.0010893205,0.0046814624],"category_scores_gemma":[0.0014888566,0.00043791052,0.0007159642,0.0008343701,0.0006115644,0.0010633963,0.0009066405,0.0012045491,0.0013405904],"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.00019801503,0.00013045064,0.0016580102,0.0006363969,0.00016403581,0.00032179215,0.00021066362,0.49096704,0.01829102,0.0984745,0.015650792,0.3732973],"study_design_scores_gemma":[0.00005505775,0.000054241285,0.00021783884,0.000027736309,0.000022213628,0.00012276701,0.000015092659,0.9676771,0.0032251822,0.011719941,0.016839238,0.000023545606],"about_ca_topic_score_codex":0.0056459387,"about_ca_topic_score_gemma":0.005451211,"teacher_disagreement_score":0.0056459387,"about_ca_system_score_codex":0.00048462156,"about_ca_system_score_gemma":0.0018890917,"threshold_uncertainty_score":0.01566106},"labels":[],"label_agreement":null},{"id":"W4362708131","doi":"10.2139/ssrn.4412953","title":"Block Regularisation of the Logarithm Central Problem","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Logarithm; Block (permutation group theory); Mathematics; Arithmetic; Computer science; Combinatorics; Mathematical analysis","score_opus":0.010995496931592462,"score_gpt":0.2279033973948471,"score_spread":0.21690790046325464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362708131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19443688,0.0012918011,0.69978654,0.005683158,0.0007848728,0.00011423923,0.0006535136,0.00091117114,0.0963379],"genre_scores_gemma":[0.8669669,0.0008561863,0.072532244,0.0011440612,0.0015834961,0.00031668984,0.00085014047,0.0008486205,0.054901637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983639,0.00069496944,0.000051663992,0.00025557523,0.00042188622,0.00021196662],"domain_scores_gemma":[0.9925443,0.0048293755,0.00051826314,0.0010654372,0.0005509506,0.00049182476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019389588,0.00061613304,0.0014964439,0.0011760108,0.00096234464,0.0026202756,0.0019577388,0.001643307,0.015629206],"category_scores_gemma":[0.014357347,0.00042892032,0.00066145154,0.0012622073,0.0029838968,0.0048787384,0.003401043,0.0040111276,0.0020775225],"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.0002460714,0.00008625061,0.00025643708,0.000108229244,0.000018147566,0.00008189643,0.00012968696,0.014632466,0.0012659396,0.9639091,0.0072772084,0.011988435],"study_design_scores_gemma":[0.000038180122,0.000023607196,0.00009317774,0.000012877359,0.000005045848,0.00004620641,0.00002545543,0.086952984,0.00051922293,0.91074955,0.0015227606,0.000010976021],"about_ca_topic_score_codex":0.0009573623,"about_ca_topic_score_gemma":0.0008784729,"teacher_disagreement_score":0.015629206,"about_ca_system_score_codex":0.0011335128,"about_ca_system_score_gemma":0.0012228662,"threshold_uncertainty_score":0.052284896},"labels":[],"label_agreement":null},{"id":"W4362728446","doi":"10.52326/ic-ecco.2022/cs.09","title":"An Inverse Stochastic Optimal Control Problem","year":2022,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Polytechnique Montréal","funders":"","keywords":"Bellman equation; Inverse; Inverse problem; Interval (graph theory); Value (mathematics); Function (biology); Mathematics; Mathematical optimization; Optimal control; Probability density function; Poisson distribution; Stochastic process; Inverse function; Applied mathematics; Control (management); Computer science; Combinatorics; Mathematical analysis; Statistics; Artificial intelligence","score_opus":0.008049577818957074,"score_gpt":0.22277256580863283,"score_spread":0.21472298798967576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362728446","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034653664,0.0006511721,0.9480786,0.0014736551,0.00019167167,0.00007695637,0.00011698232,0.000119435856,0.014637888],"genre_scores_gemma":[0.8372822,0.0010416288,0.13767587,0.000611786,0.00031243754,0.0003293094,0.00022664663,0.000116045376,0.022404138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992231,0.00023865665,0.000026923437,0.000287108,0.00014339139,0.00008074808],"domain_scores_gemma":[0.99820936,0.0012407813,0.00016349838,0.0000642857,0.00018629235,0.00013579022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017519547,0.0009861769,0.0014133616,0.000647638,0.000624564,0.0015200619,0.0012634594,0.0028064356,0.004279304],"category_scores_gemma":[0.00595312,0.00048170344,0.0009241777,0.00046783726,0.0023679412,0.0016551298,0.001465526,0.0025193887,0.00026718026],"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.00012067021,0.0001102915,0.0006663975,0.00025382932,0.00008097908,0.0002932437,0.00019570593,0.58828765,0.0035792156,0.38290164,0.0020056567,0.021504853],"study_design_scores_gemma":[0.000042954995,0.00014422776,0.00017658756,0.000032133383,0.000033848464,0.00006932449,0.00003586068,0.886504,0.0009614991,0.10932332,0.0026498784,0.000026345728],"about_ca_topic_score_codex":0.003783275,"about_ca_topic_score_gemma":0.0012259217,"teacher_disagreement_score":0.004279304,"about_ca_system_score_codex":0.0012765493,"about_ca_system_score_gemma":0.0018096992,"threshold_uncertainty_score":0.014315724},"labels":[],"label_agreement":null},{"id":"W4366086133","doi":"10.1016/j.laa.2023.04.004","title":"Extrapolation methods as nonlinear Krylov subspace methods","year":2023,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Mathematics; Extrapolation; Krylov subspace; Equivalence (formal languages); Nonlinear system; Variety (cybernetics); Applied mathematics; Subspace topology; Richardson extrapolation; Mathematical analysis; Linear system; Pure mathematics; Statistics","score_opus":0.028120255764002504,"score_gpt":0.3821201739709335,"score_spread":0.353999918206931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366086133","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012695,0.0012070807,0.9692227,0.00034167786,0.0003342037,0.00006554023,0.00010604945,0.0003010573,0.015726687],"genre_scores_gemma":[0.41304174,0.0045714877,0.5114963,0.0007161376,0.00074421195,0.00036529804,0.0005316232,0.00082480715,0.06770841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953115,0.00023154441,0.00001851526,0.00004106278,0.0001541392,0.000023608003],"domain_scores_gemma":[0.99931,0.00029984172,0.000063140586,0.00012206038,0.00015756098,0.000047339385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007914773,0.00070074847,0.0007086087,0.00084623345,0.0004268859,0.0008715143,0.00084496796,0.0009736787,0.00537591],"category_scores_gemma":[0.002719221,0.00029477887,0.00054860656,0.00080541294,0.0011236646,0.0021256113,0.0017483758,0.002111827,0.0018660314],"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.00018032378,0.00011965686,0.00043182776,0.00043164412,0.00006422275,0.00011381145,0.00026216882,0.13154106,0.013821016,0.71122575,0.0067029055,0.13510574],"study_design_scores_gemma":[0.000015396494,0.000054343476,0.00017518282,0.00007127202,0.0000151479535,0.00009359554,0.000051041916,0.7134568,0.003750773,0.26869604,0.013594721,0.000025653522],"about_ca_topic_score_codex":0.00055777933,"about_ca_topic_score_gemma":0.00073140056,"teacher_disagreement_score":0.00537591,"about_ca_system_score_codex":0.00025675786,"about_ca_system_score_gemma":0.0004318809,"threshold_uncertainty_score":0.017984271},"labels":[],"label_agreement":null},{"id":"W4367182219","doi":"10.1080/10556788.2023.2189716","title":"Properties of semi-conjugate gradient methods for solving unsymmetric positive definite linear systems","year":2023,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"National Natural Science Foundation of China","keywords":"Conjugate gradient method; Orthogonalization; Conjugate; Derivation of the conjugate gradient method; Mathematics; Conjugate residual method; Linear system; Nonlinear conjugate gradient method; Krylov subspace; Positive-definite matrix; Mathematical analysis; Applied mathematics; Algorithm; Computer science; Gradient descent; Physics","score_opus":0.04614607138990487,"score_gpt":0.34296162124064855,"score_spread":0.29681554985074365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367182219","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005957441,0.0003198719,0.99066585,0.00015842739,0.000045282977,0.00004637545,0.000021888127,0.0001189857,0.0026658801],"genre_scores_gemma":[0.34554923,0.0017158497,0.64309263,0.0003471807,0.00020485323,0.00065885833,0.00021106872,0.000601422,0.007618966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990343,0.0003954242,0.000051643987,0.00008004118,0.00039147388,0.00004708597],"domain_scores_gemma":[0.9963575,0.0021487623,0.00027477165,0.00028867694,0.00078874256,0.00014147998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002711476,0.0010074127,0.00075328536,0.00097040215,0.0005448179,0.0011507192,0.0008646709,0.0010088398,0.0042677014],"category_scores_gemma":[0.007434211,0.0005304787,0.00094207004,0.0007769127,0.0022393877,0.0017477858,0.0015612101,0.0020488708,0.0011184515],"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.00029002797,0.00014353565,0.0020317344,0.0006678007,0.0001411934,0.00023819516,0.0006458282,0.35037452,0.025930349,0.46113494,0.004782991,0.15361895],"study_design_scores_gemma":[0.000017956185,0.00007740449,0.00016907822,0.000021778556,0.0000095789155,0.00006653183,0.000021269716,0.9564025,0.003220371,0.03740593,0.002570165,0.00001746685],"about_ca_topic_score_codex":0.00095428695,"about_ca_topic_score_gemma":0.0008679508,"teacher_disagreement_score":0.0042677014,"about_ca_system_score_codex":0.0003717464,"about_ca_system_score_gemma":0.0010258151,"threshold_uncertainty_score":0.014339805},"labels":[],"label_agreement":null},{"id":"W4377078708","doi":"10.1007/16618_2023_46","title":"Matrices over Quaternion Algebras","year":2023,"lang":"en","type":"book-chapter","venue":"Mathematics online first collections","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Quaternion; Mathematics; Algebra over a field; Eigenvalues and eigenvectors; Matrix (chemical analysis); Singular value decomposition; Pure mathematics; Sylvester matrix; Applied mathematics; Mathematical analysis; Algorithm; Geometry; Physics","score_opus":0.025640847937191392,"score_gpt":0.2577561190613643,"score_spread":0.2321152711241729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377078708","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019394349,0.008611288,0.039159395,0.0013517949,0.0035315559,0.000033723543,0.00037353078,0.0007723936,0.9442268],"genre_scores_gemma":[0.024282273,0.010216318,0.012105665,0.00037313913,0.002151139,0.000054234006,0.0005465231,0.0005259138,0.9497448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997472,0.000031096264,0.000009465211,0.000031723008,0.00016175394,0.000018864237],"domain_scores_gemma":[0.9998241,0.000040116814,0.00001345276,0.000032831125,0.000061560255,0.000028038547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022846943,0.001092281,0.0005680851,0.0018464299,0.00089035736,0.0034279127,0.000699038,0.00046683362,0.09286267],"category_scores_gemma":[0.00068499695,0.0004674601,0.0002913281,0.0029158997,0.0009248895,0.0034680858,0.0010938294,0.001803982,0.039592016],"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.000011889106,0.000022491222,0.0000375344,0.0001764058,0.000005659857,0.000027737273,0.0001750699,0.0007453179,0.0012712536,0.61756074,0.2203266,0.15963922],"study_design_scores_gemma":[0.000004462721,0.000013368494,0.000105323794,0.0000770436,0.0000036803358,0.00009500776,0.0000536317,0.0012995858,0.00089822576,0.22946626,0.76797354,0.00000993001],"about_ca_topic_score_codex":0.0007764705,"about_ca_topic_score_gemma":0.0015375738,"teacher_disagreement_score":0.09286267,"about_ca_system_score_codex":0.0010552162,"about_ca_system_score_gemma":0.00065235596,"threshold_uncertainty_score":0.31065655},"labels":[],"label_agreement":null},{"id":"W4380323855","doi":"10.1007/978-981-99-2295-6_4","title":"Matrix Calculus","year":2023,"lang":"en","type":"book-chapter","venue":"Behaviormetrics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Notation; Variable (mathematics); Calculus (dental); Matrix (chemical analysis); Expression (computer science); Mathematics; Algebra over a field; Computer science; Pure mathematics; Arithmetic; Programming language; Mathematical analysis","score_opus":0.04039444585117397,"score_gpt":0.2852916901221754,"score_spread":0.24489724427100146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380323855","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024281167,0.005017973,0.12599793,0.0027626068,0.0013872096,0.000032767915,0.00038365863,0.0006141351,0.86137563],"genre_scores_gemma":[0.09667577,0.006359261,0.038008317,0.0012732515,0.0023527823,0.000121616285,0.0005746908,0.00069312885,0.8539412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953973,0.00008544143,0.00001363542,0.00008786314,0.00024165836,0.000031790678],"domain_scores_gemma":[0.99974245,0.0000670604,0.000015871741,0.000054034448,0.000092498,0.000028084747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033844227,0.0008451291,0.000572814,0.0013617235,0.0012057935,0.0033292703,0.00079157413,0.0006162038,0.039977264],"category_scores_gemma":[0.0012049025,0.0003134873,0.00035297594,0.0018281735,0.0018073922,0.0035341159,0.0011526884,0.0020553882,0.01671427],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002889703,0.00000685044,0.000014788938,0.000023011415,0.00000163276,0.0000066556945,0.00005161305,0.00018414094,0.00018479009,0.94743365,0.030792387,0.02129752],"study_design_scores_gemma":[0.000002065459,0.000004696587,0.00005255884,0.000016593161,0.000002425612,0.000045028515,0.000033342578,0.0013542196,0.00025376162,0.79740906,0.20082144,0.000004743514],"about_ca_topic_score_codex":0.0012131528,"about_ca_topic_score_gemma":0.001361765,"teacher_disagreement_score":0.039977264,"about_ca_system_score_codex":0.0014594197,"about_ca_system_score_gemma":0.0006984836,"threshold_uncertainty_score":0.1337372},"labels":[],"label_agreement":null},{"id":"W4380631182","doi":"10.2298/fil2303863t","title":"Least-squares solutions of the generalized reduced biquaternion matrix equations","year":2023,"lang":"en","type":"article","venue":"Filomat","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Fundo para o Desenvolvimento das Ciências e da Tecnologia; Natural Sciences and Engineering Research Council of Canada; Wuyi University; National Natural Science Foundation of China","keywords":"Mathematics; Matrix (chemical analysis); Representation (politics); Applied mathematics; Matrix representation; Least-squares function approximation; Linear least squares; Algebra over a field; Algorithm; Pure mathematics; Singular value decomposition; Statistics; Group (periodic table)","score_opus":0.03741046237186088,"score_gpt":0.2818658222731792,"score_spread":0.2444553599013183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380631182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002757725,0.00016320859,0.9955207,0.00009915306,0.00003538403,0.0000127115645,0.000032542255,0.00011326735,0.0012653631],"genre_scores_gemma":[0.11496588,0.0007780036,0.8752133,0.00014452894,0.00008486838,0.000115826886,0.00030185253,0.0001933513,0.0082023665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934715,0.0002290785,0.000037986647,0.00013658046,0.00020936356,0.000039873114],"domain_scores_gemma":[0.9993395,0.00023792016,0.000101439924,0.00009830919,0.00020742962,0.000015321215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009111762,0.0009844482,0.0007083046,0.0004956021,0.00028585078,0.0008583913,0.0008850115,0.00085299934,0.003971719],"category_scores_gemma":[0.003175845,0.0003454608,0.0005435051,0.0008199977,0.0006904662,0.0014714439,0.000805035,0.0011729035,0.0014857167],"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.000087464825,0.00003958526,0.00058427645,0.00044045996,0.00009902664,0.00018530895,0.00024839304,0.5461881,0.022351122,0.19576037,0.0064255153,0.22759035],"study_design_scores_gemma":[0.000012557947,0.000029643763,0.00020515737,0.000020983605,0.000010578888,0.00011185371,0.000047395595,0.9534857,0.0039561996,0.03444536,0.0076504983,0.000024134919],"about_ca_topic_score_codex":0.0017555718,"about_ca_topic_score_gemma":0.0019135891,"teacher_disagreement_score":0.003971719,"about_ca_system_score_codex":0.0003361039,"about_ca_system_score_gemma":0.0007231909,"threshold_uncertainty_score":0.013286769},"labels":[],"label_agreement":null},{"id":"W4382862786","doi":"10.1007/jhep05(2023)001","title":"Bridging positivity and S-matrix bootstrap bounds","year":2023,"lang":"en","type":"article","venue":"Journal of High Energy Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Università degli Studi di Padova; European Commission; Israel Science Foundation; Aspen Center for Physics; National Science Foundation","keywords":"Unitarity; Physics; Scattering amplitude; S-matrix; Matrix (chemical analysis); Mathematical physics; Observable; Effective field theory; Cutoff; Amplitude; Theoretical physics; Scattering; Statistical physics; Quantum mechanics","score_opus":0.012796525841338422,"score_gpt":0.2519342932597618,"score_spread":0.23913776741842338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382862786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25740474,0.0004905021,0.6813872,0.00096290413,0.00013227311,0.00004256864,0.000076459466,0.00036184312,0.05914156],"genre_scores_gemma":[0.9582485,0.00014619375,0.03870579,0.0001742091,0.00010470479,0.000062832434,0.000044347318,0.0001256877,0.0023877337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807525,0.0009707208,0.000061820356,0.00019364728,0.00048550204,0.00021296003],"domain_scores_gemma":[0.99255896,0.0048902608,0.00049497123,0.0009486651,0.00068863865,0.00041856428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022260924,0.0007006016,0.00064767443,0.001263871,0.00090571697,0.0016919901,0.0011814687,0.0009928657,0.006855504],"category_scores_gemma":[0.010149317,0.00024751615,0.00047339927,0.00059322425,0.0034556754,0.0036224702,0.0032583524,0.0022035295,0.00068689836],"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.000051184437,0.000048234248,0.00033492094,0.000041797834,0.000005891082,0.00016642426,0.00018618771,0.007885342,0.004170711,0.97968286,0.00051159033,0.0069149327],"study_design_scores_gemma":[0.000010424508,0.00004153804,0.00019263127,0.000024289677,0.0000036048339,0.00011680858,0.000073699695,0.17253473,0.0034474113,0.8225028,0.0010367872,0.000015268884],"about_ca_topic_score_codex":0.00031869122,"about_ca_topic_score_gemma":0.00035852415,"teacher_disagreement_score":0.006855504,"about_ca_system_score_codex":0.00052020577,"about_ca_system_score_gemma":0.0004102507,"threshold_uncertainty_score":0.02293402},"labels":[],"label_agreement":null},{"id":"W4384111622","doi":"10.48550/arxiv.2307.04871","title":"LSEMINK: A Modified Newton-Krylov Method for Log-Sum-Exp Minimization","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Air Force Office of Scientific Research; Canadian Institute for Advanced Research; Advanced Scientific Computing Research; U.S. Department of Energy; National Science Foundation","keywords":"Krylov subspace; Mathematics; Hessian matrix; Mathematical optimization; Newton's method in optimization; Iterated function; Applied mathematics; Line search; Function (biology); Computer science; Bounded function; Algorithm; Local convergence; Iterative method; Mathematical analysis","score_opus":0.10933534742959782,"score_gpt":0.2362211435235257,"score_spread":0.12688579609392786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384111622","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010039452,0.00012629632,0.9971835,0.0000895675,0.000043614513,0.000032116906,0.000043665492,0.0005514734,0.0009258406],"genre_scores_gemma":[0.048207004,0.0003036441,0.9426708,0.00030088803,0.00009288456,0.00036216952,0.00047253363,0.0012676332,0.0063224332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992311,0.00025779734,0.000039490413,0.00009929253,0.0003059242,0.00006636555],"domain_scores_gemma":[0.99904996,0.0004935659,0.000078873665,0.00009835065,0.00021029028,0.00006898734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001311964,0.0015312334,0.001560505,0.00085471483,0.00051722216,0.0010619856,0.0024511,0.0016969498,0.006782373],"category_scores_gemma":[0.0038648944,0.0008806877,0.0011036242,0.0007241812,0.0011145348,0.0015982151,0.0026083207,0.0026652985,0.0030794996],"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.00013765856,0.00010041125,0.0006218154,0.00037641995,0.00009436335,0.00015523474,0.0001383065,0.73804927,0.004708769,0.059440598,0.013376024,0.18280107],"study_design_scores_gemma":[0.000011564542,0.000015693524,0.00003483209,0.00001146691,0.0000029347464,0.000019620162,0.0000070438246,0.98794657,0.0005541782,0.0077109486,0.003674985,0.000010218304],"about_ca_topic_score_codex":0.0042127683,"about_ca_topic_score_gemma":0.006174941,"teacher_disagreement_score":0.006782373,"about_ca_system_score_codex":0.0008130749,"about_ca_system_score_gemma":0.0025036691,"threshold_uncertainty_score":0.022689342},"labels":[],"label_agreement":null},{"id":"W4384568967","doi":"10.23952/jnva.7.2023.2.05","title":"A Hankel matrix acting on Fock spaces","year":2023,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Fujian Province; Basic and Applied Basic Research Foundation of Guangdong Province; Guangdong Polytechnic Normal University","keywords":"Fock space; Hankel matrix; Matrix (chemical analysis); Pure mathematics; Algebra over a field; Mathematics; Physics; Materials science; Quantum mechanics; Mathematical analysis; Composite material","score_opus":0.016741619357980877,"score_gpt":0.2918085050641464,"score_spread":0.27506688570616555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384568967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.401025,0.0011407367,0.5453005,0.0011383244,0.00033641263,0.00008179123,0.00042613538,0.0003264472,0.0502247],"genre_scores_gemma":[0.9472421,0.00056637777,0.03376748,0.0002856478,0.0002166555,0.00009575215,0.00016759492,0.00007562809,0.017582832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927956,0.00016992187,0.00002278374,0.0001506802,0.00020207108,0.00017506116],"domain_scores_gemma":[0.99875176,0.000435685,0.00018048717,0.0001415419,0.0002092049,0.0002812844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009800624,0.0005906519,0.000605479,0.00089923094,0.00078605046,0.0018509271,0.0008058079,0.0011181553,0.0056839227],"category_scores_gemma":[0.0025188928,0.000270572,0.00045198094,0.0006725342,0.0017897512,0.0022138425,0.0011375156,0.0008312834,0.0007402661],"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.00006229569,0.000063254134,0.0005246466,0.00007536082,0.000027538083,0.00021439983,0.0003355337,0.0115238195,0.011749123,0.9639772,0.001192652,0.010254185],"study_design_scores_gemma":[0.000042789266,0.000168913,0.001310979,0.000038504048,0.000014957065,0.00051011884,0.00023805178,0.22576582,0.004572355,0.7624959,0.0047432478,0.00009840129],"about_ca_topic_score_codex":0.0011464718,"about_ca_topic_score_gemma":0.0006638109,"teacher_disagreement_score":0.0056839227,"about_ca_system_score_codex":0.0008103549,"about_ca_system_score_gemma":0.0008559549,"threshold_uncertainty_score":0.019014657},"labels":[],"label_agreement":null},{"id":"W4385153555","doi":"10.2139/ssrn.4517396","title":"Edge Addition and the Change in Kemeny's Constant","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; University of Manitoba","funders":"","keywords":"Constant (computer programming); Enhanced Data Rates for GSM Evolution; Mathematics; Mathematical economics; Computer science; Telecommunications; Programming language","score_opus":0.02153372780140714,"score_gpt":0.2592368941671936,"score_spread":0.23770316636578645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385153555","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5378261,0.008328007,0.14252828,0.014392381,0.003105055,0.000088808345,0.0006161896,0.0008362205,0.29227895],"genre_scores_gemma":[0.9326434,0.0020810172,0.01852935,0.0010370235,0.00088575884,0.00005592426,0.0001221533,0.0002840957,0.044361267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991897,0.0001872848,0.00003237446,0.00020435822,0.00018919991,0.00019710074],"domain_scores_gemma":[0.9951692,0.002931825,0.00042680485,0.00049998716,0.0004408485,0.00053124974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015132893,0.0006223646,0.00071811397,0.0026263376,0.0017358897,0.0027585863,0.0020998528,0.0017338449,0.017381314],"category_scores_gemma":[0.012813931,0.00036584347,0.0004708123,0.0021130322,0.0035276483,0.0072049126,0.0023761515,0.0031071617,0.0017101322],"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.00026299348,0.000048804293,0.00048127063,0.0000853407,0.00001379423,0.00014951642,0.00023687491,0.0028541724,0.0022650028,0.96402687,0.0056192074,0.023956079],"study_design_scores_gemma":[0.00003647815,0.000035567475,0.0007735663,0.000028850043,0.000019912237,0.00027828116,0.00011225352,0.010280539,0.001998531,0.97896576,0.007438002,0.000032125303],"about_ca_topic_score_codex":0.00090415205,"about_ca_topic_score_gemma":0.000814452,"teacher_disagreement_score":0.017381314,"about_ca_system_score_codex":0.0011936681,"about_ca_system_score_gemma":0.0007775586,"threshold_uncertainty_score":0.058146298},"labels":[],"label_agreement":null},{"id":"W4385421358","doi":"10.1080/02331888.2023.2234061","title":"Corrigendum: a note on Liu-type shrinkage estimations in linear models (Statistics 56, 396–420)","year":2023,"lang":"en","type":"erratum","venue":"Statistics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Mathematical proof; Lemma (botany); Shrinkage; Type (biology); Statistics; Applied mathematics; Econometrics; Geometry; Geology","score_opus":0.04013834754659119,"score_gpt":0.3089128753775747,"score_spread":0.26877452783098355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385421358","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008393721,0.0096796965,0.041261937,0.20790727,0.72533065,0.000069290174,0.0012492118,0.0015442487,0.0121182315],"genre_scores_gemma":[0.05673738,0.020030191,0.06203305,0.3219251,0.39220956,0.0008608841,0.0018347915,0.004293165,0.14007595],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98944014,0.003908777,0.0011903465,0.0018189971,0.0032868593,0.00035495454],"domain_scores_gemma":[0.9557968,0.02160803,0.0013143595,0.0046188463,0.016083127,0.000578777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012110919,0.0017478657,0.0021907256,0.0033019516,0.0026771163,0.00288573,0.003738342,0.004841528,0.015154459],"category_scores_gemma":[0.11923546,0.0009583465,0.0019064215,0.0038159946,0.003869047,0.004145978,0.002179996,0.01011899,0.014533319],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003547003,0.000015425172,0.00020197412,0.0001381327,0.000036720012,0.00021728195,0.000056617904,0.000341795,0.00010387847,0.0113708,0.9723227,0.01515921],"study_design_scores_gemma":[0.000062071216,0.00006616534,0.0026026783,0.0004994638,0.00015860195,0.0007143175,0.0001052975,0.009151316,0.0012229171,0.070969656,0.91422933,0.00021826287],"about_ca_topic_score_codex":0.015025119,"about_ca_topic_score_gemma":0.012112881,"teacher_disagreement_score":0.015154459,"about_ca_system_score_codex":0.0044522095,"about_ca_system_score_gemma":0.0022320282,"threshold_uncertainty_score":0.06404942},"labels":[],"label_agreement":null},{"id":"W4385552099","doi":"10.1007/s11075-023-01612-y","title":"Incomplete double-cone factorizations of centrosymmetric matrices arising in spectral methods","year":2023,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Biharmonic equation; Cone (formal languages); Theory of computation; Type (biology); Helmholtz equation; Helmholtz free energy; Partial differential equation; Mathematical analysis; Numerical analysis; Applied mathematics; Pure mathematics; Algorithm; Boundary value problem; Physics","score_opus":0.03775475680054412,"score_gpt":0.3341415677504152,"score_spread":0.29638681094987107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385552099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02103648,0.00026699074,0.9722668,0.00020838779,0.00010962274,0.00003292294,0.00009533302,0.00010039182,0.0058829654],"genre_scores_gemma":[0.41597793,0.0011745992,0.56891286,0.0002496817,0.00022853506,0.00017834402,0.00045625138,0.0003295682,0.012492274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991014,0.00028115083,0.000038154056,0.00009372967,0.0004194036,0.00006631139],"domain_scores_gemma":[0.9965274,0.0015216904,0.0003359085,0.00038892095,0.0009364886,0.00028959263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020009761,0.0009872909,0.000690976,0.0010125804,0.0007842215,0.0018773914,0.0012135688,0.0008770341,0.0053445585],"category_scores_gemma":[0.009092574,0.00044835018,0.0004331147,0.0011628302,0.0016262176,0.0025410773,0.0012630984,0.0020432342,0.0010297259],"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.00010425191,0.00007426612,0.00065281155,0.00019431754,0.000022409591,0.00016588524,0.00023993252,0.11981985,0.0036558749,0.8248705,0.004900957,0.045298982],"study_design_scores_gemma":[0.0000126635,0.000018226938,0.0001295841,0.000036211037,0.000004109606,0.00006222402,0.000078310106,0.71593946,0.0014203998,0.2796817,0.002600366,0.000016786655],"about_ca_topic_score_codex":0.0024606967,"about_ca_topic_score_gemma":0.0035737474,"teacher_disagreement_score":0.0053445585,"about_ca_system_score_codex":0.0006742037,"about_ca_system_score_gemma":0.0011904915,"threshold_uncertainty_score":0.017879367},"labels":[],"label_agreement":null},{"id":"W4385705720","doi":"10.4208/cicp.oa-2021-0209","title":"Frozen Gaussian Approximation for the Dirac Equation in Curved Space with Application to Strained Graphene","year":2023,"lang":"en","type":"article","venue":"Communications in Computational Physics","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":"Université de Montréal; Carleton University; Montfort Hospital","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Graphene; Gaussian; Space (punctuation); Dirac equation; Physics; Dirac (video compression format); Mathematical physics; Mathematical analysis; Mathematics; Quantum mechanics; Computer science","score_opus":0.05217953630946944,"score_gpt":0.3186634875438501,"score_spread":0.2664839512343807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385705720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065997414,0.00044708155,0.9266941,0.00033281994,0.00008094586,0.000042836917,0.00008187675,0.0002722996,0.0060507557],"genre_scores_gemma":[0.6912795,0.0010334691,0.3002878,0.0003170265,0.00006651329,0.0001445021,0.00017757544,0.00022418734,0.0064694746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982685,0.00006369398,0.000007377066,0.000014760416,0.00006130153,0.000026038815],"domain_scores_gemma":[0.9994723,0.00023320188,0.000032973807,0.0000903139,0.00012319114,0.00004797395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007237542,0.0004921155,0.00043385685,0.00058561,0.0005031689,0.00078999466,0.0012283067,0.0010406025,0.0015319291],"category_scores_gemma":[0.0017720509,0.00021706602,0.00057312316,0.0006348317,0.0011156448,0.0010776586,0.0007522291,0.00084795756,0.0004214682],"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.000046967292,0.000035682784,0.00042096854,0.000059129194,0.00002486842,0.00021819804,0.00011683778,0.69464034,0.004489864,0.29077956,0.00058634224,0.00858127],"study_design_scores_gemma":[0.0000021017504,0.0000041125445,0.000027954446,0.0000030362166,0.0000010867258,0.000009296513,0.000007735002,0.98493654,0.00023199564,0.014588922,0.00018378637,0.0000034734985],"about_ca_topic_score_codex":0.006325768,"about_ca_topic_score_gemma":0.005594542,"teacher_disagreement_score":0.006325768,"about_ca_system_score_codex":0.0007343003,"about_ca_system_score_gemma":0.0009945717,"threshold_uncertainty_score":0.012577951},"labels":[],"label_agreement":null},{"id":"W4385839037","doi":"10.4153/s0008439523000620","title":"Block perturbation of symplectic matrices in Williamson’s theorem","year":2023,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Symplectic geometry; Mathematics; Symplectic matrix; Eigenvalues and eigenvectors; Block matrix; Diagonal matrix; Symplectic vector space; Matrix (chemical analysis); Diagonal; Symplectic group; Block (permutation group theory); Combinatorics; Moment map; Symplectic representation; Pure mathematics; Physics; Geometry; Quantum mechanics","score_opus":0.010419434650664625,"score_gpt":0.22045401219324653,"score_spread":0.21003457754258192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385839037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44420496,0.0008095568,0.44023257,0.0014001275,0.00052191835,0.00010528823,0.0001499702,0.00023059224,0.112344995],"genre_scores_gemma":[0.956387,0.00026908383,0.019781195,0.00026543328,0.00014496161,0.00006630987,0.00005920466,0.000079271296,0.022947595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962986,0.000098042685,0.000011985818,0.00006894823,0.00013672546,0.00005439154],"domain_scores_gemma":[0.9995301,0.00018100804,0.00007265253,0.00006463329,0.00009356961,0.000058095866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000527486,0.00033580107,0.00032492678,0.0004917195,0.0005720736,0.000655666,0.00040261223,0.0004948751,0.0049964394],"category_scores_gemma":[0.0018223381,0.0001878936,0.00036929906,0.00025251321,0.0012937807,0.0010981911,0.0009087874,0.0006004279,0.0006783236],"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.00005038488,0.000015598924,0.00022153159,0.000024179357,0.000007952909,0.00014284221,0.00015420876,0.009370394,0.005915548,0.97674495,0.0015770862,0.005775259],"study_design_scores_gemma":[0.000024152641,0.00007877827,0.00044296723,0.000013211428,0.0000074414997,0.00016405404,0.00007658496,0.21301478,0.005292321,0.7734156,0.0074478444,0.000022354167],"about_ca_topic_score_codex":0.0009649906,"about_ca_topic_score_gemma":0.00060189446,"teacher_disagreement_score":0.0049964394,"about_ca_system_score_codex":0.00057524355,"about_ca_system_score_gemma":0.000403066,"threshold_uncertainty_score":0.016714811},"labels":[],"label_agreement":null},{"id":"W4386248569","doi":"10.1017/9781009303897.005","title":"Matrices","year":2023,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Guelph","funders":"","keywords":"Eigenvalues and eigenvectors; Linear algebra; Algebra over a field; Gauss–Seidel method; Applied mathematics; Mathematics; Calculus (dental); Pure mathematics; Iterative method; Mathematical optimization; Physics; Quantum mechanics; Geometry","score_opus":0.021972524315619586,"score_gpt":0.19869956337316508,"score_spread":0.1767270390575455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386248569","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022578214,0.029527372,0.13488008,0.0046179183,0.011370738,0.00018521945,0.0036151486,0.0022126776,0.81133306],"genre_scores_gemma":[0.0227391,0.01864119,0.058414254,0.0021555193,0.0030753142,0.00025124158,0.0044808094,0.0010290284,0.8892135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953735,0.00005588563,0.000026991196,0.00010616938,0.00023506682,0.000038534487],"domain_scores_gemma":[0.9996941,0.000058968555,0.000019301926,0.000066081404,0.00013068679,0.000030786206],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029230298,0.0011834268,0.0006305781,0.0013813778,0.0011733142,0.0029077248,0.0009945645,0.0009530962,0.17979327],"category_scores_gemma":[0.0011917662,0.0004113945,0.00053526985,0.0015246354,0.00080252474,0.0023942923,0.0016523241,0.0020117548,0.09953865],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028029304,0.000036774847,0.00013571128,0.00044391962,0.000015506424,0.00011827368,0.00026295727,0.0010911459,0.0019499988,0.4617697,0.35359523,0.18055274],"study_design_scores_gemma":[0.0000025241245,0.000010975229,0.00008039645,0.00007330316,0.0000023894281,0.00015165062,0.00003806394,0.000582797,0.00045869543,0.07009726,0.92849493,0.0000070080546],"about_ca_topic_score_codex":0.00079443544,"about_ca_topic_score_gemma":0.001501058,"teacher_disagreement_score":0.82020676,"about_ca_system_score_codex":0.00076099066,"about_ca_system_score_gemma":0.00072825793,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4386572110","doi":"10.1016/j.laa.2023.08.024","title":"Numerical ranges of cyclic shift matrices","year":2023,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Mathematics; Numerical range; Combinatorics; Matrix (chemical analysis); Range (aeronautics); Set (abstract data type); Permutation (music); Conjecture; Numerical analysis; Adjacency matrix; Permutation matrix; Pure mathematics; Mathematical analysis; Computer science; Physics","score_opus":0.012967858395175232,"score_gpt":0.26313071205107824,"score_spread":0.250162853655903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386572110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26979643,0.0018793126,0.6493948,0.001385785,0.00034235758,0.000077577446,0.0006569659,0.00091245957,0.075554304],"genre_scores_gemma":[0.9200556,0.00067668885,0.07161649,0.00020981113,0.00028473965,0.00009003929,0.00037982687,0.00014160307,0.0065451534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861467,0.0004105991,0.00008759134,0.0002029655,0.0005426419,0.00014149587],"domain_scores_gemma":[0.9943777,0.0029870982,0.00056694594,0.00054467464,0.0011685111,0.00035504007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010481701,0.0004907086,0.0003280409,0.00197099,0.0005948001,0.0020632069,0.00083308783,0.000599609,0.009058923],"category_scores_gemma":[0.015987415,0.0002378801,0.00024430547,0.0018773155,0.001864383,0.0028107679,0.0017664422,0.0010900113,0.00147049],"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.00018411488,0.00003737347,0.0010265744,0.000117650925,0.000010985412,0.00015963198,0.0003289532,0.010438604,0.0070011597,0.93081635,0.0025973287,0.047281183],"study_design_scores_gemma":[0.000020728776,0.000080105594,0.0006187361,0.000074004005,0.00000967697,0.00041518387,0.00016266054,0.049898017,0.010180808,0.9294018,0.009095741,0.00004251687],"about_ca_topic_score_codex":0.00031122766,"about_ca_topic_score_gemma":0.00028106905,"teacher_disagreement_score":0.009058923,"about_ca_system_score_codex":0.00050137565,"about_ca_system_score_gemma":0.00049451436,"threshold_uncertainty_score":0.030305088},"labels":[],"label_agreement":null},{"id":"W4386746667","doi":"10.1137/22m1515884","title":"On GSOR, the Generalized Successive Overrelaxation Method for Double Saddle-Point Problems","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"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; National Natural Science Foundation of China","keywords":"Mathematics; Saddle point; Saddle; Convergence (economics); Block (permutation group theory); Mathematical analysis; Applied mathematics; Flow (mathematics); Geometry; Mathematical optimization","score_opus":0.04124037913562043,"score_gpt":0.3292415446169593,"score_spread":0.28800116548133886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386746667","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044394033,0.00031737497,0.992448,0.00013577552,0.00007405524,0.0000759069,0.0000400415,0.00022967655,0.0022399086],"genre_scores_gemma":[0.10096584,0.0011340752,0.88921565,0.00028951684,0.00014602205,0.0004895697,0.00019896777,0.0005318343,0.007028514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993585,0.00031565625,0.000027624354,0.000066686625,0.00018166986,0.00004992483],"domain_scores_gemma":[0.9993625,0.00031940397,0.00006152027,0.00008406378,0.00013016924,0.000042301217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016402113,0.0014935462,0.0017375487,0.00086742785,0.0006020712,0.0007298785,0.0013851039,0.0015146745,0.0034870845],"category_scores_gemma":[0.0025046994,0.00063467294,0.0012035175,0.00093799544,0.0016894059,0.0012567192,0.0022720615,0.0025037634,0.001244496],"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.00020842526,0.00010603465,0.0004940191,0.00053864607,0.00011422395,0.0002558722,0.0003328491,0.69044876,0.01635005,0.16309471,0.004630553,0.12342582],"study_design_scores_gemma":[0.000035391775,0.00006634395,0.00006461972,0.0000320905,0.00000810586,0.000033041564,0.00002041688,0.97734386,0.0016758726,0.015668541,0.005024689,0.000026991822],"about_ca_topic_score_codex":0.0030073496,"about_ca_topic_score_gemma":0.0034784242,"teacher_disagreement_score":0.0034870845,"about_ca_system_score_codex":0.00052294135,"about_ca_system_score_gemma":0.001178456,"threshold_uncertainty_score":0.011665463},"labels":[],"label_agreement":null},{"id":"W4386812873","doi":"10.1016/j.laa.2023.09.013","title":"Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs","year":2023,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Vlaamse regering; Fonds Wetenschappelijk Onderzoek; Villanova University; Javna Agencija za Raziskovalno Dejavnost RS; American Institute of Mathematics; National Science Foundation","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Join (topology); Inverse; Graph; Discrete mathematics; Geometry","score_opus":0.015521902688288262,"score_gpt":0.295416793634622,"score_spread":0.27989489094633374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386812873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15257065,0.0003607612,0.8386035,0.00022967819,0.00006277471,0.000044544176,0.00004706548,0.0001662493,0.00791477],"genre_scores_gemma":[0.7325388,0.00041338985,0.26311818,0.00009718137,0.00016010005,0.00011932557,0.0000877578,0.00015843718,0.0033068145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883395,0.00039886765,0.000058110192,0.00029985697,0.000281041,0.00012821291],"domain_scores_gemma":[0.9902581,0.006472673,0.00093762623,0.0010314012,0.0006034969,0.0006967026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024119057,0.00042943316,0.0008369113,0.0012674509,0.0011262852,0.0013235997,0.00095789385,0.00075646595,0.0026476195],"category_scores_gemma":[0.010158241,0.00037237935,0.0006560017,0.0008162129,0.0031507364,0.0028191751,0.0023044727,0.0016398123,0.0003052066],"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.00027531426,0.0000951085,0.0011943777,0.00009619126,0.000021073303,0.00018589225,0.00056466955,0.04816312,0.035623048,0.87934,0.00093314395,0.033508096],"study_design_scores_gemma":[0.000028862922,0.00017976675,0.0006198887,0.000024585257,0.0000131585475,0.00018645391,0.00020901294,0.32632324,0.012067592,0.6574659,0.0028418398,0.000039628954],"about_ca_topic_score_codex":0.0003353853,"about_ca_topic_score_gemma":0.00041694462,"teacher_disagreement_score":0.0026476195,"about_ca_system_score_codex":0.00058995193,"about_ca_system_score_gemma":0.0003662102,"threshold_uncertainty_score":0.012755513},"labels":[],"label_agreement":null},{"id":"W4387047368","doi":"10.21105/joss.05187","title":"Krylov.jl: A Julia basket of hand-picked Krylovmethods","year":2023,"lang":"en","type":"article","venue":"The Journal of Open Source Software","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":23,"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; Institut de Valorisation des Données","keywords":"Generalized minimal residual method; Computer science; Algorithm; Iterative method","score_opus":0.03623766752253175,"score_gpt":0.3254946060991479,"score_spread":0.2892569385766161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387047368","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029574728,0.0003514602,0.97248864,0.00024076829,0.0004981589,0.00014003552,0.0012674698,0.010995478,0.011060526],"genre_scores_gemma":[0.051764656,0.00043654314,0.9073149,0.00029506115,0.00028850383,0.00040415573,0.0028601706,0.016489679,0.02014624],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974807,0.00065495993,0.00020199222,0.00024304248,0.001118822,0.00030047825],"domain_scores_gemma":[0.9947173,0.0015918183,0.00024200376,0.0016621045,0.0012960788,0.000490649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037871285,0.0020234145,0.002041382,0.0026709856,0.0015279897,0.0035535474,0.0034087836,0.0019923777,0.058610346],"category_scores_gemma":[0.016832251,0.0017627146,0.0023253176,0.0026541916,0.0014812435,0.003925526,0.0061759767,0.0046737012,0.0372958],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001012244,0.0003707751,0.0010977681,0.0008486661,0.00028643355,0.0003743182,0.0003577056,0.031691507,0.0072788456,0.3248254,0.12077761,0.51107866],"study_design_scores_gemma":[0.0005339568,0.00017300042,0.0005327216,0.00031181608,0.000090252186,0.00025694887,0.00013401677,0.37060732,0.01396116,0.45330185,0.15990101,0.00019594705],"about_ca_topic_score_codex":0.002373569,"about_ca_topic_score_gemma":0.0057341303,"teacher_disagreement_score":0.058610346,"about_ca_system_score_codex":0.0008525009,"about_ca_system_score_gemma":0.0024353005,"threshold_uncertainty_score":0.19607115},"labels":[],"label_agreement":null},{"id":"W4387048167","doi":"10.1117/12.3006741","title":"Eigenvalue solution of sparse matrix based on MPETSc","year":2023,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"McGill University","funders":"","keywords":"Computer science; Scalability; Sparse matrix; Supercomputer; Parallel computing; Eigenvalues and eigenvectors; Computational science; Field (mathematics); Software; Parallel processing; Parallel algorithm; Matrix (chemical analysis); Stability (learning theory); Mathematics","score_opus":0.02176630387836509,"score_gpt":0.26774912882763746,"score_spread":0.24598282494927237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387048167","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014638108,0.00011744099,0.97699285,0.00017802483,0.00007533797,0.00004704416,0.00007583232,0.0003864486,0.007488902],"genre_scores_gemma":[0.3366599,0.00043084254,0.649513,0.00015417142,0.0001211907,0.00026708897,0.00036769224,0.00024762875,0.012238524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997142,0.000058004916,0.000010952617,0.000035084024,0.00014886748,0.000032883447],"domain_scores_gemma":[0.99963856,0.00012031073,0.000028983137,0.00004239207,0.00014469639,0.00002515324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031509367,0.000523334,0.0006471725,0.0005953724,0.0005391239,0.00056457735,0.0006545684,0.00065764145,0.005055552],"category_scores_gemma":[0.001130123,0.00020687567,0.00044975404,0.0007854489,0.0005149625,0.00069220713,0.0008384922,0.0006575258,0.0010679781],"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.000116366406,0.00010750111,0.0013729745,0.0003537245,0.000051113526,0.00055171165,0.0003180075,0.7257254,0.022879051,0.10410944,0.010108677,0.13430604],"study_design_scores_gemma":[0.000005874255,0.000011384195,0.00008631455,0.0000054865095,0.000002326278,0.000044116532,0.000019706646,0.99152374,0.0015274616,0.0055528143,0.0012152486,0.000005501657],"about_ca_topic_score_codex":0.0038400658,"about_ca_topic_score_gemma":0.0043311752,"teacher_disagreement_score":0.005055552,"about_ca_system_score_codex":0.00028984787,"about_ca_system_score_gemma":0.0010273502,"threshold_uncertainty_score":0.01691246},"labels":[],"label_agreement":null},{"id":"W4387110205","doi":"10.1515/spma-2023-0103","title":"On 3-by-3 row stochastic matrices","year":2023,"lang":"en","type":"article","venue":"Special Matrices","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; New York University Abu Dhabi","keywords":"Constructive; Mathematics; Unitary state; Unitary matrix; Matrix (chemical analysis); Algebra over a field; Applied mathematics; Combinatorics; Pure mathematics; Computer science","score_opus":0.009904842993394078,"score_gpt":0.24198341567023854,"score_spread":0.23207857267684445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387110205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2280988,0.00023173721,0.7453833,0.00043768302,0.000111187146,0.00006862582,0.00020901777,0.0005686636,0.024890965],"genre_scores_gemma":[0.8859376,0.00018994989,0.10908218,0.00020809774,0.00013356617,0.00006696309,0.00027693374,0.00015018652,0.0039545433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972133,0.0013039793,0.00014595603,0.0003083637,0.000761873,0.0002664703],"domain_scores_gemma":[0.98281395,0.012100067,0.0013133948,0.0016263883,0.0015682682,0.0005779271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027504417,0.0005575869,0.00074207707,0.0011621818,0.0006909503,0.0019514691,0.0007213245,0.00067777693,0.0073282225],"category_scores_gemma":[0.016848428,0.0003256413,0.0007104761,0.00082675065,0.00369209,0.0022473221,0.001492359,0.0016275351,0.0012481563],"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.0001284351,0.000025028168,0.00055154576,0.000055262484,0.0000119448105,0.00021050673,0.00016363041,0.02872536,0.0031601693,0.95145977,0.00088188815,0.014626458],"study_design_scores_gemma":[0.000014471784,0.000046628964,0.00019282193,0.000028590504,0.000004376375,0.0001557535,0.00006146436,0.11892835,0.0045770756,0.87445503,0.001513727,0.000021696933],"about_ca_topic_score_codex":0.00050956383,"about_ca_topic_score_gemma":0.0004612931,"teacher_disagreement_score":0.0073282225,"about_ca_system_score_codex":0.00043991508,"about_ca_system_score_gemma":0.00054229714,"threshold_uncertainty_score":0.02451533},"labels":[],"label_agreement":null},{"id":"W4387355885","doi":"10.13140/rg.2.2.18163.91683","title":"MinAres: An Iterative Solver for Symmetric Linear Systems","year":2023,"lang":"en","type":"preprint","venue":"PolyPublie (École Polytechnique de Montréal)","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":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données","keywords":"Krylov subspace; Solver; Linear subspace; Lanczos resampling; Applied mathematics; Generalized minimal residual method; Mathematics; Iterative method; Linear system; Positive-definite matrix; Algorithm; Eigenvalues and eigenvectors; Mathematical analysis; Pure mathematics; Mathematical optimization; Physics","score_opus":0.02673704618066856,"score_gpt":0.27221891985528235,"score_spread":0.2454818736746138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387355885","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028460159,0.000094835756,0.9906238,0.0001256668,0.000059587674,0.000046987865,0.0001569046,0.0018440011,0.0042022457],"genre_scores_gemma":[0.067577794,0.00016514442,0.9222933,0.00023815886,0.000072093506,0.00022647734,0.00063765893,0.0014727039,0.007316644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993678,0.00018194743,0.000034446828,0.000088889654,0.0002600762,0.000066952976],"domain_scores_gemma":[0.9990169,0.00040504843,0.00011025778,0.00013551931,0.0002648844,0.00006735508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008837374,0.0011011967,0.00091060903,0.00047495047,0.0005093053,0.0010750203,0.001628752,0.0012624064,0.01153172],"category_scores_gemma":[0.0027938427,0.000696945,0.0010831212,0.0005505067,0.0006581377,0.0010425086,0.0019923106,0.0020087843,0.0038753336],"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.0002563307,0.000153119,0.0011686151,0.00071440154,0.00015244148,0.00033716936,0.00032915367,0.62184036,0.017564274,0.121619366,0.030540075,0.2053248],"study_design_scores_gemma":[0.000036870057,0.000040615476,0.00007019886,0.00001989294,0.000006709134,0.000057572892,0.000023904036,0.9729136,0.0037629234,0.010786151,0.012266812,0.000014799032],"about_ca_topic_score_codex":0.0024233183,"about_ca_topic_score_gemma":0.0041081416,"teacher_disagreement_score":0.01153172,"about_ca_system_score_codex":0.00040039918,"about_ca_system_score_gemma":0.0019783154,"threshold_uncertainty_score":0.038577437},"labels":[],"label_agreement":null},{"id":"W4387880221","doi":"10.28924/2291-8639-21-2023-116","title":"A Three-Step Iterative Scheme Based on Green's Function for the Solution of Boundary Value Problems","year":2023,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Scheme (mathematics); Iterative method; Convergence (economics); Embedding; Function (biology); Boundary value problem; Applied mathematics; Banach space; Value (mathematics); Mathematical optimization; Mathematical analysis; Computer science","score_opus":0.015966351746314156,"score_gpt":0.27738281813154014,"score_spread":0.261416466385226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387880221","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054407935,0.00011370758,0.9932567,0.00007486698,0.000035114183,0.00003859592,0.000007738194,0.000048523605,0.000984106],"genre_scores_gemma":[0.15476015,0.00029296213,0.8420406,0.00009794742,0.00002305838,0.00027789653,0.000039858594,0.000053967113,0.0024136344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996043,0.00015949896,0.000022018528,0.000036041078,0.00014860388,0.000029513882],"domain_scores_gemma":[0.99961036,0.00017584827,0.000032676937,0.000046493635,0.00009696651,0.00003768575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012063708,0.00044648795,0.00060804666,0.00051376596,0.00048065014,0.00052975916,0.0011494281,0.0013462335,0.0010830681],"category_scores_gemma":[0.0018548507,0.00024309837,0.0009369785,0.0005133288,0.00091109506,0.0008678892,0.0011185553,0.0013227037,0.000387507],"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.00015149618,0.00012658077,0.001221479,0.0003414944,0.000059724753,0.00026240753,0.0005521083,0.58226854,0.041776862,0.2638961,0.0017650767,0.1075781],"study_design_scores_gemma":[0.000013191901,0.00005346844,0.00007270542,0.000013632533,0.000004933837,0.000048524395,0.000012712882,0.98403764,0.002675936,0.010793704,0.0022568395,0.000016765296],"about_ca_topic_score_codex":0.001709757,"about_ca_topic_score_gemma":0.0011709403,"teacher_disagreement_score":0.001709757,"about_ca_system_score_codex":0.00047673125,"about_ca_system_score_gemma":0.0011306696,"threshold_uncertainty_score":0.006379962},"labels":[],"label_agreement":null},{"id":"W4388083648","doi":"10.1007/s10107-023-02007-6","title":"Scalable adaptive cubic regularization methods","year":2023,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"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; Group for Research in Decision Analysis; Université de Sherbrooke; HEC Montréal","funders":"Canada First Research Excellence Fund; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Hessian matrix; Lanczos resampling; Mathematics; Applied mathematics; Cholesky decomposition; Conjugate gradient method; Mathematical optimization; Preconditioner; Scalability; Algorithm; Iterative method; Computer science; Eigenvalues and eigenvectors","score_opus":0.03768900431308961,"score_gpt":0.3241266093461401,"score_spread":0.2864376050330505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388083648","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002851975,0.00020315932,0.9911712,0.00025892403,0.00010617671,0.000036734687,0.000091113136,0.0007324083,0.004548301],"genre_scores_gemma":[0.13527295,0.0004230175,0.84652346,0.00033991126,0.00027836647,0.00032574736,0.00053965196,0.0009264783,0.015370469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881506,0.00030684995,0.00004008749,0.00015383205,0.00060726516,0.00007685543],"domain_scores_gemma":[0.99776506,0.000822366,0.00013607039,0.00062243384,0.0005256781,0.0001283402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013211507,0.00091327174,0.0010672758,0.0007106463,0.00058291864,0.0010968361,0.0020302692,0.001351209,0.008301167],"category_scores_gemma":[0.0058545377,0.0005984765,0.00074436085,0.0011482118,0.0008311159,0.0014542997,0.0026887998,0.0026618354,0.0023705165],"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.00032337257,0.00017208411,0.0006509628,0.00036031098,0.00016137825,0.00012850297,0.00010115077,0.39655483,0.013068932,0.15806364,0.041227866,0.38918695],"study_design_scores_gemma":[0.000016275291,0.000010324693,0.000058619247,0.000007322749,0.0000062195927,0.000020751182,0.000005122195,0.97916234,0.00090505334,0.016967703,0.0028336956,0.0000066070156],"about_ca_topic_score_codex":0.0042969105,"about_ca_topic_score_gemma":0.008530563,"teacher_disagreement_score":0.008301167,"about_ca_system_score_codex":0.00070880895,"about_ca_system_score_gemma":0.002065596,"threshold_uncertainty_score":0.027770162},"labels":[],"label_agreement":null},{"id":"W4388199556","doi":"10.1016/j.aml.2023.108903","title":"An augmented Lagrangian-based preconditioning technique for a class of block three-by-three linear systems","year":2023,"lang":"en","type":"article","venue":"Applied Mathematics Letters","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Scuola Normale Superiore","keywords":"Preconditioner; Generalized minimal residual method; Krylov subspace; Mathematics; Augmented Lagrangian method; Linear system; Applied mathematics; Finite element method; Convergence (economics); Iterative method; Block (permutation group theory); Eigenvalues and eigenvectors; System of linear equations; Linear equation; Mathematical optimization; Mathematical analysis; Geometry","score_opus":0.01483676259529004,"score_gpt":0.2435053537379352,"score_spread":0.22866859114264515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388199556","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018621618,0.0001606987,0.9755938,0.00008935644,0.000072478186,0.000043573986,0.00007967242,0.0002371372,0.0051017175],"genre_scores_gemma":[0.39844695,0.00044680372,0.5915038,0.00011373144,0.00007759155,0.00017501973,0.00041300408,0.00017614146,0.008646945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984837,0.00003508492,0.0000068513114,0.00002222969,0.000060265185,0.000027190654],"domain_scores_gemma":[0.99980325,0.000053788262,0.000028393257,0.000035330453,0.000051756288,0.000027570677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024218066,0.00051403756,0.00062875403,0.00024623756,0.00033910116,0.00045885908,0.00057768164,0.00047202536,0.0048396303],"category_scores_gemma":[0.00052919117,0.00017363402,0.0003821498,0.00046028814,0.00042529652,0.00045438088,0.00065530336,0.0010077702,0.00094926596],"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.00031251725,0.00023560114,0.0007309952,0.00040206136,0.000059790927,0.0005080748,0.00024809656,0.57548606,0.05513896,0.10471227,0.012436361,0.24972923],"study_design_scores_gemma":[0.000013961405,0.00005576818,0.000106378975,0.0000064862575,0.0000050901504,0.000059258866,0.000013729103,0.98972183,0.0016403972,0.0057236217,0.0026467778,0.0000067663],"about_ca_topic_score_codex":0.0022016221,"about_ca_topic_score_gemma":0.003836673,"teacher_disagreement_score":0.0048396303,"about_ca_system_score_codex":0.00014546186,"about_ca_system_score_gemma":0.0007283766,"threshold_uncertainty_score":0.016190171},"labels":[],"label_agreement":null},{"id":"W4388257605","doi":"10.1093/oso/9780198507345.003.0024","title":"Exponential Decomposition and Hankel Matrix","year":2002,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"McMaster University","funders":"","keywords":"Vandermonde matrix; Hankel matrix; Sequence (biology); Mathematics; Pencil (optics); Decomposition; Rank (graph theory); Matrix (chemical analysis); Exponential function; Matrix exponential; Matrix decomposition; Applied mathematics; Algorithm; Combinatorics; Mathematical analysis; Physics","score_opus":0.012577869332090097,"score_gpt":0.23944751495327915,"score_spread":0.22686964562118905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388257605","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029457094,0.0065436633,0.89883196,0.0011990323,0.0006341583,0.000020229067,0.00019545719,0.000356424,0.06276198],"genre_scores_gemma":[0.6806872,0.0076027946,0.22361106,0.00074788765,0.0012488806,0.000053196807,0.00039218532,0.00022383092,0.08543284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999841,0.000029391984,0.000005731981,0.00003815544,0.00006711743,0.00001860014],"domain_scores_gemma":[0.9996196,0.0001825001,0.000029292529,0.00003620323,0.00010890014,0.000023388453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026518555,0.0003799068,0.00032123894,0.00054453494,0.00020672304,0.0008411899,0.00038181752,0.0005044114,0.007189253],"category_scores_gemma":[0.0012334519,0.00012067219,0.0001338576,0.0005084414,0.0007032526,0.001349372,0.00048522223,0.0007708571,0.0015013303],"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.000025239367,0.000021136888,0.00018117145,0.00009014496,0.000007781077,0.00014601,0.00013859008,0.019589651,0.0038455564,0.90796393,0.008299821,0.05969101],"study_design_scores_gemma":[0.0000049053833,0.000027742139,0.00022505694,0.000034893736,0.0000040294285,0.0001702585,0.00004678712,0.20243163,0.0020538273,0.7721092,0.0228767,0.00001499924],"about_ca_topic_score_codex":0.00047757698,"about_ca_topic_score_gemma":0.0003035771,"teacher_disagreement_score":0.007189253,"about_ca_system_score_codex":0.00027113652,"about_ca_system_score_gemma":0.00017594478,"threshold_uncertainty_score":0.024050415},"labels":[],"label_agreement":null},{"id":"W4388320516","doi":"10.1093/oso/9780198534938.003.0009","title":"Inclusion of some of the zeros","year":2002,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Université de Montréal","funders":"","keywords":"Norm (philosophy); Unit circle; Mathematics; Zero (linguistics); Polynomial; Inclusion (mineral); Unit (ring theory); Pure mathematics; Discrete mathematics; Combinatorics; Mathematical analysis; Physics; Linguistics; Political science; Philosophy; Mathematics education; Law","score_opus":0.013854362758776672,"score_gpt":0.2053270802240876,"score_spread":0.19147271746531094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388320516","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54062414,0.001214542,0.15037094,0.0027235688,0.0008437223,0.00009354715,0.0006688143,0.0004266508,0.30303413],"genre_scores_gemma":[0.93639517,0.00036741325,0.0084427195,0.00028417716,0.00022857064,0.000059807437,0.0003272405,0.00018875873,0.053706046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991166,0.00010107086,0.000038889622,0.00020118579,0.0002852971,0.0002569039],"domain_scores_gemma":[0.9983052,0.0004746466,0.00013993063,0.00025756634,0.00051638717,0.00030626627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054807606,0.0005626471,0.0006653931,0.0011477596,0.0020849819,0.0030885567,0.00082135847,0.00081588357,0.012012312],"category_scores_gemma":[0.0042146873,0.00037385017,0.0005382105,0.00053461536,0.002489944,0.0030675202,0.0029397376,0.0019388784,0.001908592],"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.00019821333,0.000047333564,0.0009811546,0.00017531024,0.000013841221,0.00065629656,0.0011185636,0.0008310928,0.012655805,0.96737456,0.0042231944,0.011724693],"study_design_scores_gemma":[0.000046922723,0.000118466756,0.0016789106,0.00015201831,0.000032718348,0.0010687683,0.001716786,0.012759787,0.028337548,0.90613604,0.04791066,0.000041368978],"about_ca_topic_score_codex":0.0008330378,"about_ca_topic_score_gemma":0.0004983394,"teacher_disagreement_score":0.012012312,"about_ca_system_score_codex":0.0008352236,"about_ca_system_score_gemma":0.00056326203,"threshold_uncertainty_score":0.040185153},"labels":[],"label_agreement":null},{"id":"W4388320569","doi":"10.1093/oso/9780198534938.003.0008","title":"Inclusion of all zeros","year":2002,"lang":"en","type":"book-chapter","venue":"","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":"Université de Montréal","funders":"","keywords":"Zero (linguistics); Simple (philosophy); Mathematics; Polynomial; Pure mathematics; Mathematical analysis","score_opus":0.02106285599204185,"score_gpt":0.22652485606705786,"score_spread":0.205462000075016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388320569","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15735532,0.0020798428,0.39957193,0.0016448345,0.0009344166,0.00016485619,0.0010212444,0.00090541726,0.43632212],"genre_scores_gemma":[0.9076276,0.0013762964,0.025033716,0.00050421123,0.000690775,0.00017428033,0.0008348344,0.00050400064,0.063254446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99809295,0.00027093533,0.00009785844,0.00044380646,0.0006935243,0.00040090288],"domain_scores_gemma":[0.9938041,0.0024397126,0.0004335412,0.0009120166,0.0017845149,0.0006261071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009992674,0.0011583472,0.0012873472,0.002065654,0.0018584765,0.0032899242,0.0012121629,0.00071084715,0.018773662],"category_scores_gemma":[0.008480968,0.0005262132,0.0007732294,0.0011331916,0.0034780356,0.0051401057,0.004499467,0.004440986,0.004367003],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017193305,0.00004662173,0.00047006126,0.00022330762,0.000016100612,0.0002608844,0.00036339628,0.0013495509,0.004532884,0.9701601,0.0050342497,0.017370893],"study_design_scores_gemma":[0.000032151445,0.0000926167,0.0006872053,0.00015549982,0.000028666205,0.00043227404,0.00025033948,0.011229661,0.010318329,0.94030726,0.03643762,0.00002837466],"about_ca_topic_score_codex":0.00044880988,"about_ca_topic_score_gemma":0.0003000374,"teacher_disagreement_score":0.018773662,"about_ca_system_score_codex":0.0008957172,"about_ca_system_score_gemma":0.0006575947,"threshold_uncertainty_score":0.06280422},"labels":[],"label_agreement":null},{"id":"W4388321123","doi":"10.1093/oso/9780198501657.003.0009","title":"Consistency of matrix methods","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Western University","funders":"","keywords":"Consistency (knowledge bases); Subspace topology; Matrix (chemical analysis); Mathematics; Combinatorics; Discrete mathematics; Mathematical analysis; Chemistry; Chromatography","score_opus":0.023499081833231687,"score_gpt":0.3071167172890129,"score_spread":0.2836176354557812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388321123","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0121026095,0.004507082,0.9255045,0.0023683298,0.0005356615,0.00007769076,0.00019036607,0.00024007999,0.054473713],"genre_scores_gemma":[0.55112314,0.0052246875,0.39947173,0.0015481951,0.0018071611,0.0004644417,0.000782806,0.0006574604,0.03892032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99399513,0.0032951802,0.00017261688,0.0007421406,0.0016175181,0.00017743043],"domain_scores_gemma":[0.986219,0.009423309,0.00056051137,0.0016262628,0.0019669167,0.00020399742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065828236,0.0005820764,0.0010651529,0.0013456604,0.00067567796,0.0023660485,0.001508407,0.0012355585,0.0063526924],"category_scores_gemma":[0.024068581,0.0004558346,0.00089539203,0.0010952438,0.0033255508,0.0033819524,0.0021394356,0.0032014044,0.0013685621],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043259537,0.00002469673,0.00043790322,0.00019513586,0.00004339469,0.000031937885,0.00013732271,0.012293716,0.0010139854,0.947129,0.0058124396,0.03283721],"study_design_scores_gemma":[0.000016187327,0.000037619044,0.00027837136,0.00008468015,0.000011679959,0.000058788723,0.000050390227,0.09556321,0.0012037008,0.88794,0.014742019,0.000013372317],"about_ca_topic_score_codex":0.00068401196,"about_ca_topic_score_gemma":0.00044694907,"teacher_disagreement_score":0.0065828236,"about_ca_system_score_codex":0.0011748888,"about_ca_system_score_gemma":0.0009349407,"threshold_uncertainty_score":0.034813702},"labels":[],"label_agreement":null},{"id":"W4388321131","doi":"10.1093/oso/9780198501657.003.0002","title":"Matrix methods: basic classical theory","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Western University","funders":"","keywords":"Convergence (economics); Consistency (knowledge bases); Matrix (chemical analysis); Section (typography); Calculus (dental); Mathematics; Computer science; Algebra over a field; Applied mathematics; Pure mathematics; Discrete mathematics","score_opus":0.01992421853535249,"score_gpt":0.29556563938920916,"score_spread":0.2756414208538567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388321131","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063791606,0.083327964,0.6897268,0.00591975,0.0016988211,0.00009832936,0.00038092563,0.00030938303,0.21215883],"genre_scores_gemma":[0.38324937,0.08953241,0.33676183,0.004191377,0.008422789,0.0008380508,0.0006843315,0.00062540703,0.17569444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992416,0.00028025993,0.00002906899,0.00009427834,0.00032423128,0.000030538915],"domain_scores_gemma":[0.9992101,0.00042577652,0.000030886727,0.00007520454,0.00022505305,0.000033026896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014228488,0.0006863951,0.0006759546,0.0011629774,0.00051442086,0.0022175077,0.00091756304,0.0011873246,0.0092352675],"category_scores_gemma":[0.0025860686,0.00031486514,0.0003985406,0.0012196986,0.0025493733,0.002518895,0.001276663,0.0022669155,0.0027403424],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046199175,0.000010210915,0.00003517527,0.00017458158,0.0000056011795,0.0000147332785,0.000065270855,0.0021466592,0.00030715065,0.97707057,0.0049713915,0.015194081],"study_design_scores_gemma":[0.0000043026907,0.000015171118,0.00010300669,0.000116373856,0.0000030635936,0.00003680945,0.000026158848,0.013410477,0.00025524347,0.94398874,0.042034727,0.0000059087915],"about_ca_topic_score_codex":0.00079940265,"about_ca_topic_score_gemma":0.0005026303,"teacher_disagreement_score":0.0092352675,"about_ca_system_score_codex":0.0010212054,"about_ca_system_score_gemma":0.00065212254,"threshold_uncertainty_score":0.030895054},"labels":[],"label_agreement":null},{"id":"W4388321758","doi":"10.1093/oso/9780198501657.003.0004","title":"Tauberian theorems","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Western University","funders":"","keywords":"Toeplitz matrix; Abelian and tauberian theorems; Mathematics; Contrast (vision); Pure mathematics; Type (biology); Discrete mathematics; Algebra over a field; Computer science; Artificial intelligence; Geology","score_opus":0.009894748263354214,"score_gpt":0.20402527282902921,"score_spread":0.194130524565675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388321758","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022104677,0.0105771115,0.25883028,0.0024735366,0.0010903357,0.00006619883,0.00025644878,0.0005296323,0.70407176],"genre_scores_gemma":[0.5801455,0.015307852,0.1086626,0.0030545285,0.0023557364,0.0002840837,0.00060605444,0.0005510295,0.28903267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919885,0.00016217791,0.000033151202,0.0002030062,0.00028625378,0.000116603005],"domain_scores_gemma":[0.9989796,0.00051480165,0.000059987,0.00012053233,0.00024840503,0.00007662013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012311109,0.0007974288,0.00052950974,0.0014713759,0.0011540425,0.0022613776,0.0007133414,0.00066992163,0.013813911],"category_scores_gemma":[0.0022984345,0.00021936947,0.0005125835,0.0010812476,0.0024121501,0.0040586283,0.0013208815,0.0020986563,0.003318309],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006609173,0.000007145824,0.000029408477,0.000046596313,0.0000032152498,0.000030120756,0.00009979519,0.00027351646,0.00027588598,0.98259187,0.0046918606,0.011943956],"study_design_scores_gemma":[0.000004329389,0.000010816203,0.00008314115,0.000029371105,0.000004527513,0.00010286388,0.00003671742,0.002027489,0.0010480965,0.9584368,0.038211636,0.0000041660305],"about_ca_topic_score_codex":0.00041162575,"about_ca_topic_score_gemma":0.00044115682,"teacher_disagreement_score":0.013813911,"about_ca_system_score_codex":0.0011169672,"about_ca_system_score_gemma":0.00069176627,"threshold_uncertainty_score":0.046212137},"labels":[],"label_agreement":null},{"id":"W4388470096","doi":"10.1137/1.9781611977509.ch6","title":"CHAPTER SIX: MANDELBROT POLYNOMIALS AND MATRICES","year":2023,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Western University","funders":"","keywords":"Mandelbrot set; Eigenvalues and eigenvectors; Mathematics; Polynomial; Julia set; Quartic function; Recursion (computer science); Solver; Linear algebra; Algebra over a field; Pure mathematics; Mathematical analysis; Algorithm; Fractal; Geometry","score_opus":0.05970222098050578,"score_gpt":0.24505994266913525,"score_spread":0.18535772168862946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388470096","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00746182,0.0997501,0.22851431,0.031039879,0.022271207,0.0001922057,0.0017867449,0.0016805964,0.6073031],"genre_scores_gemma":[0.10046221,0.080994986,0.13935903,0.009838794,0.02158801,0.00032897788,0.0024363017,0.0025040172,0.6424876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925894,0.0001537156,0.000040501272,0.00015139973,0.00033253586,0.00006281029],"domain_scores_gemma":[0.9992893,0.00028692224,0.000048497343,0.00008210385,0.00021818216,0.00007490984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006808197,0.0010149045,0.00066040247,0.0010367102,0.0014936663,0.003751291,0.0008401945,0.0011012529,0.05385968],"category_scores_gemma":[0.003201088,0.0005453341,0.0006981978,0.0013817416,0.0018588727,0.0043639005,0.0013310626,0.0050083967,0.022140414],"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.000027327527,0.000037345322,0.00018784721,0.0004031682,0.0000069921957,0.00008975011,0.000995141,0.00080681517,0.001145018,0.7554303,0.17032659,0.07054369],"study_design_scores_gemma":[0.0000043037626,0.000033976103,0.00028549193,0.00032440113,0.0000036002689,0.00023540364,0.00020405249,0.00057950144,0.0005393818,0.22720803,0.77056706,0.000014847265],"about_ca_topic_score_codex":0.0014326192,"about_ca_topic_score_gemma":0.0016647379,"teacher_disagreement_score":0.05385968,"about_ca_system_score_codex":0.0014020803,"about_ca_system_score_gemma":0.0010116358,"threshold_uncertainty_score":0.18017858},"labels":[],"label_agreement":null},{"id":"W4388723858","doi":"10.13001/ela.2023.7971","title":"Eigenvalues for stochastic matrices with a prescribed stationary distribution","year":2023,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Eigenvalues and eigenvectors; Vertex (graph theory); Lambda; Sigma; Matrix (chemical analysis); Graph; Physics; Quantum mechanics","score_opus":0.009728455201395713,"score_gpt":0.2531222988154118,"score_spread":0.24339384361401611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388723858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24509342,0.0008408699,0.70643175,0.0012074745,0.0001096995,0.00007960786,0.0005526392,0.00067082106,0.04501377],"genre_scores_gemma":[0.9341353,0.0009841638,0.045885388,0.00023289892,0.00023828646,0.00032423684,0.0006299934,0.00036427853,0.017205423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991013,0.0002272633,0.000038079786,0.00019923101,0.00024089763,0.00019320188],"domain_scores_gemma":[0.99586016,0.002549653,0.00056724186,0.00025879167,0.00043936487,0.00032485634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010292655,0.0008795019,0.0006026352,0.0018194718,0.0007292503,0.0017718981,0.0008793825,0.0009311097,0.008840951],"category_scores_gemma":[0.0073455484,0.0004208638,0.00065377663,0.00081863074,0.0021869815,0.002048635,0.001266682,0.0014065264,0.0015966006],"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.000093204086,0.00003891695,0.00061555835,0.00010279295,0.000018050318,0.0002024954,0.00019417323,0.038662832,0.0063258065,0.9442822,0.0019435239,0.007520447],"study_design_scores_gemma":[0.000021925416,0.00004609699,0.00068558246,0.00005548154,0.000009094816,0.00013146496,0.00013985967,0.38199008,0.0032583012,0.61165124,0.0019695444,0.000041478845],"about_ca_topic_score_codex":0.00093713065,"about_ca_topic_score_gemma":0.0008600812,"teacher_disagreement_score":0.008840951,"about_ca_system_score_codex":0.0011125084,"about_ca_system_score_gemma":0.0007506311,"threshold_uncertainty_score":0.029575944},"labels":[],"label_agreement":null},{"id":"W4388857145","doi":"10.13001/ela.2023.8025","title":"Sparks of symmetric matrices and their graphs","year":2023,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; American Institute of Mathematics; National Science Foundation","keywords":"Mathematics; Combinatorics; Diagonal; Vertex (graph theory); Graph; Skew-symmetric matrix; Null (SQL); Discrete mathematics; Symmetric matrix; Square matrix; Geometry; Physics; Computer science","score_opus":0.00785242508233393,"score_gpt":0.23013409278902844,"score_spread":0.2222816677066945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388857145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2906043,0.0012057768,0.6728896,0.0014835793,0.00021902629,0.00016961283,0.004153918,0.002081461,0.027192807],"genre_scores_gemma":[0.8756481,0.0007715971,0.106186785,0.00040933397,0.00032575714,0.00023738353,0.0040795924,0.00044827102,0.011893104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856913,0.0003347083,0.00007944569,0.0003845333,0.0003866551,0.00024557236],"domain_scores_gemma":[0.99411845,0.0026217967,0.0008866515,0.00082688837,0.0008825283,0.00066364685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010662281,0.00061583566,0.00096282555,0.002151814,0.0010174694,0.0022629898,0.0009966646,0.0007315365,0.0062933243],"category_scores_gemma":[0.009837591,0.00041963172,0.00067146146,0.0017291534,0.0016758228,0.0036620346,0.0017890271,0.0010608122,0.0011657453],"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.0005326875,0.00011028481,0.0021481265,0.00022515102,0.000060485527,0.00045903257,0.00071490434,0.051674157,0.0059214826,0.87837064,0.017489016,0.042294037],"study_design_scores_gemma":[0.000024360721,0.000046872003,0.0005204792,0.00001536278,0.000008145629,0.00022150809,0.00015572754,0.09453842,0.0009415427,0.89916664,0.0043412633,0.000019617015],"about_ca_topic_score_codex":0.0012535696,"about_ca_topic_score_gemma":0.0013586131,"teacher_disagreement_score":0.0062933243,"about_ca_system_score_codex":0.00080414995,"about_ca_system_score_gemma":0.00075337576,"threshold_uncertainty_score":0.021053255},"labels":[],"label_agreement":null},{"id":"W4389040423","doi":"10.1090/tran/9086","title":"𝐶^{1,1-𝜖} isometric embeddings","year":2023,"lang":"lv","type":"preprint","venue":"Transactions of the American Mathematical Society","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":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; Japan Society for the Promotion of Science; Leibniz-Gemeinschaft; Istituto Nazionale di Alta Matematica \"Francesco Severi\"; Institute for Advanced Study","keywords":"Isometric exercise; Mathematics; Computer science; Medicine; Physical therapy","score_opus":0.028172085700592684,"score_gpt":0.28678602617768956,"score_spread":0.25861394047709685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389040423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04788938,0.00088238454,0.69120896,0.002601523,0.0014511201,0.00011496084,0.0006982752,0.00093199534,0.2542214],"genre_scores_gemma":[0.5104224,0.0018213108,0.27530995,0.0020405184,0.0016468292,0.0003874538,0.0020265745,0.0026243788,0.20372058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831855,0.000352263,0.00011089798,0.000544758,0.00046038892,0.00021305888],"domain_scores_gemma":[0.9987569,0.0004208136,0.00014966528,0.000205259,0.0003089877,0.00015847576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092252064,0.0009369552,0.00056841254,0.0010651945,0.001156528,0.0024304606,0.0011276691,0.00092429656,0.018910944],"category_scores_gemma":[0.0036281021,0.0005222039,0.0012610189,0.0006186512,0.0019386489,0.004598087,0.0041431203,0.004533841,0.005142147],"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.000020101072,0.000017630182,0.000091925955,0.000060383984,0.000008701444,0.000060932034,0.00011605821,0.00070886593,0.0008477674,0.97393835,0.0050331894,0.019095952],"study_design_scores_gemma":[0.0000114510385,0.000038066053,0.00027482494,0.000027597649,0.000011892092,0.0001934463,0.00011777584,0.0097242305,0.001856053,0.94487226,0.042851098,0.00002138018],"about_ca_topic_score_codex":0.0008614443,"about_ca_topic_score_gemma":0.0010486536,"teacher_disagreement_score":0.018910944,"about_ca_system_score_codex":0.0010772716,"about_ca_system_score_gemma":0.00050352106,"threshold_uncertainty_score":0.06326342},"labels":[],"label_agreement":null},{"id":"W4389673186","doi":"10.2139/ssrn.4638937","title":"Optimal Transport Divergences Induced by Scoring Functions","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Vlaamse regering; Natural Sciences and Engineering Research Council of Canada; Fonds Wetenschappelijk Onderzoek","keywords":"Computer science; Mathematics","score_opus":0.012583034224568815,"score_gpt":0.2363992956968144,"score_spread":0.2238162614722456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389673186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.282272,0.0012818679,0.649607,0.0049411855,0.00048535733,0.00022270084,0.0006445045,0.0013488381,0.059196535],"genre_scores_gemma":[0.89509094,0.0008540466,0.07406473,0.001166719,0.00037077596,0.00036175322,0.000853025,0.0011198643,0.026118046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976574,0.0010548767,0.00010387912,0.00027910058,0.00057847146,0.00032631782],"domain_scores_gemma":[0.992833,0.0037887283,0.0004807381,0.0009260484,0.00076566316,0.0012057738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004257072,0.0011026794,0.0024192308,0.0027128314,0.0018942028,0.0038396171,0.002833691,0.0046775513,0.009659983],"category_scores_gemma":[0.018986143,0.0010574623,0.0010179005,0.0018589046,0.003947763,0.0063623674,0.0046058414,0.0041479887,0.0013826342],"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.00014334814,0.000088859226,0.00038176295,0.000118963726,0.00003197492,0.00010725882,0.000105359635,0.03689039,0.0017307056,0.94465405,0.0033441244,0.01240337],"study_design_scores_gemma":[0.000030668005,0.000029833984,0.00020710373,0.000028579125,0.0000079526,0.000066863424,0.000042320673,0.15869905,0.00049878564,0.839675,0.0006950018,0.000018815717],"about_ca_topic_score_codex":0.0014889798,"about_ca_topic_score_gemma":0.0018741104,"teacher_disagreement_score":0.009659983,"about_ca_system_score_codex":0.0029341204,"about_ca_system_score_gemma":0.0020242212,"threshold_uncertainty_score":0.03231585},"labels":[],"label_agreement":null},{"id":"W4389941500","doi":"10.1002/nla.2543","title":"Generalizing reduction‐based algebraic multigrid","year":2023,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Diagonally dominant matrix; Multigrid method; Applied mathematics; Robustness (evolution); Discretization; Condition number; Mathematical optimization; Bounded function; Algorithm; Mathematical analysis; Pure mathematics; Partial differential equation","score_opus":0.01617655189294508,"score_gpt":0.2601246523332715,"score_spread":0.2439481004403264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389941500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008733402,0.000084608815,0.9817886,0.00016568383,0.00009765646,0.00008103807,0.00004836347,0.00055177085,0.008448929],"genre_scores_gemma":[0.32589805,0.00028813383,0.663382,0.0003136038,0.00018740182,0.00027521403,0.00036277584,0.00072134205,0.008571534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993311,0.00017374606,0.000025444822,0.00008820663,0.00033250378,0.000048939277],"domain_scores_gemma":[0.9991327,0.00027419775,0.000049673028,0.00026493508,0.00024142336,0.000037047845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008042656,0.0007144017,0.0007655111,0.0011710151,0.00044267738,0.00076987705,0.0012078569,0.0008377164,0.0034634038],"category_scores_gemma":[0.0032137458,0.00030952413,0.0010326703,0.00055547175,0.0012766885,0.00065570197,0.0028547675,0.0014924976,0.0012083108],"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.00006789467,0.000073596566,0.0005667743,0.00013819388,0.00005039646,0.00009235075,0.00016845137,0.7487857,0.012436477,0.16710056,0.0033233974,0.067196235],"study_design_scores_gemma":[0.000006101628,0.00001179514,0.00003994197,0.0000046292744,0.0000025416796,0.000013798731,0.0000064543406,0.9754157,0.00093001995,0.020034742,0.003530643,0.00000360388],"about_ca_topic_score_codex":0.0031622583,"about_ca_topic_score_gemma":0.0029450045,"teacher_disagreement_score":0.0034634038,"about_ca_system_score_codex":0.000567703,"about_ca_system_score_gemma":0.00061896024,"threshold_uncertainty_score":0.0115863085},"labels":[],"label_agreement":null},{"id":"W4390078244","doi":"10.4153/s0008414x23000901","title":"Symmetric and antisymmetric tensor products for the function-theoretic operator theorist","year":2023,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Université Laval","funders":"Engineering and Physical Sciences Research Council; National Science Foundation","keywords":"Antisymmetric tensor; Antisymmetric relation; Mathematics; Symmetric tensor; Hilbert space; Operator (biology); Tensor (intrinsic definition); Pure mathematics; Space (punctuation); Function (biology); Tensor product; Field (mathematics); Algebra over a field; Mathematical physics; Mathematical analysis; Gauge theory; Exact solutions in general relativity; Computer science","score_opus":0.01832636511007984,"score_gpt":0.22587439924378103,"score_spread":0.20754803413370118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390078244","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5377062,0.0030423363,0.39574096,0.0138769755,0.0011580525,0.00004372595,0.00024998168,0.00022968494,0.047952056],"genre_scores_gemma":[0.94120497,0.0010929429,0.049732525,0.0006907822,0.00084189855,0.000058990943,0.00011891544,0.00013672421,0.0061222618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832016,0.0007064558,0.00011251635,0.00025070822,0.00043890736,0.00017123677],"domain_scores_gemma":[0.99287707,0.0034787043,0.0007135646,0.0007652347,0.0012015209,0.0009639376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052262554,0.0005172976,0.0006248689,0.0013405088,0.0018375175,0.004305181,0.0010894119,0.0014800014,0.004105285],"category_scores_gemma":[0.008781241,0.0003045256,0.00072052586,0.0009117454,0.0060298005,0.011632506,0.0020062001,0.001796905,0.00047784974],"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.0000147583805,0.000009122392,0.00025007105,0.000012596754,0.0000024181868,0.000033506876,0.00014947544,0.00035791934,0.00041740527,0.99702686,0.00046701054,0.0012589063],"study_design_scores_gemma":[0.000002934214,0.00001364766,0.00010676908,0.000007741337,0.0000022573695,0.000054632932,0.00012056941,0.0052319574,0.00023605286,0.9932689,0.0009472008,0.0000074003165],"about_ca_topic_score_codex":0.00049257214,"about_ca_topic_score_gemma":0.00040826586,"teacher_disagreement_score":0.0052262554,"about_ca_system_score_codex":0.001036971,"about_ca_system_score_gemma":0.00082274695,"threshold_uncertainty_score":0.027639389},"labels":[],"label_agreement":null},{"id":"W4390720488","doi":"10.1017/9781009299909.013","title":"Matrix Primer","year":2024,"lang":"es","type":"other","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Toronto","funders":"","keywords":"Primer (cosmetics); Computer science; Matrix (chemical analysis); Algebra over a field; Mathematics; Pure mathematics; Physics; Chemistry","score_opus":0.011469899104856893,"score_gpt":0.2749843902423562,"score_spread":0.2635144911374993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390720488","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056477427,0.0045653344,0.13889447,0.0072798505,0.009018245,0.00023041692,0.014868863,0.029203521,0.7953745],"genre_scores_gemma":[0.0050205644,0.0041029756,0.06056253,0.0038609318,0.0019238237,0.00029156017,0.013588504,0.012979775,0.89766926],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99904853,0.00015492064,0.00005935904,0.00016002505,0.00050847227,0.00006876798],"domain_scores_gemma":[0.9969506,0.001179754,0.000099307224,0.0003382977,0.0012074236,0.00022452018],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008784537,0.0011192524,0.00072894007,0.0023193262,0.0011758668,0.0045520435,0.002193479,0.0015697986,0.6054386],"category_scores_gemma":[0.0069130473,0.00088946836,0.0007251163,0.0028788068,0.0006650222,0.005370237,0.002210996,0.0030841217,0.44586977],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023312956,0.000016689899,0.000040202347,0.00018606227,0.0000036576719,0.00005246386,0.000074713105,0.00023095042,0.00045894404,0.04122096,0.891243,0.06644908],"study_design_scores_gemma":[0.000002921708,0.0000034937366,0.000022348817,0.000038944778,9.47961e-7,0.00007274171,0.000018019899,0.00015356274,0.00017369055,0.006326183,0.99318296,0.0000041690123],"about_ca_topic_score_codex":0.001379398,"about_ca_topic_score_gemma":0.0031469902,"teacher_disagreement_score":0.6054386,"about_ca_system_score_codex":0.0009679159,"about_ca_system_score_gemma":0.001287127,"threshold_uncertainty_score":0.56279397},"labels":[],"label_agreement":null},{"id":"W4390720667","doi":"10.1017/9781009299909.015","title":"Miscellaneous Extras","year":2024,"lang":"en","type":"other","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Toronto","funders":"","keywords":"Lemma (botany); Mathematics; Computer science; Genealogy; History; Biology","score_opus":0.00832285483211451,"score_gpt":0.22702461294111276,"score_spread":0.21870175810899825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390720667","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009018906,0.0060631116,0.01540486,0.017709887,0.08711243,0.00015688613,0.013897124,0.005676689,0.85307705],"genre_scores_gemma":[0.0062677804,0.00406952,0.006766796,0.009021064,0.016498324,0.00018392538,0.011112355,0.0053631673,0.94071704],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982734,0.00036253757,0.000114272836,0.00025535814,0.0008613268,0.00013315862],"domain_scores_gemma":[0.9890399,0.004069701,0.00042486354,0.0014754893,0.0043256287,0.00066441746],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011192193,0.0012156403,0.0012834368,0.0035414468,0.0020706267,0.004053508,0.0020127238,0.0013992765,0.60698235],"category_scores_gemma":[0.02363207,0.00054482906,0.0010691768,0.00506609,0.0010215626,0.004756879,0.003141847,0.0033274686,0.4705952],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018512055,0.00001701166,0.000055205262,0.00014139139,0.0000023854004,0.000055192682,0.00005287942,0.00007029303,0.000097019365,0.0082759345,0.96436477,0.026849333],"study_design_scores_gemma":[0.0000030677681,0.000005544076,0.00009049325,0.00008860368,0.0000018546365,0.00011565216,0.000023183013,0.00004441574,0.000070773036,0.0023518985,0.99719906,0.0000054989387],"about_ca_topic_score_codex":0.0027459164,"about_ca_topic_score_gemma":0.0050753155,"teacher_disagreement_score":0.60698235,"about_ca_system_score_codex":0.0017449362,"about_ca_system_score_gemma":0.0016912242,"threshold_uncertainty_score":0.56059194},"labels":[],"label_agreement":null},{"id":"W4390971628","doi":"10.3390/math12020323","title":"(R, S)-(Skew) Symmetric Solutions to Matrix Equation AXB = C over Quaternions","year":2024,"lang":"en","type":"article","venue":"Mathematics","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 Manitoba","funders":"Minjiang University; Fundo para o Desenvolvimento das Ciências e da Tecnologia; Natural Sciences and Engineering Research Council of Canada; Wuyi University; National Natural Science Foundation of China","keywords":"Skew; Quaternion; Skew-symmetric matrix; Mathematics; Matrix (chemical analysis); Symmetric matrix; Representation (politics); Applied mathematics; Pure mathematics; Mathematical analysis; Square matrix; Computer science; Geometry; Physics","score_opus":0.03660788047634114,"score_gpt":0.29584553057568325,"score_spread":0.2592376500993421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390971628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03414397,0.00034683844,0.95865554,0.0005824826,0.00013145445,0.000054884767,0.00009390058,0.00013556713,0.0058554164],"genre_scores_gemma":[0.6010779,0.0021425325,0.3740513,0.00063482864,0.00028448078,0.00020587238,0.00040228592,0.0002893062,0.020911437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932396,0.00020664313,0.00004781433,0.00015658514,0.0002019506,0.00006315158],"domain_scores_gemma":[0.99888366,0.00033567133,0.0003005321,0.000090354064,0.00033049198,0.000059388705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011449646,0.0010159266,0.00053361454,0.0007653244,0.00047858205,0.0012742274,0.0005918296,0.0011086415,0.006037833],"category_scores_gemma":[0.004818292,0.0003783002,0.0005710296,0.00097326364,0.0015721784,0.002165764,0.0010064159,0.0012144402,0.0013917874],"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.00008599659,0.00005729078,0.0016191633,0.00031047105,0.000056264118,0.00050526665,0.00047503834,0.12736832,0.030153211,0.7361252,0.0053624334,0.09788136],"study_design_scores_gemma":[0.000041942138,0.00015628788,0.0007872555,0.00007748404,0.000019111438,0.00091845676,0.00037330392,0.48747373,0.013313095,0.48729107,0.009474547,0.00007369011],"about_ca_topic_score_codex":0.0011808786,"about_ca_topic_score_gemma":0.00096909713,"teacher_disagreement_score":0.006037833,"about_ca_system_score_codex":0.0003245253,"about_ca_system_score_gemma":0.0010928223,"threshold_uncertainty_score":0.020198584},"labels":[],"label_agreement":null},{"id":"W4391108121","doi":"10.1007/978-3-031-50769-4_10","title":"Optimized Schwarz Method in Time for Transport Control","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Agence Nationale de la Recherche","keywords":"Control (management); Computer science; Artificial intelligence","score_opus":0.007215478051978344,"score_gpt":0.23885444206746387,"score_spread":0.23163896401548553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391108121","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001920759,0.0006100255,0.98269,0.00022976355,0.000389504,0.000023257913,0.000086903296,0.00019869441,0.013851184],"genre_scores_gemma":[0.1894719,0.0025868616,0.6793543,0.00048520404,0.0006326974,0.00041072877,0.0005086563,0.0022473426,0.12430234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996861,0.000115069284,0.000015699925,0.000035117788,0.00012526523,0.00002274769],"domain_scores_gemma":[0.9996438,0.00016141348,0.000022764349,0.000053198775,0.000094912175,0.000023955185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005453993,0.0010835495,0.0010488929,0.0006638409,0.0005272502,0.0010687573,0.0011076132,0.0011388367,0.011184194],"category_scores_gemma":[0.0011483293,0.00036903104,0.0007802299,0.0007429736,0.0010620842,0.0011709505,0.0012581097,0.0018304243,0.0024075394],"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.000111671936,0.000032121116,0.000087178625,0.0002226972,0.00004849797,0.0000656309,0.00008521982,0.20608337,0.0059666615,0.706044,0.011788803,0.06946413],"study_design_scores_gemma":[0.000012716104,0.000032123746,0.00006542665,0.000027962158,0.00001598927,0.000036272544,0.000019772508,0.8153499,0.0020835362,0.16171339,0.02062498,0.000017981642],"about_ca_topic_score_codex":0.0017035421,"about_ca_topic_score_gemma":0.0017234546,"teacher_disagreement_score":0.011184194,"about_ca_system_score_codex":0.0008341192,"about_ca_system_score_gemma":0.0007941259,"threshold_uncertainty_score":0.03741485},"labels":[],"label_agreement":null},{"id":"W4391111820","doi":"10.1007/978-3-031-50769-4_20","title":"Multigrid Interpretation of a Three-Level Parareal Algorithm","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Agence Nationale de la Recherche","keywords":"Multigrid method; Parallelism (grammar); Interpretation (philosophy); Computer science; Algorithm; Reduction (mathematics); Parallel computing; Mathematics; Programming language; Geometry","score_opus":0.012904706220907395,"score_gpt":0.23004065767596488,"score_spread":0.21713595145505749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391111820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015713783,0.00046634008,0.9136948,0.000787113,0.0003644507,0.000045375204,0.00016476944,0.00092501316,0.067838326],"genre_scores_gemma":[0.3934104,0.000606208,0.5514718,0.00041908547,0.00020034229,0.000118284835,0.000299998,0.0014278895,0.052046053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997359,0.00006952879,0.000008488624,0.000031531243,0.00012512974,0.000029393941],"domain_scores_gemma":[0.99970394,0.00008343682,0.000026737784,0.00007341495,0.00008110059,0.00003128994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040698977,0.00046226237,0.00050864957,0.0007051965,0.0006515662,0.0024156165,0.0015630212,0.0009920743,0.015801638],"category_scores_gemma":[0.0012162908,0.00028160846,0.00055295124,0.00062580104,0.001224852,0.0012512768,0.0012290048,0.0014949426,0.0026791377],"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.00008850549,0.000034100176,0.000111115725,0.00008479294,0.0000106111775,0.00009696549,0.00010221828,0.062376525,0.0057041356,0.8996377,0.0036557734,0.028097633],"study_design_scores_gemma":[0.000039723935,0.00003550207,0.00017473032,0.000027081234,0.0000081111,0.00011238945,0.000062464605,0.7011362,0.0036648961,0.26974705,0.024969906,0.00002187987],"about_ca_topic_score_codex":0.0019381202,"about_ca_topic_score_gemma":0.0020863742,"teacher_disagreement_score":0.015801638,"about_ca_system_score_codex":0.0008095036,"about_ca_system_score_gemma":0.00049223466,"threshold_uncertainty_score":0.05286175},"labels":[],"label_agreement":null},{"id":"W4391141447","doi":"10.1137/22m1540624","title":"Constraint-Satisfying Krylov Solvers for Structure-Preserving Discretizations","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; European Research Consortium for Informatics and Mathematics","keywords":"Constraint (computer-aided design); Computer science; Generalized minimal residual method; Parallel computing; Computational science; Mathematics; Mathematical optimization; Algorithm; Iterative method; Geometry","score_opus":0.009056516811855151,"score_gpt":0.28915557816443505,"score_spread":0.2800990613525799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391141447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063892636,0.00010935818,0.9892117,0.00012707202,0.00003924745,0.00006836356,0.00007066326,0.00025803168,0.0037263373],"genre_scores_gemma":[0.18005025,0.00024393649,0.81180423,0.00022124185,0.00005288085,0.00031824998,0.0003949422,0.00036798377,0.0065462617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923515,0.00024262324,0.000043846103,0.00006248385,0.000366613,0.00004929731],"domain_scores_gemma":[0.9991079,0.00037238363,0.00012468817,0.00021507438,0.00013324275,0.0000466251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011331523,0.0006841753,0.0005561538,0.00028035475,0.0003688464,0.00070484885,0.0013098189,0.0007923643,0.0045228056],"category_scores_gemma":[0.0039351345,0.00028283434,0.0005504639,0.0005298768,0.0009439195,0.0009467017,0.0022621502,0.0016482908,0.0014195653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016122141,0.00010809976,0.0013954021,0.000484513,0.00008184817,0.00021109855,0.00034904885,0.40227395,0.023760904,0.41593158,0.0072571123,0.14798523],"study_design_scores_gemma":[0.000038736147,0.000042423613,0.00008296925,0.000029376311,0.000006485763,0.000060749837,0.000028282868,0.92717576,0.0045775925,0.057868086,0.010078851,0.000010652766],"about_ca_topic_score_codex":0.0010754515,"about_ca_topic_score_gemma":0.0020387473,"teacher_disagreement_score":0.0045228056,"about_ca_system_score_codex":0.0004087593,"about_ca_system_score_gemma":0.0012722675,"threshold_uncertainty_score":0.015130281},"labels":[],"label_agreement":null},{"id":"W4391239472","doi":"10.5539/jmr.v16n1p46","title":"A Proof of a Gantmacher’s Result on Nonnegative Square Matrices by Means of M-matrices","year":2024,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Square (algebra); Combinatorics; Pure mathematics; Geometry","score_opus":0.06479448363109866,"score_gpt":0.38313664987730534,"score_spread":0.3183421662462067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391239472","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018531539,0.0031125757,0.86056787,0.0050727157,0.0027211613,0.00014003739,0.0008012523,0.0007301945,0.10832268],"genre_scores_gemma":[0.52496463,0.007508183,0.39551613,0.008669395,0.0034306648,0.0006628647,0.0009571467,0.0007457857,0.05754514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953926,0.000084551124,0.000021875529,0.00010236426,0.00017754438,0.000074384],"domain_scores_gemma":[0.9987477,0.0005394973,0.00009258723,0.00016419675,0.00032633563,0.00012960461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086358027,0.0015521449,0.00062903546,0.0012302967,0.00068246806,0.0009069346,0.00088022667,0.00091507955,0.014158782],"category_scores_gemma":[0.0033753018,0.00039184245,0.0014005043,0.0009489354,0.001934794,0.0017776968,0.0029121493,0.0031484577,0.0033942566],"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.00006334891,0.00006658077,0.00027328092,0.0005614279,0.000047820184,0.0008935222,0.00036735708,0.004119216,0.021015134,0.9015839,0.030881034,0.040127344],"study_design_scores_gemma":[0.000033859822,0.00012844882,0.00080022315,0.0001243577,0.00003269074,0.0011627887,0.00011114538,0.0109204,0.009157824,0.91022575,0.06724711,0.000055312947],"about_ca_topic_score_codex":0.0007554855,"about_ca_topic_score_gemma":0.00087523414,"teacher_disagreement_score":0.014158782,"about_ca_system_score_codex":0.0005251737,"about_ca_system_score_gemma":0.00064817304,"threshold_uncertainty_score":0.047365844},"labels":[],"label_agreement":null},{"id":"W4391328511","doi":"10.18280/mmep.110130","title":"A Convergent Series Approximation Method for Solving Wave-Like Problems: Introducing a Novel Control Convergence Parameter","year":2024,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Series (stratigraphy); Convergence (economics); Applied mathematics; Convergent series; Mathematics; Mathematical optimization; Computer science; Mathematical analysis; Power series; Geology; Economics","score_opus":0.02494518494667995,"score_gpt":0.23145198743039547,"score_spread":0.20650680248371553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391328511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002532257,0.00008845123,0.9951083,0.000043514323,0.000049597387,0.000024245344,0.0000073667434,0.00006827626,0.002078048],"genre_scores_gemma":[0.16802415,0.00064986176,0.8224905,0.0001101481,0.0001313108,0.00034119037,0.00007226376,0.00023604566,0.007944422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996984,0.000102454396,0.000013907624,0.000037606453,0.00013520538,0.000012310454],"domain_scores_gemma":[0.9994105,0.00032422392,0.000054344044,0.00005731495,0.00012643082,0.000027215681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009353186,0.0007591774,0.00047229516,0.00059224915,0.0003412329,0.0006020559,0.00093753746,0.00085770333,0.0019752532],"category_scores_gemma":[0.002593132,0.00021665453,0.0005451779,0.0004900946,0.0008343534,0.0009807093,0.0009375616,0.0013142845,0.00083368225],"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.00012856815,0.0001641592,0.0007291318,0.0005296863,0.000074453405,0.0002770579,0.00043311607,0.4303875,0.07214136,0.2534496,0.0035752512,0.23811013],"study_design_scores_gemma":[0.00000838843,0.00007985977,0.000039248625,0.00001919305,0.0000073249803,0.00008605511,0.000018507712,0.9798549,0.004861094,0.009337871,0.005675525,0.000011976584],"about_ca_topic_score_codex":0.0006480767,"about_ca_topic_score_gemma":0.0006405721,"teacher_disagreement_score":0.0019752532,"about_ca_system_score_codex":0.00033849728,"about_ca_system_score_gemma":0.0006162546,"threshold_uncertainty_score":0.0066079497},"labels":[],"label_agreement":null},{"id":"W4391381474","doi":"10.1109/wsc60868.2023.10407904","title":"Strong Scaling of The SVD Algorithm For HPC Science: A Petsc-Based Approach","year":2023,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"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":"CODE; Comunidad de Madrid","keywords":"Singular value decomposition; Scalability; Computer science; Implementation; Scaling; Parallel computing; Sparse matrix; Population; Singular value; Matrix (chemical analysis); Algorithm; Supercomputer; Computational science; Mathematics; Database; Programming language; Materials science","score_opus":0.02345378821269837,"score_gpt":0.2720720755871737,"score_spread":0.24861828737447536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391381474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013947734,0.0007465477,0.96964407,0.00043150925,0.00018325374,0.000089246285,0.00019039026,0.0015306015,0.013236712],"genre_scores_gemma":[0.24955413,0.0013970286,0.73608875,0.00037565286,0.00037696306,0.00026084005,0.0012702246,0.0014838865,0.009192552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923134,0.00019299278,0.00003815349,0.00008200237,0.0004013927,0.000054153035],"domain_scores_gemma":[0.99803156,0.0005355743,0.000096022035,0.00038024635,0.00083324924,0.00012330555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011036915,0.0007983319,0.00070799346,0.0009058124,0.0005868255,0.0014112883,0.0010953618,0.0009079458,0.0072998987],"category_scores_gemma":[0.0050251223,0.00031478528,0.0006607623,0.0012379745,0.0009008757,0.0013302965,0.0015408386,0.001430203,0.0025788245],"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.00026417073,0.00021859499,0.0028717513,0.00053552614,0.00016153938,0.00054488285,0.0002963867,0.5921082,0.028643059,0.15606545,0.01963793,0.19865248],"study_design_scores_gemma":[0.000009946979,0.000033869288,0.0001904271,0.000023804783,0.0000073261585,0.000085793676,0.000029556817,0.97445244,0.0033214735,0.016008748,0.0058244583,0.000012100042],"about_ca_topic_score_codex":0.0029058564,"about_ca_topic_score_gemma":0.0021520301,"teacher_disagreement_score":0.0072998987,"about_ca_system_score_codex":0.00047437154,"about_ca_system_score_gemma":0.00092957757,"threshold_uncertainty_score":0.024420619},"labels":[],"label_agreement":null},{"id":"W4391668970","doi":"10.1016/j.camwa.2024.01.017","title":"Comparisons of two iteration methods for time-harmonic parabolic optimal control problems","year":2024,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Science Basic Research Program of Shaanxi Province; China Scholarship Council; National Key Research and Development Program of China; Natural Science Foundation of Shaanxi Provincial Department of Education; Natural Science Foundation of Jiangxi Province; National Natural Science Foundation of China","keywords":"Discretization; Mathematics; Mathematical optimization; Rate of convergence; Convergence (economics); Eigenvalues and eigenvectors; Iterative method; Selection (genetic algorithm); Algorithm; Reliability (semiconductor); Applied mathematics; Computer science; Mathematical analysis","score_opus":0.019279276402946695,"score_gpt":0.3253124061145472,"score_spread":0.3060331297116005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391668970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21113086,0.0047165877,0.750257,0.0013940437,0.0011031344,0.00045536528,0.00021721331,0.0008906578,0.029835077],"genre_scores_gemma":[0.7154319,0.0016126964,0.2727415,0.00032270188,0.0002445868,0.00064208277,0.0003553846,0.0005979415,0.008051164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984047,0.000822544,0.00012447676,0.00011276318,0.00039693568,0.00013864052],"domain_scores_gemma":[0.9897037,0.007044976,0.00033093535,0.00055773946,0.0018795141,0.00048303854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036836416,0.0009864757,0.001913099,0.0015046742,0.00090086285,0.0017988965,0.0017063535,0.0031694376,0.0038351477],"category_scores_gemma":[0.013618651,0.00043097697,0.0011434463,0.00080299476,0.0010753886,0.0016242199,0.0022659872,0.0019129061,0.00059352966],"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.0025358347,0.00093089824,0.0037755137,0.0011099058,0.0003835523,0.000103410646,0.00050880166,0.7369686,0.0064419336,0.04894365,0.0026456015,0.19565247],"study_design_scores_gemma":[0.00012863462,0.0003224884,0.00075482554,0.00004508447,0.000037202408,0.000032600503,0.00007314701,0.99167657,0.0015312276,0.004257164,0.001109133,0.000031864936],"about_ca_topic_score_codex":0.004880651,"about_ca_topic_score_gemma":0.004070364,"teacher_disagreement_score":0.004880651,"about_ca_system_score_codex":0.0009761722,"about_ca_system_score_gemma":0.0027031358,"threshold_uncertainty_score":0.019481182},"labels":[],"label_agreement":null},{"id":"W4391786673","doi":"10.28924/2291-8639-22-2024-32","title":"Practical Aspects for Applying Picard Iterations to the SIR Model Using Actual Data","year":2024,"lang":"en","type":"article","venue":"International Journal of 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":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Islamic University of Madinah","keywords":"Mathematics; Calculus (dental); Applied mathematics; Algebra over a field; Pure mathematics; Orthodontics","score_opus":0.07744996552644011,"score_gpt":0.39926030810728796,"score_spread":0.32181034258084784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391786673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009210623,0.00012838552,0.9871837,0.00018511951,0.00005092501,0.00006563654,0.00003507098,0.00020557019,0.0029349579],"genre_scores_gemma":[0.20000584,0.00038711718,0.79510164,0.00012313221,0.00006278408,0.00041384986,0.00018927733,0.00030070054,0.0034156293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984359,0.00097173953,0.000084337466,0.00012014272,0.0003163936,0.0000713997],"domain_scores_gemma":[0.9945109,0.0038373722,0.0002495778,0.000539321,0.0007805193,0.00008230792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036999227,0.00070580567,0.0008282824,0.0007613407,0.0006907169,0.0012403819,0.0016589535,0.00087728805,0.0036231845],"category_scores_gemma":[0.013547536,0.00039928866,0.00071109785,0.0008141928,0.0007656745,0.0015989115,0.0015751669,0.001638293,0.0007916345],"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.00009762673,0.00010076158,0.0027154086,0.00022798301,0.000053510037,0.00024871776,0.00029246294,0.8453018,0.0030272412,0.07177229,0.0018159264,0.074346215],"study_design_scores_gemma":[0.000005481522,0.00002635686,0.00013697885,0.000014516063,0.0000055451837,0.000036270005,0.000033046268,0.9907829,0.00085019914,0.0064753187,0.0016237495,0.000009666205],"about_ca_topic_score_codex":0.0068183467,"about_ca_topic_score_gemma":0.0059037018,"teacher_disagreement_score":0.0068183467,"about_ca_system_score_codex":0.0004957382,"about_ca_system_score_gemma":0.0016455436,"threshold_uncertainty_score":0.01956731},"labels":[],"label_agreement":null},{"id":"W4391845623","doi":"10.1007/s00020-024-02755-w","title":"On the Real and Imaginary Parts of Powers of the Volterra Operator","year":2024,"lang":"en","type":"article","venue":"Integral Equations and Operator Theory","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; The Imaginary; Operator (biology); Mathematical analysis; Algebra over a field; Pure mathematics; Calculus (dental)","score_opus":0.01098849186744714,"score_gpt":0.2498309369753441,"score_spread":0.23884244510789696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391845623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10328933,0.019819988,0.74467117,0.005727998,0.002619197,0.000041148254,0.0001360792,0.00026444145,0.12343061],"genre_scores_gemma":[0.8584966,0.011591372,0.083924994,0.0013102498,0.0034590925,0.00009423633,0.00019150467,0.00055581814,0.04037611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989266,0.00051503244,0.000050393362,0.00013118674,0.00028245384,0.000094382005],"domain_scores_gemma":[0.9941208,0.0045613535,0.0002784429,0.00032427936,0.00048255018,0.00023247277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031777737,0.0015085816,0.0012556483,0.002492257,0.0010391001,0.0036284747,0.0017177173,0.0016858388,0.0060597905],"category_scores_gemma":[0.017531784,0.0007347931,0.0008602468,0.0019116001,0.0061507937,0.009175026,0.0020308073,0.0041605765,0.001101278],"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.000023858986,0.000015762324,0.000067651956,0.0000394575,0.0000074320515,0.000051578427,0.00013703264,0.003951489,0.00050570566,0.98859197,0.0008899108,0.005718058],"study_design_scores_gemma":[0.000004837667,0.0000044511416,0.00004423776,0.000023086437,0.000003991907,0.000035004232,0.000023174212,0.025518335,0.00015779922,0.97298276,0.0011930928,0.000009240023],"about_ca_topic_score_codex":0.0009782158,"about_ca_topic_score_gemma":0.0005933605,"teacher_disagreement_score":0.0060597905,"about_ca_system_score_codex":0.001175771,"about_ca_system_score_gemma":0.0006171692,"threshold_uncertainty_score":0.020272017},"labels":[],"label_agreement":null},{"id":"W4392157513","doi":"10.1016/j.exco.2024.100142","title":"A closer look at some new lower bounds on the minimum singular value of a matrix","year":2024,"lang":"en","type":"article","venue":"Examples and Counterexamples","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Value (mathematics); Mathematics; Singular value; Matrix (chemical analysis); Applied mathematics; Combinatorics; Statistics; Physics; Eigenvalues and eigenvectors; Materials science","score_opus":0.017329478575094155,"score_gpt":0.25140153046421,"score_spread":0.23407205188911584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392157513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014781994,0.026060179,0.9210675,0.005660805,0.0015244439,0.000054352455,0.00028504626,0.00029833106,0.030267451],"genre_scores_gemma":[0.31522927,0.035076782,0.6121294,0.0053804535,0.0110075725,0.00041453098,0.0014854302,0.0010260796,0.018250557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928203,0.0024735886,0.00052254746,0.0015447836,0.0021469726,0.0004918302],"domain_scores_gemma":[0.96622777,0.024227284,0.0019623423,0.0037177803,0.0032978617,0.00056697975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009269314,0.003120943,0.001972591,0.005252993,0.0013364995,0.004934783,0.002076874,0.00223035,0.0071007744],"category_scores_gemma":[0.04668743,0.0007522958,0.0018706965,0.0038042648,0.004772696,0.008911864,0.0033177526,0.012629349,0.0028229752],"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.00034159617,0.000271009,0.0029871725,0.0012368262,0.0002201224,0.0005376828,0.0007914611,0.05891756,0.016822815,0.7471626,0.020446846,0.15026432],"study_design_scores_gemma":[0.00003806333,0.00040955585,0.0024249048,0.000718933,0.00009265266,0.0009042341,0.00028466087,0.2417374,0.009679521,0.6912417,0.05227297,0.00019553289],"about_ca_topic_score_codex":0.0011308682,"about_ca_topic_score_gemma":0.0014037444,"teacher_disagreement_score":0.009269314,"about_ca_system_score_codex":0.0020472626,"about_ca_system_score_gemma":0.0007027106,"threshold_uncertainty_score":0.049021423},"labels":[],"label_agreement":null},{"id":"W4392233769","doi":"10.1007/s10915-024-02464-x","title":"Anderson Acceleration as a Krylov Method with Application to Convergence Analysis","year":2024,"lang":"en","type":"article","venue":"Journal of Scientific Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Acceleration; Convergence (economics); Applied mathematics; Classical mechanics; Physics","score_opus":0.013431212839058945,"score_gpt":0.30794814793370895,"score_spread":0.29451693509465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392233769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015489735,0.00047510889,0.9723538,0.00035611034,0.0003564219,0.00006585739,0.000048917358,0.0004634904,0.0103905825],"genre_scores_gemma":[0.35368228,0.0012355762,0.60456413,0.00030399996,0.00059507653,0.00037857407,0.00017031959,0.0010470799,0.038022995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926823,0.00036141474,0.000028068696,0.000058787762,0.00022477655,0.000058694714],"domain_scores_gemma":[0.99865603,0.00059503934,0.00009372417,0.00014657398,0.00039893732,0.00010973403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015847688,0.0009404353,0.0008633486,0.0013507812,0.00091030536,0.0010428762,0.0012727167,0.0011532931,0.0051134718],"category_scores_gemma":[0.004045796,0.00036957994,0.0009416465,0.0012941147,0.001458982,0.0010189358,0.0019205906,0.0018502718,0.0017014035],"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.00022708403,0.00015663786,0.0007517395,0.00025089388,0.000061418,0.00016661869,0.0002458602,0.1575631,0.0085284775,0.7301573,0.007489145,0.09440178],"study_design_scores_gemma":[0.000019767795,0.00005297265,0.00012651528,0.00001523401,0.000012795955,0.000048332895,0.000019281095,0.9250119,0.0016324524,0.068488635,0.0045481045,0.000024020093],"about_ca_topic_score_codex":0.0023548354,"about_ca_topic_score_gemma":0.002986734,"teacher_disagreement_score":0.0051134718,"about_ca_system_score_codex":0.000535599,"about_ca_system_score_gemma":0.0014026319,"threshold_uncertainty_score":0.017106295},"labels":[],"label_agreement":null},{"id":"W4392270455","doi":"","title":"Optimizations of hybrid sparse linear solvers relying on Schur complement and domain decomposition approaches","year":2015,"lang":"fr","type":"preprint","venue":"theses.fr (ABES)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Schur complement; Domain decomposition methods; Complement (music); Decomposition; Computer science; Parallel computing; Schur decomposition; Domain (mathematical analysis); Schur's theorem; Mathematics; Pure mathematics; Chemistry; Engineering; Physics; Eigenvalues and eigenvectors","score_opus":0.1325774396847863,"score_gpt":0.30684953798100856,"score_spread":0.17427209829622226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392270455","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061616544,0.00039205077,0.9258433,0.0002191204,0.00008438584,0.000058561673,0.00011619209,0.0016674899,0.010002401],"genre_scores_gemma":[0.42782775,0.00033996368,0.56045544,0.0001667371,0.000061749764,0.00019939047,0.00040377403,0.0007024019,0.009842858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999564,0.00011385608,0.00001757949,0.000062048945,0.0001707921,0.00007174009],"domain_scores_gemma":[0.99939084,0.00030792266,0.000042651525,0.000096832584,0.0001247337,0.000036952533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052097935,0.0008804519,0.00076290837,0.000558662,0.00039377954,0.0010164067,0.0008792409,0.0007144432,0.007056571],"category_scores_gemma":[0.0014424868,0.00040063835,0.00069682044,0.00062527275,0.0005827059,0.0010450488,0.0015098577,0.0010241283,0.0010759368],"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.00042081013,0.00013777445,0.0012974787,0.00037967207,0.00012453116,0.00020535421,0.00023536633,0.7096027,0.033181682,0.051772714,0.0050754184,0.19756652],"study_design_scores_gemma":[0.000025564466,0.00005121167,0.00014178116,0.000014072053,0.000011044924,0.000029557776,0.000039326136,0.9872515,0.004719969,0.0051022964,0.0026056985,0.000007907314],"about_ca_topic_score_codex":0.0039038663,"about_ca_topic_score_gemma":0.009056792,"teacher_disagreement_score":0.007056571,"about_ca_system_score_codex":0.00054894626,"about_ca_system_score_gemma":0.001010193,"threshold_uncertainty_score":0.023606539},"labels":[],"label_agreement":null},{"id":"W4392367436","doi":"10.13001/ela.2024.8491","title":"The numerical range of matrix products","year":2024,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"McGill University","funders":"","keywords":"Mathematics; Numerical range; Matrix (chemical analysis); Range (aeronautics); Pure mathematics; Algebra over a field; Chemistry","score_opus":0.006577779928596201,"score_gpt":0.25522844220933383,"score_spread":0.24865066228073762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392367436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16642329,0.0023023998,0.77963024,0.0027587893,0.0002077531,0.000035029127,0.00031679682,0.0005541202,0.047771513],"genre_scores_gemma":[0.9049476,0.0010098475,0.09015617,0.00031250398,0.00021901535,0.000090256166,0.00031067207,0.0002059579,0.0027480205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961824,0.0011379498,0.0002654151,0.0007251116,0.001466085,0.00022293821],"domain_scores_gemma":[0.9835317,0.010685194,0.0013684753,0.002353595,0.0015071025,0.00055387395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035507726,0.0005620037,0.0007006537,0.0013032052,0.0007699974,0.0038078013,0.0016916953,0.0009890571,0.004921983],"category_scores_gemma":[0.03838103,0.0004606735,0.0005266502,0.0010158699,0.0045063067,0.009018357,0.0029948214,0.0025493647,0.0009989229],"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.0001798766,0.000043848962,0.002591681,0.00020949615,0.00003354452,0.00024971395,0.0004611662,0.04898391,0.008212835,0.9071372,0.0012856992,0.030611165],"study_design_scores_gemma":[0.000019014931,0.00006899884,0.0007067883,0.00010130466,0.000013558187,0.00041412198,0.00018636191,0.15473373,0.0077483878,0.8313751,0.0045732404,0.000059374168],"about_ca_topic_score_codex":0.00040966214,"about_ca_topic_score_gemma":0.00025820328,"teacher_disagreement_score":0.004921983,"about_ca_system_score_codex":0.0006946659,"about_ca_system_score_gemma":0.0005614132,"threshold_uncertainty_score":0.018778503},"labels":[],"label_agreement":null},{"id":"W4392868845","doi":"10.1016/j.amc.2024.128651","title":"Computationally efficient orthogonalization for pairwise comparisons method","year":2024,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Orthogonalization; Pairwise comparison; Matrix (chemical analysis); Mathematics; Product (mathematics); Matrix algebra; Applied mathematics; Matrix multiplication; Algorithm; Computer science; Statistics; Geometry; Eigenvalues and eigenvectors","score_opus":0.021706935032214412,"score_gpt":0.30074275785324134,"score_spread":0.2790358228210269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392868845","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027251085,0.000092543254,0.99570894,0.000072785944,0.000046165158,0.00008532512,0.000066804874,0.00029603817,0.00090619986],"genre_scores_gemma":[0.054757178,0.00015522253,0.94095993,0.00010264329,0.00009929336,0.0005575887,0.00039914472,0.00024302446,0.002726027],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9939036,0.003009355,0.00026702133,0.0006525557,0.0017714415,0.00039601387],"domain_scores_gemma":[0.99162275,0.005003998,0.00033325359,0.0013654154,0.00142528,0.00024929908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040812786,0.0011337785,0.0018196676,0.0013378749,0.0011755896,0.0012851525,0.0024916597,0.0009417928,0.015555524],"category_scores_gemma":[0.018117204,0.000716959,0.001329622,0.002190487,0.0012209144,0.002370864,0.0040655592,0.002700389,0.003676365],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005953934,0.00030017525,0.00071841443,0.000508489,0.00017225559,0.00017439517,0.00026203494,0.103763886,0.010754457,0.12486378,0.014587822,0.7432989],"study_design_scores_gemma":[0.00014151432,0.00021959573,0.00045621215,0.000036892183,0.000053235504,0.00021457182,0.00014070435,0.85365283,0.005933715,0.13043655,0.008662024,0.00005213787],"about_ca_topic_score_codex":0.0030902089,"about_ca_topic_score_gemma":0.004967621,"teacher_disagreement_score":0.015555524,"about_ca_system_score_codex":0.00075196964,"about_ca_system_score_gemma":0.004154843,"threshold_uncertainty_score":0.05203843},"labels":[],"label_agreement":null},{"id":"W4393151132","doi":"10.23952/asvao.6.2024.2.06","title":"A self-adaptive iterative method for a split equality problem","year":2024,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Iterative method; Mathematical optimization; Algorithm; Mathematics","score_opus":0.016049757258769275,"score_gpt":0.2901077503484342,"score_spread":0.27405799308966494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393151132","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036029539,0.000039039613,0.99504906,0.00004818538,0.000015879701,0.000028345396,0.000004226242,0.000035674584,0.0011766177],"genre_scores_gemma":[0.26957107,0.00013413145,0.7246057,0.00010401879,0.00003686322,0.00036511943,0.000041781423,0.00007170999,0.0050695734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996388,0.000112235684,0.000017128927,0.000059142414,0.00014541714,0.000027302598],"domain_scores_gemma":[0.9995436,0.00024378122,0.000042445645,0.000032348027,0.000104901,0.000032944597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011137282,0.00045493955,0.0005800679,0.0004552662,0.00037290866,0.0006127009,0.0013291826,0.0010847176,0.0035100656],"category_scores_gemma":[0.0018517193,0.00030985157,0.00056391984,0.00036345667,0.00086847576,0.00086457655,0.0014985907,0.001080447,0.00052221236],"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.0000942262,0.00010136605,0.000659805,0.00019093028,0.00005830858,0.00015684108,0.00023830056,0.74630404,0.013713248,0.10677013,0.0013905365,0.13032226],"study_design_scores_gemma":[0.0000088202305,0.000028221642,0.000025681473,0.0000062827517,0.0000029640987,0.000016544733,0.0000070637325,0.9946582,0.000728352,0.003715323,0.0007986613,0.0000039720953],"about_ca_topic_score_codex":0.0013831839,"about_ca_topic_score_gemma":0.0012610453,"teacher_disagreement_score":0.0035100656,"about_ca_system_score_codex":0.0004439157,"about_ca_system_score_gemma":0.0008760923,"threshold_uncertainty_score":0.011742294},"labels":[],"label_agreement":null},{"id":"W4393300415","doi":"10.48550/arxiv.2403.18574","title":"A Proof of the Box Conjecture for Commuting Pairs of Matrices","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Mathematics; Combinatorics","score_opus":0.04049058011068205,"score_gpt":0.1916405388741482,"score_spread":0.15114995876346615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393300415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23055904,0.0011070815,0.70396507,0.00378676,0.0010355645,0.00015013265,0.0009636808,0.0011369938,0.05729568],"genre_scores_gemma":[0.80408424,0.00082742254,0.17118275,0.0016803369,0.00073569256,0.0003347789,0.0010983265,0.00039708972,0.019659393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999046,0.00021111955,0.000041233205,0.00022199302,0.000317077,0.00016258791],"domain_scores_gemma":[0.9955433,0.0026544489,0.00026182906,0.000682176,0.00046673586,0.00039155284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016209817,0.0008563889,0.0015000413,0.000934296,0.0013519529,0.0016412344,0.0009997411,0.0011584763,0.015924906],"category_scores_gemma":[0.007860231,0.0005840211,0.0009850506,0.0010590808,0.0027490766,0.0049056127,0.004977816,0.0032467998,0.0022382108],"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.00012087538,0.000085042404,0.0012435259,0.00016560007,0.000020625275,0.0004139015,0.000529165,0.0032594053,0.0036754876,0.96733254,0.00735236,0.015801609],"study_design_scores_gemma":[0.000049323746,0.00007252487,0.00042901796,0.00006790623,0.000014560174,0.00022452151,0.00015248146,0.020955184,0.001968095,0.9678421,0.0081960885,0.000028152324],"about_ca_topic_score_codex":0.00074413995,"about_ca_topic_score_gemma":0.0007824845,"teacher_disagreement_score":0.015924906,"about_ca_system_score_codex":0.0005970349,"about_ca_system_score_gemma":0.00077065406,"threshold_uncertainty_score":0.053274095},"labels":[],"label_agreement":null},{"id":"W4393970828","doi":"10.1002/9781119763222.app2","title":"Evaluation of Singular Integrals","year":2024,"lang":"en","type":"other","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics","score_opus":0.0317825912869914,"score_gpt":0.310160568117874,"score_spread":0.2783779768308826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393970828","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04175607,0.0018621526,0.7070312,0.0008099076,0.0006054771,0.00009143355,0.00031756028,0.002064026,0.24546227],"genre_scores_gemma":[0.5551593,0.0015529058,0.30810788,0.00035242914,0.0006116295,0.00011163017,0.0009767093,0.004058228,0.12906924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984744,0.00035197882,0.000053230324,0.00015482142,0.00083662156,0.00012894922],"domain_scores_gemma":[0.9981743,0.0004935567,0.00012029581,0.0003869876,0.0006653069,0.0001595939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014306001,0.0010641336,0.0010607601,0.0029062985,0.0011002142,0.003451204,0.0012170254,0.0008397043,0.02078282],"category_scores_gemma":[0.007976463,0.0003403831,0.0005821288,0.0018931943,0.0015175518,0.0027934893,0.0020439385,0.0014079483,0.005562999],"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.00015721221,0.00007577928,0.00048652932,0.00023928008,0.00004069874,0.00015995008,0.00017083785,0.014126502,0.005385376,0.816158,0.018103635,0.14489621],"study_design_scores_gemma":[0.000028641112,0.00003867179,0.00053019857,0.00011154818,0.000030509715,0.0003318181,0.00009986412,0.27632543,0.015982723,0.678497,0.027992932,0.000030650106],"about_ca_topic_score_codex":0.0010273923,"about_ca_topic_score_gemma":0.0017346499,"teacher_disagreement_score":0.02078282,"about_ca_system_score_codex":0.0012122882,"about_ca_system_score_gemma":0.0010207575,"threshold_uncertainty_score":0.06952548},"labels":[],"label_agreement":null},{"id":"W4393971160","doi":"10.1002/9781119763222.app5","title":"Basis Definitions of Dyadic, Tensor, and Operations with Them","year":2024,"lang":"en","type":"other","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Basis (linear algebra); Tensor (intrinsic definition); Computer science; Mathematics; Psychology; Pure mathematics; Geometry","score_opus":0.025586794602803546,"score_gpt":0.22651195063527965,"score_spread":0.2009251560324761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393971160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009801031,0.0054334886,0.8122239,0.002415303,0.0032646374,0.000089302535,0.00094335095,0.0011886111,0.16464034],"genre_scores_gemma":[0.18658336,0.0061054514,0.6870334,0.0022432443,0.003209165,0.0006099378,0.0017577108,0.0028551833,0.109602615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799985,0.0006274123,0.00017409223,0.00047369231,0.00052999245,0.00019500809],"domain_scores_gemma":[0.99823123,0.00033459917,0.00015493332,0.0005016985,0.00060908025,0.00016846988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021703134,0.0015788737,0.0010055965,0.0032582039,0.0021935042,0.0056824978,0.0016361239,0.0013641865,0.01785112],"category_scores_gemma":[0.0044075474,0.0004994189,0.0010715807,0.005050266,0.0042651915,0.00784166,0.0032299012,0.004328096,0.009123008],"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.000009063118,0.000005907785,0.000038504862,0.000022970804,0.0000020867467,0.000009178385,0.000073849886,0.00009244645,0.00019947115,0.9834477,0.0054128263,0.010686131],"study_design_scores_gemma":[0.000005901007,0.000013096002,0.00007340935,0.00004658339,0.0000075106104,0.00015721387,0.00009318131,0.002507238,0.0007518849,0.9096517,0.08667649,0.000015735463],"about_ca_topic_score_codex":0.0015475036,"about_ca_topic_score_gemma":0.0017811143,"teacher_disagreement_score":0.01785112,"about_ca_system_score_codex":0.0012434929,"about_ca_system_score_gemma":0.0013217566,"threshold_uncertainty_score":0.059717953},"labels":[],"label_agreement":null},{"id":"W4394761142","doi":"10.1137/22m1519523","title":"Analyzing Vector Orthogonalization Algorithms","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orthogonalization; Lanczos resampling; Rounding; Algorithm; Hermitian matrix; Orthogonality; Mathematics; Conjugate gradient method; Lanczos algorithm; Krylov subspace; Matrix (chemical analysis); Round-off error; Sequence (biology); Stiefel manifold; Machine epsilon; Iterative method; Eigenvalues and eigenvectors; Computer science","score_opus":0.008949164999574367,"score_gpt":0.2848159887379113,"score_spread":0.27586682373833693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394761142","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011154614,0.00058900454,0.98248935,0.0001649597,0.00006337295,0.000088786146,0.000043262287,0.0002161937,0.0051904973],"genre_scores_gemma":[0.3061643,0.002152603,0.6757243,0.00033569816,0.00024170498,0.0005817448,0.0007356491,0.00056135264,0.013502626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972494,0.0007725434,0.00014103115,0.0003190321,0.0013076835,0.00021033591],"domain_scores_gemma":[0.9954792,0.0019931544,0.00044456997,0.0006992623,0.0013081277,0.00007569074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032231263,0.0007987037,0.0005537687,0.0012447188,0.0006806351,0.0018919692,0.0009140161,0.00078305136,0.0045594843],"category_scores_gemma":[0.013487042,0.00042484573,0.0005757054,0.0014867266,0.0014182208,0.0023993258,0.0020274846,0.0015043096,0.0014244099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012908122,0.000077049255,0.0026976354,0.00026510056,0.00006440501,0.000058715796,0.0002659822,0.17975767,0.0046021426,0.46252915,0.0043753027,0.34517786],"study_design_scores_gemma":[0.000026779302,0.000107565786,0.00044819596,0.00006358522,0.000016954336,0.00008102204,0.00006987307,0.79796356,0.0066674314,0.18108438,0.013447174,0.000023407272],"about_ca_topic_score_codex":0.0015360211,"about_ca_topic_score_gemma":0.0008684311,"teacher_disagreement_score":0.0045594843,"about_ca_system_score_codex":0.00077249075,"about_ca_system_score_gemma":0.0013656139,"threshold_uncertainty_score":0.017045677},"labels":[],"label_agreement":null},{"id":"W4394934440","doi":"10.37236/11860","title":"Improved Bounds for Cross-Sperner Systems","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Computer science","score_opus":0.007972549842715766,"score_gpt":0.26592855346522715,"score_spread":0.25795600362251137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394934440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35002017,0.007786052,0.4458746,0.010338923,0.0009980622,0.0003424713,0.0033877606,0.003608468,0.1776435],"genre_scores_gemma":[0.90129995,0.0015273448,0.072554894,0.0019212065,0.0009843953,0.00049375644,0.0021531784,0.0009909548,0.018074295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906489,0.0019984543,0.00041639747,0.0022183915,0.002872911,0.0018449635],"domain_scores_gemma":[0.953329,0.030710625,0.0028210261,0.007376322,0.0032200958,0.0025428976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068792934,0.0024480168,0.0026799773,0.0056204842,0.003802382,0.0055180383,0.007011384,0.0035391625,0.026658757],"category_scores_gemma":[0.044203524,0.0016740088,0.0022731633,0.0046753986,0.005513542,0.016719231,0.010427152,0.008324084,0.004952096],"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.0006307096,0.00030842042,0.004095017,0.00064501306,0.00017360764,0.00041953675,0.0011086211,0.057425994,0.008008671,0.86815965,0.025309317,0.033715386],"study_design_scores_gemma":[0.0000707118,0.00015214305,0.0011136247,0.00014352628,0.00012571407,0.00040541388,0.00023003409,0.24870566,0.0047041657,0.73440075,0.009831664,0.000116646675],"about_ca_topic_score_codex":0.0017600022,"about_ca_topic_score_gemma":0.0023976353,"teacher_disagreement_score":0.026658757,"about_ca_system_score_codex":0.0046047918,"about_ca_system_score_gemma":0.0017836476,"threshold_uncertainty_score":0.08918238},"labels":[],"label_agreement":null},{"id":"W4395095485","doi":"10.1017/9781108682404.022","title":"Linear Systems, Matrices, and Filtering","year":2024,"lang":"en","type":"other","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"York University; McGill University","funders":"","keywords":"Mathematics; Computer science","score_opus":0.011266654537063422,"score_gpt":0.23995952384843566,"score_spread":0.22869286931137223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395095485","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032294497,0.1751479,0.52588016,0.008369532,0.01129756,0.0001486497,0.0014468166,0.0022690075,0.27221096],"genre_scores_gemma":[0.09124505,0.21603249,0.15501429,0.0040044235,0.014157259,0.0006824911,0.0029936908,0.0007900653,0.5150803],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994128,0.00013938507,0.000033834673,0.00010342386,0.00027412554,0.00003642786],"domain_scores_gemma":[0.99951303,0.00024843484,0.000040203286,0.00005957752,0.00011860886,0.000020232474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004777161,0.0014485643,0.0010821775,0.00091238465,0.00045926718,0.0024486235,0.00065392524,0.0014113253,0.032479286],"category_scores_gemma":[0.0015506455,0.00038174528,0.0005242597,0.0021750624,0.0012346755,0.001741559,0.0011401377,0.0022346792,0.014058992],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059193775,0.000049791375,0.0004586701,0.0014898886,0.0000643526,0.00025846998,0.0003191181,0.021214616,0.0028944383,0.29032227,0.27167264,0.4111966],"study_design_scores_gemma":[0.000014613146,0.00009059792,0.0010590025,0.00043661264,0.000029231183,0.0004993399,0.00018679262,0.045556158,0.001071567,0.22122422,0.7297877,0.00004422132],"about_ca_topic_score_codex":0.0025601694,"about_ca_topic_score_gemma":0.002196302,"teacher_disagreement_score":0.032479286,"about_ca_system_score_codex":0.0007065689,"about_ca_system_score_gemma":0.0008690548,"threshold_uncertainty_score":0.10865402},"labels":[],"label_agreement":null},{"id":"W4396233618","doi":"10.1553/etna_vol60s221","title":"Augmentation-based preconditioners for saddle-point systems with singular leading blocks","year":2024,"lang":"en","type":"article","venue":"ETNA - Electronic Transactions on Numerical Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Saddle point; Mathematics; Saddle; Applied mathematics; Mathematical optimization; Geometry","score_opus":0.007076938154655777,"score_gpt":0.2428377776890942,"score_spread":0.23576083953443844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396233618","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018261649,0.00012346153,0.97672004,0.00012838066,0.000042592725,0.00004240297,0.00003018952,0.00024445294,0.004406811],"genre_scores_gemma":[0.5796166,0.00038491646,0.41226146,0.00008858204,0.00006402274,0.00021939137,0.00012954995,0.00011734017,0.0071180766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997296,0.00012119924,0.000012597037,0.000024300884,0.00007772687,0.000034544417],"domain_scores_gemma":[0.9994717,0.00027173685,0.0000661281,0.00007150691,0.0000708424,0.000048068905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064957,0.0004808641,0.0005417082,0.0002251985,0.0003839464,0.00051917764,0.0005695191,0.0005867783,0.0024008662],"category_scores_gemma":[0.0013847629,0.0002489155,0.0004062829,0.00023309585,0.0009954642,0.00055008184,0.00121656,0.00089090725,0.0006787666],"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.0002026257,0.00007493713,0.00081864407,0.00019935725,0.000030052954,0.00030253833,0.00031994664,0.79675907,0.022231396,0.13740782,0.0018336267,0.03981984],"study_design_scores_gemma":[0.000011852179,0.00003981378,0.000054294527,0.000008417208,0.0000025852937,0.000024454519,0.000014549484,0.98137283,0.0030292687,0.01343062,0.0020054022,0.0000059749586],"about_ca_topic_score_codex":0.0012598861,"about_ca_topic_score_gemma":0.0014803058,"teacher_disagreement_score":0.0024008662,"about_ca_system_score_codex":0.0002585997,"about_ca_system_score_gemma":0.00076510594,"threshold_uncertainty_score":0.008031726},"labels":[],"label_agreement":null},{"id":"W4396817943","doi":"10.1109/synasc61333.2023.00011","title":"Hybrid Intervals and Symbolic Block Matrices","year":2023,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Western University","funders":"","keywords":"Symbolic data analysis; Block (permutation group theory); Matrix multiplication; Symbolic computation; Symbolic trajectory evaluation; The Symbolic; Matrix (chemical analysis); Computer science; Algebra over a field; Theoretical computer science; Mathematics; Arithmetic; Algorithm; Pure mathematics; Combinatorics","score_opus":0.012952629099791349,"score_gpt":0.2482646401059199,"score_spread":0.23531201100612853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396817943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020390924,0.0010310406,0.9555454,0.00021551336,0.00016992266,0.00003516438,0.00022083335,0.00043839158,0.02195275],"genre_scores_gemma":[0.47894967,0.0019337299,0.50066507,0.00031498465,0.0004597255,0.0002833486,0.00066124246,0.00031737718,0.01641481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990362,0.00026788676,0.00007076414,0.00017156774,0.00036746258,0.00008622929],"domain_scores_gemma":[0.99878234,0.00051273376,0.00018054985,0.0002308651,0.00022229222,0.00007131952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063110417,0.0005805599,0.0003904605,0.0010534262,0.0004367401,0.0017845588,0.0008418979,0.000514723,0.0077428655],"category_scores_gemma":[0.0031968912,0.00022451054,0.0004058985,0.0015884859,0.0018881408,0.0033399058,0.00122577,0.0012964285,0.0015920328],"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.00002573009,0.0000067975916,0.00007436854,0.000041131043,0.0000045381803,0.000051413117,0.000105697094,0.0058138315,0.0017056767,0.9692248,0.00083998556,0.02210595],"study_design_scores_gemma":[0.0000117162035,0.00005040458,0.000096746386,0.000032971784,0.000007362853,0.00012957226,0.00007544107,0.057216436,0.002698655,0.9201318,0.019531887,0.000016963762],"about_ca_topic_score_codex":0.000573805,"about_ca_topic_score_gemma":0.00054786116,"teacher_disagreement_score":0.0077428655,"about_ca_system_score_codex":0.00057084596,"about_ca_system_score_gemma":0.00036605785,"threshold_uncertainty_score":0.02590245},"labels":[],"label_agreement":null},{"id":"W4396885339","doi":"10.1007/978-3-031-54908-3_3","title":"Matrix Algebra","year":2024,"lang":"en","type":"book-chapter","venue":"Compact textbooks in mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Royal University","funders":"","keywords":"Algebra over a field; Mathematics; Pure mathematics","score_opus":0.02449024165445234,"score_gpt":0.27739709094036025,"score_spread":0.2529068492859079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396885339","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010182876,0.0064657666,0.020083703,0.0014157087,0.0019608121,0.000021516336,0.00033383162,0.00036208855,0.9683384],"genre_scores_gemma":[0.014069672,0.0043806857,0.005757633,0.0006038607,0.0013339509,0.000043959066,0.00035956356,0.00026010122,0.9731907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99975747,0.000033470238,0.000007269952,0.000039521918,0.00014408138,0.000018146417],"domain_scores_gemma":[0.99985075,0.00003117232,0.000009925764,0.000035234687,0.000053492935,0.000019355999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020445779,0.001001877,0.0006901208,0.0013785778,0.0010130763,0.0027718474,0.0007214758,0.00063624425,0.106905885],"category_scores_gemma":[0.00058484805,0.00036728516,0.0003351804,0.0018261604,0.0011290766,0.0024797195,0.0010029844,0.0020357622,0.057805013],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007936459,0.000022769595,0.000032680826,0.00012442602,0.0000060779143,0.000026810982,0.00013671741,0.00037836793,0.0008006812,0.6993467,0.22041616,0.078700535],"study_design_scores_gemma":[0.0000033732822,0.00001088808,0.00012291077,0.00005685399,0.000003844228,0.00008711457,0.000048787366,0.00077625236,0.00046351904,0.30086434,0.6975544,0.000007636592],"about_ca_topic_score_codex":0.0007886984,"about_ca_topic_score_gemma":0.0018562903,"teacher_disagreement_score":0.106905885,"about_ca_system_score_codex":0.0010077918,"about_ca_system_score_gemma":0.00064267876,"threshold_uncertainty_score":0.3576358},"labels":[],"label_agreement":null},{"id":"W4396885604","doi":"10.1007/978-3-031-54908-3_7","title":"Convolution","year":2024,"lang":"en","type":"book-chapter","venue":"Compact textbooks in mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Royal University","funders":"","keywords":"Mathematics; Computer science","score_opus":0.02929944706904988,"score_gpt":0.26418304500666745,"score_spread":0.23488359793761757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396885604","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047563068,0.0025176317,0.28619733,0.00089974195,0.0016635738,0.000041577627,0.00057815586,0.0027925163,0.7005532],"genre_scores_gemma":[0.097238064,0.0026100746,0.061210696,0.0011300561,0.0011711791,0.00008100371,0.0011865037,0.0019133219,0.8334591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953246,0.000041793097,0.000017281167,0.00015074777,0.00020270054,0.00005503305],"domain_scores_gemma":[0.99959475,0.00006363889,0.000022915308,0.0001427836,0.00012666271,0.00004926381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034122818,0.00086137163,0.0007383385,0.00092830433,0.0007993783,0.0028796692,0.0008393056,0.00087537844,0.09133029],"category_scores_gemma":[0.0013169083,0.00036566338,0.00054946844,0.0009502178,0.0009868043,0.0031558282,0.0017433879,0.0015644082,0.043702677],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004908051,0.00002470207,0.000103997125,0.00009768219,0.000015342313,0.000074848984,0.000071057584,0.0012515907,0.00445575,0.75637317,0.07509963,0.16238323],"study_design_scores_gemma":[0.000010856758,0.00003570109,0.00034581096,0.000047434125,0.000018232266,0.00064442825,0.000048054175,0.015392053,0.0078084734,0.48169717,0.4939242,0.000027553064],"about_ca_topic_score_codex":0.00073830434,"about_ca_topic_score_gemma":0.00069148815,"teacher_disagreement_score":0.09133029,"about_ca_system_score_codex":0.0008481757,"about_ca_system_score_gemma":0.0006437783,"threshold_uncertainty_score":0.30553025},"labels":[],"label_agreement":null},{"id":"W4396904991","doi":"10.28924/2291-8639-22-2024-78","title":"Some Results of n-EP Operators on Hilbert Spaces","year":2024,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hilbert space; Pure mathematics; Linguistics","score_opus":0.008051513197456207,"score_gpt":0.2834196412219754,"score_spread":0.27536812802451915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396904991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24138953,0.025874328,0.5934762,0.0038403117,0.0011171869,0.000120873905,0.00055393943,0.00020623911,0.13342135],"genre_scores_gemma":[0.8648009,0.013726522,0.0928984,0.001464926,0.0028635578,0.00020062742,0.0005396161,0.0001663182,0.023339123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862087,0.00042350244,0.00012579017,0.0002983768,0.0003858349,0.00014557585],"domain_scores_gemma":[0.9971462,0.0015235061,0.00029009514,0.00026076598,0.0004556203,0.00032384152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032946873,0.0009810199,0.0007400488,0.0022401945,0.0011078126,0.001600264,0.000984226,0.0009434349,0.0034373263],"category_scores_gemma":[0.0057415594,0.00037664972,0.0014563237,0.0021454552,0.0031117818,0.0057223625,0.0026774323,0.002941853,0.0005188937],"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.00008500606,0.00007059776,0.0008315011,0.00040288662,0.000041701325,0.0005099817,0.00071770576,0.003241805,0.0044983095,0.9690268,0.0021405027,0.018433308],"study_design_scores_gemma":[0.0000147286355,0.00013869187,0.0011253423,0.000065591164,0.000030937725,0.00048667812,0.00015783483,0.019290438,0.00207934,0.9649209,0.011657273,0.000032211618],"about_ca_topic_score_codex":0.00047247123,"about_ca_topic_score_gemma":0.00032152818,"teacher_disagreement_score":0.0034373263,"about_ca_system_score_codex":0.0009218657,"about_ca_system_score_gemma":0.00055684225,"threshold_uncertainty_score":0.017424226},"labels":[],"label_agreement":null},{"id":"W4398599675","doi":"10.7910/dvn/bflott/m04jca","title":"tableA1.txt","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Toronto","funders":"","keywords":"Computer science","score_opus":0.014594914401229475,"score_gpt":0.22861572948222,"score_spread":0.21402081508099052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398599675","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006228669,0.000047066074,0.000055672637,0.00006972619,0.00003700122,0.00001401685,0.9985922,0.00035057185,0.0007713456],"genre_scores_gemma":[0.0003814259,0.000066840425,0.00032563013,0.00012297706,0.000024262034,0.00015413058,0.9971456,0.00022222994,0.0015569963],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99837,0.00026715008,0.0002453055,0.00049355975,0.00038929077,0.0002347361],"domain_scores_gemma":[0.99376124,0.0025647685,0.00046105537,0.0012430516,0.0014556798,0.0005141115],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017371782,0.0025930984,0.0019455604,0.0047219847,0.0011712572,0.004095016,0.0030146816,0.0019416532,0.38944435],"category_scores_gemma":[0.017583545,0.00082327786,0.0012711091,0.008786327,0.00066584855,0.0024138407,0.002468396,0.002157465,0.36990306],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023398325,0.000013290732,0.00021448192,0.00033282684,0.000009578718,0.0000049694113,0.000006769752,0.00007126664,0.000028509277,0.00016231176,0.99811125,0.0010212999],"study_design_scores_gemma":[0.00032965041,0.000030875504,0.0021069027,0.00029023766,0.00002872572,0.000048713715,0.00008904013,0.00031203622,0.00025884085,0.0023337794,0.9941467,0.0000244997],"about_ca_topic_score_codex":0.009339522,"about_ca_topic_score_gemma":0.021674389,"teacher_disagreement_score":0.61055565,"about_ca_system_score_codex":0.0015849371,"about_ca_system_score_gemma":0.0024533966,"threshold_uncertainty_score":0.8708835},"labels":[],"label_agreement":null},{"id":"W4398709430","doi":"10.7910/dvn/k0oyqf/im95cl","title":"tableA2.txt","year":2019,"lang":"it","type":"dataset","venue":"Harvard Dataverse","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.019915477818838276,"score_gpt":0.24437135075054875,"score_spread":0.2244558729317105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398709430","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000061219616,0.000039284456,0.000052759464,0.000088657216,0.00004140774,0.000013227454,0.99827373,0.00063471653,0.00079505745],"genre_scores_gemma":[0.0005584189,0.000078196674,0.00034899803,0.00015978949,0.000033853623,0.00018045961,0.9967468,0.0003832346,0.0015102508],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984188,0.00021532035,0.0002362068,0.00048117054,0.0003348945,0.0003134973],"domain_scores_gemma":[0.9931183,0.0024908732,0.0005657556,0.0015205411,0.0015630997,0.0007414573],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015547755,0.0029475442,0.0023607856,0.0049523665,0.0014606356,0.0059819403,0.0039012474,0.0026483967,0.37522042],"category_scores_gemma":[0.016549086,0.00090790907,0.0015757768,0.0099902125,0.00068670395,0.0025103611,0.0030014922,0.0028726754,0.35269442],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039127044,0.000015113431,0.00021583671,0.0004584608,0.00001725886,0.000007893233,0.000010420418,0.00006492507,0.000045442866,0.00024422776,0.99779874,0.0010824135],"study_design_scores_gemma":[0.00045736425,0.000029828117,0.0016534184,0.00034167938,0.000032024378,0.000044808454,0.00007819459,0.0003170468,0.00035015235,0.002550714,0.9941163,0.000028490515],"about_ca_topic_score_codex":0.008610157,"about_ca_topic_score_gemma":0.015121771,"teacher_disagreement_score":0.6247796,"about_ca_system_score_codex":0.0017142163,"about_ca_system_score_gemma":0.002904646,"threshold_uncertainty_score":0.89117223},"labels":[],"label_agreement":null},{"id":"W4398728215","doi":"10.7910/dvn/k0oyqf/rsh0wg","title":"tableA4.txt","year":2019,"lang":"it","type":"dataset","venue":"Harvard Dataverse","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Geography","score_opus":0.019915477818838276,"score_gpt":0.24437135075054875,"score_spread":0.2244558729317105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398728215","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006366345,0.000041434818,0.00005743018,0.00009647151,0.000045132096,0.000013896752,0.99806756,0.0007335537,0.0008809056],"genre_scores_gemma":[0.00059405685,0.0000863933,0.00038502042,0.00016637871,0.000036753692,0.00018756014,0.9964154,0.00043327315,0.0016951396],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99840325,0.00022307497,0.0002404407,0.00046794143,0.00034091482,0.00032440506],"domain_scores_gemma":[0.9930534,0.0025022954,0.0005508569,0.0015567794,0.001610937,0.00072579127],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015845296,0.0029613557,0.0023202565,0.00499819,0.0014376724,0.005842292,0.0040018684,0.0025840988,0.38097793],"category_scores_gemma":[0.016929144,0.0009053033,0.0016362095,0.010126535,0.0006911887,0.0025331683,0.0030162684,0.0028178429,0.35841247],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037480047,0.000013866097,0.00019749232,0.00041906486,0.00001692004,0.000006922831,0.000009539549,0.00006243532,0.000040653023,0.00023164973,0.9978909,0.0010731006],"study_design_scores_gemma":[0.0004659321,0.000029826153,0.0016454539,0.0003409281,0.000032264958,0.000040896015,0.00007888343,0.00032438396,0.00035651997,0.002706232,0.99395025,0.000028313745],"about_ca_topic_score_codex":0.009028522,"about_ca_topic_score_gemma":0.015448293,"teacher_disagreement_score":0.6190221,"about_ca_system_score_codex":0.0017881136,"about_ca_system_score_gemma":0.0029922556,"threshold_uncertainty_score":0.88295984},"labels":[],"label_agreement":null},{"id":"W4399123160","doi":"10.22331/q-2024-05-29-1363","title":"Covariant operator bases for continuous variables","year":2024,"lang":"en","type":"article","venue":"Quantum","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación; European Commission","keywords":"Covariant transformation; Operator (biology); Mathematics; Algebra over a field; Pure mathematics; Mathematical physics; Chemistry","score_opus":0.015178519905078272,"score_gpt":0.2598371725324019,"score_spread":0.24465865262732364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399123160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015679901,0.0004287507,0.973898,0.00028749226,0.0001478147,0.000035783512,0.00017817244,0.00013948859,0.009204549],"genre_scores_gemma":[0.3036046,0.0015946737,0.6819822,0.0004772547,0.0004964015,0.00022451827,0.00069590536,0.000364983,0.010559453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999091,0.00028335836,0.00005466756,0.00011712926,0.000369723,0.000084126266],"domain_scores_gemma":[0.9986217,0.00037686847,0.0001383308,0.00040512055,0.00034188814,0.00011613502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015371236,0.00052356604,0.0004882749,0.0014218573,0.0006534698,0.0019230291,0.0014296869,0.00071617676,0.0056688893],"category_scores_gemma":[0.003404788,0.00026175322,0.00051414536,0.0012589367,0.0019633379,0.0024370386,0.0017572683,0.0020688116,0.0014759593],"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.000004616461,0.00001119962,0.000030323909,0.00001775262,0.0000019785043,0.000015327085,0.000056178415,0.0022686783,0.0012226382,0.98967475,0.00041197153,0.006284602],"study_design_scores_gemma":[0.000007252274,0.0000207288,0.00005798265,0.00001635354,0.0000029975718,0.000044407436,0.000032310207,0.05423304,0.0011296557,0.9359101,0.008531843,0.00001325816],"about_ca_topic_score_codex":0.0008330002,"about_ca_topic_score_gemma":0.0009860059,"teacher_disagreement_score":0.0056688893,"about_ca_system_score_codex":0.0005745145,"about_ca_system_score_gemma":0.00095032156,"threshold_uncertainty_score":0.01896429},"labels":[],"label_agreement":null},{"id":"W4399285167","doi":"10.1016/j.laa.2024.05.019","title":"Generalized unistochastic matrices","year":2024,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"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":"Agence Nationale de la Recherche; Providence Health Care","keywords":"Mathematics; Pure mathematics; Combinatorics","score_opus":0.0115635971739924,"score_gpt":0.26076094863007415,"score_spread":0.24919735145608174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399285167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26801062,0.0017893441,0.6420631,0.0016159213,0.00086636265,0.00012583072,0.00068085233,0.0007794819,0.084068544],"genre_scores_gemma":[0.9037539,0.0010254539,0.047819287,0.000747336,0.0006324245,0.00016994678,0.0003790292,0.00015826001,0.045314457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990681,0.00022646692,0.00003992475,0.00025291258,0.00024622967,0.0001665433],"domain_scores_gemma":[0.9977458,0.0005486353,0.00034652854,0.00063670037,0.00046156018,0.0002607892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086904154,0.0009156818,0.0007469936,0.0020687308,0.0015122361,0.001777525,0.0010903354,0.00086198706,0.011265229],"category_scores_gemma":[0.0045656003,0.00033798168,0.00061280833,0.0019951141,0.0024980144,0.0030399603,0.002368517,0.0018085574,0.0016031326],"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.000058984035,0.000026575872,0.00026746464,0.0000329667,0.000011092045,0.00009676901,0.000104420316,0.0043939357,0.001195624,0.977829,0.0016947975,0.014288432],"study_design_scores_gemma":[0.000010057712,0.00002694213,0.00019041667,0.000014100568,0.0000056566973,0.00012486604,0.000058852016,0.02007978,0.00091301394,0.97547853,0.0030763715,0.000021365788],"about_ca_topic_score_codex":0.0008245474,"about_ca_topic_score_gemma":0.0015615812,"teacher_disagreement_score":0.011265229,"about_ca_system_score_codex":0.000782903,"about_ca_system_score_gemma":0.0011627731,"threshold_uncertainty_score":0.03768593},"labels":[],"label_agreement":null},{"id":"W4399650109","doi":"10.32614/cran.package.expm","title":"expm: Matrix Exponential, Log, 'etc'","year":2010,"lang":"en","type":"dataset","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Actua","funders":"","keywords":"Matrix exponential; Exponential function; Matrix (chemical analysis); Mathematics; Applied mathematics; Statistics; Mathematical analysis; Chemistry; Chromatography","score_opus":0.010789515664879241,"score_gpt":0.26584546977969414,"score_spread":0.2550559541148149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399650109","genre_codex":"dataset","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009211966,0.000243169,0.0017438314,0.00015302714,0.000089361456,0.00005210639,0.9857626,0.009578723,0.0014559131],"genre_scores_gemma":[0.0017882386,0.00016270182,0.00485832,0.00012166342,0.000030542793,0.00023110703,0.99080867,0.00092563627,0.0010731257],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983589,0.00022099381,0.00024436906,0.00047113118,0.0004871074,0.00021749106],"domain_scores_gemma":[0.99725384,0.0006644995,0.00026469523,0.0011080712,0.0005640179,0.00014486698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014897635,0.0051608547,0.0020596618,0.0040976657,0.000775128,0.0026276733,0.0049434076,0.0020175695,0.029262058],"category_scores_gemma":[0.00782722,0.0010501943,0.002197347,0.0065431357,0.0005269781,0.0024703473,0.0019517869,0.0028035026,0.056179494],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012255753,0.000051036106,0.00090613554,0.00065958954,0.00004329181,0.000020601226,0.000011896316,0.00074707076,0.0002295577,0.0007053155,0.9889487,0.0075542703],"study_design_scores_gemma":[0.00067808374,0.00010065919,0.0061691403,0.00022603004,0.000062663166,0.00030264803,0.00007928864,0.00789967,0.004216021,0.007515383,0.9726404,0.00011007466],"about_ca_topic_score_codex":0.010934445,"about_ca_topic_score_gemma":0.023162084,"teacher_disagreement_score":0.029262058,"about_ca_system_score_codex":0.0015799678,"about_ca_system_score_gemma":0.0019809043,"threshold_uncertainty_score":0.09789139},"labels":[],"label_agreement":null},{"id":"W4400084052","doi":"10.1007/978-3-031-57603-4_10","title":"Separable Lagrangian Decomposition for Quasi-Separable Problems","year":2024,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Separable space; Lagrangian; Decomposition; Mathematics; Applied mathematics; Mathematical optimization; Pure mathematics; Computer science; Mathematical analysis; Chemistry","score_opus":0.0479439220802452,"score_gpt":0.4080345634205771,"score_spread":0.36009064134033186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400084052","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0082979435,0.00093833543,0.96207464,0.00062939303,0.00020714248,0.000045993722,0.00018222001,0.000092200295,0.02753212],"genre_scores_gemma":[0.26395515,0.0033430338,0.64089644,0.00063557265,0.00075634423,0.0005899787,0.0011380756,0.00079061417,0.08789473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999464,0.00023410573,0.000020985493,0.000056656616,0.00016350074,0.00006087162],"domain_scores_gemma":[0.9989988,0.00054684543,0.00007677608,0.000110929315,0.00014631837,0.0001202076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015447543,0.0014234945,0.0010103601,0.00096040824,0.0004895586,0.0018625886,0.0012945308,0.0009400482,0.011003728],"category_scores_gemma":[0.0032920546,0.00071036734,0.0010291149,0.0013009786,0.001446363,0.003086712,0.0021249985,0.0042557707,0.0015429623],"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.000060543793,0.00007494099,0.00007332803,0.00021019904,0.000025708201,0.000050722167,0.00009458452,0.0532945,0.0012201983,0.9039292,0.009803527,0.031162636],"study_design_scores_gemma":[0.0000294289,0.00003661375,0.00008523399,0.000041099185,0.000011939188,0.000029075502,0.000034918896,0.29885057,0.000283944,0.6941289,0.006457115,0.000011248564],"about_ca_topic_score_codex":0.0015402018,"about_ca_topic_score_gemma":0.0021051483,"teacher_disagreement_score":0.011003728,"about_ca_system_score_codex":0.0012253573,"about_ca_system_score_gemma":0.0012175315,"threshold_uncertainty_score":0.036811173},"labels":[],"label_agreement":null},{"id":"W4400340357","doi":"10.48550/arxiv.2407.00706","title":"Sum-of-norms regularized Nonnegative Matrix Factorization","year":2024,"lang":"en","type":"preprint","venue":"ePrints Soton (University of Southampton)","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":"Natural Sciences and Engineering Research Council of Canada; Division of Mathematical Sciences; University of Waterloo","keywords":"Factorization; Non-negative matrix factorization; Matrix decomposition; Matrix (chemical analysis); Mathematics; Nonnegative matrix; Pure mathematics; Algebra over a field; Applied mathematics; Mathematical economics; Physics; Algorithm; Symmetric matrix; Eigenvalues and eigenvectors; Materials science","score_opus":0.01256255319855981,"score_gpt":0.22728436341603547,"score_spread":0.21472181021747566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400340357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029430282,0.00020262555,0.99556917,0.00011230457,0.00005561638,0.00003233033,0.00011023559,0.00023969804,0.0007350007],"genre_scores_gemma":[0.15792578,0.000708428,0.8351579,0.00032509415,0.00024135962,0.00038326206,0.001419701,0.0003327699,0.0035057638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980331,0.0006319714,0.00010568708,0.0005202227,0.00055017276,0.0001588648],"domain_scores_gemma":[0.99756384,0.0012067385,0.00025274913,0.00029533054,0.000588939,0.00009247017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020479145,0.0023762228,0.0018229411,0.00092938764,0.0006553643,0.0013661309,0.0014796046,0.0015791354,0.0026095442],"category_scores_gemma":[0.0076674633,0.0006754923,0.0015585152,0.0011266555,0.0014865523,0.0019201866,0.0014081313,0.0027967934,0.0013452992],"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.00024615182,0.00014511085,0.0012160961,0.00061156496,0.00020122108,0.0003051601,0.0002505989,0.66155255,0.015228615,0.058542807,0.017252164,0.244448],"study_design_scores_gemma":[0.00001150669,0.000026562824,0.000109839755,0.000016970986,0.000009385327,0.000043166903,0.000020142552,0.9808543,0.0011888914,0.01583398,0.001871202,0.00001413863],"about_ca_topic_score_codex":0.0038237933,"about_ca_topic_score_gemma":0.0062248926,"teacher_disagreement_score":0.0038237933,"about_ca_system_score_codex":0.00073890015,"about_ca_system_score_gemma":0.0016568904,"threshold_uncertainty_score":0.010830522},"labels":[],"label_agreement":null},{"id":"W4400348129","doi":"10.1016/j.dam.2024.06.006","title":"Improving the Caro–Wei bound and applications to Turán stability","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canadian Institutes of Health Research; Government of Ontario; National Science Foundation","keywords":"Mathematics; Stability (learning theory); Combinatorics; Upper and lower bounds; Computer science; Mathematical analysis","score_opus":0.014677408376058179,"score_gpt":0.25225150570604343,"score_spread":0.23757409732998525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400348129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04809141,0.0064945607,0.84196454,0.005135781,0.0019787673,0.00008755529,0.0002218727,0.00087111327,0.09515435],"genre_scores_gemma":[0.7848009,0.004383034,0.15847197,0.0021680216,0.0028348763,0.00036076122,0.0003673337,0.0013740148,0.04523909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980332,0.00076873595,0.00007248336,0.00033630477,0.00055227615,0.00023699293],"domain_scores_gemma":[0.99171513,0.0051186415,0.00039520726,0.0010865544,0.0012075041,0.00047698154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036535957,0.0018690572,0.0021133912,0.0043587633,0.0026830647,0.0034142355,0.002538992,0.0026823415,0.0118277185],"category_scores_gemma":[0.022794064,0.0005752967,0.0013768617,0.003365928,0.004500014,0.007034138,0.0059265695,0.0061097834,0.0026935248],"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.00009737894,0.00006183853,0.00058224506,0.00011578205,0.000037046913,0.00006152018,0.00018828084,0.029753027,0.0013202678,0.9211851,0.009187758,0.037409887],"study_design_scores_gemma":[0.000010141081,0.00003019551,0.00022810807,0.000045196917,0.000017826382,0.000037576698,0.000047523874,0.20015314,0.0008336771,0.7922011,0.0063612834,0.000034193195],"about_ca_topic_score_codex":0.0030749706,"about_ca_topic_score_gemma":0.004130038,"teacher_disagreement_score":0.0118277185,"about_ca_system_score_codex":0.0024533244,"about_ca_system_score_gemma":0.001429614,"threshold_uncertainty_score":0.03956765},"labels":[],"label_agreement":null},{"id":"W4400521140","doi":"10.1016/j.laa.2024.07.005","title":"On the invertibility of matrices with a double saddle-point structure","year":2024,"lang":"en","type":"article","venue":"Linear Algebra and its 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":"University of British Columbia; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Saddle point; Saddle; Block matrix; Rank (graph theory); Diagonal; Inverse; Block (permutation group theory); Point (geometry); Diagonal matrix; Matrix (chemical analysis); Pure mathematics; Combinatorics; Eigenvalues and eigenvectors; Geometry; Mathematical optimization","score_opus":0.010897290720025737,"score_gpt":0.23851726399962295,"score_spread":0.2276199732795972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400521140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1951808,0.00024036484,0.78119564,0.00037929366,0.00007533418,0.00008400954,0.00016226653,0.00020331403,0.022478973],"genre_scores_gemma":[0.9476639,0.00033554784,0.048723724,0.00009586379,0.00006703127,0.00012568892,0.00025458355,0.000072806666,0.0026608484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995764,0.00009067829,0.000027528877,0.00008849211,0.0001220254,0.00009494397],"domain_scores_gemma":[0.9963899,0.0020523814,0.00056000496,0.0002556927,0.000472767,0.00026919614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010301557,0.0009791082,0.0008261962,0.00080940756,0.0006485456,0.0011357886,0.0006789597,0.0009609533,0.0062619126],"category_scores_gemma":[0.008594204,0.0004165711,0.00071545097,0.00039496645,0.0021449141,0.0014873672,0.0017753713,0.0014002449,0.00089422456],"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.00012097458,0.000089344176,0.0026864288,0.00023452027,0.000046092882,0.0013864965,0.0004843182,0.08228802,0.022806473,0.8721605,0.0017828477,0.015913969],"study_design_scores_gemma":[0.000042543532,0.00014970113,0.00066065247,0.000058195936,0.000014816384,0.00059750077,0.0002291657,0.53008133,0.006162059,0.4606836,0.0012717692,0.000048601483],"about_ca_topic_score_codex":0.0005158942,"about_ca_topic_score_gemma":0.00048311675,"teacher_disagreement_score":0.0062619126,"about_ca_system_score_codex":0.00026851895,"about_ca_system_score_gemma":0.0006488285,"threshold_uncertainty_score":0.020948172},"labels":[],"label_agreement":null},{"id":"W4400580907","doi":"10.1137/23m1573963","title":"Efficient Tensor-Product Spectral-Element Operators with the Summation-by-Parts Property on Curved Triangles and Tetrahedra","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Mathematics; Tetrahedron; Tensor product; Property (philosophy); Product (mathematics); Tensor (intrinsic definition); Element (criminal law); Mathematical analysis; Pure mathematics; Algebra over a field; Geometry","score_opus":0.01615515584100186,"score_gpt":0.24769085934267274,"score_spread":0.23153570350167088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400580907","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008366251,0.00007871224,0.988608,0.00005490176,0.000035972334,0.000029662533,0.000032223594,0.00014793253,0.0026463293],"genre_scores_gemma":[0.24042423,0.00021004568,0.75303775,0.00008849433,0.000033218686,0.00014840519,0.00019933684,0.0002574584,0.0056009856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995085,0.0001258206,0.000024131743,0.00003458203,0.00027437307,0.000032499454],"domain_scores_gemma":[0.99920326,0.00027704443,0.00007817095,0.00018376265,0.00019939886,0.000058466154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007481488,0.00047744092,0.00040690188,0.00039385783,0.00033722437,0.00083178456,0.001011539,0.00067701715,0.0030533182],"category_scores_gemma":[0.0024739525,0.00026664688,0.00059393793,0.00060615427,0.0009212514,0.0013181512,0.0015433047,0.001070849,0.0011976355],"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.00010775845,0.00007776405,0.0007465962,0.00028719613,0.000043541593,0.00021688896,0.00062957086,0.28322703,0.056686055,0.5305452,0.0037847399,0.12364768],"study_design_scores_gemma":[0.000008743259,0.000029404504,0.000070570306,0.000014282148,0.0000046500154,0.000064348205,0.00004375538,0.93881375,0.0072049946,0.048252277,0.0054825936,0.000010599784],"about_ca_topic_score_codex":0.0009020671,"about_ca_topic_score_gemma":0.0012207725,"teacher_disagreement_score":0.0030533182,"about_ca_system_score_codex":0.00040247795,"about_ca_system_score_gemma":0.00065123005,"threshold_uncertainty_score":0.010214329},"labels":[],"label_agreement":null},{"id":"W4401015327","doi":"10.5206/mt.v4i2.18548","title":"The Cost of Cramer's Rule","year":2024,"lang":"en","type":"article","venue":"Maple Transactions","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Invertible matrix; Dimension (graph theory); Expression (computer science); Matrix (chemical analysis); Applied mathematics; Mathematics; Computer science; Pure mathematics","score_opus":0.010503329449959705,"score_gpt":0.24561083269375705,"score_spread":0.23510750324379734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401015327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015396746,0.0062308908,0.8661939,0.015464489,0.004202696,0.00019704617,0.0004707781,0.0031771723,0.088666305],"genre_scores_gemma":[0.36602527,0.008541855,0.55189043,0.006853458,0.004706813,0.0006113266,0.0006232659,0.0033624747,0.057385165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9724655,0.008422242,0.0014272826,0.0035488235,0.01299576,0.0011403428],"domain_scores_gemma":[0.8961361,0.056641128,0.0015925313,0.031312667,0.013328602,0.0009890421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015568329,0.0014436397,0.0023168041,0.0025173677,0.0026603395,0.0057550985,0.005140762,0.0026713198,0.019997586],"category_scores_gemma":[0.11750944,0.0011143713,0.0012622048,0.0030789229,0.0063517564,0.012572731,0.0045816,0.008132267,0.012289976],"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.0004537839,0.00007461428,0.00077196775,0.0003431432,0.00008479801,0.0004052588,0.00028604624,0.0112250075,0.0011437769,0.7211246,0.056714423,0.20737264],"study_design_scores_gemma":[0.00010712314,0.000096382835,0.00041411602,0.00028379328,0.00007041217,0.0009745988,0.0001654829,0.053055223,0.0038418805,0.8847102,0.056129973,0.00015089219],"about_ca_topic_score_codex":0.0034196232,"about_ca_topic_score_gemma":0.0027463862,"teacher_disagreement_score":0.019997586,"about_ca_system_score_codex":0.0024742514,"about_ca_system_score_gemma":0.00322295,"threshold_uncertainty_score":0.08233416},"labels":[],"label_agreement":null},{"id":"W4401337191","doi":"10.1007/s10208-024-09671-w","title":"Polynomial and Rational Measure Modifications of Orthogonal Polynomials via Infinite-Dimensional Banded Matrix Factorizations","year":2024,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of British Columbia","funders":"Division of Mathematical Sciences; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Leverhulme Trust","keywords":"Mathematics; Orthogonal polynomials; Measure (data warehouse); Polynomial; Polynomial matrix; Matrix (chemical analysis); Matrix polynomial; Pure mathematics; Combinatorics; Algebra over a field; Mathematical analysis","score_opus":0.02219312052247101,"score_gpt":0.2865821892287377,"score_spread":0.26438906870626666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401337191","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08588912,0.000055466848,0.91192126,0.00006473207,0.000027238997,0.000022068174,0.000026725065,0.00032782668,0.0016655654],"genre_scores_gemma":[0.54032385,0.00007958743,0.45752218,0.000033784683,0.000024977395,0.000039568873,0.000079851015,0.00010291642,0.0017932989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953306,0.00015459394,0.000016367592,0.00005865559,0.00018446322,0.00005290567],"domain_scores_gemma":[0.9989932,0.00041334238,0.000109721266,0.00021755953,0.00018247758,0.00008380319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007424088,0.00043780432,0.00040774336,0.0006001567,0.00038109533,0.0007508358,0.00071549596,0.00042343183,0.0020484028],"category_scores_gemma":[0.0040312177,0.0002280248,0.00035030715,0.000556599,0.001023883,0.0016195232,0.0010216073,0.00088012347,0.000551086],"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.00030220696,0.00011284868,0.0016103701,0.00008358941,0.000031795265,0.00024716064,0.00027866912,0.36459497,0.033771455,0.4408459,0.0018085515,0.15631254],"study_design_scores_gemma":[0.0000095819405,0.00002798794,0.00011319043,0.0000051991083,0.0000019697789,0.00003848867,0.000021142168,0.9572448,0.0036141095,0.03794515,0.0009691187,0.000009189289],"about_ca_topic_score_codex":0.0013135112,"about_ca_topic_score_gemma":0.0017690471,"teacher_disagreement_score":0.0020484028,"about_ca_system_score_codex":0.00055081845,"about_ca_system_score_gemma":0.00051966164,"threshold_uncertainty_score":0.006852567},"labels":[],"label_agreement":null},{"id":"W4401504089","doi":"10.1086/732650","title":"A New Look at the Symmetry of the Slutsky Matrix","year":2024,"lang":"en","type":"article","venue":"Journal of Political Economy Microeconomics","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Simon Fraser University","funders":"","keywords":"Symmetry (geometry); Matrix (chemical analysis); Mathematics; Materials science; Geometry; Composite material","score_opus":0.006957277612326641,"score_gpt":0.24232205528756798,"score_spread":0.23536477767524133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401504089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06641821,0.0013569026,0.8885392,0.003868454,0.0004964449,0.00005416462,0.00053643895,0.00024303715,0.03848721],"genre_scores_gemma":[0.8402829,0.0021394265,0.13812396,0.0013732685,0.0012453817,0.00012937063,0.00052547955,0.00028032914,0.015899792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989973,0.00031718615,0.000057581452,0.00021526705,0.00029304414,0.00011957706],"domain_scores_gemma":[0.9966587,0.0014070742,0.000470084,0.0006858591,0.00055281614,0.00022546574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016871521,0.00066853955,0.0007947065,0.0013347556,0.0008532119,0.0029230355,0.00087114156,0.0011177426,0.009202255],"category_scores_gemma":[0.009388641,0.00036209213,0.0010198039,0.0010731699,0.0034004676,0.0067510623,0.0017398379,0.002754084,0.0014808966],"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.000025719493,0.0000119273345,0.00030262183,0.000026527214,0.000010754004,0.00007149483,0.00010832463,0.0034767576,0.0013383677,0.98620564,0.0012194468,0.007202494],"study_design_scores_gemma":[0.000009881216,0.000034817956,0.00017165151,0.00001592909,0.000004971455,0.00010427367,0.000042164414,0.018334711,0.000537025,0.97727555,0.003448497,0.000020506675],"about_ca_topic_score_codex":0.0011457965,"about_ca_topic_score_gemma":0.0006658416,"teacher_disagreement_score":0.009202255,"about_ca_system_score_codex":0.0009624766,"about_ca_system_score_gemma":0.0012164037,"threshold_uncertainty_score":0.030784547},"labels":[],"label_agreement":null},{"id":"W4401722973","doi":"10.23919/inc-usnc-ursi61303.2024.10632219","title":"On Convergence of Iterative Matrix Solver Preconditioned with H-Matrix in Locally Corrected Nyström Discretization of CFIE","year":2024,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Manitoba","funders":"","keywords":"Convergence (economics); Discretization; Mathematics; Solver; Matrix (chemical analysis); Iterative method; Applied mathematics; Matrix algebra; Mathematical optimization; Algorithm; Mathematical analysis; Physics; Chemistry; Eigenvalues and eigenvectors","score_opus":0.005178414074857483,"score_gpt":0.2483137570683417,"score_spread":0.24313534299348422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401722973","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028735986,0.00066978874,0.9653854,0.00021366248,0.00008828746,0.00005625079,0.000032913715,0.00014666402,0.0046710675],"genre_scores_gemma":[0.4529286,0.0011643091,0.5372766,0.00016977741,0.00008834545,0.0002743023,0.00016742857,0.00027932337,0.0076513216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992939,0.00034240878,0.000021678741,0.0000725761,0.00021800454,0.000051432562],"domain_scores_gemma":[0.99845135,0.0009791581,0.0001112721,0.00010218334,0.00030032353,0.0000557584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015854193,0.0005318388,0.0006133465,0.00037025596,0.00051728234,0.0005391619,0.0006298381,0.00080527825,0.001626443],"category_scores_gemma":[0.00495903,0.00018604864,0.00046238577,0.00035860602,0.0010031927,0.0010267299,0.0009196151,0.001154047,0.00039624813],"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.00035189415,0.00008633761,0.003004924,0.0005565449,0.00007429598,0.00057790993,0.0008000699,0.6709435,0.032289285,0.20697562,0.0023687268,0.08197085],"study_design_scores_gemma":[0.0000069577077,0.000037337464,0.00013479414,0.000016173806,0.000002994511,0.00003791973,0.000022670065,0.9892573,0.002600326,0.006818395,0.0010583095,0.0000068590884],"about_ca_topic_score_codex":0.0046486827,"about_ca_topic_score_gemma":0.0029314554,"teacher_disagreement_score":0.0046486827,"about_ca_system_score_codex":0.0004324158,"about_ca_system_score_gemma":0.00081594154,"threshold_uncertainty_score":0.00924325},"labels":[],"label_agreement":null},{"id":"W4401820908","doi":"10.1007/s11786-024-00590-1","title":"Applications of Rational Orthogonal Matrices","year":2024,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Algebra over a field; Computer science; Pure mathematics","score_opus":0.014074862802703,"score_gpt":0.27906603175971384,"score_spread":0.26499116895701086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401820908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08390943,0.0066074347,0.6968295,0.0020550715,0.0016487627,0.00007550029,0.000116659234,0.0007098305,0.20804787],"genre_scores_gemma":[0.77851415,0.0075672828,0.17937507,0.00050717435,0.0013534739,0.00006530043,0.00014308348,0.00025646397,0.032218058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993672,0.00021435341,0.000032369717,0.000093130104,0.00021042467,0.00008252262],"domain_scores_gemma":[0.99899167,0.00040914727,0.00010857536,0.0001629328,0.00024117806,0.00008652957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058968127,0.0006840204,0.00046393878,0.0015322932,0.00059477123,0.0015441027,0.00045377816,0.0005467302,0.006763518],"category_scores_gemma":[0.0046955524,0.00024055502,0.00044196943,0.0012444456,0.0014218654,0.0012504988,0.0017439955,0.0010014275,0.0012616279],"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.000059575803,0.000021850847,0.0002962862,0.00008513631,0.000009337228,0.00010876572,0.00011246881,0.0064969533,0.003565827,0.9214338,0.0019196479,0.065890275],"study_design_scores_gemma":[0.000026459014,0.000053489064,0.000263613,0.000056948476,0.000014327438,0.00048686957,0.00012714457,0.06780105,0.0046005985,0.8944725,0.032069754,0.000027178692],"about_ca_topic_score_codex":0.00056380674,"about_ca_topic_score_gemma":0.0005680321,"teacher_disagreement_score":0.006763518,"about_ca_system_score_codex":0.0005558936,"about_ca_system_score_gemma":0.00052607956,"threshold_uncertainty_score":0.022626221},"labels":[],"label_agreement":null},{"id":"W4402264881","doi":"10.23919/acc60939.2024.10644608","title":"An Interconnected Systems Approach to Convergence Analysis of Discrete-Time Primal-Dual Algorithms","year":2024,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Convergence (economics); Dual (grammatical number); Computer science; Algorithm; Algorithm design; Mathematical optimization; Mathematics","score_opus":0.011915608844404822,"score_gpt":0.2626966852567272,"score_spread":0.25078107641232233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402264881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033369048,0.00022588178,0.99297863,0.00010405412,0.000030426909,0.000019061532,0.000011310947,0.000037041184,0.0032566288],"genre_scores_gemma":[0.6344927,0.001574105,0.35574085,0.00020556932,0.00021040814,0.00036784983,0.000110927635,0.00022182988,0.0070757484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902654,0.0005240372,0.00003288538,0.00010704871,0.00025320277,0.00005628142],"domain_scores_gemma":[0.99691594,0.0022633744,0.00019204622,0.00015870559,0.00040664076,0.00006331044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026858822,0.001097609,0.00061555725,0.0008757614,0.00042589655,0.0014557759,0.0011799274,0.0007920321,0.0043203495],"category_scores_gemma":[0.009070244,0.00039622563,0.0006553918,0.0006510767,0.0016304036,0.0015844586,0.0018579174,0.0027721305,0.0005276863],"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.000051796163,0.000028148492,0.00029577472,0.0001202276,0.00003956029,0.000059817998,0.00013125098,0.76745903,0.0016086997,0.21305087,0.00066840684,0.016486412],"study_design_scores_gemma":[0.000003966869,0.000018483608,0.000029882523,0.000010135698,0.0000041332632,0.000011195212,0.000007687007,0.97602034,0.00049242313,0.02265217,0.0007461251,0.0000035254889],"about_ca_topic_score_codex":0.0009800732,"about_ca_topic_score_gemma":0.00061818055,"teacher_disagreement_score":0.0043203495,"about_ca_system_score_codex":0.0010384831,"about_ca_system_score_gemma":0.0007890761,"threshold_uncertainty_score":0.014452994},"labels":[],"label_agreement":null},{"id":"W4402314280","doi":"10.1016/j.laa.2024.09.001","title":"On Kemeny's constant and stochastic complement","year":2024,"lang":"en","type":"article","venue":"Linear Algebra and its 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":"York University","funders":"Gruppo Nazionale per il Calcolo Scientifico; Natural Sciences and Engineering Research Council of Canada; Fields Institute for Research in Mathematical Sciences; Ministero dell'Istruzione e del Merito; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Complement (music); Constant (computer programming); Mathematical economics; Combinatorics; Computer science","score_opus":0.013790174152093259,"score_gpt":0.26665532560555316,"score_spread":0.2528651514534599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402314280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06909239,0.0011447197,0.91757196,0.00041405164,0.00007509872,0.00004131263,0.00012835636,0.00030905192,0.0112230955],"genre_scores_gemma":[0.80000824,0.0014331993,0.1912769,0.0002010545,0.00013914717,0.00014194085,0.000159737,0.00017495659,0.006464856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918836,0.00023404162,0.000030396599,0.00015922944,0.0002533467,0.0001345944],"domain_scores_gemma":[0.99145496,0.0066141943,0.00044867062,0.0007085625,0.00052029156,0.00025338287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00222767,0.00097312604,0.0006194616,0.0019623442,0.0006485905,0.0012617974,0.0011713421,0.000614327,0.0035276045],"category_scores_gemma":[0.01933299,0.0003737247,0.00057910697,0.0017652711,0.0034970685,0.0035482212,0.0018247145,0.0019797035,0.00081420556],"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.00035143655,0.000055303073,0.0019306894,0.00015209384,0.000045957342,0.00015919244,0.00032242003,0.2500383,0.0052139154,0.6647201,0.002602283,0.074408256],"study_design_scores_gemma":[0.000019713429,0.0000664063,0.00061041676,0.000046407284,0.000016772377,0.00010567584,0.00007485696,0.58172715,0.0053432574,0.40950012,0.0024474615,0.000041850384],"about_ca_topic_score_codex":0.0034716704,"about_ca_topic_score_gemma":0.0029269685,"teacher_disagreement_score":0.0035276045,"about_ca_system_score_codex":0.0018116832,"about_ca_system_score_gemma":0.0014619791,"threshold_uncertainty_score":0.0131447315},"labels":[],"label_agreement":null},{"id":"W4402337923","doi":"","title":"A Rigorous Analysis of M31's Dynamics Using Surreal Mathematics and Category Theory","year":2024,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Mount Royal University","funders":"","keywords":"Dynamics (music); Mathematics; Statistical physics; Mathematical economics; Computer science; Sociology; Physics","score_opus":0.012806965306371373,"score_gpt":0.23940468613734325,"score_spread":0.22659772083097188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402337923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07447309,0.0012659148,0.8760792,0.0027678744,0.00016674123,0.000046374218,0.0001823212,0.000116210904,0.044902325],"genre_scores_gemma":[0.82059515,0.0012720799,0.16569051,0.0004765218,0.0003283795,0.00011221061,0.00023028535,0.00009100439,0.011203819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993525,0.0002266442,0.000027144324,0.00012201495,0.00020144662,0.00007025249],"domain_scores_gemma":[0.9981723,0.0007778203,0.00033423468,0.00025483675,0.00029165923,0.00016921188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012906989,0.00051376084,0.00048021803,0.0016279039,0.0012641082,0.002069561,0.0010699776,0.00082483306,0.0038807401],"category_scores_gemma":[0.0047377693,0.0002146324,0.0008123376,0.00080693554,0.003801692,0.0050434205,0.0023627686,0.0016017229,0.0005353915],"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.0000018758068,0.0000019802437,0.00013439158,0.00000985895,0.0000020762873,0.000018822067,0.00006524287,0.0023177618,0.00017456201,0.99559927,0.00020216957,0.0014718674],"study_design_scores_gemma":[0.0000018527294,0.000008931059,0.00028758348,0.000010200552,0.0000014343613,0.000056317363,0.000044215554,0.029552834,0.00013440233,0.96590227,0.0039904006,0.000009478772],"about_ca_topic_score_codex":0.003670135,"about_ca_topic_score_gemma":0.002498258,"teacher_disagreement_score":0.0038807401,"about_ca_system_score_codex":0.0016845514,"about_ca_system_score_gemma":0.0011028217,"threshold_uncertainty_score":0.0129823685},"labels":[],"label_agreement":null},{"id":"W4402372814","doi":"10.1007/s10915-024-02656-5","title":"Quadrature Rules on Triangles and Tetrahedra for Multidimensional Summation-By-Parts Operators","year":2024,"lang":"en","type":"article","venue":"Journal of Scientific Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Tetrahedron; Quadrature (astronomy); Geometry; Engineering; Electrical engineering","score_opus":0.013204915991166454,"score_gpt":0.2655148508892627,"score_spread":0.2523099348980962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402372814","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021257154,0.00029825457,0.9941446,0.00012245726,0.00016464585,0.000029960827,0.000038944774,0.00007064279,0.0030047542],"genre_scores_gemma":[0.07440054,0.0010880588,0.9165018,0.00037024947,0.00025531833,0.00024952117,0.00027650624,0.00059645495,0.0062615606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972332,0.001200502,0.00020695668,0.00013147767,0.0011169828,0.00011087718],"domain_scores_gemma":[0.994945,0.0024152363,0.00022898913,0.0007545368,0.0014223086,0.00023393639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059635304,0.00079058966,0.0013516647,0.0017220515,0.0009372124,0.0030205646,0.0028299692,0.0014576453,0.0052622026],"category_scores_gemma":[0.015773186,0.00054189074,0.0010863686,0.0025141493,0.0020908923,0.0030672913,0.0020332423,0.003642171,0.0022683342],"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.00006714908,0.000048045837,0.00017346247,0.00010345676,0.000023063156,0.000071123715,0.00015166635,0.021715738,0.0021233426,0.92732227,0.0039153895,0.04428537],"study_design_scores_gemma":[0.00003244157,0.000017973918,0.00007444094,0.00005267128,0.000015574056,0.000051237806,0.000037189406,0.35451528,0.0010780233,0.6370838,0.007021863,0.00001938507],"about_ca_topic_score_codex":0.0017476494,"about_ca_topic_score_gemma":0.0033634703,"teacher_disagreement_score":0.0059635304,"about_ca_system_score_codex":0.00081251364,"about_ca_system_score_gemma":0.0010181852,"threshold_uncertainty_score":0.031538546},"labels":[],"label_agreement":null},{"id":"W4402388714","doi":"10.1080/00150517.2022.12427477","title":"A Matrix-Based Recursion Relation for F <sub> F <sub>n</sub> </sub>","year":2022,"lang":"en","type":"article","venue":"˜The œFibonacci quarterly","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"York University","funders":"","keywords":"Recursion (computer science); Relation (database); Matrix (chemical analysis); Mathematics; Pure mathematics; Combinatorics; Computer science; Algorithm; Materials science; Data mining","score_opus":0.009473507065176343,"score_gpt":0.22918757069274487,"score_spread":0.2197140636275685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402388714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019572191,0.002430339,0.9025356,0.0010546477,0.0010503101,0.00012764939,0.00031845356,0.00037428414,0.072536565],"genre_scores_gemma":[0.3961603,0.0037955402,0.555346,0.0021245913,0.0014118822,0.0003586836,0.00065258035,0.00039995086,0.039750554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911314,0.0001285376,0.000084604915,0.00024492783,0.00031736787,0.00011143944],"domain_scores_gemma":[0.99865305,0.00055110705,0.000102981314,0.0001116027,0.0005268001,0.000054451375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013318489,0.0006669988,0.00048649928,0.0013359294,0.0015918268,0.0017983195,0.00069152866,0.0010584631,0.005233365],"category_scores_gemma":[0.004150211,0.00034241308,0.001030571,0.0011851484,0.0022592088,0.0027493304,0.0010795447,0.0031270166,0.003246363],"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.000014958038,0.000019851475,0.00017545311,0.00007136788,0.0000052853406,0.00013401467,0.0004859338,0.0011310369,0.006591337,0.97030264,0.0031445131,0.017923512],"study_design_scores_gemma":[0.000019185502,0.0001399752,0.0005711361,0.00009331911,0.00003550191,0.0015552621,0.00013019504,0.03082664,0.016721759,0.8779883,0.071808256,0.00011052651],"about_ca_topic_score_codex":0.0028972381,"about_ca_topic_score_gemma":0.0036138545,"teacher_disagreement_score":0.005233365,"about_ca_system_score_codex":0.001480831,"about_ca_system_score_gemma":0.0011922773,"threshold_uncertainty_score":0.017507374},"labels":[],"label_agreement":null},{"id":"W4402947209","doi":"10.18280/mmep.110919","title":"Operational Matrices of Genocchi Polynomials for Solving High-Order Linear Fredholm Integro-Differential Equations","year":2024,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fredholm integral equation; Order (exchange); Differential equation; Differential (mechanical device); Mathematical analysis; Applied mathematics; Pure mathematics; Integral equation; Physics","score_opus":0.022736246710525064,"score_gpt":0.23581769911339798,"score_spread":0.2130814524028729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402947209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013335163,0.00072870625,0.9813866,0.00013356442,0.00010753533,0.00003225248,0.000021211908,0.00007999262,0.004174969],"genre_scores_gemma":[0.3777618,0.001807342,0.615266,0.00013517062,0.00011938689,0.00015829186,0.000077779565,0.00011679793,0.0045574233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996848,0.00012914371,0.000011374095,0.000034081488,0.00010871901,0.000032034644],"domain_scores_gemma":[0.9996561,0.00013895243,0.000045122008,0.00004396441,0.00008936927,0.000026446873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007652317,0.00066515093,0.0003530628,0.0004737281,0.00040933173,0.0005726287,0.0007517393,0.00056863093,0.0012653628],"category_scores_gemma":[0.0014548253,0.00018449179,0.0004622822,0.00056096865,0.00092511857,0.0007631945,0.00069226784,0.001352461,0.0004513281],"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.00015016383,0.00008243466,0.0014600095,0.00050473853,0.000055238077,0.0003247897,0.00050620903,0.36752713,0.03387123,0.45069313,0.0026273592,0.1421976],"study_design_scores_gemma":[0.000016498563,0.000078194156,0.00029174014,0.000036753732,0.000015394084,0.00018557259,0.00006843267,0.95018613,0.006375984,0.032391112,0.010327361,0.000026833808],"about_ca_topic_score_codex":0.0032763055,"about_ca_topic_score_gemma":0.003403722,"teacher_disagreement_score":0.0032763055,"about_ca_system_score_codex":0.00046768365,"about_ca_system_score_gemma":0.00085239933,"threshold_uncertainty_score":0.0065144897},"labels":[],"label_agreement":null},{"id":"W4403118184","doi":"10.1016/j.laa.2024.10.001","title":"Powers of Karpelevič arcs and their sparsest realising matrices","year":2024,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"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; Science Foundation Ireland","keywords":"Mathematics; Combinatorics; Algebra over a field; Pure mathematics","score_opus":0.012242065162427356,"score_gpt":0.25060984125757774,"score_spread":0.2383677760951504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403118184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38173306,0.0013552144,0.3936724,0.0018312372,0.0006080422,0.00009799423,0.0005841381,0.00068314094,0.21943474],"genre_scores_gemma":[0.9193056,0.0007224401,0.030978456,0.00033810764,0.00037883435,0.00007306165,0.00022197718,0.00028061908,0.04770079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994646,0.00014607461,0.000025856787,0.000102744096,0.00014826124,0.0001125165],"domain_scores_gemma":[0.99753976,0.0011989869,0.00040110087,0.00026536392,0.00030686086,0.00028800667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049784896,0.0006519169,0.00043727542,0.0016304448,0.00089574105,0.0025167083,0.0008873449,0.00074290636,0.014831077],"category_scores_gemma":[0.005914023,0.00039775987,0.00034225773,0.0012958902,0.0023914408,0.0027946956,0.0011647281,0.0022865846,0.0025786096],"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.000064716834,0.0000224751,0.00017445323,0.0000330827,0.0000058822293,0.00010243749,0.0001906432,0.0024432382,0.0015072867,0.9809357,0.0016320519,0.012888106],"study_design_scores_gemma":[0.000009534444,0.000016655222,0.0001266657,0.000013690311,0.0000044044486,0.00014758445,0.00008966846,0.006522434,0.0011292332,0.9873302,0.0045970846,0.0000127636085],"about_ca_topic_score_codex":0.00048487057,"about_ca_topic_score_gemma":0.0006676134,"teacher_disagreement_score":0.014831077,"about_ca_system_score_codex":0.00047693303,"about_ca_system_score_gemma":0.00043976054,"threshold_uncertainty_score":0.049614847},"labels":[],"label_agreement":null},{"id":"W4403210819","doi":"10.1109/iceaa61917.2024.10701730","title":"Parallel Fast Iterative H-Matrix Locally Corrected Nyström Discretization of Integral Equations with an Inaccurate H-matrix Preconditioner","year":2024,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Manitoba","funders":"","keywords":"Preconditioner; Discretization; Matrix (chemical analysis); Iterative method; Integral equation; Mathematics; Applied mathematics; Mathematical analysis; Mathematical optimization; Materials science","score_opus":0.01113889023216414,"score_gpt":0.27642223658009196,"score_spread":0.26528334634792783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403210819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016174557,0.00014905604,0.97534335,0.00013904499,0.00008037642,0.000051736297,0.00009327884,0.00079061853,0.007178053],"genre_scores_gemma":[0.20798215,0.00018058758,0.7792641,0.00013496638,0.000060079412,0.00025452048,0.00031424843,0.0003142934,0.011495081],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978477,0.000052267867,0.000009248502,0.000024601124,0.00010141535,0.000027616983],"domain_scores_gemma":[0.999666,0.0001418859,0.000032241904,0.000058112466,0.00008030625,0.000021370737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037018803,0.00045850404,0.0007846073,0.00022369409,0.00039213934,0.00055345346,0.00091520295,0.00064947165,0.00377776],"category_scores_gemma":[0.00091206125,0.00023519051,0.0005271698,0.00033661228,0.00047211736,0.0008264769,0.0008099245,0.00093150727,0.0007577654],"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.00017492594,0.000090569854,0.0011902123,0.00025352347,0.000057950223,0.00035571505,0.00033955244,0.8264321,0.026254881,0.05325314,0.004982148,0.08661521],"study_design_scores_gemma":[0.000013118786,0.000016518225,0.0000669225,0.000006061141,0.000002084356,0.000025663323,0.00001838688,0.9933696,0.0020745448,0.002167035,0.0022347989,0.000005343009],"about_ca_topic_score_codex":0.006412787,"about_ca_topic_score_gemma":0.00821698,"teacher_disagreement_score":0.006412787,"about_ca_system_score_codex":0.00048459845,"about_ca_system_score_gemma":0.0011932168,"threshold_uncertainty_score":0.012750924},"labels":[],"label_agreement":null},{"id":"W4403426488","doi":"10.1007/s00454-024-00698-y","title":"Realizations of Multiassociahedra via Rigidity","year":2024,"lang":"lv","type":"article","venue":"Discrete & Computational Geometry","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"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":"Agencia Estatal de Investigación; Universidad de Cantabria; Banco Santander","keywords":"Rigidity (electromagnetism); Materials science; Composite material","score_opus":0.015113686902145887,"score_gpt":0.287054341023027,"score_spread":0.27194065412088114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403426488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45909205,0.00092320365,0.16818629,0.0014047176,0.0007257831,0.00007507035,0.0005307768,0.0017458367,0.36731628],"genre_scores_gemma":[0.93042713,0.00020450633,0.023979396,0.00019034365,0.00010563368,0.000058162917,0.0002843576,0.0002712676,0.0444793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990484,0.00018722868,0.000056633056,0.00020081342,0.0002620385,0.00024487526],"domain_scores_gemma":[0.99946445,0.0001108692,0.00005354371,0.00013795817,0.000086002074,0.0001471765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049308065,0.0005045975,0.0004940263,0.0011689644,0.002179934,0.0034971517,0.0008243399,0.00083049835,0.018597152],"category_scores_gemma":[0.0008904273,0.0005013057,0.0009115639,0.00055279076,0.0022584435,0.0025678251,0.0039884215,0.0015469622,0.0037881683],"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.000023016235,0.000012950472,0.00009732382,0.000016345237,0.0000053917324,0.00008213899,0.00014490576,0.0014176456,0.0008502926,0.99236286,0.0008657737,0.004121434],"study_design_scores_gemma":[0.000020681922,0.000025011526,0.00033537814,0.000033400247,0.000011894129,0.00017126542,0.0003024371,0.011352808,0.0021265862,0.9654256,0.020160306,0.000034744808],"about_ca_topic_score_codex":0.0010012615,"about_ca_topic_score_gemma":0.0013651834,"teacher_disagreement_score":0.018597152,"about_ca_system_score_codex":0.0013418543,"about_ca_system_score_gemma":0.00048268127,"threshold_uncertainty_score":0.06221366},"labels":[],"label_agreement":null},{"id":"W4403673619","doi":"10.1090/cln/033/12","title":"Detailed balance, symmetry, and eigenfunction expansions","year":2024,"lang":"en","type":"book-chapter","venue":"Courant lecture notes in mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Eigenfunction; Balance (ability); Symmetry (geometry); Mathematics; Physics; Mathematical physics; Geometry; Eigenvalues and eigenvectors; Quantum mechanics; Psychology; Neuroscience","score_opus":0.014112148998364897,"score_gpt":0.23519831154687867,"score_spread":0.22108616254851376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403673619","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10326251,0.008481798,0.31846172,0.0036001944,0.0015686516,0.000045131324,0.00030338843,0.00046942692,0.56380713],"genre_scores_gemma":[0.74874645,0.004741592,0.03871823,0.0010122918,0.001427857,0.00013202005,0.00041313295,0.0006621847,0.20414615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997918,0.00004975764,0.0000076083456,0.000035431884,0.00007538637,0.000039940456],"domain_scores_gemma":[0.9997801,0.00007717343,0.00002501355,0.000051896302,0.000039679093,0.00002614634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053799356,0.00060971157,0.00074200635,0.0008838456,0.0008335781,0.0020316106,0.00086323393,0.0010001237,0.010360879],"category_scores_gemma":[0.0013914873,0.0004170807,0.000646989,0.0007613349,0.0020380877,0.004481985,0.00089422025,0.0019875793,0.001967534],"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.0000051812312,0.000005026737,0.000018753057,0.00000757013,0.0000014510537,0.000011374911,0.000031262618,0.00088925834,0.00027132375,0.9942332,0.0016167363,0.0029089225],"study_design_scores_gemma":[0.0000018826332,0.0000034251489,0.000041548963,0.000003988508,8.7763584e-7,0.000019725096,0.000013612036,0.0042015566,0.00009155127,0.9935278,0.0020908655,0.0000030687763],"about_ca_topic_score_codex":0.0007444318,"about_ca_topic_score_gemma":0.00069307553,"teacher_disagreement_score":0.010360879,"about_ca_system_score_codex":0.00080065447,"about_ca_system_score_gemma":0.00043856492,"threshold_uncertainty_score":0.034660578},"labels":[],"label_agreement":null},{"id":"W4403721329","doi":"10.1109/ojap.2024.3485817","title":"H-Matrix Accelerated Direct Matrix Solver for Maxwell’s Equations Using the Chebyshev-Based Nyström Boundary Integral Equation Method","year":2024,"lang":"en","type":"article","venue":"IEEE Open Journal of Antennas and Propagation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Air Force Office of Scientific Research; National Science Foundation","keywords":"Mathematics; Matrix (chemical analysis); Solver; Chebyshev equation; Nyström method; Applied mathematics; Mathematical analysis; Chebyshev filter; Integral equation; Mathematical optimization; Materials science; Composite material; Orthogonal polynomials; Classical orthogonal polynomials","score_opus":0.08126592460664975,"score_gpt":0.3784268418085266,"score_spread":0.2971609172018769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403721329","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043593296,0.00011058409,0.9892496,0.00008470186,0.000034177374,0.000042348565,0.000066178975,0.000377593,0.0056754802],"genre_scores_gemma":[0.11934767,0.0003229417,0.86820877,0.0001084188,0.000048495283,0.00023780191,0.0002864191,0.00022952478,0.011209997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982566,0.000035890025,0.000006582462,0.000015661499,0.000101882106,0.000014350857],"domain_scores_gemma":[0.99949634,0.00022200817,0.000035607012,0.00004786086,0.00016831381,0.000029825998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038631374,0.0004701143,0.0005569285,0.00029020954,0.0003272993,0.00070993253,0.00085077074,0.0009126068,0.0066124573],"category_scores_gemma":[0.00094359496,0.00023653872,0.0004466908,0.0004104303,0.00034262709,0.0006475041,0.0008199481,0.0011752907,0.0017574272],"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.00014968768,0.00014466116,0.0011250606,0.00050903513,0.00006601718,0.00049327005,0.00039088252,0.63615876,0.05572121,0.12211285,0.009785007,0.17334346],"study_design_scores_gemma":[0.000019107196,0.000020757861,0.00006670174,0.00001085351,0.0000030902395,0.00006981328,0.000018895562,0.9889264,0.0033591567,0.0030036073,0.0044948985,0.0000066999883],"about_ca_topic_score_codex":0.0027231483,"about_ca_topic_score_gemma":0.0035688167,"teacher_disagreement_score":0.0066124573,"about_ca_system_score_codex":0.00036295183,"about_ca_system_score_gemma":0.0013718546,"threshold_uncertainty_score":0.022120833},"labels":[],"label_agreement":null},{"id":"W4403761393","doi":"10.1007/s00211-024-01443-6","title":"On the adaptive Levin method","year":2024,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Numerical analysis; Applied mathematics; Calculus (dental); Mathematical optimization; Mathematical analysis","score_opus":0.02564679192034099,"score_gpt":0.28526148307056776,"score_spread":0.2596146911502268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403761393","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029642677,0.001774491,0.9186422,0.0011118193,0.0006117197,0.000043652035,0.0000746474,0.00035381864,0.04774496],"genre_scores_gemma":[0.61936826,0.0024028765,0.24898297,0.0011599434,0.0005830999,0.00020663904,0.00022818867,0.0007713062,0.1262968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967456,0.00014873996,0.000008631841,0.00003919054,0.00009594604,0.000033027314],"domain_scores_gemma":[0.9993236,0.0003779011,0.000045272358,0.000072339295,0.00013352417,0.000047341204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007139641,0.00052325474,0.0005910018,0.0008615153,0.00048292798,0.0008223441,0.0008203639,0.0009559222,0.0077735675],"category_scores_gemma":[0.0037706976,0.00034136046,0.00047948913,0.0005749919,0.0016150398,0.001317941,0.0023079002,0.0015466228,0.001274617],"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.00024018601,0.00004790809,0.0010953854,0.0001366753,0.000064637665,0.00013598168,0.0001680521,0.13832396,0.0068618045,0.7623156,0.006067689,0.08454225],"study_design_scores_gemma":[0.000034261415,0.00004518941,0.0003681905,0.00004316221,0.000014541407,0.00007495809,0.00003358547,0.74506533,0.0010911757,0.23946843,0.013734914,0.000026314869],"about_ca_topic_score_codex":0.002627307,"about_ca_topic_score_gemma":0.0023595945,"teacher_disagreement_score":0.0077735675,"about_ca_system_score_codex":0.000576058,"about_ca_system_score_gemma":0.0005983499,"threshold_uncertainty_score":0.026005208},"labels":[],"label_agreement":null},{"id":"W4403809168","doi":"10.48550/arxiv.2409.18277","title":"Global Minimization of Electronic Hamiltonian 1-Norm via Linear Programming in the Block Invariant Symmetry Shift (BLISS) Method","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Natural Sciences and Engineering Research Council of Canada; University of Colorado Boulder; Defense Advanced Research Projects Agency; Alliance de recherche numérique du Canada; University of Toronto","keywords":"BLISS; Mathematics; Hamiltonian (control theory); Invariant (physics); Norm (philosophy); Mathematical analysis; Pure mathematics; Mathematical physics; Applied mathematics; Mathematical optimization; Computer science; Political science; Law","score_opus":0.026507321583294864,"score_gpt":0.21647034721882838,"score_spread":0.18996302563553352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403809168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016261037,0.000118215336,0.9763931,0.00027137887,0.000026330106,0.000051206847,0.00009047027,0.00027086976,0.006517498],"genre_scores_gemma":[0.31633267,0.0002532093,0.67286986,0.00027840366,0.00005976203,0.0005147532,0.00033190855,0.0005757471,0.008783612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995957,0.00017906138,0.000012120989,0.000053603468,0.00011314841,0.00004626226],"domain_scores_gemma":[0.9991817,0.0005762079,0.000050424645,0.00006787144,0.00009111335,0.00003274333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010694691,0.00074490835,0.0007438344,0.00041068252,0.00036059658,0.00070612354,0.0009738086,0.00079296477,0.0052153342],"category_scores_gemma":[0.0019305677,0.000451903,0.0005018847,0.0004618836,0.0010440472,0.0010049868,0.0011651259,0.0014476755,0.00086104183],"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.00009172453,0.00009311746,0.0003073247,0.00017599465,0.000031513355,0.00007914994,0.000071881586,0.82495624,0.005157146,0.12031204,0.0032741262,0.045449723],"study_design_scores_gemma":[0.000011129827,0.000022816916,0.000033007356,0.00000633589,0.0000026327523,0.000006517908,0.000010741101,0.97290796,0.0008192345,0.025561614,0.0006142088,0.000003864802],"about_ca_topic_score_codex":0.0013573426,"about_ca_topic_score_gemma":0.0023245476,"teacher_disagreement_score":0.0052153342,"about_ca_system_score_codex":0.0006842806,"about_ca_system_score_gemma":0.0010447078,"threshold_uncertainty_score":0.017447054},"labels":[],"label_agreement":null},{"id":"W4403866820","doi":"10.1287/ijoc.2024.0570","title":"Efficient Implementation of Interior-Point Methods for Quantum Relative Entropy","year":2024,"lang":"en","type":"article","venue":"INFORMS journal on computing","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":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interior point method; Computer science; Mathematical optimization; Mathematics; Algorithm; Statistical physics; Physics","score_opus":0.023030249055143663,"score_gpt":0.3802033143685409,"score_spread":0.3571730653133972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403866820","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020888865,0.00009997027,0.9936965,0.000102167025,0.00005195632,0.000041292988,0.00004663992,0.00047379706,0.0033987393],"genre_scores_gemma":[0.059012104,0.0001424736,0.9371018,0.00010087775,0.000043268185,0.00024167441,0.00013975722,0.00060961244,0.002608491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988734,0.00044652374,0.000056477686,0.00008596794,0.00044075254,0.000096945485],"domain_scores_gemma":[0.9966672,0.0021661427,0.0001573721,0.00031801042,0.0005742746,0.00011705188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019354378,0.0011397825,0.0012547654,0.0008697034,0.00074218103,0.0013163057,0.0021899212,0.0014830275,0.012326251],"category_scores_gemma":[0.0069550793,0.0005521623,0.0012392334,0.0008365832,0.0011696935,0.0013328114,0.0023301346,0.0033679937,0.0031486168],"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.00014427192,0.0001507531,0.00057818514,0.0003633695,0.000056519042,0.00014762298,0.00024952917,0.72972345,0.0050248685,0.13064219,0.0071669305,0.12575237],"study_design_scores_gemma":[0.00001969914,0.0000120030445,0.000022917946,0.000012892944,0.0000023796224,0.000012647661,0.000012207993,0.98497516,0.0007534742,0.0119508635,0.002219416,0.000006339895],"about_ca_topic_score_codex":0.0023394802,"about_ca_topic_score_gemma":0.0029009199,"teacher_disagreement_score":0.012326251,"about_ca_system_score_codex":0.00086049136,"about_ca_system_score_gemma":0.002007562,"threshold_uncertainty_score":0.041235387},"labels":[],"label_agreement":null},{"id":"W4404024369","doi":"10.3390/axioms13110764","title":"On the Lanczos Method for Computing Some Matrix Functions","year":2024,"lang":"en","type":"article","venue":"Axioms","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Victoria","funders":"","keywords":"Lanczos resampling; Convergence (economics); Applied mathematics; Matrix (chemical analysis); Computer science; Polynomial; Lanczos algorithm; Symmetric matrix; Algebra over a field; Matrix function; Mathematics; Algorithm; Mathematical optimization; Eigenvalues and eigenvectors; Pure mathematics; Mathematical analysis; Quantum mechanics; Physics","score_opus":0.019589356913468164,"score_gpt":0.31325575962402413,"score_spread":0.293666402710556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404024369","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004477128,0.00022800408,0.9919857,0.00013493859,0.000054264023,0.000038141658,0.000041439038,0.0007117972,0.0023285965],"genre_scores_gemma":[0.07741423,0.0004009719,0.9160776,0.00015386408,0.00008447562,0.00017438042,0.0001650892,0.0003085576,0.0052207545],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994874,0.0001672532,0.000026662183,0.00005573737,0.00021801057,0.000044837136],"domain_scores_gemma":[0.9991128,0.0005000265,0.00004887868,0.00009999457,0.00019461157,0.00004372824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011203282,0.000956658,0.0007941267,0.0010597677,0.0007834563,0.00079787645,0.0011386403,0.00088630174,0.0067423964],"category_scores_gemma":[0.004167685,0.00036237357,0.0006071401,0.0019421439,0.0011932139,0.0015381866,0.0009463928,0.0017747165,0.003178905],"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.00037042785,0.00016328954,0.001030624,0.00047441997,0.00008078448,0.00034055288,0.00032942937,0.33201033,0.021488722,0.23818333,0.010455077,0.395073],"study_design_scores_gemma":[0.00004354638,0.000038757924,0.00010691429,0.000013963954,0.0000057201155,0.000040677227,0.000020259755,0.9549142,0.0019754462,0.039435375,0.003387239,0.000017866761],"about_ca_topic_score_codex":0.0082080085,"about_ca_topic_score_gemma":0.011848508,"teacher_disagreement_score":0.0082080085,"about_ca_system_score_codex":0.0006988981,"about_ca_system_score_gemma":0.0018217622,"threshold_uncertainty_score":0.02255553},"labels":[],"label_agreement":null},{"id":"W4404131251","doi":"10.1137/1.9781611978162.appb","title":"Appendix B: Singular Value Decomposition","year":2024,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Concordia University","funders":"","keywords":"Appendix; Singular value decomposition; Decomposition; Value (mathematics); Mathematics; Calculus (dental); Medicine; Geology; Statistics; Chemistry; Algorithm; Orthodontics","score_opus":0.03305303662612085,"score_gpt":0.254865693091581,"score_spread":0.22181265646546017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404131251","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025227612,0.0071465047,0.33616683,0.0087325955,0.009734909,0.0015674634,0.23863046,0.011950481,0.38354787],"genre_scores_gemma":[0.027868483,0.011509756,0.32481685,0.004234349,0.0030495045,0.0027578736,0.23538865,0.0081227245,0.38225186],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881446,0.00023442975,0.000079107864,0.0001711592,0.00065021205,0.000050714272],"domain_scores_gemma":[0.99206394,0.0024957934,0.00019796564,0.000790653,0.0042986297,0.00015294681],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001184689,0.001379992,0.00082360307,0.0027335018,0.0009017217,0.0022321385,0.0014086008,0.0011988448,0.48848954],"category_scores_gemma":[0.018184865,0.00054215523,0.0007019553,0.0034027095,0.0003872568,0.0018682177,0.0012366946,0.0016276669,0.29085195],"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.000028547163,0.000026298178,0.0001804756,0.00039741362,0.000010261134,0.000065878354,0.00004504199,0.0012387824,0.00025655623,0.015595495,0.918692,0.06346323],"study_design_scores_gemma":[0.000025252297,0.000022315018,0.00056092866,0.00036959347,0.0000083884515,0.0002157431,0.00007527478,0.00324955,0.00055413967,0.038074516,0.9568168,0.000027471144],"about_ca_topic_score_codex":0.005338884,"about_ca_topic_score_gemma":0.0059168045,"teacher_disagreement_score":0.48848954,"about_ca_system_score_codex":0.0011507142,"about_ca_system_score_gemma":0.0024023203,"threshold_uncertainty_score":0.7296076},"labels":[],"label_agreement":null},{"id":"W4404134135","doi":"10.1145/3649329.3657387","title":"Efficient Approximate Decomposition Solver using Ising Model","year":2024,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Alberta","funders":"","keywords":"Decomposition; Solver; Computer science; Ising model; Problem solver; Theoretical computer science; Parallel computing; Computational science; Statistical physics; Physics; Programming language; Chemistry","score_opus":0.021915987402406415,"score_gpt":0.2894147638004701,"score_spread":0.2674987763980637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404134135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018684756,0.00016905733,0.9753787,0.00010135099,0.000031162068,0.000027418095,0.00009493717,0.0005290319,0.0049836254],"genre_scores_gemma":[0.37762251,0.0002777212,0.6159039,0.00012610256,0.00003989846,0.0001521669,0.00053604704,0.00025186467,0.005089842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999803,0.000036722016,0.000010809121,0.000022751521,0.00009799862,0.000028767065],"domain_scores_gemma":[0.9997423,0.00011640204,0.000019959805,0.000034926572,0.00006890393,0.00001757475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023808682,0.00058129575,0.0006439906,0.00042105844,0.00029487727,0.00065859075,0.00061154866,0.00057683105,0.0046409117],"category_scores_gemma":[0.0009533156,0.0002511547,0.00051259686,0.00055924006,0.0002687379,0.0007876235,0.0005509245,0.00072494254,0.0007415306],"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.00014098738,0.00005961145,0.0007373317,0.0001950737,0.000050030747,0.00018722574,0.000071709415,0.79932606,0.01541071,0.058875263,0.004316574,0.12062943],"study_design_scores_gemma":[0.0000058025284,0.0000061091077,0.000015638077,0.0000024064175,0.0000022750912,0.0000132969735,0.000004574232,0.99516606,0.0008835708,0.0034179904,0.00048092662,0.0000013817735],"about_ca_topic_score_codex":0.002652464,"about_ca_topic_score_gemma":0.0036137325,"teacher_disagreement_score":0.0046409117,"about_ca_system_score_codex":0.0004356721,"about_ca_system_score_gemma":0.0008685337,"threshold_uncertainty_score":0.015525401},"labels":[],"label_agreement":null},{"id":"W4404138393","doi":"10.1007/978-981-97-3886-1_13","title":"Correction to: Hilbert Functions and Jordan Type of Perazzo Artinian Algebras","year":2024,"lang":"en","type":"book-chapter","venue":"Springer INdAM series","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Type (biology); Linguistics; Algebra over a field; Pure mathematics; Philosophy; Geology","score_opus":0.014613100584027983,"score_gpt":0.23453722124632248,"score_spread":0.2199241206622945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404138393","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008240291,0.0038156956,0.0031021235,0.091824606,0.8663448,0.0000284413,0.00074287696,0.00078969606,0.03252775],"genre_scores_gemma":[0.047789212,0.0077093844,0.0061268173,0.041454323,0.39451578,0.000114391325,0.0011109144,0.001568044,0.49961108],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977169,0.00035507864,0.00024497072,0.00037505513,0.0010696219,0.00023833873],"domain_scores_gemma":[0.990126,0.0018731069,0.0004759251,0.0010889842,0.0058145025,0.0006214302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023115461,0.0015800474,0.0017843855,0.0041204565,0.0033027804,0.0042068595,0.0027670353,0.004674298,0.05532847],"category_scores_gemma":[0.019793816,0.00076365646,0.0011716462,0.002946073,0.0034965454,0.0050662267,0.0017068596,0.0066318586,0.02184038],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027483688,0.000007750134,0.000059094025,0.000100238496,0.000010385156,0.00011110086,0.000048803588,0.00006788707,0.0000520268,0.019846162,0.97049946,0.009169612],"study_design_scores_gemma":[0.000026472473,0.000014189437,0.00068368734,0.00013189789,0.000025615973,0.0005674763,0.0000738745,0.0005188798,0.0003164872,0.03621243,0.96138877,0.000040197057],"about_ca_topic_score_codex":0.0052931434,"about_ca_topic_score_gemma":0.00914937,"teacher_disagreement_score":0.05532847,"about_ca_system_score_codex":0.0048906356,"about_ca_system_score_gemma":0.0031948953,"threshold_uncertainty_score":0.18509221},"labels":[],"label_agreement":null},{"id":"W4404413619","doi":"10.37236/12909","title":"On the Algebra Generated by Three Commuting Matrices: Combinatorial Cases","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Algebra over a field; Mathematics; Combinatorics; Pure mathematics","score_opus":0.010110952633977594,"score_gpt":0.23246427943863548,"score_spread":0.22235332680465789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404413619","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78553456,0.0033543108,0.09705305,0.0040703896,0.00034125426,0.00007607767,0.00032755846,0.000193264,0.109049514],"genre_scores_gemma":[0.98113316,0.0009910424,0.012189577,0.00037827145,0.0003961953,0.000057265992,0.0002870022,0.000033724453,0.004533852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979785,0.00043614348,0.0001397787,0.000363187,0.0006429863,0.0004394012],"domain_scores_gemma":[0.99469984,0.002707946,0.0007686293,0.0004949705,0.00044235104,0.0008863573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017889795,0.0007617064,0.0011390358,0.002352324,0.0036729905,0.00357707,0.0017702052,0.0024927668,0.007076479],"category_scores_gemma":[0.0057015535,0.00061706005,0.0008964766,0.004151143,0.008061153,0.007856592,0.003174419,0.0029584372,0.0012812135],"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.00009297373,0.00006978396,0.00068284234,0.000087162916,0.000012358263,0.0011261388,0.0005088507,0.0013943719,0.001035861,0.98856467,0.0012883282,0.0051366915],"study_design_scores_gemma":[0.000031310603,0.000025764146,0.00022396802,0.000022246542,0.000006678076,0.0008475025,0.00027736893,0.0047831065,0.00077678653,0.9913173,0.0016600408,0.000027938058],"about_ca_topic_score_codex":0.0008717776,"about_ca_topic_score_gemma":0.0006135175,"teacher_disagreement_score":0.007076479,"about_ca_system_score_codex":0.00090630277,"about_ca_system_score_gemma":0.0006001198,"threshold_uncertainty_score":0.023673177},"labels":[],"label_agreement":null},{"id":"W4404990877","doi":"10.48550/arxiv.2411.18361","title":"Validated matrix multiplication transform for orthogonal polynomials with applications to computer-assisted proofs for PDEs","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Japan Society for the Promotion of Science; Ministry of Education, Culture, Sports, Science and Technology; Centre de Recherches Mathématiques","keywords":"Mathematical proof; Multiplication (music); Matrix multiplication; Orthogonal polynomials; Matrix (chemical analysis); Algebra over a field; Mathematics; Arithmetic; Computer science; Pure mathematics; Combinatorics; Materials science; Physics; Geometry","score_opus":0.058469721838947275,"score_gpt":0.2360582171481871,"score_spread":0.1775884953092398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404990877","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046510026,0.00011284262,0.99235547,0.0001514238,0.00004751855,0.000024534726,0.000019979052,0.000108444474,0.002528799],"genre_scores_gemma":[0.22700049,0.0005475374,0.767373,0.00016578875,0.00017477664,0.00014027086,0.000107829976,0.0001865037,0.0043037385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987822,0.00039952574,0.000049075556,0.00009834615,0.00061552343,0.000055354696],"domain_scores_gemma":[0.9953642,0.0029834975,0.00036763432,0.0005752245,0.0006176226,0.00009189928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018397754,0.0006183868,0.0004731193,0.00070197566,0.0005677974,0.001408063,0.0008475496,0.0007931537,0.004556555],"category_scores_gemma":[0.0112646185,0.00025446652,0.0004932473,0.0006740013,0.0017962689,0.0017608744,0.0018940414,0.0017717269,0.001074896],"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.000048986043,0.000042617117,0.00027503129,0.00013384322,0.000014392821,0.00017801778,0.00014657888,0.087103434,0.011210093,0.8348454,0.0017406315,0.064261],"study_design_scores_gemma":[0.000018439663,0.00005931616,0.00009013849,0.000034851022,0.0000046565715,0.0001732222,0.000031474643,0.78759646,0.008752143,0.19605282,0.0071684523,0.000018038945],"about_ca_topic_score_codex":0.0005121192,"about_ca_topic_score_gemma":0.00053863926,"teacher_disagreement_score":0.004556555,"about_ca_system_score_codex":0.00060940976,"about_ca_system_score_gemma":0.0010165921,"threshold_uncertainty_score":0.015243232},"labels":[],"label_agreement":null},{"id":"W4405194043","doi":"10.28924/2291-8639-22-2024-232","title":"A Review on Mathematical Methods to Approximate µ-Values","year":2024,"lang":"en","type":"review","venue":"International Journal of 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":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Singular value; Mathematics; Generalization; Robustness (evolution); Computation; Algebra over a field; Stability (learning theory); Applied mathematics; Singular solution; Numerical linear algebra; Linear algebra; Numerical analysis; Calculus (dental); Computer science; Pure mathematics; Mathematical analysis; Algorithm; Geometry","score_opus":0.049280071721816525,"score_gpt":0.4584052481708794,"score_spread":0.4091251764490629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405194043","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046235157,0.923006,0.06438661,0.001025789,0.001314228,0.00003716201,0.00017259896,0.00016275939,0.009432517],"genre_scores_gemma":[0.0055973865,0.9519248,0.03527026,0.0007149191,0.0016072011,0.0000913878,0.00028000376,0.00009000565,0.0044241194],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992576,0.00014120495,0.00008688068,0.00012626572,0.0003584859,0.000029667744],"domain_scores_gemma":[0.998257,0.001100699,0.00011430192,0.000097703116,0.00040002118,0.000030278214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010953884,0.0014820456,0.0016412531,0.0035274974,0.00045473207,0.0014189814,0.00171366,0.0014701637,0.0075703557],"category_scores_gemma":[0.0039533637,0.00079745305,0.0011031586,0.0041110422,0.0009402301,0.0029335304,0.0009425944,0.0023477627,0.0060855495],"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.00004209164,0.00007665227,0.00036552805,0.018194115,0.0001317363,0.00016930947,0.000115257266,0.0075530345,0.0027601584,0.09114621,0.05049644,0.8289496],"study_design_scores_gemma":[0.000012740312,0.00008402129,0.0005352479,0.0037407237,0.00010459262,0.0009167546,0.000056199704,0.006276608,0.0017869889,0.032570306,0.95382017,0.00009573814],"about_ca_topic_score_codex":0.0010660395,"about_ca_topic_score_gemma":0.0009192287,"teacher_disagreement_score":0.0075703557,"about_ca_system_score_codex":0.00062943215,"about_ca_system_score_gemma":0.0012200599,"threshold_uncertainty_score":0.025325358},"labels":[],"label_agreement":null},{"id":"W4405198184","doi":"10.1007/978-3-662-70074-7_2","title":"Fundamentals of Mathematics","year":2024,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Continental (Canada)","funders":"","keywords":"Mathematics education; Mathematics; Applied mathematics; Calculus (dental); Medicine","score_opus":0.020840824728209934,"score_gpt":0.24468348347375188,"score_spread":0.22384265874554193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405198184","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040339786,0.0155297555,0.012281792,0.0019163468,0.0018782549,0.00003814598,0.00027044123,0.00024825864,0.9674337],"genre_scores_gemma":[0.008323912,0.015109047,0.007294011,0.00086631574,0.0019067338,0.000092374365,0.00028272864,0.00024997944,0.9658749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99962497,0.00006268917,0.000013674324,0.00005554869,0.00021122697,0.0000317896],"domain_scores_gemma":[0.99968064,0.00011225419,0.00001643488,0.000055521647,0.00009555424,0.00003958285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033674086,0.0013676572,0.0008773061,0.0020178286,0.00141539,0.0032504483,0.0009803249,0.00084265403,0.116403215],"category_scores_gemma":[0.001073787,0.00045345965,0.00036523642,0.0023743946,0.0016296741,0.003475518,0.0015064928,0.002609327,0.07797343],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010967269,0.00003130085,0.00007408073,0.00032426947,0.000005938297,0.00003228382,0.00029082634,0.0004890895,0.00048285007,0.47683835,0.36548313,0.15593697],"study_design_scores_gemma":[0.0000019453419,0.000007419993,0.00010365959,0.00011594065,0.0000024290282,0.000048274967,0.000048213773,0.00021285456,0.0001028481,0.11796814,0.88138443,0.0000038316452],"about_ca_topic_score_codex":0.0011818976,"about_ca_topic_score_gemma":0.0032202122,"teacher_disagreement_score":0.116403215,"about_ca_system_score_codex":0.0015894558,"about_ca_system_score_gemma":0.0015230704,"threshold_uncertainty_score":0.38940758},"labels":[],"label_agreement":null},{"id":"W4405468185","doi":"10.48550/arxiv.2412.10572","title":"Revisiting The Rédei-Berge Symmetric Functions via Matrix Algebra","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Natural Sciences and Engineering Research Council of Canada; York University","keywords":"Mathematics; Algebra over a field; Matrix (chemical analysis); Pure mathematics; Combinatorics; Chemistry","score_opus":0.034559880569746015,"score_gpt":0.19320707734499373,"score_spread":0.15864719677524772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405468185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094376385,0.0038642539,0.7275341,0.007220678,0.0012065808,0.00006297765,0.00036839873,0.00032851464,0.16503814],"genre_scores_gemma":[0.79824615,0.0046831057,0.14855035,0.0019271617,0.0013077775,0.00012258631,0.00029883024,0.00035560926,0.044508535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934953,0.0002217993,0.00003068182,0.00011443138,0.00018662435,0.00009675602],"domain_scores_gemma":[0.9988689,0.0004699866,0.000085168416,0.0001950456,0.0002486043,0.0001323223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016267766,0.00078463345,0.0005778378,0.0024256087,0.0015388767,0.0030428895,0.0014789805,0.0010817451,0.008571875],"category_scores_gemma":[0.0039967042,0.0002810562,0.0006093947,0.0019742853,0.004004768,0.008957854,0.0023145138,0.002910141,0.0021930712],"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.0000018836168,0.0000032725534,0.000032615004,0.000010351755,9.287403e-7,0.000011583525,0.000058631143,0.00039581646,0.00011051755,0.99556965,0.0005581894,0.003246472],"study_design_scores_gemma":[0.0000019381014,0.000006214666,0.00003449112,0.000010677242,0.0000016913242,0.000030103121,0.000048268616,0.0042529646,0.00023461769,0.98966575,0.005706302,0.000006901152],"about_ca_topic_score_codex":0.001766771,"about_ca_topic_score_gemma":0.0019933234,"teacher_disagreement_score":0.008571875,"about_ca_system_score_codex":0.001504852,"about_ca_system_score_gemma":0.0010058982,"threshold_uncertainty_score":0.028675735},"labels":[],"label_agreement":null},{"id":"W4405545371","doi":"10.1553/etna_vol60s618","title":"LSEMINK: a modified Newton–Krylov method for Log-Sum-Exp minimization","year":2024,"lang":"en","type":"article","venue":"ETNA - Electronic Transactions on Numerical Analysis","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":"Air Force Office of Scientific Research; Canadian Institute for Advanced Research; Advanced Scientific Computing Research; U.S. Department of Energy; National Science Foundation","keywords":"Minification; Mathematics; Newton's method; Applied mathematics; Mathematical optimization; Algorithm; Computer science; Physics; Nonlinear system","score_opus":0.010496795078970216,"score_gpt":0.28247615985892727,"score_spread":0.27197936477995704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405545371","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010499276,0.00013215913,0.99714357,0.00009251173,0.000043464865,0.00003177896,0.000044832912,0.000532676,0.00092901447],"genre_scores_gemma":[0.049343552,0.00032516592,0.9412512,0.0003151598,0.000096905904,0.00035513332,0.00049256824,0.0012681787,0.0065520345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999209,0.0002623174,0.000040848117,0.000105557614,0.00031344782,0.00006887367],"domain_scores_gemma":[0.9990245,0.0005090587,0.00008429397,0.00009892101,0.00021498097,0.00006818499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013195146,0.0015320379,0.0015323267,0.00085145445,0.00051068224,0.0010829169,0.0024546678,0.0017426495,0.006544558],"category_scores_gemma":[0.0039270627,0.0008766581,0.0011082703,0.00074229133,0.0011428872,0.0016069753,0.002584454,0.0026811718,0.0030874764],"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.00012835467,0.00009887155,0.000616648,0.00037639722,0.00009407723,0.00016332332,0.00014341605,0.7468017,0.005183808,0.057891276,0.013018675,0.17548358],"study_design_scores_gemma":[0.000010480324,0.000014486755,0.000034305736,0.000010861343,0.0000027292433,0.000019135105,0.000006629674,0.9888052,0.00054749637,0.007047651,0.0034908107,0.000010088715],"about_ca_topic_score_codex":0.004277089,"about_ca_topic_score_gemma":0.006245463,"teacher_disagreement_score":0.006544558,"about_ca_system_score_codex":0.0007781857,"about_ca_system_score_gemma":0.0024872122,"threshold_uncertainty_score":0.02189374},"labels":[],"label_agreement":null},{"id":"W4405934691","doi":"10.1109/icm63406.2024.10815847","title":"Energy-Efficient Approximate Squaring Unit","year":2024,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Concordia University","funders":"","keywords":"Computer science; Unit (ring theory); Energy (signal processing); Mathematical optimization; Mathematics; Statistics","score_opus":0.014318589897856192,"score_gpt":0.23833475610619778,"score_spread":0.22401616620834158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405934691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1314927,0.0014524035,0.84788644,0.00025628036,0.0001672796,0.00009141374,0.0001712186,0.0024768992,0.016005335],"genre_scores_gemma":[0.76220334,0.000398924,0.22627907,0.00024676713,0.000087792905,0.00006305534,0.00019647443,0.00006883082,0.010455771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976677,0.0000356526,0.00002026457,0.000040456292,0.00010988626,0.00002700213],"domain_scores_gemma":[0.9997286,0.00004512765,0.000040953557,0.00006185141,0.00011067832,0.000012722697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014824855,0.00036778234,0.0003777863,0.00028826436,0.00031566495,0.0005880564,0.00079322135,0.00034800774,0.0058536613],"category_scores_gemma":[0.0005348646,0.00016259092,0.00022711654,0.00039305966,0.00018424427,0.0010548191,0.0003843956,0.00030457525,0.0011932033],"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.000659227,0.0001084663,0.0012288294,0.00040728916,0.00010010811,0.0003497077,0.00015786028,0.06544685,0.44986668,0.02365237,0.0054435683,0.452579],"study_design_scores_gemma":[0.00008355841,0.001814721,0.0017273529,0.00006650069,0.00014244186,0.0016110315,0.00011489347,0.521662,0.41706735,0.00801838,0.047606654,0.000085093416],"about_ca_topic_score_codex":0.00040958053,"about_ca_topic_score_gemma":0.000980727,"teacher_disagreement_score":0.0058536613,"about_ca_system_score_codex":0.00024043233,"about_ca_system_score_gemma":0.0003602796,"threshold_uncertainty_score":0.01958239},"labels":[],"label_agreement":null},{"id":"W4406038691","doi":"10.1007/978-3-031-68915-4_3","title":"The Singular Value Decomposition (SVD)","year":2024,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Singular value decomposition; Decomposition; Value (mathematics); Mathematics; Statistics; Algorithm; Chemistry; Organic chemistry","score_opus":0.008884676715565292,"score_gpt":0.24176234672544758,"score_spread":0.2328776700098823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406038691","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014723245,0.065207385,0.6253822,0.002500095,0.0066920756,0.000058892754,0.0011464945,0.002860413,0.2946802],"genre_scores_gemma":[0.029664133,0.10680054,0.46472958,0.0019876035,0.00648712,0.0001565212,0.0028536236,0.0027485515,0.38457233],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938226,0.00007605559,0.00003193069,0.000119994256,0.00036379343,0.00002595533],"domain_scores_gemma":[0.99941003,0.00028615212,0.000028836854,0.000095763266,0.00015621558,0.000023066203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058529805,0.0015245447,0.0011375481,0.0017738281,0.00052342133,0.003704994,0.0008914801,0.0011646149,0.033245705],"category_scores_gemma":[0.0019725799,0.0005729232,0.00063285755,0.0042019645,0.0015049658,0.0029354428,0.0012136995,0.0023518081,0.03679266],"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.00003252264,0.00004199809,0.00009835496,0.00060961803,0.000028513372,0.00007920419,0.000117058786,0.003158504,0.003361711,0.22720064,0.2109753,0.5542967],"study_design_scores_gemma":[0.0000069050266,0.000030071746,0.00020076903,0.00019193249,0.000015933694,0.00038060953,0.000070757524,0.008543578,0.0022610936,0.25240195,0.73586303,0.000033348028],"about_ca_topic_score_codex":0.00072130945,"about_ca_topic_score_gemma":0.0008773621,"teacher_disagreement_score":0.033245705,"about_ca_system_score_codex":0.00050671294,"about_ca_system_score_gemma":0.0007196177,"threshold_uncertainty_score":0.111217976},"labels":[],"label_agreement":null},{"id":"W4406060353","doi":"10.32388/ojfxkj","title":"Review of: \"Distributional Matrix Completion via Nearest Neighbors in the Wasserstein Space\"","year":2025,"lang":"en","type":"peer-review","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Space (punctuation); Matrix completion; Matrix (chemical analysis); k-nearest neighbors algorithm; Combinatorics; Mathematics; Computer science; Artificial intelligence; Physics","score_opus":0.02039606392485894,"score_gpt":0.3135993358874059,"score_spread":0.293203271962547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406060353","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016749627,0.47787026,0.105886474,0.20499966,0.16150792,0.00021180815,0.001430449,0.0008224481,0.045596037],"genre_scores_gemma":[0.03018613,0.66339976,0.03825955,0.039428458,0.15192316,0.00024878234,0.0025996983,0.0010069854,0.07294751],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99583864,0.001247173,0.00023705595,0.0005169999,0.0020227556,0.00013742085],"domain_scores_gemma":[0.9669135,0.013187571,0.00081470155,0.0017559516,0.016198374,0.001129872],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.008413256,0.0007086651,0.001427746,0.0036646693,0.00096313347,0.0029959723,0.0022621115,0.0024417983,0.01728666],"category_scores_gemma":[0.0505312,0.00046781276,0.00051982113,0.0049159494,0.0026502206,0.006250819,0.001955292,0.0036060438,0.0112021705],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033131186,0.00002016944,0.0001345152,0.0010270417,0.000036326775,0.00002590289,0.00003817251,0.00080351013,0.00013695104,0.043569144,0.79136574,0.16280937],"study_design_scores_gemma":[0.000013768907,0.000024137868,0.00039972708,0.00064831664,0.000024348954,0.0001224483,0.00004278521,0.0014920821,0.00027138714,0.024521824,0.9724038,0.000035398],"about_ca_topic_score_codex":0.00417134,"about_ca_topic_score_gemma":0.0059186085,"teacher_disagreement_score":0.99158674,"about_ca_system_score_codex":0.002216144,"about_ca_system_score_gemma":0.004808669,"threshold_uncertainty_score":0.05782962},"labels":[],"label_agreement":null},{"id":"W4406268602","doi":"10.1016/j.laa.2025.01.008","title":"Refined inertias of nonnegative patterns with positive off-diagonal entries","year":2025,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Diagonal; Mathematics; Combinatorics; Pure mathematics; Geometry","score_opus":0.005177001256444864,"score_gpt":0.23287553630195182,"score_spread":0.22769853504550697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406268602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41895396,0.00041149772,0.55757874,0.0005055647,0.00042288346,0.00007211723,0.00041528713,0.00047964833,0.021160308],"genre_scores_gemma":[0.9237204,0.00029637208,0.060369503,0.00024964768,0.00044673542,0.00008970336,0.0006109015,0.00031036313,0.013906374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988451,0.00023602997,0.000088160195,0.00031423382,0.00029350686,0.0002229497],"domain_scores_gemma":[0.99452657,0.0018672302,0.0009445076,0.0010723413,0.00073448697,0.0008548803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013441266,0.000808025,0.0008731035,0.0023514582,0.0007826556,0.0021988824,0.001403854,0.0008421848,0.010176361],"category_scores_gemma":[0.0089241285,0.00062635296,0.00080485136,0.0013740642,0.002837454,0.0036051304,0.0019736146,0.0015737616,0.0010559703],"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.00039598448,0.00010631221,0.0021401022,0.00013922968,0.000028703626,0.00032527474,0.000591119,0.006520231,0.014300027,0.9424115,0.003876655,0.029165016],"study_design_scores_gemma":[0.000055888384,0.000102980994,0.0022568,0.000042187934,0.00002204007,0.00032828635,0.00023490023,0.08032471,0.0029445605,0.91035527,0.0032649047,0.00006746642],"about_ca_topic_score_codex":0.0006169507,"about_ca_topic_score_gemma":0.00075857644,"teacher_disagreement_score":0.010176361,"about_ca_system_score_codex":0.00041746776,"about_ca_system_score_gemma":0.00038936807,"threshold_uncertainty_score":0.034043312},"labels":[],"label_agreement":null},{"id":"W4406338746","doi":"10.1007/s00020-024-02790-7","title":"Lifting Sylvester Equations: Singular Value Decay for Non-Normal Coefficients","year":2025,"lang":"en","type":"article","venue":"Integral Equations and Operator Theory","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Value (mathematics); Mathematical analysis; Singular value; Pure mathematics; Eigenvalues and eigenvectors; Statistics","score_opus":0.01189362555371453,"score_gpt":0.2753412829443702,"score_spread":0.2634476573906557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406338746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03948766,0.0005883784,0.94409204,0.00069506164,0.00033843258,0.0000394556,0.000075768956,0.0001833197,0.014499977],"genre_scores_gemma":[0.5952102,0.002483198,0.3388329,0.00076559,0.0010334139,0.00016688749,0.0004208228,0.0006253416,0.060461704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991571,0.00022606521,0.00004648,0.00013415652,0.0003332429,0.00010301443],"domain_scores_gemma":[0.9978756,0.0007513888,0.000256565,0.000338113,0.0005403339,0.00023800432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019416459,0.0012187498,0.0009386163,0.0015607576,0.00082156784,0.0028458852,0.0015737055,0.0015097859,0.0066010943],"category_scores_gemma":[0.0077025173,0.0005102064,0.00083833723,0.0011940342,0.0023432986,0.006164459,0.0026906969,0.00440675,0.0014029853],"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.000025751979,0.000031403026,0.00013210897,0.00003668985,0.000007278137,0.000060534327,0.00014173723,0.0043779267,0.002345542,0.9800725,0.0011948046,0.011573709],"study_design_scores_gemma":[0.000011234543,0.000015345553,0.00008130596,0.000016984812,0.000005822071,0.000085766784,0.000052912757,0.111179054,0.001394648,0.88504696,0.0020922003,0.000017763776],"about_ca_topic_score_codex":0.0011194721,"about_ca_topic_score_gemma":0.0012453259,"teacher_disagreement_score":0.0066010943,"about_ca_system_score_codex":0.001169698,"about_ca_system_score_gemma":0.0009633344,"threshold_uncertainty_score":0.022082865},"labels":[],"label_agreement":null},{"id":"W4406486928","doi":"","title":"Zeta-Based Framework for Standard Model Embedding with Non-Holomorphic Manifolds","year":2025,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Mount Royal University","funders":"","keywords":"Embedding; Holomorphic function; Mathematics; Pure mathematics; Topology (electrical circuits); Computer science; Artificial intelligence; Combinatorics","score_opus":0.015165964738582335,"score_gpt":0.2591367919264994,"score_spread":0.24397082718791707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406486928","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45109418,0.001464727,0.41278383,0.003509876,0.0009027235,0.00012555643,0.00042258485,0.00053309195,0.12916346],"genre_scores_gemma":[0.9232304,0.00074292766,0.037257515,0.00059202954,0.000867815,0.00014463162,0.000395059,0.00029833088,0.036471352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999348,0.00015205759,0.000038088718,0.00013613193,0.00017862867,0.00014714924],"domain_scores_gemma":[0.9991516,0.00013269378,0.00012242733,0.00015161233,0.00017753731,0.00026407433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011975528,0.0010679023,0.0014121291,0.0029382762,0.0020489537,0.003247658,0.0018678256,0.0018495199,0.008367569],"category_scores_gemma":[0.0017940097,0.00047602417,0.0015900029,0.00096030073,0.0027925316,0.0069505656,0.0037612484,0.0034741887,0.0012564684],"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.000012453174,0.000012451869,0.000064509106,0.000013550773,0.000003938824,0.000035948404,0.0000877399,0.00043043672,0.00034678463,0.99765235,0.00030149796,0.0010383116],"study_design_scores_gemma":[0.000013525066,0.000021055546,0.0001293398,0.000010370957,0.000006554719,0.00004770886,0.000095330535,0.011377443,0.00019614429,0.98658144,0.0015095312,0.000011463172],"about_ca_topic_score_codex":0.001434751,"about_ca_topic_score_gemma":0.0012701337,"teacher_disagreement_score":0.008367569,"about_ca_system_score_codex":0.0017380617,"about_ca_system_score_gemma":0.00089231157,"threshold_uncertainty_score":0.027992308},"labels":[],"label_agreement":null},{"id":"W4406549712","doi":"10.1115/1.4067686","title":"Adjoint Error Correction on Unstructured Finite Volume Solvers","year":2024,"lang":"en","type":"article","venue":"Journal of Verification Validation and Uncertainty Quantification","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Finite volume method; Volume (thermodynamics); Computer science; Unstructured data; Applied mathematics; Mathematics; Mechanics; Data mining; Physics; Thermodynamics","score_opus":0.026840557578139308,"score_gpt":0.2810176216493725,"score_spread":0.2541770640712332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406549712","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017211715,0.000051798565,0.9804514,0.000048487367,0.000083587365,0.000030001935,0.00001678894,0.00038605463,0.0017201229],"genre_scores_gemma":[0.5253641,0.00007479572,0.4703032,0.00009296252,0.000041165407,0.00008131582,0.00012035385,0.00019609273,0.0037260747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845207,0.00054767996,0.000052774067,0.000092964816,0.0007909142,0.00006357511],"domain_scores_gemma":[0.9968418,0.0015686783,0.00018693953,0.00044279167,0.0009024529,0.000057447513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017235851,0.00046744943,0.0005748785,0.0006285114,0.0002910505,0.00063981494,0.0006696507,0.00071647274,0.0013352367],"category_scores_gemma":[0.007023432,0.0002152269,0.0003938939,0.00037733742,0.0009155004,0.0005326574,0.0011939484,0.0010102262,0.00030981406],"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.0001513355,0.000064775864,0.00098461,0.00012099531,0.00002827857,0.00015546689,0.00012485839,0.8178059,0.037842505,0.056182887,0.001134381,0.085403994],"study_design_scores_gemma":[0.000004913432,0.000018667053,0.00006775382,0.0000055334526,0.0000017624319,0.000021132482,0.000005056683,0.9890999,0.005721261,0.0041554826,0.00089423143,0.000004369918],"about_ca_topic_score_codex":0.0011468001,"about_ca_topic_score_gemma":0.0008123879,"teacher_disagreement_score":0.0017235851,"about_ca_system_score_codex":0.0003272344,"about_ca_system_score_gemma":0.0006194512,"threshold_uncertainty_score":0.009115338},"labels":[],"label_agreement":null},{"id":"W4406557193","doi":"10.1016/s1876-1143(12)70022-8","title":"10.1016/s1876-1143(12)70022-8","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Medicine; Internal medicine; Cardiology","score_opus":0.005282344650652932,"score_gpt":0.17083881737775375,"score_spread":0.1655564727271008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406557193","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045188132,0.00039498752,0.0013589,0.0003994031,0.0003215878,0.00013741376,0.0012973252,0.0016237171,0.9940149],"genre_scores_gemma":[0.00078137784,0.00022117523,0.00070269103,0.00022484706,0.00007532834,0.0000795773,0.0007145468,0.0003100464,0.99689037],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894553,0.00007953327,0.0000839925,0.0003887151,0.0002661188,0.0002361442],"domain_scores_gemma":[0.99712855,0.0007953448,0.00018333877,0.0004199843,0.0005072395,0.00096569676],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014644293,0.0041820733,0.002455066,0.003912532,0.0027782472,0.0047842474,0.004218371,0.0065621384,0.9918976],"category_scores_gemma":[0.002060097,0.001293238,0.0018622465,0.0037653313,0.0027787334,0.0067147026,0.004583801,0.0035332309,0.9942253],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047929125,0.00031229566,0.0009814808,0.00066368777,0.000053132222,0.00026295488,0.00010152815,0.0007154651,0.0024083196,0.007926333,0.408634,0.57746154],"study_design_scores_gemma":[0.00009352825,0.00016157336,0.00073873636,0.0003667953,0.00001920808,0.00036091192,0.00013318703,0.0005166049,0.00061514095,0.0010953766,0.9958597,0.000039310806],"about_ca_topic_score_codex":0.0044681085,"about_ca_topic_score_gemma":0.003349933,"teacher_disagreement_score":0.008102417,"about_ca_system_score_codex":0.0015910774,"about_ca_system_score_gemma":0.00142374,"threshold_uncertainty_score":0.011557043},"labels":[],"label_agreement":null},{"id":"W4406659607","doi":"10.1016/b978-0-340-69138-0.50012-9","title":"10.1016/b978-0-340-69138-0.50012-9","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Mathematics","score_opus":0.008005190506057169,"score_gpt":0.17594678997556362,"score_spread":0.16794159946950646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406659607","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022416745,0.00038523806,0.0015543932,0.00034735963,0.0001670045,0.00005480535,0.0012274506,0.0015886034,0.99445087],"genre_scores_gemma":[0.0006167847,0.0002368472,0.00055450667,0.00012980471,0.00003673005,0.00004104264,0.00072656694,0.0004036545,0.9972541],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99935275,0.000037736954,0.000041545703,0.0002388315,0.00020389259,0.00012525475],"domain_scores_gemma":[0.9976659,0.00071622815,0.00016307808,0.00040356402,0.0004125679,0.0006386927],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011200454,0.002643661,0.0017415954,0.0023690094,0.0014911843,0.0050752456,0.0032902185,0.004404991,0.98542225],"category_scores_gemma":[0.0020598264,0.0010119713,0.0010390091,0.0027498978,0.0014553324,0.0054377457,0.0037505664,0.0024677704,0.99303025],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017084704,0.00014803553,0.00043252402,0.0004416748,0.000021981245,0.0001137709,0.00007585312,0.00048620126,0.0022302533,0.0072269477,0.4045934,0.58405846],"study_design_scores_gemma":[0.00002531862,0.000054335236,0.00052765803,0.00025735228,0.00000948907,0.00018998134,0.000080562386,0.00022764236,0.00045482535,0.001429245,0.99672735,0.000016168875],"about_ca_topic_score_codex":0.0031478354,"about_ca_topic_score_gemma":0.002687464,"teacher_disagreement_score":0.014577746,"about_ca_system_score_codex":0.001155488,"about_ca_system_score_gemma":0.00088652637,"threshold_uncertainty_score":0.020793319},"labels":[],"label_agreement":null},{"id":"W4406660453","doi":"10.1016/b978-0-340-67769-8.50039-2","title":"10.1016/b978-0-340-67769-8.50039-2","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Table (database); Computer science; Database","score_opus":0.007885410098479569,"score_gpt":0.17554065965450455,"score_spread":0.16765524955602498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406660453","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002285157,0.00039216812,0.001623741,0.00036283082,0.00017980092,0.000056631336,0.0012038768,0.0014875437,0.9944648],"genre_scores_gemma":[0.00059061,0.00023486999,0.00057242904,0.00013117053,0.00003488458,0.000040804865,0.0006796493,0.00036199094,0.99735355],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999403,0.000034766927,0.00003797185,0.00021753089,0.00018797834,0.000118739525],"domain_scores_gemma":[0.9978739,0.000649632,0.00015582531,0.00035228833,0.00037805078,0.00059030985],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010639658,0.0025008437,0.0016168993,0.0022726927,0.0014394308,0.004941121,0.0032650197,0.0043470208,0.98482877],"category_scores_gemma":[0.0019047781,0.0009742044,0.0010035187,0.0026513706,0.001321989,0.005385888,0.0035648863,0.0023628564,0.9924838],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016755337,0.00014994828,0.0004476667,0.0004425588,0.000021459433,0.00011789313,0.00007249731,0.00050182024,0.002373323,0.0071153427,0.40223798,0.58635205],"study_design_scores_gemma":[0.000023562661,0.00005297515,0.000497576,0.00025222084,0.0000094264715,0.00018819835,0.000080274905,0.00023192634,0.0004664504,0.0014149832,0.9967669,0.000015447053],"about_ca_topic_score_codex":0.0028764764,"about_ca_topic_score_gemma":0.0025499917,"teacher_disagreement_score":0.01517123,"about_ca_system_score_codex":0.0010884621,"about_ca_system_score_gemma":0.0008345461,"threshold_uncertainty_score":0.021639943},"labels":[],"label_agreement":null},{"id":"W4406660697","doi":"10.1016/b978-0-340-69138-0.50018-x","title":"10.1016/b978-0-340-69138-0.50018-x","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quadratic equation; Mathematics; Pure mathematics; Geometry","score_opus":0.007876240342802706,"score_gpt":0.17581871663583437,"score_spread":0.16794247629303166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406660697","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022025435,0.00038603623,0.0014818582,0.00034022707,0.00016044397,0.00004986969,0.0010687949,0.0015635929,0.994729],"genre_scores_gemma":[0.0005743704,0.0002546781,0.00055470644,0.00013621451,0.00003812545,0.000038395534,0.000650756,0.00038431017,0.99736834],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994311,0.000035044162,0.00003726773,0.000207224,0.00018034055,0.00010891076],"domain_scores_gemma":[0.9977804,0.0006735669,0.00016037172,0.00038469082,0.0003705761,0.00063042407],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010113246,0.0026316163,0.0015590629,0.0023424325,0.0013642899,0.0047726417,0.0030484216,0.0041713794,0.9824786],"category_scores_gemma":[0.0020659526,0.00090890005,0.000899671,0.002850389,0.001273249,0.0055677462,0.0034180684,0.0022616694,0.9915569],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013692083,0.00013642502,0.00041944033,0.00040323703,0.000018444745,0.00009912333,0.00007511306,0.00043245484,0.0018932623,0.007401698,0.4320915,0.5568924],"study_design_scores_gemma":[0.000020816411,0.000047225887,0.0005333419,0.00022086536,0.000008561895,0.00017084266,0.00007424979,0.00020748736,0.00038528253,0.0013972579,0.99691975,0.000014328921],"about_ca_topic_score_codex":0.0032307196,"about_ca_topic_score_gemma":0.0027939463,"teacher_disagreement_score":0.017521381,"about_ca_system_score_codex":0.0010605636,"about_ca_system_score_gemma":0.00086087687,"threshold_uncertainty_score":0.024992049},"labels":[],"label_agreement":null},{"id":"W4406662009","doi":"10.1016/j.laa.2025.01.019","title":"Linear preservers of parallel matrix pairs with respect to the k-numerical radius","year":2025,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Pacific Institute for the Mathematical Sciences; University of Regina; Simons Foundation","keywords":"Mathematics; Spectral radius; RADIUS; Matrix (chemical analysis); Combinatorics; Mathematical analysis; Pure mathematics; Eigenvalues and eigenvectors; Physics; Chemistry; Quantum mechanics; Computer science","score_opus":0.01013945232307905,"score_gpt":0.26611408791477026,"score_spread":0.2559746355916912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406662009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35697514,0.00042487308,0.557693,0.000800425,0.0004450823,0.00014052981,0.00030512267,0.0011367494,0.082079016],"genre_scores_gemma":[0.89997524,0.0004043815,0.05699076,0.00032437206,0.00043997966,0.00020317663,0.000288189,0.000790981,0.04058299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858886,0.00034401123,0.00007645747,0.0002831976,0.0004928495,0.000214649],"domain_scores_gemma":[0.99678636,0.00078689976,0.0006511104,0.000658499,0.0006161726,0.0005010018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012549345,0.0009591778,0.0006057858,0.0015573129,0.0014746703,0.0029069423,0.0012159176,0.00085483055,0.011523289],"category_scores_gemma":[0.0058417525,0.0004891556,0.0006871527,0.0008384167,0.0030569371,0.0038750689,0.0026308768,0.0018792732,0.002211355],"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.0001683391,0.000049450322,0.00030373712,0.000046301597,0.000019985568,0.00013831965,0.00021560794,0.004832863,0.0057469197,0.973375,0.0017901865,0.0133132655],"study_design_scores_gemma":[0.000042669362,0.00021378082,0.00058786117,0.00002192814,0.000019399966,0.00059800193,0.00019748638,0.04754258,0.013516629,0.92990726,0.007295564,0.000056824243],"about_ca_topic_score_codex":0.0004654812,"about_ca_topic_score_gemma":0.00037293907,"teacher_disagreement_score":0.011523289,"about_ca_system_score_codex":0.0006724474,"about_ca_system_score_gemma":0.0007251498,"threshold_uncertainty_score":0.038549185},"labels":[],"label_agreement":null},{"id":"W4406735090","doi":"10.48550/arxiv.2501.11341","title":"Lee and Seung (2000)'s Algorithms for Non-negative Matrix Factorization: A Supplementary Proof Guide","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","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":"Fonds de recherche du Québec – Nature et technologies","keywords":"Algorithm; Factorization; Computer science; Matrix (chemical analysis); Mathematics; Chemistry","score_opus":0.028005912001761297,"score_gpt":0.3088608509611468,"score_spread":0.2808549389593855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406735090","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060045003,0.0034446747,0.9580084,0.0027658816,0.002883169,0.00038547599,0.0029991912,0.0030657768,0.025846954],"genre_scores_gemma":[0.020696124,0.005751816,0.92946154,0.0023893216,0.0021142946,0.001475513,0.005310158,0.0029275098,0.029873706],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980977,0.0004461957,0.00017729629,0.00031588582,0.000861821,0.00010108089],"domain_scores_gemma":[0.99230003,0.0042742766,0.00022014295,0.00090385997,0.0021744368,0.00012726117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030729892,0.0033257375,0.0011587837,0.0028460652,0.0011474174,0.0029107663,0.0021255012,0.002582131,0.1112165],"category_scores_gemma":[0.024516454,0.0013895545,0.0019742525,0.0038057505,0.0012983957,0.005217665,0.0029509359,0.0057404623,0.07697239],"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.00008885378,0.00030087974,0.00058618333,0.0014584218,0.00010690914,0.00050273415,0.0002620722,0.0059011905,0.003839996,0.3324269,0.36411768,0.2904082],"study_design_scores_gemma":[0.000107241736,0.00006358591,0.00065682625,0.00035997428,0.00004336166,0.0011975073,0.00006584622,0.032906637,0.0048078666,0.48578882,0.4738576,0.00014466794],"about_ca_topic_score_codex":0.0016605526,"about_ca_topic_score_gemma":0.0025263424,"teacher_disagreement_score":0.1112165,"about_ca_system_score_codex":0.0010263425,"about_ca_system_score_gemma":0.0022428604,"threshold_uncertainty_score":0.37205625},"labels":[],"label_agreement":null},{"id":"W4406772036","doi":"10.1142/s2010326325500029","title":"Moments of the derivative of the characteristic polynomial of unitary matrices","year":2025,"lang":"en","type":"article","venue":"Random Matrices Theory and Application","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Unitary state; Mathematics; Polynomial; Derivative (finance); Unitary matrix; Pure mathematics; Matrix polynomial; Algebra over a field; Mathematical analysis; Political science; Law; Economics","score_opus":0.003211862798051743,"score_gpt":0.22344950174313102,"score_spread":0.22023763894507928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406772036","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4856275,0.0017972552,0.4405644,0.0016815646,0.00039550627,0.00006330671,0.00038815214,0.00070056645,0.068781696],"genre_scores_gemma":[0.98030233,0.0005205494,0.009812385,0.00011371161,0.00024827948,0.000027658049,0.000092233946,0.00013038146,0.008752404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995097,0.00008543129,0.000017076973,0.000092954375,0.0001631509,0.0001317444],"domain_scores_gemma":[0.9979352,0.00087742304,0.00034826205,0.00025310714,0.00035275074,0.00023342553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079670147,0.00043445695,0.00056917773,0.0016862225,0.00058902375,0.0017979172,0.0008917107,0.0005769688,0.0059293485],"category_scores_gemma":[0.008428314,0.0003005453,0.00051858195,0.0009270471,0.002221791,0.0029976019,0.0011640294,0.0015249802,0.0008102688],"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.00006706287,0.000024911926,0.0007230534,0.000053215328,0.000010294336,0.00022200771,0.00019231242,0.009467706,0.005166942,0.97456145,0.0011587017,0.008352379],"study_design_scores_gemma":[0.000024888379,0.00005526312,0.0026374909,0.00005280681,0.000016049818,0.0006546621,0.00013370416,0.16643353,0.0068831444,0.8180691,0.004949251,0.000090139954],"about_ca_topic_score_codex":0.00090345374,"about_ca_topic_score_gemma":0.0006193754,"teacher_disagreement_score":0.0059293485,"about_ca_system_score_codex":0.0016119857,"about_ca_system_score_gemma":0.0007907562,"threshold_uncertainty_score":0.01983565},"labels":[],"label_agreement":null},{"id":"W4406824205","doi":"10.18280/mmep.120122","title":"Legendre Operational Differential Matrix for Solving Fuzzy Differential Equations","year":2025,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Legendre polynomials; Matrix (chemical analysis); Differential (mechanical device); Mathematics; Fuzzy logic; Differential equation; Applied mathematics; Mathematical analysis; Computer science; Physics; Artificial intelligence; Materials science","score_opus":0.01959118779284146,"score_gpt":0.2407644381456252,"score_spread":0.22117325035278373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406824205","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040335353,0.0004531631,0.9928536,0.00012510583,0.00014295247,0.000014518792,0.000020879006,0.000047285932,0.0023089894],"genre_scores_gemma":[0.35911623,0.002044867,0.62402564,0.00026494227,0.00033606248,0.00015504946,0.00013905374,0.0001405944,0.013777596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997063,0.000116356554,0.000018999686,0.00003676286,0.000102016165,0.000019574481],"domain_scores_gemma":[0.9994326,0.0002513172,0.000040451258,0.00004738377,0.00018820545,0.000039934446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084574166,0.0006357109,0.00066528976,0.00077101326,0.000378596,0.000996032,0.0008810359,0.000810981,0.0025358698],"category_scores_gemma":[0.002420194,0.00021672169,0.0005546482,0.0010102787,0.000820821,0.0011423897,0.00074724393,0.0016215042,0.0005305381],"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.00004109844,0.000043172,0.00020854636,0.00021272997,0.00003994669,0.0000904298,0.00022255693,0.10665824,0.010534378,0.8082325,0.002655953,0.071060486],"study_design_scores_gemma":[0.0000071625823,0.000034332657,0.00010690201,0.000020980047,0.000014022678,0.000066192006,0.00004400516,0.8330765,0.0018272976,0.15931523,0.0054644854,0.000022883898],"about_ca_topic_score_codex":0.002138075,"about_ca_topic_score_gemma":0.0019072591,"teacher_disagreement_score":0.0025358698,"about_ca_system_score_codex":0.00051989325,"about_ca_system_score_gemma":0.00075665204,"threshold_uncertainty_score":0.00848335},"labels":[],"label_agreement":null},{"id":"W4407130731","doi":"10.1080/17476933.2025.2461572","title":"Orthogonal projections in the local Dirichlet spaces","year":2025,"lang":"en","type":"article","venue":"Complex Variables and Elliptic Equations","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":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Labex; Agence Nationale de la Recherche","keywords":"Mathematics; Dirichlet distribution; Pure mathematics; Mathematical analysis","score_opus":0.02745117912114878,"score_gpt":0.274563713056066,"score_spread":0.24711253393491725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407130731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09724799,0.00027428847,0.8845066,0.00029943645,0.00007808541,0.000035001776,0.00008596426,0.00012087394,0.01735193],"genre_scores_gemma":[0.81420285,0.0007201208,0.1669043,0.00014992426,0.00021789774,0.00012959319,0.00019562764,0.00019112983,0.01728865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992854,0.00024011897,0.000026688997,0.000102518585,0.0002450829,0.00010032077],"domain_scores_gemma":[0.99904865,0.00032612032,0.00009044521,0.00014670099,0.00021321714,0.00017490874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011563898,0.0005865973,0.00041061264,0.0010907707,0.0005918288,0.0014736967,0.0007925331,0.00042102046,0.004372843],"category_scores_gemma":[0.003810984,0.00025848433,0.00042297354,0.0005863752,0.0020779239,0.0024217993,0.0024151248,0.0015188508,0.0008888752],"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.000015686994,0.00001429369,0.00016762117,0.000024662095,0.000004401442,0.000042211374,0.00010458161,0.007340454,0.0010620584,0.9819271,0.0004006143,0.008896242],"study_design_scores_gemma":[0.000009757372,0.00003915165,0.00019519322,0.000023716486,0.0000050048056,0.00010966746,0.00011721051,0.15301166,0.0023774684,0.84012365,0.003968663,0.000018767298],"about_ca_topic_score_codex":0.00053353823,"about_ca_topic_score_gemma":0.0005637672,"teacher_disagreement_score":0.004372843,"about_ca_system_score_codex":0.0005696545,"about_ca_system_score_gemma":0.0005296976,"threshold_uncertainty_score":0.014628589},"labels":[],"label_agreement":null},{"id":"W4407568126","doi":"10.1140/epjd/s10053-025-00966-3","title":"On matrix elements of the vector physical quantities","year":2025,"lang":"en","type":"article","venue":"The European Physical Journal D","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Matrix (chemical analysis); Mathematics; Materials science; Composite material","score_opus":0.010745806521097538,"score_gpt":0.2691183288674105,"score_spread":0.25837252234631297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407568126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026481519,0.0029702552,0.9229736,0.001934924,0.0012164783,0.000060526258,0.00026781697,0.0002281246,0.043866802],"genre_scores_gemma":[0.55354816,0.010983872,0.36350247,0.0025164287,0.002412785,0.0004203991,0.0010315551,0.0010876976,0.06449669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881303,0.0005579097,0.000047303394,0.00015833844,0.00033994872,0.00008355683],"domain_scores_gemma":[0.99667156,0.0020983017,0.00023366237,0.0003501805,0.00051797717,0.00012814709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020596636,0.0012019824,0.00075539516,0.0017647209,0.0007803701,0.0027058974,0.0014276896,0.001528037,0.01021185],"category_scores_gemma":[0.009731857,0.00042431732,0.0005508696,0.0020539018,0.0027830773,0.004377176,0.0020926401,0.003371749,0.002752234],"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.000032007054,0.000022687007,0.0001789632,0.000108579894,0.00001447435,0.000042022435,0.0001337123,0.008839108,0.0010721148,0.9698711,0.0021525705,0.017532825],"study_design_scores_gemma":[0.000008347675,0.000019408057,0.00016045476,0.000066267035,0.000006756834,0.00005696788,0.00004177776,0.054215614,0.00057880697,0.9388083,0.006017794,0.000019593359],"about_ca_topic_score_codex":0.000972486,"about_ca_topic_score_gemma":0.00087332854,"teacher_disagreement_score":0.01021185,"about_ca_system_score_codex":0.00073684304,"about_ca_system_score_gemma":0.0006329191,"threshold_uncertainty_score":0.034162045},"labels":[],"label_agreement":null},{"id":"W4407632035","doi":"10.48550/arxiv.2502.09737","title":"Adjoint of Least Squares Shadowing: Existence, Uniqueness and Coarse Domain Discretization","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","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":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Uniqueness; Discretization; Domain (mathematical analysis); Least-squares function approximation; Mathematics; Applied mathematics; Mathematical analysis; Statistics","score_opus":0.027866098882894645,"score_gpt":0.26885160892010573,"score_spread":0.24098551003721108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407632035","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023724861,0.00017041626,0.9722741,0.0002358903,0.000040496096,0.000029177092,0.00003306598,0.00012974766,0.0033621883],"genre_scores_gemma":[0.7307814,0.00035064772,0.2613077,0.00025502808,0.00008682,0.00012573582,0.00013775704,0.0002434797,0.0067114453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949515,0.00014423355,0.000024523875,0.0000857779,0.00018988257,0.00006034222],"domain_scores_gemma":[0.99736303,0.0016593699,0.00027317932,0.00026790015,0.00030362073,0.00013276977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014156954,0.0005927461,0.00058739714,0.00059542013,0.00032600723,0.0014214632,0.0006915472,0.0008136034,0.0021096356],"category_scores_gemma":[0.0076952316,0.00032390215,0.00064568646,0.0002519841,0.0023010843,0.001094741,0.0023281535,0.0019453068,0.00027696477],"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.00012025363,0.00006317883,0.0032693082,0.00017469905,0.00003759758,0.0003064709,0.00036469943,0.5884963,0.020220986,0.35590178,0.0010928307,0.029951815],"study_design_scores_gemma":[0.000003375211,0.00000962678,0.00011277921,0.000009963636,0.0000017860342,0.000021873653,0.000014960599,0.9699978,0.0012875516,0.02805056,0.00048321675,0.0000064443793],"about_ca_topic_score_codex":0.0023351093,"about_ca_topic_score_gemma":0.0015689051,"teacher_disagreement_score":0.0023351093,"about_ca_system_score_codex":0.00058928126,"about_ca_system_score_gemma":0.0009538203,"threshold_uncertainty_score":0.007486999},"labels":[],"label_agreement":null},{"id":"W4407871952","doi":"10.1007/978-981-96-1078-5_7","title":"Fourier Series","year":2024,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Series (stratigraphy); Fourier series; Computer science; Mathematics; Geology; Mathematical analysis; Paleontology","score_opus":0.012148939555988395,"score_gpt":0.2159015156146627,"score_spread":0.2037525760586743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407871952","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012024916,0.00940091,0.026648678,0.00082179613,0.0022714126,0.00001964464,0.00022894448,0.00038481323,0.9590214],"genre_scores_gemma":[0.017367467,0.0076444293,0.008982909,0.0003171716,0.001703012,0.000040666702,0.00028080185,0.00047781586,0.9631857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997218,0.000038095557,0.000007978929,0.000043579574,0.00016980896,0.000018614177],"domain_scores_gemma":[0.9997501,0.000063251406,0.000013462468,0.00006350271,0.00008506497,0.000024576211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000305149,0.0011305753,0.00072256604,0.0023652327,0.0008479228,0.0026682129,0.00072975014,0.00065482734,0.09718104],"category_scores_gemma":[0.0011615395,0.00034041813,0.00032182905,0.002052374,0.0010849811,0.0026656738,0.0011581056,0.0021631266,0.049928848],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014928874,0.000023186043,0.000058908507,0.00015668718,0.00000780034,0.000041051804,0.00014430762,0.0006136441,0.0013354544,0.6341564,0.16670612,0.19674148],"study_design_scores_gemma":[0.0000042892166,0.000014065624,0.00020940107,0.00009140991,0.000006261495,0.00023595878,0.00006018949,0.001899264,0.00092108443,0.18716885,0.8093777,0.000011513248],"about_ca_topic_score_codex":0.0006670112,"about_ca_topic_score_gemma":0.0011556195,"teacher_disagreement_score":0.09718104,"about_ca_system_score_codex":0.0008496949,"about_ca_system_score_gemma":0.00047292816,"threshold_uncertainty_score":0.32510298},"labels":[],"label_agreement":null},{"id":"W4407923948","doi":"10.1137/23m1605454","title":"M<scp>in</scp>A<scp>res</scp>: An Iterative Solver for Symmetric Linear Systems","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Solver; Mathematics; Linear system; Iterative method; Applied mathematics; Combinatorics; Mathematical optimization; Algebra over a field; Mathematical analysis; Pure mathematics","score_opus":0.011169576101567925,"score_gpt":0.2962808699257752,"score_spread":0.28511129382420725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407923948","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036993623,0.00008339674,0.96087456,0.0003500654,0.00033107403,0.0001246753,0.00095131365,0.014946468,0.01863912],"genre_scores_gemma":[0.070152834,0.000109923305,0.8864147,0.00045303666,0.00013894375,0.0003131813,0.0020711177,0.010056643,0.030289598],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993579,0.00014799666,0.000039481492,0.000091444745,0.00027705453,0.00008619382],"domain_scores_gemma":[0.9988636,0.00035804563,0.00006995544,0.00020081723,0.00040513347,0.000102611535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080368563,0.0013176893,0.0007539101,0.0009177091,0.0008309674,0.0015217208,0.0022460823,0.0019004615,0.04273115],"category_scores_gemma":[0.0036188269,0.000672705,0.00086411077,0.00097550056,0.0007458918,0.0013984831,0.0025538162,0.0021770576,0.02083356],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051576074,0.00037537908,0.0011939778,0.00072025607,0.00020371185,0.0007644854,0.00030411562,0.14747104,0.022371788,0.09924126,0.27489507,0.45194316],"study_design_scores_gemma":[0.00014439077,0.000051282026,0.00013866101,0.000046796325,0.00001708406,0.00016227836,0.000039307557,0.92175627,0.012500659,0.019434715,0.04567165,0.000036855916],"about_ca_topic_score_codex":0.004133607,"about_ca_topic_score_gemma":0.010189515,"teacher_disagreement_score":0.04273115,"about_ca_system_score_codex":0.00050013943,"about_ca_system_score_gemma":0.002246408,"threshold_uncertainty_score":0.14294988},"labels":[],"label_agreement":null},{"id":"W4407951142","doi":"10.1109/synasc65383.2024.00018","title":"Some Family Relations for Rational Orthogonal Matrices","year":2024,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Western University","funders":"","keywords":"Computer science; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.016950043072738803,"score_gpt":0.2646684150447807,"score_spread":0.2477183719720419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407951142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12800296,0.0036569189,0.4741124,0.0044315974,0.0009429518,0.00010681463,0.0010400786,0.0006542238,0.38705203],"genre_scores_gemma":[0.8170928,0.0034713554,0.09323005,0.001252019,0.0009723715,0.00022174964,0.0012371398,0.00053936755,0.08198308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988955,0.0003918029,0.00006592945,0.00021967619,0.00026665546,0.0001604265],"domain_scores_gemma":[0.9976544,0.0012916941,0.0002517746,0.0001940362,0.00043169886,0.00017647746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001790455,0.0005716515,0.00034593538,0.0023710649,0.0017502402,0.0022142595,0.0005358344,0.0006704387,0.018250758],"category_scores_gemma":[0.0051889895,0.00034574416,0.00088647444,0.001332331,0.0018990021,0.004324538,0.0013061932,0.0016725622,0.0024413967],"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.000007358818,0.0000044980893,0.00011692301,0.000017940181,0.0000026528655,0.000054598,0.00018093904,0.00023170857,0.00020096221,0.9906308,0.002511429,0.0060402644],"study_design_scores_gemma":[0.0000062736203,0.000010816145,0.00018331583,0.000017660957,0.000004347198,0.00022408315,0.00014678309,0.0031755543,0.00042031644,0.97720087,0.018597478,0.000012405384],"about_ca_topic_score_codex":0.0013762638,"about_ca_topic_score_gemma":0.0011228642,"teacher_disagreement_score":0.018250758,"about_ca_system_score_codex":0.0014612699,"about_ca_system_score_gemma":0.00042912806,"threshold_uncertainty_score":0.061054885},"labels":[],"label_agreement":null},{"id":"W4408145330","doi":"10.1109/jmmct.2025.3547827","title":"Optimal Preconditioners for Hybrid Direct-Iterative $\\mathcal {H}$-Matrix Solvers in Boundary Element Methods","year":2025,"lang":"en","type":"article","venue":"IEEE journal on multiscale and multiphysics computational techniques","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Manitoba","funders":"","keywords":"Matrix (chemical analysis); Boundary element method; Applied mathematics; Mathematics; Iterative method; Element (criminal law); Computational science; Finite element method; Boundary (topology); Mathematical optimization; Mathematical analysis; Algebra over a field; Computer science; Pure mathematics; Materials science; Structural engineering; Engineering; Composite material","score_opus":0.014088101881056142,"score_gpt":0.3564224154133228,"score_spread":0.3423343135322667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408145330","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021322262,0.00013748108,0.99563026,0.00008132778,0.00003664172,0.000021482496,0.00001701392,0.00014635317,0.0017972526],"genre_scores_gemma":[0.08987338,0.0003826645,0.9056271,0.00012577666,0.00007552773,0.00026352293,0.00014696579,0.00030894554,0.0031961782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986754,0.0005091172,0.000059191447,0.00011024669,0.00056198874,0.00008399044],"domain_scores_gemma":[0.9988938,0.00061082194,0.00007704488,0.00014269204,0.00022663048,0.000049101636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015728342,0.0007285196,0.00077615277,0.00059634185,0.00054101803,0.0009239831,0.0010682375,0.0013432602,0.0031776028],"category_scores_gemma":[0.0041966345,0.00053290237,0.00067203,0.00048792156,0.0013353952,0.0011892268,0.0017963577,0.0020860774,0.0015000569],"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.00014239177,0.00008672376,0.00057269237,0.00036739346,0.00005456631,0.0001176998,0.00036760408,0.5441572,0.016448643,0.31131467,0.0053399107,0.121030495],"study_design_scores_gemma":[0.000014111648,0.000022976858,0.000057359946,0.00002870412,0.0000047147764,0.000019051244,0.0000184412,0.96289885,0.0036379884,0.027688375,0.0055984575,0.000011065516],"about_ca_topic_score_codex":0.0024770023,"about_ca_topic_score_gemma":0.0025186697,"teacher_disagreement_score":0.0031776028,"about_ca_system_score_codex":0.0006991209,"about_ca_system_score_gemma":0.0013977116,"threshold_uncertainty_score":0.01063019},"labels":[],"label_agreement":null},{"id":"W4408247203","doi":"10.1007/s10589-025-00669-w","title":"The $$\\omega $$-condition number: applications to preconditioning and low rank generalized Jacobian updating","year":2025,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Omega; Jacobian matrix and determinant; Rank (graph theory); Applied mathematics; Combinatorics","score_opus":0.006169767764634903,"score_gpt":0.26954499492120315,"score_spread":0.26337522715656825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408247203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009024049,0.0009861212,0.9680655,0.0019202074,0.0011458074,0.000059605627,0.00015603077,0.00049171643,0.018150885],"genre_scores_gemma":[0.3004705,0.0022048492,0.6497877,0.0013177029,0.001707204,0.00041759186,0.00039199225,0.0013930997,0.04230928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887663,0.00050587754,0.00005170571,0.00015278968,0.00033931088,0.00007370536],"domain_scores_gemma":[0.99342984,0.004190674,0.00041971717,0.000637609,0.0010061719,0.0003160092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035083331,0.0010830851,0.0012311161,0.0012827946,0.0009153033,0.002028854,0.0016126704,0.0020594804,0.017995546],"category_scores_gemma":[0.021031007,0.0004176033,0.00045579617,0.0015694966,0.0034772207,0.00417151,0.0022057856,0.0037549338,0.0025298102],"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.00028641557,0.00015538278,0.00056105264,0.00036355393,0.000028737275,0.00012324232,0.000155285,0.072984815,0.0040653916,0.7285883,0.026696736,0.16599113],"study_design_scores_gemma":[0.000031601692,0.000046293066,0.00021233871,0.000053249463,0.000011447667,0.0000566776,0.000028235925,0.6471805,0.0024122417,0.34200406,0.0079227835,0.000040547086],"about_ca_topic_score_codex":0.001591135,"about_ca_topic_score_gemma":0.0032898227,"teacher_disagreement_score":0.017995546,"about_ca_system_score_codex":0.0008240509,"about_ca_system_score_gemma":0.0016381682,"threshold_uncertainty_score":0.06020105},"labels":[],"label_agreement":null},{"id":"W4408604768","doi":"10.1016/j.aml.2025.109550","title":"On absolute value equations associated with <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si10.svg\" display=\"inline\" id=\"d1e26\"><mml:mi>M</mml:mi></mml:math>-matrices and <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si11.svg\" display=\"inline\" id=\"d1e31\"><mml:mi>H</mml:mi></mml:math>-matrices","year":2025,"lang":"en","type":"article","venue":"Applied Mathematics Letters","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Value (mathematics); Combinatorics; Statistics","score_opus":0.013553019950135322,"score_gpt":0.23691737890701378,"score_spread":0.22336435895687845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408604768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004126274,0.0023718292,0.9180993,0.002458836,0.0014978411,0.000116166455,0.001957688,0.00075221935,0.06861987],"genre_scores_gemma":[0.14349616,0.009734882,0.673601,0.003967234,0.0033898393,0.0008326245,0.010014499,0.0030948385,0.151869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99668115,0.0011841272,0.0003269007,0.00057277654,0.0010565877,0.00017850472],"domain_scores_gemma":[0.9918848,0.0048869113,0.00052713265,0.0007274611,0.0018422188,0.00013148121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038907456,0.0016132463,0.0009877237,0.0025080256,0.0011465499,0.0038933705,0.0015589984,0.0016647031,0.050705757],"category_scores_gemma":[0.02000916,0.0007914233,0.001538407,0.0037860004,0.002140405,0.0071196794,0.002510858,0.005543268,0.023049174],"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.00004454388,0.000034200697,0.00035934348,0.00024656393,0.000023346662,0.00014135323,0.00032245024,0.0054937964,0.0012467403,0.8892672,0.049283836,0.053536613],"study_design_scores_gemma":[0.00002158795,0.00003264278,0.00041471838,0.000119494835,0.00001871138,0.0002422725,0.000080285805,0.03209578,0.0015667325,0.8860799,0.079284176,0.00004364997],"about_ca_topic_score_codex":0.0029526718,"about_ca_topic_score_gemma":0.0049184924,"teacher_disagreement_score":0.050705757,"about_ca_system_score_codex":0.0016947163,"about_ca_system_score_gemma":0.0013693359,"threshold_uncertainty_score":0.16962767},"labels":[],"label_agreement":null},{"id":"W4408702300","doi":"10.1112/blms.70053","title":"Addendum to Herglotz's representation and Carathéodory's approximation","year":2025,"lang":"en","type":"article","venue":"Bulletin of the London Mathematical Society","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Manitoba","funders":"","keywords":"Mathematics; Addendum; Representation (politics)","score_opus":0.01043276421293946,"score_gpt":0.2501719706478207,"score_spread":0.23973920643488125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408702300","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03632843,0.030509388,0.283918,0.09194559,0.14061528,0.000121226294,0.0024342265,0.001486172,0.4126418],"genre_scores_gemma":[0.47925022,0.021284716,0.080991365,0.022365898,0.08816135,0.00051536603,0.003344885,0.0015862398,0.3024999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902356,0.00021351864,0.00004495528,0.00019840137,0.00041113838,0.00010846664],"domain_scores_gemma":[0.99710447,0.0013561554,0.00016982258,0.0004283773,0.0006532372,0.00028788924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016661421,0.0008625935,0.0009876898,0.0017821745,0.0012247856,0.0022461666,0.0018848233,0.0009330986,0.033467337],"category_scores_gemma":[0.007668668,0.00030701543,0.0013525261,0.0017294177,0.0018497751,0.0033725519,0.003971336,0.0046899575,0.009425505],"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.00009817795,0.00004258862,0.00021530391,0.00023393585,0.00003022495,0.00032593738,0.00038206682,0.0010591632,0.0011166284,0.7997342,0.1482508,0.048510894],"study_design_scores_gemma":[0.00002525712,0.000077388126,0.00075810176,0.00009523478,0.00003971737,0.00053306215,0.00010926523,0.0039671585,0.0009094419,0.68912077,0.3043183,0.000046359357],"about_ca_topic_score_codex":0.0013432782,"about_ca_topic_score_gemma":0.0012079979,"teacher_disagreement_score":0.033467337,"about_ca_system_score_codex":0.001554165,"about_ca_system_score_gemma":0.00075621484,"threshold_uncertainty_score":0.11195934},"labels":[],"label_agreement":null},{"id":"W4408962020","doi":"10.1016/j.laa.2025.03.016","title":"The factor width rank of a matrix","year":2025,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canada Foundation for Innovation","keywords":"Mathematics; Rank (graph theory); Matrix (chemical analysis); Factor (programming language); Combinatorics; Computer science; Chemistry","score_opus":0.007874373341858231,"score_gpt":0.26863628444118576,"score_spread":0.2607619110993275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408962020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23155655,0.0016026711,0.7299836,0.0011170728,0.00028600756,0.000118724296,0.0021205547,0.0013035143,0.031911336],"genre_scores_gemma":[0.84841955,0.0013113492,0.13677062,0.00042401877,0.0004925379,0.0001715869,0.0013695955,0.0004735548,0.010567157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980426,0.00036099416,0.00016138962,0.000639177,0.00044691504,0.00034901145],"domain_scores_gemma":[0.9920488,0.0031270483,0.0011418904,0.0019440651,0.0012025852,0.0005354909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012472627,0.0013357028,0.00086261926,0.0013303611,0.0008772259,0.0023190207,0.00096830894,0.00085291034,0.007906581],"category_scores_gemma":[0.008926266,0.00052732864,0.0007254142,0.0013312991,0.0023531981,0.0043578343,0.0015210848,0.0014312889,0.0027997245],"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.0010066995,0.00018904827,0.0056509813,0.00084519165,0.00016829061,0.0007085502,0.0011461438,0.059029624,0.06838376,0.7125718,0.017438788,0.1328611],"study_design_scores_gemma":[0.000057612175,0.00047720916,0.0024274571,0.00017556976,0.00008365974,0.0017028138,0.0004699335,0.15328784,0.02955114,0.78492343,0.026662169,0.00018111376],"about_ca_topic_score_codex":0.0005428005,"about_ca_topic_score_gemma":0.00045981997,"teacher_disagreement_score":0.007906581,"about_ca_system_score_codex":0.00043042106,"about_ca_system_score_gemma":0.0005261144,"threshold_uncertainty_score":0.026450157},"labels":[],"label_agreement":null},{"id":"W4409111540","doi":"10.18280/mmep.120303","title":"Numerical Solutions for Fuzzy Stochastic Ordinary Differential Equations Using Heun’s Method with a Dual-Wiener Process Framework","year":2025,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dual (grammatical number); Wiener process; Ordinary differential equation; Stochastic differential equation; Mathematics; Fuzzy logic; Applied mathematics; Process (computing); Computer science; Mathematical optimization; Differential equation; Mathematical analysis; Artificial intelligence; Philosophy","score_opus":0.0338274997239023,"score_gpt":0.2799847253912033,"score_spread":0.24615722566730097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409111540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042993566,0.00028749654,0.9933295,0.00013530786,0.00006794816,0.000033787725,0.000013811668,0.0000222561,0.001810455],"genre_scores_gemma":[0.36725703,0.0012937227,0.6179109,0.00023899987,0.00019912934,0.00046938314,0.000117802934,0.00009380995,0.012419233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992361,0.0003802909,0.000043700955,0.0000870837,0.00019992315,0.00005297784],"domain_scores_gemma":[0.9987174,0.00076104543,0.000130348,0.00007313304,0.00024458647,0.00007347656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024427695,0.0008902162,0.0012447727,0.0009487488,0.00055429834,0.0011929917,0.0012000358,0.0018333477,0.0018099664],"category_scores_gemma":[0.0040670075,0.00046965896,0.0012117779,0.0007500491,0.0016924887,0.0014757428,0.0019691188,0.0018711862,0.00030586697],"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.000053855936,0.00004651753,0.0005807833,0.00018323673,0.00006331598,0.0001006815,0.00013473562,0.8236444,0.002824954,0.14981507,0.0005151956,0.022037303],"study_design_scores_gemma":[0.0000038234352,0.000011289303,0.000026431791,0.0000072327234,0.000002792149,0.0000077907225,0.0000059165172,0.9924528,0.0001978505,0.0068290103,0.00044937304,0.00000561963],"about_ca_topic_score_codex":0.0043108403,"about_ca_topic_score_gemma":0.0030755233,"teacher_disagreement_score":0.0043108403,"about_ca_system_score_codex":0.0007947451,"about_ca_system_score_gemma":0.0017573418,"threshold_uncertainty_score":0.012918711},"labels":[],"label_agreement":null},{"id":"W4409132075","doi":"10.1109/hpec62836.2024.10938511","title":"Multiplication of Sparse Matrices and their Transpose Using Compressed Sparse Diagonals","year":2024,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Northern British Columbia","funders":"","keywords":"Transpose; Sparse matrix; Diagonal; Multiplication (music); Computer science; Sparse approximation; Parallel computing; Arithmetic; Mathematics; Algorithm; Combinatorics; Physics","score_opus":0.031219142173275708,"score_gpt":0.26727883691654775,"score_spread":0.23605969474327204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409132075","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026228722,0.00018315452,0.9675289,0.00024790922,0.00017258232,0.000091687856,0.00029409616,0.0009794767,0.0042734235],"genre_scores_gemma":[0.21239711,0.00029265805,0.78130066,0.00015739085,0.00015250218,0.00016625974,0.0011440163,0.00015712794,0.004232237],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941945,0.00007253996,0.00003333401,0.0000645553,0.00037351143,0.00003664438],"domain_scores_gemma":[0.99888843,0.0003225072,0.00010657171,0.00030286118,0.00032224494,0.000057462395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039812276,0.0005965826,0.00044582676,0.00069092,0.00041071032,0.00068834267,0.0007942644,0.0005231191,0.0041575623],"category_scores_gemma":[0.0028755849,0.00019601642,0.0003849183,0.0012788343,0.0006063704,0.0013609942,0.0011478493,0.0009440868,0.0012109055],"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.00040590213,0.00022555582,0.0018799466,0.00033843864,0.00008479981,0.00064869015,0.0004372912,0.22450979,0.06204148,0.1549265,0.020638887,0.5338627],"study_design_scores_gemma":[0.00004527949,0.00015677384,0.00029229466,0.00001970269,0.000009482076,0.00029864092,0.00005959198,0.94859546,0.024004195,0.016343446,0.01015021,0.00002498833],"about_ca_topic_score_codex":0.0025026249,"about_ca_topic_score_gemma":0.0036976824,"teacher_disagreement_score":0.0041575623,"about_ca_system_score_codex":0.00033285993,"about_ca_system_score_gemma":0.0008860383,"threshold_uncertainty_score":0.013908446},"labels":[],"label_agreement":null},{"id":"W4409365459","doi":"10.1609/aaai.v39i13.33506","title":"Last-iterate Convergence in Regularized Graphon Mean Field Game","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canadian Institute for Advanced Research","keywords":"Convergence (economics); Field (mathematics); Mean field theory; Mathematical economics; Mathematics; Economics; Physics; Pure mathematics","score_opus":0.02990100604921609,"score_gpt":0.27764924909161637,"score_spread":0.24774824304240028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409365459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1089084,0.0005052303,0.8800629,0.0010793809,0.00009488759,0.0001675798,0.0002015777,0.0005256144,0.0084544495],"genre_scores_gemma":[0.83018637,0.00046249386,0.16113007,0.00056531746,0.00006268642,0.00040847727,0.00030510363,0.00026038836,0.0066191126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986504,0.00072996056,0.00004377667,0.0002107833,0.00016324726,0.00020189397],"domain_scores_gemma":[0.98948216,0.008495442,0.0005495086,0.00041113925,0.00053335686,0.000528331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037707498,0.0016352673,0.002007904,0.0009364059,0.000998507,0.0010719723,0.0019688827,0.002200469,0.0034566002],"category_scores_gemma":[0.017241873,0.00059301563,0.001246245,0.0004311483,0.0023481,0.0022191785,0.0017142743,0.0024269603,0.000520966],"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.00034694673,0.00017731362,0.0023374448,0.00022262603,0.00010634277,0.00027632373,0.00033833232,0.7847173,0.0025309273,0.18511063,0.004288564,0.019547207],"study_design_scores_gemma":[0.000019031158,0.000039644074,0.00009389888,0.000013506366,0.000007837696,0.000028770717,0.000020693049,0.947843,0.00029122923,0.051320493,0.00031114067,0.000010652722],"about_ca_topic_score_codex":0.0057125986,"about_ca_topic_score_gemma":0.0049436726,"teacher_disagreement_score":0.0057125986,"about_ca_system_score_codex":0.0019616615,"about_ca_system_score_gemma":0.002061923,"threshold_uncertainty_score":0.019941866},"labels":[],"label_agreement":null},{"id":"W4409754254","doi":"10.1016/j.dam.2025.04.031","title":"Edge addition and the change in Kemeny’s constant","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","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":"Université de Montréal; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Constant (computer programming); Enhanced Data Rates for GSM Evolution; Combinatorics; Discrete mathematics; Artificial intelligence; Computer science","score_opus":0.013388564479732447,"score_gpt":0.2501760721015539,"score_spread":0.23678750762182146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409754254","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45222932,0.008548232,0.1819397,0.014499199,0.003372385,0.000081173355,0.00062752113,0.00075612863,0.33794641],"genre_scores_gemma":[0.91638446,0.002496157,0.02284754,0.0012783577,0.0010678609,0.00005709566,0.00014308117,0.00033241743,0.055392977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991528,0.00017189288,0.000036467663,0.00023869652,0.0001917461,0.00020836484],"domain_scores_gemma":[0.9956904,0.00243282,0.00036689127,0.00046782807,0.00051052094,0.00053153204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014082273,0.0006407535,0.00074295833,0.0027294126,0.0017581525,0.0026663293,0.0019495377,0.0017088848,0.015182923],"category_scores_gemma":[0.011704191,0.00039237697,0.0005604081,0.0020947205,0.0038672355,0.00767768,0.0024110565,0.003643947,0.0016164936],"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.0001789696,0.000030171153,0.0002767189,0.00006216359,0.000012218111,0.000119824836,0.00018210654,0.002041422,0.0016906239,0.97460407,0.0038642231,0.016937556],"study_design_scores_gemma":[0.000028727416,0.000026502164,0.00054509466,0.000024236308,0.000016047508,0.00024288913,0.00009380523,0.0069297445,0.0017558682,0.9816016,0.008707317,0.000028264702],"about_ca_topic_score_codex":0.001238786,"about_ca_topic_score_gemma":0.0009484812,"teacher_disagreement_score":0.015182923,"about_ca_system_score_codex":0.0013769121,"about_ca_system_score_gemma":0.00080353476,"threshold_uncertainty_score":0.05079192},"labels":[],"label_agreement":null},{"id":"W4410527772","doi":"10.23952/jnva.9.2025.5.02","title":"Social optima in linear quadratic graphon field control: Analysis via infinite dimensional approach","year":2025,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Chongqing Municipal Education Commission; Chongqing Technology and Business University; National Natural Science Foundation of China","keywords":"Quadratic equation; Field (mathematics); Mathematics; Control (management); Applied mathematics; Mathematical economics; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.007814135090410094,"score_gpt":0.26558557837371544,"score_spread":0.25777144328330537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410527772","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10335394,0.0008165816,0.8734103,0.0017812782,0.00009600752,0.00006971838,0.000108678985,0.000109303466,0.020254212],"genre_scores_gemma":[0.96886843,0.00056266907,0.018488547,0.00027164601,0.000087878725,0.00020683916,0.00009505038,0.00005432868,0.011364543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992968,0.00033376217,0.00002038669,0.00012501779,0.00013548606,0.00008860709],"domain_scores_gemma":[0.997743,0.0012545777,0.00043779396,0.00006783502,0.000314373,0.0001823965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020521318,0.000996611,0.0010696555,0.001027852,0.00062832364,0.0013963764,0.0010954202,0.0016710066,0.0023408227],"category_scores_gemma":[0.0050136843,0.00043879452,0.0008204248,0.00047126086,0.0028006795,0.001726284,0.0017430874,0.0011767274,0.00016715711],"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.00003336935,0.000045703717,0.00056061405,0.000090752554,0.00005420292,0.00010778181,0.00011498255,0.7735845,0.0009013601,0.22024573,0.0011103282,0.0031506198],"study_design_scores_gemma":[0.0000041262797,0.000014714393,0.00012738869,0.000005936767,0.0000039000975,0.000008033057,0.0000217745,0.9748619,0.000044280278,0.024706932,0.00019379343,0.000007252863],"about_ca_topic_score_codex":0.008175686,"about_ca_topic_score_gemma":0.0038656672,"teacher_disagreement_score":0.008175686,"about_ca_system_score_codex":0.0019427708,"about_ca_system_score_gemma":0.0012670796,"threshold_uncertainty_score":0.016256154},"labels":[],"label_agreement":null},{"id":"W4410605955","doi":"10.1137/24m1683184","title":"Improving the Stability and Efficiency of Operator-Splitting Methods","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"NOAA Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Operator splitting; Stability (learning theory); Operator (biology); Applied mathematics; Calculus (dental); Algebra over a field; Pure mathematics; Computer science","score_opus":0.019955287636420693,"score_gpt":0.32065633610611377,"score_spread":0.3007010484696931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410605955","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10873521,0.0005343475,0.88087845,0.00056169217,0.00026554218,0.00008924746,0.0000853844,0.0009716511,0.007878401],"genre_scores_gemma":[0.63839394,0.00033524138,0.35480714,0.00021914809,0.00020365247,0.00014136855,0.00016799751,0.0007293798,0.005002161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983606,0.00074832916,0.000073570685,0.00013533706,0.00057232793,0.0001098672],"domain_scores_gemma":[0.98915905,0.006861793,0.00037279056,0.0014340162,0.0018546854,0.00031768545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029849256,0.000985478,0.00081493414,0.0010699435,0.0006946599,0.0010248803,0.0015739482,0.0012885309,0.004789927],"category_scores_gemma":[0.017609982,0.00041093412,0.00058353983,0.0007606706,0.0011540201,0.0018329576,0.00260766,0.0015641848,0.0013198421],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021135763,0.0005181196,0.0035135348,0.00041334995,0.00019075185,0.00026535123,0.0006917798,0.47911477,0.06962245,0.11501539,0.00820297,0.32033795],"study_design_scores_gemma":[0.000036918937,0.000048496226,0.00011845897,0.000008533194,0.000007367166,0.000022726947,0.000019622894,0.9786629,0.0043559386,0.016181465,0.000530372,0.000007192279],"about_ca_topic_score_codex":0.0016145179,"about_ca_topic_score_gemma":0.001632217,"teacher_disagreement_score":0.004789927,"about_ca_system_score_codex":0.00044823333,"about_ca_system_score_gemma":0.0010744691,"threshold_uncertainty_score":0.016023874},"labels":[],"label_agreement":null},{"id":"W4410619980","doi":"10.13001/ela.2025.9483","title":"A note on Lidskii's theorem for the directional derivatives of the eigenvalues of symmetric matrices","year":2025,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Eigenvalues and eigenvectors; Pure mathematics; Symmetric matrix; Mathematical analysis; Combinatorics; Physics","score_opus":0.007641676673642443,"score_gpt":0.26505283448327194,"score_spread":0.2574111578096295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410619980","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03231828,0.0030630883,0.8520435,0.004444916,0.0025546825,0.0000901755,0.00038778875,0.00041388223,0.10468366],"genre_scores_gemma":[0.69329596,0.005149052,0.2488374,0.0058503672,0.0025929227,0.000281098,0.0003940462,0.00070181384,0.04289737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989471,0.00023050891,0.00006761868,0.00024526293,0.0004058317,0.0001037036],"domain_scores_gemma":[0.9980234,0.0009904039,0.0001680494,0.00030947183,0.00035093297,0.0001577775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027103685,0.0007658012,0.00079262553,0.0015261663,0.0015802807,0.0019817594,0.001643983,0.0010917182,0.0054152096],"category_scores_gemma":[0.0056417054,0.00041124725,0.0011589637,0.0011051918,0.0042890306,0.004545516,0.0029476408,0.0034705603,0.0014895579],"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.000019555995,0.000011078122,0.00024737476,0.00004921227,0.0000069643456,0.00016912841,0.0002030021,0.0013416653,0.001731784,0.98288417,0.004008608,0.009327389],"study_design_scores_gemma":[0.000014524814,0.000050868945,0.00032837447,0.000032625063,0.000009348708,0.00026057457,0.00005675653,0.010145019,0.0018426104,0.9656961,0.021524467,0.000038719834],"about_ca_topic_score_codex":0.0010726888,"about_ca_topic_score_gemma":0.0007203556,"teacher_disagreement_score":0.0054152096,"about_ca_system_score_codex":0.0010055351,"about_ca_system_score_gemma":0.0006804298,"threshold_uncertainty_score":0.01811564},"labels":[],"label_agreement":null},{"id":"W4410630035","doi":"10.1016/j.laa.2025.05.016","title":"Decomposable numerical ranges of normal matrices","year":2025,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"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":"University of Waterloo; Hong Kong Polytechnic University; Simons Foundation","keywords":"Mathematics; Normal matrix; Pure mathematics; Combinatorics; Applied mathematics; Eigenvalues and eigenvectors","score_opus":0.006489717413644439,"score_gpt":0.2545089268062068,"score_spread":0.24801920939256236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410630035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21498665,0.00072293007,0.74106807,0.00065120443,0.00017822093,0.000056897294,0.00049407233,0.00091291714,0.040929005],"genre_scores_gemma":[0.8595781,0.00055969815,0.12800212,0.00021174604,0.00028875723,0.000096568474,0.0008114199,0.00030119068,0.010150466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735165,0.00068836747,0.00019809634,0.00052217575,0.0009865421,0.00025312538],"domain_scores_gemma":[0.99213153,0.004012476,0.00082612946,0.001055833,0.0013319588,0.0006420372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014926346,0.0007946721,0.0006052929,0.001943494,0.00062516704,0.003268819,0.0011808769,0.00051921007,0.0059205387],"category_scores_gemma":[0.01266867,0.00047680893,0.00052758097,0.0014569036,0.0027027284,0.006060049,0.0026868058,0.0022751505,0.0013116859],"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.00020376021,0.000089258596,0.000936249,0.00010382944,0.000015720903,0.0002904591,0.0006118837,0.006462829,0.007778832,0.92390996,0.0017654522,0.057831865],"study_design_scores_gemma":[0.000013218092,0.00004829572,0.00023465206,0.000024694977,0.000006693635,0.0003037727,0.000120002835,0.021443332,0.004231908,0.97060126,0.00295351,0.000018632003],"about_ca_topic_score_codex":0.00025993426,"about_ca_topic_score_gemma":0.00029075707,"teacher_disagreement_score":0.0059205387,"about_ca_system_score_codex":0.00052789686,"about_ca_system_score_gemma":0.00041827164,"threshold_uncertainty_score":0.019806147},"labels":[],"label_agreement":null},{"id":"W4410771451","doi":"10.1109/spi64682.2025.11014300","title":"High Order Polynomial Projection Operators for Circuit Macro-Modeling","year":2025,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Macro; Polynomial; Order (exchange); Projection (relational algebra); Computer science; Mathematical optimization; Applied mathematics; Mathematics; Algorithm; Mathematical analysis; Programming language","score_opus":0.014769648878002556,"score_gpt":0.25959831425123964,"score_spread":0.24482866537323708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410771451","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005808959,0.00015810442,0.9881421,0.00011272596,0.00003773669,0.000016772647,0.00006720225,0.0002716956,0.0053847455],"genre_scores_gemma":[0.6204379,0.0010986212,0.3559595,0.0002566646,0.00015261349,0.00013518434,0.00028022283,0.0005049252,0.02117434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981886,0.000058387184,0.000006011941,0.000026789714,0.000069730726,0.000020323923],"domain_scores_gemma":[0.9996723,0.00011884381,0.000023258048,0.00009116687,0.00006680032,0.000027670236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035037394,0.00060645764,0.00042963275,0.00037553327,0.00032494168,0.0008003367,0.0006766543,0.0004830629,0.0054118177],"category_scores_gemma":[0.0011889102,0.00024318855,0.000370669,0.0005941245,0.000560741,0.0012188079,0.00071790663,0.0014011654,0.0012724155],"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.000044801283,0.000045128814,0.00017573294,0.00009394223,0.00001812075,0.000066830726,0.0000777776,0.14818682,0.0070699924,0.78747135,0.003927656,0.052821852],"study_design_scores_gemma":[0.0000039862894,0.000011589932,0.00005068878,0.000007623135,0.000004203869,0.000028324406,0.000014078573,0.7230024,0.0014231865,0.27181518,0.0036313273,0.0000074467293],"about_ca_topic_score_codex":0.0012389483,"about_ca_topic_score_gemma":0.0019090535,"teacher_disagreement_score":0.0054118177,"about_ca_system_score_codex":0.00047832803,"about_ca_system_score_gemma":0.00052951585,"threshold_uncertainty_score":0.018104315},"labels":[],"label_agreement":null},{"id":"W4410852494","doi":"10.1103/msvx-1drx","title":"Enhancing the Harrow-Hassidim-Lloyd (HHL) algorithm in systems with large condition numbers","year":2025,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Japan Society for the Promotion of Science; Ministry of Education, Culture, Sports, Science and Technology; Japan Science and Technology Agency; Ministry of Electronics and Information technology; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Harrow; Computer science; Algorithm; Biology; Agronomy","score_opus":0.026063048973908126,"score_gpt":0.3965507411548635,"score_spread":0.37048769218095534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410852494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021786626,0.0004821948,0.9563073,0.0015715304,0.00021129854,0.00017862233,0.00010243272,0.0026441957,0.016715849],"genre_scores_gemma":[0.16207153,0.00038845986,0.82527465,0.00069122127,0.00012881444,0.0003626086,0.00025045432,0.00089398224,0.0099383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989071,0.00036797475,0.000060777445,0.00014859645,0.00036344986,0.00015215497],"domain_scores_gemma":[0.99781704,0.0011100183,0.0001230486,0.0004877441,0.0003152896,0.00014689256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00258738,0.000855491,0.001425165,0.001025128,0.0016109139,0.0017837121,0.0025286158,0.0018817406,0.013669354],"category_scores_gemma":[0.007228023,0.0006265088,0.00091054436,0.0009159554,0.001694885,0.004372067,0.0034781497,0.0031034374,0.0047634826],"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.00043157284,0.00047547978,0.001422303,0.0005881633,0.00007053139,0.00028483346,0.000502469,0.21861874,0.010095517,0.44709647,0.028956585,0.29145738],"study_design_scores_gemma":[0.00006488743,0.000044325745,0.00007273017,0.000023190314,0.000006982871,0.000034078646,0.000030467516,0.9013447,0.0034771808,0.08912919,0.005747787,0.00002440383],"about_ca_topic_score_codex":0.004468819,"about_ca_topic_score_gemma":0.008036429,"teacher_disagreement_score":0.013669354,"about_ca_system_score_codex":0.0015886697,"about_ca_system_score_gemma":0.003327975,"threshold_uncertainty_score":0.045728505},"labels":[],"label_agreement":null},{"id":"W4412325057","doi":"","title":"Anden halvdel af Hilberts 16. problem:Et gammelt uløst problem","year":2013,"lang":"da","type":"article","venue":"Aarhus Universitetsforlag eBooks","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science","score_opus":0.009763431816688529,"score_gpt":0.20322200075150418,"score_spread":0.19345856893481564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412325057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14393853,0.011463488,0.3678604,0.10268954,0.0036447968,0.00029908674,0.0063448558,0.0007119987,0.3630474],"genre_scores_gemma":[0.6091453,0.005264688,0.14220507,0.004503973,0.0018258311,0.0004705038,0.007347641,0.00062743825,0.22860955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998662,0.00046910907,0.000060657916,0.00033352026,0.0002583675,0.00021627247],"domain_scores_gemma":[0.998548,0.0009827331,0.000079010315,0.000103084654,0.00014587987,0.00014121157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001508185,0.0007638489,0.0008835976,0.0006126346,0.0011152395,0.0027971752,0.001115095,0.002550939,0.036271624],"category_scores_gemma":[0.006129061,0.00036984606,0.0006932043,0.0009727839,0.002262413,0.0056105233,0.0032628276,0.0043540704,0.0046362686],"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.00067404564,0.0001914477,0.0006957785,0.0010139886,0.000062137435,0.00036229947,0.0005152357,0.015332009,0.00201983,0.74924695,0.13479081,0.09509555],"study_design_scores_gemma":[0.00012533797,0.00008696418,0.0004897148,0.00019284464,0.000017846656,0.00039056496,0.0004789041,0.021648714,0.0018346458,0.9123701,0.062320888,0.0000434207],"about_ca_topic_score_codex":0.0021998032,"about_ca_topic_score_gemma":0.0014425932,"teacher_disagreement_score":0.036271624,"about_ca_system_score_codex":0.0014366447,"about_ca_system_score_gemma":0.001777629,"threshold_uncertainty_score":0.12134069},"labels":[],"label_agreement":null},{"id":"W4412673767","doi":"10.1145/3731179","title":"Adaptive Algebraic Reuse of Reordering in Cholesky Factorizations with Dynamic Sparsity Patterns","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Toronto","funders":"","keywords":"Cholesky decomposition; Algebraic number; Computer science; Reuse; Theoretical computer science; Parallel computing; Mathematical optimization; Algorithm; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.011051036736889244,"score_gpt":0.23778325178510137,"score_spread":0.22673221504821212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412673767","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09274236,0.0003398527,0.8900823,0.00036865374,0.00016994441,0.00014255139,0.00043915783,0.0068690935,0.008846071],"genre_scores_gemma":[0.40445498,0.00024265934,0.58713526,0.00029040294,0.00011840983,0.00020672685,0.0010675621,0.0016999724,0.0047840304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928683,0.00015632613,0.00005107747,0.000077983656,0.0003203853,0.00010729822],"domain_scores_gemma":[0.9981499,0.000497476,0.00015432746,0.00072700746,0.00033513876,0.00013620079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007493696,0.00084464886,0.00075791817,0.0006386236,0.0006044141,0.0009761564,0.0010590713,0.0005318234,0.005198176],"category_scores_gemma":[0.0042018406,0.00039622642,0.0006008733,0.00082419073,0.0007864974,0.0013913866,0.0016690389,0.0010599565,0.0017561587],"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.0007120508,0.00039873962,0.0055557108,0.00047038554,0.0001519922,0.0005742853,0.0007469181,0.4637902,0.08685514,0.058509953,0.018195944,0.36403865],"study_design_scores_gemma":[0.00010214456,0.00018743414,0.0005315298,0.000026079384,0.000016918211,0.000110388886,0.00008224297,0.9457718,0.026350876,0.015064174,0.011708776,0.000047688183],"about_ca_topic_score_codex":0.0033345704,"about_ca_topic_score_gemma":0.00809844,"teacher_disagreement_score":0.005198176,"about_ca_system_score_codex":0.00036746674,"about_ca_system_score_gemma":0.0017230813,"threshold_uncertainty_score":0.017389655},"labels":[],"label_agreement":null},{"id":"W4412767614","doi":"10.23952/jano.7.2025.2.07","title":"Inertial four-operator splitting algorithms for solving monotone inclusion problems","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Operator splitting; Monotone polygon; Inclusion (mineral); Algorithm; Operator (biology); Inertial frame of reference; Mathematics; Pseudo-monotone operator; Computer science; Algebra over a field; Mathematical optimization; Applied mathematics; Discrete mathematics; Pure mathematics; Physics; Finite-rank operator; Geometry; Classical mechanics; Banach space","score_opus":0.010461112262936785,"score_gpt":0.2437397940667266,"score_spread":0.23327868180378983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412767614","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020458564,0.00016790225,0.9736511,0.00016431951,0.00011431347,0.000066071036,0.00003263668,0.00022307143,0.005122131],"genre_scores_gemma":[0.34148833,0.00024284325,0.65022296,0.00020689337,0.000111063884,0.0003921394,0.00016594965,0.00032695537,0.006842924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995776,0.00014971971,0.000028412362,0.000039879604,0.0001499758,0.000054485314],"domain_scores_gemma":[0.9986652,0.00067514856,0.00009062691,0.00015792415,0.00027032575,0.00014076385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001537218,0.0008824087,0.0009423888,0.0008690171,0.00073966,0.0008666707,0.0018368965,0.0012274191,0.005320385],"category_scores_gemma":[0.0036907273,0.0004559635,0.00074540894,0.00075881643,0.0011868695,0.001623174,0.0027049684,0.0022650268,0.00074514234],"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.0006673235,0.0003765636,0.0011309402,0.0003043635,0.00010954917,0.00017542405,0.00064542633,0.47371036,0.0138272345,0.2670705,0.004691403,0.23729084],"study_design_scores_gemma":[0.00002939852,0.000059434176,0.00006986668,0.000010296071,0.000006039797,0.000012893542,0.000031555865,0.9661632,0.0008513537,0.031706993,0.0010511151,0.000007906402],"about_ca_topic_score_codex":0.0021309815,"about_ca_topic_score_gemma":0.0026488702,"teacher_disagreement_score":0.005320385,"about_ca_system_score_codex":0.00059038785,"about_ca_system_score_gemma":0.0011456454,"threshold_uncertainty_score":0.017798483},"labels":[],"label_agreement":null},{"id":"W4412819531","doi":"10.1007/978-3-031-89033-8_33","title":"Linear Algebra and FFTW","year":2025,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Algebra over a field; Mathematics; Pure mathematics","score_opus":0.01632804701686245,"score_gpt":0.24153641279311472,"score_spread":0.22520836577625228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412819531","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002685407,0.012966346,0.36302334,0.0022661234,0.0033633085,0.00007503049,0.0015853643,0.005987615,0.6080474],"genre_scores_gemma":[0.04447653,0.010507412,0.1740177,0.0018236862,0.0033013588,0.00029108103,0.0032690843,0.0050661042,0.757247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910396,0.000119025935,0.00003594946,0.0001479228,0.00052121835,0.000071838906],"domain_scores_gemma":[0.99961567,0.00010540638,0.000020788077,0.00012009728,0.00011526908,0.000022889313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042986422,0.0013713745,0.0012651942,0.0016281588,0.0011084793,0.0037180737,0.0013698811,0.0007517687,0.13047479],"category_scores_gemma":[0.0015520281,0.00058219675,0.00085609395,0.0036649636,0.0013100591,0.0032246613,0.0016209927,0.003181862,0.08856751],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032824588,0.000041567953,0.00007586041,0.00029481784,0.000022378295,0.000062955885,0.00016486557,0.0012238252,0.0025037874,0.413449,0.20151109,0.38061705],"study_design_scores_gemma":[0.000012905278,0.00002725752,0.0002581132,0.000104212006,0.0000132668465,0.0002685215,0.0000638462,0.0058685206,0.003155602,0.4741832,0.51601684,0.00002776813],"about_ca_topic_score_codex":0.001063005,"about_ca_topic_score_gemma":0.0014102559,"teacher_disagreement_score":0.13047479,"about_ca_system_score_codex":0.0007944461,"about_ca_system_score_gemma":0.0007718385,"threshold_uncertainty_score":0.43648165},"labels":[],"label_agreement":null},{"id":"W4413186436","doi":"10.55016/ojs/cdm.v7i1.62080","title":"Decoding generalised hyperoctahedral groups and asymptotic analysis of correctible error patterns","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":true,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; GCHQ; Government of the United Kingdom; University of Regina","keywords":"Mathematics; Decoding methods; Combinatorics; Statistics","score_opus":0.01720815216040471,"score_gpt":0.2905550909592932,"score_spread":0.2733469387988885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48250157,0.0002979195,0.49843457,0.00079260085,0.000057167104,0.00008764072,0.0001501864,0.0004213946,0.017256884],"genre_scores_gemma":[0.90077,0.0002144493,0.09380706,0.00013370508,0.00004362989,0.00011170839,0.00013845414,0.000087972054,0.0046930066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983494,0.00039761633,0.00010819289,0.00015415486,0.00070456567,0.00028603664],"domain_scores_gemma":[0.993381,0.0035904313,0.0007139826,0.0012382412,0.00090253144,0.00017385445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014002909,0.00049156795,0.0005962373,0.0010093921,0.0006427722,0.0014306137,0.0010872487,0.0010714128,0.0026107845],"category_scores_gemma":[0.011909511,0.00025641682,0.00047547618,0.00075278303,0.00215477,0.0024428312,0.0018510944,0.0011734193,0.0005070869],"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.00055223407,0.000079224024,0.0032660817,0.00019000162,0.000049659368,0.00041634616,0.00049950794,0.16649278,0.028239,0.744939,0.001261039,0.05401516],"study_design_scores_gemma":[0.00004730335,0.00009314588,0.0004585312,0.00003857545,0.000018921095,0.00032695045,0.00008561561,0.6110638,0.027781729,0.35875183,0.0012841662,0.000049524017],"about_ca_topic_score_codex":0.0010031512,"about_ca_topic_score_gemma":0.0013351471,"teacher_disagreement_score":0.0026107845,"about_ca_system_score_codex":0.0011606512,"about_ca_system_score_gemma":0.0010118542,"threshold_uncertainty_score":0.008733928},"labels":[],"label_agreement":null},{"id":"W4413389464","doi":"10.1016/j.laa.2025.08.012","title":"On the local and global minimizers of the smooth stress function in Euclidean distance matrix problems","year":2025,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa e Inovação do Estado de Santa Catarina; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Academic Excellence Foundation of BUAA for PHD Students; Beihang University; Fundação de Amparo à Pesquisa do Estado de São Paulo; Agence Nationale de la Recherche","keywords":"Mathematics; Euclidean distance matrix; Matrix (chemical analysis); Euclidean geometry; Euclidean distance; Function (biology); Matrix function; Pure mathematics; Geometry; Symmetric matrix; Eigenvalues and eigenvectors","score_opus":0.0062305903836470476,"score_gpt":0.23573577652901864,"score_spread":0.2295051861453716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413389464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41350052,0.0054382365,0.54149693,0.0051028775,0.0003352185,0.00013833144,0.00025286395,0.00018230667,0.03355267],"genre_scores_gemma":[0.9064809,0.0031855523,0.06757,0.00048092788,0.0005173853,0.00029688902,0.00034922175,0.0003470792,0.020771965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992449,0.00042337787,0.000025442847,0.00011905375,0.000118603726,0.00006855034],"domain_scores_gemma":[0.9943006,0.0037559485,0.0006006924,0.0001687418,0.0005179224,0.0006560149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003055656,0.0015282801,0.0015140616,0.0013649344,0.0011301113,0.0026783617,0.0014664179,0.0021514897,0.0034974308],"category_scores_gemma":[0.013774297,0.0008854501,0.000618246,0.0010315975,0.0041464013,0.0038698653,0.0029951504,0.002240202,0.00046403718],"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.00030058125,0.00019586913,0.001498734,0.00044891686,0.00009574053,0.00025664488,0.0006409361,0.15917331,0.00516092,0.8023413,0.005659714,0.02422738],"study_design_scores_gemma":[0.000045511915,0.00016005426,0.0012805783,0.00009044886,0.000027707363,0.00009886862,0.00038636973,0.39205486,0.0006745113,0.6037285,0.0013994111,0.000053182284],"about_ca_topic_score_codex":0.0016407977,"about_ca_topic_score_gemma":0.0019303812,"teacher_disagreement_score":0.0034974308,"about_ca_system_score_codex":0.0009776829,"about_ca_system_score_gemma":0.000937742,"threshold_uncertainty_score":0.01616007},"labels":[],"label_agreement":null},{"id":"W4413389602","doi":"10.1134/s0965542525700605","title":"K-Optimal Preconditioners Based on Approximation of Inverse Matrices","year":2025,"lang":"en","type":"article","venue":"Computational Mathematics and Mathematical Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Mathematics; Inverse; Applied mathematics; Mathematical optimization; Geometry","score_opus":0.012754882874000553,"score_gpt":0.25438731458476754,"score_spread":0.24163243171076698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413389602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010155506,0.0000947056,0.98706365,0.000062542815,0.000038167935,0.000023982348,0.00002028101,0.00018712052,0.0023540792],"genre_scores_gemma":[0.22851093,0.00029790186,0.76696604,0.00009400953,0.000054933986,0.0001590711,0.00014153152,0.00019289834,0.0035827013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959666,0.00015486512,0.000017264356,0.00005354395,0.00012644521,0.000051258514],"domain_scores_gemma":[0.99934596,0.00033069288,0.000073915944,0.00009794373,0.00011048433,0.000041084157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005889443,0.00066198566,0.0008221317,0.0005014326,0.0004345601,0.0006147666,0.0006259582,0.0009824885,0.0020205528],"category_scores_gemma":[0.0024827218,0.00035602515,0.0004960499,0.00043772458,0.0013472595,0.000881198,0.0008389182,0.0012278897,0.00066508754],"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.00018410568,0.00007353528,0.0005924291,0.00021681782,0.00004661544,0.00015717806,0.00021906816,0.6572942,0.028674252,0.22928242,0.003556748,0.079702675],"study_design_scores_gemma":[0.000008826719,0.000023777658,0.000051088038,0.000008271093,0.0000033358692,0.000020191736,0.000011774242,0.9789761,0.0034936583,0.015979536,0.0014155398,0.000007826711],"about_ca_topic_score_codex":0.0016833481,"about_ca_topic_score_gemma":0.002331678,"teacher_disagreement_score":0.0020205528,"about_ca_system_score_codex":0.00048069409,"about_ca_system_score_gemma":0.0011448598,"threshold_uncertainty_score":0.0067594647},"labels":[],"label_agreement":null},{"id":"W4413552374","doi":"10.36227/techrxiv.175615666.60317197/v1","title":"Tensor Train Accelerated Method of Moment Solution of Volume Integral Equations for Arbitrary Objects with Logarithmic Complexity","year":2025,"lang":"en","type":"preprint","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Manitoba","funders":"","keywords":"Logarithm; Moment tensor; Tensor (intrinsic definition); Volume (thermodynamics); Moment (physics); Mathematics; Mathematical analysis; Volume integral; Applied mathematics; Integral equation; Geometry; Physics; Classical mechanics; Magnitude (astronomy)","score_opus":0.07897954772572777,"score_gpt":0.33150290467986293,"score_spread":0.2525233569541352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413552374","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008657537,0.0001204778,0.98517644,0.00013518015,0.00004515652,0.000038276026,0.000063233434,0.00051976246,0.005244031],"genre_scores_gemma":[0.18421021,0.00037268866,0.8048357,0.000101038364,0.00008554301,0.00027345505,0.00033694974,0.0005282153,0.009256271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99971527,0.00006923179,0.000011212385,0.000018083374,0.0001588781,0.000027328291],"domain_scores_gemma":[0.999401,0.0002591655,0.000047907524,0.00011465083,0.00014643592,0.000030923726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004200776,0.00063204987,0.00054727844,0.00042096007,0.00036825964,0.0008182107,0.0010534734,0.0006121064,0.0047172764],"category_scores_gemma":[0.0014882626,0.00019639356,0.0006039215,0.00050266983,0.00053093594,0.0008508089,0.00090842304,0.0011132419,0.0015203665],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021970762,0.00010934771,0.001141486,0.00036840857,0.00006617667,0.00038548748,0.0003390458,0.5469147,0.023776857,0.2502769,0.007949311,0.16845253],"study_design_scores_gemma":[0.0000065205973,0.0000116132505,0.00005477977,0.0000043701716,0.0000025914223,0.000027012615,0.000015024536,0.9882569,0.0012313554,0.007977204,0.0024085143,0.000004085567],"about_ca_topic_score_codex":0.0022954359,"about_ca_topic_score_gemma":0.0030656063,"teacher_disagreement_score":0.0047172764,"about_ca_system_score_codex":0.00054964155,"about_ca_system_score_gemma":0.0008818666,"threshold_uncertainty_score":0.015780926},"labels":[],"label_agreement":null},{"id":"W4413941646","doi":"10.2139/ssrn.5412929","title":"Opening the Black Box of Local Projections","year":2025,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Black box; Geography; Computer science; Artificial intelligence","score_opus":0.0060383206118801705,"score_gpt":0.2481124201012304,"score_spread":0.24207409948935024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413941646","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04903663,0.002573567,0.8044903,0.008990148,0.0010409035,0.000072794224,0.0003533955,0.0016139428,0.13182825],"genre_scores_gemma":[0.73703074,0.0024300832,0.19263393,0.0038322818,0.0016634691,0.00036901646,0.00049919303,0.0020605593,0.059480745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99714977,0.0012771757,0.00008240056,0.00059631513,0.0005947655,0.00029950644],"domain_scores_gemma":[0.99368393,0.0031127615,0.00028500363,0.0018135908,0.0005879557,0.0005168055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028852772,0.00077351613,0.0018414467,0.0010103009,0.0027416602,0.0050700284,0.002068587,0.002379236,0.025008574],"category_scores_gemma":[0.013313229,0.0008273823,0.0009908539,0.0010019668,0.007381866,0.013593879,0.010109866,0.0063587995,0.0055352147],"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.00005450562,0.000013454931,0.00007223659,0.000049490067,0.000009737368,0.000029749384,0.00011368129,0.0012575275,0.00032949654,0.98441076,0.0037350135,0.009924334],"study_design_scores_gemma":[0.000011673872,0.000011522626,0.000025243618,0.00002025449,0.000003934579,0.000031313863,0.00003430134,0.0068580965,0.00024888242,0.9893727,0.0033731568,0.000008949967],"about_ca_topic_score_codex":0.00048738022,"about_ca_topic_score_gemma":0.0004848666,"teacher_disagreement_score":0.025008574,"about_ca_system_score_codex":0.00082138815,"about_ca_system_score_gemma":0.0010633492,"threshold_uncertainty_score":0.08366209},"labels":[],"label_agreement":null},{"id":"W4413992645","doi":"10.1137/23m1587919","title":"On the Bredies–Chenchene–Lorenz–Naldi Algorithm: Linear Relations and Strong Convergence","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia, Okanagan Campus","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Convergence (economics); Applied mathematics; Algorithm; Mathematical optimization","score_opus":0.009435308930310997,"score_gpt":0.24150252159109312,"score_spread":0.23206721266078212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413992645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012576563,0.0020784514,0.9665445,0.0014315291,0.00029567964,0.00010976285,0.00008729719,0.00018397304,0.016692236],"genre_scores_gemma":[0.35676512,0.003052748,0.5981234,0.0010906921,0.00060895213,0.000686735,0.0004446666,0.00058227056,0.03864554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987191,0.00066127634,0.000053431064,0.00017749956,0.0002834069,0.0001053686],"domain_scores_gemma":[0.99658394,0.0023335288,0.00013356052,0.00021944432,0.0005880812,0.0001414784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004029968,0.0013524436,0.0012161203,0.0015949331,0.0011917101,0.0018153943,0.0027535902,0.0027461734,0.0064813574],"category_scores_gemma":[0.014400436,0.00062799343,0.00086292136,0.0014880125,0.0027793504,0.0027244801,0.0044725076,0.0033938952,0.0020582215],"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.00026533756,0.000104190774,0.00088316726,0.00028501698,0.000099874735,0.00010644656,0.0002971169,0.26755843,0.0023981459,0.6114824,0.00844819,0.108071804],"study_design_scores_gemma":[0.000038865976,0.000047653073,0.0001715801,0.00004639947,0.000014958368,0.000033111446,0.00002398392,0.86021715,0.0007971872,0.1338807,0.004697974,0.000030409616],"about_ca_topic_score_codex":0.0055007692,"about_ca_topic_score_gemma":0.005479412,"teacher_disagreement_score":0.0064813574,"about_ca_system_score_codex":0.0017228271,"about_ca_system_score_gemma":0.0025670254,"threshold_uncertainty_score":0.021682262},"labels":[],"label_agreement":null},{"id":"W4414158357","doi":"10.1016/j.apnum.2025.09.005","title":"Comments on: “Two efficient iteration methods for solving the absolute value equations”","year":2025,"lang":"en","type":"article","venue":"Applied Numerical Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convergence (economics); Iterative method; Newton's method; Value (mathematics); Fixed-point iteration; Point (geometry); Absolute (philosophy)","score_opus":0.024342847601116616,"score_gpt":0.3521759946648025,"score_spread":0.3278331470636859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414158357","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000561367,0.0014057222,0.002220234,0.9199671,0.07180328,0.000046341233,0.0002748314,0.00018137945,0.003539809],"genre_scores_gemma":[0.00467133,0.0007823411,0.0018381295,0.9380019,0.043078687,0.000119619,0.00009827745,0.00016878315,0.011241062],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98899347,0.0025179926,0.0015786737,0.0017266279,0.004220316,0.00096289016],"domain_scores_gemma":[0.95899934,0.021654136,0.002542015,0.0013161076,0.013827075,0.0016613193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009407789,0.0018643138,0.001853519,0.0017470163,0.006596268,0.004835613,0.006185962,0.03968279,0.014388765],"category_scores_gemma":[0.062321696,0.001202201,0.002888389,0.0020262732,0.006583834,0.0069318796,0.0035234722,0.037462845,0.01351545],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007797376,0.000016222766,0.0002100821,0.00008986793,0.000022135966,0.00013720825,0.00017139633,0.00019792649,0.00020225665,0.005902728,0.9907087,0.0022635153],"study_design_scores_gemma":[0.00016140477,0.00005919679,0.002317013,0.00040739388,0.000077687924,0.00030422985,0.00057933666,0.0021887007,0.001414475,0.018549591,0.97364944,0.00029151415],"about_ca_topic_score_codex":0.029171182,"about_ca_topic_score_gemma":0.023600629,"teacher_disagreement_score":0.03968279,"about_ca_system_score_codex":0.005498839,"about_ca_system_score_gemma":0.005461631,"threshold_uncertainty_score":0.05800277},"labels":[],"label_agreement":null},{"id":"W4414397146","doi":"10.1007/s10107-025-02247-8","title":"On the complexity of a simple primal-dual coordinate method","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Air Force Office of Scientific Research; National Science Foundation; U.S. Navy; HORIZON EUROPE European Research Council; Office of Science; Directorate for Mathematical and Physical Sciences; Directorate for Computer and Information Science and Engineering; Army Research Office; Natural Sciences and Engineering Research Council of Canada; European Commission; Hasler Stiftung; Office of Naval Research; University of Wisconsin-Madison; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Bilinear interpolation; Coordinate descent; Extrapolation; Simple (philosophy); Computational complexity theory; Dual (grammatical number); Matrix (chemical analysis); Sparse matrix","score_opus":0.04467493521454918,"score_gpt":0.32446581764067334,"score_spread":0.27979088242612415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414397146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03814917,0.0017350101,0.9189827,0.004088923,0.00057656755,0.0002248114,0.0005839551,0.00079807447,0.03486089],"genre_scores_gemma":[0.3931987,0.001733073,0.57814413,0.0009421206,0.0008552061,0.0007554884,0.00083446334,0.0011500866,0.022386784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960389,0.0019549227,0.00014692055,0.0003741243,0.0012067338,0.0002784188],"domain_scores_gemma":[0.9738709,0.021754382,0.00057649624,0.0019624562,0.0013295147,0.00050628145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055796895,0.0014010646,0.0021130322,0.0011266693,0.0014121413,0.0043698484,0.0025095793,0.0017065826,0.018635897],"category_scores_gemma":[0.028487416,0.00087427645,0.0011690641,0.0020833148,0.0024691501,0.0066518993,0.004856044,0.0056871637,0.0027767639],"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.0014814803,0.0004342736,0.0018231628,0.0007742746,0.00015560606,0.00034464113,0.00039890406,0.22048487,0.00459337,0.55427,0.028880991,0.1863584],"study_design_scores_gemma":[0.00012407631,0.00006637015,0.00034673806,0.000048201484,0.00003225797,0.00007106963,0.000064708096,0.7072408,0.0009331158,0.28787762,0.0031695827,0.000025401172],"about_ca_topic_score_codex":0.003736627,"about_ca_topic_score_gemma":0.0043086815,"teacher_disagreement_score":0.018635897,"about_ca_system_score_codex":0.0019516848,"about_ca_system_score_gemma":0.0029808201,"threshold_uncertainty_score":0.0623433},"labels":[],"label_agreement":null},{"id":"W4414536831","doi":"","title":"Kaplansky's problem and unitary orbits in matrix amplifications","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","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":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Unitary state; Unitary matrix; Matrix (chemical analysis); Monotone polygon; Matrix function; Multiplicity (mathematics); Matrix algebra","score_opus":0.016684921037434113,"score_gpt":0.2681306696824895,"score_spread":0.25144574864505537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414536831","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8097215,0.00076738844,0.15929478,0.001294739,0.00008017056,0.000042065476,0.00021989147,0.00017564917,0.02840375],"genre_scores_gemma":[0.98203707,0.00017487726,0.013566746,0.00007261305,0.00004915645,0.00003443646,0.00011297787,0.00003684307,0.0039152317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988871,0.00030390813,0.00006651229,0.0002248306,0.0002879222,0.00022962363],"domain_scores_gemma":[0.9951939,0.0029745926,0.00055637665,0.0004458452,0.00029631593,0.0005329386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014419251,0.00040463672,0.0007400975,0.0012347308,0.0019975568,0.0022341902,0.0010975918,0.0012891005,0.005415723],"category_scores_gemma":[0.00965483,0.0003027603,0.0005609222,0.0009798926,0.0038979277,0.005899402,0.0037827792,0.0020178517,0.0004418051],"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.000046688318,0.000011201905,0.0003405301,0.000029612076,0.000008557109,0.000041559957,0.00023565583,0.0046953354,0.00051668787,0.9904055,0.00026843505,0.0034002159],"study_design_scores_gemma":[0.000013663491,0.000021539316,0.00022958448,0.000009442894,0.000004839618,0.000047127378,0.0001214207,0.013620928,0.0006568033,0.98410183,0.0011594107,0.000013327413],"about_ca_topic_score_codex":0.0011018799,"about_ca_topic_score_gemma":0.0006060997,"teacher_disagreement_score":0.005415723,"about_ca_system_score_codex":0.0015868292,"about_ca_system_score_gemma":0.0006965931,"threshold_uncertainty_score":0.018117428},"labels":[],"label_agreement":null},{"id":"W4414631947","doi":"10.61091/ars164-08","title":"Kernel-perfectness in digraphs obtained by some operations on digraphs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Digraph; Kernel (algebra); Arc (geometry); Set (abstract data type); Product (mathematics); Line (geometry)","score_opus":0.005345545598774207,"score_gpt":0.2362664208528371,"score_spread":0.2309208752540629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414631947","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7484779,0.0006984232,0.21528699,0.00032024115,0.00005693651,0.00006420534,0.00072507083,0.0004194531,0.03395084],"genre_scores_gemma":[0.9769746,0.00021229919,0.018502044,0.00005109588,0.000029381406,0.00002568226,0.00027587762,0.000035138994,0.0038939228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995621,0.00005991063,0.000043359712,0.00017365617,0.00007481768,0.00008615759],"domain_scores_gemma":[0.99900085,0.0003732539,0.00014697739,0.00022540712,0.000096364114,0.00015719213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039604568,0.00025650192,0.00038320723,0.00093098683,0.0007733123,0.0015163573,0.00042456048,0.00031513872,0.0028729541],"category_scores_gemma":[0.0016225019,0.0002878941,0.00051273685,0.0009928448,0.0014480733,0.0026784025,0.0010746784,0.00060276594,0.00023158349],"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.00007951332,0.00003388439,0.0021028884,0.00012921113,0.000022703756,0.0003087247,0.00092143565,0.0055165025,0.0053682807,0.9611063,0.0009106024,0.023499914],"study_design_scores_gemma":[0.000035206776,0.00009776966,0.0028733155,0.000035856345,0.000060458533,0.0006823317,0.0004448059,0.028983142,0.0058419444,0.9504962,0.010411825,0.00003711866],"about_ca_topic_score_codex":0.0013220923,"about_ca_topic_score_gemma":0.0015957312,"teacher_disagreement_score":0.0028729541,"about_ca_system_score_codex":0.0009344291,"about_ca_system_score_gemma":0.00040241904,"threshold_uncertainty_score":0.009610951},"labels":[],"label_agreement":null},{"id":"W4414747032","doi":"10.13140/rg.2.2.12219.53283","title":"Stabilization of the Gradient Method for Solving Linear Algebraic Systems -- A Method Related to the Normal Equation","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Université de Moncton","funders":"","keywords":"Invertible matrix; Convergence (economics); Simple (philosophy); Rate of convergence; Matrix (chemical analysis); Algebraic number; Linear system; Algebraic equation","score_opus":0.04407544007904634,"score_gpt":0.3202242972224299,"score_spread":0.27614885714338355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414747032","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032805288,0.00014009916,0.99498427,0.00008664875,0.000048829017,0.000030536816,0.00000990087,0.00017729409,0.0012418664],"genre_scores_gemma":[0.36382166,0.000601415,0.6256881,0.00015627296,0.00015226193,0.00040270112,0.00011381857,0.00034854002,0.008715283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996617,0.00016406449,0.000010767727,0.00004854578,0.00009744772,0.000017483431],"domain_scores_gemma":[0.99971014,0.00012663203,0.00003216599,0.00003383612,0.00008012329,0.000017106675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007667376,0.00066770794,0.00062111096,0.00045556054,0.000285817,0.0004643137,0.00061356253,0.0006458591,0.0017542121],"category_scores_gemma":[0.0013990345,0.00022000477,0.00052296254,0.00030254852,0.000909461,0.00068416126,0.00078759243,0.0009473072,0.00069029344],"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.00022259771,0.00012468608,0.0014637173,0.00059346255,0.00016332428,0.00019070193,0.00031812282,0.53987616,0.058050923,0.18713851,0.0050924756,0.2067653],"study_design_scores_gemma":[0.000016256907,0.000063871405,0.0001195503,0.000012258456,0.0000064155365,0.000051388335,0.000009866474,0.9794799,0.004081325,0.013109137,0.0030380378,0.000012055455],"about_ca_topic_score_codex":0.0010972614,"about_ca_topic_score_gemma":0.0009164416,"teacher_disagreement_score":0.0017542121,"about_ca_system_score_codex":0.0003109797,"about_ca_system_score_gemma":0.0005860815,"threshold_uncertainty_score":0.0058684945},"labels":[],"label_agreement":null},{"id":"W4414847476","doi":"10.48550/arxiv.2505.08812","title":"An Algorithm to compute the Kronecker cone and other moment cones","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Canadian Nautical Research Society","funders":"","keywords":"Kronecker delta; Cone (formal languages); Morphism; Convex cone; Representation (politics); Algebraic number; Algebra over a field; Conic section; Computation","score_opus":0.029764149133119117,"score_gpt":0.2872692727097855,"score_spread":0.25750512357666633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414847476","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006991679,0.00015355552,0.96895605,0.0003133318,0.00013454468,0.000158403,0.0017131867,0.011506186,0.010073001],"genre_scores_gemma":[0.07816782,0.00015251322,0.90147483,0.00030110602,0.000107748434,0.00037783617,0.005728302,0.00396407,0.009725882],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986627,0.00012537674,0.00014774963,0.00026037722,0.00052620296,0.00027759204],"domain_scores_gemma":[0.9979954,0.000739822,0.000112061854,0.00039299784,0.00063276343,0.00012700318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012332451,0.0017350577,0.0012575375,0.0025836478,0.0011385981,0.0038841926,0.00269517,0.0010466485,0.035840392],"category_scores_gemma":[0.005993392,0.0009414573,0.0017880702,0.0017374759,0.0008973923,0.00467703,0.0031760929,0.0031089403,0.0138995685],"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.00075053074,0.00035167008,0.00352506,0.00068741664,0.0001111229,0.00038392594,0.0004723223,0.024881884,0.020580573,0.27065665,0.07509798,0.60250086],"study_design_scores_gemma":[0.00027924494,0.0001848537,0.0010263561,0.00019952845,0.000077129174,0.00044017116,0.00029320337,0.429589,0.028149977,0.46830055,0.07127604,0.0001838947],"about_ca_topic_score_codex":0.0034594543,"about_ca_topic_score_gemma":0.0071576396,"teacher_disagreement_score":0.035840392,"about_ca_system_score_codex":0.0014209448,"about_ca_system_score_gemma":0.0031276022,"threshold_uncertainty_score":0.11989808},"labels":[],"label_agreement":null},{"id":"W4415082614","doi":"","title":"Stabilization of the Gradient Method for Solving Linear Algebraic Systems","year":2025,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Université de Moncton","funders":"","keywords":"Convergence (economics); Invertible matrix; Eigenvalues and eigenvectors; Simple (philosophy); Algebraic number; Sign (mathematics); Matrix (chemical analysis); Linear system","score_opus":0.015576687437786335,"score_gpt":0.25591868552366775,"score_spread":0.24034199808588141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415082614","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011195576,0.0005209635,0.9845665,0.00017229521,0.00007149748,0.00004884407,0.000018406641,0.00032674283,0.0030790786],"genre_scores_gemma":[0.5862239,0.00087254884,0.4026171,0.00016560112,0.0001605966,0.00037322685,0.000113579714,0.00032304018,0.009150449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999767,0.00011248508,0.000006328798,0.000028247143,0.000074392716,0.000011632295],"domain_scores_gemma":[0.999861,0.000057941168,0.000018444518,0.000012587513,0.000040165152,0.000009788013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047643934,0.0006264419,0.00046021992,0.00035969052,0.00023917346,0.00038086815,0.0004216384,0.0005412274,0.0014689933],"category_scores_gemma":[0.00087828794,0.00018568373,0.00027542244,0.00029502236,0.00067007646,0.00038557072,0.0006255464,0.00069464697,0.0005036876],"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.00022478944,0.0000821539,0.00096334313,0.00058956264,0.000115480514,0.00018958817,0.0003027089,0.6001213,0.06329577,0.13774973,0.006199706,0.19016586],"study_design_scores_gemma":[0.000013527963,0.00005158925,0.000106601605,0.000011459068,0.0000038270127,0.000031687905,0.0000075695552,0.98399425,0.0037130553,0.009380019,0.0026781412,0.000008299445],"about_ca_topic_score_codex":0.0011080428,"about_ca_topic_score_gemma":0.0007569455,"teacher_disagreement_score":0.0014689933,"about_ca_system_score_codex":0.00027297006,"about_ca_system_score_gemma":0.00035931746,"threshold_uncertainty_score":0.004914224},"labels":[],"label_agreement":null},{"id":"W4415270694","doi":"10.48550/arxiv.2510.12619","title":"Vizing's Theorem in Deterministic Almost-Linear Time","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","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":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; European Commission; United States-Israel Binational Science Foundation; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Sublinear function; Deterministic algorithm; Time complexity; Upper and lower bounds; Degree (music); Randomized algorithm; Running time","score_opus":0.0261324427197144,"score_gpt":0.27869322199015284,"score_spread":0.25256077927043846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415270694","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028945869,0.002105883,0.91770047,0.0067990343,0.0006525545,0.0004919463,0.002289796,0.014755323,0.026259078],"genre_scores_gemma":[0.3200343,0.0014584509,0.64596754,0.004205094,0.0006810651,0.0013951041,0.0036259894,0.0026874412,0.019944977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98951775,0.0018351568,0.000722557,0.0037438301,0.0023629207,0.0018177897],"domain_scores_gemma":[0.98085105,0.010217812,0.0008586942,0.0064900653,0.0011290214,0.00045333174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004194569,0.0026863676,0.0025977632,0.0011826943,0.0022780446,0.005182055,0.0058890637,0.0024153395,0.012500514],"category_scores_gemma":[0.018403929,0.0016369381,0.004103182,0.003537429,0.004151845,0.013166708,0.006178237,0.0075076385,0.0050454307],"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.0019404537,0.00034711938,0.0016489303,0.0013472032,0.00032777866,0.00025770962,0.0005475864,0.15735117,0.011591412,0.6256668,0.049782462,0.14919151],"study_design_scores_gemma":[0.0003565892,0.00014960761,0.0003389987,0.00006849248,0.00012535878,0.00013614085,0.000075255055,0.2662051,0.0053354315,0.70802814,0.019104537,0.00007638266],"about_ca_topic_score_codex":0.0060049105,"about_ca_topic_score_gemma":0.007316313,"teacher_disagreement_score":0.012500514,"about_ca_system_score_codex":0.0065773223,"about_ca_system_score_gemma":0.006846543,"threshold_uncertainty_score":0.0477221},"labels":[],"label_agreement":null},{"id":"W4415395848","doi":"10.1016/j.laa.2025.10.019","title":"Convergence analysis of optimal SOR for a class of consistently ordered 2-cyclic matrices with complex spectra","year":2025,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Preconditioner; Eigenvalues and eigenvectors; Convergence (economics); Linear system; Complex plane; Interval (graph theory); Real line; Relaxation (psychology); Generalized minimal residual method; Matrix (chemical analysis)","score_opus":0.01414239860435101,"score_gpt":0.2712122089823944,"score_spread":0.2570698103780434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415395848","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06614938,0.001562126,0.9225924,0.0008299704,0.00016090955,0.00008727983,0.000163386,0.00028000164,0.008174478],"genre_scores_gemma":[0.706479,0.0016081394,0.28329825,0.0005660356,0.00036150074,0.00022887909,0.0005048582,0.0003503533,0.006602983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980938,0.00096521893,0.000067173525,0.00024145632,0.00041048258,0.00022183178],"domain_scores_gemma":[0.9874406,0.009145897,0.0007140849,0.0006345263,0.00154757,0.0005174341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053475783,0.0014120634,0.0013467349,0.0011508294,0.00051677716,0.0016086893,0.0014409203,0.0012551234,0.0035016227],"category_scores_gemma":[0.017828612,0.0005757054,0.0007128824,0.0007797178,0.002203287,0.0025006833,0.0017399159,0.0015780057,0.00056046795],"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.000649972,0.00022749754,0.001437155,0.00054197456,0.00012672262,0.0002494549,0.00021694887,0.5582237,0.0062515223,0.3919412,0.005459204,0.034674615],"study_design_scores_gemma":[0.000015273263,0.00005135213,0.00012147719,0.00002039775,0.0000066576863,0.000049554656,0.000034296743,0.9527448,0.000664231,0.045913327,0.0003680841,0.000010617321],"about_ca_topic_score_codex":0.0013757267,"about_ca_topic_score_gemma":0.0017044271,"teacher_disagreement_score":0.0053475783,"about_ca_system_score_codex":0.0009228447,"about_ca_system_score_gemma":0.002263525,"threshold_uncertainty_score":0.028281033},"labels":[],"label_agreement":null},{"id":"W4415504824","doi":"10.1080/02331934.2025.2577413","title":"Eckstein-Ferris-Pennanen-Robinson duality revisited: paramonotonicity, total Fenchel-Rockafellar duality, and the Chambolle-Pock operator","year":2025,"lang":"en","type":"article","venue":"Optimization","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Duality (order theory); Operator (biology); Quasinormal operator; Algebra over a field; Compact operator; Strictly singular operator; Finite-rank operator","score_opus":0.006124928500828608,"score_gpt":0.23907057850195493,"score_spread":0.23294565000112633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415504824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07249681,0.0019543853,0.86788255,0.0028171423,0.00021114225,0.00004964191,0.00014625842,0.00009917314,0.054342892],"genre_scores_gemma":[0.8462306,0.001892125,0.13677476,0.00090040354,0.0003851788,0.00014886336,0.00014079,0.00015009388,0.01337718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990484,0.00037470937,0.00004206673,0.00018073837,0.00025421946,0.00009979883],"domain_scores_gemma":[0.9980052,0.0011098319,0.00019659092,0.00021415541,0.00030892127,0.00016526316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030354864,0.00073978584,0.0010482221,0.0013653731,0.00106553,0.0028840592,0.0013423606,0.0012893976,0.0044013956],"category_scores_gemma":[0.009012329,0.00033862834,0.0010893652,0.001302516,0.0041545155,0.0045869304,0.0028008178,0.0027423354,0.0006693218],"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.0000076675315,0.0000043946643,0.000057395264,0.000013391144,0.0000035959756,0.000021685142,0.00003748894,0.0021987874,0.00016520939,0.9946537,0.00040001213,0.0024367026],"study_design_scores_gemma":[0.0000069827433,0.000014717761,0.000069744216,0.000013492233,0.0000039509546,0.000074428994,0.00003596008,0.03190281,0.00036383932,0.9659462,0.0015601498,0.000007757358],"about_ca_topic_score_codex":0.00053208525,"about_ca_topic_score_gemma":0.00040463728,"teacher_disagreement_score":0.0044013956,"about_ca_system_score_codex":0.0013020086,"about_ca_system_score_gemma":0.0010041901,"threshold_uncertainty_score":0.016053379},"labels":[],"label_agreement":null},{"id":"W4416199204","doi":"10.1145/3712285.3759796","title":"Sparsified Preconditioned Conjugate Gradient Solver on GPUs","year":2025,"lang":"","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"McMaster University","funders":"","keywords":"Conjugate gradient method; Solver; Speedup; Conjugate residual method; Convergence (economics); Iterative method; Limit (mathematics); Derivation of the conjugate gradient method","score_opus":0.015798998605971518,"score_gpt":0.2506924241823708,"score_spread":0.2348934255763993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416199204","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0794346,0.00028044524,0.8955214,0.0005262051,0.0001404884,0.00012045431,0.00052343827,0.006231231,0.017221713],"genre_scores_gemma":[0.39403838,0.00017452954,0.5983199,0.00019688698,0.00003732581,0.00020131253,0.000843777,0.0004673415,0.005720547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950945,0.00013691644,0.00002538663,0.00006150274,0.00021596237,0.000050697512],"domain_scores_gemma":[0.9991019,0.00025609488,0.00006359392,0.00021904956,0.0003020924,0.00005733748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004099821,0.00062802155,0.0006318086,0.00033095316,0.00033593987,0.0007270052,0.0008986862,0.0006773317,0.0054289876],"category_scores_gemma":[0.0023216908,0.00034236864,0.00040959305,0.00069966615,0.000559895,0.00073503854,0.0008974128,0.00097288267,0.0012471842],"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.00032484514,0.00010474661,0.0016307789,0.00014540448,0.00007869452,0.00035560544,0.00014643483,0.838927,0.025963288,0.030511025,0.013010968,0.08880122],"study_design_scores_gemma":[0.000032069922,0.000017947286,0.00010794499,0.0000043316613,0.0000025945599,0.000021757718,0.000011024561,0.9899858,0.003645997,0.0036747104,0.0024914725,0.00000438423],"about_ca_topic_score_codex":0.0077034435,"about_ca_topic_score_gemma":0.0080374135,"teacher_disagreement_score":0.0077034435,"about_ca_system_score_codex":0.00046454213,"about_ca_system_score_gemma":0.0013671936,"threshold_uncertainty_score":0.018161833},"labels":[],"label_agreement":null},{"id":"W4416916517","doi":"10.13001/ela.2025.9507","title":"Combinatorial considerations for the number of distinct eigenvalues of a matrix","year":2025,"lang":"","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"North York General Hospital; Redeemer University; The Scarborough Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eigenvalues and eigenvectors; Digraph; Sequence (biology); Matrix (chemical analysis); Inverse; Binary number; Spectrum of a matrix; Spectrum (functional analysis)","score_opus":0.011783968537994724,"score_gpt":0.3009380608544846,"score_spread":0.28915409231648986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416916517","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6717922,0.0011187303,0.22960024,0.0024299277,0.00021807327,0.000095120085,0.00041774265,0.00021793148,0.09410998],"genre_scores_gemma":[0.9525878,0.0004043456,0.037692264,0.00018895172,0.00014586082,0.00016702879,0.00025292323,0.0001004553,0.008460435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987972,0.00037439386,0.000096944466,0.0002583786,0.0003135488,0.00015959101],"domain_scores_gemma":[0.9920461,0.0050707855,0.0007910317,0.000773132,0.0005960916,0.0007228615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013168462,0.0006179717,0.00058528996,0.0024748365,0.001962118,0.0033938114,0.0015085678,0.0012878365,0.008420634],"category_scores_gemma":[0.010024202,0.0007133098,0.0006123232,0.0014217244,0.0032684573,0.0045521515,0.0019269933,0.0015395258,0.00081516244],"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.000116314644,0.000050880106,0.0017119907,0.000074788266,0.0000115100665,0.00018600025,0.00018621075,0.0061061834,0.0039094165,0.97851634,0.0011752103,0.007955163],"study_design_scores_gemma":[0.000041710995,0.0000695559,0.0009369641,0.000048428257,0.000019603543,0.00044242872,0.00027935006,0.04823234,0.0026177021,0.94389933,0.0033805876,0.00003208247],"about_ca_topic_score_codex":0.00033075636,"about_ca_topic_score_gemma":0.0006788112,"teacher_disagreement_score":0.008420634,"about_ca_system_score_codex":0.00087892055,"about_ca_system_score_gemma":0.0004850816,"threshold_uncertainty_score":0.02816987},"labels":[],"label_agreement":null},{"id":"W4417138134","doi":"10.1016/j.laa.2025.12.005","title":"Matrices with all diagonal entries lying on the boundary of the numerical range","year":2025,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"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":"University of Waterloo; Simons Foundation; National Tsing Hua University; National Center for Theoretical Sciences; National Science and Technology Council","keywords":"Toeplitz matrix; Triangular matrix; Numerical range; Orthonormal basis; Boundary (topology); Matrix (chemical analysis); Diagonal; Characterization (materials science); Normal matrix","score_opus":0.009463230138397475,"score_gpt":0.2406916982293705,"score_spread":0.23122846809097303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417138134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07954622,0.0018656428,0.8002637,0.0018859719,0.00081259117,0.00014376144,0.0009452418,0.002042849,0.112494156],"genre_scores_gemma":[0.7732169,0.001419301,0.19192958,0.0010140801,0.00069811323,0.0003812847,0.0010514308,0.0007483779,0.02954096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989827,0.00027245146,0.000069247464,0.00018164574,0.00039709485,0.00009691681],"domain_scores_gemma":[0.99719363,0.0010476153,0.00033675443,0.00068206695,0.0005820426,0.00015794204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007716325,0.0007177848,0.000615483,0.00080072583,0.0008772672,0.002612101,0.0010187081,0.0009810582,0.020763483],"category_scores_gemma":[0.008790627,0.00022302155,0.00024213793,0.0007528257,0.002600604,0.0022747049,0.0014894826,0.001801262,0.0064875437],"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.00044589746,0.00012999096,0.0008979142,0.0004881109,0.00004250101,0.0003120856,0.00039779357,0.010655748,0.04037498,0.83543587,0.008821436,0.10199768],"study_design_scores_gemma":[0.00008955989,0.00016774843,0.00096485426,0.0003205595,0.000023515546,0.0009855643,0.00042277714,0.10063219,0.04880117,0.8080145,0.039474532,0.0001029172],"about_ca_topic_score_codex":0.00028694654,"about_ca_topic_score_gemma":0.00029937248,"teacher_disagreement_score":0.020763483,"about_ca_system_score_codex":0.00023145459,"about_ca_system_score_gemma":0.0005623718,"threshold_uncertainty_score":0.06946081},"labels":[],"label_agreement":null},{"id":"W44562587","doi":"10.1007/978-3-642-32683-7_8","title":"Polynomial Preconditioning of Power System Matrices with Graphics Processing Units","year":2012,"lang":"en","type":"book-chapter","venue":"Power systems","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"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":"Preconditioner; Computer science; Parallel computing; Coprocessor; Computational science; Graphics; Robustness (evolution); Linear system; CUDA; Iterative method; Algorithm; Mathematics; Computer graphics (images)","score_opus":0.01417414808598003,"score_gpt":0.20680471706425613,"score_spread":0.1926305689782761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W44562587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037432357,0.0017368702,0.94964033,0.0002645225,0.0005363091,0.00004667626,0.00011569245,0.0021863692,0.04172999],"genre_scores_gemma":[0.16004276,0.00503363,0.7288076,0.00025242762,0.00075555977,0.00015498638,0.0006576333,0.0015000423,0.10279544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979407,0.000044805067,0.000008158394,0.00003526193,0.000096337855,0.000021509066],"domain_scores_gemma":[0.99978906,0.000059826245,0.000014770532,0.000063702384,0.000061191975,0.000011478513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017790773,0.0011059347,0.00052524154,0.0003420506,0.0003381396,0.0008817465,0.00072429347,0.00041845744,0.02216842],"category_scores_gemma":[0.0009943964,0.0003568638,0.00039292796,0.0011839456,0.0005037807,0.0009357932,0.0006777256,0.0014017959,0.009600648],"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.000132671,0.000060958195,0.0001902294,0.00051601924,0.00003077431,0.00017297821,0.00020916696,0.08837537,0.019299382,0.18269332,0.08291034,0.62540877],"study_design_scores_gemma":[0.000063494495,0.00015559274,0.00042690043,0.00012725685,0.000034576344,0.00043201004,0.00009373886,0.45534012,0.03108195,0.17331992,0.33888844,0.00003606023],"about_ca_topic_score_codex":0.0012081055,"about_ca_topic_score_gemma":0.002031244,"teacher_disagreement_score":0.02216842,"about_ca_system_score_codex":0.00030375487,"about_ca_system_score_gemma":0.00042088403,"threshold_uncertainty_score":0.074160755},"labels":[],"label_agreement":null},{"id":"W47026967","doi":"10.1007/978-3-642-17884-9_57","title":"Comparison of Parallel Preconditioners for a Newton-Krylov Flow Solver","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"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":"Preconditioner; Solver; Parallel computing; Applied mathematics; Computer science; Mathematics; Computational science; Mathematical optimization; Algorithm; Iterative method","score_opus":0.050296648141205276,"score_gpt":0.28480209914719007,"score_spread":0.2345054510059848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W47026967","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19223261,0.0036990196,0.6869002,0.000974976,0.0011451796,0.0005012117,0.0016707326,0.00851592,0.10436016],"genre_scores_gemma":[0.43268222,0.002484001,0.53107584,0.00025253693,0.00024411353,0.0006225352,0.003935713,0.00331719,0.025385851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992305,0.00019838382,0.000052373176,0.00006413176,0.00037092678,0.00008363984],"domain_scores_gemma":[0.9964181,0.0016657487,0.0001389266,0.00044746132,0.0011696746,0.0001600987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012421362,0.0010450393,0.0013748319,0.0009260649,0.0008395619,0.0010497485,0.0012790771,0.000995755,0.012556922],"category_scores_gemma":[0.0058033024,0.00036272232,0.00076835224,0.0017270582,0.0004901257,0.0012588558,0.0010039179,0.0012299177,0.001955038],"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.0036316772,0.00078061095,0.0019367421,0.0015703792,0.00025825726,0.00016274495,0.00026891503,0.47802126,0.015779242,0.04062485,0.034194797,0.42277053],"study_design_scores_gemma":[0.00037493827,0.0004860811,0.001386795,0.00006870768,0.00010367439,0.0000979715,0.000158458,0.9574336,0.016094936,0.010906287,0.012845036,0.0000435612],"about_ca_topic_score_codex":0.0048989533,"about_ca_topic_score_gemma":0.008086563,"teacher_disagreement_score":0.012556922,"about_ca_system_score_codex":0.00065453944,"about_ca_system_score_gemma":0.0018657704,"threshold_uncertainty_score":0.04200703},"labels":[],"label_agreement":null},{"id":"W5303587","doi":"","title":"Higher-rank numerical ranges and dilations","year":2010,"lang":"en","type":"article","venue":"Journal of Operator Theory","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":24,"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; Unitary state; Rank (graph theory); Numerical range; Dilation (metric space); Combinatorics; Contraction (grammar); Unitary matrix; Pure mathematics","score_opus":0.008371323071428691,"score_gpt":0.24512986935825398,"score_spread":0.2367585462868253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W5303587","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54777354,0.0010757515,0.40094134,0.0008546489,0.0001306099,0.00005742686,0.00029679146,0.00035360048,0.048516273],"genre_scores_gemma":[0.96154404,0.00024290186,0.032496836,0.00012460959,0.00014902471,0.000057897418,0.0001630001,0.00006900108,0.0051527875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983759,0.000429325,0.00010765714,0.00032802325,0.00057409884,0.00018488897],"domain_scores_gemma":[0.99507207,0.0023450744,0.000930717,0.00060091895,0.00060884195,0.00044227502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014706125,0.0003901008,0.0005234448,0.0010638848,0.0007198944,0.0014743115,0.00048756588,0.00042095024,0.0054940744],"category_scores_gemma":[0.008758643,0.00027604288,0.00043328258,0.0006408042,0.0026318955,0.0029214767,0.0020368795,0.0010888864,0.0005030471],"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.00012278289,0.000028427155,0.0014665795,0.000090286616,0.000013952634,0.00030187264,0.00055371487,0.008334296,0.006856883,0.95913863,0.0018170457,0.021275554],"study_design_scores_gemma":[0.000036262605,0.00016714365,0.0031103694,0.00004562173,0.00001575103,0.0011978843,0.00047886567,0.09656378,0.006994458,0.87875664,0.012575505,0.000057708625],"about_ca_topic_score_codex":0.00022311514,"about_ca_topic_score_gemma":0.00023847076,"teacher_disagreement_score":0.0054940744,"about_ca_system_score_codex":0.0004912145,"about_ca_system_score_gemma":0.00023354811,"threshold_uncertainty_score":0.018379569},"labels":[],"label_agreement":null},{"id":"W54307288","doi":"10.5644/sjm.02.2.02","title":"Maximal Clifford Semigroups of Matrices","year":2024,"lang":"en","type":"article","venue":"SARAJEVO JOURNAL OF MATHEMATICS","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Pure mathematics; Algebra over a field","score_opus":0.014613181807845205,"score_gpt":0.2605597022720735,"score_spread":0.24594652046422827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W54307288","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5271541,0.0017005927,0.30544478,0.0014854809,0.0005989561,0.00019150936,0.00083167123,0.00073092454,0.16186202],"genre_scores_gemma":[0.947895,0.00033858125,0.027848357,0.00021846026,0.0003164607,0.00011684996,0.00041945645,0.000075331634,0.022771562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863726,0.0002615557,0.000084445026,0.00038218327,0.00032017395,0.00031451526],"domain_scores_gemma":[0.99766845,0.0006741551,0.00033110008,0.0002863935,0.0004849181,0.0005549379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011694173,0.00045194672,0.00036690757,0.001214609,0.0015518056,0.0023948243,0.00051578705,0.00046854978,0.006836884],"category_scores_gemma":[0.0026246645,0.00027504328,0.00059818686,0.0005508633,0.0023152682,0.0030539453,0.0015268059,0.0009194726,0.00088990404],"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.0000592099,0.000016852095,0.00030499534,0.000037298832,0.0000053217755,0.0001389618,0.00044784794,0.0002586271,0.0033343344,0.9887211,0.00094443694,0.0057310704],"study_design_scores_gemma":[0.000022361844,0.000061641666,0.0006243343,0.00003121572,0.000008651263,0.00041377172,0.0003454519,0.004197265,0.006320181,0.97358024,0.014370692,0.000024140232],"about_ca_topic_score_codex":0.00053372514,"about_ca_topic_score_gemma":0.00043352591,"teacher_disagreement_score":0.006836884,"about_ca_system_score_codex":0.000867868,"about_ca_system_score_gemma":0.00074352114,"threshold_uncertainty_score":0.022871673},"labels":[],"label_agreement":null},{"id":"W623482864","doi":"","title":"Angles, Majorization, Wielandt Inequality and Applications","year":2013,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Mathematics; Majorization; Lemma (botany); Convexity; Positive-definite matrix; Pure mathematics; Combinatorics; Eigenvalues and eigenvectors","score_opus":0.0074826482733793805,"score_gpt":0.19724824806855784,"score_spread":0.18976559979517846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W623482864","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04098236,0.019802965,0.76013196,0.0028365639,0.0011777896,0.000057608755,0.00037133959,0.00017933568,0.17446019],"genre_scores_gemma":[0.76553136,0.024983212,0.15418439,0.0016265111,0.0033179256,0.00031834442,0.0008333905,0.00039738705,0.048807476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989397,0.00031405265,0.000069540234,0.00026035757,0.0002851802,0.0001311887],"domain_scores_gemma":[0.9981744,0.00097296573,0.00023828934,0.00013770483,0.00034085358,0.00013562357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012079225,0.0010049628,0.0006265733,0.0015798309,0.0007121243,0.0025034263,0.0007075793,0.0007150719,0.008354087],"category_scores_gemma":[0.0038619472,0.00034249452,0.0007603608,0.0015810039,0.0028883338,0.004493181,0.0021357648,0.0035303193,0.0014935725],"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.000017647832,0.000010582112,0.0001848441,0.00007247551,0.0000059453296,0.00005385183,0.00008425976,0.0024935317,0.0009960856,0.9793228,0.001814524,0.014943394],"study_design_scores_gemma":[0.0000054656307,0.000053912212,0.00037150749,0.00006578028,0.0000071138097,0.00019781031,0.000118614604,0.018801827,0.0012208162,0.95608145,0.023055194,0.00002048866],"about_ca_topic_score_codex":0.00077635364,"about_ca_topic_score_gemma":0.0005066398,"teacher_disagreement_score":0.008354087,"about_ca_system_score_codex":0.0012747609,"about_ca_system_score_gemma":0.00046583856,"threshold_uncertainty_score":0.027947247},"labels":[],"label_agreement":null},{"id":"W629552308","doi":"10.1016/j.laa.2015.06.007","title":"Orthogonal sets of normal or conjugate-normal matrices","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Normal matrix; Mathematics; Orthogonality; Conjugate; Eigenvalues and eigenvectors; Conjugate points; Matrix (chemical analysis); Pure mathematics; Combinatorics; Point (geometry); Mathematical analysis; Geometry","score_opus":0.023000694209825107,"score_gpt":0.2720105890052088,"score_spread":0.24900989479538368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W629552308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1974144,0.0008205235,0.7386396,0.00080125773,0.0005586787,0.00013802273,0.0011887286,0.00040681814,0.06003197],"genre_scores_gemma":[0.8269045,0.0011446975,0.13299367,0.00070918334,0.0008565768,0.0004003351,0.0022655213,0.00034736798,0.03437817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99661726,0.00094042305,0.00021407349,0.00063857285,0.0012145207,0.00037511278],"domain_scores_gemma":[0.99302226,0.0024373378,0.0009770055,0.0010727032,0.0017577782,0.0007329446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002078362,0.0011124028,0.0011781321,0.003429128,0.0016028067,0.0048931474,0.0016352285,0.0008750953,0.0079888115],"category_scores_gemma":[0.011805547,0.0006454056,0.0009690639,0.0021874728,0.0042488757,0.0046952986,0.0040837894,0.0019218426,0.0012991027],"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.00008665131,0.000040479095,0.00034815384,0.000033301323,0.00001606757,0.000044388282,0.00013112651,0.0009827433,0.0011401355,0.98364085,0.0013729456,0.012163178],"study_design_scores_gemma":[0.000014039786,0.000024362254,0.00020230071,0.000015110864,0.000008564051,0.00010399495,0.0000865929,0.010083411,0.0010767815,0.98594075,0.0024238504,0.000020254673],"about_ca_topic_score_codex":0.00049240055,"about_ca_topic_score_gemma":0.00044920985,"teacher_disagreement_score":0.0079888115,"about_ca_system_score_codex":0.000887164,"about_ca_system_score_gemma":0.0010984689,"threshold_uncertainty_score":0.026725233},"labels":[],"label_agreement":null},{"id":"W638986488","doi":"10.1007/978-3-0348-7840-1","title":"Advances in Pseudo-Differential Operators","year":2004,"lang":"en","type":"book","venue":"Birkhäuser Basel eBooks","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computation; Library science; Differential (mechanical device); Computer science; Political science; Operations research; Mathematics; Engineering; Algorithm; Aerospace engineering","score_opus":0.00851434705527242,"score_gpt":0.227607180721603,"score_spread":0.21909283366633056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W638986488","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01253487,0.18406357,0.16850194,0.009351821,0.015467435,0.000039902225,0.0003040841,0.000412747,0.6093236],"genre_scores_gemma":[0.26190415,0.17061378,0.094078854,0.0036170264,0.016081354,0.00012840774,0.00056360295,0.00039226763,0.45262063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997757,0.000052316365,0.000013519551,0.000037045957,0.00010304538,0.000018323362],"domain_scores_gemma":[0.99972755,0.00009807237,0.000013433257,0.00005093598,0.00008025837,0.000029786557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043737568,0.00057002035,0.0005168331,0.0013150333,0.0005129935,0.0014332483,0.00047243628,0.00057182944,0.0076458273],"category_scores_gemma":[0.00088287925,0.00025712678,0.0004885645,0.0013679503,0.0012086584,0.0021729202,0.0010629218,0.001804937,0.0026614824],"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.0000068830605,0.000008401537,0.00004270288,0.00012337777,0.000004847565,0.000036863436,0.00007639528,0.0006354345,0.0006461334,0.93622535,0.020273525,0.041920196],"study_design_scores_gemma":[0.0000041968447,0.000020213169,0.0001471706,0.0000544471,0.0000044780063,0.00024938746,0.000027343047,0.004097751,0.00040097834,0.77706057,0.21792535,0.000008156126],"about_ca_topic_score_codex":0.00033461145,"about_ca_topic_score_gemma":0.00044543235,"teacher_disagreement_score":0.0076458273,"about_ca_system_score_codex":0.00077219744,"about_ca_system_score_gemma":0.00045807485,"threshold_uncertainty_score":0.025577784},"labels":[],"label_agreement":null},{"id":"W65827093","doi":"10.1007/978-3-642-55195-6_29","title":"OpenACC Parallelisation for Diffusion Problems, Applied to Temperature Distribution on a Honeycomb Around the Bee Brood: A Worked Example Using BiCGSTAB","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Solver; Computer science; Computational science; Workstation; Parallel computing; Biconjugate gradient stabilized method; Simple (philosophy); Programmer; Compiler; Convergence (economics); Iterative method; Algorithm; Programming language; Operating system","score_opus":0.02557352308922419,"score_gpt":0.24723571241962372,"score_spread":0.22166218933039952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65827093","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13611823,0.001487736,0.7947543,0.0012593392,0.00060118025,0.00015441616,0.0002958341,0.008062722,0.057266146],"genre_scores_gemma":[0.51118445,0.00045237274,0.46156192,0.00020472387,0.00009046294,0.00020413433,0.00037687286,0.0015162845,0.024408784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997825,0.000054104734,0.000010297048,0.000031102343,0.00008899731,0.000032976677],"domain_scores_gemma":[0.99933344,0.00032066126,0.000020248834,0.000090743786,0.00018695641,0.00004800669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046105857,0.0008099422,0.0010317552,0.00030456044,0.0011878326,0.0011513808,0.0015093985,0.0015375678,0.0077426084],"category_scores_gemma":[0.0014815002,0.00037486458,0.0006275145,0.00087733613,0.0007035134,0.0007730809,0.0010632718,0.0013933218,0.0017806396],"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.00061530265,0.00029693995,0.0013529888,0.0007546527,0.00008528422,0.0008287097,0.0008368657,0.6809946,0.03605295,0.047724396,0.019038996,0.21141835],"study_design_scores_gemma":[0.000093750954,0.00005463164,0.00021926264,0.000017199825,0.000011118255,0.00010990365,0.00006602648,0.97752213,0.0049145464,0.009932396,0.0070419144,0.000017062248],"about_ca_topic_score_codex":0.0066686976,"about_ca_topic_score_gemma":0.008519947,"teacher_disagreement_score":0.0077426084,"about_ca_system_score_codex":0.0006263634,"about_ca_system_score_gemma":0.0008170288,"threshold_uncertainty_score":0.025901616},"labels":[],"label_agreement":null},{"id":"W68169506","doi":"10.1007/978-3-0348-8181-4_20","title":"A Note on the Level Sets of a Matrix Polynomial and Its Numerical Range","year":2002,"lang":"en","type":"book-chapter","venue":"Birkhäuser Basel eBooks","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Regina","funders":"","keywords":"Omega; Backslash; Combinatorics; Mathematics; Lambda; Bounded function; Polynomial; Matrix (chemical analysis); Physics; Mathematical analysis; Quantum mechanics; Chemistry","score_opus":0.04234564462617618,"score_gpt":0.25323303497080163,"score_spread":0.21088739034462545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68169506","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035014346,0.027725302,0.2775775,0.0023293444,0.0011921143,0.000036696474,0.0004637226,0.0006907582,0.6549702],"genre_scores_gemma":[0.48871994,0.021775203,0.2346032,0.0014123248,0.0022071858,0.00017418308,0.00086382154,0.0011907908,0.24905342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997527,0.000034898632,0.000010796823,0.00004245452,0.00013557657,0.000023470333],"domain_scores_gemma":[0.99959165,0.0002504049,0.000018414174,0.000060234313,0.00004980359,0.00002948757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034311792,0.00045195298,0.00046444454,0.0012389254,0.00077640323,0.0017528298,0.0007812027,0.00041776177,0.0051418156],"category_scores_gemma":[0.0011925879,0.00044833095,0.0005263301,0.0015899173,0.0015733442,0.0026155456,0.0012091629,0.0032017892,0.00239709],"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.000014852031,0.000010309839,0.000058752128,0.00007180299,0.0000035015164,0.000049447415,0.00015698223,0.0016312343,0.0012304428,0.95847195,0.007894858,0.03040583],"study_design_scores_gemma":[0.000005749183,0.000027698456,0.00035439656,0.000066321634,0.000007573839,0.00020336169,0.000057394016,0.008203081,0.0011642763,0.9057809,0.08411456,0.000014756627],"about_ca_topic_score_codex":0.0010271657,"about_ca_topic_score_gemma":0.0012228511,"teacher_disagreement_score":0.0051418156,"about_ca_system_score_codex":0.00085300545,"about_ca_system_score_gemma":0.0003132889,"threshold_uncertainty_score":0.017201126},"labels":[],"label_agreement":null},{"id":"W6910511906","doi":"10.48550/arxiv.0909.4277","title":"Sharp Bounds for Sums Associated to Graphs of Matrices","year":2009,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"Queen's University","funders":"","keywords":"Upper and lower bounds; Simple (philosophy); Graph; Matrix (chemical analysis); Graph theory; Simple graph","score_opus":0.05066603107505234,"score_gpt":0.20005451583713624,"score_spread":0.14938848476208388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910511906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023869071,0.0015439375,0.948035,0.001205213,0.00028788747,0.000090396396,0.00053658575,0.0010059545,0.023425909],"genre_scores_gemma":[0.40683493,0.0027321854,0.55656487,0.0022132285,0.0013465682,0.0010116132,0.002793437,0.0026469938,0.023856195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933031,0.0019720148,0.00030041873,0.0010711683,0.0022931576,0.0010600688],"domain_scores_gemma":[0.98222256,0.011169115,0.0011421967,0.0029350952,0.0017779042,0.0007531251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045389296,0.0037967074,0.0018587532,0.004617096,0.0017646318,0.006103038,0.0042570075,0.002265973,0.015603074],"category_scores_gemma":[0.036545377,0.0017058168,0.0019485664,0.004424854,0.0037802176,0.010897238,0.00759463,0.007734883,0.0053031095],"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.00038407094,0.00016957022,0.0009717,0.000530681,0.00013874052,0.00024521607,0.00039858566,0.07319816,0.008098917,0.79268044,0.017976563,0.10520743],"study_design_scores_gemma":[0.000018788474,0.000043411033,0.00024046769,0.000067684225,0.000038783284,0.00010663995,0.000045757883,0.11894196,0.0030307493,0.87198025,0.005455133,0.000030282385],"about_ca_topic_score_codex":0.0008312209,"about_ca_topic_score_gemma":0.0016953417,"teacher_disagreement_score":0.015603074,"about_ca_system_score_codex":0.0020698514,"about_ca_system_score_gemma":0.0011347478,"threshold_uncertainty_score":0.052197456},"labels":[],"label_agreement":null},{"id":"W6924244422","doi":"10.15468/dl.68h2mv","title":"Occurrence Download","year":2024,"lang":"en","type":"dataset","venue":"Global Biodiversity Information Facility","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Geodetic datum; Coordinate system; Matching (statistics); Download; Range (aeronautics); Geographic coordinate conversion","score_opus":0.011456961643110754,"score_gpt":0.21790675431309678,"score_spread":0.20644979266998603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6924244422","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000589861,0.00003861834,0.000071678915,0.000050194227,0.000017240813,0.0000069097177,0.9981993,0.00071857654,0.00083855144],"genre_scores_gemma":[0.00019511134,0.000040781728,0.00027927654,0.000053361386,0.0000044187523,0.000045931607,0.9986187,0.00018180655,0.00058060867],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989793,0.00013331811,0.00012639652,0.00036039448,0.00022831427,0.00017229891],"domain_scores_gemma":[0.99784374,0.0005583131,0.00016768892,0.00060866005,0.0005952694,0.00022630978],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00086446287,0.0019473197,0.0015676746,0.0044880863,0.0010062357,0.002700217,0.0029057665,0.0020188035,0.15294133],"category_scores_gemma":[0.0059036263,0.0008377128,0.0013256719,0.008851922,0.00041836832,0.0023600536,0.0025151777,0.0019453363,0.24175978],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027049295,0.000011307872,0.00037963965,0.00044382253,0.000013891686,0.0000139768135,0.000018900424,0.00014828471,0.00010000069,0.00037312956,0.9965816,0.0018884434],"study_design_scores_gemma":[0.00006713305,0.000008295943,0.0015603269,0.00015172287,0.000012588389,0.000035745747,0.00006929804,0.0002575894,0.00020317038,0.00097229995,0.9966461,0.000015764957],"about_ca_topic_score_codex":0.017595032,"about_ca_topic_score_gemma":0.030027809,"teacher_disagreement_score":0.84705865,"about_ca_system_score_codex":0.001558728,"about_ca_system_score_gemma":0.0022733612,"threshold_uncertainty_score":0.5116397},"labels":[],"label_agreement":null},{"id":"W6931805980","doi":"10.5281/zenodo.7814314","title":"Figure 3 in Neither slugs nor snails: a molecular reappraisal of the gastropod family Velutinidae","year":2022,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Phylogenetic tree; White (mutation); Clade; Sample (material); Tree (set theory); Family tree","score_opus":0.014824308363190103,"score_gpt":0.22903840187242502,"score_spread":0.21421409350923493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931805980","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9281775,0.0046202173,0.02305675,0.0028945967,0.00077525235,0.000056924295,0.012935201,0.0009123517,0.026571203],"genre_scores_gemma":[0.966669,0.001324882,0.011999079,0.0007225778,0.00005902172,0.000048947993,0.011051277,0.00020062363,0.007924674],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966836,0.00005353768,0.000014570957,0.00016059367,0.000053153984,0.000049879764],"domain_scores_gemma":[0.9996792,0.00008092791,0.0000835381,0.000057386813,0.00004368136,0.00005516247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040710834,0.00032081568,0.00031629243,0.00081420527,0.00087488524,0.0014232376,0.00056478503,0.0006412526,0.0074233855],"category_scores_gemma":[0.0013756545,0.00024789802,0.00050453475,0.0009838354,0.0005968997,0.00091107166,0.0011813927,0.0009590504,0.0018354659],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021962416,0.00015556058,0.386668,0.0023310657,0.0010012364,0.0036494406,0.0064419038,0.0065450026,0.3096327,0.017973226,0.037105065,0.22630057],"study_design_scores_gemma":[0.000079561956,0.00012776854,0.6655835,0.0009036697,0.00046795237,0.0023518784,0.0047743893,0.0164276,0.017345428,0.006550917,0.28527525,0.00011218815],"about_ca_topic_score_codex":0.0036912216,"about_ca_topic_score_gemma":0.011835664,"teacher_disagreement_score":0.0074233855,"about_ca_system_score_codex":0.0004384109,"about_ca_system_score_gemma":0.0004117529,"threshold_uncertainty_score":0.02483368},"labels":[],"label_agreement":null},{"id":"W6958155563","doi":"10.60692/k6jn4-64176","title":"Comparison of the epidemiology of disorders of gut–brain interaction in four Latin American countries: Results of The Rome Foundation Global Epidemiology Study","year":2023,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Matrix Theory and Algorithms","field":"Computer Science","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":"McMaster University","funders":"","keywords":"Epidemiology; Latin Americans; Anxiety; Depression (economics); Irritable bowel syndrome; Heartburn; Diarrhea","score_opus":0.07377917239571981,"score_gpt":0.33353169526353266,"score_spread":0.25975252286781286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6958155563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9933763,0.002405295,0.00018765408,0.00016109423,0.000011645435,0.000032647724,0.0022356156,0.000007302206,0.0015825765],"genre_scores_gemma":[0.9966125,0.001065611,0.00018097366,0.00006301628,0.000015191168,0.00004755421,0.0018569916,0.0000046133405,0.0001534852],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992879,0.00030758572,0.000104136554,0.00013702743,0.00007619469,0.000087158674],"domain_scores_gemma":[0.9985947,0.00023988253,0.0007254859,0.000093945,0.00021590284,0.00013013126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012215065,0.0003423814,0.0004079589,0.0020539176,0.0002560428,0.0007939697,0.00025144196,0.0003039191,0.0007018667],"category_scores_gemma":[0.0021331648,0.00025951973,0.0005686317,0.0026100592,0.0003190615,0.0004408121,0.00066278456,0.00028351063,0.00008471792],"study_design_candidate":"observational","study_design_consensus":"observational","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.00003477563,0.000008805049,0.99876404,0.000022718343,0.000080502046,0.000023691475,0.00010135095,0.000023185054,0.00004352645,0.000015910604,0.00009171065,0.00078984734],"study_design_scores_gemma":[0.0000037510488,0.000014421428,0.9993974,0.000016761696,0.000026953594,0.000042795018,0.0002560573,0.000030420477,0.000008808549,0.000006826566,0.00019397005,0.0000018258379],"about_ca_topic_score_codex":0.021801252,"about_ca_topic_score_gemma":0.02270412,"teacher_disagreement_score":0.021801252,"about_ca_system_score_codex":0.0004918681,"about_ca_system_score_gemma":0.000400023,"threshold_uncertainty_score":0.04334873},"labels":[],"label_agreement":null},{"id":"W6958372530","doi":"10.6084/m9.figshare.26995254.v1","title":"Additional file 1 of Consistent cord blood DNA methylation signatures of gestational age between South Asian and white European cohorts","year":2024,"lang":"en","type":"dataset","venue":"Figshare","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Manitoba; Thrombosis and Atherosclerosis Research Institute; SickKids Foundation; University of Toronto; University of Alberta; Population Health Research Institute; McMaster University; University of British Columbia; Hospital for Sick Children; St. Joseph’s Healthcare Hamilton","funders":"","keywords":"Epigenetics; Offspring; Gestational age; Table (database); Gestation; DNA methylation; Pregnancy; Genome-wide association study","score_opus":0.021486051396907593,"score_gpt":0.23634135725546246,"score_spread":0.21485530585855486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6958372530","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014913117,0.00001768471,0.000094299336,0.00003429091,0.000009256529,0.000021861604,0.99943084,0.000065438646,0.00017726579],"genre_scores_gemma":[0.0038050653,0.00007838358,0.0012466285,0.0002553593,0.000035823054,0.0007574174,0.9915109,0.00020268487,0.0021077914],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9989957,0.00015994198,0.00018101673,0.0003696719,0.00013755236,0.00015611554],"domain_scores_gemma":[0.9913195,0.0053218445,0.0008779303,0.0010659139,0.000945189,0.0004696545],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018100361,0.0012449482,0.0015384934,0.0018120238,0.0011532898,0.0019735217,0.002470413,0.0017450035,0.5707486],"category_scores_gemma":[0.020767367,0.0007183922,0.0012384952,0.003637305,0.00034625808,0.0012967804,0.0013442764,0.0013045849,0.08241088],"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.00033804355,0.0000640722,0.0075058844,0.0022203461,0.00013099117,0.00009000016,0.0000703419,0.00042113493,0.00016791296,0.00066782156,0.98356134,0.0047621117],"study_design_scores_gemma":[0.006954638,0.00030475177,0.07677321,0.0040175267,0.0006037804,0.0010638089,0.00051329995,0.0022988245,0.0010395941,0.00949448,0.896733,0.00020309056],"about_ca_topic_score_codex":0.013943971,"about_ca_topic_score_gemma":0.02852942,"teacher_disagreement_score":0.5707486,"about_ca_system_score_codex":0.0012208847,"about_ca_system_score_gemma":0.0021909433,"threshold_uncertainty_score":0.612275},"labels":[],"label_agreement":null},{"id":"W6979811480","doi":"","title":"AI in the accounting curriculum","year":2023,"lang":"en","type":"article","venue":"Research Portal (Queen's University Belfast)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Curriculum; Audit; Process (computing); Work (physics); Component (thermodynamics)","score_opus":0.019298241744720602,"score_gpt":0.28975764114001645,"score_spread":0.27045939939529584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6979811480","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008088446,0.019915458,0.008014797,0.12615275,0.0038717198,0.00003548261,0.0001851445,0.0001900107,0.8335462],"genre_scores_gemma":[0.2561833,0.024724262,0.008118751,0.008931768,0.0033840216,0.00007143826,0.00035645632,0.00018882405,0.69804114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974866,0.0009538241,0.000098225595,0.000228284,0.00085127034,0.00038179953],"domain_scores_gemma":[0.99302036,0.002252658,0.00024822154,0.0004885468,0.0014679967,0.0025222416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038912816,0.00036240104,0.00039463618,0.001655509,0.0034408348,0.009310171,0.000912189,0.0019180495,0.062484864],"category_scores_gemma":[0.00994021,0.00032732144,0.00021590495,0.0026235774,0.0031375727,0.004750436,0.002506027,0.004201013,0.012382035],"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.000036507037,0.00013144108,0.0013056372,0.00019708491,0.0000062629088,0.000045872384,0.0011283379,0.0008937779,0.00020299695,0.5574735,0.26059073,0.17798786],"study_design_scores_gemma":[0.0000058840606,0.00002057809,0.0012197564,0.00028789602,0.0000035377484,0.000043820914,0.0011487781,0.0009412482,0.00017591094,0.22291183,0.77323186,0.000008795908],"about_ca_topic_score_codex":0.012059584,"about_ca_topic_score_gemma":0.019015128,"teacher_disagreement_score":0.062484864,"about_ca_system_score_codex":0.008777159,"about_ca_system_score_gemma":0.015847703,"threshold_uncertainty_score":0.20903265},"labels":[],"label_agreement":null},{"id":"W6981697561","doi":"","title":"Eventually nonnegative matrices.","year":2001,"lang":"en","type":"dissertation","venue":"oURspace (University of Regina)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"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; University of Regina","keywords":"Nucleofection; Gestational period; TSG101; Dysgeusia; Liquation; Diafiltration; Emperipolesis; Triacetin; Demotion","score_opus":0.007298809820508351,"score_gpt":0.20924788895989188,"score_spread":0.20194907913938354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6981697561","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076695435,0.008512519,0.41815868,0.004168313,0.0017979331,0.00010736989,0.0017495038,0.0010199589,0.48779026],"genre_scores_gemma":[0.690222,0.004963076,0.06251577,0.0015940239,0.0010979549,0.00017968092,0.0019793783,0.0006018411,0.23684622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995296,0.00009245017,0.000017933071,0.00012980023,0.00014180323,0.00008840573],"domain_scores_gemma":[0.9991683,0.00025817574,0.00009109953,0.000119475895,0.00022005977,0.00014283079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004901079,0.0012554366,0.0005166528,0.00096391555,0.0008046324,0.0019802726,0.0005046716,0.00063950766,0.018231116],"category_scores_gemma":[0.0027592068,0.0002845646,0.00040526324,0.0007985172,0.0013856495,0.0021068589,0.0014004576,0.0018372255,0.0051421085],"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.00006176513,0.000022332377,0.00027315703,0.000106005675,0.000013515412,0.00008836511,0.00016952571,0.0018368327,0.0028057424,0.9385334,0.023944002,0.03214522],"study_design_scores_gemma":[0.000012441483,0.000029561894,0.00033851695,0.000041073832,0.000010696913,0.00021148576,0.00008165493,0.009588766,0.0022212777,0.9543991,0.03305055,0.000014827419],"about_ca_topic_score_codex":0.00077994855,"about_ca_topic_score_gemma":0.001340434,"teacher_disagreement_score":0.018231116,"about_ca_system_score_codex":0.00068504957,"about_ca_system_score_gemma":0.0005467591,"threshold_uncertainty_score":0.0609892},"labels":[],"label_agreement":null},{"id":"W6990359474","doi":"","title":"Determination of Q8 in chiral limit","year":2001,"lang":"en","type":"article","venue":"ScholarWorks@UMassAmherst (University of Massachusetts Amherst)","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":"Natural Sciences and Engineering Research Council of Canada; TRIUMF; National Science Foundation","keywords":"Limit (mathematics); Dimension (graph theory); Matrix (chemical analysis); Matching (statistics); Operator matrix; Measure (data warehouse); Scheme (mathematics); Loop (graph theory)","score_opus":0.01439537542141919,"score_gpt":0.21289916525979113,"score_spread":0.19850378983837194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6990359474","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57817346,0.00073825545,0.34000292,0.001543977,0.00010874725,0.00007886106,0.00022150073,0.0011433394,0.07798897],"genre_scores_gemma":[0.9151336,0.00028121154,0.08140266,0.00017604533,0.000020064277,0.00006633337,0.0000664275,0.00027909156,0.002574526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992557,0.00022587505,0.00004084415,0.000111686655,0.0002598891,0.00010591458],"domain_scores_gemma":[0.99800414,0.0008836603,0.00024160762,0.0003628188,0.0003424358,0.00016538314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020784985,0.00074880966,0.0006752541,0.001554268,0.0016995037,0.0016037723,0.0020065524,0.00085566664,0.0026791785],"category_scores_gemma":[0.008097176,0.00037976287,0.0003019149,0.00090496696,0.0017802167,0.0020210585,0.0020113087,0.0013661569,0.00066518673],"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.00029967935,0.0001179793,0.0059965914,0.00034480795,0.000051037197,0.0016742971,0.0010712537,0.07425719,0.040750932,0.8350269,0.0014546462,0.03895464],"study_design_scores_gemma":[0.00006257585,0.00004894707,0.0014239575,0.00018082744,0.000034587636,0.0005008501,0.00039079876,0.5812388,0.046743188,0.36593434,0.003359862,0.000081315564],"about_ca_topic_score_codex":0.0023385754,"about_ca_topic_score_gemma":0.0031522466,"teacher_disagreement_score":0.0026791785,"about_ca_system_score_codex":0.0008609257,"about_ca_system_score_gemma":0.0010140486,"threshold_uncertainty_score":0.010992289},"labels":[],"label_agreement":null},{"id":"W6996590684","doi":"","title":"Simultaneous refinements with complex compositional constraints - examples of singular value decomposition to diagnose poor matrix conditioning","year":2007,"lang":"en","type":"article","venue":"NPARC","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":true,"route_about_ca":false,"ca_institutions":"","funders":"Brookhaven National Laboratory; Basic Energy Sciences; Ministère de la Défense Nationale; State University of New York; U.S. Department of Energy","keywords":"Singular value decomposition; Matrix (chemical analysis); Decomposition; Least-squares function approximation; Diffraction; Conditioning; Matrix decomposition","score_opus":0.01299698710581198,"score_gpt":0.28629143882007246,"score_spread":0.2732944517142605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6996590684","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041040916,0.00021097502,0.9563386,0.00023687666,0.000025893869,0.0000540542,0.0000740121,0.0005341663,0.0014845809],"genre_scores_gemma":[0.31391,0.0001613304,0.68444896,0.00007796341,0.000029989456,0.00006777494,0.00021867528,0.00019296921,0.00089239754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984372,0.00050014345,0.00011046317,0.00025968265,0.0005828902,0.00010966993],"domain_scores_gemma":[0.9906529,0.00554207,0.001011861,0.0013685637,0.001198894,0.00022577694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027748684,0.001323374,0.00089455344,0.0017693049,0.0007309473,0.0010210294,0.0010725316,0.00093226513,0.0023551334],"category_scores_gemma":[0.016241767,0.000646272,0.0006634191,0.0017752816,0.0019667158,0.0018786615,0.001730863,0.0013283519,0.00040328043],"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.00063929154,0.000215718,0.01120632,0.0005057285,0.0001676889,0.0011559075,0.0014398239,0.3277653,0.057494294,0.11371798,0.005167138,0.4805248],"study_design_scores_gemma":[0.000032638287,0.00007027035,0.00089249946,0.000028309403,0.000020297643,0.0002404425,0.0001526909,0.9149621,0.01402424,0.06752284,0.00202055,0.00003315258],"about_ca_topic_score_codex":0.0026609278,"about_ca_topic_score_gemma":0.0048107887,"teacher_disagreement_score":0.0027748684,"about_ca_system_score_codex":0.00038779466,"about_ca_system_score_gemma":0.00083376485,"threshold_uncertainty_score":0.014675081},"labels":[],"label_agreement":null},{"id":"W7015979660","doi":"","title":"Utilisation de la compression low-rank pour réduire la complexité des solveurs creux parallèles basés sur des techniques de factorisation directes.","year":2018,"lang":"en","type":"article","venue":"theses.fr (ABES)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Transition time; Convergence (economics); Profit margin","score_opus":0.03592710329468681,"score_gpt":0.2964698481672653,"score_spread":0.2605427448725785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7015979660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016960578,0.0013077845,0.97141784,0.00034098324,0.000143148,0.00011938959,0.00013306277,0.0024006513,0.0071766004],"genre_scores_gemma":[0.1627001,0.0015952558,0.82105,0.00026692078,0.00014091273,0.00027871056,0.00073832006,0.00076166895,0.012468203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990275,0.00016271426,0.000058819634,0.000115745155,0.0005459391,0.00008934493],"domain_scores_gemma":[0.9976464,0.0009016692,0.00020800745,0.0004732555,0.000683404,0.000087318505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084789813,0.0015107263,0.00087531423,0.0009088646,0.00062401965,0.0016592038,0.0010015124,0.0011091226,0.008230476],"category_scores_gemma":[0.0043259943,0.00052202126,0.000839834,0.0009947128,0.00085580815,0.0017718965,0.0012332111,0.0019621686,0.0031161548],"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.00067512813,0.00026744205,0.002264235,0.0013948309,0.00022145627,0.0005834178,0.00074309047,0.19510677,0.11086006,0.034323428,0.012963752,0.6405964],"study_design_scores_gemma":[0.00018292495,0.00050970854,0.0011161623,0.00016228677,0.000095429954,0.00075988367,0.0002273073,0.8476094,0.0874174,0.0147578325,0.04706525,0.00009641012],"about_ca_topic_score_codex":0.0042678756,"about_ca_topic_score_gemma":0.0094039375,"teacher_disagreement_score":0.008230476,"about_ca_system_score_codex":0.0005234086,"about_ca_system_score_gemma":0.0016840661,"threshold_uncertainty_score":0.02753371},"labels":[],"label_agreement":null},{"id":"W7021324326","doi":"","title":"A note on the fixed-point iteration for the matrix equations $X\\pm A^*X^{-1}A=I$","year":2008,"lang":"en","type":"article","venue":"oURspace (University of Regina)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"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","keywords":"Hermitian matrix; Convergence (economics); Matrix (chemical analysis); Simple (philosophy); Positive-definite matrix; Iterative method; Symmetric matrix","score_opus":0.01960323287930384,"score_gpt":0.22676648134498584,"score_spread":0.207163248465682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7021324326","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059849573,0.0053399326,0.9278626,0.0059227883,0.0063415268,0.00007645982,0.00016851902,0.0003554415,0.047947716],"genre_scores_gemma":[0.17546181,0.0073177414,0.7112615,0.0039844457,0.006703166,0.00050544133,0.00040923024,0.001726563,0.09263014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988707,0.0005531698,0.00006122031,0.00016722876,0.0002914489,0.00005619563],"domain_scores_gemma":[0.9980762,0.0012565439,0.0000705876,0.00025999805,0.00022886247,0.00010779328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035861982,0.0017100272,0.0016616825,0.0015809903,0.0012052056,0.0017463546,0.0031795232,0.0023155194,0.009009178],"category_scores_gemma":[0.00790049,0.0006276521,0.0027823073,0.0013953409,0.0046192985,0.004080666,0.0032296786,0.007081124,0.0027068947],"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.00006515361,0.000021459353,0.00010629186,0.00013897356,0.00004624553,0.00012561155,0.00012627745,0.007677178,0.0010435081,0.96040815,0.010791013,0.019450279],"study_design_scores_gemma":[0.000033419063,0.000060458504,0.00015701991,0.000085074884,0.000030309317,0.00010717307,0.00002840313,0.085566826,0.00089655793,0.88403517,0.02893723,0.000062350475],"about_ca_topic_score_codex":0.0033023816,"about_ca_topic_score_gemma":0.0040759384,"teacher_disagreement_score":0.009009178,"about_ca_system_score_codex":0.001143607,"about_ca_system_score_gemma":0.0010060846,"threshold_uncertainty_score":0.030138731},"labels":[],"label_agreement":null},{"id":"W7025291166","doi":"","title":"WEST FRASER TO SELL TWO PULP MILLS IN WESTERN CANADA TO ATLAS HOLDINGS","year":2023,"lang":"en","type":"other","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Atlas (anatomy); Pulp (tooth); West virginia","score_opus":0.009055757906131098,"score_gpt":0.23854261687566575,"score_spread":0.22948685896953464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025291166","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0126655,0.00068903726,0.00096239836,0.0045661265,0.00123803,0.0001524719,0.0022334883,0.00073140947,0.9767616],"genre_scores_gemma":[0.0044764504,0.00009764983,0.00016198625,0.00014876493,0.000015581772,0.000004765906,0.00022023133,0.000060800132,0.9948138],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992544,0.000013899272,0.000006883514,0.000085897285,0.00031082222,0.0003281203],"domain_scores_gemma":[0.99871194,0.0000362077,0.000015179012,0.000045867077,0.0005926221,0.000598241],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00039050594,0.00069316797,0.00047658762,0.0014678843,0.011080387,0.0048258244,0.0011054345,0.0018190908,0.48232374],"category_scores_gemma":[0.0007856955,0.00047660698,0.00057991676,0.0015831882,0.0010005963,0.0011690747,0.0015702829,0.0019584033,0.119644776],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018517631,0.00014651738,0.0032471926,0.000055797816,0.00001368616,0.0005718924,0.0004938892,0.00031471127,0.0015456426,0.014926699,0.91365296,0.06484569],"study_design_scores_gemma":[0.000019014002,0.000037108406,0.0042926227,0.00003354531,0.000007386805,0.00007699651,0.0014785529,0.00024138714,0.00075065345,0.0008407814,0.9922036,0.000018360448],"about_ca_topic_score_codex":0.84339744,"about_ca_topic_score_gemma":0.9711251,"teacher_disagreement_score":0.51767623,"about_ca_system_score_codex":0.012762863,"about_ca_system_score_gemma":0.028382726,"threshold_uncertainty_score":0.73840237},"labels":[],"label_agreement":null},{"id":"W7028740907","doi":"","title":"Fusions of association schemes","year":2023,"lang":"en","type":"dissertation","venue":"oURspace (University of Regina)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nucleofection; Gestational period; TSG101; Dysgeusia; Liquation; Diafiltration; Triacetin; Emperipolesis; Demotion","score_opus":0.009010465341307613,"score_gpt":0.21697938257203095,"score_spread":0.20796891723072333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7028740907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10069857,0.0021778932,0.82871467,0.0012985771,0.0004778392,0.00018702942,0.0006118106,0.0009678177,0.06486582],"genre_scores_gemma":[0.8301446,0.0014284126,0.13827527,0.00033700332,0.0004983085,0.00015293233,0.0009123873,0.00024216603,0.02800887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953068,0.0016201669,0.0002796869,0.0008720666,0.0012592159,0.0006620965],"domain_scores_gemma":[0.99044245,0.0028629922,0.00053562975,0.0042024865,0.0014920521,0.00046428642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004044613,0.0005245598,0.0010925689,0.0017704571,0.0015842762,0.0034839276,0.001274705,0.0011649522,0.010656909],"category_scores_gemma":[0.013101552,0.0005293543,0.0009935119,0.0022045267,0.002028553,0.0059355637,0.006133221,0.0021353615,0.0038408192],"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.0003136627,0.000054407315,0.0007205685,0.000076127195,0.000040964824,0.000085548774,0.0003112311,0.0094462065,0.003500442,0.90155685,0.004704723,0.07918927],"study_design_scores_gemma":[0.000044129123,0.00012879219,0.00046250608,0.0000633221,0.000049730064,0.0002733305,0.0001247309,0.07792795,0.0041081924,0.8946378,0.022148624,0.000030864878],"about_ca_topic_score_codex":0.00058641174,"about_ca_topic_score_gemma":0.00041842958,"teacher_disagreement_score":0.010656909,"about_ca_system_score_codex":0.0011687207,"about_ca_system_score_gemma":0.00094337604,"threshold_uncertainty_score":0.03565097},"labels":[],"label_agreement":null},{"id":"W7040166140","doi":"","title":"Toronto plumber","year":2022,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Service (business); Work (physics); Placemaking; Port (circuit theory); Mistake","score_opus":0.004487584338487669,"score_gpt":0.18223786100789705,"score_spread":0.17775027666940937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7040166140","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015161071,0.0015088437,0.005752063,0.0024970185,0.0008803518,0.00012828695,0.038512215,0.01115117,0.9380539],"genre_scores_gemma":[0.007718923,0.0014234826,0.0037646717,0.0005343204,0.00021162983,0.000071530965,0.025233287,0.0047076726,0.9563344],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988041,0.0000646394,0.00003708019,0.0002318562,0.0006857916,0.00017656277],"domain_scores_gemma":[0.9964791,0.00019890985,0.00009520609,0.00052871165,0.0016676157,0.0010305573],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000646369,0.0014196802,0.0009912631,0.0020682546,0.003928268,0.005526426,0.0017619703,0.0016924273,0.7226973],"category_scores_gemma":[0.0029665923,0.0010051185,0.0005471605,0.0037832912,0.0010661996,0.0030860838,0.003558322,0.0014921466,0.5185179],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028662032,0.000007575556,0.00018141344,0.00007814022,0.0000026192386,0.000039162605,0.00008678169,0.00011086821,0.00021554045,0.003823717,0.9699461,0.025479326],"study_design_scores_gemma":[0.0000052128935,0.0000045103116,0.00040529022,0.000031499017,0.0000018323233,0.00003034048,0.00007360186,0.00018859477,0.00019307436,0.0008060397,0.9982514,0.000008649032],"about_ca_topic_score_codex":0.34615296,"about_ca_topic_score_gemma":0.62443,"teacher_disagreement_score":0.7226973,"about_ca_system_score_codex":0.008266026,"about_ca_system_score_gemma":0.012149235,"threshold_uncertainty_score":0.6882763},"labels":[],"label_agreement":null},{"id":"W7084088487","doi":"10.52843/cassyni.c6ycg9","title":"Turbulent heating of the solar corona and acceleration of the solar wind: Insights, theory, and modeling from NASA Parker Solar Probe and ESA Solar Orbiter missions","year":2024,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Orbiter; Solar wind; Corona (planetary geology); Coronal mass ejection; Interplanetary magnetic field; Nanoflares; Magnetopause; Solar System; Magnetohydrodynamic turbulence; Solar radius","score_opus":0.01783552404845509,"score_gpt":0.23884662690883687,"score_spread":0.22101110286038178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084088487","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7931065,0.05054208,0.05510773,0.0056368937,0.00067059597,0.00019547075,0.0015608488,0.0009326353,0.09224729],"genre_scores_gemma":[0.98116505,0.01029751,0.0033535522,0.00027604552,0.00037139366,0.00008163744,0.0004476273,0.00012315123,0.0038840794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998778,0.000023540413,0.0000071879017,0.000021044818,0.000040940067,0.000029558609],"domain_scores_gemma":[0.99976486,0.00009810054,0.000042733293,0.000016287839,0.00003879502,0.00003914358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040456478,0.0012554486,0.000790905,0.0008411899,0.00071284326,0.001360527,0.0013434477,0.0013348236,0.0012198619],"category_scores_gemma":[0.0008658214,0.0006384782,0.0011371862,0.000926496,0.0010642882,0.0017221154,0.0010822888,0.0011042278,0.00025408273],"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.000101499645,0.00021414443,0.009559448,0.0002664842,0.000070675684,0.00047175985,0.0003875019,0.9021732,0.0020805213,0.06667273,0.0041558617,0.01384611],"study_design_scores_gemma":[0.000031594845,0.000032416756,0.00491929,0.000039062532,0.00001536612,0.000049845567,0.00005309409,0.9761598,0.00015477388,0.016684817,0.001827053,0.000032838565],"about_ca_topic_score_codex":0.0134437485,"about_ca_topic_score_gemma":0.0049013086,"teacher_disagreement_score":0.0134437485,"about_ca_system_score_codex":0.0014022413,"about_ca_system_score_gemma":0.0006420528,"threshold_uncertainty_score":0.026730955},"labels":[],"label_agreement":null},{"id":"W7084590993","doi":"10.5281/zenodo.17260337","title":"Colonialism on Trial: Belonging, Adoption, and the Battle for Sovereignty","year":2025,"lang":"en","type":"book","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Sovereignty; Indigenous; Colonialism; Aotearoa; Indigenous rights; Prerogative; Politics; Self-determination; Battle","score_opus":0.021209393687371778,"score_gpt":0.24227534324511107,"score_spread":0.22106594955773928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084590993","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07348717,0.0257558,0.005223521,0.09442166,0.002880286,0.0000424155,0.000011191949,0.000034790624,0.79814315],"genre_scores_gemma":[0.90116537,0.009819232,0.00076138315,0.00898433,0.0012826751,0.000047635847,0.000012253303,0.00005581424,0.077871345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99509937,0.0028826804,0.00011737552,0.00027068434,0.0008013932,0.0008285683],"domain_scores_gemma":[0.9968651,0.001969095,0.0002593435,0.0002480824,0.00027714757,0.00038132808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003439351,0.00030838008,0.0004504528,0.0005039496,0.009268779,0.009431526,0.0007952406,0.0025919345,0.0027744542],"category_scores_gemma":[0.00835568,0.00016400771,0.0002567444,0.0008746973,0.039728545,0.009233057,0.006051941,0.0067483895,0.00032928892],"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.000009618023,0.000012473954,0.00023338987,0.000026033033,0.0000015871667,0.00016837896,0.05165238,0.00003289387,0.00005730209,0.9313619,0.007478629,0.008965493],"study_design_scores_gemma":[0.000020318937,0.00005764105,0.0012267393,0.00064951903,0.000010249921,0.0004581584,0.058083776,0.00022824954,0.0002049865,0.33136463,0.6076688,0.00002685089],"about_ca_topic_score_codex":0.009835933,"about_ca_topic_score_gemma":0.012103737,"teacher_disagreement_score":0.009835933,"about_ca_system_score_codex":0.004202086,"about_ca_system_score_gemma":0.0043793395,"threshold_uncertainty_score":0.030488372},"labels":[],"label_agreement":null},{"id":"W7095504843","doi":"","title":"Published by Canadian Center of Science and Education On the D-Stability Criterion of Matrices","year":2016,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Eigenvalues and eigenvectors; Simple (philosophy); Polynomial; Characteristic polynomial; Center (category theory); Stability (learning theory); Quadratic equation; Algebra over a field","score_opus":0.008815185651225776,"score_gpt":0.2256210537408065,"score_spread":0.21680586808958072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095504843","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020937857,0.0043070056,0.014072464,0.018038036,0.0051090987,0.00016227616,0.008737705,0.0008496098,0.94663],"genre_scores_gemma":[0.03879656,0.0067336513,0.011812118,0.0015725775,0.00039528206,0.00008428048,0.0037908698,0.00046423188,0.9363504],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856216,0.000060436138,0.00007024085,0.00018949501,0.0009418913,0.00017570627],"domain_scores_gemma":[0.992573,0.0004793504,0.00014970418,0.00065154856,0.005656446,0.0004898678],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014716927,0.0008208448,0.0014411412,0.00370153,0.004626175,0.0065373043,0.0015016799,0.002198006,0.32825828],"category_scores_gemma":[0.0053059952,0.00053468294,0.00053108553,0.005453197,0.002229379,0.0015791925,0.0018897428,0.0014067368,0.06985911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036095982,0.000027526292,0.0009086662,0.00023627497,0.000012538651,0.00017500638,0.00014406482,0.0026432725,0.0008343656,0.1732333,0.7055453,0.116203494],"study_design_scores_gemma":[0.00000849412,0.0000063399375,0.000729546,0.00014515329,0.000006754379,0.000057900157,0.00009594842,0.003537024,0.00046817193,0.011865892,0.9830551,0.000023709545],"about_ca_topic_score_codex":0.7145267,"about_ca_topic_score_gemma":0.7976796,"teacher_disagreement_score":0.7145267,"about_ca_system_score_codex":0.017668232,"about_ca_system_score_gemma":0.055325516,"threshold_uncertainty_score":0.958158},"labels":[],"label_agreement":null},{"id":"W7096872137","doi":"","title":"Coupling mumps and ordering software","year":2002,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Software; Context (archaeology); Coupling (piping); Scalability; Work (physics); Computer software","score_opus":0.016617174921294626,"score_gpt":0.21262011256189572,"score_spread":0.1960029376406011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096872137","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03585493,0.00027206197,0.95375955,0.00016625595,0.00006684105,0.000111916466,0.00013477488,0.0032230865,0.006410619],"genre_scores_gemma":[0.3154486,0.0003735102,0.6755262,0.00015420196,0.000096847914,0.00024140286,0.0005711834,0.0015117349,0.0060763904],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99694735,0.0012265344,0.00015303712,0.0004358645,0.00085113884,0.0003860301],"domain_scores_gemma":[0.9925964,0.004216237,0.00025287096,0.001965886,0.0007607622,0.00020781842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019315318,0.0011812403,0.0009642458,0.0013706444,0.0008255725,0.0014548046,0.0016774246,0.0008080205,0.009788654],"category_scores_gemma":[0.014397315,0.0006962665,0.0008654403,0.0025696224,0.0010746624,0.001910175,0.0030590352,0.0010315615,0.002165049],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064788986,0.00016981765,0.0024502217,0.00067744695,0.0001676052,0.00034587868,0.0007836212,0.36799815,0.02653429,0.09455507,0.010050234,0.49561974],"study_design_scores_gemma":[0.00009212944,0.00023678552,0.00071372295,0.00003812726,0.00006723603,0.00028180427,0.00018331915,0.87031984,0.028846245,0.0781938,0.020970868,0.00005620149],"about_ca_topic_score_codex":0.007179519,"about_ca_topic_score_gemma":0.007972529,"teacher_disagreement_score":0.009788654,"about_ca_system_score_codex":0.0012816626,"about_ca_system_score_gemma":0.0020296266,"threshold_uncertainty_score":0.032746315},"labels":[],"label_agreement":null},{"id":"W7097725843","doi":"","title":"Ill-Conditioned Inclusions","year":2000,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Invertible matrix; Square matrix; Norm (philosophy); Matrix (chemical analysis); Inverse; Linear system; Regular polygon; Operator norm; Linear equation","score_opus":0.007412161566838158,"score_gpt":0.23231801968567745,"score_spread":0.22490585811883929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097725843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14528342,0.00072434364,0.82349247,0.0014523822,0.00022226892,0.000111678804,0.00045941625,0.00039366126,0.027860405],"genre_scores_gemma":[0.8727905,0.00051248574,0.10826477,0.00070691033,0.00041807845,0.00022172916,0.0007514694,0.00018818771,0.016145915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966137,0.0006971704,0.00018436313,0.0007396137,0.0014968483,0.00026828618],"domain_scores_gemma":[0.98830533,0.006542744,0.0015892789,0.001054875,0.0018213374,0.0006863849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002243027,0.0006858511,0.00077641953,0.00084303104,0.0010341558,0.0019647016,0.00090799603,0.001346338,0.005395117],"category_scores_gemma":[0.01487029,0.00050602877,0.00060650794,0.00049818505,0.004854203,0.003472299,0.0038519094,0.0027512384,0.0005762036],"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.00015113289,0.000055159806,0.0023745159,0.00020004142,0.000048173628,0.00062071887,0.0008015309,0.095590375,0.0074404124,0.867669,0.0035251875,0.02152386],"study_design_scores_gemma":[0.000018325627,0.000047436333,0.0006172184,0.000031335207,0.000011362277,0.0002249893,0.00015302374,0.4897507,0.003722884,0.50003666,0.005357975,0.000028171271],"about_ca_topic_score_codex":0.0017136257,"about_ca_topic_score_gemma":0.001038773,"teacher_disagreement_score":0.005395117,"about_ca_system_score_codex":0.0010370086,"about_ca_system_score_gemma":0.0010271354,"threshold_uncertainty_score":0.018048465},"labels":[],"label_agreement":null},{"id":"W7100322114","doi":"","title":"Title: Convergence of theta-method for time-variable equations Associated People:","year":2013,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Eigenvalues and eigenvectors; Convergence (economics); Sequence (biology); Generalization; Monotone polygon; Stability (learning theory); Matrix (chemical analysis); Scalar (mathematics)","score_opus":0.0119102871411393,"score_gpt":0.25989725378831235,"score_spread":0.24798696664717307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100322114","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058411334,0.00494523,0.89582783,0.0019380656,0.0033296815,0.00016540366,0.00021302594,0.00028924458,0.034880165],"genre_scores_gemma":[0.5895808,0.0063597,0.28121805,0.0006315503,0.0021597364,0.0007554531,0.0006401952,0.00096828665,0.11768619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996662,0.00015390824,0.000013766536,0.00005513982,0.0000873015,0.000023522101],"domain_scores_gemma":[0.9983736,0.0009332668,0.000103624,0.00006596743,0.0004165197,0.000106928775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016757654,0.0007318618,0.0005852699,0.00075099064,0.0004055011,0.0009274883,0.0008265411,0.0007634251,0.007380651],"category_scores_gemma":[0.0057935165,0.00013017276,0.0006550543,0.0004653204,0.0012793904,0.0011800526,0.0010935069,0.001400789,0.0013098845],"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.0006633412,0.00015418605,0.0046272674,0.0016992191,0.00016902611,0.00049992744,0.0007851944,0.23978205,0.012246332,0.6011813,0.022522926,0.1156692],"study_design_scores_gemma":[0.00002173793,0.00010397284,0.00049623766,0.000096523,0.000017431155,0.00012369697,0.000049195143,0.92636913,0.0020890047,0.060194403,0.01041633,0.000022321063],"about_ca_topic_score_codex":0.0016239625,"about_ca_topic_score_gemma":0.0009908576,"teacher_disagreement_score":0.007380651,"about_ca_system_score_codex":0.000580514,"about_ca_system_score_gemma":0.00074454927,"threshold_uncertainty_score":0.024690807},"labels":[],"label_agreement":null},{"id":"W7106672003","doi":"10.1139/cjp-2025-0267","title":"Introduction to the symplectic group Sp(2)","year":2025,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Symplectic geometry; Symplectic matrix; Symplectic group; Moment map; Symplectic representation; Symplectomorphism; Symplectic manifold; Symplectic vector space","score_opus":0.006526473762330338,"score_gpt":0.21068158163727257,"score_spread":0.20415510787494223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106672003","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025933197,0.051100735,0.6121715,0.021460714,0.015143197,0.00018081578,0.0013669952,0.0006319176,0.27201095],"genre_scores_gemma":[0.5020465,0.054602053,0.3309713,0.009330027,0.02275337,0.00044940726,0.0014533326,0.0006091827,0.07778475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995402,0.00012996935,0.000028646862,0.00010874673,0.00015379304,0.000038621132],"domain_scores_gemma":[0.9993691,0.0002875791,0.00005707062,0.000077985984,0.00015534413,0.00005292283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066818856,0.0009360817,0.0004662399,0.001240481,0.0012316034,0.0010764283,0.00056874176,0.0011117555,0.01124251],"category_scores_gemma":[0.0016526711,0.00042888251,0.0006257941,0.0013631495,0.0032954721,0.002748529,0.0018935528,0.003975014,0.0022595418],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000099347935,0.000016380613,0.000198218,0.00017215368,0.0000073177976,0.00017223235,0.0004109472,0.00094986387,0.0010406473,0.9620181,0.012346978,0.022657173],"study_design_scores_gemma":[0.0000076139363,0.000057429806,0.00042007348,0.00010362188,0.000008451812,0.0007088375,0.00008782006,0.0031413604,0.00043535547,0.7111771,0.28383195,0.000020366702],"about_ca_topic_score_codex":0.0011268418,"about_ca_topic_score_gemma":0.0008582703,"teacher_disagreement_score":0.01124251,"about_ca_system_score_codex":0.0006857318,"about_ca_system_score_gemma":0.0005118313,"threshold_uncertainty_score":0.037609935},"labels":[],"label_agreement":null},{"id":"W7110124730","doi":"10.5539/jmr.v7n1p82","title":"On The D-Stability Criterion of Matrices","year":2015,"lang":"","type":"article","venue":"Journal of Mathematics Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Eigenvalues and eigenvectors; Simple (philosophy); Polynomial; Characteristic polynomial; Stability (learning theory); Matrix (chemical analysis); Quadratic equation; Set (abstract data type); Term (time)","score_opus":0.25947866561248906,"score_gpt":0.41995839066287194,"score_spread":0.16047972505038288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110124730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08799923,0.0012055704,0.8942382,0.00048027362,0.000052914133,0.00006255051,0.00011089285,0.00012681885,0.015723586],"genre_scores_gemma":[0.9244758,0.0009875095,0.065559566,0.00015614093,0.000103315215,0.00012601953,0.00020813479,0.00009087119,0.0082928315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996137,0.00010899686,0.000019403617,0.00010658584,0.0001102577,0.000041108295],"domain_scores_gemma":[0.99764663,0.0012277998,0.00023480887,0.000092490634,0.0006638128,0.00013440748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009540001,0.00067777955,0.000519837,0.0010580482,0.0005810659,0.0009676357,0.0005140589,0.0005943737,0.0026864468],"category_scores_gemma":[0.0038550983,0.0001904847,0.00037424042,0.0004977759,0.0010613161,0.0008272432,0.0012525903,0.0007716222,0.0006526535],"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.00018395002,0.000038918362,0.0020714486,0.00032713686,0.000073279894,0.0003378245,0.00045968185,0.24031119,0.0382807,0.66948265,0.0036500255,0.04478323],"study_design_scores_gemma":[0.000013828988,0.00010129867,0.00054886634,0.00003819672,0.000011102435,0.00011459447,0.000098352226,0.85411537,0.0047005154,0.13732935,0.0029063006,0.000022162314],"about_ca_topic_score_codex":0.0013755837,"about_ca_topic_score_gemma":0.00066479854,"teacher_disagreement_score":0.0026864468,"about_ca_system_score_codex":0.00072244176,"about_ca_system_score_gemma":0.00052511087,"threshold_uncertainty_score":0.008987069},"labels":[],"label_agreement":null},{"id":"W7110206746","doi":"10.5539/jmr.v7n1p97","title":"Bounds for the Perron Root of Irreducible Nonnegative Matrices","year":2015,"lang":"","type":"article","venue":"Journal of Mathematics Research","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Root (linguistics); Product (mathematics); Matrix (chemical analysis); Nonnegative matrix; Complex matrix","score_opus":0.2202481600372827,"score_gpt":0.4366317739400949,"score_spread":0.2163836139028122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110206746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036764808,0.0068599638,0.89325315,0.0029178082,0.0010579661,0.0000735454,0.00041940314,0.0007700109,0.057883266],"genre_scores_gemma":[0.67055386,0.007490455,0.28515968,0.0021644048,0.002065515,0.00056791806,0.00081385736,0.0010822394,0.0301021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976585,0.0007273283,0.00010827475,0.0004821658,0.0006681364,0.0003556034],"domain_scores_gemma":[0.9883973,0.0071794055,0.0007186831,0.0010865014,0.0017838312,0.0008341072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034408432,0.0025339276,0.0011978272,0.0037088557,0.0012476423,0.0022183731,0.002219472,0.0019128297,0.010915731],"category_scores_gemma":[0.022054695,0.0006215213,0.0014851056,0.0019104023,0.0039119446,0.0069581955,0.0032767665,0.0063515212,0.0043114154],"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.00017320979,0.000090960064,0.0010545441,0.00046744396,0.00006194673,0.00026650846,0.00045050986,0.02247792,0.009452597,0.91026556,0.012219891,0.043018933],"study_design_scores_gemma":[0.000016970016,0.000096996235,0.00089161075,0.00024112438,0.00006423275,0.00034211448,0.00013920263,0.1774106,0.0061912723,0.7985911,0.015893033,0.00012173342],"about_ca_topic_score_codex":0.000892938,"about_ca_topic_score_gemma":0.0015000419,"teacher_disagreement_score":0.010915731,"about_ca_system_score_codex":0.00185307,"about_ca_system_score_gemma":0.0010788105,"threshold_uncertainty_score":0.036516726},"labels":[],"label_agreement":null},{"id":"W7110882245","doi":"10.4995/agt.24202","title":"Simple polynomial equations over (2x2)-matrices","year":2025,"lang":"en","type":"article","venue":"Applied General Topology","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":"Nipissing University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polynomial; Simple (philosophy); Euclidean geometry; Matrix polynomial; Set (abstract data type); Identity (music); Square-free polynomial; Alternating polynomial","score_opus":0.009536382067077478,"score_gpt":0.27060297234662173,"score_spread":0.26106659027954426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110882245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4445646,0.00093375647,0.46169105,0.0023831804,0.0005039177,0.0001379212,0.0008963126,0.00031532047,0.08857379],"genre_scores_gemma":[0.8955419,0.00065939437,0.054039933,0.00028319494,0.0002749166,0.00008293251,0.0005105756,0.00013734224,0.048469804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996247,0.00006773247,0.000013395647,0.000074174364,0.00013215773,0.000087897104],"domain_scores_gemma":[0.99974877,0.00007535753,0.000059733193,0.000019700565,0.000056648172,0.000039862174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034939713,0.0008643302,0.00056557346,0.00059430825,0.00065827667,0.0009839536,0.0006975101,0.0008591008,0.00900157],"category_scores_gemma":[0.0010657167,0.0002490458,0.00067661365,0.00094942877,0.00096213596,0.0015146278,0.0012221023,0.0010773075,0.0012757235],"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.00006233032,0.000040120583,0.00047589,0.00013616933,0.000021482765,0.00038367705,0.0003389739,0.040316075,0.0054288744,0.9362845,0.0034234142,0.013088591],"study_design_scores_gemma":[0.00006691951,0.00010046335,0.0004404097,0.000019273093,0.000011290137,0.00031741298,0.000181004,0.17491755,0.0040970603,0.8064441,0.013361005,0.000043480246],"about_ca_topic_score_codex":0.0018960951,"about_ca_topic_score_gemma":0.002652425,"teacher_disagreement_score":0.00900157,"about_ca_system_score_codex":0.0006460586,"about_ca_system_score_gemma":0.00045789173,"threshold_uncertainty_score":0.03011328},"labels":[],"label_agreement":null},{"id":"W7115192394","doi":"10.1007/s40314-025-03536-w","title":"An algorithm for QR decomposition of split quaternion matrices","year":2025,"lang":"en","type":"article","venue":"Computational and Applied Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Fundo para o Desenvolvimento das Ciências e da Tecnologia; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"QR decomposition; Quaternion; Quaternion algebra; Matrix decomposition; Matrix (chemical analysis); Decomposition; Algebra over a field; Representation (politics)","score_opus":0.010064251417776,"score_gpt":0.2855866775048298,"score_spread":0.2755224260870538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115192394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012675957,0.000110159024,0.9964701,0.00006125248,0.00008997377,0.00004423951,0.00008459858,0.0007622413,0.0011099232],"genre_scores_gemma":[0.016859928,0.00015738337,0.9791291,0.00006838642,0.000054031083,0.000094021554,0.00036849108,0.00023283502,0.0030357973],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991887,0.0001549205,0.00006619858,0.00015219802,0.00035064534,0.000087225686],"domain_scores_gemma":[0.99874383,0.0002868655,0.000060694827,0.00026495373,0.00056417414,0.00007948854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079093775,0.0011839782,0.0010379431,0.0010336511,0.00060150906,0.0013552391,0.0012217573,0.0008234356,0.016379891],"category_scores_gemma":[0.003499113,0.00054687116,0.0008614291,0.0013405655,0.00056928524,0.0017626139,0.002155178,0.0018109661,0.009235054],"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.0003240464,0.0001238847,0.00036462507,0.00034849605,0.00008137189,0.00020556785,0.00026031752,0.0443769,0.024742326,0.10861527,0.025639318,0.79491776],"study_design_scores_gemma":[0.000281085,0.0003360131,0.000518335,0.00012467738,0.00006633612,0.00073651783,0.0002000167,0.76752204,0.02479589,0.13999029,0.06532807,0.00010074328],"about_ca_topic_score_codex":0.0019384172,"about_ca_topic_score_gemma":0.0028986093,"teacher_disagreement_score":0.016379891,"about_ca_system_score_codex":0.00044395632,"about_ca_system_score_gemma":0.0013291714,"threshold_uncertainty_score":0.05479622},"labels":[],"label_agreement":null},{"id":"W7118051212","doi":"","title":"At the intersection of Numerical Analysis and Spectral Geometry","year":2025,"lang":"","type":"article","venue":"ArXiv.org","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Discretization; Computation; Operator (biology); Eigenvalues and eigenvectors; Spectral method; Numerical analysis; Ideal (ethics); Spectral space; Domain (mathematical analysis)","score_opus":0.012260932233083811,"score_gpt":0.2535357477413916,"score_spread":0.2412748155083078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118051212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013616822,0.06571568,0.7633798,0.026296837,0.003405587,0.00004129549,0.0002025688,0.00053164695,0.12680973],"genre_scores_gemma":[0.57885724,0.09944268,0.26626483,0.008068063,0.015772648,0.00031261696,0.00040285318,0.0014121997,0.029466892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968892,0.0016212655,0.00011449047,0.00040384845,0.00082962256,0.00014166595],"domain_scores_gemma":[0.99244773,0.0059402133,0.0002399142,0.00073291396,0.00051603245,0.00012309769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00303528,0.00084602623,0.0010240956,0.001624032,0.0012929025,0.0050658737,0.0011993055,0.0021627583,0.005959085],"category_scores_gemma":[0.0114693325,0.0004844834,0.00084036874,0.0011872946,0.008755923,0.008456159,0.0019366662,0.0048403675,0.0017847916],"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.000004734282,0.0000054090715,0.000060718325,0.00010411508,0.00000631277,0.000013282865,0.00009629999,0.0032088275,0.00022071411,0.9874648,0.0020609165,0.006753945],"study_design_scores_gemma":[0.0000018255279,0.000006928985,0.00008030749,0.000061474726,0.0000021034652,0.000026388463,0.000049500835,0.0060787564,0.00016709065,0.9792525,0.014264924,0.000008288386],"about_ca_topic_score_codex":0.0008852105,"about_ca_topic_score_gemma":0.00052718987,"teacher_disagreement_score":0.005959085,"about_ca_system_score_codex":0.002067357,"about_ca_system_score_gemma":0.0010914749,"threshold_uncertainty_score":0.019935131},"labels":[],"label_agreement":null},{"id":"W7133095409","doi":"","title":"Distribution of Cokernels of (n+u) × n Matrices Over Zp and Expected Number of Fields Using Local Mass Formulas","year":2022,"lang":"","type":"dissertation","venue":"TSpace","topic":"Matrix Theory and Algorithms","field":"Computer Science","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 Toronto","funders":"","keywords":"Measure (data warehouse); Distribution (mathematics); Abelian group; Expected value; Probability distribution; Discriminant; Square (algebra); Finite field; Field (mathematics)","score_opus":0.014868448182082918,"score_gpt":0.3302090592587493,"score_spread":0.3153406110766664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133095409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9899809,0.00011981394,0.0076857586,0.00032253316,0.000009271913,0.000018801866,0.00042800602,0.000092882714,0.0013418942],"genre_scores_gemma":[0.99600357,0.00010142878,0.002160895,0.000024689938,0.000022636548,0.000029824045,0.00057591696,0.00002996774,0.0010510201],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890065,0.00023067743,0.00005021144,0.00036155153,0.00025772216,0.00019920449],"domain_scores_gemma":[0.96185017,0.028116407,0.004360688,0.0020206263,0.0015080478,0.0021441234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025315846,0.00028294924,0.00045513408,0.0018315582,0.00059115986,0.0019119967,0.0012587323,0.0007576773,0.0052308934],"category_scores_gemma":[0.024531575,0.00029475836,0.0003026645,0.0011971957,0.0015359136,0.0025319878,0.0007711278,0.00091452315,0.00040371856],"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.0024800734,0.00045225615,0.4840463,0.00029718914,0.00023202266,0.0014492624,0.0015815067,0.12386169,0.03270323,0.25938246,0.010506966,0.083007015],"study_design_scores_gemma":[0.00019284568,0.00084797456,0.21479388,0.0001248812,0.00011332889,0.003622952,0.0019082588,0.6083463,0.03653885,0.12945397,0.003811914,0.00024488894],"about_ca_topic_score_codex":0.00077001535,"about_ca_topic_score_gemma":0.0008704255,"teacher_disagreement_score":0.0052308934,"about_ca_system_score_codex":0.0011843848,"about_ca_system_score_gemma":0.00046499868,"threshold_uncertainty_score":0.01749909},"labels":[],"label_agreement":null},{"id":"W71359084","doi":"","title":"Matrices Associated to Biindexed Linear Recurrence Relations.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Recurrence relation; Pure mathematics; Combinatorics","score_opus":0.015792530427141505,"score_gpt":0.24541941866985925,"score_spread":0.22962688824271774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W71359084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118251204,0.004227089,0.69949293,0.001829466,0.0018360842,0.00025579284,0.002313265,0.0021495193,0.16964467],"genre_scores_gemma":[0.7066392,0.0020952835,0.18809187,0.00090369256,0.0011643983,0.0003472591,0.002614904,0.00075487845,0.09738849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878854,0.00026963145,0.00011333091,0.00022059439,0.00039636018,0.00021154697],"domain_scores_gemma":[0.9977742,0.0006935693,0.000490224,0.000317343,0.0005382407,0.00018649104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006390678,0.0006935856,0.00066280545,0.0024565158,0.0011441404,0.002887871,0.0011653012,0.00081541884,0.022143904],"category_scores_gemma":[0.005921557,0.00036970765,0.0005045232,0.0024631806,0.0011096965,0.0029072755,0.0014428358,0.0015646174,0.0069553894],"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.00005171473,0.00004578919,0.00038348182,0.00010974561,0.000015949468,0.00022771631,0.00026637697,0.0016766171,0.0030309625,0.95538163,0.00992451,0.028885538],"study_design_scores_gemma":[0.00001516818,0.00003275333,0.00029113243,0.00004197721,0.000013725045,0.00047392337,0.00010952379,0.018707393,0.0024835786,0.95580494,0.021989994,0.000035979258],"about_ca_topic_score_codex":0.000771742,"about_ca_topic_score_gemma":0.001755414,"teacher_disagreement_score":0.022143904,"about_ca_system_score_codex":0.00085044693,"about_ca_system_score_gemma":0.00056712056,"threshold_uncertainty_score":0.07407874},"labels":[],"label_agreement":null},{"id":"W7147678371","doi":"10.70675/261b7007z6e1cz4cb6z88e4zb94bee00d0cc","title":"Optimisations des solveurs linéaires creux hybrides basés sur une approche par complément de Schur et décomposition de domaine","year":2015,"lang":"","type":"dissertation","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"NP-complete; Context (archaeology); Agrégation","score_opus":0.03882868302634993,"score_gpt":0.3098988107006323,"score_spread":0.27107012767428235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7147678371","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040794615,0.00039959844,0.94995284,0.00021770134,0.00007787976,0.00006162507,0.000075691045,0.0008077069,0.0076123443],"genre_scores_gemma":[0.38668075,0.0004920633,0.5937988,0.00017750222,0.00007106494,0.00027785238,0.0002811067,0.0006688861,0.017551878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993418,0.00014308453,0.00003246046,0.00014125685,0.00024782013,0.00009364285],"domain_scores_gemma":[0.99917513,0.00038594176,0.00006273277,0.00014317788,0.00018251412,0.000050436483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008334237,0.0010918733,0.0010179543,0.00048437237,0.0005173701,0.0016032014,0.0009863973,0.0010555183,0.007918161],"category_scores_gemma":[0.001869656,0.00061163143,0.0011077436,0.00047312133,0.0009447181,0.0013479718,0.0018048742,0.0016364665,0.0011947539],"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.00035566752,0.00007631278,0.0010569656,0.00040645516,0.000104011386,0.0001850725,0.0003058603,0.8094841,0.033230737,0.042805493,0.002242595,0.109746724],"study_design_scores_gemma":[0.00003682503,0.00008980641,0.0002592303,0.000032812015,0.000022380244,0.000058117406,0.000072959825,0.97267115,0.010533583,0.010126006,0.006081328,0.000015897404],"about_ca_topic_score_codex":0.0042334064,"about_ca_topic_score_gemma":0.005633216,"teacher_disagreement_score":0.007918161,"about_ca_system_score_codex":0.0008427026,"about_ca_system_score_gemma":0.0013024948,"threshold_uncertainty_score":0.02648884},"labels":[],"label_agreement":null},{"id":"W7148712070","doi":"10.70675/f03dcd69za905z4dc5za2d4zd420c3f7370f","title":"On the use of low-rank arithmetic to reduce the complexity of parallel sparse linear solvers based on direct factorization techniques","year":2018,"lang":"","type":"dissertation","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Factorization; Convergence (economics); Compression (physics); Block (permutation group theory)","score_opus":0.08312594633962547,"score_gpt":0.29898670617400347,"score_spread":0.215860759834378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7148712070","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026563836,0.0020457818,0.95421064,0.0005277056,0.00014820625,0.00011249268,0.00009455666,0.0025366445,0.0137601625],"genre_scores_gemma":[0.24465564,0.0029668943,0.7356766,0.0004749261,0.00022818783,0.00022585219,0.00053016766,0.0006354011,0.014606405],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921465,0.00014818615,0.00004092555,0.000078239485,0.00042026836,0.00009763637],"domain_scores_gemma":[0.9984464,0.00064184587,0.0001197208,0.00035384795,0.00038565788,0.000052501087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006950615,0.0010201227,0.000709687,0.0008050926,0.0005559288,0.0013332233,0.00095660146,0.0006889077,0.005593841],"category_scores_gemma":[0.0033900894,0.00038545168,0.000705384,0.00096440926,0.00086616713,0.0018832701,0.001220776,0.0014086061,0.0022686925],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007287373,0.00027463466,0.0012888603,0.00079274364,0.0001285595,0.0003991601,0.000536871,0.18620947,0.078407735,0.069558956,0.013798958,0.6478753],"study_design_scores_gemma":[0.00012556204,0.0005515717,0.00058583455,0.00011145908,0.00006471003,0.00038950742,0.00011861724,0.8947419,0.05154118,0.0198107,0.03189259,0.00006636043],"about_ca_topic_score_codex":0.003325393,"about_ca_topic_score_gemma":0.0057982863,"teacher_disagreement_score":0.005593841,"about_ca_system_score_codex":0.00042475422,"about_ca_system_score_gemma":0.0013633644,"threshold_uncertainty_score":0.018713236},"labels":[],"label_agreement":null},{"id":"W7155750181","doi":"","title":"Can you use MINRES with an indefinite preconditioner ?","year":2013,"lang":"","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Preconditioner; Algebra over a field; Calculus (dental); Term (time); Domain (mathematical analysis)","score_opus":0.012710358409748075,"score_gpt":0.2151230126034376,"score_spread":0.20241265419368953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7155750181","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003914396,0.0010841317,0.951997,0.007681068,0.0017890332,0.00003465058,0.00027577011,0.007866541,0.025357502],"genre_scores_gemma":[0.073522605,0.0020765734,0.8450677,0.0034417664,0.0012113262,0.00013526026,0.0006000893,0.0076608527,0.06628381],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933213,0.0002532008,0.000029479688,0.0000939055,0.00022039474,0.000070921924],"domain_scores_gemma":[0.99880993,0.00047754886,0.00008635261,0.00026834712,0.00025338194,0.000104531704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001381539,0.0010527676,0.000987473,0.00043603525,0.0006518091,0.0014038928,0.000970637,0.0015679874,0.03477897],"category_scores_gemma":[0.005939197,0.00056733243,0.0008058213,0.0004333127,0.00080931734,0.002917131,0.0013145542,0.0022730583,0.018682603],"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.00078310654,0.00015640906,0.0010027192,0.0006204396,0.00018218778,0.0003720416,0.00027183074,0.01983364,0.014163955,0.16882211,0.23198745,0.5618042],"study_design_scores_gemma":[0.00026015213,0.00015792981,0.0006331552,0.00039682424,0.00008471515,0.00061914185,0.00023093593,0.17402144,0.028139995,0.39261076,0.40265328,0.00019170913],"about_ca_topic_score_codex":0.0017106753,"about_ca_topic_score_gemma":0.0031461287,"teacher_disagreement_score":0.03477897,"about_ca_system_score_codex":0.00030639992,"about_ca_system_score_gemma":0.00058134564,"threshold_uncertainty_score":0.11634731},"labels":[],"label_agreement":null},{"id":"W7161271820","doi":"10.1093/imanum/draf154","title":"A BFBt preconditioner for double saddle-point systems","year":2025,"lang":"en","type":"article","venue":"IMA Journal of Numerical Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Preconditioner; Schur complement; Discretization; Eigenvalues and eigenvectors; Block (permutation group theory); Diagonal; Linear system; Complement (music)","score_opus":0.011854088149386103,"score_gpt":0.2754643267287671,"score_spread":0.263610238579381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7161271820","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063203,0.00016330233,0.93052745,0.00036571047,0.00011800608,0.000057971585,0.000077245524,0.00040071222,0.005086678],"genre_scores_gemma":[0.5384827,0.00015847909,0.4526595,0.00016366373,0.000056718447,0.0001651142,0.00016708727,0.00021637305,0.007930342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997116,0.000110277964,0.000011356851,0.000020363472,0.00011462304,0.000031780866],"domain_scores_gemma":[0.99940264,0.00023154666,0.00005942693,0.00007966837,0.0001528611,0.00007389638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006648429,0.00038200137,0.00073189905,0.00023088197,0.00039100807,0.00041136766,0.0006582535,0.0009508667,0.0042387387],"category_scores_gemma":[0.0017306941,0.00022620498,0.00022531363,0.0002994373,0.00069539476,0.00055944023,0.0010221987,0.00089922576,0.0006832506],"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.00044867845,0.00011871784,0.0011810324,0.0001774243,0.000043021362,0.0002472764,0.00021650466,0.80394435,0.047856092,0.07969621,0.004350031,0.061720688],"study_design_scores_gemma":[0.0000168575,0.000023619827,0.00006282819,0.000005909706,0.0000014482606,0.000013733194,0.0000066896805,0.99463505,0.0017189921,0.002290095,0.0012205933,0.00000421243],"about_ca_topic_score_codex":0.0053567374,"about_ca_topic_score_gemma":0.004040729,"teacher_disagreement_score":0.0053567374,"about_ca_system_score_codex":0.00031260154,"about_ca_system_score_gemma":0.0009247957,"threshold_uncertainty_score":0.014179945},"labels":[],"label_agreement":null},{"id":"W77637676","doi":"","title":"Matrices with maximum exponent in the class of central symmetric primitive matrices.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Exponent; Class (philosophy); Combinatorics; Pure mathematics","score_opus":0.006770413602888647,"score_gpt":0.20700227964554374,"score_spread":0.20023186604265508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77637676","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6267286,0.0023466037,0.27105567,0.0027384427,0.0005094506,0.00013050513,0.00097468763,0.00087066623,0.09464532],"genre_scores_gemma":[0.9601337,0.00054073194,0.024238784,0.00025275073,0.00052795507,0.000057508954,0.00036820667,0.000116217045,0.013764286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936503,0.00013809055,0.000025909478,0.00011533837,0.00018734124,0.00016824661],"domain_scores_gemma":[0.9963225,0.0019802684,0.0004848131,0.0005099835,0.00032381728,0.0003786837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007042459,0.00050624827,0.0006257243,0.0011413678,0.0011797267,0.0023984804,0.00064910186,0.0008213964,0.009136643],"category_scores_gemma":[0.0070618424,0.00033702716,0.00029606887,0.00084004167,0.0017762082,0.0032715283,0.0016696149,0.0017906568,0.0019530691],"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.00043744082,0.00008264027,0.0016800401,0.00012536313,0.000018927056,0.0005112616,0.0003007962,0.0039076614,0.0071446695,0.9466311,0.009577817,0.02958234],"study_design_scores_gemma":[0.00006738029,0.000058036225,0.0007266563,0.000041500796,0.000010191509,0.00060342916,0.00010667799,0.019595342,0.0034770814,0.96874076,0.0065530175,0.000019922993],"about_ca_topic_score_codex":0.00034693297,"about_ca_topic_score_gemma":0.0005648914,"teacher_disagreement_score":0.009136643,"about_ca_system_score_codex":0.00050643604,"about_ca_system_score_gemma":0.00053606275,"threshold_uncertainty_score":0.030565143},"labels":[],"label_agreement":null},{"id":"W77664112","doi":"10.1016/j.laa.2013.12.037","title":"Positive semidefiniteness of a<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mn>3</mml:mn><mml:mo>×</mml:mo><mml:mn>3</mml:mn></mml:math>matrix related to partitioning","year":2014,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Algorithm","score_opus":0.011674699827945287,"score_gpt":0.2424910476912589,"score_spread":0.23081634786331362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77664112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100268684,0.0005298944,0.79644203,0.0026253825,0.00036576035,0.00014167096,0.0022192963,0.0007367981,0.09667041],"genre_scores_gemma":[0.8772175,0.0007938152,0.0778306,0.00093327253,0.0005080344,0.00044197112,0.0025892155,0.0007580253,0.03892758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975401,0.00076237164,0.000102786136,0.0005803126,0.00074878737,0.00026561343],"domain_scores_gemma":[0.98352945,0.009559549,0.0012506825,0.00096825557,0.0038449448,0.00084716943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025294372,0.0013469665,0.0009913557,0.0011601422,0.0007593915,0.0048162164,0.0009511989,0.0007974591,0.01653369],"category_scores_gemma":[0.013879969,0.00068170007,0.0007833626,0.0009819593,0.0029186418,0.0035315056,0.001393432,0.0031903759,0.0036560073],"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.00018541279,0.00013958223,0.000973223,0.00036936876,0.000060495644,0.00036014785,0.0005291644,0.015222172,0.009806695,0.92771995,0.02420175,0.020431964],"study_design_scores_gemma":[0.00004436141,0.0001558136,0.0011820784,0.00006187844,0.00002260215,0.00076531357,0.00022277035,0.14647588,0.004406014,0.8391995,0.007400324,0.00006343332],"about_ca_topic_score_codex":0.0010371222,"about_ca_topic_score_gemma":0.0010335722,"teacher_disagreement_score":0.01653369,"about_ca_system_score_codex":0.0011225182,"about_ca_system_score_gemma":0.0014389039,"threshold_uncertainty_score":0.055310726},"labels":[],"label_agreement":null},{"id":"W788669951","doi":"10.1007/978-1-4612-1200-3_5","title":"Semigroups of Nonnegative Matrices","year":2000,"lang":"en","type":"book-chapter","venue":"Universitext","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Dalhousie University","funders":"","keywords":"Corollary; Mathematics; Eigenvalues and eigenvectors; Homogeneous space; Pure mathematics; Nonnegative matrix; Combinatorics; Algebra over a field; Symmetric matrix; Physics","score_opus":0.007061214550615381,"score_gpt":0.18152680958199405,"score_spread":0.17446559503137868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W788669951","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021420335,0.011094044,0.18871313,0.0036906162,0.0040433435,0.00006576831,0.0005607005,0.00048982556,0.76992226],"genre_scores_gemma":[0.38180682,0.011083992,0.10209264,0.0013649899,0.0046801963,0.0003787356,0.0009884795,0.00040610976,0.4971981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997031,0.0000877688,0.000016730628,0.00005494736,0.00011326973,0.000024190413],"domain_scores_gemma":[0.9993467,0.0003266961,0.000044553362,0.00007490757,0.00012096592,0.00008619704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046412167,0.00082330924,0.00044312153,0.0012276091,0.0008885218,0.0027292182,0.00049684633,0.00046449035,0.013139048],"category_scores_gemma":[0.0013290441,0.00036959845,0.000419323,0.0011329666,0.0014578437,0.002174002,0.000815039,0.0015576385,0.003194977],"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.0000057947564,0.000006985792,0.000022733477,0.000031218016,0.0000015505894,0.000021482447,0.00014844206,0.00019816347,0.0006366915,0.9796632,0.008630479,0.010633289],"study_design_scores_gemma":[0.0000042656807,0.000009791805,0.00008249094,0.00001759507,0.000002250657,0.0000992116,0.000040939078,0.0013273119,0.00024945312,0.94831127,0.049849667,0.0000056890685],"about_ca_topic_score_codex":0.00026331638,"about_ca_topic_score_gemma":0.00037086126,"teacher_disagreement_score":0.013139048,"about_ca_system_score_codex":0.0007358831,"about_ca_system_score_gemma":0.0004734026,"threshold_uncertainty_score":0.04395449},"labels":[],"label_agreement":null},{"id":"W94203535","doi":"","title":"The kth Lower Multiexponent of Tournament Matrices.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tournament; Mathematics; Combinatorics","score_opus":0.006452618473527845,"score_gpt":0.2196477663908502,"score_spread":0.21319514791732236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94203535","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58189744,0.0023876976,0.2118587,0.0036304493,0.0013239881,0.00008547816,0.0011284564,0.00097460666,0.1967131],"genre_scores_gemma":[0.9531153,0.00063983846,0.013661777,0.0004177034,0.0005714248,0.000055053282,0.0003048328,0.00015608137,0.031077946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991829,0.00014885706,0.000041670566,0.00015957943,0.00022913786,0.00023785952],"domain_scores_gemma":[0.99753904,0.0010094063,0.00033837405,0.00035313854,0.00031506683,0.0004450975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007424258,0.0005631582,0.00050111697,0.0022144301,0.0017512401,0.003627277,0.0010314927,0.0010683286,0.015907945],"category_scores_gemma":[0.00695929,0.00031211253,0.00046467368,0.0010897882,0.00188439,0.0030147156,0.0015943409,0.0021551608,0.0037522162],"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.00026083252,0.000070038215,0.0013295166,0.00010794234,0.000023595792,0.00026721845,0.00035575413,0.004371376,0.005161584,0.9477112,0.008834822,0.031506184],"study_design_scores_gemma":[0.00003435669,0.00010511874,0.0018110301,0.00008538908,0.000025027774,0.0007535746,0.00015262165,0.031171583,0.0050952034,0.94863516,0.012083112,0.000047737405],"about_ca_topic_score_codex":0.00070101337,"about_ca_topic_score_gemma":0.00094322144,"teacher_disagreement_score":0.015907945,"about_ca_system_score_codex":0.0011347871,"about_ca_system_score_gemma":0.00053170475,"threshold_uncertainty_score":0.05321735},"labels":[],"label_agreement":null},{"id":"W960123743","doi":"","title":"Bordered matrices and some their applications","year":2011,"lang":"en","type":"article","venue":"Review of Economics and Finance","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geology; Mathematics","score_opus":0.017433741555485268,"score_gpt":0.21523652864103215,"score_spread":0.19780278708554688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W960123743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027083704,0.2715778,0.60816133,0.010002916,0.00325795,0.000055680368,0.00042550598,0.00025491905,0.07918013],"genre_scores_gemma":[0.5247295,0.19075355,0.21921802,0.0037195778,0.0121640125,0.0002548578,0.00057142816,0.00019564286,0.048393443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994467,0.00021277182,0.000033643435,0.00011149302,0.00015374478,0.000041731124],"domain_scores_gemma":[0.99727136,0.0017567044,0.00022043205,0.00021394162,0.00038448174,0.00015312541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011941538,0.00091366656,0.0011326261,0.002092453,0.0010029303,0.0033175538,0.0011836269,0.0021484513,0.00528759],"category_scores_gemma":[0.0061666854,0.00064575445,0.0007561579,0.0036449493,0.0038110944,0.0037085686,0.001456079,0.0038210081,0.0010678545],"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.000011424832,0.000017997694,0.00013601506,0.00009062847,0.0000108254835,0.00003039744,0.000063931744,0.0043898923,0.00018108149,0.9761361,0.0033517145,0.015580054],"study_design_scores_gemma":[0.000005005802,0.000009702233,0.00007701255,0.000032164593,0.0000041267144,0.000044832563,0.00001951698,0.009687002,0.00005764861,0.9807231,0.009330934,0.000008980717],"about_ca_topic_score_codex":0.0019844708,"about_ca_topic_score_gemma":0.001171048,"teacher_disagreement_score":0.00528759,"about_ca_system_score_codex":0.001340724,"about_ca_system_score_gemma":0.0006659463,"threshold_uncertainty_score":0.017688751},"labels":[],"label_agreement":null},{"id":"W986704446","doi":"10.1007/978-94-015-9942-9_3","title":"Convergence vector spaces","year":2002,"lang":"en","type":"book-chapter","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"","keywords":"Convergence (economics); Vector (molecular biology); Modes of convergence (annotated index); Space (punctuation); Vector space; Unconditional convergence; Mathematics; Computer science; Compact convergence; Pure mathematics; Topological vector space; Rate of convergence; Economics; Topological space; Biology; Telecommunications","score_opus":0.01919199431599664,"score_gpt":0.21427731490851207,"score_spread":0.19508532059251543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W986704446","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037008615,0.017558875,0.3186908,0.0017034713,0.0018859843,0.00005346469,0.00036032303,0.000994851,0.65505135],"genre_scores_gemma":[0.060496125,0.011752534,0.074584946,0.0005790777,0.001241242,0.00015997152,0.00073388807,0.0009825866,0.84946966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965405,0.00007292291,0.000014993642,0.000060653005,0.00017381844,0.00002353427],"domain_scores_gemma":[0.99965155,0.000098403405,0.000012770582,0.00006728453,0.00014205648,0.000028000095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047403885,0.0009060075,0.00075550313,0.0013182265,0.00072200544,0.0024693592,0.0006446068,0.0005852551,0.02490531],"category_scores_gemma":[0.0010282701,0.00036401008,0.00031153046,0.0016646453,0.0012555305,0.0026726986,0.00097407395,0.0021569622,0.011809548],"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.000012477074,0.000019965612,0.000044397737,0.00010370096,0.000006461413,0.000017960132,0.00015366182,0.0013420349,0.0008162891,0.7677881,0.09118182,0.1385131],"study_design_scores_gemma":[0.0000054158927,0.00002109526,0.00013126877,0.00008354182,0.0000072991343,0.00012665754,0.00007588817,0.007315759,0.001456229,0.4846063,0.5061572,0.000013334402],"about_ca_topic_score_codex":0.0008350568,"about_ca_topic_score_gemma":0.0011111277,"teacher_disagreement_score":0.02490531,"about_ca_system_score_codex":0.00091760023,"about_ca_system_score_gemma":0.00073245727,"threshold_uncertainty_score":0.083316505},"labels":[],"label_agreement":null}]}