{"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.2596614e-7,0.00029301457,0.31285372,0.0007923802,0.00047341117,0.00008406515,9.2623804e-7,0.00018529274,0.68531704],"genre_scores_gemma":[0.00029798035,0.00010677744,0.0048584025,0.00066216703,0.00039766778,0.0000039484275,0.0000016218605,0.000021124366,0.9936503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99889195,0.00003589666,0.00021359463,0.0003518125,0.00027057622,0.00023616925],"domain_scores_gemma":[0.99815995,0.0004198788,0.00012407126,0.0011670933,0.00005483807,0.00007415611],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007104518,0.00023177362,0.00019098652,0.00007008402,0.00030665452,0.0003133542,0.0018347725,0.00015583137,0.00033860235],"category_scores_gemma":[0.000022074095,0.00012928605,0.00015230499,0.00003132514,0.00012412101,0.00007595311,0.00044361688,0.00029899582,0.0017334094],"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.0000010333988,8.5369743e-7,7.08402e-8,0.0000036352167,0.000014196176,0.0000049395885,0.000013545122,6.925144e-7,7.4304006e-7,0.8692517,0.005010062,0.12569852],"study_design_scores_gemma":[0.00003123939,0.000013157992,2.5736475e-7,0.000014659978,0.000003266053,0.00001055137,9.850942e-7,0.0010915017,0.000023805966,0.48042533,0.51826584,0.00011940497],"about_ca_topic_score_codex":0.0000015127483,"about_ca_topic_score_gemma":0.0000032546186,"teacher_disagreement_score":0.5132558,"about_ca_system_score_codex":0.00001536692,"about_ca_system_score_gemma":0.00004030508,"threshold_uncertainty_score":0.9990439},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47520432,0.000047210808,0.52343076,0.00008817384,0.000079011916,0.0000939474,0.000002762523,0.00008036816,0.0009734285],"genre_scores_gemma":[0.7211809,0.0000018946523,0.27866605,0.000027957954,0.000087257016,0.0000054020443,0.0000027570395,0.0000033221995,0.000024449317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988023,0.000047877358,0.00031723586,0.0003420265,0.00018194929,0.0003085863],"domain_scores_gemma":[0.99866307,0.0007834592,0.00016402444,0.0002028191,0.00006415157,0.0001224774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015978891,0.0001200144,0.00018721052,0.00006735151,0.0001725327,0.000117192045,0.00021942258,0.000088296976,6.8425663e-7],"category_scores_gemma":[0.0006245965,0.00011527272,0.00011298622,0.000485719,0.000032773056,0.00022633722,0.000059696158,0.000058037058,0.0000047631434],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043079813,0.00058396783,0.06886515,0.00012595237,0.0007723349,0.00009493432,0.0010274462,0.1134425,0.002319127,0.029152177,0.00014178558,0.7830438],"study_design_scores_gemma":[0.00085585413,0.00010054441,0.4778363,0.000042873657,0.0003271027,0.000019961411,0.000105963896,0.51158875,0.0055413293,0.0025029175,0.0006408617,0.00043752766],"about_ca_topic_score_codex":0.0005391254,"about_ca_topic_score_gemma":0.00033300603,"teacher_disagreement_score":0.7826063,"about_ca_system_score_codex":0.000048379825,"about_ca_system_score_gemma":0.000017488299,"threshold_uncertainty_score":0.4700685},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9380081,0.0000705325,0.059042078,0.00075630326,0.0005725628,0.00058784394,0.00009983147,0.00014245676,0.00072025496],"genre_scores_gemma":[0.14961825,0.00012484362,0.06325256,0.000070231596,0.00007592375,0.0000031416043,0.0008412994,0.00003815194,0.7859756],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858236,0.000076621094,0.0001481776,0.0005365627,0.00036032486,0.0002959397],"domain_scores_gemma":[0.9987183,0.0001464366,0.0002889236,0.0005791903,0.00016368787,0.00010344298],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021046099,0.00024680162,0.0005355126,0.00080958294,0.0002789408,0.000034295972,0.0009394335,0.00016331815,0.00007124611],"category_scores_gemma":[0.000018015944,0.0002674651,0.0004415437,0.0008531556,0.00005541697,0.00010596139,0.0000667543,0.00016039229,0.000039859166],"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.0021079488,0.003065019,0.00020330513,0.0027997247,0.0077065765,0.0007702876,0.63349384,0.15022308,0.0020335466,0.09472832,0.009396739,0.09347161],"study_design_scores_gemma":[0.005692599,0.0025797344,0.0070559722,0.0005777848,0.00431511,0.000016352515,0.07892542,0.875873,0.011447049,0.005366588,0.0051381197,0.0030122257],"about_ca_topic_score_codex":0.0018010066,"about_ca_topic_score_gemma":0.0020973831,"teacher_disagreement_score":0.78838986,"about_ca_system_score_codex":0.00006680816,"about_ca_system_score_gemma":0.000079603524,"threshold_uncertainty_score":0.99997777},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.3540937e-7,0.0002148367,0.24959168,0.00011798425,0.0043744803,0.00007011728,0.0000011359543,0.00013812994,0.7454915],"genre_scores_gemma":[0.00012363463,0.0003295681,0.00071470696,0.00011838018,0.0015319902,0.0000021854796,0.000002200649,0.000010294648,0.99716705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923354,0.000012545641,0.00014516851,0.00023646998,0.00023964368,0.00013262793],"domain_scores_gemma":[0.99915755,0.00013911458,0.00007851851,0.0005368377,0.000043986653,0.000043977594],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013211687,0.00015036442,0.000108168904,0.000029913264,0.00030766072,0.000118230586,0.0006728363,0.00013862799,0.00023591175],"category_scores_gemma":[0.0000066753505,0.00008814133,0.00011056933,0.0000157661,0.00005252025,0.000118063625,0.00016046318,0.00021210851,0.00079444126],"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.0000038623702,0.0000012355132,3.3236606e-8,9.0910294e-7,0.00001286284,0.00000411731,0.000017332794,5.316474e-7,6.8789257e-7,0.9099245,0.027206758,0.06282714],"study_design_scores_gemma":[0.000049775354,0.000032659384,8.457231e-7,0.0000034439072,0.0000031048226,0.000009450474,3.497692e-7,0.000184985,0.000010100317,0.20797244,0.7916304,0.00010243683],"about_ca_topic_score_codex":0.0000021383687,"about_ca_topic_score_gemma":0.0000020809177,"teacher_disagreement_score":0.76442367,"about_ca_system_score_codex":0.000018614775,"about_ca_system_score_gemma":0.000049714286,"threshold_uncertainty_score":0.99998355},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03547475,0.00019729801,0.959102,0.002510394,0.00004822915,0.00040970484,0.0000028872566,0.00007256028,0.0021822187],"genre_scores_gemma":[0.8902616,0.00004823791,0.1086355,0.00009352189,0.00009772481,0.00002519106,0.0000027574754,0.000011753817,0.0008237512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988892,0.00015729692,0.00037798387,0.00015454974,0.0002736412,0.00014732139],"domain_scores_gemma":[0.9981739,0.0011395379,0.00017682396,0.00043246927,0.000039277314,0.00003800728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008215103,0.00011244321,0.00022596409,0.000035111505,0.00015888155,0.000072250026,0.0004956823,0.000056540594,0.00007607161],"category_scores_gemma":[0.000083631414,0.000056870867,0.00006884669,0.000424545,0.000171876,0.000158955,0.00009216868,0.00013708178,0.00006600311],"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.000020194038,0.00007498656,0.00013128409,0.000054945565,0.000038945895,0.0000012019528,0.0028589645,0.000060278882,0.000020069261,0.91507584,0.0000747033,0.081588596],"study_design_scores_gemma":[0.0006488863,0.000053890122,0.0011159912,0.000032554115,0.000042911477,0.000019776056,0.000041382456,0.5429724,0.00010935577,0.4536991,0.0011500274,0.00011373973],"about_ca_topic_score_codex":0.000012144715,"about_ca_topic_score_gemma":1.738707e-7,"teacher_disagreement_score":0.8547868,"about_ca_system_score_codex":0.000011890707,"about_ca_system_score_gemma":0.000019043275,"threshold_uncertainty_score":0.23191266},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023101322,0.00005050916,0.9742089,0.0011958593,0.0006940499,0.00004890294,0.000011345657,0.00004798229,0.00064112036],"genre_scores_gemma":[0.8202606,0.0000052390033,0.1776643,0.00094873074,0.0009054268,0.0000013665576,0.00001918018,0.000016715012,0.00017845133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979195,0.00016388693,0.00053314946,0.00021501684,0.0009126802,0.0002557564],"domain_scores_gemma":[0.99776,0.00047322112,0.00052707864,0.00024207366,0.00067416555,0.00032348957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005109167,0.00020584445,0.00035537596,0.0000890126,0.00009775309,0.00018307829,0.000831509,0.000053591895,0.000005028838],"category_scores_gemma":[0.00005954076,0.00017754619,0.0002023391,0.00039351246,0.000093587114,0.0007075268,0.00013205712,0.0003020336,0.00010361735],"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.000077812925,0.00025732254,0.00001752965,0.000011666056,0.000062003186,0.00004556014,0.0002836967,0.9058531,0.0000041968465,0.07795047,0.007151384,0.008285243],"study_design_scores_gemma":[0.0016661101,0.0002691975,0.00019507966,0.000050574024,0.000011793017,0.000037271046,0.000030253344,0.72935647,0.000040781826,0.2666303,0.0015329694,0.00017923547],"about_ca_topic_score_codex":0.0000014417651,"about_ca_topic_score_gemma":6.505256e-8,"teacher_disagreement_score":0.79715925,"about_ca_system_score_codex":0.00010768837,"about_ca_system_score_gemma":0.00029097122,"threshold_uncertainty_score":0.7240123},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01401508,0.0012596545,0.9813826,0.001308526,0.0001574372,0.0008425853,0.00002988923,0.0001370782,0.0008671215],"genre_scores_gemma":[0.95605266,0.0005208837,0.03910205,0.00035146956,0.0006298368,0.00126035,0.000024950032,0.000018236065,0.002039589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912983,0.000032864067,0.00020144989,0.00028440083,0.0001368425,0.00021458595],"domain_scores_gemma":[0.9988533,0.0003814739,0.00010390984,0.0003638747,0.00015838095,0.00013906363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041997217,0.00010574605,0.0001102829,0.00005699709,0.00040241328,0.00016416116,0.00061066926,0.000043461445,0.0000024494168],"category_scores_gemma":[0.00012837742,0.000074779084,0.000036860394,0.0005132977,0.000043834003,0.00021535445,0.00012404598,0.0000813471,0.000077881625],"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.00000771642,0.000028969196,0.0000040832583,0.000019068162,0.00000994076,2.6588862e-7,0.0001914977,0.0000041719663,0.0008290982,0.9276202,0.00009614503,0.07118885],"study_design_scores_gemma":[0.0011435597,0.00022667888,0.00038280094,0.0000202066,0.00004811177,0.000031175998,0.000093192364,0.23156789,0.014426786,0.2193019,0.5321935,0.0005642371],"about_ca_topic_score_codex":0.0000020303607,"about_ca_topic_score_gemma":7.558868e-7,"teacher_disagreement_score":0.9422806,"about_ca_system_score_codex":0.000013687321,"about_ca_system_score_gemma":0.000065397246,"threshold_uncertainty_score":0.30950782},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005390566,0.0006829345,0.98763597,0.00029003998,0.00036208448,0.00013705587,0.0000043605382,0.00014684588,0.010201625],"genre_scores_gemma":[0.5176363,0.000028446932,0.48107553,0.00029197906,0.00042703576,0.0000031289662,0.000014717319,0.00003586649,0.00048698476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802226,0.0000074560458,0.0003177025,0.00062866963,0.00064125424,0.00038263094],"domain_scores_gemma":[0.9990034,0.000427791,0.00011429341,0.00020804543,0.00014058208,0.00010588391],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000656306,0.00030306968,0.00026937423,0.00056916353,0.00020028265,0.00037498676,0.00077889406,0.00013825404,0.000009270488],"category_scores_gemma":[0.00007902501,0.00029945208,0.000050026458,0.00040694326,0.00015749558,0.00039559806,0.0003393702,0.0003944025,0.000011339235],"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":[8.3424743e-7,0.0000048000143,0.000010763702,0.000033036064,0.0000041488624,0.00003057859,0.000078404846,0.8437666,0.00004155904,0.13000159,0.000014260743,0.026013365],"study_design_scores_gemma":[0.00011402162,0.00002431458,0.00035736285,0.00017478628,0.0000044693766,0.00006383405,3.9856667e-7,0.9360324,0.00004256109,0.061334163,0.001479784,0.00037190615],"about_ca_topic_score_codex":0.000013870116,"about_ca_topic_score_gemma":0.0000035234643,"teacher_disagreement_score":0.51709723,"about_ca_system_score_codex":0.00012431545,"about_ca_system_score_gemma":0.00019281241,"threshold_uncertainty_score":0.99994576},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018374655,0.00011449204,0.978885,0.00005184816,0.00064286724,0.00015776155,0.0000922559,0.00002773086,0.01984429],"genre_scores_gemma":[0.0034447229,0.0006061585,0.89964914,0.000036997884,0.0002997766,0.000009555516,0.00013414981,0.00003341284,0.095786095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999221,0.000014712195,0.00028840994,0.00022340682,0.00016622907,0.000086211374],"domain_scores_gemma":[0.9993015,0.000053385258,0.00020219416,0.00030669122,0.00010998271,0.000026236614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001832416,0.00013123837,0.00017031474,0.00010778885,0.000040777337,0.00005376862,0.00020941516,0.00016027283,0.000044466353],"category_scores_gemma":[0.00005689967,0.00014212298,0.000012454186,0.00003443934,0.00008871961,0.0003482266,0.00016087953,0.00019249374,0.0000031166974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033756137,0.0000041591734,0.000029747258,0.00006338581,0.0000059426206,0.0000044414196,0.00019186693,0.000014219533,0.00052377,0.9876617,0.000044842593,0.011452551],"study_design_scores_gemma":[0.00021978562,0.000112744994,0.00046356957,0.000079008896,0.000018843064,0.000008745661,0.0000037134398,0.019314887,0.0035332553,0.9285699,0.047312554,0.00036299755],"about_ca_topic_score_codex":0.000006990565,"about_ca_topic_score_gemma":0.0000780663,"teacher_disagreement_score":0.07923588,"about_ca_system_score_codex":0.000013723118,"about_ca_system_score_gemma":0.000041768428,"threshold_uncertainty_score":0.5795607},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012446673,0.00018924823,0.9857574,0.0004399243,0.000011642849,0.00006001808,0.0000030663532,0.000009055599,0.0010829819],"genre_scores_gemma":[0.7765751,0.00001828193,0.22293314,0.00002723102,0.00007918479,0.000009382672,0.000001240592,0.0000037208392,0.0003527211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999023,0.000059735798,0.0004951305,0.00009603903,0.0002476491,0.00007842664],"domain_scores_gemma":[0.9987475,0.00020281399,0.00037698136,0.0002347349,0.00028888907,0.00014906938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007009137,0.00007041991,0.00033214982,0.00022065824,0.00006391388,0.000053465603,0.000313657,0.000026991052,0.00003068131],"category_scores_gemma":[0.000060935778,0.000049146336,0.00017266655,0.00093324966,0.00008242063,0.00018696082,0.00006996017,0.00008170715,0.000009987698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053441013,0.00032989462,0.00021842911,0.000030381605,0.0004982978,0.0000015255945,0.00039754438,0.0003502352,0.00035733235,0.99386615,0.00017444174,0.0037704275],"study_design_scores_gemma":[0.00053896237,0.00016017203,0.0008596797,0.000029299796,0.0011014541,0.00011646112,0.0007857839,0.083080284,0.0010102679,0.9084722,0.0036653536,0.00018007321],"about_ca_topic_score_codex":0.0000011717358,"about_ca_topic_score_gemma":4.1199132e-7,"teacher_disagreement_score":0.76412845,"about_ca_system_score_codex":0.000009765216,"about_ca_system_score_gemma":0.000038482947,"threshold_uncertainty_score":0.20041294},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.2605604e-7,0.020524584,0.02768777,0.00008257159,0.00017742174,0.00011204014,0.000013045235,0.00005461892,0.9513477],"genre_scores_gemma":[0.000014092754,0.03593325,0.00816115,0.0008313595,0.000078477664,1.7625011e-7,0.000011680644,0.000015372107,0.95495445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99931717,0.000016855522,0.00016577795,0.00025398933,0.00013781436,0.00010840834],"domain_scores_gemma":[0.9989487,0.0000340183,0.00021329922,0.00063070445,0.00010841095,0.000064901345],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013836412,0.00016177307,0.00029486133,0.0001279448,0.00004350955,0.000004955779,0.0010004268,0.000118048934,0.0029126112],"category_scores_gemma":[0.0000057038624,0.00015949192,0.00018369776,0.00004979081,0.000063982756,0.00015449847,0.00034495103,0.00016443347,0.00075807277],"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.0000015964241,0.000005341589,7.129377e-8,0.00083669403,0.000026678592,0.000030462725,0.000073652714,9.3929884e-8,0.0000010890932,0.9593953,0.0079966895,0.031632356],"study_design_scores_gemma":[0.00007096859,0.000043922166,1.8216723e-7,0.0040970207,0.000038178892,0.000007720862,0.0000013309032,0.000034632514,0.000038906364,0.04292351,0.95256644,0.00017715595],"about_ca_topic_score_codex":0.000003444351,"about_ca_topic_score_gemma":2.532749e-7,"teacher_disagreement_score":0.94456977,"about_ca_system_score_codex":0.000020665628,"about_ca_system_score_gemma":0.00006270478,"threshold_uncertainty_score":0.99799883},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49943432,0.00029350378,0.49952364,0.00014102548,0.000033824166,0.00019763103,0.000018890489,0.000035598638,0.00032157652],"genre_scores_gemma":[0.98002255,0.00015216442,0.019486802,0.0000660518,0.00007431779,0.000034869132,0.000032084154,0.000004913578,0.00012625761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947065,0.000030246994,0.0001994657,0.0001294776,0.000105342515,0.00006483412],"domain_scores_gemma":[0.9994565,0.000024850382,0.00013744064,0.00019253237,0.00013164981,0.000057016947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014529901,0.00005642018,0.0001206926,0.000059696136,0.00003374239,0.000013572949,0.00022167034,0.000029971983,0.0000033032677],"category_scores_gemma":[0.000007339601,0.000050037317,0.00002130633,0.0003068497,0.000022917215,0.00016970816,0.00007090728,0.000029236415,0.000009333288],"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.0000049024416,0.00008108048,0.000077546516,0.000041055635,0.000009604367,1.0456396e-7,0.00040020962,0.00001436775,0.17806827,0.8123349,0.000025545058,0.008942402],"study_design_scores_gemma":[0.0023951007,0.0003077667,0.008656873,0.00007204831,0.00007351793,0.000020423246,0.00021152226,0.45213133,0.40288284,0.07615245,0.056473866,0.0006222637],"about_ca_topic_score_codex":0.000005367948,"about_ca_topic_score_gemma":1.4268355e-7,"teacher_disagreement_score":0.73618245,"about_ca_system_score_codex":0.0000030134124,"about_ca_system_score_gemma":0.000026899166,"threshold_uncertainty_score":0.20404626},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6544621,0.00050574413,0.098484114,0.19054128,0.0003298682,0.0013832222,0.000016089676,0.00068243657,0.053595148],"genre_scores_gemma":[0.85302645,0.00007415503,0.14013743,0.004322408,0.00025927165,0.000030894385,7.1227944e-8,0.000020861355,0.002128433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988053,0.000011320117,0.000269381,0.00022408018,0.0003872495,0.00030266604],"domain_scores_gemma":[0.99891305,0.0002842133,0.0003390542,0.00029275814,0.00009919734,0.00007173855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063801947,0.00014590812,0.00024467809,0.000007667318,0.00034863292,0.00014770299,0.0018598593,0.00003429739,0.000023117012],"category_scores_gemma":[0.00012963351,0.00007129782,0.00034685715,0.0004973458,0.0006731587,0.0001956724,0.00047547996,0.00022898772,0.00003427402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054099437,0.00008197367,0.000083965344,0.00006539072,0.00006887685,5.8059094e-8,0.0045197774,0.0000027344524,0.001448592,0.94522744,0.021239942,0.027255857],"study_design_scores_gemma":[0.00033241272,0.00013181216,0.0004027044,0.00007711564,0.000045768804,0.000046674566,0.0018658399,0.062499613,0.037098568,0.85716164,0.039963234,0.00037462718],"about_ca_topic_score_codex":0.0000021891328,"about_ca_topic_score_gemma":8.9556025e-8,"teacher_disagreement_score":0.19856438,"about_ca_system_score_codex":0.000032707583,"about_ca_system_score_gemma":0.000025296647,"threshold_uncertainty_score":0.34561124},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007209728,0.00041919993,0.8810147,0.00010542557,0.0024695199,0.00023389253,0.0002566737,0.00017265827,0.11532071],"genre_scores_gemma":[0.0006289441,0.0002622631,0.61849004,0.000105611456,0.00050015474,0.000019182171,0.000032333202,0.00008456373,0.37987688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998201,0.00001850867,0.00047053752,0.00055722345,0.00038467074,0.00036802568],"domain_scores_gemma":[0.99837196,0.00023954215,0.0002716779,0.0008941452,0.00010694328,0.00011574381],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028819081,0.00039968445,0.00042826624,0.0002589836,0.000114144874,0.00022694025,0.0012393501,0.00032905804,0.00039315276],"category_scores_gemma":[0.00006611335,0.00041092708,0.00006122995,0.00007645303,0.00022960347,0.00030431905,0.0005961831,0.0008999909,0.00031247424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011338748,0.000009934424,0.000001222215,0.00006658636,0.000018671983,0.00017345771,0.00019420512,0.000041658957,0.000009745121,0.9871331,0.00029866758,0.012041453],"study_design_scores_gemma":[0.00021704037,0.0000727213,0.000022264132,0.000115748495,0.00002490387,0.00005359787,0.000005244693,0.0010898429,0.00005121904,0.80582994,0.19185327,0.00066421],"about_ca_topic_score_codex":0.000011533946,"about_ca_topic_score_gemma":0.00011133229,"teacher_disagreement_score":0.26455617,"about_ca_system_score_codex":0.000050308743,"about_ca_system_score_gemma":0.00013775768,"threshold_uncertainty_score":0.99983424},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20100772,0.00096587196,0.79336745,0.0035387496,0.00037382517,0.0001110423,0.000002170728,0.00007337924,0.00055977935],"genre_scores_gemma":[0.99436826,0.00018557042,0.0037571006,0.0007226524,0.0003526903,5.440468e-7,6.1439744e-7,0.000010908629,0.0006016528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979912,0.00021312803,0.00040214983,0.00023253038,0.00047269152,0.00068828056],"domain_scores_gemma":[0.9988253,0.00014722189,0.00037022543,0.00037595426,0.00011663203,0.00016468286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013423415,0.00019939675,0.0003278622,0.00014081967,0.00013725975,0.00012229836,0.0011278334,0.000084023486,0.00014209114],"category_scores_gemma":[0.000059220532,0.00014491772,0.00021342971,0.00028612532,0.000025413832,0.0011553093,0.00006910565,0.00067265594,0.00003122013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071626436,0.0010730528,0.00066361076,0.000038579037,0.00040500943,0.0016881496,0.0020549374,0.00021299266,0.007982341,0.73627067,0.001425766,0.24746867],"study_design_scores_gemma":[0.008961115,0.030923996,0.014858173,0.0007381423,0.00022170892,0.014009925,0.00040034507,0.019592537,0.14573894,0.71418303,0.04744957,0.002922479],"about_ca_topic_score_codex":0.0000019473857,"about_ca_topic_score_gemma":0.0000033707286,"teacher_disagreement_score":0.79336053,"about_ca_system_score_codex":0.00012238164,"about_ca_system_score_gemma":0.00044961055,"threshold_uncertainty_score":0.5909573},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003389991,0.004693069,0.046734456,0.004779586,0.0011406703,0.0013060158,0.00002125965,0.00015691316,0.94113415],"genre_scores_gemma":[0.013533686,0.00030189854,0.0033414313,0.00015005251,0.00021402338,0.000014814629,0.0000013196498,0.000019636218,0.9824231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883074,0.000084754516,0.00032524965,0.00034668276,0.00026064,0.00015195616],"domain_scores_gemma":[0.9983128,0.00014041614,0.00026987348,0.0011564534,0.000081701655,0.000038802198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075372367,0.00021433485,0.00030973786,0.000047491078,0.00015911608,0.000062872845,0.0011527246,0.00009313772,0.00044516643],"category_scores_gemma":[0.000025192037,0.00009823365,0.00018026891,0.000051285562,0.0004398578,0.00012478755,0.0005348843,0.00023018569,0.00007730143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020749476,0.0000061057854,0.0000011683491,0.00003401588,0.00003282918,0.0000012692117,0.0001978799,0.0000012187688,0.000006004639,0.99562734,0.0010355705,0.0030358732],"study_design_scores_gemma":[0.0005768614,0.000024873316,0.000016009039,0.00006668454,0.00005750275,0.00004440551,0.0000039774022,0.00035734352,0.0005872852,0.92187846,0.07618177,0.0002048076],"about_ca_topic_score_codex":0.00001744192,"about_ca_topic_score_gemma":0.0000033012411,"teacher_disagreement_score":0.0751462,"about_ca_system_score_codex":0.0000065961285,"about_ca_system_score_gemma":0.000054014865,"threshold_uncertainty_score":0.48742604},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013823803,0.0014398374,0.76302725,0.00025635966,0.00031684092,0.0016633022,0.00015900181,0.0010029736,0.23213303],"genre_scores_gemma":[0.000012759073,0.0001279837,0.797595,0.0006318496,0.00035636485,0.00033640914,0.00004305101,0.0006499805,0.2002466],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99515563,0.00022455149,0.001293077,0.0013183865,0.0009803934,0.0010279579],"domain_scores_gemma":[0.99444264,0.0011299611,0.0017063532,0.0020914944,0.00014371166,0.00048584703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001442032,0.0011834153,0.0022210984,0.0002229067,0.00029377232,0.0004932785,0.0024283722,0.0005166683,0.00044953084],"category_scores_gemma":[0.00022201944,0.0010257798,0.0014109774,0.0009728067,0.0008330469,0.0002900707,0.0004904853,0.0005623316,0.00041054096],"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.000002663629,0.0009801519,6.8019824e-7,0.0025568148,0.0007469522,0.000025849948,0.0017950466,0.0000018899117,0.00001995804,0.38764337,0.5803888,0.025837855],"study_design_scores_gemma":[0.0012047077,0.00035427592,1.7913251e-7,0.0012970257,0.00022536381,0.00009118399,0.0011992764,0.26046586,0.0001375358,0.33399397,0.3989307,0.002099949],"about_ca_topic_score_codex":0.00002123587,"about_ca_topic_score_gemma":3.4976034e-7,"teacher_disagreement_score":0.26046395,"about_ca_system_score_codex":0.00012640686,"about_ca_system_score_gemma":0.00038651022,"threshold_uncertainty_score":0.99921924},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25550884,0.0006746798,0.7301227,0.00055564905,0.00013520874,0.0002812545,0.00021934604,0.00023223885,0.012270093],"genre_scores_gemma":[0.8410206,0.0000032213236,0.15842609,0.00013589392,0.00002284478,0.000002995996,0.000007960585,0.000005216872,0.0003751626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989253,0.00009255211,0.00020898452,0.00034886732,0.0002401197,0.00018414803],"domain_scores_gemma":[0.9985128,0.00013958567,0.00007342798,0.0011553663,0.00003248429,0.00008633223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026992138,0.00012399098,0.00016377465,0.00005559196,0.000057370336,0.000042360818,0.0013421483,0.00003386449,0.00022506336],"category_scores_gemma":[0.000011281669,0.000087433255,0.000023816714,0.000115427894,0.000085794396,0.0009858201,0.00035797738,0.00006292325,0.00003264497],"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.00055342045,0.0006984534,0.000111891364,0.000016761285,0.00009310376,0.000068043686,0.002794651,0.00036450435,0.08694207,0.8990856,0.0011826587,0.00808886],"study_design_scores_gemma":[0.0016010228,0.0006500119,0.00018447664,0.000052436324,0.000011438474,0.0001977514,0.0003147924,0.47443634,0.51521164,0.0049034976,0.0018425486,0.00059401785],"about_ca_topic_score_codex":0.000037503367,"about_ca_topic_score_gemma":0.0000069457533,"teacher_disagreement_score":0.8941821,"about_ca_system_score_codex":0.000019952955,"about_ca_system_score_gemma":0.00013941563,"threshold_uncertainty_score":0.35654247},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006100826,0.001263618,0.99307674,0.0005111689,0.0006198045,0.0006123444,0.0000079589645,0.0001763524,0.0036710098],"genre_scores_gemma":[0.025342198,0.000054348762,0.9705239,0.00034927865,0.00061627134,0.000017988463,0.0000027563224,0.000049305057,0.003043972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603057,0.0000460014,0.00060514896,0.0013919453,0.0012268166,0.0006995237],"domain_scores_gemma":[0.99735606,0.00017057307,0.00042595618,0.0015112959,0.00036143846,0.0001746896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090654,0.0006108857,0.00071625697,0.00079509174,0.00021142885,0.00035592206,0.0036143258,0.0002700425,0.000040970448],"category_scores_gemma":[0.00003086047,0.0004440091,0.00013365346,0.00075045775,0.0010908727,0.00084776006,0.0010616268,0.0007063187,0.000036029556],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015726328,0.000060384664,0.000012542718,0.00010827295,0.000020490863,0.000069131485,0.0006294579,0.013943713,0.00013569965,0.02975912,0.000010420722,0.95523506],"study_design_scores_gemma":[0.0009045639,0.0010112596,0.000036772115,0.001721541,0.00003103324,0.00045075413,7.0584247e-7,0.8355009,0.02372158,0.1299005,0.0050691436,0.0016512427],"about_ca_topic_score_codex":0.00001511792,"about_ca_topic_score_gemma":0.000021762437,"teacher_disagreement_score":0.9535838,"about_ca_system_score_codex":0.00017257617,"about_ca_system_score_gemma":0.0008266157,"threshold_uncertainty_score":0.99980116},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11584693,0.0000055589608,0.88267577,0.00005951276,0.00015702765,0.00015768276,0.000059464757,0.00003445795,0.0010035838],"genre_scores_gemma":[0.9648094,6.186317e-7,0.034886003,0.000010405778,0.00001831103,0.000027076492,0.000020108992,0.0000023100506,0.00022574385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939156,0.0000301355,0.00024374235,0.00016141504,0.000091117494,0.000082037004],"domain_scores_gemma":[0.99901426,0.000112852125,0.00013046124,0.00056194596,0.00013181896,0.000048633687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037630444,0.000050487637,0.00016743307,0.00020986394,0.000042424937,0.000027318683,0.00043788142,0.00002852751,0.0000805647],"category_scores_gemma":[0.000018139794,0.000042504696,0.00010736128,0.00039135062,0.000040066745,0.00026366432,0.000017895727,0.00003411612,0.0000026317177],"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.0000028266277,0.00013292285,0.00011240463,0.000039850445,0.00013245356,5.968163e-8,0.00032260522,0.009182413,0.02269462,0.96641916,0.00006834993,0.00089230435],"study_design_scores_gemma":[0.000119977914,0.000039009992,0.0011898142,0.0000033853598,0.000078433506,6.39133e-7,0.000105316,0.97303754,0.020586902,0.0047214,0.000050701863,0.000066858],"about_ca_topic_score_codex":0.000058939935,"about_ca_topic_score_gemma":0.000026999052,"teacher_disagreement_score":0.96385515,"about_ca_system_score_codex":0.000003936965,"about_ca_system_score_gemma":0.000024692454,"threshold_uncertainty_score":0.17332913},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.17464765e-7,0.00012215425,0.51876533,0.00002675211,0.00012696789,0.000023679837,1.4977053e-7,0.00016743125,0.4807674],"genre_scores_gemma":[0.000007646325,0.0000061837336,0.5300096,0.000095078714,0.000100085585,0.0000014338804,2.1209443e-7,0.000032122163,0.4697476],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99935824,0.0001413438,0.0000792115,0.00024349369,0.000060559036,0.00011714048],"domain_scores_gemma":[0.9994556,0.00012446214,0.000074735806,0.0002954612,0.0000052251253,0.000044536937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056711194,0.00011049058,0.0001546356,0.00010566417,0.00003366255,0.000088269626,0.0003696089,0.00008747727,0.0004537232],"category_scores_gemma":[0.00003158026,0.000087653236,0.000021786931,0.000066275745,0.000023809705,0.000043326116,0.00025210323,0.00008957178,0.00004196738],"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":[6.3442734e-8,0.000002210381,0.0000017617351,0.00003721802,0.0000063562893,0.0000030411918,0.00004734676,7.870514e-8,0.000027382044,0.19709083,0.028888447,0.77389526],"study_design_scores_gemma":[0.000067808265,0.00001409968,0.0000026933283,0.00008574204,0.0000038711346,0.000019301455,0.0000056215076,0.04142765,0.00012821055,0.008530287,0.94951624,0.000198475],"about_ca_topic_score_codex":0.00001221731,"about_ca_topic_score_gemma":0.000001204289,"teacher_disagreement_score":0.9206278,"about_ca_system_score_codex":0.0000026109556,"about_ca_system_score_gemma":0.0000074502045,"threshold_uncertainty_score":0.49679506},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50022787,0.008950964,0.4650361,0.01924528,0.0015884242,0.0003258631,9.874492e-7,0.000049164548,0.0045753326],"genre_scores_gemma":[0.9979989,0.0014235293,0.000050692932,0.00021845702,0.00009982245,9.3716596e-7,7.394169e-8,0.0000071857426,0.00020040688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982024,0.000321465,0.00037920655,0.000097102005,0.00062949915,0.00037036577],"domain_scores_gemma":[0.9979592,0.0008173375,0.00054599956,0.00045846848,0.00017343997,0.000045550496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003197193,0.00012331917,0.00021144179,0.000100645666,0.00036414896,0.000045722434,0.0022155566,0.000048017417,0.000016439824],"category_scores_gemma":[0.000104861545,0.000060804425,0.00014732836,0.0007375564,0.00005617671,0.0001933107,0.00038712943,0.0006740978,0.000008400068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060213708,0.00008742426,0.0000133164585,0.0000045569914,0.000027764809,0.000011259548,0.0007842597,0.00012639537,0.00022629951,0.9934532,0.0002565193,0.004948784],"study_design_scores_gemma":[0.0005384082,0.00076800166,0.000035242196,0.000036424874,0.00002434538,0.00024912087,0.000044247896,0.0033551808,0.0042766077,0.9789028,0.01168262,0.00008696847],"about_ca_topic_score_codex":0.0000034801133,"about_ca_topic_score_gemma":6.839887e-7,"teacher_disagreement_score":0.49777102,"about_ca_system_score_codex":0.00011834935,"about_ca_system_score_gemma":0.00024562495,"threshold_uncertainty_score":0.41170925},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5175474,0.0000054708207,0.47996128,0.00086297304,0.00005175199,0.000115561685,0.0000039848505,0.000048673708,0.0014028815],"genre_scores_gemma":[0.9631482,0.000020525567,0.036380526,0.00023760117,0.000012876482,0.0000071772674,7.716372e-8,0.0000080141335,0.00018504132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998981,0.00009354984,0.00028754747,0.00017092151,0.00029445713,0.00017254967],"domain_scores_gemma":[0.99873424,0.00035475087,0.00018210862,0.00061269413,0.000056939134,0.000059290545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026283908,0.0001181099,0.00029961395,0.000029122542,0.00012136502,0.000016228048,0.0007923677,0.00003519101,0.00006520529],"category_scores_gemma":[0.000036659803,0.000075516415,0.00038273341,0.00092610397,0.00035152998,0.000108779954,0.000027598993,0.00018947343,0.0000135130695],"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.00008391622,0.0045391023,0.00069172675,0.0005129128,0.0009443609,0.0000037045704,0.009299376,0.003067462,0.042258468,0.80697155,0.0008312051,0.13079622],"study_design_scores_gemma":[0.0025476157,0.0032482175,0.010475278,0.0007998863,0.0004965487,0.00019119211,0.011862225,0.2328105,0.37405258,0.36003324,0.0015629914,0.0019197445],"about_ca_topic_score_codex":0.000019208124,"about_ca_topic_score_gemma":3.288189e-7,"teacher_disagreement_score":0.4469383,"about_ca_system_score_codex":0.000023376984,"about_ca_system_score_gemma":0.00003741077,"threshold_uncertainty_score":0.307947},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23489536,0.0042150277,0.6053797,0.00072593463,0.0020007542,0.0015273842,0.0002484639,0.00034788583,0.15065947],"genre_scores_gemma":[0.68479824,0.00047204495,0.31145307,0.000828225,0.00015769599,0.000071904455,0.000064795255,0.00004454041,0.0021094526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99676096,0.0007793285,0.0007034922,0.00088650157,0.00041080924,0.00045891822],"domain_scores_gemma":[0.99810433,0.00029647656,0.00041625154,0.00088084664,0.00017602231,0.0001260623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088157144,0.0004461689,0.0007235469,0.0004875579,0.000071148745,0.00018475781,0.0014374349,0.0002058419,0.00013468358],"category_scores_gemma":[0.000039604347,0.00041175846,0.00027336477,0.0006436225,0.00011035364,0.0002792144,0.0011872868,0.0005339664,0.00003675718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000690135,0.00038634497,0.00078537257,0.00018525748,0.00021248794,0.00026698812,0.0040111165,0.003995175,0.00039561055,0.9699444,0.00015842493,0.019589767],"study_design_scores_gemma":[0.003570659,0.0003176121,0.0076359254,0.0014353377,0.00014564337,0.00013643362,0.0004066966,0.08659567,0.059049863,0.837687,0.00024389586,0.0027752519],"about_ca_topic_score_codex":0.0009231519,"about_ca_topic_score_gemma":0.00007593712,"teacher_disagreement_score":0.4499029,"about_ca_system_score_codex":0.0000994138,"about_ca_system_score_gemma":0.00024951145,"threshold_uncertainty_score":0.9998334},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6430738,0.0007158902,0.34607217,0.0020778982,0.0002642386,0.0005299434,0.00028400897,0.0001277575,0.006854274],"genre_scores_gemma":[0.9778273,0.000006957117,0.02135769,0.00025231828,0.00008013757,0.00001142917,0.000014159531,0.000017133721,0.00043289084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985872,0.00019036948,0.00029733218,0.00029561404,0.00038675292,0.00024275627],"domain_scores_gemma":[0.99846625,0.00037186584,0.00032795046,0.0005161174,0.00021817113,0.000099638426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005950004,0.00019525427,0.0003123342,0.000055868506,0.0001338877,0.0001907077,0.00081860716,0.000052683437,0.00003696167],"category_scores_gemma":[0.00009236854,0.00011854784,0.000060138096,0.00030765473,0.00014300237,0.0006134872,0.000255072,0.00012573374,0.000078407655],"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.0022455577,0.0029509289,0.0066280835,0.00037756542,0.0026526377,0.0007868621,0.33273748,0.00037665773,0.024976404,0.5638163,0.0173554,0.045096137],"study_design_scores_gemma":[0.009770445,0.0074937916,0.13972738,0.00664746,0.0009475909,0.0018664042,0.021376431,0.019356608,0.54485023,0.23115309,0.010905709,0.0059048426],"about_ca_topic_score_codex":0.00005227855,"about_ca_topic_score_gemma":0.0000021181313,"teacher_disagreement_score":0.51987386,"about_ca_system_score_codex":0.000017678474,"about_ca_system_score_gemma":0.00008251389,"threshold_uncertainty_score":0.48342404},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37346917,0.00015903941,0.623257,0.000036652254,0.000114845505,0.00014508092,9.334676e-7,0.00006818261,0.002749143],"genre_scores_gemma":[0.9509382,0.00000765248,0.04888437,0.000047328056,0.000050010894,0.000001488243,0.0000017859475,0.0000041446133,0.00006500526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924916,0.000065669614,0.00019109539,0.00022339619,0.00012984898,0.0001408259],"domain_scores_gemma":[0.9995637,0.00015568903,0.0000770512,0.00011685229,0.00004662273,0.00004006284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035970853,0.00008371855,0.00014162796,0.000056636305,0.00010407002,0.000051235653,0.00018877792,0.00003097792,0.000013630188],"category_scores_gemma":[0.000016542384,0.00007951244,0.000025590101,0.00019224193,0.000036994516,0.00020021132,0.00009820445,0.000078728204,0.000016241891],"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.000023257007,0.000082835686,0.0010684186,0.00010239397,0.000027502503,0.0000066997327,0.0011604681,0.011901115,0.0005948447,0.039105546,0.000116381096,0.94581056],"study_design_scores_gemma":[0.00032936354,0.00006613993,0.0034059319,0.000110431756,0.0000029444552,0.000028196297,0.000011454257,0.98473424,0.0014571811,0.009597123,0.00015894766,0.00009805086],"about_ca_topic_score_codex":0.000010861599,"about_ca_topic_score_gemma":1.5054556e-7,"teacher_disagreement_score":0.9728331,"about_ca_system_score_codex":0.0000120807945,"about_ca_system_score_gemma":0.000016241522,"threshold_uncertainty_score":0.32424232},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.9056062e-7,0.0016164236,0.090394355,0.00005338701,0.00023311561,0.000046157213,0.0000017594622,0.00022633019,0.9074282],"genre_scores_gemma":[0.000011368341,0.0073349285,0.065794155,0.00023969128,0.000058901125,0.000003556267,7.348804e-7,0.00003741302,0.9265193],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99947447,0.000035562996,0.000056705238,0.00024051432,0.00008748327,0.00010527326],"domain_scores_gemma":[0.999613,0.000016828266,0.000040617164,0.0002754993,0.0000056818203,0.0000484],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000093097806,0.000106289895,0.000110976536,0.0052900733,0.000021512134,0.00010942918,0.00033709643,0.00008925502,0.0016265622],"category_scores_gemma":[0.0000016237736,0.00007680056,0.000028354836,0.0036456967,0.00003599347,0.00005309428,0.0000667971,0.000060172853,0.00007934024],"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":[6.825048e-8,0.0000038683024,0.000016175105,0.000008246247,0.000007473621,0.0000017522681,0.000002468088,5.0781424e-9,3.155134e-7,0.19864637,0.7965478,0.0047654724],"study_design_scores_gemma":[0.000044350607,0.000014481429,0.000009228355,0.000018349665,0.000002175094,0.0000050422623,0.0000021777519,0.000033195094,0.000012632485,0.018878013,0.98085535,0.00012499627],"about_ca_topic_score_codex":0.000035706747,"about_ca_topic_score_gemma":0.0000075313933,"teacher_disagreement_score":0.18430758,"about_ca_system_score_codex":2.7955025e-7,"about_ca_system_score_gemma":0.000005452622,"threshold_uncertainty_score":0.9992861},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90519786,0.00024312659,0.08227153,0.008550599,0.00012465556,0.00061226747,0.000010015932,0.00008589317,0.0029040417],"genre_scores_gemma":[0.7519163,0.000086249296,0.24658749,0.000556461,0.00018167957,0.00001180737,2.7007016e-7,0.000021489472,0.0006382553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975006,0.000038090693,0.0008260791,0.00042757168,0.0008097263,0.00039793702],"domain_scores_gemma":[0.99726397,0.00026038094,0.0014920423,0.00037794292,0.0004873984,0.00011828556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013660769,0.0002732693,0.00073072605,0.000033514632,0.00016929758,0.000075695636,0.0012805036,0.000082219485,0.00008439963],"category_scores_gemma":[0.00039646207,0.00018590524,0.0007449183,0.0009698752,0.0010264036,0.00037881278,0.0007048034,0.00026175164,0.0000322983],"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.000077124045,0.0010747539,0.00025044475,0.0013783464,0.0002657013,1.9523227e-7,0.014657941,0.00012014004,0.101104505,0.83725715,0.005957679,0.037856027],"study_design_scores_gemma":[0.0007920725,0.0003102155,0.0009632746,0.00063196826,0.00023827761,0.000027693108,0.0019618948,0.60645545,0.087480724,0.29984134,0.000801629,0.0004954464],"about_ca_topic_score_codex":0.00001778546,"about_ca_topic_score_gemma":1.0587389e-7,"teacher_disagreement_score":0.60633534,"about_ca_system_score_codex":0.000070923845,"about_ca_system_score_gemma":0.00006291321,"threshold_uncertainty_score":0.75809956},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41174772,0.00015198463,0.58485615,0.0029137335,0.00016471616,0.00012974911,0.000020449923,0.0000020618863,0.00001341379],"genre_scores_gemma":[0.9940797,0.000016231195,0.005680191,0.0001333446,0.00007116468,0.0000016874122,0.0000013210441,0.0000026754512,0.000013702704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986336,0.00024412638,0.00048106012,0.00007661262,0.00047938587,0.00008520665],"domain_scores_gemma":[0.9968343,0.0013252205,0.0009476711,0.00033076445,0.00055045,0.000011631912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019921546,0.000073895295,0.00017437131,0.000049668266,0.0003108721,0.000026897775,0.0011128552,0.000024224504,0.000005356885],"category_scores_gemma":[0.00020379935,0.000031832235,0.0002877663,0.00078432326,0.0003531725,0.00023054451,0.00009515488,0.00015980138,6.0884804e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036497277,0.00004999932,0.00014671888,0.000009885775,0.000113753114,9.004914e-8,0.0009949548,0.9198368,0.00013561227,0.077244624,0.000024970272,0.0014061057],"study_design_scores_gemma":[0.0005445634,0.00010165692,0.10024671,0.00006495598,0.0002957839,0.0000115382145,0.00010255601,0.5435656,0.0056236717,0.349078,0.00029911377,0.00006589276],"about_ca_topic_score_codex":0.0000073944207,"about_ca_topic_score_gemma":0.000004712847,"teacher_disagreement_score":0.58233196,"about_ca_system_score_codex":0.00003855009,"about_ca_system_score_gemma":0.00027787543,"threshold_uncertainty_score":0.23910083},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07887649,0.000013019946,0.9192539,0.000021188831,0.00005957571,0.0001124665,0.0000014385053,0.00011203705,0.0015498843],"genre_scores_gemma":[0.7366457,0.0000012694628,0.2631709,0.000110418,0.000030160967,0.000002066358,0.0000012228764,0.000004468143,0.000033796146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846256,0.00043539554,0.00028274924,0.0003495704,0.00021226543,0.00025749044],"domain_scores_gemma":[0.9989062,0.00010051927,0.00011595874,0.00063732936,0.00011782046,0.00012218492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018731187,0.00012623717,0.00033966717,0.00016549273,0.00012694727,0.000052791456,0.00025492994,0.000083287276,0.0000906873],"category_scores_gemma":[0.0000739051,0.000111000656,0.00015946405,0.0017290423,0.000060340364,0.00025623888,0.00008295524,0.00011826128,0.000002997868],"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.00001134699,0.0007725263,0.00491681,0.000047779064,0.0008906562,0.00017319023,0.0012046227,0.1937963,0.14168403,0.63165426,0.000031997497,0.024816455],"study_design_scores_gemma":[0.0001063822,0.0000673493,0.0011512971,0.00001228493,0.00013409219,0.000035849553,0.000026594447,0.95452654,0.03918068,0.0043708524,0.0001460203,0.00024203118],"about_ca_topic_score_codex":0.000054203058,"about_ca_topic_score_gemma":0.000026248243,"teacher_disagreement_score":0.76073027,"about_ca_system_score_codex":0.000020790745,"about_ca_system_score_gemma":0.00009643991,"threshold_uncertainty_score":0.45264754},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011706573,0.00011293881,0.99453473,0.0003181399,0.000310837,0.00026716365,0.0000011341648,0.00021409642,0.0041238954],"genre_scores_gemma":[0.20075852,0.000045235814,0.79180396,0.000711669,0.00049504905,0.00006633986,0.000011376116,0.0000141964865,0.0060936925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992871,0.000020114046,0.00014429628,0.00021899848,0.00009088387,0.00023856496],"domain_scores_gemma":[0.99954456,0.000057955258,0.000057350262,0.00025459396,0.00004040094,0.000045153338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016863256,0.00008189452,0.0000948162,0.000020700132,0.00014759527,0.000103837316,0.0003491458,0.000041173906,0.000110896784],"category_scores_gemma":[0.000017725755,0.0000671742,0.00003879198,0.00019206556,0.000010943842,0.0002573212,0.000051429986,0.000036813424,0.000012826612],"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.0000026996513,0.0000136480385,0.000076476594,0.000021368869,0.000008666327,6.929733e-7,0.00027349318,0.028031731,0.00012207427,0.9305445,0.015341604,0.025563037],"study_design_scores_gemma":[0.0002776298,0.00003279401,0.000082675375,0.000009309341,0.000001925317,0.0000033333047,0.000003024769,0.8292825,0.000109346576,0.16207787,0.008012114,0.00010747773],"about_ca_topic_score_codex":0.0000032084768,"about_ca_topic_score_gemma":0.0000059910653,"teacher_disagreement_score":0.80125076,"about_ca_system_score_codex":0.00000956578,"about_ca_system_score_gemma":0.000004795352,"threshold_uncertainty_score":0.27392846},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005953312,0.0030620452,0.38890946,0.000030421459,0.00013707858,0.00012235815,0.000027309608,0.00013967417,0.6075657],"genre_scores_gemma":[0.027101174,0.035721697,0.5278484,0.0012964011,0.005220571,0.00036874376,0.0009685632,0.0010930614,0.40038136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992604,0.000026889551,0.0001232259,0.000358198,0.00008276707,0.00014846551],"domain_scores_gemma":[0.99943554,0.00008991357,0.00007226941,0.00035858547,0.0000056871645,0.000037981074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000032997217,0.0001523946,0.00017982937,0.000033007185,0.0000223053,0.000037009453,0.0003457329,0.00008617804,0.0000758388],"category_scores_gemma":[0.000010561885,0.000130344,0.000025928128,0.00029227056,0.00008181185,0.0003129894,0.000107224216,0.0001431578,0.000009310407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008973588,0.00015445348,0.00003644054,0.00019581968,0.000024107278,0.000004630739,0.00036749078,0.00035657155,0.00079859374,0.50740767,0.014964414,0.4756808],"study_design_scores_gemma":[0.00019917355,0.000007814313,0.0000010929123,0.00014848632,0.0000038122764,0.0000022510765,0.000010809351,0.00889349,0.0037499373,0.5168353,0.46988228,0.0002655671],"about_ca_topic_score_codex":0.0000071391555,"about_ca_topic_score_gemma":0.000001497753,"teacher_disagreement_score":0.47541523,"about_ca_system_score_codex":0.000008846485,"about_ca_system_score_gemma":0.000015355474,"threshold_uncertainty_score":0.5315274},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0632178,0.0058279764,0.9142156,0.009803955,0.0011997179,0.00020029815,3.2052952e-7,0.000061397026,0.005472922],"genre_scores_gemma":[0.9986728,0.00033508943,0.0003979048,0.0001472031,0.000109341476,0.000001359007,1.02251285e-7,0.000007081557,0.0003291244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862677,0.00009797694,0.00031248172,0.00009977634,0.0004074489,0.0004555421],"domain_scores_gemma":[0.99908704,0.000070346265,0.00028777332,0.00032530434,0.00015419317,0.000075347925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013647485,0.00011456382,0.00016853424,0.000077534656,0.00015806078,0.000084855266,0.0015633501,0.0000373643,0.000005360067],"category_scores_gemma":[0.000022271292,0.00007173193,0.000120615,0.00042307755,0.000040198516,0.00032535536,0.00011175183,0.000604378,0.000025809955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007749599,0.000095469106,0.0000042178563,0.0000042664683,0.000027941951,0.000016858463,0.0002998177,0.000415031,0.00009903941,0.9975734,0.00011017777,0.0013460333],"study_design_scores_gemma":[0.0007297694,0.0005034969,0.000026582484,0.00001749619,0.000014176118,0.00070236967,0.000026509004,0.000136563,0.0018400714,0.9875685,0.008341116,0.00009336321],"about_ca_topic_score_codex":0.000002955081,"about_ca_topic_score_gemma":7.086937e-7,"teacher_disagreement_score":0.935455,"about_ca_system_score_codex":0.00027529744,"about_ca_system_score_gemma":0.0005389503,"threshold_uncertainty_score":0.2925143},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003227023,0.00066206645,0.18181738,0.00009470891,0.0009103002,0.00033271336,0.000019031124,0.0005824042,0.81554914],"genre_scores_gemma":[0.002584838,0.00078506843,0.03959119,0.0008157078,0.0011070834,0.00011601807,0.00019327294,0.0001386798,0.95466816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980622,0.000018571734,0.0004333473,0.00061049097,0.00035674553,0.00051866495],"domain_scores_gemma":[0.9986867,0.00006461924,0.00015932236,0.00085341895,0.000063290114,0.00017265686],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039400958,0.0005044207,0.000506507,0.00052750984,0.00021511373,0.00028084614,0.0015763241,0.0004497535,0.00008191021],"category_scores_gemma":[0.0000033167241,0.00042373783,0.00037682618,0.0003707449,0.00038805095,0.0005182851,0.00015926962,0.0006374751,0.000116092146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030758063,0.000017897964,0.0000015616854,0.000074977565,0.00005574456,0.000030194584,0.0007556252,0.0000011621385,0.000008841112,0.8809404,0.003941125,0.11414174],"study_design_scores_gemma":[0.00018893847,0.000109883884,0.000013206831,0.000066488596,0.00002282123,0.000033162596,0.00006652935,0.0000376002,0.0006909314,0.5006,0.49760255,0.0005679135],"about_ca_topic_score_codex":0.000002712215,"about_ca_topic_score_gemma":0.000010075536,"teacher_disagreement_score":0.49366143,"about_ca_system_score_codex":0.000041463507,"about_ca_system_score_gemma":0.0001609391,"threshold_uncertainty_score":0.9998214},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031752258,0.0011775728,0.9816811,0.013181085,0.00018224384,0.00041521605,0.0000076263186,0.0001178978,0.00006202203],"genre_scores_gemma":[0.63697565,0.005247091,0.19413355,0.1577371,0.00417238,0.000786793,0.000042745487,0.00013802334,0.000766693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989592,0.00008854297,0.00018052361,0.00032297987,0.00016945424,0.0002793078],"domain_scores_gemma":[0.99915844,0.0002812606,0.00005944243,0.00038142595,0.000039083257,0.000080358965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003425843,0.00013553492,0.00025121088,0.000027828211,0.00010160303,0.000044963333,0.0005016984,0.000008424484,0.000007966769],"category_scores_gemma":[0.0000873256,0.000086533335,0.0001551158,0.00021355088,0.000032763863,0.0004331978,0.000081277634,0.000058628404,0.00011176539],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018846999,0.00025656805,0.00004250386,0.0016279026,0.000072661904,0.000011789466,0.0001370421,0.000086959444,0.260587,0.3055898,0.008442154,0.4231268],"study_design_scores_gemma":[0.0046814433,0.0008052709,0.0005662741,0.012117026,0.0003685817,0.00007560871,0.0000048322254,0.42039162,0.052116763,0.10751402,0.3982465,0.003112089],"about_ca_topic_score_codex":0.0000018434322,"about_ca_topic_score_gemma":4.9384962e-8,"teacher_disagreement_score":0.7875476,"about_ca_system_score_codex":0.000030350739,"about_ca_system_score_gemma":0.000018408686,"threshold_uncertainty_score":0.3528727},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.1122036e-7,0.00010043022,0.33875576,0.000078673016,0.00055291347,0.00010639461,0.0000024949018,0.00049691804,0.65990615],"genre_scores_gemma":[0.000008835426,0.000017220142,0.071811154,0.0009755027,0.00065854756,0.0000026351177,0.00000926563,0.00012043705,0.9263964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885374,0.000034945893,0.00013687888,0.00043245516,0.00027053064,0.0002714323],"domain_scores_gemma":[0.99896497,0.000047935373,0.00008816023,0.00079274416,0.000010190178,0.00009598108],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002477356,0.00022420379,0.00020064753,0.0003585009,0.000032331376,0.00004629368,0.0009937936,0.00022368736,0.014824337],"category_scores_gemma":[0.000007614307,0.0001730015,0.00008473541,0.0002334942,0.00003103138,0.000045404362,0.00017033234,0.0002135026,0.02562045],"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.0000012798763,0.000031767435,7.1271353e-7,0.000010162024,0.000015780703,0.000023125314,0.000010643206,5.3095295e-7,0.0000015067302,0.49756816,0.4745108,0.027825532],"study_design_scores_gemma":[0.00011418711,0.00004564075,9.848101e-7,0.000045296605,0.0000031919271,0.000006213275,0.0000012144493,0.0006587085,0.0004887157,0.002108294,0.9962822,0.0002453456],"about_ca_topic_score_codex":0.0000264609,"about_ca_topic_score_gemma":0.0000028129198,"teacher_disagreement_score":0.52177143,"about_ca_system_score_codex":0.000011865406,"about_ca_system_score_gemma":0.000030200335,"threshold_uncertainty_score":0.98607624},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03068651,0.0014787038,0.95933115,0.005414812,0.00084213493,0.00075133244,0.000014582487,0.00038794044,0.0010928393],"genre_scores_gemma":[0.5931096,0.00008289616,0.40470275,0.0007621105,0.00043801422,0.0001179742,0.0000023526022,0.00003417638,0.0007501215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828595,0.000057454392,0.00029169655,0.00066034985,0.00021682962,0.00048769274],"domain_scores_gemma":[0.998962,0.00026841564,0.00006237161,0.00046897956,0.000064599335,0.00017367529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035822685,0.00021624354,0.00030168958,0.000115296105,0.00017180963,0.000099201796,0.0004894606,0.0000441145,0.000039260332],"category_scores_gemma":[0.00013736529,0.00018545231,0.00007376147,0.00058760616,0.00008659865,0.00029283165,0.00024915845,0.00021517236,0.000052101626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021386953,0.00052258896,0.0020338104,0.000052032225,0.000043263684,0.00009485368,0.0008110309,0.0005887314,0.0007394117,0.068203345,0.0014313392,0.9254582],"study_design_scores_gemma":[0.0011879813,0.00018482537,0.0013028055,0.000022449189,0.000009903543,0.00011261125,0.000015993854,0.9494797,0.0005894774,0.031824067,0.014832255,0.00043790461],"about_ca_topic_score_codex":0.00005966428,"about_ca_topic_score_gemma":0.0000057625316,"teacher_disagreement_score":0.948891,"about_ca_system_score_codex":0.000025459272,"about_ca_system_score_gemma":0.000012794575,"threshold_uncertainty_score":0.7562526},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0453744,0.00023338232,0.95175326,0.000018712708,0.0006963026,0.00040432572,0.000011519236,0.00019639466,0.0013117166],"genre_scores_gemma":[0.70491314,0.000076839846,0.29418546,0.00006648609,0.000108407716,0.0000011505671,0.000007255269,0.000016834021,0.0006244423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795973,0.0004140616,0.00019084553,0.0010682244,0.00003668218,0.00033046384],"domain_scores_gemma":[0.9983219,0.0004452228,0.00024107886,0.0006995626,0.0001357903,0.00015642912],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008315321,0.00031531666,0.00038519272,0.00020178885,0.00028433325,0.00014416243,0.001157467,0.00021675423,0.000015565],"category_scores_gemma":[0.000054406544,0.00033724259,0.00019159264,0.0002536552,0.00013578938,0.00028530168,0.0018605347,0.0003380184,0.000008548279],"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.000026813155,0.00004894192,0.00025630437,0.00013930941,0.00014973758,0.00003589237,0.0022881478,0.0046627233,0.000061185034,0.972622,0.000043645254,0.01966532],"study_design_scores_gemma":[0.00025861413,0.000069358524,0.0001624809,0.000056876146,0.000055198405,0.00000456607,0.00007289293,0.57656056,0.0016182438,0.4203781,0.00037306268,0.0003900491],"about_ca_topic_score_codex":0.00003994825,"about_ca_topic_score_gemma":0.0000025234847,"teacher_disagreement_score":0.6595387,"about_ca_system_score_codex":0.000058118687,"about_ca_system_score_gemma":0.00008664316,"threshold_uncertainty_score":0.999908},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60964364,0.024673173,0.3533332,0.0063797752,0.0014677775,0.00020446298,0.0000010505123,0.000059164573,0.004237728],"genre_scores_gemma":[0.9983699,0.00086803094,0.00023337334,0.00006927424,0.00014569829,5.0865566e-7,9.0273176e-8,0.0000063734215,0.00030680237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985501,0.00014116132,0.000421754,0.000084845684,0.00044419113,0.0003579359],"domain_scores_gemma":[0.9986909,0.00019233566,0.0005287118,0.00032876796,0.00020282852,0.00005647137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014005615,0.000105894476,0.00021966697,0.000110405446,0.00009046482,0.000037270922,0.0016505253,0.000038694587,0.000013092636],"category_scores_gemma":[0.000039000406,0.000067980225,0.00013130721,0.00047355468,0.000043947028,0.00042539157,0.00010726116,0.00041729555,0.000012063761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012739214,0.00012429141,0.000041709172,0.000008681764,0.00004507551,0.0000039772594,0.00033502854,0.0001853326,0.00023586095,0.9929539,0.00032198327,0.005731396],"study_design_scores_gemma":[0.0009402182,0.00061374344,0.00016098947,0.000035214718,0.000046818663,0.00047969556,0.000054589935,0.004511974,0.015713632,0.9452851,0.031988394,0.00016963731],"about_ca_topic_score_codex":0.0000016558486,"about_ca_topic_score_gemma":5.94736e-7,"teacher_disagreement_score":0.3887262,"about_ca_system_score_codex":0.00010690451,"about_ca_system_score_gemma":0.00024506808,"threshold_uncertainty_score":0.3067114},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042778914,0.00063305243,0.9880983,0.00090267044,0.00039147568,0.00034862218,0.0000122359015,0.00039760585,0.00878821],"genre_scores_gemma":[0.010470836,0.000048725935,0.9550602,0.00037127954,0.00044166928,0.000083803396,0.0000039960346,0.000021202652,0.033498276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846005,0.000048563412,0.0002604952,0.00050438463,0.00026735454,0.00045913763],"domain_scores_gemma":[0.99884504,0.00013942433,0.00008525862,0.0006940225,0.0000929786,0.00014327114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003808509,0.00019257978,0.00021728627,0.00011990971,0.00021778444,0.00027273706,0.0011033684,0.000078651276,0.00040039662],"category_scores_gemma":[0.000022880049,0.00016278004,0.00014313658,0.00038346683,0.000040925137,0.000698135,0.00020617053,0.00009759638,0.00029582487],"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.0000034394852,0.00009963408,0.0000037972584,0.000027059099,0.000030506424,0.000012939176,0.00022133834,0.000061825565,0.00007219767,0.3637384,0.01231511,0.62341374],"study_design_scores_gemma":[0.00073733303,0.0001558126,0.000013136735,0.000012072776,0.000010686267,0.000027567314,0.000053801356,0.9151616,0.0013875625,0.018948385,0.063195415,0.00029660758],"about_ca_topic_score_codex":0.000010935209,"about_ca_topic_score_gemma":0.0000012014441,"teacher_disagreement_score":0.9150998,"about_ca_system_score_codex":0.000036679943,"about_ca_system_score_gemma":0.000022577598,"threshold_uncertainty_score":0.66379774},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9174413,0.00023783896,0.055966888,0.0028163777,0.0044450583,0.00042771598,0.000028874625,0.0001682175,0.018467728],"genre_scores_gemma":[0.99278456,0.000036999634,0.0020178177,0.0002967582,0.0023983624,0.00003527934,0.000008030872,0.000018115446,0.0024040972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833155,0.00018663674,0.0003372331,0.00056402857,0.0002945554,0.00028601367],"domain_scores_gemma":[0.9980005,0.00049181056,0.00026333195,0.0010746672,0.00010808775,0.00006158597],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003026283,0.00029570542,0.00030850843,0.000103889586,0.00019668693,0.00008891601,0.001231212,0.00011422407,0.0010014946],"category_scores_gemma":[0.00014665928,0.00020860844,0.00018957345,0.00033874286,0.00022185194,0.00014700928,0.0007525265,0.0006018354,0.00022673889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057598554,0.00038611767,0.00353815,0.000080791084,0.00018664535,0.00009026823,0.0011293987,0.004800474,0.00020689244,0.98388696,0.002124572,0.0035121138],"study_design_scores_gemma":[0.0017157808,0.00092340464,0.11368339,0.0008119523,0.00011697757,0.000063447995,0.0002858917,0.0011816323,0.02278967,0.8415017,0.015247277,0.0016788556],"about_ca_topic_score_codex":0.000078138066,"about_ca_topic_score_gemma":0.000015332962,"teacher_disagreement_score":0.14238526,"about_ca_system_score_codex":0.000070698676,"about_ca_system_score_gemma":0.00021635716,"threshold_uncertainty_score":0.9999117},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003415907,0.000039574104,0.99537545,0.00031743848,0.000055136006,0.00079190446,0.000018903902,0.00028625253,0.0030811534],"genre_scores_gemma":[0.013262985,0.0000035042372,0.98395413,0.00041045097,0.00014296963,0.0013913515,0.000012906429,0.000022305729,0.0007994059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876183,0.000076333854,0.00023574944,0.0004867673,0.000118072545,0.00032124086],"domain_scores_gemma":[0.99856484,0.00026596244,0.0001066236,0.0007314705,0.0001309546,0.00020012198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032543845,0.00017371215,0.00020235758,0.00006799194,0.00023460985,0.000037882808,0.00086289673,0.00006799283,0.00007006455],"category_scores_gemma":[0.00003482798,0.00013604733,0.00008627922,0.00047635703,0.00008533807,0.00017969272,0.00012332395,0.00014146848,0.000103434446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001809201,0.00017879638,0.000024816356,0.000012070609,0.0000223752,5.2307354e-7,0.00027422822,0.000010932836,0.00009875528,0.5249048,0.000076467615,0.47437814],"study_design_scores_gemma":[0.0010038085,0.0003840113,0.0009951349,0.000013961778,0.000048874103,0.000039053815,0.00006487803,0.7733704,0.008127021,0.07050986,0.14473568,0.0007073434],"about_ca_topic_score_codex":0.000010132899,"about_ca_topic_score_gemma":4.781751e-7,"teacher_disagreement_score":0.7733594,"about_ca_system_score_codex":0.000017258608,"about_ca_system_score_gemma":0.000056914745,"threshold_uncertainty_score":0.5547849},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6106618,0.0010841287,0.38539785,0.00003103884,0.0011530535,0.00038918018,0.000024889163,0.00012673366,0.0011313237],"genre_scores_gemma":[0.99323493,0.000735303,0.005208461,0.00002157597,0.000266948,0.000022781674,0.000036539474,0.000020063364,0.00045337193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821836,0.00013209952,0.0005189038,0.0006094307,0.00027994174,0.00024128491],"domain_scores_gemma":[0.9978982,0.00056300336,0.0004926148,0.0006880076,0.00025375627,0.000104394945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038563777,0.0002560687,0.00044719118,0.00038850508,0.00014601566,0.00008450642,0.00070521585,0.00026248838,0.0000068488575],"category_scores_gemma":[0.00038989278,0.0002563924,0.00009328362,0.000797865,0.00007517237,0.00022168181,0.00074451754,0.00038958414,0.000032818683],"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.00008702447,0.0009664326,0.11516892,0.0067378185,0.0009227997,0.0003778261,0.005135952,0.6862341,0.0013603002,0.029670712,0.00057804724,0.15276003],"study_design_scores_gemma":[0.000420946,0.00020745724,0.00857807,0.00043807257,0.000040300507,0.00007409343,0.000032862896,0.9854453,0.003108645,0.0006710309,0.00047090912,0.00051230023],"about_ca_topic_score_codex":0.00007046583,"about_ca_topic_score_gemma":5.9038837e-7,"teacher_disagreement_score":0.38257316,"about_ca_system_score_codex":0.00004161223,"about_ca_system_score_gemma":0.00008200185,"threshold_uncertainty_score":0.99998885},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2049634,0.0012070828,0.7851065,0.0003654422,0.00052027166,0.00085687544,0.000040349518,0.00032376143,0.0066163475],"genre_scores_gemma":[0.9687009,0.000015784108,0.029817736,0.00023069627,0.00023667124,0.00012814118,0.0000045986503,0.000020005702,0.0008455022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985103,0.00011034432,0.00030235943,0.00051974657,0.0001509303,0.0004063019],"domain_scores_gemma":[0.9984412,0.0006490377,0.00019284456,0.00051980634,0.00006472729,0.0001323477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018870543,0.00020636615,0.00027767837,0.0006414527,0.00019229765,0.00016400185,0.00086326455,0.00006785975,0.00007243703],"category_scores_gemma":[0.00012842046,0.00016088359,0.00013245127,0.0018731608,0.00008123864,0.00056335115,0.00012568627,0.00012013564,0.00007277314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103667284,0.00015081457,0.0003909999,0.000060723687,0.00006273473,0.000007037951,0.00051849446,0.0002973488,0.0000029645882,0.9742662,0.000043418167,0.02409565],"study_design_scores_gemma":[0.0066170525,0.0014884766,0.005734802,0.00007022228,0.000080827216,0.00017294107,0.000338065,0.0013706511,0.001958645,0.9586442,0.022067659,0.0014564693],"about_ca_topic_score_codex":0.000008986296,"about_ca_topic_score_gemma":0.0000041038315,"teacher_disagreement_score":0.76373744,"about_ca_system_score_codex":0.0000935089,"about_ca_system_score_gemma":0.00017199042,"threshold_uncertainty_score":0.6560642},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5830155,0.0016540623,0.4064616,0.0011544491,0.00091036735,0.0007601925,0.000115058036,0.00039235866,0.0055363732],"genre_scores_gemma":[0.8958539,0.000026415008,0.10289554,0.00014049743,0.00016129814,0.000004563878,0.000012907267,0.000014044696,0.0008908527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988888,0.0001064574,0.00025832406,0.00029332752,0.00023655986,0.00021653321],"domain_scores_gemma":[0.9990344,0.00013513143,0.000089780544,0.00036961187,0.00016515612,0.0002059426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043174485,0.00014473234,0.00024419933,0.000079366844,0.000058527243,0.000040518455,0.0004495128,0.000067503956,0.000015561925],"category_scores_gemma":[0.00010724775,0.00012444121,0.00007274373,0.0002097638,0.00008855044,0.00030160314,0.00028114207,0.00012502547,0.000042984255],"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.0010952427,0.0013261477,0.00448303,0.0005067314,0.00050814496,0.00026849197,0.019447073,0.001964836,0.009067736,0.8391946,0.0051177684,0.11702019],"study_design_scores_gemma":[0.004190776,0.00059330044,0.0018207785,0.0000637036,0.00003850566,0.00007481011,0.00031849986,0.93258184,0.036762927,0.010758856,0.01225664,0.00053934247],"about_ca_topic_score_codex":0.000076208096,"about_ca_topic_score_gemma":0.0000025459872,"teacher_disagreement_score":0.93061703,"about_ca_system_score_codex":0.000008904101,"about_ca_system_score_gemma":0.00005495398,"threshold_uncertainty_score":0.50745654},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017772304,0.00030899703,0.97883534,0.00055636384,0.000097395794,0.0018776772,0.000020029865,0.00004731334,0.018079128],"genre_scores_gemma":[0.27182096,0.0029543345,0.412487,0.0017488238,0.0023187718,0.006722627,0.00012446029,0.00048343983,0.3013396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857086,0.000026788342,0.0005400744,0.00038208306,0.00024034666,0.00023986753],"domain_scores_gemma":[0.998479,0.0004147857,0.00027839188,0.0006868355,0.000078256424,0.00006272082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042378416,0.0002513489,0.00030270146,0.00021621816,0.00034813693,0.0002111636,0.0007300777,0.00014651891,0.000050814153],"category_scores_gemma":[0.000020167034,0.00018264279,0.000081190505,0.00022634686,0.00008442095,0.00015655623,0.0003427996,0.00041481844,0.000059477898],"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":[8.4777014e-7,0.00008767196,0.0000017971465,0.00010163238,0.000027108475,0.0000013356432,0.0022000151,0.0006531982,0.00016497231,0.98798156,0.0001625453,0.008617327],"study_design_scores_gemma":[0.0001515894,0.000014944278,0.000012498788,0.00019759613,0.000030191373,0.000016833266,0.00012036708,0.6957456,0.0000035743228,0.28220704,0.02126253,0.00023725428],"about_ca_topic_score_codex":0.0000137291445,"about_ca_topic_score_gemma":0.000059939997,"teacher_disagreement_score":0.7057745,"about_ca_system_score_codex":0.00008286155,"about_ca_system_score_gemma":0.00003717321,"threshold_uncertainty_score":0.7447957},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58799744,0.00001657697,0.40712646,0.00059438904,0.0009162066,0.00018585952,0.000059482034,0.00011803203,0.0029855499],"genre_scores_gemma":[0.99377364,0.00011241106,0.0043191183,0.000788097,0.00061277195,0.000006247013,0.00013166646,0.000013865361,0.00024220385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818265,0.00004248619,0.00032823154,0.00055030594,0.0005261968,0.00037012497],"domain_scores_gemma":[0.9985187,0.000105384046,0.00019509133,0.00083097664,0.00018514879,0.00016471106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005459592,0.00026658835,0.00022277211,0.00018228895,0.00022881971,0.00034044037,0.0016059362,0.000077303346,0.00003494578],"category_scores_gemma":[0.00001511514,0.00021143054,0.00002752495,0.00020974659,0.00010135718,0.0011113287,0.00035212084,0.00029200275,0.00010580782],"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.00027573114,0.0009020963,0.03898507,0.0001358332,0.00031890438,0.000013354448,0.0012750105,0.009599943,0.0002407989,0.7696976,0.0039008735,0.17465478],"study_design_scores_gemma":[0.00057086773,0.00021932898,0.0049581053,0.00013364783,0.000017391762,0.000025830237,0.000030760846,0.98550147,0.0012702174,0.00053904485,0.0063817226,0.00035164013],"about_ca_topic_score_codex":0.00001421428,"about_ca_topic_score_gemma":0.0000032257208,"teacher_disagreement_score":0.9759015,"about_ca_system_score_codex":0.00005149357,"about_ca_system_score_gemma":0.00005756598,"threshold_uncertainty_score":0.86218876},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062726657,0.000052734045,0.96831423,0.00034678556,0.000044691056,0.000045759843,3.5789014e-7,0.0000942438,0.024828559],"genre_scores_gemma":[0.8469743,0.000006676689,0.15233631,0.00011076598,0.000026796033,8.8663927e-7,5.6834915e-7,0.000001936176,0.0005417179],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995378,0.0000352711,0.00013429618,0.0001088697,0.00010672459,0.00007703448],"domain_scores_gemma":[0.9997395,0.000048656508,0.000035788475,0.00011322326,0.000026937607,0.00003583854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016993504,0.000047739853,0.000075476826,0.00004684455,0.000031229807,0.000018592185,0.00019557947,0.000021250715,0.00004494624],"category_scores_gemma":[0.0000038946614,0.00003755871,0.000034457622,0.00016058817,0.000013841868,0.00024302896,0.000025809031,0.000029631154,0.000033179123],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004314959,0.000058287405,0.000019543937,0.000013164957,0.0000044632848,7.7446873e-7,0.00052126736,0.003046665,0.0057192403,0.06793635,0.00024848134,0.9224275],"study_design_scores_gemma":[0.00041830694,0.000085867,0.0004374304,0.000028622997,0.0000034677248,0.000005304941,0.000009421212,0.7246463,0.24563684,0.0072727627,0.021308409,0.0001472709],"about_ca_topic_score_codex":0.0000037733287,"about_ca_topic_score_gemma":2.627365e-7,"teacher_disagreement_score":0.9222802,"about_ca_system_score_codex":0.0000046220857,"about_ca_system_score_gemma":0.000012442329,"threshold_uncertainty_score":0.15315998},"labels":[],"label_agreement":null},{"id":"W1840032205","doi":"10.1002/nla.1823","title":"On condition numbers for Moore–Penrose inverse and linear least squares problem involving Kronecker products","year":2012,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Kronecker product; Mathematics; Kronecker delta; Combinatorics; Moore–Penrose pseudoinverse; Inverse; Rank (graph theory); Linear least squares; Least-squares function approximation; Product (mathematics); Condition number; Applied mathematics; Upper and lower bounds; Matrix (chemical analysis); Linear model; Statistics; Mathematical analysis; Geometry","score_opus":0.012650691698895641,"score_gpt":0.25487471741778867,"score_spread":0.242224025718893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1840032205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013605905,0.0001248629,0.9820059,0.0017899696,0.00007014475,0.0015982287,0.000039082246,0.0002164166,0.0005494903],"genre_scores_gemma":[0.54350823,0.0000092740365,0.45378736,0.00065597927,0.00046045356,0.0011229692,0.00009648554,0.00003407266,0.0003252162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858356,0.00005546886,0.00023999387,0.0004947847,0.00022327113,0.00040292737],"domain_scores_gemma":[0.99875337,0.00020867665,0.00013458777,0.0005004554,0.00014466507,0.00025825872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028401217,0.00020969175,0.00019864981,0.00007839806,0.0003354203,0.000073803814,0.00031952123,0.00007583786,0.000024450806],"category_scores_gemma":[0.000053275337,0.00017065622,0.000041637664,0.0005284875,0.00013510203,0.0005492612,0.00009370284,0.00019024806,0.0001709262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007128906,0.0006876302,0.001039896,0.00014687244,0.000050479375,0.0000010249084,0.0009125687,0.0005707205,0.0006301033,0.9773323,0.001642078,0.016915014],"study_design_scores_gemma":[0.006366896,0.002467549,0.0053646974,0.00030645408,0.00029617897,0.00022361576,0.0007537159,0.45563403,0.02330247,0.14552207,0.35622805,0.0035342737],"about_ca_topic_score_codex":0.000008707094,"about_ca_topic_score_gemma":0.0000015014508,"teacher_disagreement_score":0.83181024,"about_ca_system_score_codex":0.000034257897,"about_ca_system_score_gemma":0.00005852814,"threshold_uncertainty_score":0.6959158},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012973357,0.000059768063,0.98506737,0.0002051862,0.0005683468,0.0003504021,0.00002246233,0.00004135122,0.0007117418],"genre_scores_gemma":[0.9731341,0.000016285356,0.025005635,0.000095286065,0.000098104065,0.0000023774,0.0000067478154,0.000008418329,0.0016330426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862605,0.00033369617,0.00019484463,0.00048869953,0.00010923786,0.00024744],"domain_scores_gemma":[0.99713373,0.0007034403,0.00044030018,0.0015004255,0.0001664487,0.00005565479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016162785,0.00017879764,0.00030296863,0.00020879332,0.00027312944,0.00006726667,0.0022903706,0.00015004502,0.000028695033],"category_scores_gemma":[0.00009809076,0.00012300618,0.0006243777,0.0012717077,0.00008611068,0.00022928747,0.0015419405,0.00028061128,0.000004519474],"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.000012475221,0.00004161947,0.0005975679,0.000040990286,0.000737144,0.0000014410036,0.00076065597,0.25666812,0.00005470973,0.7376398,0.00005801407,0.0033874884],"study_design_scores_gemma":[0.00011661081,0.000007865301,0.0007429671,0.0000174815,0.0010692189,4.0358387e-7,0.000060559352,0.908789,0.00046676773,0.08812985,0.000450914,0.00014840001],"about_ca_topic_score_codex":0.00008045626,"about_ca_topic_score_gemma":0.000024006544,"teacher_disagreement_score":0.96016073,"about_ca_system_score_codex":0.00006579605,"about_ca_system_score_gemma":0.000090726106,"threshold_uncertainty_score":0.5016047},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001474553,0.00009455814,0.9968923,0.00016312182,0.00024171024,0.000042815915,5.602704e-7,0.00015547212,0.0009349163],"genre_scores_gemma":[0.25715044,0.000059420607,0.74164945,0.00013770036,0.0001272125,0.000010057235,0.00000920392,0.000013125963,0.00084338407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996029,0.000008034997,0.00007629368,0.00011578369,0.00008710267,0.000109880064],"domain_scores_gemma":[0.9997404,0.00000914927,0.000016989661,0.00010814751,0.000033977158,0.0000912896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010902789,0.000066142486,0.000059926264,0.000046601228,0.000031747808,0.000099992576,0.00011619013,0.000023847088,0.0000049490654],"category_scores_gemma":[0.000025113952,0.000063703286,0.000010522153,0.00015560775,0.000005497484,0.00035054388,0.00006713622,0.000040774372,0.0000053415474],"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.0000011451104,0.000006129228,0.000030508341,0.000008391243,0.0000034057166,0.0000021494586,0.00028245398,0.9806164,0.00006720397,0.017372666,0.00017049685,0.0014390865],"study_design_scores_gemma":[0.00020694788,0.000018570392,0.000039430968,0.000006989686,0.0000013152717,0.000009752855,0.00001533997,0.99449825,0.00014657709,0.0001093089,0.0048580677,0.00008944869],"about_ca_topic_score_codex":0.0000011074496,"about_ca_topic_score_gemma":4.1874706e-8,"teacher_disagreement_score":0.2556759,"about_ca_system_score_codex":0.000014263361,"about_ca_system_score_gemma":0.000011927642,"threshold_uncertainty_score":0.25977448},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004150335,0.0000704809,0.20902082,0.00036390958,0.00027852922,0.00008646725,0.0000022443676,0.000062051964,0.79011136],"genre_scores_gemma":[0.0011604417,0.000018991981,0.029191261,0.0002741295,0.00030916283,0.000002722296,0.000008671141,0.000007712481,0.9690269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994736,0.0000069626335,0.00012994478,0.00021544765,0.00010447663,0.000069586175],"domain_scores_gemma":[0.9996324,0.000046305646,0.00006233259,0.00017948056,0.000032032516,0.000047450383],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007649693,0.00011512703,0.0001014668,0.00006831533,0.00004692772,0.00014180505,0.000209246,0.00010179788,0.0019901246],"category_scores_gemma":[0.0000034283955,0.00009752803,0.00003397319,0.000007573315,0.000032160773,0.00027786396,0.00015831842,0.00010342333,0.00047713937],"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":[9.3484715e-7,0.0000013173715,3.859422e-7,0.0000030936017,0.0000067749243,9.287911e-7,0.000025296733,2.0199988e-7,0.000012929788,0.95158255,0.016348643,0.03201695],"study_design_scores_gemma":[0.0002224122,0.00006665504,0.000029276565,0.000039709943,0.000008335364,0.000041809337,0.0000020901637,0.058306858,0.00005705592,0.2975872,0.6432307,0.00040796289],"about_ca_topic_score_codex":0.000003822822,"about_ca_topic_score_gemma":0.000001206689,"teacher_disagreement_score":0.6539954,"about_ca_system_score_codex":0.000009265003,"about_ca_system_score_gemma":0.00002781013,"threshold_uncertainty_score":0.99892217},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92370343,0.0038324967,0.057472903,0.0033588612,0.0010586856,0.0008679401,0.000010946774,0.000033502616,0.0096612545],"genre_scores_gemma":[0.97477406,0.000098863646,0.024967548,0.00004525327,0.000034907043,0.000034941084,3.5153278e-8,0.0000014920897,0.00004287633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882805,0.00008065848,0.0003307871,0.00015139463,0.000356806,0.0002522842],"domain_scores_gemma":[0.9969073,0.0026072059,0.000201119,0.00020650911,0.000046762056,0.00003110412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003661502,0.00008175406,0.00022549604,0.0000765212,0.0001407092,0.000016463935,0.00090378895,0.000018600767,0.00003667083],"category_scores_gemma":[0.00078232336,0.000041371706,0.000051775463,0.0005525256,0.000768394,0.00023129067,0.00022811303,0.00004751907,0.000006220708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030945062,0.00007337647,0.00021985761,0.00014548817,0.000013341235,1.3843064e-7,0.0059295883,0.000026092586,0.00006514821,0.9924089,0.0002526357,0.00086235837],"study_design_scores_gemma":[0.000111717505,0.00027058795,0.00013275817,0.00026094887,0.000009131556,0.0000028109669,0.006711396,0.004575712,0.012025487,0.97567683,0.00012150557,0.00010108921],"about_ca_topic_score_codex":0.000002125301,"about_ca_topic_score_gemma":5.1834564e-7,"teacher_disagreement_score":0.051070675,"about_ca_system_score_codex":0.000012859843,"about_ca_system_score_gemma":0.000021740445,"threshold_uncertainty_score":0.28311798},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14981923,0.000018190709,0.8483544,0.00006375,0.0008233013,0.00039223075,0.000030251951,0.00004390225,0.000454719],"genre_scores_gemma":[0.97086966,9.2704687e-7,0.02874628,0.000011380545,0.000044168904,0.000011847689,0.00003367811,0.0000042890542,0.0002777456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858665,0.00007241756,0.00049576577,0.00035166915,0.00029649658,0.00019699775],"domain_scores_gemma":[0.9983961,0.00028226298,0.0003860134,0.00040172308,0.00048127692,0.00005263445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008726742,0.00009864826,0.00019964007,0.0002029705,0.00032308034,0.00008130309,0.0005329637,0.000034482247,0.000025216023],"category_scores_gemma":[0.000040071194,0.0000940748,0.000075979544,0.00042954818,0.00015290342,0.00022851468,0.00009503145,0.000057254674,0.000011459079],"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.000010328839,0.000090543625,0.00013579724,0.00008327432,0.000019569032,8.5980787e-7,0.0028497109,0.006114323,0.0027427813,0.97833437,0.00028469058,0.009333726],"study_design_scores_gemma":[0.0008967201,0.00013140425,0.00079342816,0.00009421799,0.000007691975,0.0000041073354,0.0004182367,0.97977215,0.011434064,0.0060799825,0.0002118623,0.00015613007],"about_ca_topic_score_codex":0.000017408547,"about_ca_topic_score_gemma":0.000002783807,"teacher_disagreement_score":0.97365785,"about_ca_system_score_codex":0.000015519672,"about_ca_system_score_gemma":0.00019761824,"threshold_uncertainty_score":0.3836259},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11330688,0.00003132191,0.8748381,0.00048970315,0.0009422273,0.00043986243,0.00005562681,0.00011628532,0.009779996],"genre_scores_gemma":[0.99605244,0.00004384376,0.0023215301,0.000057531062,0.00006940672,7.24105e-7,0.00000627146,0.000011725132,0.001436501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986351,0.00019316091,0.00019202002,0.00059130974,0.00015238774,0.00023598033],"domain_scores_gemma":[0.9982009,0.00008725738,0.0002363486,0.0012397154,0.00011753618,0.00011826265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039489585,0.00024412859,0.00027286654,0.00021296421,0.00012933603,0.000054832173,0.0020035831,0.0002069683,0.000017120634],"category_scores_gemma":[0.000012256989,0.00019953854,0.00031552708,0.00059927144,0.00011893846,0.00023611817,0.0008343582,0.00047910988,0.000031860192],"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.00019456072,0.00017277575,0.00013531142,0.00016828992,0.00011224364,0.00011229753,0.000940602,0.19784735,0.000098742465,0.79547596,0.00064844993,0.0040934063],"study_design_scores_gemma":[0.0006474632,0.00011307851,0.00016052258,0.00020031855,0.000087004104,0.0000070144847,0.000043988257,0.6055837,0.0019450817,0.38994098,0.00088855374,0.00038227977],"about_ca_topic_score_codex":0.000044467946,"about_ca_topic_score_gemma":0.000012021422,"teacher_disagreement_score":0.88274556,"about_ca_system_score_codex":0.000108933,"about_ca_system_score_gemma":0.00015644282,"threshold_uncertainty_score":0.81369454},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05964952,0.0002594381,0.9340208,0.00096729636,0.0001289817,0.00014454803,0.0000020066032,0.000011713404,0.00481566],"genre_scores_gemma":[0.09357704,0.000008821537,0.90623444,0.000019279167,0.000059258593,0.0000010378357,4.350516e-8,0.000006455238,0.00009364164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711615,0.0006051945,0.00061665766,0.00009455476,0.0013007998,0.00026663387],"domain_scores_gemma":[0.9960597,0.0017043978,0.0003563255,0.00036298617,0.0012359191,0.00028068273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018257817,0.00007666303,0.0003245754,0.00052498066,0.000069853304,0.00012284247,0.0015522792,0.00004263773,0.000016547403],"category_scores_gemma":[0.0010629847,0.00005632617,0.00008089726,0.00079032074,0.00006389912,0.00025825575,0.000531093,0.00039338466,0.00002853514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008710001,0.0009311164,0.00023844748,0.0009627526,0.00022027918,0.0003205426,0.036158305,0.0013526788,0.008944305,0.7211751,0.012599321,0.21701007],"study_design_scores_gemma":[0.0013648752,0.001400069,0.000043256263,0.000820841,0.000022311313,0.0022760744,0.008656668,0.12392802,0.039663676,0.8161596,0.0053852596,0.00027932983],"about_ca_topic_score_codex":0.0000064710075,"about_ca_topic_score_gemma":4.3747855e-7,"teacher_disagreement_score":0.21673074,"about_ca_system_score_codex":0.00004898293,"about_ca_system_score_gemma":0.00029530158,"threshold_uncertainty_score":0.6327832},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007594601,0.0002994541,0.14818037,0.00016387763,0.0002827593,0.00036275742,0.0000047327435,0.00028112365,0.8504173],"genre_scores_gemma":[0.008564242,0.00045233362,0.22607064,0.0006086973,0.0011325013,0.000116572395,0.0000067492033,0.00009010715,0.76295817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717534,0.000017676188,0.0005298307,0.0008123354,0.0009870806,0.0004777601],"domain_scores_gemma":[0.99833846,0.0003826457,0.00025591004,0.00075319374,0.000044920227,0.0002248985],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00083814294,0.00040023573,0.00058135815,0.00015964157,0.00047182775,0.00026848775,0.0023297616,0.00027205332,0.00024113887],"category_scores_gemma":[0.0000248634,0.0002940873,0.00014538139,0.0001544438,0.0008270278,0.00018575297,0.0004885491,0.00033449553,0.0030516717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.88081e-7,0.000018462466,3.5303604e-8,0.00007080225,0.0000122464335,0.00002427188,0.00013422898,0.000030296285,0.00000882512,0.9947182,0.001389047,0.003592799],"study_design_scores_gemma":[0.00010971494,0.00007072382,4.9867424e-7,0.00016780547,0.0000151426075,0.00015155294,0.000012902389,0.015169331,0.00006177306,0.84863406,0.13503438,0.00057210575],"about_ca_topic_score_codex":0.0000014583374,"about_ca_topic_score_gemma":2.6106355e-7,"teacher_disagreement_score":0.14608413,"about_ca_system_score_codex":0.00003733861,"about_ca_system_score_gemma":0.00014966115,"threshold_uncertainty_score":0.9999511},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19019152,0.0013981853,0.8052435,0.00041144472,0.0002874443,0.00008300252,0.0000017860729,0.000031900905,0.002351247],"genre_scores_gemma":[0.7064348,0.000047846614,0.29299936,0.000019233274,0.00021847912,6.393659e-7,1.7618018e-7,0.000009854712,0.0002696166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985121,0.00006373087,0.00070684415,0.00008200475,0.0004715334,0.00016380545],"domain_scores_gemma":[0.9983737,0.00029159032,0.0007971993,0.00027696995,0.000198169,0.00006241272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085755816,0.000119457494,0.0003817106,0.00016188325,0.000038715025,0.00005268232,0.00082086975,0.000047147398,0.000048255904],"category_scores_gemma":[0.00007522539,0.00008419209,0.00015838155,0.00033277553,0.00004816449,0.00030371672,0.00007688542,0.00013822826,0.000023720839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005895096,0.002838247,0.0006195825,0.0015259846,0.00020528426,0.0005738626,0.004510451,0.003368574,0.010385113,0.95381695,0.004521942,0.017575046],"study_design_scores_gemma":[0.0022301595,0.00095690583,0.00060950284,0.0006185389,0.0002135916,0.004209639,0.0009237608,0.08595279,0.046815366,0.851658,0.005097147,0.0007146244],"about_ca_topic_score_codex":0.0000032690245,"about_ca_topic_score_gemma":2.5958215e-7,"teacher_disagreement_score":0.5162433,"about_ca_system_score_codex":0.000016667133,"about_ca_system_score_gemma":0.0000531877,"threshold_uncertainty_score":0.34332538},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034929425,0.00014804614,0.95155567,0.0004889712,0.0115624275,0.00046128282,0.0000099933695,0.000016546008,0.0008276423],"genre_scores_gemma":[0.86367154,0.00021994954,0.13509476,0.000016032564,0.0007905655,0.0000065779454,0.00001122751,0.00002343263,0.00016591087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763834,0.00028525927,0.0011275802,0.0001862883,0.00062448607,0.00013801444],"domain_scores_gemma":[0.9925323,0.000088531924,0.0056867837,0.0006401516,0.0010007292,0.00005149795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011452439,0.0001938892,0.00060437893,0.00019143688,0.00014129053,0.00020132145,0.0018216694,0.00021855519,0.0000065936742],"category_scores_gemma":[0.00029098592,0.00014302474,0.00024289625,0.0002424886,0.000092288356,0.00074453314,0.0005242896,0.00042328794,2.6122532e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004019471,0.0010369415,0.00082244026,0.0015791534,0.00041984665,0.000013544516,0.0051482012,0.8107003,0.019299546,0.15199922,0.00011542024,0.00846346],"study_design_scores_gemma":[0.0027663226,0.00064070965,0.00053483684,0.003528872,0.0002216285,0.000027274587,0.000041825566,0.8188672,0.050034516,0.12249571,0.00037620906,0.00046488474],"about_ca_topic_score_codex":0.0000057422117,"about_ca_topic_score_gemma":3.0371672e-7,"teacher_disagreement_score":0.82874215,"about_ca_system_score_codex":0.00005084243,"about_ca_system_score_gemma":0.0006199868,"threshold_uncertainty_score":0.58323795},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07384048,0.00040247935,0.9249797,0.00026995974,0.00032821103,0.00008991018,0.0000043162413,0.000012418271,0.00007251685],"genre_scores_gemma":[0.26833275,0.0000033198698,0.73155177,0.000014795093,0.000083158055,0.0000029092469,1.965153e-7,0.0000025887966,0.000008529593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895203,0.00009360484,0.00037333663,0.00017089803,0.00022807629,0.00018205785],"domain_scores_gemma":[0.9981034,0.0014081413,0.00017755754,0.000064339954,0.00017644922,0.000070103546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020364332,0.00010628914,0.00020764071,0.00022730825,0.00026660008,0.00019559743,0.00028212793,0.00003436987,8.8319973e-7],"category_scores_gemma":[0.00015381414,0.000086292894,0.000060786086,0.00033519525,0.00015634343,0.0006017419,0.00011171613,0.00011207451,1.7003526e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010471891,0.000024621691,0.00015098968,0.0000662831,0.000016481326,0.000007928361,0.0007643918,0.8860454,0.00029096173,0.106570266,0.000041713804,0.0060104877],"study_design_scores_gemma":[0.00043286293,0.00014270261,0.0026366482,0.000134009,0.0000074596533,0.000062995,0.00028778714,0.97640854,0.00014811267,0.019549916,0.00008628506,0.00010267671],"about_ca_topic_score_codex":0.000009477566,"about_ca_topic_score_gemma":0.0000012188068,"teacher_disagreement_score":0.19449227,"about_ca_system_score_codex":0.00004152902,"about_ca_system_score_gemma":0.00008524193,"threshold_uncertainty_score":0.3518922},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042452626,0.000038159036,0.6504936,0.030373072,0.00067356095,0.0003351159,3.334983e-7,0.00039172845,0.2752418],"genre_scores_gemma":[0.9789552,0.0000035911733,0.0073626237,0.003503919,0.00013846753,0.000024769333,2.7069606e-7,0.0000038264648,0.010007303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994685,0.00006224976,0.00008479698,0.00014944766,0.0000906553,0.00014437415],"domain_scores_gemma":[0.99927884,0.00008640234,0.000025073652,0.0005528519,0.000023667246,0.00003313714],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023951613,0.00005435506,0.0000472291,0.000015812318,0.00010097544,0.00025489077,0.00079349,0.0000149189345,0.00074623246],"category_scores_gemma":[0.000014435068,0.000026809645,0.00003666952,0.00009759275,0.00003111713,0.00046739087,0.00024948962,0.00006487807,0.0012281169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.2567677e-7,0.000010397792,0.000073209936,0.0000012743651,0.000005013752,0.000001598054,0.00036673964,4.520867e-7,0.0025386293,0.94436765,0.002698639,0.04993595],"study_design_scores_gemma":[0.00037180338,0.00006593019,0.012961658,0.000020268537,0.000004853262,0.00010743617,0.0003521726,0.10783084,0.054155197,0.71023756,0.11340018,0.00049210916],"about_ca_topic_score_codex":0.000018036997,"about_ca_topic_score_gemma":2.1500215e-7,"teacher_disagreement_score":0.9365026,"about_ca_system_score_codex":0.000003022879,"about_ca_system_score_gemma":0.000004914255,"threshold_uncertainty_score":0.99954957},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26208112,0.0026597527,0.5470934,0.1333624,0.0075523905,0.004432463,0.000024424853,0.002862334,0.03993172],"genre_scores_gemma":[0.95273817,0.000022446993,0.0369032,0.0018107975,0.000053905365,0.00024758663,0.0000048052434,0.000019422405,0.008199674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893373,0.000099213365,0.00022875419,0.0002909541,0.00020089513,0.00024643049],"domain_scores_gemma":[0.99879223,0.00009012401,0.000060527324,0.0008765962,0.0000655444,0.00011499953],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00047041627,0.00011735582,0.00011600277,0.00005659662,0.00027952046,0.00012511581,0.0012773096,0.00005267245,0.000048148657],"category_scores_gemma":[0.000020637262,0.00008786736,0.00006435027,0.0006760115,0.000024586647,0.00022089419,0.00025908538,0.00014211363,0.0015060981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001627498,0.000039750084,0.000014300838,0.0000014790883,0.000009470216,0.0000011556622,0.0002642366,0.00031208253,0.00010252079,0.974608,0.0059343018,0.018711077],"study_design_scores_gemma":[0.00035476565,0.000022107386,0.00007268343,0.0000033070269,0.000005484822,0.00001277532,0.00000972477,0.016136052,0.0007369591,0.5846844,0.39781904,0.00014272491],"about_ca_topic_score_codex":0.00000788439,"about_ca_topic_score_gemma":0.0000015409832,"teacher_disagreement_score":0.690657,"about_ca_system_score_codex":0.000038973416,"about_ca_system_score_gemma":0.000038144495,"threshold_uncertainty_score":0.99927133},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030464685,0.00006113723,0.9661177,0.0006386061,0.00006495694,0.00013202944,0.0000116888805,0.000066666784,0.0024425606],"genre_scores_gemma":[0.8384405,0.00013380154,0.16029322,0.000198592,0.000022571103,0.000008846773,1.1745801e-7,0.00001089552,0.0008914885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988846,0.00014012928,0.00032445698,0.00017140427,0.00027707272,0.00020232261],"domain_scores_gemma":[0.998352,0.0006498186,0.0002696438,0.000625677,0.000040942472,0.00006193281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039312395,0.00012529385,0.00030312853,0.000028932356,0.00012419422,0.000017732797,0.0009585449,0.000031311276,0.00045855707],"category_scores_gemma":[0.000034101333,0.00008470558,0.0005340149,0.00078580517,0.00073023984,0.00017192119,0.00003942055,0.00017877064,0.000036546324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047887195,0.0027201227,0.00010946368,0.00082909287,0.00081740384,0.000003103957,0.02681212,0.0047236197,0.005850182,0.84159833,0.0019369051,0.11455174],"study_design_scores_gemma":[0.0006202104,0.0003392444,0.00035104383,0.00012816316,0.00021543945,0.000026125266,0.0025314125,0.4119297,0.021361228,0.56156963,0.00046776838,0.0004600393],"about_ca_topic_score_codex":0.000009072072,"about_ca_topic_score_gemma":4.0174248e-7,"teacher_disagreement_score":0.80797577,"about_ca_system_score_codex":0.000018854911,"about_ca_system_score_gemma":0.000014956285,"threshold_uncertainty_score":0.50208783},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016849035,0.0010602106,0.9935152,0.0006158772,0.00004204331,0.0006414971,0.00006518119,0.00018146196,0.0021936502],"genre_scores_gemma":[0.023349514,0.0014485366,0.95041186,0.0013678871,0.0014254794,0.0018651375,0.000083092775,0.00004924442,0.019999241],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913234,0.000019352767,0.00018087309,0.00035220044,0.00010110014,0.00021412545],"domain_scores_gemma":[0.9993668,0.00010332761,0.000044093256,0.00031943733,0.000055978475,0.00011034538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014863105,0.00012019166,0.00012352203,0.0000543379,0.0003255923,0.000106304855,0.00044012262,0.00005706948,0.00011619212],"category_scores_gemma":[0.000004812195,0.00010879067,0.00005520449,0.0003153305,0.00002866072,0.0002542579,0.00005646015,0.000069429654,0.0002408887],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013567782,0.00004794761,0.000001167977,0.000012908798,0.000009439819,3.2687967e-7,0.00011383137,0.000014170962,0.00007923393,0.24037093,0.00018509293,0.7591636],"study_design_scores_gemma":[0.00040982847,0.000070641996,0.00005023529,0.000008803766,0.000020662037,0.000024104893,0.00002394081,0.596762,0.0020761457,0.04602899,0.35425308,0.00027157034],"about_ca_topic_score_codex":0.0000034185837,"about_ca_topic_score_gemma":4.562138e-7,"teacher_disagreement_score":0.758892,"about_ca_system_score_codex":0.0000059860977,"about_ca_system_score_gemma":0.000024549456,"threshold_uncertainty_score":0.4436355},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12527272,0.000029283627,0.8728778,0.0007664485,0.00010024551,0.00007650113,0.0000011369806,0.000004809079,0.0008710561],"genre_scores_gemma":[0.6258898,0.0000051791303,0.37391517,0.00012329592,0.000037036116,7.547615e-7,1.4735538e-7,0.0000026791768,0.000025955274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992312,0.00001006614,0.00033788278,0.000052363066,0.00030469507,0.00006378497],"domain_scores_gemma":[0.9993043,0.0001231565,0.00036815018,0.00008979267,0.00007514939,0.00003943866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003385295,0.00006425783,0.00014460787,0.000041114734,0.00006161913,0.000028593708,0.0002977515,0.000018171795,0.000004400776],"category_scores_gemma":[0.000013595206,0.000038442784,0.00005827969,0.00012498481,0.000058761467,0.00008661823,0.00009049481,0.00008257902,0.0000022037473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005848907,0.0001129804,0.0000034351142,0.000052570285,0.00002192872,0.0000012840183,0.0010398119,0.055514142,0.00033554717,0.9412696,0.000065804255,0.0015770452],"study_design_scores_gemma":[0.0008389156,0.000041712716,0.00017537612,0.00006888639,0.000015103466,0.000094824354,0.00011581077,0.014257077,0.0025119046,0.98164636,0.0001760601,0.00005798951],"about_ca_topic_score_codex":1.8634493e-7,"about_ca_topic_score_gemma":1.382878e-7,"teacher_disagreement_score":0.500617,"about_ca_system_score_codex":0.000013300176,"about_ca_system_score_gemma":0.00007156659,"threshold_uncertainty_score":0.15676512},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012984652,0.0007827908,0.97635937,0.0041423333,0.00005181044,0.00040235143,0.0000034858028,0.00010497888,0.0051682545],"genre_scores_gemma":[0.89067495,0.00041921815,0.10394403,0.0021750352,0.00025263402,0.00041389294,0.000006857611,0.000022685155,0.0020906916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909973,0.00007748616,0.0001891237,0.0003072139,0.000116575124,0.0002098871],"domain_scores_gemma":[0.9991928,0.00020657529,0.000049374063,0.00044679653,0.00003534085,0.00006911913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044236874,0.00010672914,0.00011079408,0.00006988559,0.00022798867,0.00009042703,0.00056263705,0.00005117571,0.000049196147],"category_scores_gemma":[0.000020383723,0.00007716819,0.000035823414,0.0005985097,0.000028557173,0.00022813627,0.00017442324,0.00016853602,0.00010582745],"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.0000019050057,0.000042321513,0.000055433393,0.000004646717,0.0000057495276,0.0000022558343,0.0004337597,0.000055144235,0.00030495948,0.95650834,0.00006695266,0.042518534],"study_design_scores_gemma":[0.0006529196,0.00005374692,0.0025009774,0.000021653146,0.000016595937,0.0001411832,0.00023939631,0.37529173,0.0022988422,0.3305194,0.28778332,0.0004802062],"about_ca_topic_score_codex":0.000008959126,"about_ca_topic_score_gemma":0.0000031814125,"teacher_disagreement_score":0.8776903,"about_ca_system_score_codex":0.000008873021,"about_ca_system_score_gemma":0.000020894173,"threshold_uncertainty_score":0.31468272},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9963393,0.0021511337,0.00073138933,0.00015017789,0.00004095252,0.00017500098,0.000013266509,0.000033802025,0.00036494803],"genre_scores_gemma":[0.97644943,0.0007976926,0.022467386,0.000023703102,0.000054860742,0.0000029042915,0.000002394397,0.000006873286,0.00019476231],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989158,0.00011255281,0.0003210702,0.0003187382,0.00015212275,0.00017974718],"domain_scores_gemma":[0.99933684,0.00019272357,0.00009823068,0.00025357888,0.00006121593,0.000057395733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043390042,0.00013370176,0.00028475464,0.00013701712,0.00004239574,0.000026563192,0.00022979702,0.0000641817,0.000020724197],"category_scores_gemma":[0.000058241887,0.00011268849,0.00003327077,0.00040796233,0.00012391088,0.00032383064,0.00009302611,0.00009690606,0.000003259042],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004912497,0.0014885981,0.04815103,0.0023697992,0.00013140905,0.000078329955,0.010918723,0.0005256148,0.027411252,0.041051038,0.00007628404,0.86730665],"study_design_scores_gemma":[0.0037092993,0.00089775753,0.12611681,0.0003496406,0.000081806356,0.000104034945,0.00046135238,0.4592682,0.3945153,0.010052646,0.0033907075,0.001052409],"about_ca_topic_score_codex":0.0001870112,"about_ca_topic_score_gemma":0.000012312611,"teacher_disagreement_score":0.86625427,"about_ca_system_score_codex":0.000003866879,"about_ca_system_score_gemma":0.000033524673,"threshold_uncertainty_score":0.45953032},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47212008,0.0000838997,0.52644813,0.0008325164,0.0002547182,0.00005091892,1.5397981e-7,0.000009945564,0.0001996598],"genre_scores_gemma":[0.99416447,0.000005545257,0.0048727808,0.00029098237,0.0006493526,3.926998e-7,7.355531e-8,0.0000048954125,0.000011512498],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992489,0.000081642196,0.00022068802,0.000054368305,0.00025227404,0.00014209912],"domain_scores_gemma":[0.9990429,0.0003034936,0.00026454782,0.00021339611,0.00013331579,0.000042290652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056418375,0.000074641845,0.000105434534,0.000013253605,0.00008959358,0.00011579488,0.0009257385,0.0000228713,0.000015302201],"category_scores_gemma":[0.000063202715,0.00003636347,0.00007458082,0.00014929782,0.00006933251,0.00059850054,0.00017920398,0.00028488936,0.00002025236],"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.000015853057,0.00007014981,0.000022284268,0.000011627175,0.00005875899,0.0000021714263,0.0023642564,0.0005442895,0.92485684,0.022735685,0.0011324487,0.04818563],"study_design_scores_gemma":[0.00020935947,0.000033290657,0.000020705764,0.00008319155,0.000029170393,0.00010530962,0.0000863214,0.41800272,0.31326106,0.2679729,0.00008597986,0.00010999874],"about_ca_topic_score_codex":0.000006081537,"about_ca_topic_score_gemma":1.3414516e-8,"teacher_disagreement_score":0.6115958,"about_ca_system_score_codex":0.000028898805,"about_ca_system_score_gemma":0.00003122856,"threshold_uncertainty_score":0.17202678},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012333226,0.014561409,0.95536834,0.011542596,0.002074546,0.00005878401,0.000011075387,0.000052222455,0.003997821],"genre_scores_gemma":[0.8768958,0.0039500105,0.075907044,0.0031712796,0.0040940074,0.000010815265,0.000010341386,0.00006363126,0.035897072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755424,0.0007237731,0.0005662571,0.00027873117,0.00042336874,0.00045363614],"domain_scores_gemma":[0.9980849,0.00012598917,0.000431404,0.00029973543,0.00040772164,0.0006502663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002481804,0.00024329331,0.00036552775,0.00023698418,0.00025338455,0.00096555444,0.00043260524,0.00018136943,0.0001540285],"category_scores_gemma":[0.00026091732,0.00021642854,0.00015105671,0.000535219,0.00005844332,0.0014802719,0.00021615277,0.00036859026,0.0000926438],"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.000017003815,0.00020411468,0.0004492475,0.00006759851,0.00016458513,0.00045774964,0.004104681,0.00019752195,0.00011838002,0.92895013,0.018725306,0.046543702],"study_design_scores_gemma":[0.0010559382,0.00026709243,0.00085139635,0.00025123192,0.00014320394,0.0036829687,0.00036686132,0.3979323,0.0005458387,0.24830097,0.34612203,0.00048018942],"about_ca_topic_score_codex":0.000056856108,"about_ca_topic_score_gemma":0.00006518018,"teacher_disagreement_score":0.8794613,"about_ca_system_score_codex":0.00014603596,"about_ca_system_score_gemma":0.00039398743,"threshold_uncertainty_score":0.93108636},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007442884,0.0024489046,0.98855734,0.000776403,0.000030430876,0.00045408946,0.000037577636,0.00004507239,0.00020728078],"genre_scores_gemma":[0.97684336,0.00033749704,0.021688506,0.00013345687,0.00047921503,0.00024935388,0.000011226517,0.000010906495,0.00024650028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886143,0.000076098586,0.00031053674,0.0002783415,0.00017517371,0.00029843548],"domain_scores_gemma":[0.9986518,0.00034968715,0.00022467591,0.00035814635,0.00012892376,0.00028676033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006057557,0.00015114414,0.00024496412,0.00034313035,0.0007914503,0.00030677055,0.00041755088,0.000057504818,0.000036115525],"category_scores_gemma":[0.00003266885,0.00012461157,0.00015454492,0.0011045444,0.000027605274,0.0004117453,0.00010326096,0.00018260985,0.000007661529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006229448,0.00011294015,0.0020617356,0.000050698323,0.00042744933,3.19246e-7,0.00019518446,0.00044727215,0.0007291321,0.9691995,0.00012117523,0.02664841],"study_design_scores_gemma":[0.0017346932,0.00029078318,0.016537694,0.000050675295,0.0031150002,0.0004140358,0.00046870092,0.2521156,0.002853247,0.50201494,0.2188733,0.001531353],"about_ca_topic_score_codex":0.0000017786692,"about_ca_topic_score_gemma":0.0000030394222,"teacher_disagreement_score":0.96940047,"about_ca_system_score_codex":0.00002407508,"about_ca_system_score_gemma":0.000023968802,"threshold_uncertainty_score":0.60872763},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12991038,0.0009935136,0.86513966,0.00033745676,0.000029293778,0.00030823715,0.000006229183,0.00009606405,0.0031791641],"genre_scores_gemma":[0.96818775,0.00008589825,0.031191206,0.000118056814,0.00009446876,0.000029718018,0.0000022446611,0.0000065456047,0.00028410013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937725,0.000011227567,0.00016010723,0.00019482487,0.00012568309,0.0001309263],"domain_scores_gemma":[0.99942327,0.00009202229,0.00007999368,0.00026202918,0.0000628456,0.00007986886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022707165,0.00007366614,0.00009490396,0.000071637,0.00009358213,0.000019367591,0.00025600332,0.00003360984,0.000009048069],"category_scores_gemma":[0.0000043641717,0.000057001766,0.000020340549,0.0003425797,0.000040963747,0.00013485263,0.000071684415,0.00005892058,0.000020398857],"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.0000073262518,0.00006692356,0.00014155234,0.000033486136,0.000012634583,0.000001327536,0.0002443415,0.000010509078,0.0018465238,0.9760551,0.00004310143,0.021537175],"study_design_scores_gemma":[0.00315799,0.001040759,0.017209297,0.00016971379,0.00014288591,0.00022488681,0.000926769,0.08345878,0.21905014,0.08919788,0.5835396,0.0018812957],"about_ca_topic_score_codex":0.000002734931,"about_ca_topic_score_gemma":0.0000017713495,"teacher_disagreement_score":0.8868572,"about_ca_system_score_codex":0.00000509913,"about_ca_system_score_gemma":0.000022108183,"threshold_uncertainty_score":0.23244645},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019358745,0.00020588408,0.97858626,0.00007178698,0.000012208618,0.0005341009,0.0000043862365,0.000028797522,0.0011978182],"genre_scores_gemma":[0.37876636,0.000019095663,0.6210178,0.000016861995,0.000011380136,0.00012175525,0.0000034921547,0.0000056581516,0.000037553786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994011,0.000011865096,0.0002094001,0.00017633733,0.00010460443,0.000096674805],"domain_scores_gemma":[0.99932307,0.00028369567,0.000152516,0.00013176851,0.00008254672,0.000026413012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003616423,0.00009204967,0.00016062749,0.000056819626,0.00009387456,0.0000744235,0.00007979347,0.00002394041,9.1163906e-7],"category_scores_gemma":[0.000012223637,0.00007326677,0.0000103995735,0.00014299476,0.000059575916,0.00011038255,0.00002607045,0.000025856896,7.2516525e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003646062,0.00003935382,0.0000019164036,0.0005323571,0.0000113665055,5.37706e-8,0.002137121,0.00007134934,0.00022892319,0.9838912,0.0000090589,0.013073693],"study_design_scores_gemma":[0.0006089798,0.0000976656,0.000011518219,0.000035163263,0.000028369777,0.000013626131,0.001697327,0.023956612,0.0065433825,0.9659157,0.0009035886,0.00018811334],"about_ca_topic_score_codex":0.0000010940971,"about_ca_topic_score_gemma":2.9562693e-7,"teacher_disagreement_score":0.35940763,"about_ca_system_score_codex":0.0000033167928,"about_ca_system_score_gemma":0.000023432924,"threshold_uncertainty_score":0.2987732},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5150108,0.0001636158,0.4823149,0.0010855508,0.000034749864,0.0008298714,0.000021495,0.00010363115,0.00043539586],"genre_scores_gemma":[0.99727786,0.000014364869,0.002011493,0.00023891067,0.000046602767,0.0001966416,0.000029851597,0.0000045539487,0.00017972088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993097,0.000054104337,0.00018606771,0.00021910478,0.00013122338,0.00009975497],"domain_scores_gemma":[0.99918926,0.00007402129,0.00010705799,0.00040961785,0.00015926888,0.000060759525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010911318,0.000076823904,0.00012757668,0.000090629495,0.00015335256,0.000055402612,0.0004570245,0.000029924464,0.00006386808],"category_scores_gemma":[0.0000229457,0.000052616037,0.000052277443,0.0012944074,0.00003032204,0.00028207726,0.000050915252,0.00005183571,0.000012945343],"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.00000452233,0.00033687698,0.0016217813,0.00004325502,0.00028091908,1.3672344e-7,0.00160496,0.0018390478,0.01150962,0.961456,0.000090571295,0.021212287],"study_design_scores_gemma":[0.00023360037,0.000020236525,0.008028594,0.0000061148758,0.0001340811,0.0000012373008,0.0000599542,0.96246547,0.01181194,0.016592275,0.0005305128,0.000115985364],"about_ca_topic_score_codex":0.0000150709075,"about_ca_topic_score_gemma":0.000004309012,"teacher_disagreement_score":0.9606264,"about_ca_system_score_codex":0.0000047719764,"about_ca_system_score_gemma":0.000025997966,"threshold_uncertainty_score":0.21456197},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108866,0.0055752276,0.8757899,0.0022776432,0.00023089223,0.0009323291,0.000043600365,0.0005814739,0.0057029375],"genre_scores_gemma":[0.9555129,0.00010405885,0.041767262,0.0002621163,0.00097259524,0.00008926928,0.000022084992,0.000014359753,0.0012553845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991343,0.000023302737,0.00017336858,0.00030925873,0.00013150607,0.00022824755],"domain_scores_gemma":[0.9994329,0.000057575948,0.000053972766,0.00034094267,0.000038372615,0.000076200355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008781168,0.00011232823,0.00010787703,0.000100038225,0.00025247244,0.0001278708,0.00048356512,0.000049258742,0.000036547146],"category_scores_gemma":[0.000011269444,0.00009942222,0.00004035746,0.0004901723,0.000018234377,0.00035849458,0.00015960757,0.0001057216,0.00005024449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.533518e-7,0.000029712235,0.000053196258,0.000011269398,0.0000047086332,6.1450817e-7,0.000024239216,0.000080701146,0.0009864725,0.9932214,0.00026799354,0.005318924],"study_design_scores_gemma":[0.0003687526,0.000033133285,0.004356488,0.000005244851,0.000015161871,0.000019435989,0.000010472826,0.19458055,0.00899286,0.73314106,0.05815673,0.00032009053],"about_ca_topic_score_codex":0.00001579818,"about_ca_topic_score_gemma":0.0000024965752,"teacher_disagreement_score":0.84664685,"about_ca_system_score_codex":0.000009465683,"about_ca_system_score_gemma":0.000017847686,"threshold_uncertainty_score":0.40543205},"labels":[],"label_agreement":null},{"id":"W1968250174","doi":"10.1137/040620047","title":"A Multipreconditioned Conjugate Gradient Algorithm","year":2006,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjugate gradient method; Preconditioner; Mathematics; Derivation of the conjugate gradient method; Conjugate residual method; Algorithm; Positive-definite matrix; Generalization; Matrix (chemical analysis); Nonlinear conjugate gradient method; Applied mathematics; Biconjugate gradient method; Linear system; Block (permutation group theory); Cholesky decomposition; Gradient method; Conjugate; Domain decomposition methods; Relation (database); Coefficient matrix; Gradient descent; Computer science; Iterative method; Combinatorics; Mathematical analysis; Eigenvalues and eigenvectors; Finite element method; Artificial intelligence","score_opus":0.005290628705126683,"score_gpt":0.24559488815734168,"score_spread":0.240304259452215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968250174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003140372,0.00030969433,0.9943689,0.00083438697,0.00004692952,0.00014147312,0.000025537911,0.00006568181,0.0010670238],"genre_scores_gemma":[0.81659716,0.0003718216,0.17845944,0.0004021448,0.0009424608,0.00014518546,0.00006646567,0.000019725538,0.0029956007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998769,0.000082945626,0.00038607148,0.00031238413,0.00022770902,0.00022192177],"domain_scores_gemma":[0.9990438,0.00010157603,0.00024133633,0.0003540169,0.00010368969,0.00015558144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041970896,0.00014705524,0.0002470867,0.0004485634,0.0005822123,0.0003833156,0.0003790319,0.00004586129,0.00007775429],"category_scores_gemma":[0.000004423522,0.00012116263,0.0002435546,0.001167454,0.000050682767,0.0002429827,0.000050947383,0.00019484866,0.00007469094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005210492,0.00047380105,0.0003316345,0.000007967594,0.0004579575,0.000021771273,0.000058672824,0.003935085,0.0003247855,0.8631027,0.0006388948,0.13064155],"study_design_scores_gemma":[0.0016959287,0.00028034433,0.009227598,0.00002525827,0.0010341435,0.00037748567,0.00010347276,0.42000368,0.0018021209,0.4193366,0.14519262,0.0009207429],"about_ca_topic_score_codex":0.000020679077,"about_ca_topic_score_gemma":0.0000061143896,"teacher_disagreement_score":0.81590945,"about_ca_system_score_codex":0.000029451168,"about_ca_system_score_gemma":0.000021879387,"threshold_uncertainty_score":0.49408686},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021827357,0.004577441,0.97053885,0.0008712295,0.0000942303,0.00040401242,0.000026926675,0.00026326027,0.0013966935],"genre_scores_gemma":[0.97660637,0.00033355138,0.021608915,0.00025039268,0.00036205896,0.00019847786,0.000031552856,0.000011038537,0.0005976394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992758,0.000026190952,0.00015220887,0.00022091335,0.00010718564,0.00021769205],"domain_scores_gemma":[0.99933475,0.0001117451,0.000073351235,0.0002965225,0.000039688824,0.00014396427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001651287,0.000101296435,0.00008815855,0.000046001212,0.00022970172,0.00006817308,0.00032673913,0.00005202327,0.000020871468],"category_scores_gemma":[0.000012931911,0.00009047151,0.000025895337,0.0002665561,0.000017739523,0.00057398813,0.00011202757,0.00008391636,0.00025036454],"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.0000014753892,0.00017615946,0.00072832376,0.000031439384,0.000015897038,8.5193136e-8,0.0005993516,0.0000023372593,0.013380204,0.9082782,0.001491476,0.07529504],"study_design_scores_gemma":[0.00035873457,0.000033985027,0.0020566864,0.0000096799895,0.000026549593,0.000016668726,0.000075137716,0.033084128,0.03195452,0.010214783,0.9216462,0.0005229415],"about_ca_topic_score_codex":0.0000032414134,"about_ca_topic_score_gemma":1.2002013e-7,"teacher_disagreement_score":0.954779,"about_ca_system_score_codex":0.000009373887,"about_ca_system_score_gemma":0.000008004907,"threshold_uncertainty_score":0.36893213},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027670069,0.00045096528,0.96855694,0.00051488884,0.000046707108,0.00016783792,0.000055742214,0.0001779541,0.0023588694],"genre_scores_gemma":[0.8980683,0.000034336503,0.09898623,0.00029873656,0.00018027722,0.000050479193,0.000117467556,0.000013592128,0.002250561],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976043,0.00020085149,0.00063183013,0.0006604949,0.0005481516,0.00035436064],"domain_scores_gemma":[0.997509,0.00011417671,0.0003400321,0.0016675529,0.00020383108,0.00016542914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010032279,0.00022366492,0.0007365842,0.0015447773,0.00035027676,0.000091469,0.0012094481,0.00009151881,0.00046145107],"category_scores_gemma":[0.000037213707,0.00020738979,0.0009958758,0.012428644,0.00011668198,0.00032769213,0.00027751125,0.00013227835,0.000060022296],"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.00002180847,0.0013479991,0.0058916574,0.000051390853,0.050317746,0.000020873003,0.00419355,0.40957296,0.00060298864,0.3395509,0.0013152577,0.18711285],"study_design_scores_gemma":[0.00019612207,0.00003474394,0.0012655361,0.0000048255333,0.011497497,0.0000014226199,0.000059206257,0.9669383,0.0013233689,0.0037242058,0.014624829,0.00032991567],"about_ca_topic_score_codex":0.00006325237,"about_ca_topic_score_gemma":0.000045547382,"teacher_disagreement_score":0.8703982,"about_ca_system_score_codex":0.000054846914,"about_ca_system_score_gemma":0.00006156209,"threshold_uncertainty_score":0.84571105},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25732052,0.000063675696,0.7378883,0.003670483,0.0001489847,0.0002444062,0.000013837507,0.000027924221,0.000621924],"genre_scores_gemma":[0.9890717,0.00001182793,0.010249657,0.00038130488,0.00021878991,0.000006858925,0.0000052797204,0.00000782728,0.000046730045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979113,0.00041918675,0.0004186749,0.00025839196,0.0005823436,0.00041012838],"domain_scores_gemma":[0.9979614,0.00080089003,0.00032653802,0.00030978568,0.00039727037,0.00020409463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001581689,0.00017623871,0.0002599876,0.00016697877,0.00058932666,0.00045290933,0.00069977954,0.00005097314,0.000019631447],"category_scores_gemma":[0.000050003946,0.00009709649,0.00007557279,0.00041013924,0.0001589377,0.00027552282,0.00017767935,0.0007004527,0.00003255485],"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.00029918135,0.0011160932,0.00019531783,0.00005777171,0.000398116,0.00034357075,0.0017689957,0.12396696,0.00021620076,0.7233277,0.014113854,0.13419625],"study_design_scores_gemma":[0.002858912,0.0029290265,0.010940885,0.00049802236,0.000019509149,0.0006368676,0.00076384004,0.88011193,0.0003657548,0.09868682,0.0017450724,0.0004433379],"about_ca_topic_score_codex":0.000016550306,"about_ca_topic_score_gemma":4.795532e-7,"teacher_disagreement_score":0.756145,"about_ca_system_score_codex":0.00005051135,"about_ca_system_score_gemma":0.000056253804,"threshold_uncertainty_score":0.4532684},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010228612,0.0015056607,0.9948977,0.00038038567,0.00008892171,0.00069781224,0.000048286573,0.00018513786,0.0011732398],"genre_scores_gemma":[0.10379025,0.0004128321,0.8894504,0.00085056975,0.0014400228,0.0006885584,0.00007299826,0.00004669759,0.0032476778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988782,0.000014937044,0.00025537348,0.00039557467,0.00014948205,0.00030646074],"domain_scores_gemma":[0.9989565,0.00032007674,0.00009520799,0.00033972278,0.00013190648,0.00015660826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004238128,0.00014256181,0.00014867043,0.0002261782,0.00034561398,0.00011229246,0.00048671273,0.00007890254,0.000011906093],"category_scores_gemma":[0.00002385889,0.00012949562,0.000067970854,0.0010331264,0.000029239889,0.00026660564,0.00012419964,0.00009771788,0.000081108905],"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.0000016317755,0.000060933013,0.0000072840053,0.00002705231,0.000010037638,7.750614e-7,0.00009383088,0.0000023501598,0.00010228243,0.46098152,0.00012316467,0.5385891],"study_design_scores_gemma":[0.001251303,0.00026400323,0.0007145733,0.00003180375,0.000063173225,0.00007115993,0.00022981077,0.5932573,0.010319189,0.08080344,0.31219986,0.0007943526],"about_ca_topic_score_codex":0.000003695008,"about_ca_topic_score_gemma":0.000001334938,"teacher_disagreement_score":0.593255,"about_ca_system_score_codex":0.000012810927,"about_ca_system_score_gemma":0.000026453781,"threshold_uncertainty_score":0.52806777},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084683957,0.003487933,0.98347896,0.011043355,0.00028681365,0.0005168546,0.000004421735,0.0001899,0.0001449425],"genre_scores_gemma":[0.09644088,0.000091063346,0.89714587,0.0042920997,0.00077100314,0.00024248101,0.00000481869,0.00003837982,0.0009734177],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979912,0.00016689178,0.0003908258,0.0005522864,0.00023246749,0.00066634506],"domain_scores_gemma":[0.9985779,0.0005192063,0.00023794983,0.00044469527,0.0000842565,0.00013602228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018571506,0.00025367475,0.00027150082,0.00012605557,0.0008635912,0.0006953009,0.00087416155,0.00008006975,0.0000011288893],"category_scores_gemma":[0.00011570943,0.00017836822,0.00008976607,0.00044719825,0.00006163046,0.0005941067,0.0001748713,0.00021070511,0.000015333053],"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.00029240237,0.00033900194,0.00018648819,0.0010041584,0.0002328729,0.000024648729,0.0036829556,0.021188779,0.0058779404,0.19096434,0.013745661,0.76246077],"study_design_scores_gemma":[0.00096479955,0.000039416507,0.00003437729,0.000029654018,0.00001807821,0.000032060067,0.000055033037,0.90767145,0.00011886122,0.0010597988,0.08970417,0.00027232085],"about_ca_topic_score_codex":0.000012226486,"about_ca_topic_score_gemma":0.0000032710109,"teacher_disagreement_score":0.88648266,"about_ca_system_score_codex":0.000037237074,"about_ca_system_score_gemma":0.000053421983,"threshold_uncertainty_score":0.7273645},"labels":[],"label_agreement":null},{"id":"W1969652671","doi":"10.1007/s11075-013-9770-3","title":"Stability of rootfinding for barycentric Lagrange interpolants","year":2013,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Barycentric coordinate system; Companion matrix; Lagrange polynomial; Basis (linear algebra); Condition number; Monomial basis; Polynomial basis; Matrix (chemical analysis); Monomial; Polynomial; Theory of computation; Computation; Applied mathematics; Univariate; Matrix polynomial; Polynomial matrix; Combinatorics; Mathematical analysis; Algorithm; Geometry","score_opus":0.020313011535163076,"score_gpt":0.2514376002324644,"score_spread":0.23112458869730135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969652671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008358293,0.00013124243,0.9889482,0.0003812963,0.0005034547,0.0005349444,0.000020393285,0.00014009436,0.0009820445],"genre_scores_gemma":[0.82813793,0.0000064942715,0.17134266,0.00014444314,0.00013753932,0.00010012759,0.0000056077256,0.000013614611,0.000111595495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984272,0.000086623346,0.00039057268,0.00041334555,0.00026020253,0.0004220309],"domain_scores_gemma":[0.99857277,0.00048017153,0.00014354746,0.0004726974,0.00015799513,0.00017284465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048551767,0.00017191451,0.000323013,0.000091288515,0.00009480916,0.00007940566,0.0008694389,0.00007593737,0.000256847],"category_scores_gemma":[0.00016385663,0.0001408424,0.00016592989,0.00052654557,0.00006396354,0.0004969521,0.00021871373,0.00013386279,0.00009855084],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020547297,0.0004228717,0.0015652857,0.00011630747,0.00004924308,0.0000041876515,0.0006823967,0.0000067919996,0.0013317964,0.030234732,0.00082746043,0.96473837],"study_design_scores_gemma":[0.0015744207,0.00064841623,0.007880232,0.00005890821,0.000026342568,0.000028475855,0.00016550868,0.8964114,0.029132865,0.05658785,0.0067337924,0.0007517827],"about_ca_topic_score_codex":0.0000831055,"about_ca_topic_score_gemma":4.4564516e-7,"teacher_disagreement_score":0.9639866,"about_ca_system_score_codex":0.000039724775,"about_ca_system_score_gemma":0.000039360555,"threshold_uncertainty_score":0.5743386},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66811675,0.014223875,0.30586436,0.008687525,0.00061278796,0.0015015848,0.000008167094,0.00006466331,0.0009202869],"genre_scores_gemma":[0.7766573,0.0006922884,0.22168165,0.00003615772,0.00048559686,0.000007020831,1.8673863e-7,0.00001045123,0.0004293363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978073,0.00014233407,0.0007096646,0.00011915518,0.0009538677,0.0002676815],"domain_scores_gemma":[0.9979744,0.00034154195,0.00039752145,0.0002902887,0.0009048514,0.000091423295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049191685,0.00009666231,0.00030808037,0.0004878995,0.00014394877,0.00022074892,0.0010882718,0.000056704488,0.000007058458],"category_scores_gemma":[0.00041138986,0.000063873165,0.00013207244,0.0003487687,0.000055316963,0.00078485283,0.00010359832,0.00024536002,0.000009965443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017410661,0.002223521,0.000010102247,0.0023604752,0.00014755128,0.000044191434,0.009473893,0.001422489,0.17659539,0.7694469,0.0051036584,0.032997686],"study_design_scores_gemma":[0.0012637652,0.0027890303,0.000040727675,0.0009820438,0.000032946366,0.00033969374,0.001316375,0.15249957,0.3488441,0.49028257,0.0013317737,0.00027739356],"about_ca_topic_score_codex":0.0000015243445,"about_ca_topic_score_gemma":2.2577845e-7,"teacher_disagreement_score":0.27916437,"about_ca_system_score_codex":0.0000393294,"about_ca_system_score_gemma":0.00018275171,"threshold_uncertainty_score":0.2604672},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38446057,0.00007160851,0.5290835,0.0036945918,0.00049658195,0.0012524027,0.000030193694,0.0003503727,0.08056017],"genre_scores_gemma":[0.8441042,0.00015933195,0.14369708,0.00061270915,0.000139112,0.0000065846875,0.0000053946183,0.000038108563,0.011237518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989272,0.00011269318,0.00020515236,0.00021767073,0.00031136227,0.00022593085],"domain_scores_gemma":[0.9979601,0.0008708644,0.0002344892,0.00074990204,0.00010199114,0.00008267645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043110378,0.00016080971,0.00024496042,0.00014904849,0.000209292,0.00008849508,0.001372353,0.000055041502,0.00014905482],"category_scores_gemma":[0.000066237306,0.00011465784,0.00012898736,0.00042653375,0.00013314589,0.0004459439,0.00028262034,0.00013919408,0.00019175382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031266518,0.0003412099,0.0000298831,0.00020118213,0.00009822553,0.000034048917,0.0028221179,0.000095906056,0.0009213709,0.98442113,0.008433326,0.002570301],"study_design_scores_gemma":[0.010141133,0.0018431687,0.0013749828,0.0015354506,0.00040969902,0.00016941594,0.020129446,0.3544854,0.021670843,0.53380597,0.051403943,0.0030305937],"about_ca_topic_score_codex":0.00002003395,"about_ca_topic_score_gemma":7.6101554e-7,"teacher_disagreement_score":0.45964357,"about_ca_system_score_codex":0.000035025423,"about_ca_system_score_gemma":0.00003629633,"threshold_uncertainty_score":0.46756113},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9727674,0.00042595185,0.024055984,0.000669127,0.00036585148,0.00022867307,0.000026379706,0.00009870638,0.0013619341],"genre_scores_gemma":[0.99148387,0.000021315607,0.007536415,0.00052321324,0.00015129239,0.0000055513733,0.000002636802,0.000007717121,0.0002680105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989176,0.0001637793,0.00023098329,0.00020890092,0.00020821902,0.0002705534],"domain_scores_gemma":[0.9987183,0.000524256,0.00009735922,0.00047965322,0.000060052156,0.000120341385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096022093,0.00014155106,0.00019189372,0.0000388398,0.00011955719,0.00003169369,0.00038421855,0.000063676016,0.000059125887],"category_scores_gemma":[0.0001940074,0.00008824478,0.00008655977,0.00016428708,0.00013588548,0.00021000356,0.00019546728,0.00017653445,0.00004913573],"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.00005222608,0.00037377852,0.0056001195,0.000054951608,0.000055609744,0.0000032062187,0.0022921455,0.000014352839,0.00076251465,0.9392973,0.0008555051,0.05063826],"study_design_scores_gemma":[0.005077974,0.00090039993,0.148156,0.00026466354,0.00014511848,0.00012960822,0.0008204378,0.40484118,0.22177641,0.09554168,0.12013004,0.0022164946],"about_ca_topic_score_codex":0.000021249143,"about_ca_topic_score_gemma":0.0000015396802,"teacher_disagreement_score":0.84375566,"about_ca_system_score_codex":0.000004575764,"about_ca_system_score_gemma":0.000018970362,"threshold_uncertainty_score":0.35985175},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96854484,0.00029287243,0.018260607,0.011296559,0.0002793121,0.000892851,0.000010503241,0.0000055664623,0.00041689508],"genre_scores_gemma":[0.9952919,0.000049532387,0.004400841,0.0000652097,0.000098298064,0.000008255528,1.9746642e-7,0.000009516916,0.00007628021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99593526,0.0014862075,0.00086261844,0.00011496775,0.0013813247,0.0002196375],"domain_scores_gemma":[0.9940835,0.0034079526,0.0010502666,0.00080361235,0.00060089136,0.000053766336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073648007,0.00012589069,0.0003897721,0.00016790383,0.00035054004,0.00016484666,0.0019337725,0.00006700003,0.000038869828],"category_scores_gemma":[0.0003305024,0.00004937731,0.0002671338,0.00043832225,0.00067571184,0.00026495443,0.00040200778,0.00054410833,0.0000042037664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027863192,0.001308431,0.0002534241,0.00081176846,0.00020117476,0.0000018775903,0.00567915,0.002369706,0.20297787,0.78151304,0.0026696003,0.0019353491],"study_design_scores_gemma":[0.0023102795,0.00049525267,0.004405117,0.0013164732,0.000058433543,0.00009646132,0.0011147573,0.2985826,0.22390415,0.46753758,0.00003780926,0.00014108382],"about_ca_topic_score_codex":0.000029946616,"about_ca_topic_score_gemma":0.000001036294,"teacher_disagreement_score":0.31397545,"about_ca_system_score_codex":0.00004685936,"about_ca_system_score_gemma":0.00014185428,"threshold_uncertainty_score":0.35934624},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55852616,0.003670933,0.43078572,0.0038717552,0.00016525097,0.0005269162,0.0000054219067,0.00003179846,0.0024160596],"genre_scores_gemma":[0.8184553,0.00020910166,0.18104418,0.000016678601,0.00007037765,8.895074e-7,1.2257735e-7,0.000004346892,0.00019905559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982864,0.00023039053,0.00045379755,0.00008858423,0.000757338,0.00018345073],"domain_scores_gemma":[0.9984375,0.00040022013,0.00027615984,0.0001937076,0.0006118821,0.000080517995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003483099,0.00007463674,0.00026024083,0.00039133793,0.00009320292,0.00012184358,0.00054339727,0.000037258626,0.000006722351],"category_scores_gemma":[0.00028978044,0.000051629468,0.00006330936,0.00026121523,0.00011013035,0.00055828167,0.00011508351,0.0002460468,0.0000048273705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059578833,0.00073332153,0.000023026436,0.00058007607,0.00005461874,0.00007623044,0.00837895,0.000021117474,0.11522766,0.82206154,0.00018036035,0.052603528],"study_design_scores_gemma":[0.00080887007,0.0016660794,0.0009039343,0.0005122147,0.000025150384,0.0006307126,0.0008602419,0.12593648,0.08345278,0.7848746,0.00014781325,0.00018111838],"about_ca_topic_score_codex":8.0959677e-7,"about_ca_topic_score_gemma":1.7527874e-7,"teacher_disagreement_score":0.2599291,"about_ca_system_score_codex":0.000024873403,"about_ca_system_score_gemma":0.0000678037,"threshold_uncertainty_score":0.21053886},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07554416,0.0024220808,0.9123165,0.0043370393,0.00062538916,0.0005294343,0.000006615957,0.00001389734,0.004204857],"genre_scores_gemma":[0.74641174,0.0001019344,0.25107363,0.000016089847,0.00047618328,0.000016857732,2.20038e-7,0.000018452616,0.001884915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978235,0.0001858584,0.00048255484,0.00010171378,0.0011443364,0.00026207516],"domain_scores_gemma":[0.99492294,0.0026175124,0.00038203353,0.0004088554,0.0015386206,0.00013002726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011344334,0.00007919151,0.00023994333,0.00026452186,0.00015415743,0.00018213954,0.0016872147,0.000042701013,0.000014348732],"category_scores_gemma":[0.0014028591,0.000044642886,0.00012639948,0.00052295876,0.00015238425,0.00037478018,0.00024092282,0.00031669275,0.000012555577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021252806,0.001606184,0.00008440683,0.0009928804,0.00037478938,0.00004170367,0.051575698,0.0015816324,0.002403724,0.87026966,0.043285456,0.027571315],"study_design_scores_gemma":[0.0012863782,0.0016129512,0.000053300762,0.00026941355,0.00003318073,0.00025765662,0.0104536535,0.16403912,0.0167738,0.7952094,0.009851338,0.00015978767],"about_ca_topic_score_codex":0.0000065379163,"about_ca_topic_score_gemma":0.0000023381613,"teacher_disagreement_score":0.67086756,"about_ca_system_score_codex":0.00005750824,"about_ca_system_score_gemma":0.0004085016,"threshold_uncertainty_score":0.39317426},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11656072,0.00239793,0.86944306,0.001015996,0.00009218753,0.0005701878,0.000033538494,0.0001538117,0.009732562],"genre_scores_gemma":[0.97935444,0.00012708607,0.019614475,0.00025170954,0.000108781634,0.000015735168,0.0000073090287,0.0000055329097,0.0005149148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999394,0.000015790034,0.00016191923,0.00019491932,0.00010442759,0.00012893105],"domain_scores_gemma":[0.9993906,0.00016535746,0.00007566397,0.00019897189,0.000090234535,0.00007916399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019286765,0.00007509248,0.00009845347,0.00007890209,0.00012538898,0.000023563865,0.0002795905,0.000039601375,0.0000141213595],"category_scores_gemma":[0.000016339367,0.000065631386,0.000043177133,0.00033752914,0.000036823145,0.00018189041,0.00009032769,0.00005956719,0.000027388362],"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.000006412399,0.00008630197,0.00008437375,0.000030691368,0.000023583096,0.0000014273145,0.0009499247,0.0000041218545,0.0035161532,0.9689201,0.000070548245,0.02630637],"study_design_scores_gemma":[0.003674663,0.001131685,0.019600805,0.0002193471,0.000348832,0.00027084321,0.0049144505,0.18818536,0.43580604,0.13702929,0.206243,0.0025756815],"about_ca_topic_score_codex":0.0000051953325,"about_ca_topic_score_gemma":0.0000011208841,"teacher_disagreement_score":0.86279374,"about_ca_system_score_codex":0.0000059765302,"about_ca_system_score_gemma":0.000017725059,"threshold_uncertainty_score":0.267637},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09880467,0.0027143266,0.8841286,0.0044520893,0.00009327424,0.00055255846,0.000035759476,0.00029345718,0.00892529],"genre_scores_gemma":[0.9697317,0.00020286496,0.027558759,0.0003508722,0.00019747372,0.00006814733,0.000004094967,0.0000069515663,0.0018791365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994824,0.0000197721,0.00008693198,0.00022897079,0.00006515959,0.0001167883],"domain_scores_gemma":[0.99959576,0.00006339094,0.000023299219,0.00020403288,0.000023680186,0.00008983805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007278999,0.0000733763,0.00007525023,0.000028268834,0.00019509115,0.0000703928,0.00013575301,0.000034412697,0.000045391043],"category_scores_gemma":[0.0000073709925,0.00006668689,0.000017509668,0.00015537119,0.000028683475,0.0002102895,0.00011158282,0.000070148446,0.00008993528],"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":[9.614738e-7,0.000083616345,0.000035251283,0.000016051103,0.000009942407,0.0000017839371,0.0003487637,0.000009592231,0.0008898585,0.78479224,0.00029321527,0.21351871],"study_design_scores_gemma":[0.0003672932,0.000071327435,0.0014833229,0.000009614943,0.000014442213,0.00012285054,0.000018789202,0.9353464,0.0029688345,0.02832984,0.030952638,0.00031465085],"about_ca_topic_score_codex":0.0000016627689,"about_ca_topic_score_gemma":4.5125645e-7,"teacher_disagreement_score":0.9353368,"about_ca_system_score_codex":0.0000030365945,"about_ca_system_score_gemma":0.000003588948,"threshold_uncertainty_score":0.27194124},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33468238,0.0052044583,0.65045935,0.00096516474,0.00007969185,0.00079266436,0.00008068325,0.00012994022,0.0076056696],"genre_scores_gemma":[0.97981817,0.0003533529,0.01937487,0.000029298022,0.000042405332,0.00003415858,0.0000020234838,0.0000038123287,0.00034193698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994773,0.000019056763,0.00018263538,0.0001480087,0.00009427455,0.00007868709],"domain_scores_gemma":[0.9994585,0.00010551732,0.00011241435,0.0002166178,0.00006629634,0.00004067835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000073102776,0.00006038312,0.00011150558,0.00005851792,0.000058343503,0.0000100249135,0.00029091496,0.000027510316,0.00005276189],"category_scores_gemma":[0.000012595778,0.00005245773,0.000029228971,0.00030151554,0.000042071446,0.00014943708,0.00008415524,0.000038803202,0.000029376264],"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.0000017948432,0.00017866658,0.000089615336,0.00007061413,0.00002085466,2.9151457e-7,0.0010531644,0.000014296141,0.0051736394,0.9609315,0.00010726413,0.032358337],"study_design_scores_gemma":[0.0014612781,0.0003736855,0.0030040476,0.00012223824,0.000079360034,0.000027197648,0.00046470258,0.47258666,0.35818115,0.13151224,0.03144655,0.00074089534],"about_ca_topic_score_codex":0.000003091141,"about_ca_topic_score_gemma":2.6280367e-7,"teacher_disagreement_score":0.82941926,"about_ca_system_score_codex":0.0000019013086,"about_ca_system_score_gemma":0.0000047566573,"threshold_uncertainty_score":0.21391642},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30150983,0.000054030108,0.6972832,0.00006254769,0.000075573655,0.000083762585,0.0000020915397,0.00002739887,0.0009015499],"genre_scores_gemma":[0.8368058,0.0000021543708,0.1631326,0.000013014652,0.00001493915,5.916543e-7,7.8648947e-7,0.000004552494,0.000025552203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992442,0.000022921084,0.000358462,0.00011478852,0.00015101465,0.00010859849],"domain_scores_gemma":[0.99888134,0.000578451,0.00026127158,0.00017801403,0.00006884248,0.000032106876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079274486,0.00009187773,0.00021114918,0.00012253763,0.00006488667,0.00006863705,0.00020252404,0.000035559377,0.000004318058],"category_scores_gemma":[0.000058181737,0.00007383696,0.00004090665,0.00015844873,0.0001159007,0.00013734818,0.00005758609,0.000045609286,0.0000031734241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010825077,0.00010060371,0.000008100218,0.00014621415,0.000015100197,8.579478e-7,0.0036667117,0.00026661027,0.002728057,0.9800684,0.00004193201,0.012946617],"study_design_scores_gemma":[0.00026964128,0.00018308683,0.00024557806,0.00006851895,0.0000052393475,0.000012519749,0.00017205157,0.08375942,0.07644825,0.83870584,0.00003232491,0.00009751524],"about_ca_topic_score_codex":0.0000033180334,"about_ca_topic_score_gemma":7.579837e-7,"teacher_disagreement_score":0.535296,"about_ca_system_score_codex":0.000008747904,"about_ca_system_score_gemma":0.000027024098,"threshold_uncertainty_score":0.3010984},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12410055,0.0026358303,0.8675762,0.002870593,0.0001062095,0.0009742624,0.00006333128,0.0002920006,0.0013810571],"genre_scores_gemma":[0.9336426,0.00010062085,0.060191393,0.0011309065,0.00055818865,0.00041719514,0.000016860256,0.00002842867,0.00391378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987616,0.000037451027,0.00021674906,0.00036213567,0.00023727832,0.00038478227],"domain_scores_gemma":[0.9989058,0.00010313198,0.00006918539,0.0004948982,0.00007741362,0.00034958005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002553897,0.00017999629,0.00016799117,0.00009365366,0.00027202698,0.000105235784,0.0004926961,0.000053056323,0.00008457285],"category_scores_gemma":[0.000015506144,0.00014291824,0.00004633907,0.0005266512,0.000036125482,0.00045636113,0.00028252116,0.00010870359,0.0005805204],"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.000024966004,0.00032338296,0.0025380072,0.00010430613,0.00007097117,0.000002144296,0.0017386021,0.000031100342,0.0013420965,0.97626776,0.002089345,0.015467316],"study_design_scores_gemma":[0.0019868847,0.0008869493,0.027317155,0.00019159853,0.0003160591,0.00027978234,0.00030290146,0.070702225,0.042927153,0.06233629,0.7897956,0.002957438],"about_ca_topic_score_codex":0.0000081141725,"about_ca_topic_score_gemma":0.000001666211,"teacher_disagreement_score":0.9139315,"about_ca_system_score_codex":0.000018771918,"about_ca_system_score_gemma":0.00004687226,"threshold_uncertainty_score":0.746161},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023123693,0.0006633755,0.96771276,0.00020341476,0.00014888492,0.00042512402,0.0000071049185,0.00026565563,0.0074499995],"genre_scores_gemma":[0.9791333,0.000031100593,0.020028511,0.000116153744,0.00014979286,0.00010174043,0.000003615708,0.000008783761,0.0004270227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993076,0.000030921292,0.00016922633,0.00025231505,0.00007401688,0.00016592011],"domain_scores_gemma":[0.99946016,0.000055484466,0.00006322202,0.0002925382,0.00003667713,0.00009192174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014763742,0.00009181758,0.000104570325,0.000044374363,0.0002254539,0.00007399337,0.00033860884,0.00003813928,0.000033245728],"category_scores_gemma":[0.000012679486,0.00008218868,0.000028454544,0.00020814569,0.0000204731,0.00023000946,0.000078039186,0.000085656415,0.0001373142],"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":[9.5142894e-7,0.000030046536,0.000017842207,0.000020328931,0.000009586542,0.0000010546855,0.0007905455,0.000006446303,0.0003193518,0.9948546,0.000038203743,0.003911004],"study_design_scores_gemma":[0.00097417366,0.00031059163,0.0009190754,0.00008200595,0.00006981482,0.00026651134,0.0013207066,0.7975017,0.015912866,0.13522537,0.046207022,0.0012101774],"about_ca_topic_score_codex":0.000013454801,"about_ca_topic_score_gemma":9.718591e-7,"teacher_disagreement_score":0.95600957,"about_ca_system_score_codex":0.000006015307,"about_ca_system_score_gemma":0.00001404157,"threshold_uncertainty_score":0.33515573},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45900455,0.00028420863,0.50832593,0.014545818,0.000069012895,0.00046803866,0.000004060675,0.0001933253,0.017105052],"genre_scores_gemma":[0.97811455,0.000003179654,0.02144634,0.00021004883,0.00004078352,0.000017205115,8.132802e-8,0.0000049268465,0.00016288609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991858,0.00009008558,0.00019980437,0.00014633595,0.00023228549,0.00014569303],"domain_scores_gemma":[0.99831736,0.001173713,0.00007730295,0.00035253368,0.000042450072,0.00003663513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039122213,0.00010109079,0.00015146912,0.000035861398,0.00008320708,0.00005925344,0.0006386703,0.000029662684,0.00019307423],"category_scores_gemma":[0.0006081825,0.00004919881,0.00006099181,0.0001690948,0.00012638068,0.00017006266,0.00013514824,0.00009100745,0.00031531902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005641679,0.00010375436,0.0000024107674,0.000036429396,0.000009352844,6.219253e-7,0.0016269207,0.00002312053,0.00093108707,0.98977554,0.00005783275,0.0074272687],"study_design_scores_gemma":[0.00012698582,0.00012219783,0.00004428659,0.00022950859,0.000009219416,0.000006132781,0.00012353649,0.06844694,0.24545845,0.6850228,0.00024569474,0.00016426912],"about_ca_topic_score_codex":9.359981e-7,"about_ca_topic_score_gemma":1.8838521e-7,"teacher_disagreement_score":0.51911,"about_ca_system_score_codex":0.000008353806,"about_ca_system_score_gemma":0.0000142925555,"threshold_uncertainty_score":0.40528932},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000074186505,0.0021486632,0.9216048,0.0040464336,0.04555373,0.0032517922,0.00050242944,0.00047706018,0.022407634],"genre_scores_gemma":[0.00031247066,0.00032346076,0.17722048,0.0014696261,0.0058015003,0.0010735724,0.00060858176,0.00030321217,0.8128871],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956302,0.00014884703,0.0010092331,0.00094199454,0.00095200434,0.0013177032],"domain_scores_gemma":[0.995556,0.0003518618,0.0006275633,0.0027707478,0.00026666172,0.0004271642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015555714,0.0009575301,0.0010476097,0.00022878173,0.0007015846,0.0009233845,0.0040025786,0.0005724105,0.00018576058],"category_scores_gemma":[0.00032806187,0.00052376813,0.00049002114,0.00049155514,0.00015207393,0.00049847754,0.0010472033,0.0009109412,0.00077129813],"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.000022043863,0.00010210548,5.539415e-7,0.0013667886,0.00014857012,0.00001861274,0.004052054,0.000007402651,0.000049317252,0.1267539,0.85994846,0.007530231],"study_design_scores_gemma":[0.00025971755,0.00021195416,0.000004455703,0.00062778214,0.00019767144,0.00011931664,0.00029243375,0.06974487,0.00013764114,0.012238958,0.9152005,0.00096474943],"about_ca_topic_score_codex":0.00003770246,"about_ca_topic_score_gemma":0.000017723567,"teacher_disagreement_score":0.7904795,"about_ca_system_score_codex":0.00011044139,"about_ca_system_score_gemma":0.00023685841,"threshold_uncertainty_score":0.9997214},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094614625,0.00038927837,0.8993603,0.0014798224,0.000083108476,0.000351028,0.000023466117,0.00012367182,0.0035747075],"genre_scores_gemma":[0.979972,0.000044140103,0.019384764,0.00023217736,0.00015124313,0.000037438826,0.000004066995,0.000005663032,0.00016847941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994049,0.000013498154,0.0001578868,0.00019593444,0.000105969244,0.00012181511],"domain_scores_gemma":[0.99952656,0.000074217576,0.000063501306,0.00023040888,0.000031229345,0.00007408818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000077991404,0.00007708828,0.00010290676,0.00005669769,0.000107168264,0.00002639789,0.00031437253,0.0000394081,0.000020686131],"category_scores_gemma":[0.000009948097,0.00006687866,0.00003564849,0.0002802608,0.00002760819,0.00013991637,0.00008114915,0.00007696764,0.00010473527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005299118,0.000108933324,0.0000071866907,0.000011546471,0.00000679962,6.054338e-7,0.00011883717,0.00017550627,0.0007107133,0.98841447,0.000073330215,0.010366783],"study_design_scores_gemma":[0.005831702,0.0018653804,0.0036785682,0.00014131934,0.000119771,0.00017516228,0.00016498704,0.09583759,0.28445283,0.4764915,0.12923805,0.0020031412],"about_ca_topic_score_codex":0.000006061696,"about_ca_topic_score_gemma":2.2402652e-7,"teacher_disagreement_score":0.8853574,"about_ca_system_score_codex":0.0000062758377,"about_ca_system_score_gemma":0.00003052148,"threshold_uncertainty_score":0.27272326},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04815767,0.002814759,0.92839825,0.0040505272,0.0029123628,0.00060560554,0.000051269126,0.0003362705,0.012673304],"genre_scores_gemma":[0.97091424,0.0006740708,0.019949628,0.000817631,0.0007669735,0.00003735772,0.000036389443,0.000029387142,0.006774341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632174,0.001129794,0.0007254812,0.0006374568,0.00042218095,0.00076335645],"domain_scores_gemma":[0.99810874,0.00032248924,0.00033970567,0.0007427744,0.00015460607,0.000331676],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014480082,0.00044531806,0.0004357315,0.00015951961,0.00035642838,0.00051276165,0.00090491923,0.00046568052,0.001702484],"category_scores_gemma":[0.00007688282,0.00047976582,0.0001981528,0.00041950066,0.00033378694,0.0011660656,0.00021205902,0.00062629173,0.0006303513],"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.000116729054,0.0010246855,0.0006304461,0.00049280474,0.00009515252,0.000177641,0.006578157,0.008054126,0.0027291244,0.6552293,0.08359122,0.24128067],"study_design_scores_gemma":[0.0013541075,0.00066337426,0.015959661,0.00073984504,0.000092593094,0.00062911725,0.0004191345,0.8024259,0.00862922,0.033269912,0.13483492,0.0009821798],"about_ca_topic_score_codex":0.00017341992,"about_ca_topic_score_gemma":0.000010253813,"teacher_disagreement_score":0.92275655,"about_ca_system_score_codex":0.0005271198,"about_ca_system_score_gemma":0.0004082088,"threshold_uncertainty_score":0.9997654},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8379892,0.0000620095,0.017674351,0.08791404,0.00019069345,0.001123413,0.00005197554,0.00013557165,0.054858718],"genre_scores_gemma":[0.9829423,0.0000012409913,0.0020517795,0.0037451964,0.00007450752,0.000035399527,0.0000019847334,0.000015752863,0.01113183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986748,0.00025761186,0.00021897325,0.00020510338,0.00028101017,0.00036246408],"domain_scores_gemma":[0.9987614,0.0002584508,0.00008068012,0.0006152092,0.000049848986,0.00023440842],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000580949,0.0001398829,0.00022577072,0.000025530679,0.00019941303,0.00006770252,0.001080565,0.00007094156,0.010384781],"category_scores_gemma":[0.00012049525,0.00006861909,0.000101542144,0.00028299814,0.00020217164,0.00003781829,0.00005534378,0.00021552376,0.00108944],"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.00006669714,0.00039825685,0.00057661906,0.00009826059,0.00024591447,0.00013396659,0.004429009,0.000085954845,0.000066828514,0.9444824,0.0314064,0.018009737],"study_design_scores_gemma":[0.0035874152,0.00031914143,0.027079884,0.00046512834,0.00016490041,0.00024869211,0.000101241865,0.049715802,0.0011452503,0.070652254,0.8450481,0.0014721662],"about_ca_topic_score_codex":0.00030799923,"about_ca_topic_score_gemma":0.00021740701,"teacher_disagreement_score":0.8738301,"about_ca_system_score_codex":0.000058439095,"about_ca_system_score_gemma":0.00015279309,"threshold_uncertainty_score":0.9996883},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015704006,0.0005246804,0.9829831,0.0004853366,0.000012979152,0.00011996868,0.0000066592434,0.000009832109,0.00015345248],"genre_scores_gemma":[0.9495079,0.00024193265,0.049311195,0.000034139935,0.00021987155,0.000060292226,0.0000010724178,0.00000473142,0.000618864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992279,0.000034913843,0.00040606785,0.00010548683,0.00013737316,0.00008828572],"domain_scores_gemma":[0.9990168,0.00039860661,0.00022927576,0.00015670637,0.000106281295,0.00009228422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031173078,0.00007459427,0.00031025216,0.0001479446,0.00012140823,0.00014316571,0.00019757582,0.000029235352,0.00002896634],"category_scores_gemma":[0.000037715996,0.00004970315,0.00011997623,0.00028110907,0.0000515976,0.00013559019,0.000044301636,0.00005911094,0.0000026260034],"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.0000022148195,0.00015839798,0.00006153662,0.00014167953,0.00034709778,5.302495e-7,0.0004379268,0.000045387194,0.00012924883,0.9914097,0.00010472811,0.0071615395],"study_design_scores_gemma":[0.0003713746,0.00008729769,0.00017483375,0.00003424346,0.00077075924,0.000053703825,0.00025671168,0.7985876,0.00017674796,0.19567136,0.0036560234,0.00015928502],"about_ca_topic_score_codex":7.914222e-7,"about_ca_topic_score_gemma":1.6197157e-7,"teacher_disagreement_score":0.9338039,"about_ca_system_score_codex":0.000004709017,"about_ca_system_score_gemma":0.0000037105535,"threshold_uncertainty_score":0.20268357},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015372119,0.004231753,0.9867425,0.0032099537,0.0019520709,0.00088132464,0.00003146933,0.00015877106,0.0012549228],"genre_scores_gemma":[0.9006777,0.001881636,0.06838115,0.0011863981,0.0039985976,0.0004154412,0.00017198685,0.00013937545,0.023147734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977949,0.0001841511,0.000575908,0.00051582174,0.0004823702,0.00044682616],"domain_scores_gemma":[0.9971061,0.0011527981,0.00044333242,0.00095711544,0.00022236381,0.000118327895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008288475,0.00035419347,0.0003870706,0.00011605891,0.00070789026,0.0005892574,0.0011223785,0.00014639713,0.00043297483],"category_scores_gemma":[0.00028206955,0.00023939763,0.00030206048,0.00065758434,0.000100857134,0.0005687603,0.00016940018,0.00020525484,0.000512011],"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.0003384459,0.0017418059,0.0003670668,0.00094680313,0.0018775541,0.00003570068,0.044502907,0.0051757884,0.0108447205,0.7461138,0.02283484,0.16522062],"study_design_scores_gemma":[0.00066496985,0.00013118931,0.00019507183,0.00010204204,0.0003294138,0.000023927038,0.0004400254,0.7424675,0.002968653,0.043321773,0.2088808,0.0004746021],"about_ca_topic_score_codex":0.000016069605,"about_ca_topic_score_gemma":8.616852e-7,"teacher_disagreement_score":0.91836137,"about_ca_system_score_codex":0.00004816928,"about_ca_system_score_gemma":0.00006465916,"threshold_uncertainty_score":0.9762352},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41922542,0.00644763,0.5579328,0.0049974564,0.000081668564,0.0013859435,0.000096533666,0.00035000226,0.009482521],"genre_scores_gemma":[0.9647969,0.00018031501,0.034218077,0.0001801688,0.000096275195,0.000052770443,0.000004415306,0.0000073462143,0.00046374323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993394,0.000032547294,0.00018378641,0.00021111328,0.0001083021,0.00012483119],"domain_scores_gemma":[0.99935436,0.00013121063,0.00008630154,0.00029699295,0.000056205976,0.00007494981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010935633,0.00009181867,0.00013625405,0.00006317535,0.00012998428,0.000032300042,0.00032372723,0.00003932479,0.000064189735],"category_scores_gemma":[0.000009589326,0.00007304752,0.000024022343,0.00037419892,0.000052360847,0.00022331758,0.000073829,0.000072250514,0.00003749759],"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.00001160784,0.0003892869,0.00030125445,0.0001527007,0.00005450759,0.0000038645285,0.0010182313,0.00004733506,0.0018544811,0.9648793,0.00060711027,0.030680351],"study_design_scores_gemma":[0.0029102222,0.0013340684,0.004992678,0.0001501841,0.00026185453,0.00021897396,0.0005774085,0.7803285,0.05371366,0.06179685,0.09186465,0.0018509498],"about_ca_topic_score_codex":0.00000577709,"about_ca_topic_score_gemma":0.000001734308,"teacher_disagreement_score":0.90308243,"about_ca_system_score_codex":0.0000033888991,"about_ca_system_score_gemma":0.000013764226,"threshold_uncertainty_score":0.29787916},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20250984,0.0018654745,0.7821562,0.0019968315,0.00008380658,0.0012519315,0.000018033263,0.00036826692,0.009749613],"genre_scores_gemma":[0.97611195,0.0001272582,0.022834267,0.00024344484,0.00009067735,0.00019859831,0.0000018611804,0.0000086619575,0.00038326328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993885,0.000017842956,0.00010947933,0.00024960455,0.00010054021,0.00013401122],"domain_scores_gemma":[0.9995001,0.000061689956,0.000049490307,0.00026941567,0.000050033595,0.000069278845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000091165144,0.00010287426,0.000093110415,0.000049806942,0.00018019513,0.000047959682,0.00032398693,0.000029224333,0.000018195175],"category_scores_gemma":[0.000009055874,0.0000631385,0.000019277108,0.00019960273,0.000042152125,0.00019040318,0.000072141294,0.000069670634,0.00012276183],"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.000018311262,0.00012764626,0.000065458014,0.0000249739,0.000014069575,0.0000021636915,0.0007818059,0.000004272881,0.0008008521,0.9743098,0.000019818333,0.023830839],"study_design_scores_gemma":[0.0028079716,0.0025984605,0.010843486,0.0003511217,0.00017405637,0.00023449943,0.00044068866,0.08768806,0.6108972,0.16596806,0.11536571,0.0026306973],"about_ca_topic_score_codex":0.000007312183,"about_ca_topic_score_gemma":0.0000021192243,"teacher_disagreement_score":0.80834174,"about_ca_system_score_codex":0.0000033766462,"about_ca_system_score_gemma":0.000022691109,"threshold_uncertainty_score":0.25747132},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03467261,0.000028705634,0.9502609,0.00006208143,0.000119139586,0.000099042896,3.9938857e-7,0.000079679914,0.014677475],"genre_scores_gemma":[0.5591526,9.757496e-7,0.44077006,0.000014845429,0.0000081434555,0.0000018934545,4.0720525e-7,0.000003614637,0.000047429585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925417,0.0000591981,0.00025584557,0.00012493179,0.00018127116,0.00012459392],"domain_scores_gemma":[0.99937546,0.00017152031,0.00015193019,0.00020651618,0.00006237013,0.000032229756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052493357,0.000081332306,0.00014118891,0.000084690866,0.000049737362,0.000052460182,0.00026029485,0.000027052096,0.000015776965],"category_scores_gemma":[0.00006934253,0.00007364067,0.000054378976,0.00026273687,0.000028135608,0.0001957917,0.000032743163,0.00005032528,0.00002672614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.8966218e-7,0.00006282557,0.0000075134444,0.000053041087,0.000007923319,0.0000013400709,0.0015273012,0.0007526481,0.00051837217,0.9935557,0.000032723496,0.0034802095],"study_design_scores_gemma":[0.00014850193,0.000024913083,0.000036276015,0.000027147078,0.000002676851,0.000019602032,0.000093512775,0.21506852,0.0068314527,0.7775978,0.000071770024,0.00007782105],"about_ca_topic_score_codex":4.886764e-7,"about_ca_topic_score_gemma":7.553454e-8,"teacher_disagreement_score":0.52448,"about_ca_system_score_codex":0.00001094837,"about_ca_system_score_gemma":0.000024616802,"threshold_uncertainty_score":0.30029795},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032219412,0.000036947004,0.9935717,0.00034055868,0.0001943729,0.0003852379,0.000018644447,0.00022332571,0.002007265],"genre_scores_gemma":[0.5080029,0.0000013275965,0.49074686,0.000121775745,0.00020870275,0.000084144325,0.00002261711,0.000021560474,0.0007901493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894065,0.000028230881,0.00030322108,0.0002442458,0.00021492198,0.00026874145],"domain_scores_gemma":[0.9992003,0.00019880697,0.00014702698,0.000326142,0.00006355389,0.000064195774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016545093,0.00015133634,0.00021142482,0.00004718208,0.00012986014,0.0001381166,0.00043436294,0.00006538925,0.000048597853],"category_scores_gemma":[0.000049144,0.00012451742,0.00010206245,0.00023788531,0.000046888294,0.00020459239,0.00006383419,0.00007386253,0.00006105692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003536347,0.00017712885,0.000027224338,0.00020505622,0.0000130242215,0.0000029218163,0.0002788433,0.00053456915,0.00073278224,0.9907202,0.0028171022,0.0044875774],"study_design_scores_gemma":[0.0003897987,0.00009013953,0.0001131609,0.000034348002,0.000012791414,0.000033000197,0.000041397816,0.1507611,0.0018344285,0.8392325,0.0072115967,0.00024575935],"about_ca_topic_score_codex":0.000009529771,"about_ca_topic_score_gemma":0.0000013648893,"teacher_disagreement_score":0.50478095,"about_ca_system_score_codex":0.000024360015,"about_ca_system_score_gemma":0.000021518614,"threshold_uncertainty_score":0.5077673},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.250484,0.00024646422,0.74847835,0.0005636992,0.00009671059,0.000029746929,0.00000496942,0.000009047497,0.00008704004],"genre_scores_gemma":[0.9619733,0.000074479445,0.037658833,0.00007532969,0.00013568555,5.937851e-7,0.0000011485054,0.000004392114,0.00007622397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982693,0.00022165505,0.000822471,0.00015446106,0.00036371234,0.00016838242],"domain_scores_gemma":[0.9986237,0.00024669274,0.00061752443,0.00023585542,0.00016681984,0.00010936058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047706885,0.00010927299,0.0005760023,0.0007140008,0.00004996586,0.000029381885,0.00060552155,0.000049467744,0.000107202955],"category_scores_gemma":[0.00018778697,0.00008769731,0.00040144924,0.0021828655,0.000059455404,0.00044262875,0.00007750406,0.00014626035,0.000005176964],"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.0019796467,0.0070895837,0.23973745,0.00017286144,0.006938466,0.002700045,0.008808701,0.40693697,0.17754483,0.0075803692,0.008272523,0.13223855],"study_design_scores_gemma":[0.0042639254,0.0010013013,0.05991078,0.00009834561,0.0010991609,0.00048514173,0.00023321073,0.8353092,0.09058386,0.0021248718,0.0039806636,0.000909505],"about_ca_topic_score_codex":0.00009346112,"about_ca_topic_score_gemma":0.000001081103,"teacher_disagreement_score":0.7114893,"about_ca_system_score_codex":0.000029904812,"about_ca_system_score_gemma":0.00009565219,"threshold_uncertainty_score":0.35761926},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019274427,0.0005924288,0.97799605,0.0003642297,0.000067196,0.00049915526,0.000011658555,0.00010706132,0.0010877955],"genre_scores_gemma":[0.7454089,0.00041239717,0.24776939,0.0015789173,0.001040188,0.00059125456,0.000031198662,0.00004155063,0.0031262382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99930835,0.000010049101,0.00015267903,0.0002618002,0.00008434443,0.000182754],"domain_scores_gemma":[0.9992692,0.00027681634,0.000054882177,0.00026636836,0.000048433587,0.00008431761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031031275,0.000087393564,0.00008820528,0.000070159476,0.00021840665,0.0000498532,0.0003019331,0.000047692236,0.0000073680344],"category_scores_gemma":[0.000025017462,0.00007362079,0.000039427,0.00023345501,0.000017219849,0.00011676342,0.000051992454,0.000058673977,0.00005059944],"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.0000056617687,0.00004021098,0.0000035708038,0.000020640902,0.0000044934895,9.751117e-7,0.00008402285,0.0000027943277,0.0006456577,0.9247421,0.00011232895,0.07433755],"study_design_scores_gemma":[0.00093958393,0.000438264,0.00044109495,0.000051137504,0.000041093765,0.00005376283,0.00007370435,0.08566141,0.07448551,0.35445678,0.4826645,0.0006931501],"about_ca_topic_score_codex":8.7502406e-7,"about_ca_topic_score_gemma":9.835807e-7,"teacher_disagreement_score":0.73022664,"about_ca_system_score_codex":0.000007060081,"about_ca_system_score_gemma":0.000011710374,"threshold_uncertainty_score":0.30021685},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021130249,0.00012407445,0.9716255,0.0011892773,0.0005638303,0.0009351218,0.000010003686,0.00028957005,0.004132364],"genre_scores_gemma":[0.6317651,0.0000039557394,0.36402372,0.00038037336,0.00052101706,0.00034199608,0.000010928398,0.00003371604,0.002919159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998639,0.00008152955,0.0004266753,0.00021587277,0.00022072792,0.00041621056],"domain_scores_gemma":[0.99864036,0.0003974983,0.00020716825,0.00050609175,0.00008765889,0.00016124758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010107656,0.00017497032,0.00024385295,0.00011456818,0.00020884792,0.00017440922,0.00054089073,0.00007989562,0.0001110738],"category_scores_gemma":[0.00020048501,0.0001505135,0.0001072594,0.00026108968,0.00005610458,0.0011893741,0.00009989863,0.000073444346,0.00049242016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035012015,0.00019621474,0.000060418453,0.00034809625,0.000030573072,7.401121e-7,0.0047670873,0.000050189996,0.00086197036,0.9878674,0.001445923,0.0043678544],"study_design_scores_gemma":[0.0013963262,0.00015846305,0.00028341633,0.00023177544,0.00007195486,0.00012680585,0.00057056587,0.12179455,0.012110372,0.8472346,0.015077909,0.0009432586],"about_ca_topic_score_codex":0.0000023504826,"about_ca_topic_score_gemma":0.0000016331319,"teacher_disagreement_score":0.61063486,"about_ca_system_score_codex":0.000034830508,"about_ca_system_score_gemma":0.000048350055,"threshold_uncertainty_score":0.63292295},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002664685,0.00019557498,0.9952268,0.0010620484,0.000018018778,0.000198454,0.000003956334,0.000018732031,0.00061175844],"genre_scores_gemma":[0.09210403,0.00001611318,0.90741664,0.00016582783,0.00019708014,0.00002214381,0.0000012186459,0.0000056939466,0.00007124044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918485,0.000007546512,0.00037449625,0.00008719105,0.000246254,0.00009968232],"domain_scores_gemma":[0.9988184,0.0005105562,0.00036443645,0.00007921439,0.00016311546,0.000064277236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042420204,0.00009056197,0.0001884727,0.00008418518,0.000114632785,0.00010129459,0.00024311047,0.000022890865,0.000003868465],"category_scores_gemma":[0.000006466153,0.00006235948,0.00004533696,0.0001087659,0.00003868962,0.00019594759,0.000033495748,0.0000650554,0.0000034627246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013273293,0.00008966825,7.3737755e-7,0.000093716124,0.00003113103,4.2325829e-7,0.00054307847,0.019454263,0.00003194988,0.94985145,0.0001436788,0.029746616],"study_design_scores_gemma":[0.0008270412,0.0000992782,0.000015597458,0.000036762296,0.00003087985,0.00019024688,0.0002458998,0.07858997,0.00037522634,0.9093688,0.010088374,0.00013191641],"about_ca_topic_score_codex":6.0424945e-8,"about_ca_topic_score_gemma":8.4095475e-8,"teacher_disagreement_score":0.08943935,"about_ca_system_score_codex":0.000011399117,"about_ca_system_score_gemma":0.000051043018,"threshold_uncertainty_score":0.2542946},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25196293,0.000598609,0.74345875,0.00022374249,0.000056833498,0.0017039498,0.00011095753,0.00030367056,0.0015805331],"genre_scores_gemma":[0.8677051,0.00009481645,0.13050447,0.00018844752,0.00020943393,0.00074481627,0.000021405753,0.000022514574,0.0005089772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990674,0.000014440994,0.00019366863,0.00037807153,0.00011891701,0.00022747168],"domain_scores_gemma":[0.99921095,0.000083065606,0.00009379906,0.00040719123,0.00008968687,0.00011531063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013733562,0.00014683999,0.00014697907,0.00006671601,0.00027091903,0.000077779325,0.0004897801,0.00005302718,0.000041532843],"category_scores_gemma":[0.0000065624445,0.0001171362,0.000045351997,0.0002546377,0.000041758783,0.0002982332,0.0000908133,0.000075180884,0.000039682887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031008014,0.0002946979,0.0007120955,0.00005636308,0.000035683428,0.0000038644553,0.0009057325,0.0000021762999,0.0013197128,0.9070937,0.0000940108,0.08945095],"study_design_scores_gemma":[0.00686398,0.0044310237,0.05537599,0.00013206301,0.0011497734,0.0008875467,0.00058647315,0.118346356,0.25153604,0.38582593,0.17008139,0.004783429],"about_ca_topic_score_codex":0.000012139309,"about_ca_topic_score_gemma":0.0000084286885,"teacher_disagreement_score":0.61574215,"about_ca_system_score_codex":0.0000075950807,"about_ca_system_score_gemma":0.000044567998,"threshold_uncertainty_score":0.47766757},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03248261,0.00013700768,0.9620322,0.00083201495,0.000100903446,0.00041224208,0.000016729058,0.00006368535,0.0039225854],"genre_scores_gemma":[0.99324423,0.00004673436,0.0056632888,0.00026135112,0.000153334,0.000035915502,0.000005483196,0.0000071554205,0.0005825349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992765,0.00003398736,0.0002110946,0.00020655942,0.00012916095,0.00014265336],"domain_scores_gemma":[0.99918306,0.00012523339,0.00012546314,0.00041131963,0.00009283834,0.00006207072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027506947,0.00008713842,0.00009426444,0.000051724463,0.00023211483,0.00003766968,0.000577188,0.00003683526,0.00002176837],"category_scores_gemma":[0.000023590732,0.00006128992,0.000045733865,0.00041627503,0.00007797539,0.0002153122,0.0001761191,0.0000961669,0.000018094477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014148025,0.00005035404,0.000022575217,0.000006652901,0.000009593198,2.0208621e-7,0.0003348156,0.000005151087,0.004016846,0.9798683,0.000008842065,0.015675247],"study_design_scores_gemma":[0.0007651329,0.00009889798,0.020115849,0.00005479404,0.000051646814,0.00004840352,0.0002620615,0.07557803,0.2317867,0.62805784,0.04264567,0.0005349608],"about_ca_topic_score_codex":0.0000024009696,"about_ca_topic_score_gemma":0.0000013631925,"teacher_disagreement_score":0.9607616,"about_ca_system_score_codex":0.0000055866735,"about_ca_system_score_gemma":0.000022491584,"threshold_uncertainty_score":0.24993302},"labels":[],"label_agreement":null},{"id":"W1982059058","doi":"10.1137/080724071","title":"Stopping Criteria for the Iterative Solution of Linear Least Squares Problems","year":2009,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Residual; Least-squares function approximation; Mathematical optimization; Limit (mathematics); Applied mathematics; Iterative method; Numerical analysis; Property (philosophy); Linear least squares; Algorithm; Linear model; Statistics; Mathematical analysis","score_opus":0.02002872561713478,"score_gpt":0.31837690690640064,"score_spread":0.2983481812892659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982059058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013103856,0.0006592368,0.9945986,0.003044383,0.000022639728,0.00023450627,0.0000120334535,0.000015428895,0.000102780235],"genre_scores_gemma":[0.96919096,0.0002227708,0.029901098,0.00015483597,0.00026842346,0.000041924282,0.0000052323003,0.0000035509256,0.0002112356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991792,0.000063734944,0.00030789492,0.00017137303,0.00014622824,0.00013158345],"domain_scores_gemma":[0.99909085,0.00017348217,0.0002541675,0.00025194295,0.00017032721,0.00005924565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006263161,0.00009148915,0.00018595434,0.00019653508,0.0006087608,0.00017973906,0.00034293346,0.00002926304,0.000012336614],"category_scores_gemma":[0.000015721225,0.000058849888,0.0001941581,0.0007266751,0.000036383517,0.00018450795,0.000024114994,0.00011734063,0.0000021458306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035159217,0.00031280948,0.0001230883,0.000038176862,0.00061851897,9.777868e-7,0.0012264261,0.02052702,0.0072303643,0.74386996,0.00037557873,0.22564194],"study_design_scores_gemma":[0.0005444872,0.0004337561,0.0028449341,0.00004846774,0.000618149,0.000033364726,0.00023554421,0.88945884,0.0015085324,0.083767936,0.020243004,0.00026298812],"about_ca_topic_score_codex":0.0000022454997,"about_ca_topic_score_gemma":0.0000014797176,"teacher_disagreement_score":0.96788055,"about_ca_system_score_codex":0.000012403508,"about_ca_system_score_gemma":0.000020829017,"threshold_uncertainty_score":0.46821576},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03883074,0.000015557684,0.95650864,0.0026954045,0.00042398513,0.00029392872,0.000024850186,0.00009269481,0.0011141981],"genre_scores_gemma":[0.82225025,7.929444e-7,0.17586234,0.0007939115,0.00015869556,0.00011348148,0.000056749195,0.000007084976,0.00075668603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981831,0.00009807456,0.00036465595,0.0005465271,0.00037837453,0.00042927475],"domain_scores_gemma":[0.9987111,0.00067452696,0.00008014319,0.00021918154,0.00019736675,0.00011769496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010844921,0.00014994768,0.00017595946,0.00023419115,0.0003804935,0.00030001724,0.0008885294,0.000056183435,0.000073007745],"category_scores_gemma":[0.00013707316,0.00011861238,0.00007648356,0.000450744,0.00014397567,0.0007368607,0.0001582203,0.00009096964,0.00013019235],"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.000011762564,0.00029774007,0.00053408794,0.000038273924,0.00001533719,0.000002758152,0.0012228608,0.28388324,0.000989889,0.6764759,0.0006926407,0.035835505],"study_design_scores_gemma":[0.00033089548,0.00008713131,0.0029781836,0.000011017812,0.0000025536287,0.000009459733,0.000013588398,0.74312127,0.00021657371,0.25045204,0.0026093195,0.00016798885],"about_ca_topic_score_codex":0.00003342826,"about_ca_topic_score_gemma":0.000030393367,"teacher_disagreement_score":0.7834195,"about_ca_system_score_codex":0.000034580808,"about_ca_system_score_gemma":0.000113180125,"threshold_uncertainty_score":0.48368722},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99238807,0.0002246976,0.0012779612,0.002263167,0.0001815057,0.00040189142,0.000032567783,0.00010817282,0.0031219572],"genre_scores_gemma":[0.59346133,0.00018125345,0.40524516,0.0001440148,0.0006003941,0.00006713717,0.0000071818577,0.000039305574,0.0002542121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773127,2.6809795e-8,0.0007822456,0.0003689193,0.00077894365,0.0003385919],"domain_scores_gemma":[0.99752784,0.00022787717,0.00057337957,0.0000843071,0.0014795804,0.000107037944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008084274,0.0002630589,0.00042105166,0.00022577572,0.00007835125,0.000116745665,0.0017747962,0.00014093492,0.000014423317],"category_scores_gemma":[0.0004016057,0.0002212416,0.0005238383,0.00095422025,0.0001427262,0.00084809604,0.00026542973,0.00019900918,0.0000029265482],"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.000030628085,0.00015387856,0.00012362566,0.00036056564,0.00018832822,5.030803e-8,0.00017145813,0.00031103328,0.13255653,0.8623942,0.0019552847,0.0017544145],"study_design_scores_gemma":[0.0024907053,0.00060734776,0.0015194854,0.00042032325,0.0002091172,0.000051977382,0.0005620126,0.5706546,0.38870156,0.012123077,0.021867152,0.0007926364],"about_ca_topic_score_codex":0.000005205567,"about_ca_topic_score_gemma":6.428917e-8,"teacher_disagreement_score":0.8502711,"about_ca_system_score_codex":0.000096282965,"about_ca_system_score_gemma":0.00003572106,"threshold_uncertainty_score":0.90219706},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.8311495e-8,0.89864737,0.09874579,0.00008917511,0.0000145966405,0.001628329,0.0001170715,0.000077292854,0.00068028056],"genre_scores_gemma":[7.0789815e-7,0.992335,0.0056759873,0.00020515558,0.0001452055,0.0014276723,0.00007173338,0.000019027062,0.00011948847],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985025,0.00008800766,0.0006319901,0.0005033497,0.00010278844,0.00017138742],"domain_scores_gemma":[0.9981665,0.0003981502,0.00045733587,0.00073815556,0.00011218997,0.00012767555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019682209,0.00030586252,0.0009356515,0.00016097445,0.00020628427,0.00003721696,0.00073254266,0.00013996134,0.000012149385],"category_scores_gemma":[0.000020416073,0.00022426707,0.00018346592,0.0009781657,0.0000910256,0.00015650404,0.00032228802,0.00022108249,0.000049558865],"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":[1.0381282e-7,0.000030407666,5.4762694e-8,0.029942956,0.000029742381,1.6753931e-7,0.000026574678,2.3300114e-8,2.3322143e-7,0.13981135,0.00021994697,0.8299385],"study_design_scores_gemma":[0.00004165768,0.00001454316,1.9462564e-7,0.0073114345,0.000086426626,0.00011070611,0.0000028633904,0.00015335674,0.0000026125388,0.002622339,0.9894364,0.0002174666],"about_ca_topic_score_codex":0.0000013743737,"about_ca_topic_score_gemma":1.4192166e-7,"teacher_disagreement_score":0.98921645,"about_ca_system_score_codex":0.000007839015,"about_ca_system_score_gemma":0.0001206395,"threshold_uncertainty_score":0.91453457},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6451906,0.0039618043,0.3374928,0.009126429,0.00017093067,0.0010252298,0.000037380407,0.00004868865,0.0029461281],"genre_scores_gemma":[0.9958339,0.00008984672,0.00224859,0.0011830596,0.00012110399,0.000041244675,6.2923596e-7,0.000009725044,0.00047195124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847674,0.00049141573,0.0002974282,0.00025829338,0.00020783779,0.00026829762],"domain_scores_gemma":[0.9964085,0.002414429,0.00029276148,0.0008156534,0.00004128022,0.000027336939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00538191,0.00016334804,0.0002372097,0.0001557588,0.00030847322,0.00010483616,0.0020738223,0.00005768547,0.000020387233],"category_scores_gemma":[0.00023419675,0.000060722607,0.00009884187,0.0017086415,0.0003776782,0.00033822018,0.0002705283,0.0002947189,0.000007713879],"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.0000836665,0.00006388046,0.00016317613,0.0000059634785,0.000057007615,9.974051e-7,0.003219904,0.036687624,0.0000020503915,0.9442344,0.00013841272,0.015342927],"study_design_scores_gemma":[0.0018182012,0.000042847103,0.0036942079,0.0000143936795,0.000033588414,0.000014769787,0.00019626571,0.83290786,0.00009288179,0.16024539,0.0007827637,0.00015687004],"about_ca_topic_score_codex":0.00001709556,"about_ca_topic_score_gemma":0.00006282558,"teacher_disagreement_score":0.7962202,"about_ca_system_score_codex":0.0000329471,"about_ca_system_score_gemma":0.000062709376,"threshold_uncertainty_score":0.3853712},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017390065,0.0009854645,0.99572885,0.0004562539,0.00005082248,0.00050512963,0.00003587235,0.0001550582,0.0003435521],"genre_scores_gemma":[0.07058538,0.0021425555,0.9179209,0.0012322713,0.0013870634,0.001832454,0.00016194051,0.000043486587,0.0046939435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993073,0.000016390743,0.00015505699,0.00027101394,0.00009739493,0.0001528872],"domain_scores_gemma":[0.99943036,0.00011225289,0.00006281831,0.00022266392,0.00009329692,0.00007858475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000104222374,0.00009413593,0.00010412043,0.0000694476,0.0003596417,0.000041101142,0.00028257858,0.000049390062,0.000012067333],"category_scores_gemma":[0.000012454981,0.00008637891,0.000039569768,0.00033351567,0.00002778846,0.00024521496,0.00006474264,0.000047832793,0.00006020948],"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.0000018753794,0.00008973644,0.000026129836,0.000030794567,0.00001596322,0.0000012097189,0.0002992435,0.000009245075,0.00022739632,0.79801196,0.0008303542,0.20045611],"study_design_scores_gemma":[0.0006299083,0.00008025997,0.0003920859,0.000010774078,0.00001981027,0.00007968995,0.000021665232,0.6552137,0.004472959,0.055106986,0.28363112,0.00034105172],"about_ca_topic_score_codex":0.0000021990907,"about_ca_topic_score_gemma":3.6830804e-7,"teacher_disagreement_score":0.74290496,"about_ca_system_score_codex":0.000005904458,"about_ca_system_score_gemma":0.000032842385,"threshold_uncertainty_score":0.35224298},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9031507,0.0066031185,0.01663722,0.0031594029,0.0025121279,0.00046705763,0.0022487433,0.0010320267,0.06418962],"genre_scores_gemma":[0.977183,0.0030124788,0.009404834,0.0025331853,0.0036075804,0.0016065099,0.001344834,0.0005966066,0.00071097683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9874136,0.00060330436,0.0027608213,0.0033720627,0.0027720518,0.0030781713],"domain_scores_gemma":[0.9897092,0.0021990319,0.0026613118,0.0031254322,0.0005199281,0.0017851259],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0024182692,0.0015902775,0.00079567777,0.00073066715,0.0032559503,0.0027930902,0.0040415945,0.0025226257,0.012022869],"category_scores_gemma":[0.0010028965,0.0024833628,0.0018344091,0.0026499243,0.0016323174,0.0027185378,0.002449756,0.0024502506,0.004476501],"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.00059749297,0.00084228796,0.0000063856733,0.0007845719,0.0011805935,0.00037291256,0.0032266069,0.0014105748,0.001876448,0.9434794,0.029409828,0.01681287],"study_design_scores_gemma":[0.0032634912,0.0030059025,0.00012380049,0.0013721859,0.0020441825,0.0013763168,0.0026927458,0.50131,0.43797034,0.017490873,0.025713857,0.0036362826],"about_ca_topic_score_codex":0.0006847835,"about_ca_topic_score_gemma":0.0003870623,"teacher_disagreement_score":0.92598855,"about_ca_system_score_codex":0.000044914334,"about_ca_system_score_gemma":0.0015877035,"threshold_uncertainty_score":0.9998511},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016936015,0.00016938559,0.972788,0.008575521,0.0003812446,0.0001204126,0.0000017341433,0.0000110801575,0.0010166529],"genre_scores_gemma":[0.29514882,0.000079105164,0.7040699,0.0003003929,0.00027318505,0.0000072135335,9.2291934e-8,0.0000050170597,0.000116284435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987975,0.000009755159,0.0004009677,0.00010136427,0.00053429557,0.00015611817],"domain_scores_gemma":[0.9986069,0.0007844325,0.00026346635,0.0001030266,0.00017134614,0.000070835464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001574082,0.00008970046,0.00015722636,0.00008692591,0.00016133429,0.0003624627,0.0013118415,0.000025803236,0.000021614196],"category_scores_gemma":[0.00036739538,0.000045768902,0.000112567024,0.00012223978,0.00021181234,0.0004169766,0.00012225105,0.00008630049,0.000007355892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030424335,0.000102888465,0.000001491177,0.000015752492,0.000034531797,0.0000067075653,0.00088288524,0.00014410885,0.00013095749,0.9935288,0.00006915319,0.0050797123],"study_design_scores_gemma":[0.00043390426,0.00011542262,0.000010041234,0.000079818165,0.000013693057,0.0006495607,0.00027364152,0.02971783,0.0010470484,0.96680295,0.00078705564,0.00006901522],"about_ca_topic_score_codex":0.0000011662573,"about_ca_topic_score_gemma":6.5669514e-7,"teacher_disagreement_score":0.2782128,"about_ca_system_score_codex":0.000023047745,"about_ca_system_score_gemma":0.00007913892,"threshold_uncertainty_score":0.3495236},"labels":[],"label_agreement":null},{"id":"W1984710842","doi":"10.1002/nla.240","title":"Lanczos, Householder transformations, and implicit deflation for fast and reliable dominant singular subspace computation","year":2001,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of California, San Diego; California State University San Marcos; McGill University; University of California Berkeley","keywords":"Lanczos resampling; Lanczos algorithm; Linear subspace; Mathematics; Computation; Krylov subspace; Subspace topology; Matrix (chemical analysis); Singular value; Signal subspace; Algorithm; Numerical linear algebra; Applied mathematics; Algebra over a field; Sparse matrix; Singular spectrum analysis; Singular value decomposition; Eigenvalues and eigenvectors; Pure mathematics; Mathematical analysis; Computer science; Numerical analysis; Iterative method; Noise (video); Artificial intelligence","score_opus":0.009264214916319834,"score_gpt":0.24281266378439495,"score_spread":0.2335484488680751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984710842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01042607,0.00018112721,0.986819,0.0013710725,0.000016929707,0.0008147849,0.000011469708,0.00013772064,0.00022182541],"genre_scores_gemma":[0.50234616,0.00007875192,0.49653932,0.00032461362,0.0000957372,0.00045003885,0.000052319498,0.000021872027,0.000091203554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990791,0.00002334288,0.00021665293,0.0003336665,0.00013356237,0.00021367194],"domain_scores_gemma":[0.999326,0.00013708876,0.000090734575,0.00022446478,0.00009763661,0.00012405758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017521944,0.00013912964,0.00016509915,0.000071824106,0.00036544452,0.000117473974,0.00014724387,0.000058724756,0.0000028485763],"category_scores_gemma":[0.000008924587,0.00011694886,0.00002695386,0.00043010592,0.000059413393,0.00037144896,0.0000304352,0.00009099796,0.000008172351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012958856,0.000323952,0.0022907597,0.00015557936,0.0000625971,0.0000032186806,0.0013456888,0.003923623,0.001040933,0.6521277,0.00039706207,0.33819932],"study_design_scores_gemma":[0.0015122173,0.0002503428,0.0029848735,0.000028570841,0.00005373423,0.00015993303,0.000110984605,0.9023059,0.00090807123,0.039775454,0.05148076,0.00042915504],"about_ca_topic_score_codex":0.0000132504265,"about_ca_topic_score_gemma":0.0000027091676,"teacher_disagreement_score":0.8983823,"about_ca_system_score_codex":0.000016782653,"about_ca_system_score_gemma":0.00002942352,"threshold_uncertainty_score":0.47690362},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062335502,0.0059378473,0.9282284,0.000052740248,0.0006360538,0.0024163094,0.00010293178,0.000103080594,0.00018715361],"genre_scores_gemma":[0.9829491,0.00013827712,0.014520967,0.000030614712,0.0003230508,0.0016267776,0.000018088951,0.000027276647,0.00036585293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981619,0.00007131183,0.00051471405,0.00059275376,0.0001716516,0.000487637],"domain_scores_gemma":[0.999133,0.000118607204,0.00019190073,0.00023425973,0.00018625529,0.00013595844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013602017,0.00024652676,0.00037278593,0.0000867295,0.00033000138,0.00017057345,0.0002964229,0.00016802285,0.000007923886],"category_scores_gemma":[0.00008164637,0.00020353608,0.000040046638,0.00026882248,0.000120184384,0.0012066986,0.00008464579,0.00014275388,7.7953837e-7],"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.00015534894,0.00035452747,0.0062133474,0.0019767084,0.00007100997,0.0000114832455,0.008115855,0.00039381284,0.00015459124,0.052210942,0.000033276167,0.9303091],"study_design_scores_gemma":[0.0015882312,0.00075685297,0.00031172016,0.00028025862,0.000029434525,0.000037865895,0.00088077225,0.96502596,0.0015697757,0.011815655,0.017140692,0.0005627807],"about_ca_topic_score_codex":0.00011037833,"about_ca_topic_score_gemma":0.000013477006,"teacher_disagreement_score":0.96463215,"about_ca_system_score_codex":0.000030395186,"about_ca_system_score_gemma":0.00011925327,"threshold_uncertainty_score":0.82999605},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022708012,0.000040874045,0.92787826,0.029534126,0.00018599894,0.00042640948,0.00014013829,0.00013798565,0.018948218],"genre_scores_gemma":[0.9164232,0.0000016756107,0.07912017,0.003952421,0.000119602926,0.000009199752,0.000010535009,0.000017801292,0.0003454021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829656,0.00018883655,0.00035900288,0.00034850338,0.00034649073,0.00046059518],"domain_scores_gemma":[0.99750394,0.0010872722,0.00009668442,0.0007974344,0.000037918642,0.0004767653],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007428938,0.00019188534,0.00027135908,0.00008825497,0.00017342382,0.0001411473,0.0011522494,0.00008559643,0.0051456657],"category_scores_gemma":[0.00043336672,0.00013746809,0.00006596037,0.00022394193,0.00005681744,0.00006636769,0.000042805365,0.0002729891,0.0019950434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041137264,0.000055526434,1.835777e-7,0.000006839309,0.0000063882744,0.000053099524,0.00013171184,0.000020280813,0.000058316557,0.9937511,0.002970007,0.0029424205],"study_design_scores_gemma":[0.00014146854,0.00019341645,0.000010183139,0.000045631656,0.000008571843,0.000014437473,0.000036361747,0.046987373,0.0012052659,0.9456014,0.0055805272,0.00017537939],"about_ca_topic_score_codex":0.00042034587,"about_ca_topic_score_gemma":0.00010303088,"teacher_disagreement_score":0.8937152,"about_ca_system_score_codex":0.000066238536,"about_ca_system_score_gemma":0.00015013719,"threshold_uncertainty_score":0.99878204},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021036346,0.0004354061,0.9745362,0.0031080688,0.00018653779,0.0001319535,0.000045535297,0.000032602085,0.00048739696],"genre_scores_gemma":[0.79050463,0.000028790568,0.20799865,0.0010214077,0.00022187518,0.0000043993787,0.00000234857,0.000011854927,0.0002060217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983667,0.00019852008,0.00045294865,0.00021339151,0.0004659671,0.0003024815],"domain_scores_gemma":[0.9968045,0.0022947455,0.0002484675,0.00031474445,0.00013662093,0.00020093804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009611985,0.0001967708,0.00028528212,0.000058763002,0.00045442002,0.0002938716,0.0008022808,0.000055475008,0.00018203416],"category_scores_gemma":[0.00042010724,0.00010197786,0.00006292415,0.00020203374,0.0002867024,0.0003154933,0.00006465681,0.00056522276,0.000051444324],"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.0011183856,0.00085277477,0.014911932,0.0003992422,0.00035394685,0.0020309638,0.0058677304,0.06837581,0.00026955135,0.49411026,0.014584114,0.39712527],"study_design_scores_gemma":[0.0008273878,0.00050334405,0.0013698878,0.00029040792,0.00005630562,0.0002902532,0.0001306365,0.9717427,0.00042143377,0.01942445,0.004710467,0.00023273361],"about_ca_topic_score_codex":0.00001625858,"about_ca_topic_score_gemma":3.2999216e-7,"teacher_disagreement_score":0.90336686,"about_ca_system_score_codex":0.000015574287,"about_ca_system_score_gemma":0.00020861469,"threshold_uncertainty_score":0.41585362},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015851406,0.0002928175,0.98092353,0.0017499279,0.000047388312,0.00064127677,0.000021049227,0.00020008988,0.0002724948],"genre_scores_gemma":[0.6958628,0.00008750179,0.29984218,0.0013519028,0.0013010161,0.0006761665,0.00008491933,0.000025514368,0.00076799275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990934,0.000030353185,0.00021010202,0.00036894236,0.00010418124,0.0001930246],"domain_scores_gemma":[0.9991993,0.000096671996,0.00005749568,0.00039873528,0.0001059178,0.00014189693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002550611,0.000120057295,0.00011277409,0.00006893725,0.00032192215,0.00009704432,0.00043311034,0.00006704372,0.00002611221],"category_scores_gemma":[0.00002141616,0.000111057176,0.000039745664,0.00026194743,0.000024308845,0.0006182717,0.000056801957,0.0000769665,0.00012216346],"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.0000026292512,0.00008750255,0.0000068312092,0.000012023963,0.0000071382224,8.4870116e-8,0.00022407866,0.00025921277,0.0014079124,0.91245246,0.000088945504,0.08545116],"study_design_scores_gemma":[0.0003459527,0.00009541508,0.000057740355,0.000004625803,0.000011924494,0.00000533564,0.000023352644,0.83850336,0.01248591,0.020516887,0.1277323,0.00021717895],"about_ca_topic_score_codex":0.0000014120868,"about_ca_topic_score_gemma":0.0000014914085,"teacher_disagreement_score":0.8919356,"about_ca_system_score_codex":0.000011017673,"about_ca_system_score_gemma":0.000037621117,"threshold_uncertainty_score":0.45287803},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52772176,0.00058292795,0.05409194,0.0026515496,0.0040097907,0.0017053348,0.000014989523,0.0003917869,0.4088299],"genre_scores_gemma":[0.6642322,0.00008343381,0.33044258,0.000049651273,0.000097144446,0.000023906385,1.4521142e-7,0.000022955379,0.0050479923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885994,0.000006105756,0.00042902888,0.00015200228,0.0003489719,0.00020393071],"domain_scores_gemma":[0.9987878,0.000047650665,0.0004937437,0.00038571967,0.000244983,0.000040064537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007276621,0.0001444219,0.00021429283,0.000039197814,0.00023804102,0.00005942117,0.0023068704,0.00004791236,0.0000073831916],"category_scores_gemma":[0.00022268036,0.00007635432,0.00013655676,0.0003267191,0.00045023067,0.00071849057,0.0006175508,0.00012224981,0.000009124712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064561673,0.00006571524,0.0000871127,0.00023441939,0.00003300046,2.85988e-7,0.0038824105,0.0000011669347,0.000850193,0.9926315,0.00035333465,0.0018543868],"study_design_scores_gemma":[0.00039542638,0.00021032707,0.00035603365,0.00042712202,0.00006606136,0.000110332505,0.002172045,0.0021148135,0.2895687,0.68692476,0.017326327,0.00032805224],"about_ca_topic_score_codex":0.000004151096,"about_ca_topic_score_gemma":0.0000014703033,"teacher_disagreement_score":0.4037819,"about_ca_system_score_codex":0.000010654781,"about_ca_system_score_gemma":0.00003783823,"threshold_uncertainty_score":0.42867777},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57477796,0.00007066888,0.41825435,0.0047356,0.00012388725,0.00047534105,0.000008063577,0.000042589472,0.0015115192],"genre_scores_gemma":[0.993922,0.0000030360056,0.0056977025,0.00026411915,0.000025423742,0.000025847132,7.414022e-7,0.0000032366913,0.00005787094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995246,0.000027470993,0.00009733732,0.00013387743,0.00010792401,0.00010879247],"domain_scores_gemma":[0.99942744,0.00029611742,0.000054849592,0.00016622354,0.000035559653,0.000019795467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017663132,0.000061458406,0.000080085214,0.000063436855,0.000046687943,0.000028262448,0.00033593975,0.000034461835,0.000015102963],"category_scores_gemma":[0.000084602645,0.000036108348,0.000029512827,0.00020929484,0.00002127929,0.0001241035,0.00002819593,0.000054112916,0.0000032725586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029062576,0.0000597161,0.000079103425,0.000029593552,0.00000560397,0.0000043584782,0.0008292753,0.00011658527,0.00022966396,0.9954427,0.00008035382,0.00309399],"study_design_scores_gemma":[0.0021468112,0.0027890415,0.011779861,0.00027558475,0.000015483409,0.000009490398,0.00034068665,0.013067065,0.27895644,0.6898226,0.00039401453,0.00040289824],"about_ca_topic_score_codex":0.000012260729,"about_ca_topic_score_gemma":0.0000045617608,"teacher_disagreement_score":0.41914403,"about_ca_system_score_codex":0.000019078976,"about_ca_system_score_gemma":0.00002648331,"threshold_uncertainty_score":0.14724557},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010708242,0.00008558147,0.9958675,0.0012127943,0.00004294079,0.0017577547,0.000019063144,0.00032781425,0.0005794876],"genre_scores_gemma":[0.002405367,0.000015572714,0.9952243,0.00025408334,0.00013364675,0.0016021954,0.000027758251,0.000027499807,0.00030959374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983017,0.00004343888,0.000385239,0.00052792253,0.00036398772,0.0003777381],"domain_scores_gemma":[0.99706066,0.0012925123,0.00027564462,0.00093417795,0.00025876917,0.00017821918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053508586,0.0002569007,0.00030994092,0.00016645271,0.00042594448,0.00022492859,0.001140179,0.000056661975,0.0000090735175],"category_scores_gemma":[0.000018296581,0.00019109943,0.0000885684,0.00097362424,0.000080118865,0.00022137888,0.00013711608,0.00012258385,0.000048478778],"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.000024158995,0.0005322603,0.000006386685,0.00009936722,0.000069543974,0.0000035259438,0.00072590046,0.02920655,0.000020539452,0.9431518,0.00034119317,0.025818795],"study_design_scores_gemma":[0.0008788275,0.0002048612,0.0000074622412,0.000054314125,0.000057081328,0.00010660492,0.00009530984,0.9297956,0.00008761475,0.048918303,0.019485682,0.0003083024],"about_ca_topic_score_codex":0.0000032283888,"about_ca_topic_score_gemma":0.0000030568385,"teacher_disagreement_score":0.9005891,"about_ca_system_score_codex":0.00004133064,"about_ca_system_score_gemma":0.00013671654,"threshold_uncertainty_score":0.7792809},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8352943,0.0001804368,0.1547279,0.00023661506,0.00026062856,0.00029123155,0.000030940137,0.00020436016,0.008773557],"genre_scores_gemma":[0.90795314,0.00010704315,0.091162026,0.00015774435,0.00018606488,0.0000055749038,0.000010331524,0.00001602952,0.00040206622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989197,0.00009071639,0.0002287882,0.00033049044,0.00019982312,0.00023047291],"domain_scores_gemma":[0.99912083,0.00020352955,0.000117813426,0.00034124037,0.00009159894,0.00012498337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036097982,0.00015799614,0.00022943443,0.00007909468,0.00008844086,0.000042775817,0.00030411748,0.00006342795,0.000013436298],"category_scores_gemma":[0.000039687075,0.0001177075,0.00005070381,0.00021350935,0.00011975565,0.00021511033,0.00014216706,0.00012167565,0.000021577624],"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.0007093132,0.000721172,0.010819348,0.00039433982,0.0003104381,0.00008517937,0.0072242357,0.0006996776,0.0025785372,0.7819951,0.00020680593,0.19425584],"study_design_scores_gemma":[0.0059588677,0.0028290602,0.020634387,0.0003457264,0.00014770505,0.00017482993,0.0003486297,0.8806797,0.052089565,0.0062244786,0.02905152,0.0015155312],"about_ca_topic_score_codex":0.000051236166,"about_ca_topic_score_gemma":0.0000066199514,"teacher_disagreement_score":0.87998,"about_ca_system_score_codex":0.000005060076,"about_ca_system_score_gemma":0.000031148615,"threshold_uncertainty_score":0.47999728},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62718374,0.007652363,0.35021353,0.0045415326,0.0001476779,0.0014634964,0.000065594366,0.00032691227,0.00840515],"genre_scores_gemma":[0.981503,0.00090570794,0.016656576,0.00022216198,0.000075582335,0.00012839575,0.000007632416,0.0000061581077,0.0004948046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934775,0.000027915652,0.00021716476,0.00019181246,0.000089860914,0.00012549307],"domain_scores_gemma":[0.999541,0.000060819377,0.00007411448,0.0002323654,0.000035273628,0.000056431272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011626891,0.000076013224,0.00012273707,0.00009869629,0.000085570624,0.000025053283,0.00025415386,0.000038895836,0.000094570234],"category_scores_gemma":[0.000012054528,0.00006902746,0.000030486535,0.00045342598,0.00002346459,0.0002631596,0.0000705909,0.00006018207,0.00005721544],"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.0000017671512,0.00011368659,0.00014703868,0.0000354326,0.000007815513,7.144689e-7,0.00040375488,0.000030276135,0.0007785926,0.98615146,0.00025670236,0.012072768],"study_design_scores_gemma":[0.0020278925,0.0001494716,0.0018079446,0.0000559535,0.00004067094,0.000026183043,0.00013478703,0.6993293,0.023225078,0.1761522,0.09639178,0.0006587181],"about_ca_topic_score_codex":0.0000095148525,"about_ca_topic_score_gemma":0.000005119804,"teacher_disagreement_score":0.8099992,"about_ca_system_score_codex":0.0000054189336,"about_ca_system_score_gemma":0.000007382074,"threshold_uncertainty_score":0.28148583},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046510753,0.0006789723,0.9874488,0.0007744999,0.00005880741,0.0007318911,0.000010980029,0.00016378768,0.009667157],"genre_scores_gemma":[0.17617819,0.00014700211,0.79349416,0.00061681797,0.00043954214,0.0027935263,0.000017351342,0.00006625581,0.026247187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886626,0.00005634808,0.00024333638,0.00035192337,0.0002266221,0.0002554959],"domain_scores_gemma":[0.9985619,0.0005048265,0.00018472651,0.0005712917,0.00009185176,0.00008536984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004512468,0.00017703605,0.000199117,0.000079671794,0.00024082806,0.00016046914,0.000694739,0.000055609016,0.00020341124],"category_scores_gemma":[0.000049017122,0.00012410081,0.000085778425,0.00030918585,0.000049934646,0.00043253234,0.000069946815,0.000084333034,0.0002081478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013732836,0.00018960322,0.000004990456,0.00009371161,0.000029798588,0.000001995081,0.0021448722,0.000021671398,0.00026547938,0.95114845,0.00083869876,0.04524699],"study_design_scores_gemma":[0.0013996154,0.00029052838,0.00002429463,0.000099239485,0.00008552928,0.00012230569,0.0003486731,0.1289234,0.00809803,0.699714,0.16014513,0.00074924406],"about_ca_topic_score_codex":4.4339905e-7,"about_ca_topic_score_gemma":1.8897681e-7,"teacher_disagreement_score":0.25143445,"about_ca_system_score_codex":0.000017483224,"about_ca_system_score_gemma":0.000016906837,"threshold_uncertainty_score":0.50606847},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64088386,0.0014916323,0.35347608,0.00017721062,0.00042591247,0.00022024686,0.0000076230367,0.000090653826,0.0032267622],"genre_scores_gemma":[0.9368005,0.000044839704,0.06286721,0.000048706686,0.00017367979,0.00001182973,0.0000018700713,0.0000043503014,0.000047006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934447,0.00007766729,0.0001312711,0.00018483409,0.00008815003,0.00017358823],"domain_scores_gemma":[0.99954253,0.00009113531,0.000091957474,0.00015216328,0.00003499918,0.00008720463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034752893,0.00009498728,0.00011625656,0.00008685965,0.00012306006,0.00010690282,0.00011705404,0.00004623182,0.000008419065],"category_scores_gemma":[0.000040684045,0.00008442128,0.000015773812,0.00015756782,0.00016626822,0.0008664317,0.00013250911,0.0000585348,0.000009706744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004590559,0.000019528821,0.0028316726,0.00003804579,0.000013564028,4.5256928e-7,0.0016578888,3.8654608e-7,0.0017510413,0.5639153,0.00003359831,0.4297339],"study_design_scores_gemma":[0.0047626034,0.00036741098,0.1647598,0.0002210518,0.0001631318,0.001629925,0.005287486,0.06849017,0.123416476,0.61705476,0.011306512,0.0025406715],"about_ca_topic_score_codex":0.000005352782,"about_ca_topic_score_gemma":1.925177e-7,"teacher_disagreement_score":0.42719322,"about_ca_system_score_codex":0.000012935316,"about_ca_system_score_gemma":0.000014796475,"threshold_uncertainty_score":0.34425998},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005758447,0.00036977607,0.97613513,0.00030788282,0.00004021099,0.00022637688,9.2091193e-7,0.000026890282,0.022316987],"genre_scores_gemma":[0.112220585,0.00034493912,0.8873255,0.000044928263,0.000008907149,0.00003069521,3.3975374e-7,0.000003859927,0.000020213009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999402,0.00001988527,0.00025477158,0.000098793746,0.00012427894,0.000100278776],"domain_scores_gemma":[0.99935794,0.0002921621,0.00010333279,0.00021992446,0.000010923073,0.000015699587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007326022,0.00007897963,0.00017595163,0.000039817638,0.000043621334,0.000022555401,0.00029032235,0.000024669787,0.0000020685266],"category_scores_gemma":[0.000022598544,0.000050965933,0.000021948883,0.00019617857,0.00012144093,0.00034820315,0.000049776932,0.00006872164,0.0000019287472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000151787835,0.000021552094,3.4783432e-7,0.00015726718,0.0000020960836,3.3659668e-7,0.004112577,0.000634822,0.00006666306,0.9555131,3.204563e-7,0.039475746],"study_design_scores_gemma":[0.000831709,0.00001546096,0.0000024938572,0.000032196007,0.0000041362464,0.000015553274,0.000533965,0.0054635503,0.008686088,0.9839314,0.00041897915,0.00006441941],"about_ca_topic_score_codex":7.313133e-7,"about_ca_topic_score_gemma":0.0000026403218,"teacher_disagreement_score":0.111644745,"about_ca_system_score_codex":0.000008420473,"about_ca_system_score_gemma":0.000011455218,"threshold_uncertainty_score":0.20783305},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05062711,0.00008543283,0.9201439,0.0016023306,0.00013255801,0.00041817792,0.000010818424,0.00016966437,0.02681002],"genre_scores_gemma":[0.8987357,0.0000026650246,0.099287204,0.00036241714,0.00010306506,0.000098067794,0.0000070142232,0.0000196549,0.0013842161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986179,0.00017032509,0.000363283,0.0002638093,0.00035688974,0.00022782815],"domain_scores_gemma":[0.9987794,0.00027069988,0.00023659747,0.0006176209,0.000056507368,0.00003914476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054711045,0.00016635696,0.00024343548,0.00005889887,0.00014087168,0.00007689514,0.0007192228,0.0000598833,0.00033449734],"category_scores_gemma":[0.000041970936,0.00010435818,0.00012910574,0.0003290387,0.00006961901,0.00016381014,0.00010255025,0.00013423801,0.00022385348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006686248,0.00015439834,0.0000047765357,0.000028152615,0.000014256995,0.0000032015137,0.00038157898,0.00021707143,0.0028617594,0.99181485,0.0036619066,0.0008513676],"study_design_scores_gemma":[0.0004661628,0.00012826225,0.000084350686,0.00006305828,0.000014841905,0.000034554887,0.000036421396,0.05436635,0.051560078,0.8887564,0.0042375,0.0002520504],"about_ca_topic_score_codex":0.000027889966,"about_ca_topic_score_gemma":3.197068e-7,"teacher_disagreement_score":0.8481086,"about_ca_system_score_codex":0.000014688751,"about_ca_system_score_gemma":0.00003079659,"threshold_uncertainty_score":0.42556033},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10836574,0.00020034445,0.8880102,0.00064575224,0.00009775132,0.000028667104,0.0000070496026,0.000029615225,0.0026148641],"genre_scores_gemma":[0.99589443,0.00003066813,0.0035384512,0.00014516627,0.0000628059,0.0000020365887,0.000014020737,0.0000021139633,0.00031029893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892676,0.000088715075,0.0003107579,0.0001951881,0.00037209757,0.00010646785],"domain_scores_gemma":[0.99887264,0.00021881671,0.00033347393,0.00027319658,0.0002574046,0.000044444132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072666386,0.00007844612,0.0002393549,0.00048090718,0.00005929813,0.000022936223,0.00031649857,0.000039001003,0.00017132799],"category_scores_gemma":[0.000056967714,0.00006579606,0.00026520924,0.0016132543,0.00004348339,0.00034557018,0.00006306609,0.000043232434,0.000018335715],"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.000084810206,0.00040386812,0.034140117,0.000120158176,0.0029847475,0.0000013636685,0.00042064508,0.08064711,0.0023330834,0.7762065,0.0029517647,0.099705815],"study_design_scores_gemma":[0.000405731,0.00040445392,0.23381732,0.000034780525,0.0007593944,0.00000364426,0.000050084403,0.4914114,0.03071187,0.23447612,0.0074750492,0.00045014705],"about_ca_topic_score_codex":0.00004390244,"about_ca_topic_score_gemma":0.0000038001474,"teacher_disagreement_score":0.8875287,"about_ca_system_score_codex":0.0000022938777,"about_ca_system_score_gemma":0.000016658347,"threshold_uncertainty_score":0.26830855},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24790996,0.0011655685,0.7489525,0.0008449792,0.00003944675,0.0003395768,0.000015152213,0.00008679711,0.0006460075],"genre_scores_gemma":[0.9849497,0.00023834142,0.014586564,0.00009559352,0.00004368854,0.00001489493,0.000005212162,0.000002409764,0.00006358043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940854,0.000028084987,0.00020731846,0.00016286771,0.00010086293,0.00009234353],"domain_scores_gemma":[0.99952567,0.000053377204,0.00009971294,0.00021021486,0.000057358062,0.000053647105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013649091,0.00006571439,0.00011533963,0.000099999445,0.00006300332,0.000017355374,0.000238891,0.00004220256,0.000008138194],"category_scores_gemma":[0.000011756534,0.000057715508,0.00003970205,0.00049567956,0.000035810488,0.0002216284,0.00003899004,0.00005250378,0.000006270796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036177803,0.00009633595,0.00012412116,0.000024383899,0.000005663343,1.7335807e-7,0.00012312034,0.000007214849,0.013591,0.96833026,0.00003892195,0.017655175],"study_design_scores_gemma":[0.0011379303,0.00079437386,0.020655336,0.0000972315,0.00009297109,0.000027577249,0.00018306597,0.16838746,0.0712073,0.706304,0.03047755,0.00063518493],"about_ca_topic_score_codex":0.000005008091,"about_ca_topic_score_gemma":9.868319e-7,"teacher_disagreement_score":0.73703974,"about_ca_system_score_codex":0.0000023135285,"about_ca_system_score_gemma":0.000009997527,"threshold_uncertainty_score":0.23535702},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9113472,0.007511471,0.047383543,0.006527857,0.0005197479,0.0013423113,0.00033260463,0.00013950339,0.02489573],"genre_scores_gemma":[0.8434343,0.00013998596,0.1558243,0.000011731641,0.000035028916,0.0000069528146,4.7151138e-7,0.000014301668,0.00053294864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855393,0.00011642014,0.0006673923,0.00015424141,0.0003328629,0.00017516912],"domain_scores_gemma":[0.99828655,0.00037134846,0.000667088,0.0005200731,0.00009609673,0.00005887432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055246777,0.00014065093,0.00041135377,0.00008825165,0.00007427382,0.0000168975,0.0007090554,0.000066285684,0.00018161305],"category_scores_gemma":[0.00014573781,0.00009526845,0.00012826575,0.000147625,0.0003495035,0.000044009736,0.0002461754,0.00008074909,0.000008672818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008498863,0.0010734476,0.0001880631,0.0023823194,0.0001927613,0.0000064707087,0.030836485,0.000037448826,0.009282448,0.941516,0.002466868,0.011932688],"study_design_scores_gemma":[0.013070782,0.0024635822,0.000922347,0.005110018,0.00073764566,0.0003167803,0.08352126,0.104562946,0.23381715,0.53139937,0.021691507,0.0023866356],"about_ca_topic_score_codex":0.000006517467,"about_ca_topic_score_gemma":2.4216249e-7,"teacher_disagreement_score":0.41011667,"about_ca_system_score_codex":0.0000026110931,"about_ca_system_score_gemma":0.000014636132,"threshold_uncertainty_score":0.38849348},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06029487,0.0016168718,0.9267976,0.007319639,0.000107647,0.0013043038,0.000115441195,0.00037409598,0.0020694938],"genre_scores_gemma":[0.817367,0.0005341844,0.17759472,0.0021414994,0.000616366,0.000665718,0.000023907098,0.00003671429,0.0010199029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870473,0.000037234804,0.00025648516,0.00051578734,0.0002135352,0.00027219887],"domain_scores_gemma":[0.9989081,0.0001739866,0.00014695895,0.0003914957,0.00015397463,0.00022545597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018305867,0.00019641289,0.00019824183,0.00015129804,0.00036867172,0.00013422228,0.00067427073,0.00007141679,0.000025835436],"category_scores_gemma":[0.000045161018,0.00017595108,0.000055905817,0.0009566969,0.0000383769,0.00044945508,0.00026530132,0.00014100046,0.0004856757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010864499,0.00023466842,0.000044385175,0.000068406734,0.000053512482,0.000008724927,0.0036755668,0.00077267265,0.0010029208,0.9778097,0.00037801382,0.015940534],"study_design_scores_gemma":[0.0032885668,0.00090261793,0.0039965236,0.0004431886,0.00018545233,0.00014572944,0.00349231,0.029681588,0.08461434,0.6933593,0.17691098,0.0029794187],"about_ca_topic_score_codex":0.000009157645,"about_ca_topic_score_gemma":0.000006356592,"teacher_disagreement_score":0.7570721,"about_ca_system_score_codex":0.00002980194,"about_ca_system_score_gemma":0.000055537294,"threshold_uncertainty_score":0.71750766},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067829145,0.0000096298845,0.99189955,0.0008936729,0.00014173418,0.00016775473,0.0000018481325,0.000018897239,0.000084017556],"genre_scores_gemma":[0.9721097,2.8683706e-8,0.02742573,0.00022893501,0.00020514044,0.000012328619,3.167769e-7,0.000010069272,0.00000777161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993303,0.00003981704,0.00019698468,0.000092620816,0.00012828133,0.00021200151],"domain_scores_gemma":[0.9990557,0.00033781558,0.000092040806,0.00018333863,0.00009945887,0.00023164331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010177706,0.00010135723,0.00013886043,0.00006542151,0.00011278891,0.0001605476,0.00069221604,0.000046691708,0.000002010631],"category_scores_gemma":[0.000082633866,0.000058300848,0.0000737968,0.00007817922,0.000018329994,0.00013709933,0.0000072682806,0.00022356982,9.744607e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050535422,0.0000055170754,4.3493915e-7,0.00001765733,0.000012398953,0.0000019422794,0.00010474818,0.88194734,0.019343968,0.098289184,0.000074641495,0.00015163035],"study_design_scores_gemma":[0.0006298727,0.000057690504,6.992047e-7,0.00011286147,0.000009504435,0.000044598408,0.0000028514073,0.95172286,0.04610496,0.0011784519,0.000062868414,0.0000728023],"about_ca_topic_score_codex":0.000034059627,"about_ca_topic_score_gemma":0.0000026002476,"teacher_disagreement_score":0.9653268,"about_ca_system_score_codex":0.00012639424,"about_ca_system_score_gemma":0.0001880833,"threshold_uncertainty_score":0.23774394},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015843011,0.000029771509,0.9788018,0.003297671,0.0011435016,0.00018311632,0.0002688612,0.000013032196,0.00041922898],"genre_scores_gemma":[0.8902011,0.0000036929982,0.10899509,0.00022092299,0.0004788696,0.0000021132544,0.0000032502583,0.000009169267,0.00008581474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987159,0.000086901535,0.0005654758,0.00014270731,0.00029205342,0.00019700122],"domain_scores_gemma":[0.9971813,0.0017281534,0.00039079768,0.00029951098,0.00026342037,0.00013682504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009086873,0.00011319704,0.00028748825,0.000036725567,0.00010664973,0.0000787639,0.0007372296,0.00006336495,0.000010718241],"category_scores_gemma":[0.00079585426,0.000067668036,0.00010639611,0.00019698255,0.00009104277,0.00014171097,0.00008079705,0.0003685558,0.0000089754485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017313195,0.00009221001,0.000012123893,0.000021747002,0.000053476586,0.000015584194,0.0007736493,0.00039473842,0.0038788328,0.9257981,0.014231034,0.054555353],"study_design_scores_gemma":[0.0020368865,0.0013792114,0.001317116,0.00007675301,0.00008087927,0.000114669005,0.000095810705,0.013007197,0.017192882,0.939791,0.024590202,0.0003173601],"about_ca_topic_score_codex":0.000005122103,"about_ca_topic_score_gemma":0.0000029830303,"teacher_disagreement_score":0.87435806,"about_ca_system_score_codex":0.000010260672,"about_ca_system_score_gemma":0.00010962177,"threshold_uncertainty_score":0.27594224},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22122416,0.00032481406,0.7713694,0.006043769,0.0003685231,0.00021240127,3.0909442e-7,0.00002427995,0.00043235766],"genre_scores_gemma":[0.95347804,0.00004646808,0.046036277,0.00014924219,0.00022840041,0.000004620212,0.0000012354814,0.0000050912527,0.00005063236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988288,0.00024016334,0.0004346409,0.00011058767,0.00026416895,0.00012161104],"domain_scores_gemma":[0.99882936,0.00028620698,0.00045642725,0.000107250235,0.00025517397,0.00006556815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010360985,0.00009199101,0.00018487753,0.00015738954,0.00018032009,0.0003177527,0.00026592438,0.00003796407,0.000016512653],"category_scores_gemma":[0.000047696463,0.00006022201,0.00007305199,0.00022641334,0.00005166048,0.00097082567,0.00005783961,0.00015562003,0.000019199299],"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.000106525295,0.00009944732,0.000111910565,0.00008411652,0.00008149964,0.000015345593,0.0065087136,0.005641271,0.00259133,0.38088554,0.0015879528,0.60228634],"study_design_scores_gemma":[0.0024691299,0.00013984718,0.014186465,0.00012049399,0.000036243124,0.00057935494,0.00023671913,0.79754716,0.00093036046,0.18346877,0.00012427804,0.0001611535],"about_ca_topic_score_codex":0.000013814169,"about_ca_topic_score_gemma":2.2882026e-7,"teacher_disagreement_score":0.79190594,"about_ca_system_score_codex":0.000028370878,"about_ca_system_score_gemma":0.000030195042,"threshold_uncertainty_score":0.30640966},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10434593,0.000094445706,0.8906229,0.00027615193,0.001346469,0.0001184884,0.0000018446025,0.00013859049,0.0030551706],"genre_scores_gemma":[0.802304,0.000002966938,0.19720681,0.00010042031,0.00036000594,0.0000027053761,2.3181877e-7,0.000005660902,0.000017187233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975691,0.00014652812,0.000373012,0.00042974946,0.00069053256,0.0007910698],"domain_scores_gemma":[0.99828064,0.00023706438,0.00011719265,0.00087532814,0.000104336614,0.00038545794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027337442,0.00017783351,0.00026764636,0.00020468162,0.00024257235,0.0001640407,0.0026389076,0.000053607033,0.00017427551],"category_scores_gemma":[0.0000644047,0.00014440899,0.00010704509,0.0010173669,0.0021482904,0.0011981461,0.0010478343,0.00014984695,0.00013803055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000786108,0.00010316924,0.000080533755,0.0000074138134,0.0000038252756,0.0000020910427,0.00046430936,0.000015644055,0.0066522737,0.98175514,0.00003204127,0.010875672],"study_design_scores_gemma":[0.0007586907,0.0004575911,0.003036027,0.000052820134,0.000021111413,0.00022305656,0.00002071556,0.22252528,0.3506681,0.42101428,0.0004387709,0.00078354497],"about_ca_topic_score_codex":0.000002460363,"about_ca_topic_score_gemma":3.0879548e-8,"teacher_disagreement_score":0.69795805,"about_ca_system_score_codex":0.000036405072,"about_ca_system_score_gemma":0.000085171305,"threshold_uncertainty_score":0.7915465},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017631559,0.00005567494,0.9985715,0.00030456227,0.00006937525,0.00030185422,0.00001483446,0.00011519597,0.0003906485],"genre_scores_gemma":[0.69659144,0.0000127092035,0.3028853,0.00023718926,0.000037231803,0.00007771406,0.000030203377,0.0000055466603,0.00012267809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991833,0.00006669342,0.00019422895,0.00030923504,0.000094840674,0.00015167879],"domain_scores_gemma":[0.9992678,0.00017685146,0.0001108335,0.00019521207,0.00015936849,0.00008990087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012521658,0.000112015565,0.00018974303,0.00012546834,0.00018923767,0.000070308844,0.0001949597,0.00005904316,0.00004597505],"category_scores_gemma":[0.000102943275,0.00009411356,0.00009068406,0.000635071,0.000029847193,0.00041792085,0.000028913424,0.000045289165,0.0000032202558],"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.00011118641,0.0002851595,0.003950775,0.000015100978,0.0005125125,9.38932e-7,0.002929675,0.14982703,0.00011739366,0.80827135,0.00003465522,0.033944197],"study_design_scores_gemma":[0.00057042367,0.0000790306,0.0028228406,0.0000013555272,0.00011636928,6.3458975e-7,0.000016930908,0.9847857,0.000085482156,0.011270115,0.00012319715,0.00012796966],"about_ca_topic_score_codex":0.0000080844275,"about_ca_topic_score_gemma":5.4369417e-7,"teacher_disagreement_score":0.8349586,"about_ca_system_score_codex":0.000013322989,"about_ca_system_score_gemma":0.000014288992,"threshold_uncertainty_score":0.38378394},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9694115,0.00008154898,0.028667366,0.0005911318,0.000063357984,0.00042569893,0.000017007978,0.000045151577,0.0006972465],"genre_scores_gemma":[0.81571776,0.000040909752,0.18406494,0.00009100271,0.000030358373,0.0000155667,3.2543582e-7,0.000014295456,0.000024840718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980389,0.00005196352,0.0007807843,0.00049134553,0.00040381495,0.00023321],"domain_scores_gemma":[0.99694896,0.00039269598,0.0015160351,0.00068369403,0.00035694859,0.00010166571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020676742,0.00027368183,0.0011159228,0.000027692522,0.00007263349,0.000049122078,0.0021156243,0.000119992095,0.000006152848],"category_scores_gemma":[0.00047942027,0.00018511985,0.0005306565,0.00035369757,0.00172714,0.000081295446,0.0031643605,0.0004720437,6.2665765e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013267677,0.0020673904,0.009458163,0.03702928,0.0013518117,3.4130287e-7,0.04430459,0.00012737993,0.050077207,0.8333017,0.0023338748,0.019815536],"study_design_scores_gemma":[0.000513165,0.00031024253,0.0025040687,0.001560786,0.0002376765,0.000018038269,0.001993427,0.09233259,0.093161434,0.80668133,0.000055533525,0.00063171034],"about_ca_topic_score_codex":0.0000310691,"about_ca_topic_score_gemma":9.029284e-8,"teacher_disagreement_score":0.15539758,"about_ca_system_score_codex":0.000030608775,"about_ca_system_score_gemma":0.000071391005,"threshold_uncertainty_score":0.7548968},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3611862,0.0011646893,0.63472384,0.0016127755,0.0006398071,0.00015022939,0.000003788066,0.000021092428,0.00049753324],"genre_scores_gemma":[0.7051861,0.000058673668,0.2936188,0.0004741432,0.00036144519,0.0000016504277,5.1992356e-7,0.000014934559,0.00028371866],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987156,0.00020797052,0.00033653792,0.00017061259,0.00032416495,0.00024512014],"domain_scores_gemma":[0.9986832,0.0002934203,0.0002923126,0.00043314626,0.00020146756,0.00009642334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001058407,0.00015065505,0.0002235738,0.000050322316,0.00025626383,0.00025131632,0.0011781163,0.00007814143,0.000053872747],"category_scores_gemma":[0.00010311532,0.0000895321,0.00024864508,0.00020997952,0.000050882383,0.00019388672,0.0000581944,0.00024617332,0.0000024845704],"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.00048997905,0.000070856164,0.0000025807474,0.000029314844,0.00030233822,0.00022303124,0.0006061255,0.0009938794,0.26458132,0.19172968,0.0018610123,0.5391099],"study_design_scores_gemma":[0.000536348,0.00023693091,0.000027403947,0.000020560181,0.000053902786,0.0007312864,0.000024421684,0.003393559,0.47625563,0.50196,0.016582478,0.00017753677],"about_ca_topic_score_codex":9.996546e-7,"about_ca_topic_score_gemma":4.718109e-7,"teacher_disagreement_score":0.5389323,"about_ca_system_score_codex":0.00002486606,"about_ca_system_score_gemma":0.00008364154,"threshold_uncertainty_score":0.3651013},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014904027,0.0000060605175,0.9832189,0.0002905343,0.000058625963,0.00075809937,0.0000021537492,0.00018419373,0.0005773987],"genre_scores_gemma":[0.6960376,2.2992643e-7,0.30288184,0.00015177911,0.00009866634,0.00021545701,0.0000063420425,0.0000047322546,0.0006033764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993705,0.00002176325,0.00012639546,0.00023309563,0.00009737956,0.00015083469],"domain_scores_gemma":[0.9990951,0.00016670537,0.00003375062,0.00048278406,0.0001425765,0.00007908164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016988734,0.000065842265,0.00006051437,0.000040699022,0.00015009895,0.000096113756,0.0004444318,0.000035228208,0.00007824892],"category_scores_gemma":[0.000017008097,0.00005252456,0.00003630811,0.00013933214,0.000017383129,0.0002829197,0.000056955352,0.000036246158,0.00021368488],"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.0000033434135,0.00019754173,0.0000297982,0.000014984316,0.0000048147435,1.2677037e-7,0.0002724667,0.7370971,0.00084846833,0.22496076,0.00023762535,0.03633297],"study_design_scores_gemma":[0.00016637145,0.000036572354,0.00013294056,0.0000015081226,0.0000015679993,2.6464977e-7,0.00001960376,0.9843824,0.0009664689,0.009385208,0.0048260293,0.00008109501],"about_ca_topic_score_codex":0.000013101257,"about_ca_topic_score_gemma":0.0000010700712,"teacher_disagreement_score":0.68113357,"about_ca_system_score_codex":0.000010437157,"about_ca_system_score_gemma":0.000013820661,"threshold_uncertainty_score":0.2746558},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52723897,0.0007997173,0.43060023,0.021960553,0.005508454,0.00664621,0.000037213184,0.0005748929,0.0066337823],"genre_scores_gemma":[0.9972725,7.2388275e-7,0.000086452375,0.0016386285,0.00020214515,0.00020156534,7.8764316e-7,0.000014330663,0.0005828713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770975,0.0006472229,0.00048613662,0.0003474727,0.0004418478,0.000367543],"domain_scores_gemma":[0.99770784,0.00077157246,0.00031302872,0.0010237633,0.0000918198,0.0000920007],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010475116,0.00021136852,0.00042220057,0.00009024494,0.00011053479,0.00030084397,0.0011522607,0.000065990665,0.00006276368],"category_scores_gemma":[0.00004636893,0.00012956139,0.00012735989,0.00020747025,0.00006320587,0.00022457492,0.00006809449,0.00016603484,0.0013231343],"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.000019433603,0.000059090533,0.00006544621,0.00014780252,0.000208695,0.00002087747,0.00031726374,0.0046512773,0.18885604,0.79125047,0.014082769,0.00032081286],"study_design_scores_gemma":[0.0030143675,0.00032985097,0.00034456595,0.00065242354,0.00004751796,0.00009288177,0.00017100792,0.98598397,0.0018127966,0.0025182785,0.004301417,0.000730941],"about_ca_topic_score_codex":0.00033503567,"about_ca_topic_score_gemma":1.6637226e-7,"teacher_disagreement_score":0.98133266,"about_ca_system_score_codex":0.000035733647,"about_ca_system_score_gemma":0.000024374678,"threshold_uncertainty_score":0.99945444},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32998708,0.0045682183,0.62359047,0.007053789,0.000058214333,0.0010714463,0.00005499663,0.0006106864,0.033005115],"genre_scores_gemma":[0.9734997,0.0020429855,0.02167084,0.0008151406,0.00015492093,0.00013517919,0.000022121749,0.000011821084,0.0016472939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994888,0.000021111517,0.00012845678,0.00017505013,0.00006237449,0.0001242431],"domain_scores_gemma":[0.99961984,0.000054534004,0.000016135054,0.00019354155,0.000022426384,0.0000935471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008802877,0.00007849304,0.00007618649,0.000048200738,0.00031473878,0.000060374015,0.00019020699,0.000035606594,0.00007612478],"category_scores_gemma":[0.000002586934,0.00007235231,0.000017300059,0.0002733276,0.000032828735,0.00036383118,0.00002804802,0.00008345178,0.00008940379],"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.0000010932832,0.000029143814,0.00000880206,0.000016975046,0.0000068822355,4.364739e-7,0.00055925315,0.000021385427,0.00019430752,0.7361713,0.000036838388,0.2629536],"study_design_scores_gemma":[0.0007939532,0.00008260389,0.001621885,0.0000283838,0.000042026026,0.00016329915,0.00016416532,0.27724734,0.0023082632,0.13944545,0.5775103,0.0005923366],"about_ca_topic_score_codex":0.0000037324924,"about_ca_topic_score_gemma":9.825818e-7,"teacher_disagreement_score":0.6435126,"about_ca_system_score_codex":0.0000028753293,"about_ca_system_score_gemma":0.000014298594,"threshold_uncertainty_score":0.29504418},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18572952,0.0015039879,0.7981504,0.0034010545,0.00007693751,0.00068670476,0.00002936977,0.00022374194,0.010198275],"genre_scores_gemma":[0.9409654,0.00007828721,0.05647507,0.00025246863,0.00027435485,0.00007320094,0.0000055686533,0.0000067249503,0.0018689288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99942446,0.000014722887,0.00016433312,0.0001912302,0.00008869792,0.00011655919],"domain_scores_gemma":[0.9994815,0.000053084743,0.000056899564,0.00028971513,0.00004785992,0.00007092249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011193283,0.000069224596,0.00009185272,0.000042344327,0.00008488,0.000021097738,0.00032817296,0.000035463494,0.000034971214],"category_scores_gemma":[0.000008736775,0.00006139228,0.000029960594,0.0001996898,0.000030429968,0.00016855935,0.00010955762,0.000058544323,0.00009666799],"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.0000012197833,0.000049865415,0.000036089037,0.000014993262,0.0000065107915,1.6848875e-7,0.00017764725,0.000014907095,0.0019446434,0.94135904,0.00008419569,0.056310743],"study_design_scores_gemma":[0.000695113,0.00010400425,0.001771397,0.000020334122,0.000028189645,0.0000324717,0.00004462097,0.20198327,0.09772744,0.03111219,0.66603243,0.00044854596],"about_ca_topic_score_codex":0.0000018266869,"about_ca_topic_score_gemma":0.0000014542057,"teacher_disagreement_score":0.91024685,"about_ca_system_score_codex":0.000004135034,"about_ca_system_score_gemma":0.00002002576,"threshold_uncertainty_score":0.25035045},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022239059,0.00023875762,0.99455273,0.00060949643,0.00004390773,0.00045454595,0.000027491598,0.00010938381,0.0017397699],"genre_scores_gemma":[0.82127345,0.000035895937,0.17473468,0.0012094175,0.00016457337,0.0010221319,0.00005500877,0.000017571518,0.0014872967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993939,0.0000251167,0.0001242619,0.0002406951,0.00006393753,0.00015209912],"domain_scores_gemma":[0.9994139,0.00016657067,0.000046611178,0.00023561562,0.000058356174,0.00007894492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017027948,0.000082410574,0.00008301722,0.000057899033,0.00031833138,0.000064057924,0.00019186556,0.00003806261,0.000023323935],"category_scores_gemma":[0.000030198295,0.000078375204,0.000043995646,0.00024438967,0.000028209653,0.00012731491,0.000018325938,0.000052697345,0.000019295467],"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":[9.2769756e-7,0.00003235627,0.000015753145,0.000014657155,0.000005108106,1.3916178e-7,0.0000305377,0.000020907424,0.0002680223,0.99508226,0.00010666281,0.004422646],"study_design_scores_gemma":[0.001342902,0.00012995729,0.00027292792,0.000023193435,0.000031788717,0.000015876867,0.00004387398,0.35255796,0.027789004,0.20818818,0.4090634,0.0005409491],"about_ca_topic_score_codex":4.6995078e-7,"about_ca_topic_score_gemma":4.7919553e-7,"teacher_disagreement_score":0.8198181,"about_ca_system_score_codex":0.000004470064,"about_ca_system_score_gemma":0.000032245105,"threshold_uncertainty_score":0.3196048},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47011846,0.00024357982,0.52204853,0.00010248709,0.000357832,0.0003443998,0.00003681445,0.0003446085,0.006403278],"genre_scores_gemma":[0.81547785,0.000014641996,0.18371361,0.000047826863,0.00021230012,0.0000032863425,0.000022145763,0.000013760195,0.0004945453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988565,0.00008254405,0.0002688197,0.00037010617,0.00018208653,0.0002399729],"domain_scores_gemma":[0.9991359,0.000093114235,0.00009425543,0.00050636043,0.00007864381,0.00009169595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039955563,0.00016069322,0.00021576807,0.00008657819,0.0001127396,0.00005425241,0.00043600312,0.00009247261,0.000052237312],"category_scores_gemma":[0.00002498198,0.00013389967,0.000059620015,0.00021872179,0.00010078665,0.0004238655,0.00014218765,0.00012154728,0.000025361116],"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.00016901361,0.0011640177,0.0017830217,0.00019239435,0.000042696414,0.000036539146,0.00094547175,0.001465551,0.07810007,0.86875224,0.00040243578,0.04694656],"study_design_scores_gemma":[0.0010808988,0.00015094936,0.0008196786,0.000023435166,0.000011654956,0.000015076889,0.000060376184,0.8526248,0.12487765,0.01667583,0.0034129068,0.0002467983],"about_ca_topic_score_codex":0.00012006526,"about_ca_topic_score_gemma":0.000002237352,"teacher_disagreement_score":0.8520764,"about_ca_system_score_codex":0.0000075520306,"about_ca_system_score_gemma":0.000024234356,"threshold_uncertainty_score":0.54602695},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28703424,0.0012186227,0.6948407,0.012597496,0.00008282567,0.00093831436,0.000056483263,0.00022863944,0.0030026583],"genre_scores_gemma":[0.97056144,0.00012049307,0.02798217,0.0007202945,0.00017172532,0.000034511027,0.000008759208,0.0000057489547,0.0003948326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992701,0.000032047243,0.00019861244,0.0002442011,0.00010732222,0.0001477418],"domain_scores_gemma":[0.999347,0.00012286533,0.000071090835,0.00030638184,0.000044737695,0.00010795145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017704017,0.00010138353,0.00014076021,0.000090140515,0.0001317248,0.00003822611,0.00036689496,0.000040677558,0.000022861008],"category_scores_gemma":[0.000017341628,0.00008078658,0.000039550894,0.00035037394,0.000017830675,0.00016052963,0.0000977653,0.00007543795,0.000043382068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000080039135,0.00011141248,0.00003105825,0.00001196295,0.0000075556304,4.2272043e-7,0.00061781565,0.000028843195,0.004062684,0.9420797,0.00021011269,0.05283041],"study_design_scores_gemma":[0.00062318076,0.0005082943,0.006531584,0.000041525476,0.000025682288,0.000022255452,0.00012135393,0.03299554,0.09880973,0.7701559,0.089626126,0.00053882424],"about_ca_topic_score_codex":0.000004623098,"about_ca_topic_score_gemma":0.0000018242779,"teacher_disagreement_score":0.68352723,"about_ca_system_score_codex":0.000005774913,"about_ca_system_score_gemma":0.00002444892,"threshold_uncertainty_score":0.32943812},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028155902,0.0013266343,0.9647327,0.0016979701,0.0001221067,0.0011109598,0.00003779744,0.00047451656,0.0023414362],"genre_scores_gemma":[0.77069545,0.00034735556,0.22445554,0.00051693525,0.0009343958,0.0009841394,0.000054184016,0.000057593003,0.0019543886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983655,0.00007395278,0.0003214296,0.00075708,0.00021303595,0.0002689593],"domain_scores_gemma":[0.9982502,0.00025213364,0.00026716222,0.0009274247,0.00013347412,0.00016959105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026389174,0.00028588247,0.00031346685,0.00012659456,0.00029305127,0.00025564662,0.0007920837,0.0001938201,0.000017411596],"category_scores_gemma":[0.00002990098,0.0002433116,0.00007517676,0.00028534367,0.000044259566,0.00015928624,0.0007787287,0.00053734117,0.00009672543],"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.000029517167,0.00038091163,0.0001848582,0.0009021303,0.00026204975,0.000017278539,0.0013617885,0.002413269,0.0011638262,0.8563943,0.0006963132,0.13619374],"study_design_scores_gemma":[0.0012739208,0.0002156756,0.0006592971,0.0004746576,0.00027699894,0.0003263568,0.0001303246,0.68714494,0.007715823,0.08763224,0.21192439,0.00222538],"about_ca_topic_score_codex":0.000012476398,"about_ca_topic_score_gemma":0.000004245656,"teacher_disagreement_score":0.76876205,"about_ca_system_score_codex":0.000015811253,"about_ca_system_score_gemma":0.00010676675,"threshold_uncertainty_score":0.99219596},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08532099,0.00021379768,0.88811946,0.02334721,0.0005279365,0.00013344291,6.294587e-7,0.000052725645,0.00228384],"genre_scores_gemma":[0.7627657,0.00004649193,0.23291773,0.002710013,0.00053164875,8.004177e-7,5.4499264e-8,0.000009983113,0.0010175502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983789,0.000098379525,0.00053930783,0.000121405326,0.0006044222,0.00025762338],"domain_scores_gemma":[0.99884444,0.0002603093,0.00023403682,0.00042423,0.0000965675,0.00014040539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012773606,0.00012654389,0.00027944846,0.000017287803,0.00015003068,0.00017048116,0.0015589634,0.00007720016,0.000099435885],"category_scores_gemma":[0.0002295429,0.00006898687,0.00074281695,0.0002817113,0.00008352633,0.00036104958,0.00014100404,0.0004414836,0.00004828146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008513253,0.00035776166,0.000032780703,0.000029677218,0.000055589426,0.000020183745,0.0012023385,0.000026700774,0.0024837437,0.98196214,0.008559769,0.005260801],"study_design_scores_gemma":[0.00045028017,0.00014615557,0.0006521236,0.00007593166,0.000034085384,0.0006511388,0.00006124297,0.015378543,0.0041349526,0.9773001,0.000985907,0.00012954688],"about_ca_topic_score_codex":1.3640866e-7,"about_ca_topic_score_gemma":2.3547214e-8,"teacher_disagreement_score":0.67744476,"about_ca_system_score_codex":0.000050428793,"about_ca_system_score_gemma":0.000052366635,"threshold_uncertainty_score":0.28969678},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023384256,0.00017559952,0.9736718,0.002506612,0.0000040269174,0.000109643566,0.000011252724,0.0000067539177,0.00013005754],"genre_scores_gemma":[0.1564018,0.00009096323,0.8428727,0.00025227352,0.0002155736,0.000019610532,0.0000023288537,0.0000047607496,0.00014000047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933505,0.0000263134,0.00032289844,0.00011568763,0.00011436413,0.00008570521],"domain_scores_gemma":[0.9992184,0.00025607806,0.00015078923,0.00013143064,0.00013351528,0.00010978392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050041213,0.00006960049,0.00024285873,0.00012148925,0.00012418645,0.0001023674,0.00018517277,0.000026966432,0.000018608685],"category_scores_gemma":[0.00003606109,0.00004787446,0.00012521016,0.00030323525,0.0000434244,0.00018491174,0.00004688325,0.000059605674,0.000004172227],"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.000007847447,0.0003052333,0.000069008456,0.0000309899,0.0005588504,0.0000010511554,0.0004963415,0.000081551305,0.0003074573,0.9170174,0.000097162556,0.081027135],"study_design_scores_gemma":[0.0007154349,0.0001880579,0.0008101797,0.000041037263,0.0012749552,0.00011359572,0.00018764909,0.5806118,0.0048635667,0.40374535,0.0071619344,0.00028643495],"about_ca_topic_score_codex":2.9096805e-7,"about_ca_topic_score_gemma":5.337873e-7,"teacher_disagreement_score":0.5805302,"about_ca_system_score_codex":0.0000072268003,"about_ca_system_score_gemma":0.000013743618,"threshold_uncertainty_score":0.19522637},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15200667,0.00064681075,0.8448403,0.002023508,0.00022365022,0.00018550802,0.0000033049253,0.00003065989,0.000039578365],"genre_scores_gemma":[0.63885885,0.000016472963,0.3605811,0.00025136478,0.00027283843,0.00000157335,6.150363e-7,0.0000098528835,0.000007313548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985671,0.0003592303,0.0004256705,0.0001585648,0.00019667223,0.00029278282],"domain_scores_gemma":[0.99820536,0.0011282339,0.00021287594,0.00024346802,0.00010657321,0.00010347781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032499975,0.00016486687,0.00027613106,0.000103296974,0.0003586075,0.0001221892,0.00081066694,0.00004488501,0.0000020431053],"category_scores_gemma":[0.00018964244,0.00009820315,0.000120691926,0.0001778625,0.00009178643,0.00015988508,0.00016314835,0.0003312414,0.0000011875329],"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.0001814655,0.00017703274,0.00004981794,0.0001348851,0.00014671878,0.000019489471,0.012189835,0.51746225,0.0064390493,0.03881421,0.000093815564,0.42429143],"study_design_scores_gemma":[0.0070941593,0.0032305708,0.0028738512,0.0013338069,0.00017285603,0.0039660614,0.0019584908,0.22036758,0.031710595,0.7238664,0.0023892745,0.0010363304],"about_ca_topic_score_codex":0.000011205727,"about_ca_topic_score_gemma":0.0000010166779,"teacher_disagreement_score":0.6850522,"about_ca_system_score_codex":0.000031592655,"about_ca_system_score_gemma":0.000054249784,"threshold_uncertainty_score":0.4004608},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023773955,0.0010449558,0.9633071,0.0034629332,0.000059011254,0.0003990558,0.000019164725,0.00021686587,0.007716986],"genre_scores_gemma":[0.9292572,0.00022022508,0.06805114,0.0009874377,0.00031884128,0.0001448536,0.000016021835,0.000012928934,0.0009913143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940175,0.0000129473565,0.00011988976,0.00024155929,0.00008929372,0.00013455712],"domain_scores_gemma":[0.99955344,0.000043897482,0.00004193418,0.00022416638,0.00005493466,0.000081645965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008105972,0.00008421144,0.00007834921,0.000051059982,0.00019061705,0.000077208555,0.0003033162,0.00003941063,0.0000136722265],"category_scores_gemma":[0.000007135664,0.00007327877,0.00002679533,0.0003295965,0.000025457855,0.00027169508,0.000117678,0.00007672677,0.00019880352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.358309e-7,0.00004081495,0.000002702571,0.0000057248867,0.00000638929,0.0000012120113,0.00018408331,0.000036042322,0.00053174945,0.98837435,0.0000236465,0.010792336],"study_design_scores_gemma":[0.0014907749,0.0002521761,0.002248007,0.00005507936,0.000048139264,0.00017028279,0.00012800722,0.021184035,0.039787572,0.8568966,0.07679793,0.0009414201],"about_ca_topic_score_codex":0.0000052722085,"about_ca_topic_score_gemma":8.302786e-7,"teacher_disagreement_score":0.9054833,"about_ca_system_score_codex":0.000009027397,"about_ca_system_score_gemma":0.000030507741,"threshold_uncertainty_score":0.29882213},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011572199,0.000057474266,0.9869641,0.00037575306,0.00012253557,0.00038288985,0.000007015451,0.00001557295,0.00050246716],"genre_scores_gemma":[0.52298063,0.000008934071,0.4767496,0.000034509503,0.0000113264705,0.000019763978,0.000002098569,0.0000069230186,0.00018618951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999107,0.0000488386,0.00037344234,0.00012162316,0.0002321535,0.000116956646],"domain_scores_gemma":[0.99840957,0.0007492416,0.0003675167,0.0002458379,0.0002036751,0.000024188323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009175867,0.00008821688,0.00017433325,0.00008128435,0.00007805659,0.000037157562,0.00030816242,0.000046117693,0.000010856673],"category_scores_gemma":[0.00015067667,0.00006389974,0.00008287628,0.00023360045,0.00004369175,0.00020416935,0.000036866226,0.000049158647,0.000004613274],"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.000008310205,0.00017517166,0.0000054211982,0.00039506413,0.000031022937,3.6203446e-7,0.0048169154,0.004641555,0.0014319131,0.9815949,0.00060651975,0.006292818],"study_design_scores_gemma":[0.0003406847,0.0000748229,0.00003491381,0.000042688192,0.000022017199,0.0000040822983,0.00023468997,0.6558523,0.029875148,0.31313527,0.0003140141,0.00006936341],"about_ca_topic_score_codex":0.000003063501,"about_ca_topic_score_gemma":0.000001540345,"teacher_disagreement_score":0.66845965,"about_ca_system_score_codex":0.000013642409,"about_ca_system_score_gemma":0.000054878106,"threshold_uncertainty_score":0.26057556},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036458652,0.0004677551,0.9908576,0.0027722004,0.00002061876,0.0011858004,0.00005304203,0.00023491254,0.000762176],"genre_scores_gemma":[0.44622624,0.0006271984,0.52501327,0.01009758,0.0013189578,0.006358756,0.00023478318,0.00006321487,0.010059999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914557,0.000022379725,0.00017601295,0.00034324775,0.00011724586,0.00019556614],"domain_scores_gemma":[0.999178,0.00016918665,0.00007500385,0.00039952385,0.00007517006,0.00010309569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012247701,0.00013645485,0.00014261754,0.00007982084,0.00033791875,0.00009557294,0.00035480858,0.00004965283,0.00000965868],"category_scores_gemma":[0.000009022561,0.00011034103,0.000042305914,0.00025271965,0.000036680118,0.00025780645,0.00003366048,0.00007097131,0.000041885985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009003955,0.000067950205,6.623805e-7,0.000017504295,0.000008596318,1.4382512e-7,0.00009061733,0.00005501303,0.0003000018,0.98969066,0.00026623136,0.009493635],"study_design_scores_gemma":[0.0007515249,0.000274809,0.000025966963,0.000012241574,0.000029437177,0.000009005089,0.000052559884,0.028125225,0.004291004,0.8516011,0.11451471,0.0003123904],"about_ca_topic_score_codex":0.0000014460068,"about_ca_topic_score_gemma":4.5408257e-7,"teacher_disagreement_score":0.46584436,"about_ca_system_score_codex":0.000009723818,"about_ca_system_score_gemma":0.00003511449,"threshold_uncertainty_score":0.44995767},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2576059,0.0002514678,0.7242451,0.00021412747,0.000074303185,0.0005038848,0.000018162827,0.00011060235,0.016976494],"genre_scores_gemma":[0.9423067,0.00053339254,0.056298878,0.000070570095,0.00026597906,0.00003893783,0.0000067540805,0.000010454833,0.00046834003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907726,0.000017583548,0.00026521788,0.00028561678,0.00015160763,0.0002027042],"domain_scores_gemma":[0.99909383,0.00027293185,0.00012831588,0.0002963882,0.00010381961,0.00010469584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036170974,0.000116873525,0.00015740035,0.00010100102,0.00020084639,0.000038238544,0.00040534805,0.00006279927,0.0000115795265],"category_scores_gemma":[0.0000142631,0.00010184028,0.000047722504,0.0004483614,0.000058084723,0.00023890773,0.00013689922,0.00009744001,0.000034763805],"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.000019285391,0.00021195174,0.00045747563,0.0001213944,0.000056631994,0.0000041215476,0.004529462,0.000036311183,0.017079936,0.8798915,0.000139604,0.097452335],"study_design_scores_gemma":[0.0021681257,0.00061975844,0.049813814,0.00016703173,0.00015170572,0.00006342066,0.0018153153,0.44201508,0.36877868,0.12134905,0.011404766,0.001653248],"about_ca_topic_score_codex":0.00006249165,"about_ca_topic_score_gemma":0.0000056093063,"teacher_disagreement_score":0.7585424,"about_ca_system_score_codex":0.000009858363,"about_ca_system_score_gemma":0.000034553974,"threshold_uncertainty_score":0.41529262},"labels":[],"label_agreement":null},{"id":"W2004529037","doi":"10.1137/s0895479803428230","title":"Block Diagonal and Schur Complement Preconditioners for Block-Toeplitz Systems with Small Size Blocks","year":2007,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Toeplitz matrix; Mathematics; Schur complement; Block matrix; Block (permutation group theory); Levinson recursion; Hermitian matrix; Combinatorics; Eigenvalues and eigenvectors; Pure mathematics","score_opus":0.012849499640514168,"score_gpt":0.2684716224729193,"score_spread":0.2556221228324051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004529037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035147026,0.00057774753,0.9623553,0.00080374366,0.00004295777,0.00057713356,0.000069635586,0.000048379385,0.00037803702],"genre_scores_gemma":[0.9483733,0.00016023125,0.049856503,0.00020264169,0.00041187467,0.00015857263,0.000020377322,0.000015117514,0.0008013929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984521,0.00005265496,0.00048943836,0.00040843047,0.0002598887,0.0003374544],"domain_scores_gemma":[0.99828357,0.0005528121,0.000347105,0.00033825007,0.00017275919,0.00030552744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012608474,0.00019774235,0.00033941268,0.00033192703,0.00073617266,0.00045503862,0.00033849705,0.000055413875,0.000017367067],"category_scores_gemma":[0.000013981257,0.00015011837,0.00014814387,0.00077390875,0.00007203174,0.0001318132,0.000058443835,0.00019701182,0.0000033173255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022454468,0.0010142105,0.007017212,0.00023049663,0.0047950884,0.000040434657,0.0006409839,0.024279954,0.0011188552,0.89884496,0.0012688441,0.060524397],"study_design_scores_gemma":[0.012336245,0.0033828248,0.038195208,0.0004044612,0.008286498,0.0032031122,0.00338805,0.26214653,0.0027088195,0.07410045,0.5877017,0.004146136],"about_ca_topic_score_codex":0.00000947766,"about_ca_topic_score_gemma":0.000017048922,"teacher_disagreement_score":0.91322625,"about_ca_system_score_codex":0.000036652054,"about_ca_system_score_gemma":0.00004320411,"threshold_uncertainty_score":0.612165},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030761832,0.00006906011,0.96043515,0.0005941591,0.00061986235,0.0001793889,0.0000040668365,0.00007527991,0.007261218],"genre_scores_gemma":[0.76495403,0.000026761609,0.23460947,0.00006298002,0.00011626463,0.000010926938,0.000007553387,0.000006315997,0.00020567038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992525,0.00009044958,0.00016906454,0.00017462714,0.00017125579,0.0001420883],"domain_scores_gemma":[0.9993524,0.00014526543,0.000110236644,0.00031703702,0.000047373047,0.000027687718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000506808,0.00007990106,0.00009048362,0.00018026281,0.00008200693,0.00008933151,0.0004757061,0.000029622122,0.000047876998],"category_scores_gemma":[0.000037172806,0.0000592693,0.000034884157,0.0014222127,0.000023418059,0.00035406218,0.000047032903,0.00015339104,0.000013547038],"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.000011315465,0.00047096764,0.0016466305,0.00002696851,0.000020329688,0.000008917248,0.0013784259,0.3527273,0.002209832,0.6321578,0.0015391366,0.007802364],"study_design_scores_gemma":[0.0004957385,0.00006035315,0.00019167767,0.0000053835734,0.000011857428,0.000020843125,0.00006112373,0.9932483,0.0019241138,0.003126445,0.0007349718,0.000119208664],"about_ca_topic_score_codex":0.00006149857,"about_ca_topic_score_gemma":0.000017701721,"teacher_disagreement_score":0.7341922,"about_ca_system_score_codex":0.000012125376,"about_ca_system_score_gemma":0.000032601663,"threshold_uncertainty_score":0.24169318},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015526736,0.0008876421,0.97466755,0.0005958962,0.00008132255,0.00038401148,0.000016742719,0.00020296962,0.0076371096],"genre_scores_gemma":[0.91412497,0.001051795,0.07802859,0.00096404157,0.00030160043,0.0003922919,0.000052310967,0.00002718821,0.005057222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993428,0.00003556806,0.00015464939,0.00023195126,0.00008403841,0.00015097162],"domain_scores_gemma":[0.9994747,0.00006824965,0.00005568964,0.00025771497,0.00004914861,0.00009446857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014021319,0.000091436596,0.00008654514,0.00006367808,0.00025153474,0.00009895418,0.00024767272,0.000039998584,0.00005873138],"category_scores_gemma":[0.000018858023,0.000081827806,0.0000248124,0.00038623143,0.00001917196,0.00034411548,0.000051654137,0.00006908815,0.00017254658],"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":[4.729739e-7,0.000033545395,0.00010187049,0.000010869495,0.000005506051,4.637439e-7,0.0000693002,0.000004429091,0.000536036,0.9913458,0.000057076184,0.007834587],"study_design_scores_gemma":[0.00054972706,0.000058241345,0.0015140712,0.000013933348,0.00002604933,0.00010151342,0.000039965125,0.033510376,0.011326299,0.092176795,0.86016774,0.00051529764],"about_ca_topic_score_codex":7.7619796e-7,"about_ca_topic_score_gemma":2.7936719e-7,"teacher_disagreement_score":0.899169,"about_ca_system_score_codex":0.0000040311957,"about_ca_system_score_gemma":0.000024794388,"threshold_uncertainty_score":0.3336841},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021502212,0.000016482778,0.9773075,0.000029130948,0.0006555838,0.000142276,0.000006159235,0.0000598067,0.00028085618],"genre_scores_gemma":[0.96040845,0.000037852904,0.039376415,0.000044312357,0.00007561851,0.000005094179,0.0000066754533,0.0000070136484,0.000038543832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992847,0.000037222824,0.00019711768,0.00019930772,0.00010840981,0.0001732524],"domain_scores_gemma":[0.99953216,0.000027976701,0.00011297771,0.00023652031,0.000032474494,0.00005786456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036045426,0.00009557861,0.0001846459,0.00004013942,0.000050793144,0.00007411001,0.00022030629,0.00005901468,0.000038299964],"category_scores_gemma":[0.00001712186,0.00008314697,0.000014226036,0.000101709804,0.000007042541,0.00008873211,0.00012710705,0.000025208152,0.000010289672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000991489,0.000011404897,1.4460284e-7,0.000024399073,0.000003911162,1.7550981e-7,0.00006320609,0.0000011867157,0.2684275,0.7282914,0.000010144503,0.003156665],"study_design_scores_gemma":[0.00026269155,0.00006577053,0.000024732923,0.00000823919,0.000007136445,0.000002652464,0.000010758461,0.001224616,0.39175734,0.6052814,0.0012439489,0.00011067019],"about_ca_topic_score_codex":0.000003932539,"about_ca_topic_score_gemma":1.7460609e-7,"teacher_disagreement_score":0.93890625,"about_ca_system_score_codex":0.0000051061534,"about_ca_system_score_gemma":0.00001548943,"threshold_uncertainty_score":0.33906353},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023208188,0.00004767477,0.973978,0.0003104564,0.000005522033,0.00004131811,0.0000015369395,0.000004804415,0.0024025121],"genre_scores_gemma":[0.9358331,0.00001486077,0.06393944,0.00005279232,0.000046482357,0.0000019353838,2.6820868e-7,0.0000019509662,0.000109165565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914587,0.000020285554,0.00046634098,0.00008053982,0.00020876751,0.00007821867],"domain_scores_gemma":[0.9988252,0.00044956265,0.00029616122,0.00021900695,0.00012146176,0.000088595516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010552868,0.000051874482,0.00023930841,0.00022696305,0.000045215023,0.000024104216,0.00026334487,0.000025005344,0.000021852224],"category_scores_gemma":[0.000054072654,0.000034457436,0.00016069238,0.0007277703,0.000040675175,0.00006710909,0.00003345708,0.00008014513,0.0000055667897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005545439,0.00016706043,0.000024337323,0.000014180656,0.00013410457,0.00000201027,0.000113436516,0.000041179046,0.00035741794,0.9855787,0.000036825735,0.01352516],"study_design_scores_gemma":[0.00033255306,0.00016207229,0.0014022196,0.000035838013,0.0004910179,0.000047387435,0.00011028557,0.011892649,0.0060896478,0.97767377,0.0016420564,0.000120482735],"about_ca_topic_score_codex":5.4691196e-7,"about_ca_topic_score_gemma":5.0448995e-7,"teacher_disagreement_score":0.9126249,"about_ca_system_score_codex":0.000005983008,"about_ca_system_score_gemma":0.000010684289,"threshold_uncertainty_score":0.14051335},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.533087,0.0019353742,0.44704553,0.0021294535,0.0007947726,0.00020722685,0.000027273618,0.000021541808,0.014751797],"genre_scores_gemma":[0.7248725,0.000008239421,0.2747919,0.000067605404,0.00014324194,2.5075443e-7,1.2012838e-7,0.0000059025037,0.000110254565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990742,0.000036129873,0.00044556992,0.00007183063,0.00018606555,0.00018620666],"domain_scores_gemma":[0.9986671,0.00013431459,0.0004651318,0.00022411125,0.00020576046,0.00030357714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044544108,0.000096902644,0.0002315863,0.0002357098,0.00006688187,0.00007398341,0.0008265218,0.000041056297,0.00009917296],"category_scores_gemma":[0.0001416209,0.000076953555,0.000093812276,0.00022106162,0.00006598165,0.0003478636,0.000023202854,0.0001357967,0.000009535211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001914792,0.00003414283,0.00003334057,0.00009169336,0.00006412578,0.00007618018,0.0069718836,0.0010510943,0.00014983733,0.97126037,0.0012259139,0.0190395],"study_design_scores_gemma":[0.0009179831,0.00043809728,0.00055386976,0.00039675107,0.00007702924,0.0017866701,0.0019536254,0.030308189,0.02030841,0.9325606,0.010180892,0.00051784376],"about_ca_topic_score_codex":0.000076840675,"about_ca_topic_score_gemma":0.00078337046,"teacher_disagreement_score":0.19178548,"about_ca_system_score_codex":0.000048097896,"about_ca_system_score_gemma":0.00052142463,"threshold_uncertainty_score":0.3138075},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34396383,0.011393397,0.6380482,0.003375077,0.0001223208,0.0016747962,0.000157955,0.00025405065,0.0010104069],"genre_scores_gemma":[0.9424145,0.0010063483,0.05548746,0.000048984268,0.00007729125,0.00008179098,0.000013322754,0.0000146808825,0.00085561734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871343,0.00007050939,0.0004831098,0.0003503135,0.00020433955,0.00017829327],"domain_scores_gemma":[0.9988415,0.00013048758,0.00021690132,0.0004873483,0.00016682888,0.00015690431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029169832,0.00014910773,0.00026481153,0.0001589398,0.00019662254,0.000028949007,0.00042018775,0.00008350648,0.000034618526],"category_scores_gemma":[0.000037470603,0.00013692486,0.00006289782,0.0004990147,0.000096467134,0.00034649874,0.00016310292,0.000120684505,0.000018753286],"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.0000043658674,0.0006414168,0.00003876861,0.000093981515,0.000028103577,0.0000012809564,0.0006030779,0.000072798175,0.003094097,0.97046834,0.000051729974,0.024902027],"study_design_scores_gemma":[0.0020619545,0.00052891317,0.0012520328,0.000054470784,0.00009688531,0.00008454383,0.00016987792,0.8822525,0.011826792,0.08956696,0.011600244,0.0005048017],"about_ca_topic_score_codex":0.000011574136,"about_ca_topic_score_gemma":8.9071193e-7,"teacher_disagreement_score":0.88217974,"about_ca_system_score_codex":0.0000066791117,"about_ca_system_score_gemma":0.000018346609,"threshold_uncertainty_score":0.55836344},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15835683,0.000033241966,0.83855665,0.0000993593,0.00052807305,0.00015587984,0.000058512396,0.00015382597,0.0020576208],"genre_scores_gemma":[0.99667746,0.00016154307,0.0017534709,0.00002139476,0.00009169475,3.5080689e-7,0.0000138993555,0.000008901124,0.0012712796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988587,0.00012851109,0.00019699978,0.0005641955,0.00006755789,0.00018405539],"domain_scores_gemma":[0.9984177,0.00010870852,0.00033637005,0.00090565893,0.00014459781,0.000086998916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001928768,0.0001816587,0.00026723032,0.00024313125,0.00008457807,0.00004527092,0.0014906779,0.000152497,0.00006165578],"category_scores_gemma":[0.00001751724,0.00016886949,0.00015067303,0.0004303385,0.00009117369,0.00032848748,0.0012778178,0.0001827472,0.000081688515],"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.000012939027,0.000114656774,0.0012243445,0.00013389612,0.000059848677,0.00004580673,0.00013878373,0.0050606253,0.00067866873,0.9911674,0.00008727148,0.0012757054],"study_design_scores_gemma":[0.00089267467,0.0000969321,0.0034321202,0.0004566966,0.00010700862,0.000009057609,0.000044757664,0.62341875,0.004442543,0.36320636,0.0029660384,0.0009270879],"about_ca_topic_score_codex":0.0000133446665,"about_ca_topic_score_gemma":0.0000013585197,"teacher_disagreement_score":0.8383206,"about_ca_system_score_codex":0.000041866224,"about_ca_system_score_gemma":0.000107674285,"threshold_uncertainty_score":0.6886298},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8062096,0.0004361027,0.1848533,0.0014424318,0.0008026777,0.00056901644,0.000017275102,0.0007405353,0.004929055],"genre_scores_gemma":[0.8370458,0.0002640078,0.15463148,0.0017887492,0.0011872309,0.00002932634,0.000023358909,0.000068999645,0.0049610664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978455,0.0001565814,0.0004061806,0.0006937279,0.00031503526,0.00058303104],"domain_scores_gemma":[0.9985328,0.00022463223,0.00008383658,0.0007040883,0.00009496781,0.00035967474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045350078,0.00033006642,0.000357926,0.00014458736,0.00036360807,0.00015991484,0.00076775247,0.0001465529,0.00017557715],"category_scores_gemma":[0.00013893645,0.00027509948,0.00012737923,0.00047309883,0.00008068501,0.0005492798,0.0004028244,0.00040085785,0.00030098835],"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.002204412,0.0054584183,0.059054926,0.0005689723,0.000876723,0.0028234944,0.009889929,0.06708159,0.0064318324,0.25711042,0.008462628,0.58003664],"study_design_scores_gemma":[0.0010410298,0.00026174815,0.0008516654,0.000032867487,0.000012349243,0.0001088491,0.00004281567,0.9220238,0.0037068587,0.0003825207,0.07111245,0.0004230648],"about_ca_topic_score_codex":0.000051290794,"about_ca_topic_score_gemma":0.0000033364092,"teacher_disagreement_score":0.8549422,"about_ca_system_score_codex":0.000019310175,"about_ca_system_score_gemma":0.000053913518,"threshold_uncertainty_score":0.99997014},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056371544,0.000048382193,0.94242823,0.00014616484,0.0001002741,0.00014776445,0.000002505255,0.000097633616,0.00065749453],"genre_scores_gemma":[0.5004042,0.0000020907758,0.499214,0.00013481449,0.00018604333,0.000014066749,0.0000044392277,0.000007033517,0.000033324868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989141,0.00007265764,0.00023366396,0.00025723677,0.00017449998,0.0003477997],"domain_scores_gemma":[0.9993017,0.00022834935,0.00007425949,0.00019450941,0.000030107942,0.00017108221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003175947,0.0001754115,0.00019849699,0.000068691734,0.0002501934,0.00025495546,0.00020563879,0.000044696484,0.000039251838],"category_scores_gemma":[0.0000014646076,0.0001349625,0.000046208257,0.00010542844,0.000051703148,0.00080648105,0.00013961659,0.00012553515,0.000033984154],"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.00003211087,0.00029510108,0.000066885725,0.00011164403,0.00007074166,0.000008819114,0.008887528,0.07125843,0.000030836527,0.90960175,0.000087311906,0.00954883],"study_design_scores_gemma":[0.000364415,0.00009947577,0.000009166394,0.000095964366,0.000011013119,0.000049317987,0.00004174732,0.9400646,0.0003296854,0.0586022,0.00013210929,0.00020028181],"about_ca_topic_score_codex":9.252935e-7,"about_ca_topic_score_gemma":1.034862e-7,"teacher_disagreement_score":0.8688062,"about_ca_system_score_codex":0.000018632161,"about_ca_system_score_gemma":0.00001134271,"threshold_uncertainty_score":0.5503611},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20000212,0.00016915612,0.7772173,0.00014940507,0.00041444643,0.00008474158,8.151984e-7,0.00011157486,0.02185042],"genre_scores_gemma":[0.98038566,0.0000012520153,0.019349491,0.00004181907,0.00006427349,0.0000016962344,2.8391815e-7,0.0000026803223,0.00015284431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99919564,0.00009122795,0.00014709095,0.00013919733,0.0001620274,0.00026482355],"domain_scores_gemma":[0.9993232,0.00013079536,0.000049613584,0.0003536965,0.000025226098,0.00011745818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005513241,0.00006963944,0.00011883996,0.000042647353,0.00004370991,0.000018906396,0.00040305385,0.000029399886,0.0004049232],"category_scores_gemma":[0.000042564418,0.000054649678,0.00005659546,0.0003669243,0.000023582154,0.00046874856,0.000137411,0.00006740947,0.000071154325],"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.000010447846,0.0004310996,0.1586769,0.000060683808,0.000020085603,0.000003274258,0.0010646641,0.000024827446,0.0011948827,0.76367456,0.00034110522,0.07449748],"study_design_scores_gemma":[0.0017766418,0.0003545849,0.28172258,0.00005221977,0.00003649507,0.00011492391,0.00028496477,0.13390242,0.5315202,0.025250956,0.023454657,0.0015293496],"about_ca_topic_score_codex":0.000007286989,"about_ca_topic_score_gemma":1.7219213e-7,"teacher_disagreement_score":0.7803835,"about_ca_system_score_codex":0.000017634053,"about_ca_system_score_gemma":0.00001720157,"threshold_uncertainty_score":0.4433625},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00764587,0.000076333556,0.9912347,0.0005484151,0.000041436848,0.000026308795,0.0000019971462,0.0000072231733,0.00041772393],"genre_scores_gemma":[0.44344416,0.000008441342,0.5530353,0.0006401591,0.001398396,0.0000015092324,6.156844e-7,0.000010755769,0.0014606568],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994797,0.00006597021,0.00017136389,0.00006746335,0.000111175614,0.00010429416],"domain_scores_gemma":[0.9991594,0.00048809027,0.0001064591,0.000110441455,0.00006458531,0.0000710013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029521837,0.000070415015,0.000130855,0.000009748732,0.00007181348,0.000043834145,0.00020153545,0.000022666307,0.000020797632],"category_scores_gemma":[0.000021036183,0.000043721422,0.00007378402,0.00011056229,0.000022316075,0.00023170076,0.00003624259,0.000116968775,8.054063e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006226133,0.00003445659,4.7266667e-7,0.0000068116638,0.00006708741,0.0000018921544,0.001829535,0.0006835652,0.074182905,0.081497744,0.0016131961,0.84002006],"study_design_scores_gemma":[0.00060609926,0.00010845929,0.000004578608,0.000028645549,0.00005045429,0.00017472605,0.00002936288,0.18065207,0.2198005,0.59375566,0.0046635657,0.00012587247],"about_ca_topic_score_codex":0.0000032439204,"about_ca_topic_score_gemma":5.5155283e-8,"teacher_disagreement_score":0.8398942,"about_ca_system_score_codex":0.000011204585,"about_ca_system_score_gemma":0.00003704269,"threshold_uncertainty_score":0.17829078},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034473293,0.000011530713,0.9634002,0.00065178453,0.000112358895,0.00023834009,0.0000053959243,0.000018981284,0.0010881573],"genre_scores_gemma":[0.71127826,0.0000070706174,0.28846386,0.000072804105,0.000007417905,0.000015043655,2.0478602e-8,0.0000052784417,0.00015027258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99862397,0.00036828927,0.0003999901,0.0001427497,0.000314858,0.00015012528],"domain_scores_gemma":[0.9978674,0.0008129763,0.0004894576,0.0007122476,0.0000941609,0.00002375551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096956664,0.0000990604,0.00024002239,0.000011275212,0.00032833777,0.00001582528,0.0011341092,0.000021485803,0.00005258758],"category_scores_gemma":[0.0001354356,0.000048017955,0.00047259123,0.0009143192,0.0006158622,0.000101103884,0.00004937821,0.00021951253,0.0000010274197],"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.000007817272,0.00074383745,0.00036209877,0.0004357644,0.0004876967,1.2646613e-7,0.022415329,0.010993468,0.043173514,0.8976107,0.00012397798,0.023645641],"study_design_scores_gemma":[0.00037434616,0.00014716928,0.0007804219,0.00020019313,0.0002110398,0.00007002119,0.007951422,0.3779417,0.43651873,0.17531851,0.00019730364,0.00028913416],"about_ca_topic_score_codex":0.000063113774,"about_ca_topic_score_gemma":0.000001454223,"teacher_disagreement_score":0.7222922,"about_ca_system_score_codex":0.00001654332,"about_ca_system_score_gemma":0.000077107354,"threshold_uncertainty_score":0.25253418},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.940311,0.00080706656,0.05617239,0.00062564004,0.00003877145,0.00043794967,0.000010621731,0.00018038505,0.0014161534],"genre_scores_gemma":[0.9714829,0.00048409816,0.024927678,0.0019950054,0.0002716479,0.00025675414,0.00001488071,0.000017251245,0.0005498333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999385,0.000031081338,0.00011431875,0.00027738334,0.00006145813,0.00013078246],"domain_scores_gemma":[0.999451,0.00009487837,0.000042172807,0.00026826427,0.000026551936,0.00011712246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007830333,0.000107366606,0.000096645366,0.000059160135,0.00019105083,0.00014610728,0.00023467773,0.000042170104,0.00005683839],"category_scores_gemma":[0.0000055791156,0.000081410406,0.000019692452,0.00016870943,0.00002964268,0.00048777126,0.00009906193,0.00008149254,0.0000598929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016273394,0.000050183247,0.00004230913,0.000017108567,0.0000100651005,3.130884e-7,0.00035194404,0.0000071813342,0.00242314,0.96953243,0.0002230823,0.027340598],"study_design_scores_gemma":[0.00067394314,0.0001393547,0.0021780338,0.000026386688,0.000013733342,0.000025083915,0.00012852886,0.44228795,0.01429332,0.5137037,0.026004154,0.00052581757],"about_ca_topic_score_codex":0.000015438534,"about_ca_topic_score_gemma":9.163879e-7,"teacher_disagreement_score":0.45582876,"about_ca_system_score_codex":0.000003374551,"about_ca_system_score_gemma":0.000010574095,"threshold_uncertainty_score":0.331982},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9513547,0.00062956475,0.019542864,0.00089476455,0.00020104184,0.000064257794,0.00007912041,0.0001348781,0.027098812],"genre_scores_gemma":[0.9906295,0.0003176322,0.0074675316,0.0008089597,0.0004053938,0.0001397862,0.00007247081,0.00003100977,0.00012769828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983427,0.00006479482,0.0003756535,0.00046371674,0.0003930348,0.0003601011],"domain_scores_gemma":[0.99845034,0.0003583278,0.00031017032,0.0006128912,0.00006089007,0.00020737525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042770526,0.00017819244,0.00012102785,0.0001028035,0.0004031239,0.00019116803,0.00062573893,0.0002459092,0.0007828661],"category_scores_gemma":[0.0001110233,0.00023883938,0.00022192056,0.00044419715,0.00015547652,0.0005237554,0.00028363484,0.00025660262,0.0003059205],"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.000046361463,0.00013324944,0.000002192295,0.00007688728,0.00006235255,0.00001723366,0.00045497532,0.00010432363,0.0020010993,0.989487,0.0023029314,0.0053114146],"study_design_scores_gemma":[0.00058953476,0.00035749024,0.00018034721,0.000080975435,0.00012725891,0.00013700436,0.00012821174,0.7819133,0.20868014,0.0028887219,0.004556718,0.00036033982],"about_ca_topic_score_codex":0.00005307582,"about_ca_topic_score_gemma":0.000014350444,"teacher_disagreement_score":0.98659825,"about_ca_system_score_codex":0.0000035057076,"about_ca_system_score_gemma":0.00018805735,"threshold_uncertainty_score":0.97395873},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015564226,0.0005115367,0.09883064,0.0005908281,0.0006058547,0.00039737276,0.000013829805,0.00011540618,0.8987789],"genre_scores_gemma":[0.12589027,0.0007813849,0.17140648,0.0052011413,0.0041503403,0.000008046706,0.00002652176,0.00017999185,0.6923558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847174,0.00006139072,0.0005044931,0.00033813444,0.00038900253,0.00023522733],"domain_scores_gemma":[0.99793416,0.000569515,0.0006023837,0.0007521707,0.00008533324,0.00005645077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005859338,0.00027082436,0.00041886736,0.00009901307,0.000097999065,0.00004152837,0.0013216492,0.00014560537,0.00018553596],"category_scores_gemma":[0.000013088398,0.00017968388,0.00022606296,0.00010274253,0.00017554344,0.00010104367,0.0004728813,0.00028066104,0.00008010087],"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.00001887381,0.000018790932,0.000004264448,0.00006553131,0.000055488686,0.000006310772,0.00025424198,0.011164166,0.0000016268565,0.9538821,0.0040314067,0.030497203],"study_design_scores_gemma":[0.0012088455,0.0008586341,0.00005188714,0.0023932399,0.00016610397,0.000066261906,0.00019750092,0.54582924,0.00020427354,0.10585816,0.34171462,0.0014512371],"about_ca_topic_score_codex":0.000022313061,"about_ca_topic_score_gemma":0.00002034249,"teacher_disagreement_score":0.84802395,"about_ca_system_score_codex":0.000022833094,"about_ca_system_score_gemma":0.0000755438,"threshold_uncertainty_score":0.7327296},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8285451,0.00010604026,0.1376686,0.0142440535,0.00010145391,0.00035009373,0.00001090683,0.000072462244,0.018901326],"genre_scores_gemma":[0.96353924,0.0000022784607,0.035862837,0.00036509658,0.000021447117,0.0000073886085,3.90003e-7,0.0000062466925,0.00019504478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999063,0.00003277876,0.0002618311,0.00020677899,0.00012610391,0.0003095162],"domain_scores_gemma":[0.9992808,0.000097166885,0.00004526101,0.00032982702,0.000022436248,0.00022452309],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036752547,0.00009698209,0.00018791125,0.00012689029,0.00003721526,0.000034271576,0.0005496266,0.0000535511,0.0005412478],"category_scores_gemma":[0.0001376997,0.00009110121,0.00004455112,0.00022092235,0.000117523356,0.000050650542,0.00006497879,0.000110556866,0.0013042955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003995402,0.00009472943,0.00016436288,0.00019171988,0.0000068313166,0.00012587824,0.002265327,0.00040424327,0.00038010508,0.99095285,0.00048392275,0.0049260636],"study_design_scores_gemma":[0.0015900088,0.000118244854,0.0033900037,0.0009296349,0.000007126885,0.000063270556,0.0002453711,0.009732148,0.017125804,0.9395775,0.026498903,0.00072195113],"about_ca_topic_score_codex":0.0018509127,"about_ca_topic_score_gemma":0.00085432216,"teacher_disagreement_score":0.13499421,"about_ca_system_score_codex":0.000086752974,"about_ca_system_score_gemma":0.00011740793,"threshold_uncertainty_score":0.99947333},"labels":[],"label_agreement":null},{"id":"W2010972644","doi":"10.1002/nla.701","title":"A simultaneous decomposition of a matrix triplet with applications","year":2010,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Shanghai Municipal Education Commission; McGill University; Natural Science Foundation of Shanghai","keywords":"Hermitian matrix; Mathematics; Matrix (chemical analysis); Decomposition; Matrix function; Matrix decomposition; Pure mathematics; Applied mathematics; Algebra over a field; Symmetric matrix; Eigenvalues and eigenvectors; Physics; Quantum mechanics; Chemistry","score_opus":0.004614076783061271,"score_gpt":0.25739552059739856,"score_spread":0.2527814438143373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010972644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00317869,0.00002939705,0.9936545,0.0006671282,0.00002125707,0.0010602884,0.000035050012,0.0002755975,0.0010780738],"genre_scores_gemma":[0.5314837,0.0000030868182,0.46724564,0.00010391847,0.00012038072,0.0008634891,0.000033148943,0.000018397199,0.00012823741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985169,0.00003969587,0.00033697384,0.0005045597,0.00032293942,0.00027892075],"domain_scores_gemma":[0.9979166,0.0003642488,0.00022877747,0.0010262021,0.00024977807,0.00021443385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014948797,0.00020621641,0.00026390856,0.00011379654,0.00023635833,0.000061381135,0.00085624063,0.0000925264,0.000058006055],"category_scores_gemma":[0.000016398617,0.00015547057,0.00006501487,0.0012850354,0.00018612528,0.00019557118,0.000088080415,0.00034862146,0.00013565522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009456636,0.0008307124,0.00019445796,0.000053977918,0.000063896856,0.0000072699445,0.00015004183,0.0021034444,0.0063448725,0.93281907,0.0000534225,0.057284288],"study_design_scores_gemma":[0.0035385536,0.0015839319,0.00062238734,0.00006037036,0.00024110125,0.00081602,0.00010828212,0.60580224,0.02525229,0.053573646,0.3066118,0.0017893887],"about_ca_topic_score_codex":0.000014270656,"about_ca_topic_score_gemma":0.000006465971,"teacher_disagreement_score":0.8792454,"about_ca_system_score_codex":0.000015348594,"about_ca_system_score_gemma":0.00012013886,"threshold_uncertainty_score":0.6339906},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12786885,0.00017270794,0.86637354,0.0013948935,0.000092223934,0.0002576075,0.0000014361592,0.000012213346,0.0038265665],"genre_scores_gemma":[0.12834948,0.000013648781,0.8714426,0.0000247615,0.00004507219,0.0000028399265,3.46807e-8,0.0000065043564,0.00011506347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974463,0.0004966476,0.00065392663,0.0000977087,0.001011641,0.00029375346],"domain_scores_gemma":[0.9957426,0.0022961362,0.0003603581,0.00037355899,0.0010414923,0.0001858271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00899924,0.00008054117,0.0003198374,0.00052380405,0.00010159886,0.00018565693,0.001587898,0.000043664553,0.00012852887],"category_scores_gemma":[0.00055561704,0.000057819907,0.00009485328,0.0007138529,0.00006582631,0.00036395044,0.00049580436,0.0004123258,0.0000829935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020865731,0.000783316,0.00021430131,0.0012690872,0.00021834267,0.000103813945,0.016290518,0.00044085443,0.041070182,0.5163159,0.010454436,0.41281843],"study_design_scores_gemma":[0.000773435,0.0008647916,0.0002333775,0.0008727633,0.000016794911,0.0013517885,0.00460933,0.14387801,0.052454744,0.79287356,0.0017970008,0.0002743996],"about_ca_topic_score_codex":0.000015304411,"about_ca_topic_score_gemma":3.165442e-7,"teacher_disagreement_score":0.412544,"about_ca_system_score_codex":0.000031129104,"about_ca_system_score_gemma":0.00012828698,"threshold_uncertainty_score":0.3118975},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22419329,0.000036993024,0.75550425,0.0011021917,0.017512662,0.00022580796,0.0000044684725,0.00014548193,0.0012748286],"genre_scores_gemma":[0.84077567,0.0000010206505,0.15504168,0.00031742558,0.0014453487,0.000001973987,0.000002172366,0.000016434595,0.0023982727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977367,0.00010096317,0.00044966812,0.00056852563,0.00053236325,0.0006118034],"domain_scores_gemma":[0.9979571,0.0005204087,0.00030806434,0.0006361778,0.00027410552,0.0003041279],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0047805845,0.00019457341,0.00021230563,0.0003598706,0.0015470113,0.0018400074,0.0016927371,0.00007132372,0.000059608763],"category_scores_gemma":[0.00035679244,0.00016184378,0.00023102004,0.0006149169,0.00013680576,0.00041676135,0.00026420446,0.0007098492,0.000097951706],"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.000025147283,0.00023183155,0.00010595132,0.0000312416,0.00003341128,0.00006209395,0.0014747469,0.00068797,0.021761196,0.28317806,0.008580769,0.6838276],"study_design_scores_gemma":[0.001214103,0.00019439569,0.00061979715,0.000097999226,0.000008538812,0.0006026034,0.00007486477,0.86206734,0.0076716137,0.02347462,0.10347156,0.00050255103],"about_ca_topic_score_codex":5.665993e-7,"about_ca_topic_score_gemma":0.000002463135,"teacher_disagreement_score":0.8613794,"about_ca_system_score_codex":0.000029280189,"about_ca_system_score_gemma":0.0001438274,"threshold_uncertainty_score":0.9997528},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7981721,0.001016186,0.19174524,0.0012656401,0.00030343534,0.0005730972,0.00012483237,0.00009648223,0.0067029446],"genre_scores_gemma":[0.9940766,0.000020502022,0.004794271,0.00010470762,0.00006544317,0.000009623965,0.000013927232,0.0000059367826,0.0009089701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813855,0.0005706104,0.00042752983,0.00027421652,0.00040574255,0.00018333014],"domain_scores_gemma":[0.9984674,0.00015609515,0.00046547822,0.00070251315,0.00018393701,0.000024596278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091862446,0.0001383015,0.0003341052,0.00022284535,0.00019866109,0.0000593967,0.00082539284,0.0000620063,0.000032390686],"category_scores_gemma":[0.000031986856,0.00007808899,0.00043621735,0.003030273,0.00013329767,0.00016634722,0.00016198253,0.00011453334,0.0000037209797],"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.00023786609,0.0008196133,0.029606188,0.00020540021,0.00694565,0.000014216472,0.00842308,0.05187996,0.04651853,0.8378595,0.0026255436,0.014864465],"study_design_scores_gemma":[0.0016494206,0.00020839409,0.07439302,0.000104165774,0.0044961823,0.00002014513,0.00084944756,0.7495763,0.11778262,0.0489504,0.001244547,0.0007254046],"about_ca_topic_score_codex":0.002846308,"about_ca_topic_score_gemma":0.00032984535,"teacher_disagreement_score":0.7889091,"about_ca_system_score_codex":0.000029094352,"about_ca_system_score_gemma":0.000054715816,"threshold_uncertainty_score":0.43027854},"labels":[],"label_agreement":null},{"id":"W2013095747","doi":"10.1002/nla.242","title":"A divide and conquer approach to computing the mean first passage matrix for Markov chains via Perron complement reductions","year":2001,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Markov chain; FLOPS; Block matrix; Partition (number theory); Matrix multiplication; Combinatorics; Ergodic theory; Complement (music); Matrix (chemical analysis); Divide and conquer algorithms; Diagonal; Discrete mathematics; Computation; Algorithm; Parallel computing; Computer science; Pure mathematics","score_opus":0.015150813886271673,"score_gpt":0.2651078357017424,"score_spread":0.24995702181547072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013095747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076085655,0.000058001795,0.9861799,0.010106561,0.000038329985,0.0017787566,0.000026261298,0.00017952803,0.0008718287],"genre_scores_gemma":[0.6006911,0.000008741616,0.39661592,0.00069243385,0.0003600729,0.0011474924,0.00003903499,0.00002373757,0.00042148452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984779,0.000066347224,0.00028989415,0.0005599739,0.00022625562,0.00037965062],"domain_scores_gemma":[0.9986157,0.00029495117,0.000107596985,0.00065683917,0.00010576033,0.00021917735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003876906,0.0002002266,0.00021242256,0.00006656005,0.0010064333,0.00013758538,0.0006427698,0.000042519536,0.000013819387],"category_scores_gemma":[0.00001641029,0.00013958987,0.000061296596,0.00071331416,0.00012259487,0.00011523574,0.0002366975,0.00016987209,0.00002480541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005371554,0.00062162534,0.00033586632,0.00006234043,0.00010479608,0.0000014864552,0.0023853036,0.0047820373,0.000087771856,0.9142891,0.0021626088,0.075113334],"study_design_scores_gemma":[0.0006676567,0.0002231466,0.0008331876,0.000017165923,0.000054376993,0.00014568627,0.00027132742,0.6974167,0.00006346448,0.009246784,0.29062596,0.000434514],"about_ca_topic_score_codex":0.00003151655,"about_ca_topic_score_gemma":0.000007996586,"teacher_disagreement_score":0.90504235,"about_ca_system_score_codex":0.000038621034,"about_ca_system_score_gemma":0.000031423813,"threshold_uncertainty_score":0.7740773},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025906947,0.00088536297,0.970434,0.0011770636,0.000050605504,0.0002291359,0.000021338796,0.00011420091,0.0011813486],"genre_scores_gemma":[0.9312771,0.00013559916,0.067622945,0.00009289952,0.00013255686,0.00008844099,0.00001118104,0.000008238685,0.00063104474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994445,0.000011508737,0.0001629281,0.00018877987,0.000083445106,0.000108850174],"domain_scores_gemma":[0.99953383,0.00004632861,0.000060771625,0.0002475067,0.000050269973,0.000061316896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010011803,0.00007081409,0.00009298221,0.000061513434,0.0001614811,0.000030381852,0.00025122205,0.000035957877,0.000017431119],"category_scores_gemma":[0.000009075333,0.00006428306,0.000035793,0.00032650496,0.000032541426,0.00020927882,0.00006875042,0.00006814623,0.000055015837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011545746,0.00006036404,0.0000084851445,0.00001874867,0.000008163519,3.1718568e-7,0.00017444175,0.00020881995,0.0016496637,0.9857966,0.000018670919,0.012054571],"study_design_scores_gemma":[0.0023745538,0.0003344061,0.0016049488,0.000093329174,0.000110516325,0.00015645113,0.00057358085,0.051758092,0.09041608,0.688996,0.1625699,0.0010121068],"about_ca_topic_score_codex":0.000006801292,"about_ca_topic_score_gemma":0.0000014550307,"teacher_disagreement_score":0.9053701,"about_ca_system_score_codex":0.000005645579,"about_ca_system_score_gemma":0.0000294717,"threshold_uncertainty_score":0.2621387},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011973895,0.00026396193,0.98515946,0.0005727521,0.000027591494,0.00085374026,0.000013722193,0.0002502092,0.00088464376],"genre_scores_gemma":[0.5298239,0.00016398262,0.46754026,0.00039404133,0.0002287268,0.0009656388,0.000021363376,0.000020308213,0.00084177445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999094,0.000020481892,0.00023539967,0.0003376166,0.000107243315,0.00020522339],"domain_scores_gemma":[0.9993031,0.0000959347,0.00008019685,0.00033391136,0.000086286,0.00010056021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019388701,0.000118038224,0.00013198046,0.00004873207,0.00051948876,0.000046501704,0.00033748453,0.00004997725,0.000005432485],"category_scores_gemma":[0.000016396987,0.00010701217,0.000048409107,0.0002231174,0.00002516283,0.00025439766,0.0000994407,0.00008249961,0.000044386477],"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.0000010805422,0.000088552995,0.000009819729,0.00006174387,0.000013477969,3.3466807e-7,0.0009788779,0.0011530663,0.00096849725,0.9926979,0.00015643358,0.0038701994],"study_design_scores_gemma":[0.00019080451,0.000035239376,0.000014596686,0.0000065787976,0.000009175607,0.000020947937,0.000015269407,0.9329429,0.0017080533,0.05838723,0.0065190652,0.00015010929],"about_ca_topic_score_codex":0.000001493949,"about_ca_topic_score_gemma":6.796906e-7,"teacher_disagreement_score":0.9343107,"about_ca_system_score_codex":0.000010262613,"about_ca_system_score_gemma":0.00006345451,"threshold_uncertainty_score":0.43638298},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087854974,0.0006128389,0.89786786,0.007910975,0.0000525579,0.002207547,0.00019207277,0.0007006453,0.0026005604],"genre_scores_gemma":[0.94071984,0.00007390414,0.05739955,0.0005145792,0.00034534454,0.0005073569,0.00015629306,0.000017483982,0.00026561966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885726,0.000053055453,0.00025299838,0.00047188211,0.0001753561,0.0001894773],"domain_scores_gemma":[0.9981349,0.0001271108,0.00011574016,0.0013793433,0.0001044306,0.0001384537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016457992,0.00015278962,0.0001340819,0.0001208576,0.00044536422,0.0001307538,0.0010195188,0.000060496397,0.0000015512456],"category_scores_gemma":[0.0000059526933,0.00012699771,0.000021215461,0.00061246735,0.000050299277,0.00039003527,0.0001569864,0.00012954972,0.00007418796],"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.000018912828,0.00012017835,0.000009132506,0.0000075069634,0.0000052802525,2.3654762e-7,0.000113398346,0.00024602847,0.0010991115,0.9737106,0.00008227416,0.024587367],"study_design_scores_gemma":[0.0023105969,0.001046434,0.0053538806,0.00006616857,0.00007252647,0.00004764535,0.00016474766,0.45385873,0.023192583,0.30479282,0.207583,0.0015108606],"about_ca_topic_score_codex":0.000033783996,"about_ca_topic_score_gemma":0.00003610767,"teacher_disagreement_score":0.8528649,"about_ca_system_score_codex":0.000015551526,"about_ca_system_score_gemma":0.00002956146,"threshold_uncertainty_score":0.51788163},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033298615,0.0026310256,0.9254136,0.009977043,0.00038065226,0.0008111723,0.00004993583,0.00037969605,0.027058225],"genre_scores_gemma":[0.98736995,0.000041693464,0.009862932,0.00045672426,0.00022007097,0.000072006645,0.000006601316,0.000008752494,0.0019612932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936736,0.000032353124,0.00013944328,0.00020574014,0.00013447869,0.00012061301],"domain_scores_gemma":[0.99936014,0.00008432497,0.00005188699,0.00031191116,0.00006172818,0.00012998257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012923387,0.00008232824,0.00012063053,0.000049325496,0.00007934634,0.000030224872,0.00030709416,0.000043206055,0.000019793066],"category_scores_gemma":[0.000014080111,0.00006844067,0.00003187304,0.00027995332,0.0000391857,0.0001096851,0.000080091086,0.00007660297,0.00010311565],"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.0000073299957,0.00009552189,0.000023793194,0.000007849431,0.00000993427,4.6254942e-7,0.00017917815,0.000012886983,0.00030046672,0.98616844,0.0007992123,0.012394913],"study_design_scores_gemma":[0.0016829483,0.00043914685,0.0016492401,0.00002661035,0.00004064629,0.000022525785,0.00007030499,0.044257574,0.02039948,0.124181814,0.8066855,0.00054420007],"about_ca_topic_score_codex":0.0000044468616,"about_ca_topic_score_gemma":1.8408255e-7,"teacher_disagreement_score":0.9540713,"about_ca_system_score_codex":0.000005931421,"about_ca_system_score_gemma":0.00003095545,"threshold_uncertainty_score":0.27909294},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045645814,0.0004933086,0.94409776,0.004280564,0.00006038442,0.00036649773,0.000014408598,0.00029594332,0.0047453484],"genre_scores_gemma":[0.97497594,0.00015528403,0.021285936,0.002502061,0.00033917438,0.00005088868,0.000014387756,0.000006993332,0.00066930946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993167,0.000019565085,0.00015057345,0.00026431013,0.0000929349,0.00015592543],"domain_scores_gemma":[0.9994545,0.000035497833,0.000040976924,0.0003302682,0.000032951568,0.00010578889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000091005655,0.00009599867,0.00009268683,0.000048363207,0.00014112073,0.00006912698,0.00037608945,0.00004297942,0.000026754835],"category_scores_gemma":[0.0000066474568,0.00008574647,0.000031743406,0.00020977145,0.000013048021,0.0002403469,0.00006402007,0.00010069918,0.0001105013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014044243,0.00007000026,0.000035483685,0.0000060084476,0.000004385841,0.000002090275,0.0001004789,0.00000551731,0.0008844695,0.91816384,0.000103701735,0.08062265],"study_design_scores_gemma":[0.0012506051,0.00040362967,0.019372752,0.00005487432,0.00004696655,0.00013638113,0.000053454005,0.19197609,0.026087098,0.5163028,0.24306966,0.001245703],"about_ca_topic_score_codex":0.0000016418822,"about_ca_topic_score_gemma":5.9041525e-7,"teacher_disagreement_score":0.92933017,"about_ca_system_score_codex":0.0000038057788,"about_ca_system_score_gemma":0.000020867777,"threshold_uncertainty_score":0.34966397},"labels":[],"label_agreement":null},{"id":"W2015224767","doi":"10.1137/s0895479802402818","title":"Optimization and Pseudospectra, with Applications to Robust Stability","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Lipschitz continuity; Mathematical analysis; Matrix (chemical analysis); Condition number; Applied mathematics; Complex plane","score_opus":0.01048618722052016,"score_gpt":0.2502751010984845,"score_spread":0.23978891387796433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015224767","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002468778,0.00021090834,0.9952355,0.0006974926,0.000008187165,0.00034834337,0.0000071515105,0.000047206668,0.0009764178],"genre_scores_gemma":[0.4616334,0.00037888216,0.5370938,0.00024638604,0.00010636527,0.000255074,0.000006862601,0.000013305094,0.00026588538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882716,0.000092333124,0.00027949474,0.0003986604,0.00021471632,0.00018765681],"domain_scores_gemma":[0.9988646,0.000101573394,0.00014885672,0.00045941593,0.00013986914,0.0002857153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005699379,0.00014477737,0.00022238851,0.000325798,0.0005704287,0.0003652015,0.00025613708,0.00003985632,0.00007645282],"category_scores_gemma":[0.00001223299,0.00011262964,0.00007363052,0.002047468,0.000050236224,0.00020517068,0.000034280314,0.00016929439,0.000010692185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009447264,0.0002169055,0.002161225,0.000014434399,0.00025219563,0.0000019289273,0.00012204012,0.16526382,0.00014160894,0.82068413,0.000046638717,0.011085645],"study_design_scores_gemma":[0.0038783224,0.0014161876,0.016744334,0.00009061617,0.0040448294,0.0010185821,0.0015820588,0.6106639,0.0055042324,0.21088168,0.14047123,0.003704023],"about_ca_topic_score_codex":0.0000025332604,"about_ca_topic_score_gemma":0.0000049709774,"teacher_disagreement_score":0.6098024,"about_ca_system_score_codex":0.000030876094,"about_ca_system_score_gemma":0.0000412873,"threshold_uncertainty_score":0.45929033},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00522468,0.00008022019,0.77982193,0.01176438,0.00080019596,0.00041381846,0.000008933146,0.00020144864,0.20168439],"genre_scores_gemma":[0.9486422,0.0000051796956,0.025372297,0.0040757656,0.00012074328,0.000032479486,0.0000032679286,0.00003476527,0.021713324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888957,0.00009804127,0.00019883005,0.00025477982,0.0001803928,0.00037840314],"domain_scores_gemma":[0.99882406,0.000077506025,0.00005265501,0.00060716976,0.000058944202,0.00037966843],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00043320787,0.0001535921,0.00014691734,0.00007144237,0.00023714316,0.00008351139,0.00078212994,0.00007409485,0.023627954],"category_scores_gemma":[0.00006568637,0.00010916941,0.00009025453,0.0001796377,0.00013045146,0.00014334386,0.00009595282,0.00015802769,0.012071351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068232944,0.000021807002,0.000007818031,0.000012204939,0.000023210492,0.00005307468,0.0010966974,9.374514e-7,0.000011725619,0.98690933,0.011177427,0.0006789484],"study_design_scores_gemma":[0.00018410709,0.00014916545,0.0005001168,0.000026477937,0.000027240836,0.00012245392,0.0002886324,0.0011699215,0.00023820064,0.6342643,0.36270157,0.00032784772],"about_ca_topic_score_codex":0.00050056574,"about_ca_topic_score_gemma":0.00044979833,"teacher_disagreement_score":0.9434175,"about_ca_system_score_codex":0.000067933724,"about_ca_system_score_gemma":0.00012860775,"threshold_uncertainty_score":0.9886979},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011343321,0.00013217905,0.9835117,0.0005259946,0.000029060115,0.00033302084,0.000014062467,0.00017156232,0.0039390875],"genre_scores_gemma":[0.9611329,0.00010361056,0.034905773,0.0007491986,0.0006625135,0.0002490356,0.00012829289,0.0000239911,0.0020447127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999244,0.000026145077,0.00016581545,0.00028813406,0.00012872063,0.00014721385],"domain_scores_gemma":[0.99946105,0.00003721038,0.000064691536,0.00028596894,0.000088297704,0.0000627718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008392961,0.000108444605,0.00009191148,0.000049727132,0.0001669317,0.00008046351,0.0002528638,0.000042807715,0.00002058517],"category_scores_gemma":[0.0000035387457,0.00008689748,0.000021017784,0.00024629675,0.000021244234,0.00023704891,0.00006082875,0.000073626914,0.00007128386],"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.000004993821,0.00009667067,0.00022022595,0.000028507398,0.000007988892,0.0000023795587,0.000049677972,0.00013404185,0.00077771296,0.9913399,0.0001940222,0.0071438625],"study_design_scores_gemma":[0.0024670009,0.0006756694,0.022434808,0.00016393667,0.00010812067,0.00016188573,0.000057268684,0.5210188,0.02645948,0.20134349,0.22322647,0.001883069],"about_ca_topic_score_codex":0.000025796706,"about_ca_topic_score_gemma":0.0000066916305,"teacher_disagreement_score":0.9497895,"about_ca_system_score_codex":0.0000067309766,"about_ca_system_score_gemma":0.000028832319,"threshold_uncertainty_score":0.35435766},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01232138,0.0002579324,0.98667747,0.00026546922,0.00006778184,0.00020343717,8.601979e-7,0.000013471249,0.00019217592],"genre_scores_gemma":[0.35447228,0.0000017650127,0.645391,0.00006209059,0.000057099078,0.0000052904797,5.166832e-7,0.000005282039,0.0000047162607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987966,0.000026209555,0.0006305734,0.00013318256,0.00025618204,0.00015724856],"domain_scores_gemma":[0.9975605,0.0017063748,0.00042760794,0.0000842766,0.00015196641,0.00006924874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017472907,0.00011699504,0.00026240703,0.00039286082,0.00009860047,0.000106118685,0.00024064451,0.000040335362,0.0000015711553],"category_scores_gemma":[0.000108083674,0.00009898313,0.00006344475,0.0003919993,0.000023468514,0.00016097662,0.00006361682,0.000118073265,0.0000015745123],"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.000004884158,0.00009253156,6.563172e-8,0.000024447645,0.000008213969,2.4447456e-7,0.0007232067,0.586905,0.00012876464,0.34725875,0.000004598353,0.064849295],"study_design_scores_gemma":[0.00037503996,0.000024666839,0.000006915743,0.000035131958,0.0000087735125,0.00003479455,0.000037373262,0.5880725,0.00012585241,0.41120723,0.000007841501,0.00006391978],"about_ca_topic_score_codex":1.8559331e-7,"about_ca_topic_score_gemma":7.6073384e-8,"teacher_disagreement_score":0.3421509,"about_ca_system_score_codex":0.000045384266,"about_ca_system_score_gemma":0.00007853576,"threshold_uncertainty_score":0.4036415},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007130458,0.00008614829,0.9895865,0.0011801246,0.0012054018,0.00024523097,0.000032718362,0.00005161957,0.00048181578],"genre_scores_gemma":[0.039813872,0.000004261694,0.9587647,0.0006174735,0.00062186265,0.000010682518,0.0000057883235,0.00002134672,0.00014002771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980531,0.00010978826,0.000699119,0.00022725097,0.0006815186,0.00022922807],"domain_scores_gemma":[0.9973301,0.00044514824,0.0006377782,0.0003366095,0.0010973205,0.00015299083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009942338,0.0002034672,0.0003154755,0.00028280588,0.0001654599,0.0006920615,0.0015014864,0.000044350018,0.00018952777],"category_scores_gemma":[0.000026951033,0.00015553307,0.00015442149,0.00018601639,0.00008273766,0.00069555914,0.00012433807,0.00022362528,0.000016027974],"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.00005209176,0.0028637694,0.000018686973,0.00018932925,0.0007768458,0.00024198236,0.008663213,0.1576481,0.0006240286,0.79474676,0.006601236,0.027573962],"study_design_scores_gemma":[0.0013973837,0.0005029781,0.000014865128,0.00016615451,0.000027103104,0.0022268144,0.00003757135,0.88836205,0.0004919232,0.099244334,0.0073312437,0.00019756188],"about_ca_topic_score_codex":9.428175e-7,"about_ca_topic_score_gemma":0.0000013858347,"teacher_disagreement_score":0.73071396,"about_ca_system_score_codex":0.00007952985,"about_ca_system_score_gemma":0.00011624907,"threshold_uncertainty_score":0.6673565},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011695009,0.00024046542,0.9771941,0.0018407198,0.00005490951,0.00036552118,0.000013334282,0.00023102539,0.008364918],"genre_scores_gemma":[0.9181793,0.000023543924,0.0785805,0.0007574626,0.00042998002,0.00021662698,0.000036154805,0.000018467003,0.0017579643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904776,0.000034563225,0.00018165295,0.00035851565,0.00014971566,0.00022780288],"domain_scores_gemma":[0.9992158,0.00011922295,0.00005032842,0.0004911091,0.000039404287,0.00008413551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014275317,0.00013058225,0.000115977826,0.00007076942,0.0002674904,0.0001274708,0.0005045612,0.000056059376,0.000040956398],"category_scores_gemma":[0.000009115407,0.00011749045,0.00005065439,0.00030433375,0.000021988892,0.00018238771,0.000093704904,0.00012411262,0.00017390138],"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.0000041931544,0.00011296962,0.000045069428,0.000013498327,0.0000039319507,0.0000015152925,0.000027974218,0.0031919412,0.000631751,0.99168056,0.0006734153,0.0036131886],"study_design_scores_gemma":[0.0003266409,0.000045300818,0.000624937,0.000009626016,0.000006349601,0.0000037195719,0.0000038700655,0.87855244,0.001375534,0.07692321,0.041926842,0.00020152985],"about_ca_topic_score_codex":0.000016026654,"about_ca_topic_score_gemma":0.0000044716876,"teacher_disagreement_score":0.9147574,"about_ca_system_score_codex":0.0000097830425,"about_ca_system_score_gemma":0.000024659019,"threshold_uncertainty_score":0.47911215},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011838379,0.000017992063,0.9870009,0.00020238156,0.00003700086,0.000062820756,0.00038693915,0.000030468287,0.00042312278],"genre_scores_gemma":[0.75420505,0.000014249033,0.24552506,0.00016292153,0.000009071627,0.0000021195037,0.000015058286,0.0000019389304,0.000064530774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951166,0.000035626155,0.00011532496,0.00013620456,0.0001067561,0.000094423085],"domain_scores_gemma":[0.9993892,0.00029499235,0.000059635906,0.00014926266,0.000057688016,0.000049228354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000053743344,0.00006741085,0.00008713888,0.000040535902,0.00010084203,0.000023112225,0.00009966862,0.000023197003,0.000010559138],"category_scores_gemma":[0.000050150626,0.00005720908,0.000013268223,0.00007272873,0.000041069914,0.000081095255,0.00002678265,0.000051640414,0.0000045610677],"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.000013614345,0.000103764265,0.0000032179817,0.000004412685,0.0000057758957,0.0000051940738,0.00022562535,0.0050329007,0.00051171664,0.98229516,0.0017575935,0.010041001],"study_design_scores_gemma":[0.00019821698,0.00012520143,0.00048879924,0.000027241147,0.000004754156,0.000003326509,0.0000115418225,0.5206224,0.0021601561,0.47628614,0.000015255246,0.0000570285],"about_ca_topic_score_codex":0.0000017952426,"about_ca_topic_score_gemma":0.0000024050544,"teacher_disagreement_score":0.7423667,"about_ca_system_score_codex":0.000008147618,"about_ca_system_score_gemma":0.000021436941,"threshold_uncertainty_score":0.23329185},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18866004,0.00035457735,0.7968268,0.012660235,0.00041431704,0.00007828299,0.00000232974,0.000023513148,0.0009799278],"genre_scores_gemma":[0.994765,0.000033156695,0.0038754046,0.000899385,0.00014660074,0.0000033608205,3.3135382e-7,0.000005300693,0.00027145748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982035,0.00028256283,0.0004132437,0.00021009365,0.0006180239,0.00027256514],"domain_scores_gemma":[0.9981239,0.0006260104,0.00041610212,0.00043239433,0.00020208267,0.00019950207],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005868867,0.00016040451,0.00040257635,0.00022573193,0.00026812847,0.00046716857,0.0013590521,0.000041591375,0.0018949108],"category_scores_gemma":[0.00012210199,0.000083766805,0.0005396806,0.00124297,0.000099497986,0.00056517986,0.00011545675,0.00029990586,0.00025121353],"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.00048514223,0.003948594,0.037598226,0.00010191617,0.028309103,0.0023532135,0.007763138,0.024077665,0.020441316,0.53085667,0.06650774,0.2775573],"study_design_scores_gemma":[0.0014967923,0.0015405627,0.083502084,0.000112463495,0.0022882882,0.0006653082,0.0005931381,0.6698751,0.05148266,0.15885434,0.028071769,0.0015174974],"about_ca_topic_score_codex":0.00009083563,"about_ca_topic_score_gemma":0.0000034943464,"teacher_disagreement_score":0.80610496,"about_ca_system_score_codex":0.0000353678,"about_ca_system_score_gemma":0.000044592703,"threshold_uncertainty_score":0.9990175},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24533826,0.0017106538,0.7414737,0.00142009,0.00010841797,0.00064143585,0.00003763929,0.00018197548,0.009087868],"genre_scores_gemma":[0.9660684,0.0000696302,0.03302119,0.00017119007,0.00018853022,0.00009632322,0.0000107230635,0.0000062188224,0.0003678282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939656,0.000032174077,0.00016873261,0.00016183637,0.0000795946,0.00016107119],"domain_scores_gemma":[0.9994165,0.00009543403,0.000079036465,0.00022294263,0.00007048689,0.00011562993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014412092,0.00008355316,0.00010585121,0.000036738475,0.00014324786,0.000027021262,0.00022741556,0.00004575889,0.000059994192],"category_scores_gemma":[0.000009377892,0.000075840166,0.000035157584,0.0002811551,0.000036809764,0.00024702487,0.0001025967,0.000064088184,0.00010864037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029583553,0.00017146826,0.0005591256,0.00003342697,0.000021485752,3.517632e-7,0.0011441493,0.0000026876146,0.0009470077,0.9793426,0.000061022445,0.017713735],"study_design_scores_gemma":[0.0026714918,0.00033183652,0.020569623,0.00022717725,0.00032979506,0.00039394858,0.0010165971,0.06486791,0.25017008,0.5215451,0.13546148,0.0024149558],"about_ca_topic_score_codex":0.000009990793,"about_ca_topic_score_gemma":0.000001171125,"teacher_disagreement_score":0.7207301,"about_ca_system_score_codex":0.0000054400407,"about_ca_system_score_gemma":0.000015195807,"threshold_uncertainty_score":0.30926722},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030585732,0.000058512116,0.967385,0.0006208412,0.000036165708,0.00042528426,0.000004702454,0.00005561264,0.000828163],"genre_scores_gemma":[0.11209898,0.000023704062,0.88707876,0.00034289528,0.000070265465,0.00021232509,0.0000032090297,0.000014685308,0.00015519193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991817,0.00003829712,0.00021120353,0.00020291416,0.0002285058,0.00013739153],"domain_scores_gemma":[0.9986422,0.00041478605,0.00017753159,0.00057129806,0.00008936518,0.000104838175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035216686,0.000121690806,0.00016061922,0.00007022375,0.00010664721,0.00008523414,0.0006961317,0.000027887327,0.0000022191575],"category_scores_gemma":[0.000017138473,0.000074023665,0.00002925397,0.0003181957,0.00012449856,0.000100416415,0.00017114909,0.00007693298,0.0000151462955],"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.000005794371,0.00014745018,0.000011978661,0.00004496958,0.00002086008,0.0000020845314,0.0011506964,0.00037651253,0.00004873375,0.98575085,0.001927865,0.010512227],"study_design_scores_gemma":[0.00075394334,0.0002497574,0.000072970935,0.00007760276,0.00003323207,0.00009305626,0.0002189372,0.6221374,0.0011998505,0.37096882,0.0039197137,0.00027467043],"about_ca_topic_score_codex":0.0000031630007,"about_ca_topic_score_gemma":0.0000020111343,"teacher_disagreement_score":0.62176096,"about_ca_system_score_codex":0.00001262937,"about_ca_system_score_gemma":0.00006634068,"threshold_uncertainty_score":0.30185974},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02868185,0.006487993,0.87286305,0.0060158162,0.000111944144,0.0011049012,0.00006469991,0.0004411503,0.0842286],"genre_scores_gemma":[0.98849535,0.0014145741,0.007352509,0.0004160368,0.0001800189,0.0000987034,0.0000041593594,0.000011526582,0.0020271318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992945,0.000020044583,0.00013839138,0.00029321696,0.00010040849,0.00015344661],"domain_scores_gemma":[0.9994652,0.00011126333,0.000040280283,0.0002621727,0.00002304607,0.00009799437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011483535,0.000107184496,0.00010092157,0.000046483518,0.00024307174,0.00009310615,0.00024168787,0.00003060851,0.000076443546],"category_scores_gemma":[0.0000055884243,0.00008863042,0.000025550042,0.00024342618,0.000050070834,0.00021014386,0.000039519637,0.00009313488,0.00009241011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001653358,0.00004497158,0.000010825337,0.0000138520845,0.000004528201,6.702608e-7,0.00022557577,0.0000037113957,0.000089092915,0.92951536,0.00015096687,0.069938794],"study_design_scores_gemma":[0.0012154,0.0002169813,0.00035581028,0.000050395975,0.000033790242,0.000057390505,0.00011493938,0.2784953,0.005460805,0.37314525,0.34015414,0.00069978955],"about_ca_topic_score_codex":0.0000017219169,"about_ca_topic_score_gemma":0.0000014006201,"teacher_disagreement_score":0.9598135,"about_ca_system_score_codex":0.0000045470033,"about_ca_system_score_gemma":0.0000036085082,"threshold_uncertainty_score":0.36142436},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00398127,0.00003050456,0.99303865,0.0011264968,0.0001948924,0.0009188993,0.0000452627,0.00062152505,0.00004247499],"genre_scores_gemma":[0.029035578,0.00003816719,0.967941,0.0007896082,0.000161318,0.0006933401,0.000018450946,0.000044130393,0.0012783945],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981305,0.0001328123,0.00038977846,0.0005111687,0.00046572348,0.0003700438],"domain_scores_gemma":[0.9957829,0.0026876228,0.00007848064,0.00117473,0.00012828127,0.000147982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006495872,0.00025923585,0.00023297119,0.00016613233,0.00084295135,0.00022403724,0.0011956409,0.00014477807,0.0006061429],"category_scores_gemma":[0.00032316393,0.00018083953,0.0002094357,0.0011035927,0.00006146736,0.00055093487,0.0000075476314,0.00030755886,0.00030024713],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072044175,0.0006040399,0.0000055805754,0.00007402702,0.00003989995,0.0000014395694,0.00025255565,0.010894699,0.0000105750305,0.016121242,0.000040615207,0.9718833],"study_design_scores_gemma":[0.00084840355,0.0010404286,0.00040142762,0.00009470616,0.000081704784,0.00003053304,0.000037919453,0.047248736,0.0015152625,0.94523877,0.0030531117,0.0004090074],"about_ca_topic_score_codex":0.0000063629373,"about_ca_topic_score_gemma":0.0000023786122,"teacher_disagreement_score":0.9714743,"about_ca_system_score_codex":0.000077778386,"about_ca_system_score_gemma":0.00006312579,"threshold_uncertainty_score":0.73744226},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025404152,0.00049462717,0.94768065,0.000035490328,0.00013133974,0.0008840877,0.000011613109,0.000121494275,0.048100263],"genre_scores_gemma":[0.21782112,0.00008275996,0.7811361,0.00007246851,0.000031397372,0.0005451367,0.0000020349207,0.0000164454,0.00029255825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985633,0.000033181284,0.0004597718,0.00039331312,0.00019539834,0.00035501772],"domain_scores_gemma":[0.9975597,0.0015447924,0.00027670164,0.0004988432,0.000057203895,0.00006273443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065582315,0.0002237512,0.00032819476,0.00010922207,0.00010976802,0.0000688503,0.0006565485,0.0000633185,0.000010357913],"category_scores_gemma":[0.0002810964,0.00019497695,0.000060021914,0.0003866357,0.00008754328,0.0004011308,0.000109276254,0.0001157966,0.000029961444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068162985,0.00013650183,0.000009493282,0.00026069678,0.00000696072,0.0000012673887,0.0038264163,0.00038820383,0.00011326936,0.98775613,0.0000073584843,0.0074869087],"study_design_scores_gemma":[0.00070065446,0.000056556357,0.0000063860184,0.000052843865,0.0000067001033,0.0000057698508,0.001658802,0.015999312,0.011989279,0.9613975,0.00780049,0.00032569392],"about_ca_topic_score_codex":5.9327414e-7,"about_ca_topic_score_gemma":0.0000048424395,"teacher_disagreement_score":0.21528071,"about_ca_system_score_codex":0.000047601374,"about_ca_system_score_gemma":0.00004368358,"threshold_uncertainty_score":0.79509294},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023458773,0.000060465387,0.9967966,0.00011249076,0.0000649474,0.0006786776,0.0000010954884,0.00027393783,0.0017771918],"genre_scores_gemma":[0.03147374,4.5355014e-7,0.9674047,0.00002296857,0.00028721636,0.00022886197,0.000030979892,0.000013903691,0.0005371607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888504,0.000044991142,0.0002958575,0.00029944832,0.00019271426,0.00028197278],"domain_scores_gemma":[0.9994346,0.000080835234,0.00008190777,0.0002885457,0.000062833264,0.00005130888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060004555,0.00012761187,0.00015600046,0.000059960486,0.00019046417,0.00032250895,0.00032622454,0.000068677524,0.000014815581],"category_scores_gemma":[0.00005918159,0.00010920991,0.000090094145,0.00022828658,0.000030417805,0.0002829879,0.000067229834,0.000058725094,0.000015108727],"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.0000022878053,0.00021011439,0.000001962393,0.000115727176,0.0000063628104,0.0000010427153,0.000093549024,0.042970825,0.00017030923,0.9279476,0.00014941268,0.028330816],"study_design_scores_gemma":[0.0002053888,0.00003858925,4.431369e-7,0.0000064720803,0.000009649514,0.000013243304,0.000012182403,0.934349,0.0008085338,0.06360898,0.00081125327,0.00013627506],"about_ca_topic_score_codex":0.0000019308097,"about_ca_topic_score_gemma":1.2411792e-7,"teacher_disagreement_score":0.89137816,"about_ca_system_score_codex":0.0000247339,"about_ca_system_score_gemma":0.000017174372,"threshold_uncertainty_score":0.44534507},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009164906,0.000018640547,0.99314517,0.0008657388,0.0005758938,0.00091755413,0.000016226584,0.0005106969,0.0030336042],"genre_scores_gemma":[0.29619822,0.000015039275,0.702338,0.00006738487,0.0001708968,0.00008857017,0.00024191315,0.00003402794,0.00084596913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99512804,0.0005224262,0.001058379,0.0017743076,0.000763935,0.0007528897],"domain_scores_gemma":[0.99587226,0.00030784015,0.0005406121,0.0016897537,0.0007208765,0.000868641],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012882823,0.00067606854,0.0007807768,0.0014031976,0.00086758175,0.0009004941,0.0024140947,0.00033781803,0.00085546245],"category_scores_gemma":[0.00015007668,0.0006662447,0.00041725225,0.004180839,0.00012041914,0.0022148518,0.001166193,0.00065069704,0.00014575175],"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.00013035096,0.00041416756,0.0004414287,0.000016552687,0.0002794877,0.000013200344,0.0018482697,0.98372096,0.00103639,0.0046303533,0.0001013061,0.00736755],"study_design_scores_gemma":[0.00077655545,0.00015386434,0.0009987244,0.00002877798,0.00034840129,0.000043487238,0.00011325612,0.99399406,0.0013995217,0.0013005369,0.000023116017,0.0008196778],"about_ca_topic_score_codex":0.0001020883,"about_ca_topic_score_gemma":0.00002909701,"teacher_disagreement_score":0.29528174,"about_ca_system_score_codex":0.00010750592,"about_ca_system_score_gemma":0.0003581702,"threshold_uncertainty_score":0.9995789},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06353581,0.00216295,0.92757255,0.000398725,0.0026295797,0.0021897126,0.0008474849,0.00024646043,0.0004167112],"genre_scores_gemma":[0.90187585,0.00032663674,0.084163435,0.000320858,0.0045052553,0.0018081594,0.0012208057,0.00024150584,0.0055374857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99688107,0.00022586725,0.0006898653,0.0011113927,0.00047474453,0.0006170528],"domain_scores_gemma":[0.9977945,0.00017968267,0.00037524526,0.00086917914,0.00036016188,0.00042119907],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010031043,0.0005723367,0.0011062368,0.00009030604,0.00020102208,0.0006301155,0.0010677916,0.0003969603,0.0000020775906],"category_scores_gemma":[0.00007040745,0.00040088585,0.00019942391,0.00017303633,0.00016079516,0.00019374615,0.0007767772,0.00052904204,0.0000072400903],"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.0045242,0.0024933706,0.0035749539,0.010024958,0.0043855077,0.0020620904,0.008944559,0.031445134,0.0004466465,0.75881267,0.010679363,0.16260652],"study_design_scores_gemma":[0.001587097,0.0005964759,0.0000112844755,0.0004213843,0.00010290657,0.0001280862,0.00020382997,0.95712465,0.000039917482,0.001971035,0.03690953,0.0009038183],"about_ca_topic_score_codex":0.00015098078,"about_ca_topic_score_gemma":0.000012013725,"teacher_disagreement_score":0.9256795,"about_ca_system_score_codex":0.00007471057,"about_ca_system_score_gemma":0.00026965523,"threshold_uncertainty_score":0.9998443},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008843776,0.0002050386,0.9880606,0.0013470013,0.000045020573,0.0010307403,0.000012191132,0.00017614452,0.0002795173],"genre_scores_gemma":[0.16195795,0.00007099653,0.83732927,0.00018867549,0.00008298406,0.00017278154,0.000025594885,0.000023022896,0.00014870625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984581,0.000061976585,0.00048153455,0.00037419336,0.000318085,0.00030615262],"domain_scores_gemma":[0.99804395,0.00030056335,0.00039059852,0.0009467647,0.0001715228,0.00014658357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053591,0.00023145472,0.00029267132,0.00009434806,0.00052026176,0.00022562114,0.00077319203,0.00004634722,0.000003579939],"category_scores_gemma":[0.000011796313,0.00017227442,0.00006330802,0.0005659662,0.00026970735,0.00026972793,0.0001562571,0.00015059012,0.000026906295],"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.000010593199,0.00035025942,0.00006278453,0.00012462738,0.000055096025,0.0000023454893,0.0010117001,0.002631939,0.0021503444,0.98104024,0.002010674,0.010549396],"study_design_scores_gemma":[0.0010364607,0.00015686099,0.00008746903,0.00011334319,0.00005265807,0.00007475136,0.00007549226,0.64671564,0.000507636,0.34668976,0.0041898782,0.0003000418],"about_ca_topic_score_codex":0.000009100636,"about_ca_topic_score_gemma":0.000029791418,"teacher_disagreement_score":0.64408374,"about_ca_system_score_codex":0.000032674674,"about_ca_system_score_gemma":0.000052968822,"threshold_uncertainty_score":0.7025147},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03175833,0.00007009996,0.96607417,0.0011339714,0.00016787836,0.0003174909,0.0000017483367,0.000007087872,0.00046922412],"genre_scores_gemma":[0.048612043,0.000019808647,0.9507938,0.000023020897,0.00018900346,0.000003939782,1.02020095e-7,0.000014003995,0.00034429753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972266,0.0008089417,0.000590625,0.00013261232,0.00091574003,0.00032546124],"domain_scores_gemma":[0.99671423,0.0014366956,0.00059544976,0.00043021014,0.0007278056,0.000095579446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014032066,0.00009729774,0.0002938929,0.00029605356,0.00026086482,0.00012001302,0.0014447689,0.00007125652,0.000011018733],"category_scores_gemma":[0.000783236,0.00006098317,0.00020495559,0.00057587365,0.000096496326,0.00032328357,0.00030813104,0.00033905328,0.000003006174],"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.00006359141,0.0011095437,0.00016503122,0.0038567474,0.0002769061,0.00001665388,0.01050291,0.015952865,0.09945529,0.8004419,0.0067401426,0.061418403],"study_design_scores_gemma":[0.0003741743,0.00014867821,0.000021289165,0.00025691974,0.000019630961,0.00011948569,0.0003199702,0.72038645,0.018562652,0.2583679,0.0013462286,0.00007665985],"about_ca_topic_score_codex":0.000014567932,"about_ca_topic_score_gemma":0.000003750899,"teacher_disagreement_score":0.70443356,"about_ca_system_score_codex":0.000065078224,"about_ca_system_score_gemma":0.00024578534,"threshold_uncertainty_score":0.4863262},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97056836,0.001771217,0.013370001,0.00084800745,0.00011682421,0.00009821129,0.00007566734,0.000072170915,0.013079559],"genre_scores_gemma":[0.98679256,0.00078167947,0.011475026,0.00034504122,0.00025513026,0.00019182684,0.000047639576,0.000033051056,0.00007803517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845654,0.000095421354,0.0004354332,0.00038424696,0.00034855327,0.0002797898],"domain_scores_gemma":[0.9983928,0.00043882956,0.00045441647,0.00050853734,0.000074725336,0.00013066591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005846493,0.00016482687,0.00013778284,0.00011629835,0.00037234114,0.00018164369,0.00052098057,0.00020458792,0.000422222],"category_scores_gemma":[0.00008368271,0.00018871165,0.0001769554,0.00044799337,0.00026271993,0.00053753145,0.000346731,0.00019590248,0.0001269965],"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.00011375655,0.00008441743,0.0000021182955,0.00014610396,0.0001113206,0.0000098079345,0.0012300092,0.00010257168,0.0021254413,0.99373907,0.0005340535,0.001801311],"study_design_scores_gemma":[0.00081775506,0.0002351834,0.000067403766,0.000117428805,0.00023041262,0.00023480672,0.000390749,0.8156044,0.1783245,0.0019894738,0.0017423129,0.00024555324],"about_ca_topic_score_codex":0.00017211636,"about_ca_topic_score_gemma":0.00003041705,"teacher_disagreement_score":0.99174964,"about_ca_system_score_codex":0.0000036309495,"about_ca_system_score_gemma":0.00012470625,"threshold_uncertainty_score":0.7695438},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99102366,0.000093647104,0.00040569092,0.0008224028,0.00020557774,0.00013779178,0.0000031457164,0.000035444005,0.0072726426],"genre_scores_gemma":[0.99500644,0.000009924699,0.0046009505,0.000055149798,0.000095476666,0.0000026061762,3.4607066e-8,0.000002603087,0.00022681936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986928,0.000010034799,0.00036479166,0.00022808103,0.0005091829,0.00019509434],"domain_scores_gemma":[0.9991264,0.000046607744,0.0006777231,0.000041388277,0.00007356415,0.00003436377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010359002,0.00009166009,0.0001576175,0.0002634577,0.00017866322,0.00004609591,0.001623267,0.00008027396,0.000009798522],"category_scores_gemma":[0.00004005872,0.00006440087,0.00009307217,0.0017107793,0.00061669695,0.0009315944,0.00020854188,0.00015550196,0.000001688255],"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.000036414516,0.00021279206,0.040080298,0.00056812284,0.000026695432,2.0888316e-7,0.0030281923,0.00073463377,0.18989131,0.7544689,0.0021508466,0.008801548],"study_design_scores_gemma":[0.00038766695,0.00023194087,0.043379053,0.00016779185,0.000019469406,0.000068453795,0.00078995863,0.006384973,0.858628,0.08865473,0.0010224975,0.00026547516],"about_ca_topic_score_codex":0.00006462141,"about_ca_topic_score_gemma":4.4662622e-7,"teacher_disagreement_score":0.6687367,"about_ca_system_score_codex":0.000015110064,"about_ca_system_score_gemma":0.000031250816,"threshold_uncertainty_score":0.30164608},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01033295,0.00042789956,0.97998375,0.0014869275,0.000045184508,0.00023126666,0.000008093219,0.00016442468,0.0073195216],"genre_scores_gemma":[0.9440131,0.00013292144,0.05252348,0.0010448227,0.0004885404,0.00012787773,0.000012761953,0.000013179179,0.0016433195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940556,0.00003324351,0.00010970604,0.00023870496,0.000083480634,0.0001292812],"domain_scores_gemma":[0.9994446,0.000121232864,0.000043752698,0.00025547395,0.000049844428,0.000085080865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014630491,0.000077569974,0.000081685524,0.000044170993,0.00020375852,0.00009651859,0.00032821557,0.000036256195,0.00001574502],"category_scores_gemma":[0.00001311824,0.00006795361,0.00002512565,0.00025316403,0.000023784543,0.00023563177,0.00010490335,0.00007111835,0.00025440668],"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":[6.8654765e-7,0.000020481371,0.000009891951,0.0000060427087,0.000004398032,1.8158153e-7,0.00011102719,0.0000033800527,0.00028950104,0.9533387,0.000075672215,0.04614007],"study_design_scores_gemma":[0.0006582298,0.00021889368,0.0029138739,0.00002655044,0.00003745654,0.000053606553,0.00005008966,0.36488774,0.014515941,0.30047584,0.31547984,0.00068191753],"about_ca_topic_score_codex":0.0000033013275,"about_ca_topic_score_gemma":3.7323647e-7,"teacher_disagreement_score":0.9336802,"about_ca_system_score_codex":0.0000034415305,"about_ca_system_score_gemma":0.0000108756085,"threshold_uncertainty_score":0.3269968},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92161196,0.0001826891,0.074599445,0.00028403156,0.00041979118,0.000026158756,0.0000127553185,0.000009168006,0.0028539991],"genre_scores_gemma":[0.99457127,0.000019585787,0.0051776003,0.000036779387,0.00016419226,4.6615958e-7,0.0000023687985,0.000005327756,0.00002242968],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988084,0.00006395948,0.00052296655,0.00011254155,0.0003935103,0.00009865767],"domain_scores_gemma":[0.9984776,0.0001862331,0.00069344754,0.00015905463,0.00041153625,0.00007217847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034579178,0.00010338008,0.00022065622,0.00009408415,0.000018106586,0.000037084308,0.0009845999,0.000046717534,0.000056097313],"category_scores_gemma":[0.00009590412,0.000091194284,0.00017670568,0.00012783232,0.00007053613,0.00038533955,0.00007686378,0.00020263193,0.000002194682],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013766515,0.0009377545,0.00033815764,0.00013974943,0.00033880808,0.00029274984,0.00058460416,0.00029492658,0.575545,0.41810775,0.00016363346,0.003119175],"study_design_scores_gemma":[0.0006315296,0.00013011177,0.00021866805,0.00028961542,0.000020269434,0.00081392296,0.000121351906,0.009341685,0.92170095,0.0662516,0.0003544901,0.00012579953],"about_ca_topic_score_codex":0.000004619906,"about_ca_topic_score_gemma":1.5412998e-7,"teacher_disagreement_score":0.35185617,"about_ca_system_score_codex":0.00003526648,"about_ca_system_score_gemma":0.00014401528,"threshold_uncertainty_score":0.37187952},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17776643,0.0011271371,0.81715983,0.0003682157,0.00069247413,0.0004206541,0.000027221777,0.00007572409,0.0023623332],"genre_scores_gemma":[0.9580466,0.00003234243,0.041322976,0.000055233864,0.000038724666,0.0000033306426,0.0000013464341,0.0000061203264,0.0004933112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991233,0.0001305717,0.00026648628,0.00016669437,0.00016453127,0.0001484341],"domain_scores_gemma":[0.9992187,0.00013523975,0.00012255968,0.0003943221,0.00008685052,0.000042326672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048244305,0.00008873981,0.00014886008,0.000042390122,0.00010412354,0.000012849247,0.00029765305,0.00005716677,0.000019980585],"category_scores_gemma":[0.00016597359,0.00006234096,0.00008835476,0.000270555,0.000111901514,0.00012809454,0.00010978371,0.00009982697,0.0000066164266],"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.000018269015,0.00021817365,0.0006836651,0.00010737941,0.00003920654,0.0000010993826,0.0012942704,0.0006728796,0.013755198,0.96908885,0.0001253624,0.0139956325],"study_design_scores_gemma":[0.0022337679,0.00015812258,0.0014447242,0.00008552749,0.000060150152,0.00003207125,0.00015199593,0.6356687,0.31326163,0.036150493,0.010386056,0.00036678533],"about_ca_topic_score_codex":0.000015953237,"about_ca_topic_score_gemma":0.0000018698901,"teacher_disagreement_score":0.9329384,"about_ca_system_score_codex":0.000004106539,"about_ca_system_score_gemma":0.000049163376,"threshold_uncertainty_score":0.25421906},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010676594,0.0006538978,0.97116727,0.015722496,0.00004152164,0.0009881598,0.0000723664,0.00013543952,0.0005422845],"genre_scores_gemma":[0.9493841,0.00047430178,0.03738609,0.0017443972,0.00094552856,0.0017443192,0.0001307135,0.000034723755,0.008155804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991738,0.000042248907,0.00017221001,0.00028993722,0.000110022476,0.0002117886],"domain_scores_gemma":[0.9993265,0.000095388175,0.000036664136,0.00040510888,0.00006508962,0.00007120606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032098754,0.0001067042,0.00010018379,0.000031662006,0.0006377479,0.00011663423,0.00038069303,0.00005526439,0.00010328667],"category_scores_gemma":[0.0000065665845,0.00007974787,0.000053867156,0.00030516012,0.000028590885,0.00017590355,0.00003203693,0.00008452651,0.000069156915],"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.000009451414,0.00011268163,9.593015e-7,0.00002881264,0.000016293468,2.537908e-7,0.00091647106,0.00005537138,0.0004453387,0.95119977,0.0007652748,0.04644932],"study_design_scores_gemma":[0.00069332944,0.00007278848,0.00012455216,0.000013121545,0.000031261818,0.000017032582,0.00008521465,0.4240204,0.0020189937,0.044314057,0.5283534,0.00025584086],"about_ca_topic_score_codex":0.0000017472806,"about_ca_topic_score_gemma":0.0000032615649,"teacher_disagreement_score":0.93870753,"about_ca_system_score_codex":0.0000067873502,"about_ca_system_score_gemma":0.000025453712,"threshold_uncertainty_score":0.49051058},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02551152,0.00836398,0.9229056,0.03739471,0.00022626894,0.0023432137,0.00022644649,0.00014696644,0.0028812517],"genre_scores_gemma":[0.98557323,0.0006725614,0.010084827,0.0011464163,0.0005598212,0.0001169984,0.00002590713,0.000016610247,0.001803637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982912,0.00012546396,0.00046717608,0.00050865224,0.00024196012,0.00036553413],"domain_scores_gemma":[0.99854285,0.0002208734,0.00018010451,0.0006490156,0.00016916535,0.00023801386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005479884,0.00022753952,0.00025582986,0.00012452385,0.0007697991,0.00016651119,0.0005603786,0.00013418721,0.000046109],"category_scores_gemma":[0.000055070795,0.00018918536,0.00007842331,0.0007605748,0.00011548694,0.00027923504,0.00019777982,0.00023067373,0.00012908358],"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.000008285989,0.00013177076,0.000009912906,0.00004095156,0.000022558324,8.173097e-7,0.0014325012,0.000087428525,0.001120345,0.8552947,0.00035801763,0.14149271],"study_design_scores_gemma":[0.0019350378,0.001026599,0.01356322,0.00030048378,0.00041311193,0.00015188957,0.0007898687,0.51987386,0.0045707603,0.24392278,0.21193765,0.0015147625],"about_ca_topic_score_codex":0.00001818467,"about_ca_topic_score_gemma":0.000010339143,"teacher_disagreement_score":0.9600617,"about_ca_system_score_codex":0.000015175582,"about_ca_system_score_gemma":0.000078722696,"threshold_uncertainty_score":0.77147555},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005028745,0.00011464532,0.9928316,0.0003157548,0.000067593566,0.0006749063,0.000010282322,0.00014860342,0.00080786436],"genre_scores_gemma":[0.8021034,0.000047903814,0.19271195,0.0006580636,0.0008856972,0.0016602704,0.00004594549,0.000025731864,0.0018610419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993653,0.00003318372,0.0001352376,0.00026463217,0.00006276647,0.00013882901],"domain_scores_gemma":[0.99935895,0.00007965091,0.000049529383,0.00034665025,0.00005984618,0.000105370884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022305186,0.00007839589,0.00009560868,0.000037299706,0.0002056314,0.000105457795,0.0003398479,0.000042911663,0.0000030706524],"category_scores_gemma":[0.000009587827,0.00006909877,0.000020550384,0.00014190727,0.000019157958,0.00023658489,0.000043111097,0.0000460819,0.00004362354],"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":[7.712884e-7,0.000031828524,0.000010681218,0.00004612864,0.0000034303455,3.2754915e-8,0.00008856965,0.00006342907,0.0007929405,0.9905225,0.00013417477,0.008305498],"study_design_scores_gemma":[0.0002801474,0.000113714654,0.00003717129,0.000009992947,0.000008954979,0.000004521792,0.000021918497,0.7828731,0.0012923935,0.05264009,0.16256538,0.0001526195],"about_ca_topic_score_codex":0.000003090098,"about_ca_topic_score_gemma":0.0000011012781,"teacher_disagreement_score":0.9378824,"about_ca_system_score_codex":0.000004424468,"about_ca_system_score_gemma":0.00001621121,"threshold_uncertainty_score":0.2817766},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36516854,0.00004891482,0.63395447,0.0001569463,0.000075479584,0.000071980045,2.3544143e-7,0.0000099739445,0.00051345315],"genre_scores_gemma":[0.92644626,0.0000030407891,0.073204346,0.00003378909,0.00026077704,4.7642106e-7,2.9046632e-8,0.00000565922,0.00004563368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986682,0.00009557928,0.000566893,0.00008603175,0.00045452925,0.00012876434],"domain_scores_gemma":[0.9988839,0.00016146972,0.0004386691,0.0002843677,0.00015553468,0.00007604759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007388263,0.000090532696,0.00033363746,0.000043987828,0.00003601928,0.00004330481,0.00063039316,0.000024261322,0.000027616361],"category_scores_gemma":[0.00006910389,0.00006583849,0.00013857332,0.00018226574,0.000029672616,0.0003991519,0.0001063804,0.00015186534,0.000028128412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046425925,0.013213204,0.000049841063,0.00021338277,0.00040835678,0.00016941437,0.010462252,0.0028558036,0.009694469,0.7754082,0.0006051264,0.1868735],"study_design_scores_gemma":[0.0013122297,0.0009948821,0.000102634905,0.00011993159,0.00009707909,0.00017474117,0.00037531482,0.02378263,0.022756295,0.94992065,0.00017247877,0.00019114245],"about_ca_topic_score_codex":1.557191e-7,"about_ca_topic_score_gemma":3.170795e-8,"teacher_disagreement_score":0.5612777,"about_ca_system_score_codex":0.000015664353,"about_ca_system_score_gemma":0.000035106463,"threshold_uncertainty_score":0.26848158},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007868936,0.0000695786,0.98194844,0.00032347068,0.0005952941,0.00079535646,0.00001783534,0.000051179013,0.008329924],"genre_scores_gemma":[0.033708185,0.000038413546,0.9641164,0.00023359645,0.0012546191,0.000017244853,0.0000015839802,0.000057323814,0.0005726475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970518,0.00005451869,0.0014311052,0.0003116886,0.0006349184,0.00051598577],"domain_scores_gemma":[0.99544454,0.0011632856,0.0018667941,0.0007258274,0.00039779302,0.00040174424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0041952375,0.00037529686,0.0008108222,0.00024483184,0.00023966498,0.00039926777,0.0015744609,0.00020771919,0.00004069048],"category_scores_gemma":[0.00026622185,0.00030969374,0.00030981438,0.00034283474,0.00011426169,0.00048578405,0.00018746866,0.000425488,0.0000989201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008703493,0.0016403336,0.000002992853,0.0017363387,0.00012295003,0.000011343577,0.00851221,0.0015865322,0.0053858915,0.95223564,0.004158535,0.024520209],"study_design_scores_gemma":[0.0016543886,0.0014834813,0.000001837444,0.00027608118,0.00021107678,0.00023516256,0.00069324294,0.3440246,0.0038099133,0.63545436,0.011748488,0.00040733605],"about_ca_topic_score_codex":7.6376057e-7,"about_ca_topic_score_gemma":0.0000015053535,"teacher_disagreement_score":0.34243807,"about_ca_system_score_codex":0.00007102502,"about_ca_system_score_gemma":0.00025017577,"threshold_uncertainty_score":0.9999355},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02251615,0.0020589868,0.9674658,0.0013950946,0.000028976527,0.0011807068,0.00006251665,0.0002609316,0.00503084],"genre_scores_gemma":[0.8948407,0.0013501876,0.09984146,0.00013876549,0.00046565227,0.0008544171,0.000028305958,0.000031710613,0.0024487833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894875,0.000042999156,0.00028588128,0.0003558053,0.00016492433,0.00020160738],"domain_scores_gemma":[0.9990324,0.00015839684,0.00014152686,0.0004567073,0.00008838339,0.0001225916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016252781,0.0001415178,0.00018813644,0.000101850484,0.00024936366,0.000051833387,0.00045287918,0.00006221028,0.0000562846],"category_scores_gemma":[0.000007242234,0.000120968034,0.000046308898,0.00051714614,0.00007471557,0.00022737589,0.00009575958,0.00010684585,0.000059041588],"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.0000048888996,0.00013785093,0.00006902555,0.000040027266,0.000024931178,6.9120017e-7,0.00028803805,0.000052072344,0.0018693412,0.96889114,0.00012393737,0.028498052],"study_design_scores_gemma":[0.0035941813,0.0007579107,0.0023794544,0.00013377289,0.00026876375,0.00022901883,0.0006217827,0.54520416,0.0666235,0.11684317,0.2610522,0.0022920491],"about_ca_topic_score_codex":0.000021649485,"about_ca_topic_score_gemma":0.0000025516902,"teacher_disagreement_score":0.8723246,"about_ca_system_score_codex":0.000011467626,"about_ca_system_score_gemma":0.00003264933,"threshold_uncertainty_score":0.49329334},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09222944,0.0009521837,0.89301735,0.0017288226,0.00005968857,0.0008363828,0.000016865974,0.0001394866,0.011019769],"genre_scores_gemma":[0.96486056,0.000091725786,0.033866383,0.00015755238,0.000080104495,0.00017262835,0.0000031549328,0.0000054994725,0.0007624146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994486,0.00002209672,0.00017430463,0.00018202081,0.000073170115,0.00009979509],"domain_scores_gemma":[0.99940896,0.00010867715,0.000082978535,0.00023392637,0.00010441512,0.000061013383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000089155,0.00007086215,0.000103813865,0.000047574336,0.00007275685,0.000045762998,0.00034641853,0.000030614316,0.000091080336],"category_scores_gemma":[0.000014483551,0.000058502206,0.00003079144,0.0002527026,0.000033322984,0.0003207715,0.00013819108,0.000053316806,0.00019740735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.083877e-7,0.000045495413,0.000010976647,0.000025100057,0.000011533826,1.2171473e-7,0.00035179176,0.0000059026847,0.002003,0.9638506,0.00014320442,0.033551622],"study_design_scores_gemma":[0.000728992,0.00028257284,0.0033170143,0.00007309081,0.00003772664,0.000030531915,0.00035976758,0.28323072,0.07759037,0.608953,0.024742963,0.00065322866],"about_ca_topic_score_codex":0.000009827379,"about_ca_topic_score_gemma":4.2705173e-7,"teacher_disagreement_score":0.8726311,"about_ca_system_score_codex":0.0000028863249,"about_ca_system_score_gemma":0.000013306894,"threshold_uncertainty_score":0.2537338},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8640653,0.0010771907,0.12294288,0.0076712077,0.00010402599,0.0010309401,0.00003700889,0.00016394882,0.0029075076],"genre_scores_gemma":[0.9878777,0.00011229457,0.01016758,0.00051833346,0.00022055524,0.000085352665,0.0000078376015,0.000012405224,0.0009978916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914515,0.00008092058,0.00018028932,0.0002736394,0.00017188558,0.0001480967],"domain_scores_gemma":[0.9990093,0.000072025476,0.000075558644,0.0006924594,0.000047674144,0.00010298577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024773428,0.00010455017,0.000103178296,0.00004385841,0.00030622774,0.00009107964,0.0005763242,0.000044725595,0.00013000348],"category_scores_gemma":[0.000008261291,0.0000731976,0.000036961963,0.0002134657,0.000052829386,0.00024372272,0.000061225146,0.00010596479,0.000068194444],"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.0000020491634,0.00021009902,0.000006857619,0.0000073937413,0.000008173851,5.689382e-7,0.00058109546,0.00009223403,0.0018468527,0.9841623,0.0001469012,0.012935524],"study_design_scores_gemma":[0.00036432443,0.00049935456,0.00056712463,0.000024077006,0.000029849656,0.000038322312,0.0002896319,0.8549797,0.01928273,0.06701301,0.05657584,0.00033601222],"about_ca_topic_score_codex":0.00000419146,"about_ca_topic_score_gemma":5.4787813e-7,"teacher_disagreement_score":0.91714925,"about_ca_system_score_codex":0.0000089063915,"about_ca_system_score_gemma":0.0000101309615,"threshold_uncertainty_score":0.29849115},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80015385,0.0028097935,0.18615007,0.0054914267,0.00014791539,0.0015372923,0.0001364381,0.00006986515,0.0035033587],"genre_scores_gemma":[0.9971399,0.000017834265,0.002502347,0.000057766956,0.00004287545,0.000032465403,0.000009317708,0.0000022168235,0.00019529987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995185,0.000048532416,0.00017063557,0.000094678486,0.00010333287,0.00006431635],"domain_scores_gemma":[0.9994437,0.0001963658,0.000090257476,0.00020482382,0.000055880384,0.000008978177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014770377,0.000044664474,0.00006513961,0.000031121497,0.000096952856,0.000015921478,0.00031193378,0.000020063328,0.000010916735],"category_scores_gemma":[0.00001540307,0.000027973687,0.000021870132,0.0004308742,0.00005774258,0.000092597904,0.000050466835,0.000054189863,0.0000040416508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014836859,0.000043062697,0.00026302706,0.00001531414,0.0000024869626,1.110078e-7,0.0002971931,0.000103216655,0.0012110214,0.99757415,0.00008670249,0.0004022579],"study_design_scores_gemma":[0.0011899768,0.000171372,0.10130765,0.00009639396,0.00005502332,0.00004356392,0.00078731275,0.0726333,0.066013426,0.7101432,0.047136787,0.00042198895],"about_ca_topic_score_codex":0.00001342262,"about_ca_topic_score_gemma":0.000003095519,"teacher_disagreement_score":0.28743094,"about_ca_system_score_codex":0.0000030884908,"about_ca_system_score_gemma":0.000030424853,"threshold_uncertainty_score":0.11407338},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07592845,0.00012208271,0.91930187,0.0010671559,0.00029603622,0.0008953052,0.000014565831,0.00013849071,0.0022360717],"genre_scores_gemma":[0.72799146,0.000015980322,0.26956487,0.00022654365,0.00013414735,0.000054916196,0.000007756389,0.000025984551,0.0019783292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852747,0.00004511853,0.00045719868,0.0003703126,0.00032038725,0.00027950463],"domain_scores_gemma":[0.9977017,0.0012170697,0.00026331795,0.00052116835,0.00021236677,0.00008434372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011151223,0.0001910225,0.0002945673,0.00018250111,0.00014453776,0.0000617636,0.00036881614,0.00005502404,0.00004737832],"category_scores_gemma":[0.0007702617,0.00016168247,0.000082093495,0.00036213498,0.00009704815,0.00039151363,0.0000923744,0.00006697084,0.000062019244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006456718,0.00020321437,0.00002553737,0.0004951051,0.000036790218,0.0000034525249,0.0016184583,0.000036430192,0.0012245725,0.9870269,0.0010238911,0.008241101],"study_design_scores_gemma":[0.0024042227,0.000851167,0.0003409189,0.0004537516,0.00012344598,0.00006325509,0.0016849672,0.0848672,0.045818705,0.8581816,0.0043065916,0.00090415194],"about_ca_topic_score_codex":0.000009242494,"about_ca_topic_score_gemma":0.000008920183,"teacher_disagreement_score":0.652063,"about_ca_system_score_codex":0.000019243169,"about_ca_system_score_gemma":0.0000480715,"threshold_uncertainty_score":0.65932196},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009681067,0.0018121568,0.9618475,0.0020412614,0.025799802,0.000068464346,0.000023167238,0.0000474347,0.008263432],"genre_scores_gemma":[0.05642043,0.0007762256,0.3179505,0.010546005,0.059718408,0.000034539415,0.0006331843,0.00023147532,0.55368924],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956418,0.00020151482,0.0012124808,0.000623206,0.001806122,0.0005148224],"domain_scores_gemma":[0.9968946,0.000090021524,0.0008028775,0.00067281566,0.0010066195,0.0005330505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011805529,0.0005102847,0.0012157214,0.0014814123,0.00041961134,0.00065550575,0.0015746653,0.00042977164,0.00026959262],"category_scores_gemma":[0.000111468384,0.00041825091,0.0019373952,0.004285478,0.00006950649,0.00070820877,0.00029722202,0.0012230432,0.00009990494],"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.00020839088,0.0005810823,0.00046467458,0.000108659726,0.013519104,0.000962588,0.00023213464,0.077076145,0.00012383805,0.03260362,0.86778694,0.00633285],"study_design_scores_gemma":[0.0015413404,0.0011417528,0.009909732,0.00063850294,0.009857444,0.0026824228,0.00006603626,0.07251283,0.000093027666,0.36863625,0.53057986,0.002340782],"about_ca_topic_score_codex":0.00008187209,"about_ca_topic_score_gemma":0.00004017582,"teacher_disagreement_score":0.643897,"about_ca_system_score_codex":0.00094810873,"about_ca_system_score_gemma":0.0013040398,"threshold_uncertainty_score":0.9998269},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8249781,0.0042337757,0.1583281,0.0027420104,0.000034414006,0.0011263412,0.000046072033,0.00040004583,0.008111122],"genre_scores_gemma":[0.90116847,0.00039552426,0.09559551,0.00041855435,0.00033785918,0.00014254493,0.000012162401,0.000020075338,0.0019092822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992128,0.00003215959,0.00015627654,0.00031668256,0.00010854356,0.00017355215],"domain_scores_gemma":[0.9994929,0.00010349037,0.000046444493,0.00022314457,0.000032131087,0.000101909616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015690515,0.000114556366,0.00013346513,0.000045587505,0.00028253166,0.000116528485,0.0002450941,0.000040941984,0.0000791899],"category_scores_gemma":[0.000004540731,0.000092478986,0.000020126392,0.00026709423,0.000052591273,0.00018091942,0.000060734787,0.00009358039,0.000054257427],"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.00008602131,0.00021659445,0.00028423857,0.0001196589,0.00007000053,0.000015019777,0.0011140922,0.00007175785,0.0010626793,0.6273243,0.00023656098,0.3693991],"study_design_scores_gemma":[0.00513347,0.0007271001,0.0060514463,0.0001055349,0.00017379114,0.00089639367,0.00025763205,0.35959366,0.0047572083,0.030162074,0.5905056,0.001636102],"about_ca_topic_score_codex":0.0000043272325,"about_ca_topic_score_gemma":7.54958e-7,"teacher_disagreement_score":0.5971622,"about_ca_system_score_codex":0.000002966776,"about_ca_system_score_gemma":0.00001487966,"threshold_uncertainty_score":0.37711838},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24423929,0.004226944,0.7469549,0.0035656125,0.000110731664,0.0004110595,0.0001362264,0.00002365839,0.0003315426],"genre_scores_gemma":[0.9429886,0.000848087,0.055169273,0.0002035033,0.0005030228,0.00007591278,0.0000033235165,0.0000076082847,0.00020069454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988808,0.00006614481,0.00066879013,0.00010457595,0.00013935864,0.00014031903],"domain_scores_gemma":[0.9984552,0.00069503137,0.00046720423,0.00015511975,0.00017105846,0.000056382953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006550849,0.00009127125,0.00025115896,0.00022090139,0.00007568771,0.000053745607,0.00033742908,0.000037841597,0.000004818033],"category_scores_gemma":[0.0000465291,0.00007458438,0.000079543875,0.00020233338,0.00006255538,0.00058009365,0.000059751696,0.00009315443,0.0000013903963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011934784,0.00006318683,0.00021427873,0.00007436207,0.000014920041,3.2878603e-7,0.0022990392,0.00015092871,0.00019009628,0.9872818,0.00006994802,0.009629164],"study_design_scores_gemma":[0.0020287882,0.0004997828,0.000868154,0.00025002024,0.000040501993,0.000061130624,0.011859421,0.008560199,0.008354187,0.92284507,0.044203464,0.00042927763],"about_ca_topic_score_codex":0.000031000378,"about_ca_topic_score_gemma":0.000014494017,"teacher_disagreement_score":0.6987493,"about_ca_system_score_codex":0.000019410258,"about_ca_system_score_gemma":0.00005744892,"threshold_uncertainty_score":0.30414626},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38167623,0.0009957178,0.614003,0.0001798744,0.00017953626,0.00010459311,0.00002293723,0.0000595555,0.0027785297],"genre_scores_gemma":[0.9913593,0.00009028599,0.006550435,0.00008924172,0.000061583705,0.000011880859,0.0000054165034,0.000005304779,0.0018265371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992481,0.00011405946,0.00020177056,0.00018559051,0.00010048769,0.0001499825],"domain_scores_gemma":[0.99936897,0.00020739326,0.000045378285,0.00021391435,0.000080870195,0.00008348745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052401185,0.000107126056,0.00012821892,0.000108305045,0.00022488777,0.00009752469,0.00019712377,0.000048107107,0.00013121891],"category_scores_gemma":[0.00006366476,0.00008367758,0.0000384255,0.0002227517,0.00013776607,0.0004972336,0.00011569972,0.000104057006,0.0000133587055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016401433,0.00003535117,0.00038048238,0.0000071194045,0.00001654498,0.0000031271832,0.00073810644,0.000040282404,0.00068815926,0.94599587,0.000039917228,0.052038636],"study_design_scores_gemma":[0.0038939046,0.0019033744,0.008222632,0.00030774277,0.00024587606,0.000870789,0.011531561,0.3349356,0.024434645,0.57990295,0.03157148,0.0021794434],"about_ca_topic_score_codex":0.00004292457,"about_ca_topic_score_gemma":0.00000984211,"teacher_disagreement_score":0.6096831,"about_ca_system_score_codex":0.0000076033566,"about_ca_system_score_gemma":0.000038086895,"threshold_uncertainty_score":0.34122726},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025032065,0.017681006,0.108382694,0.0022272842,0.34513435,0.001141309,0.00011387417,0.0005028532,0.5223134],"genre_scores_gemma":[0.24117817,0.008715133,0.014700643,0.0053188605,0.012889013,0.000014448501,0.00019886957,0.0017287444,0.7152561],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.989264,0.0046012904,0.0021974721,0.0008692134,0.0018519587,0.0012160824],"domain_scores_gemma":[0.99387443,0.00010085088,0.0019279526,0.0017671946,0.0011245371,0.0012050463],"candidate_categories":["metaepi_narrow","open_science","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0122614615,0.00093702856,0.0014146768,0.0016288678,0.00026360858,0.0006523722,0.006788068,0.00019745444,0.000058681475],"category_scores_gemma":[0.0004864461,0.0008747277,0.00056422374,0.001958371,0.000106986234,0.00079760834,0.001795454,0.0034368443,0.0011320589],"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.00003779914,0.00057928875,0.000080415026,0.00007036234,0.000082733735,0.0063655768,0.0010964852,0.00003114762,0.0000060330894,0.09214686,0.8967022,0.0028011387],"study_design_scores_gemma":[0.002269272,0.001468019,0.0011713238,0.0007244243,0.000065599546,0.00046311316,0.00013507436,0.0006886633,0.000017229218,0.028783215,0.9631634,0.0010506903],"about_ca_topic_score_codex":0.0000072628513,"about_ca_topic_score_gemma":0.0000037629145,"teacher_disagreement_score":0.33224532,"about_ca_system_score_codex":0.00036757762,"about_ca_system_score_gemma":0.00060497737,"threshold_uncertainty_score":0.99964565},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0093533965,0.00056140625,0.9872001,0.00041963832,0.000059874325,0.000523805,0.000009416387,0.00011497119,0.0017574052],"genre_scores_gemma":[0.9749523,0.000049574766,0.023587354,0.0005549847,0.00017840679,0.00010302224,0.000007579908,0.000016130736,0.0005506375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990011,0.000016711352,0.00020842624,0.00040313468,0.0001321062,0.00023851499],"domain_scores_gemma":[0.99884623,0.00050536427,0.00007985882,0.00032233013,0.000055575598,0.0001906341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034292525,0.00014496986,0.00014148642,0.00012382666,0.00035431545,0.00014567081,0.00048041902,0.00006054351,0.000013394723],"category_scores_gemma":[0.000052716245,0.0001295774,0.000020646923,0.00038383523,0.00006114035,0.00021133841,0.00027537215,0.00013557293,0.00007887532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008234245,0.000047586822,0.0000034242744,0.000015375637,0.0000064388364,0.0000020548694,0.000112616384,0.00002664718,0.00017647447,0.98044366,0.000028786304,0.01912872],"study_design_scores_gemma":[0.0020105257,0.0009294568,0.0015680491,0.00012796669,0.0001018442,0.00025581435,0.0002325682,0.24805868,0.0016911072,0.71855116,0.025117114,0.0013557341],"about_ca_topic_score_codex":0.0000044752155,"about_ca_topic_score_gemma":0.0000025393715,"teacher_disagreement_score":0.96559894,"about_ca_system_score_codex":0.000009360737,"about_ca_system_score_gemma":0.000025066809,"threshold_uncertainty_score":0.5284013},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38710484,0.0048486204,0.4976477,0.02217831,0.0002676579,0.0026021767,0.00012237777,0.00059377257,0.08463455],"genre_scores_gemma":[0.9964412,0.00044245168,0.002156795,0.00024610586,0.00006211043,0.00006582141,0.0000012866657,0.000003958649,0.0005802995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950826,0.000026476038,0.000119130455,0.0001585338,0.000098924895,0.000088670655],"domain_scores_gemma":[0.9992771,0.00026573587,0.00006079629,0.00031451773,0.000043813263,0.000038042417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010565859,0.000060434922,0.00006792467,0.000029318784,0.00014990297,0.000030697505,0.00039679685,0.000025474938,0.00008689306],"category_scores_gemma":[0.0000168817,0.000039995197,0.000023554867,0.00027254273,0.000041567175,0.000094080824,0.000062252264,0.0000648513,0.00011068965],"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":[5.197376e-7,0.000031741907,0.000008810433,0.000008377943,0.000004234774,1.983515e-7,0.0001559216,0.0000071082522,0.00016907023,0.99152184,0.000298208,0.007793946],"study_design_scores_gemma":[0.0006598396,0.0003730246,0.0012419339,0.00008046519,0.00004353976,0.000033783304,0.00024232193,0.5378522,0.02226936,0.35620117,0.080358714,0.00064359023],"about_ca_topic_score_codex":0.000004636402,"about_ca_topic_score_gemma":5.5074895e-7,"teacher_disagreement_score":0.63532066,"about_ca_system_score_codex":0.0000025443487,"about_ca_system_score_gemma":0.000005130428,"threshold_uncertainty_score":0.16309568},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007981091,0.0002643545,0.94321364,0.005389782,0.000017862889,0.0015257519,0.000011307811,0.000058966638,0.04153727],"genre_scores_gemma":[0.6339888,0.000076549644,0.365513,0.00024474208,0.00000725265,0.00012681758,0.000008340211,0.000009853481,0.000024625684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988595,0.000165538,0.00048075174,0.00018533607,0.0001749762,0.00013386761],"domain_scores_gemma":[0.9969604,0.001255881,0.00028574184,0.0014045001,0.00005655536,0.00003689233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012375583,0.00017375319,0.00034185097,0.00008477308,0.00028201466,0.00008286997,0.0012545474,0.00006209803,0.0000013785575],"category_scores_gemma":[0.000021256716,0.00009958689,0.000096387965,0.00025468256,0.00047660235,0.00007873829,0.00030861452,0.0002233396,0.0000012160156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003602712,0.00023090553,0.0000010343228,0.00019721974,0.00004726963,2.4176034e-8,0.0060696625,0.0000918183,0.00017795128,0.981243,0.000025208587,0.011879882],"study_design_scores_gemma":[0.0010467027,0.0002027171,0.000014477934,0.00032564776,0.00007980336,0.000013246024,0.0002959698,0.14630799,0.0018781853,0.8489088,0.0007551131,0.00017134284],"about_ca_topic_score_codex":0.0000049308096,"about_ca_topic_score_gemma":0.000002768729,"teacher_disagreement_score":0.62600774,"about_ca_system_score_codex":0.0000068665654,"about_ca_system_score_gemma":0.000013827715,"threshold_uncertainty_score":0.40610355},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051648496,0.005674728,0.99088705,0.0004448738,0.00018081766,0.0017351978,0.00014980343,0.00013601998,0.0002750525],"genre_scores_gemma":[0.04366392,0.0021662978,0.94700116,0.00036559204,0.0010260104,0.0035055534,0.000065321066,0.00006736762,0.0021387963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977848,0.00006591238,0.0005056223,0.000835713,0.00025266877,0.0005552722],"domain_scores_gemma":[0.99839514,0.00036141687,0.00021545753,0.0005270392,0.00015823424,0.00034271728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000462683,0.0003395779,0.0004436751,0.00022706945,0.000678169,0.0004225121,0.0004671378,0.00012505094,0.0000097673565],"category_scores_gemma":[0.00001703935,0.00031318804,0.00010503122,0.0005704588,0.00016761283,0.00040439176,0.00021331324,0.00016971838,0.000022685303],"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.000007661918,0.00030896676,0.000044282096,0.00011864205,0.000117774114,0.000008213941,0.00033317195,0.0008749604,0.000099446544,0.42618594,0.0006239083,0.571277],"study_design_scores_gemma":[0.0013323053,0.00010957713,0.000098320495,0.000024736773,0.000047812886,0.00012729656,0.0000492417,0.94234556,0.000019218158,0.014352325,0.04107183,0.00042178578],"about_ca_topic_score_codex":0.00007598074,"about_ca_topic_score_gemma":0.0000010981942,"teacher_disagreement_score":0.94147056,"about_ca_system_score_codex":0.000043109612,"about_ca_system_score_gemma":0.000026124932,"threshold_uncertainty_score":0.999932},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46886078,0.0010763217,0.5236797,0.0018266343,0.0011845997,0.0012605906,0.000032050182,0.00054015213,0.0015392281],"genre_scores_gemma":[0.44820666,0.00010432216,0.54274863,0.0011893485,0.0014965724,0.00015586165,0.000021335612,0.00004156998,0.006035714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989545,0.00003308918,0.0002263766,0.00036889518,0.000095279334,0.0003218992],"domain_scores_gemma":[0.9991804,0.00018821255,0.00006334168,0.0003234956,0.000086971,0.0001576007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022483476,0.00016520328,0.0001861058,0.00007917494,0.00018971453,0.0002460855,0.00043406824,0.000088785535,0.00005097619],"category_scores_gemma":[0.000058086298,0.00013737386,0.00008976242,0.00013805598,0.00005964723,0.00035871688,0.00017098355,0.00010504247,0.00014312935],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011699216,0.00045156307,0.0009377755,0.00035666738,0.0001566235,0.000015998556,0.0024306409,0.00007414042,0.008029552,0.04685562,0.019421095,0.9211533],"study_design_scores_gemma":[0.0018508177,0.0002583499,0.00090937846,0.000020716012,0.00002194455,0.000030388124,0.000076902244,0.85092276,0.010426569,0.0045304433,0.13043556,0.0005161551],"about_ca_topic_score_codex":0.00007751709,"about_ca_topic_score_gemma":0.000004250331,"teacher_disagreement_score":0.9206372,"about_ca_system_score_codex":0.000007261641,"about_ca_system_score_gemma":0.00003229711,"threshold_uncertainty_score":0.5601944},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20289901,0.00017357816,0.7888336,0.002736426,0.00004943083,0.00040726492,0.0000071789036,0.00008731389,0.004806169],"genre_scores_gemma":[0.9950627,0.00009786082,0.003977363,0.0004310091,0.0000709494,0.000050717506,0.000003371805,0.0000032155199,0.00030278132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955803,0.000015833328,0.00013624632,0.00011297473,0.00009879272,0.00007812835],"domain_scores_gemma":[0.99945796,0.00012029767,0.00005754547,0.0002811006,0.000049626768,0.000033503857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012244597,0.000056790905,0.00006440233,0.000032266522,0.00025104664,0.000009495729,0.00028346918,0.00003495984,0.000020528456],"category_scores_gemma":[0.00001715498,0.00003729432,0.000027205515,0.00021510282,0.00003494746,0.000120903926,0.000057657046,0.000082629,0.00007886142],"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.0000013694621,0.000029664245,0.000008294408,0.0000059314757,0.000003803164,1.5495266e-7,0.00036577287,0.000045945668,0.00010644549,0.99633414,0.00016966429,0.0029288472],"study_design_scores_gemma":[0.0006037217,0.0002877718,0.0014759229,0.0000337414,0.000020213714,0.00008378322,0.00013591575,0.6222609,0.061936565,0.26267976,0.05004869,0.00043294713],"about_ca_topic_score_codex":0.0000019518232,"about_ca_topic_score_gemma":2.9248605e-7,"teacher_disagreement_score":0.7921637,"about_ca_system_score_codex":0.0000025861086,"about_ca_system_score_gemma":0.000016545731,"threshold_uncertainty_score":0.19308732},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046084687,0.0028759532,0.9441533,0.0029143577,0.00007876801,0.0012566717,0.00009146672,0.00025321686,0.002291577],"genre_scores_gemma":[0.92781395,0.0014776096,0.068622805,0.0004055771,0.0003140343,0.0003411225,0.000017750262,0.00001910628,0.0009880511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850047,0.00003797941,0.00032911354,0.00055821193,0.00020080643,0.00037342403],"domain_scores_gemma":[0.9983565,0.0007460863,0.000116010335,0.00041418156,0.00012467396,0.00024250364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045517672,0.00018767726,0.00021350174,0.00022992781,0.00037843848,0.00015204406,0.00053810177,0.00011064566,0.000012842189],"category_scores_gemma":[0.000091613845,0.00016177619,0.000062623396,0.001152595,0.00008067231,0.00048128303,0.00022389842,0.0001534625,0.0000335776],"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.0000060424154,0.000058600115,0.000063199084,0.000033328193,0.00001314718,3.8955906e-7,0.000050858253,0.000020937907,0.00015482033,0.9467188,0.000109754845,0.052770127],"study_design_scores_gemma":[0.0030706583,0.00067090016,0.006637843,0.000056774057,0.00014934353,0.00014957115,0.00020845445,0.60449076,0.0061553796,0.25849167,0.11837125,0.0015473767],"about_ca_topic_score_codex":0.000017948314,"about_ca_topic_score_gemma":0.000007550271,"teacher_disagreement_score":0.88172925,"about_ca_system_score_codex":0.000034745062,"about_ca_system_score_gemma":0.000091763715,"threshold_uncertainty_score":0.65970415},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6549045,0.0024822764,0.33187148,0.005392796,0.00011952124,0.0011364176,0.000033060885,0.00034829258,0.0037116755],"genre_scores_gemma":[0.9856634,0.000108486216,0.011363372,0.0005097417,0.00015950535,0.00020284615,0.0000062321537,0.000007857266,0.001978531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994361,0.000024572433,0.00012219985,0.00022187439,0.000063353495,0.00013193097],"domain_scores_gemma":[0.999545,0.000091673115,0.000037120906,0.00020521427,0.000033673823,0.00008736661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000067787805,0.000093305905,0.000096023185,0.000034074914,0.00016176915,0.00011812703,0.00018895011,0.000051656774,0.00006434764],"category_scores_gemma":[0.000008851001,0.00007483001,0.000017291997,0.00010997043,0.000045588873,0.0003006663,0.00013162242,0.000081137696,0.00009902949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.511512e-7,0.000024516434,0.00011390939,0.00003030469,0.000008252699,7.1409653e-7,0.0005093267,7.368395e-7,0.0010751168,0.9570359,0.0003151669,0.040885434],"study_design_scores_gemma":[0.0015105963,0.00030796602,0.011888634,0.000058644604,0.000052096773,0.00028306546,0.000545793,0.16175352,0.025702229,0.48033738,0.3160984,0.0014616768],"about_ca_topic_score_codex":0.000010241435,"about_ca_topic_score_gemma":9.517576e-7,"teacher_disagreement_score":0.4766985,"about_ca_system_score_codex":0.000002589544,"about_ca_system_score_gemma":0.000011141833,"threshold_uncertainty_score":0.30514792},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11669417,0.000120609664,0.87169856,0.00054928585,0.00022354355,0.0017095191,0.00017935225,0.000041607058,0.008783347],"genre_scores_gemma":[0.9915331,0.0000073890956,0.00786223,0.00007830465,0.0001410595,0.00013771291,7.847962e-7,0.0000052562937,0.00023418391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946165,0.000041364754,0.0001627555,0.00016465955,0.00007771998,0.00009187698],"domain_scores_gemma":[0.99917597,0.00013259385,0.00011212159,0.00045866056,0.00008522336,0.000035459154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012408636,0.00006859437,0.000092133305,0.000022555887,0.00022138283,0.00000839803,0.0004977728,0.00002789966,0.000014677468],"category_scores_gemma":[0.000026718819,0.00003844074,0.00007373155,0.00020715971,0.00006811625,0.000093542476,0.00017096323,0.000066602974,0.0000019067248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058740543,0.000093370814,0.0000022764223,0.000010733675,0.000005730755,2.0611193e-7,0.00073615025,0.000018386549,0.00047694478,0.996722,0.00008752829,0.0018408179],"study_design_scores_gemma":[0.00038299023,0.000046688037,0.00009769632,0.000022640264,0.000020428362,0.000026606043,0.00006250509,0.061419252,0.05036999,0.8869397,0.0005232984,0.00008818562],"about_ca_topic_score_codex":0.000012069372,"about_ca_topic_score_gemma":0.0000045695515,"teacher_disagreement_score":0.8748389,"about_ca_system_score_codex":0.0000028085008,"about_ca_system_score_gemma":0.000028660948,"threshold_uncertainty_score":0.17027201},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18914303,0.0057380213,0.78206736,0.015304981,0.00008527318,0.0013978225,0.00002808194,0.00039899943,0.0058364156],"genre_scores_gemma":[0.9926677,0.00021811285,0.006432011,0.00037432482,0.000054613305,0.00003333356,0.0000019536308,0.0000023445652,0.00021560208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995639,0.000037573365,0.00012839503,0.00013869644,0.000058896363,0.00007256302],"domain_scores_gemma":[0.9995541,0.000118648335,0.000048953847,0.00020241586,0.000038801216,0.000037054466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001805183,0.000055727094,0.00009747446,0.000032295888,0.00010094781,0.00003066949,0.00015003172,0.00002202434,0.0000049004625],"category_scores_gemma":[0.000017746272,0.00003585579,0.000025864852,0.00023580262,0.00007001989,0.00008890964,0.00005981102,0.00005344459,0.0000042645315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046233813,0.000024356068,0.0000036093988,0.000004795219,0.000006334156,1.7182344e-7,0.0003298824,9.760126e-7,0.00035864496,0.970691,0.000048016085,0.028527576],"study_design_scores_gemma":[0.0018838161,0.00016365429,0.0038135308,0.00003252456,0.000047827023,0.00006912266,0.000082515726,0.1107972,0.010497919,0.85364264,0.018671244,0.00029800786],"about_ca_topic_score_codex":0.0000019894044,"about_ca_topic_score_gemma":3.386281e-7,"teacher_disagreement_score":0.8035247,"about_ca_system_score_codex":9.234621e-7,"about_ca_system_score_gemma":0.0000067518076,"threshold_uncertainty_score":0.14621568},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6574414,0.0006771575,0.33713266,0.0014595295,0.000033095283,0.00065814663,0.00003950666,0.00019650969,0.0023620133],"genre_scores_gemma":[0.9679906,0.0004345004,0.030351503,0.00042822148,0.00008617503,0.0001474589,0.000020870686,0.000009771536,0.0005309382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993336,0.000019170604,0.00016129857,0.00022050772,0.00014220898,0.00012318403],"domain_scores_gemma":[0.99942535,0.00005475236,0.000090110116,0.00029176657,0.00006149164,0.00007650196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006818426,0.00009834904,0.0001326493,0.00007183524,0.0002265958,0.000016766697,0.00024526715,0.000034949207,0.000020332289],"category_scores_gemma":[0.0000063416674,0.000070631824,0.000030892494,0.00035592375,0.00005752885,0.00021451783,0.000049420545,0.000063644045,0.000030364225],"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.00001937107,0.00014725358,0.00018185547,0.00003808999,0.000028049162,0.0000027922902,0.00048593,0.00016613313,0.0007147405,0.9943545,0.00026984586,0.0035914308],"study_design_scores_gemma":[0.009083494,0.0025091856,0.01125708,0.00027162564,0.00026586212,0.00054694933,0.00069982413,0.36426127,0.26229382,0.13566233,0.21017213,0.0029764276],"about_ca_topic_score_codex":0.000005678486,"about_ca_topic_score_gemma":0.0000012299085,"teacher_disagreement_score":0.85869217,"about_ca_system_score_codex":0.000004423219,"about_ca_system_score_gemma":0.000029222918,"threshold_uncertainty_score":0.2880282},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029290665,0.0005919457,0.9643896,0.00034069206,0.000051290997,0.00032430526,0.0000068813583,0.00015280422,0.004851796],"genre_scores_gemma":[0.92668986,0.00022809356,0.07203983,0.00021237716,0.00010063913,0.0000955593,0.0000055091105,0.0000062237714,0.00062192604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995302,0.000015578635,0.000100440615,0.00020912944,0.000053342737,0.00009128441],"domain_scores_gemma":[0.9996666,0.000031526895,0.000036183108,0.00016511741,0.000034010944,0.00006659692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009090281,0.0000640336,0.0000609905,0.000037385948,0.00015716761,0.00003678769,0.00015431353,0.000034015036,0.00002322908],"category_scores_gemma":[0.000007998707,0.000055122986,0.000011049886,0.00016281761,0.000036476256,0.00024465402,0.00008204646,0.000046072535,0.000039824616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.503499e-7,0.000020776664,0.00012929841,0.000009161366,0.0000042290553,3.597576e-7,0.0005357411,6.2669534e-7,0.0007423732,0.97146624,0.000012354957,0.027077988],"study_design_scores_gemma":[0.0009167719,0.00018587812,0.010751252,0.00003272806,0.000048560894,0.000092655064,0.00026498295,0.24681309,0.049256682,0.62587994,0.064859696,0.00089777523],"about_ca_topic_score_codex":0.0000037856084,"about_ca_topic_score_gemma":7.8459476e-7,"teacher_disagreement_score":0.8973992,"about_ca_system_score_codex":0.000002119334,"about_ca_system_score_gemma":0.000009990495,"threshold_uncertainty_score":0.224785},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00931554,0.00026973497,0.6524505,0.0045382157,0.00028385984,0.00048418218,0.00001254038,0.00080547505,0.33183998],"genre_scores_gemma":[0.7302105,0.00005061385,0.26133525,0.005135578,0.00032406143,0.000036509915,0.0000063338007,0.00003665082,0.0028644996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767417,0.00015269496,0.00052007,0.0005709302,0.00047838842,0.0006037272],"domain_scores_gemma":[0.99803144,0.00039730308,0.00023432398,0.00092090585,0.000118708245,0.00029733955],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005033412,0.00034030946,0.00054439437,0.00013998167,0.00011157543,0.00025326898,0.0012519677,0.000065817076,0.00026527754],"category_scores_gemma":[0.00027586505,0.00026160473,0.00020967706,0.00043654421,0.0002868721,0.0004912229,0.00022353126,0.00029337453,0.001985342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040472572,0.0006905301,0.00007165174,0.00005931075,0.00009247117,0.00014396357,0.0024432964,0.00006943129,0.00029726548,0.9337786,0.008325805,0.053987194],"study_design_scores_gemma":[0.00030730723,0.00089910225,0.00054400245,0.00012806288,0.000047364207,0.000049101312,0.0002501845,0.14242223,0.0009910341,0.83564454,0.017908238,0.00080883177],"about_ca_topic_score_codex":0.00005268341,"about_ca_topic_score_gemma":0.0000017030461,"teacher_disagreement_score":0.72089493,"about_ca_system_score_codex":0.000049018552,"about_ca_system_score_gemma":0.000037437785,"threshold_uncertainty_score":0.9999836},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5226355,0.007800407,0.46126074,0.0034941467,0.0006158165,0.0011570811,0.000038521423,0.00029907058,0.0026987148],"genre_scores_gemma":[0.9940323,0.00015617687,0.0048841736,0.00048700997,0.000060412458,0.000039621,0.0000012035027,0.000010250829,0.00032882486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982532,0.00069792976,0.00039910735,0.00029640898,0.00015791363,0.0001953929],"domain_scores_gemma":[0.9985476,0.0007341896,0.0000935365,0.0004156973,0.00009981383,0.00010915501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012551036,0.00017879736,0.00031383484,0.00008666169,0.00031302052,0.00019251605,0.00038318,0.00006544461,0.00019919088],"category_scores_gemma":[0.00032973516,0.000103668775,0.00007962947,0.00031926224,0.00027458434,0.00031527306,0.00013912107,0.00017083448,0.000023304037],"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.000030344256,0.0000717385,0.00008192948,0.000011288702,0.00005364508,0.000003594008,0.004257078,0.000014439149,0.0003181086,0.9807334,0.00006710986,0.014357306],"study_design_scores_gemma":[0.0065857144,0.00073083484,0.0008604019,0.00015578978,0.00021958156,0.0001414594,0.0027012858,0.87692785,0.008351689,0.09921332,0.0029835443,0.0011285541],"about_ca_topic_score_codex":0.00006278789,"about_ca_topic_score_gemma":0.0000039783117,"teacher_disagreement_score":0.8815201,"about_ca_system_score_codex":0.000018450377,"about_ca_system_score_gemma":0.000031353127,"threshold_uncertainty_score":0.422749},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07858144,0.0010630413,0.9157989,0.0027510982,0.000151046,0.00056828343,0.000020550086,0.00032655502,0.0007390958],"genre_scores_gemma":[0.987636,0.00012143306,0.009331775,0.0006874152,0.00034877585,0.0002178554,0.000014703316,0.000013302538,0.0016287345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99904484,0.000043258642,0.00017999743,0.00027274727,0.00014748823,0.00031167062],"domain_scores_gemma":[0.9991195,0.00009030339,0.00006774389,0.0004751014,0.000040263003,0.00020705145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024161824,0.00013676604,0.00013526804,0.00004435001,0.00020857503,0.000073130555,0.0003815856,0.000065982924,0.00011256561],"category_scores_gemma":[0.000020363077,0.00010214476,0.000042495336,0.00025122342,0.000026151754,0.0006589482,0.00017050435,0.00010074581,0.00019624303],"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.000012246639,0.0002711035,0.0016973309,0.00006969993,0.000042990636,0.0000040221657,0.00086433464,0.000010250408,0.0018707974,0.95223826,0.000515738,0.042403195],"study_design_scores_gemma":[0.0015535466,0.00027565905,0.017850611,0.000081709244,0.00011711516,0.00016166188,0.0002756898,0.079237595,0.049794313,0.022941021,0.8262102,0.0015008448],"about_ca_topic_score_codex":0.0000033864853,"about_ca_topic_score_gemma":0.0000016893746,"teacher_disagreement_score":0.92929727,"about_ca_system_score_codex":0.000008401637,"about_ca_system_score_gemma":0.000020131598,"threshold_uncertainty_score":0.41653425},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055603576,0.000053810058,0.99277127,0.00024457215,0.00047946666,0.00059003104,0.00003633054,0.00004594909,0.0002182286],"genre_scores_gemma":[0.15048464,0.0000050333847,0.8491904,0.0000844559,0.000043742788,0.00008162782,0.000008826901,0.00001030218,0.00009093128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866855,0.000079589154,0.00051067595,0.000297855,0.00022558823,0.00021774799],"domain_scores_gemma":[0.99737567,0.0017742717,0.00025271912,0.00024825215,0.00028359485,0.000065502754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010544644,0.00015557284,0.00025360385,0.00020112428,0.00009136067,0.00004256637,0.00049404276,0.000053376538,0.000008134602],"category_scores_gemma":[0.0003638957,0.00015105506,0.000064728774,0.00032096778,0.0000530044,0.00066311075,0.00013192561,0.00013676556,0.0000061988108],"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.0000166563,0.00014288431,0.000008165929,0.0000939893,0.000008873956,4.801723e-7,0.0018964673,0.035595275,0.0012459654,0.62938756,0.0000107719525,0.3315929],"study_design_scores_gemma":[0.00024244828,0.000059469105,0.00014942663,0.000030158819,0.000002352899,0.000003831955,0.00003701155,0.5705898,0.0023126476,0.42632204,0.00014546682,0.000105359264],"about_ca_topic_score_codex":0.000002127391,"about_ca_topic_score_gemma":0.000016203165,"teacher_disagreement_score":0.5349945,"about_ca_system_score_codex":0.00003169285,"about_ca_system_score_gemma":0.000078873105,"threshold_uncertainty_score":0.6159847},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0332518,0.000102902086,0.78135395,0.0018482166,0.00026208945,0.0003223277,0.00001666527,0.0008254911,0.18201658],"genre_scores_gemma":[0.8529402,0.000015751826,0.14534938,0.0007349332,0.00008482184,0.000024523999,0.000001689632,0.000018300561,0.0008304128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843425,0.0001099687,0.00031903625,0.00039059302,0.0003241351,0.00042200723],"domain_scores_gemma":[0.99840164,0.00016673368,0.00014012694,0.00091249845,0.00007110038,0.0003078748],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030002615,0.00019701265,0.0003114139,0.000072364855,0.00012958709,0.00014801271,0.0011082495,0.000038381462,0.00090882805],"category_scores_gemma":[0.00007542534,0.0001614061,0.00007193615,0.00076158065,0.00029960694,0.0005974816,0.00011087779,0.0001560533,0.0016382977],"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.0000034080851,0.00031129844,0.000038789756,0.00002008091,0.00001773049,0.00004685756,0.0010694036,0.00007442858,0.00017246285,0.9758568,0.00077932334,0.021609442],"study_design_scores_gemma":[0.00017848816,0.00038538728,0.00012969652,0.000017436601,0.000010251762,0.000016678789,0.0002374099,0.6421276,0.0006482336,0.3529042,0.0029887515,0.00035592288],"about_ca_topic_score_codex":0.000013074002,"about_ca_topic_score_gemma":0.0000010745176,"teacher_disagreement_score":0.8196884,"about_ca_system_score_codex":0.000024073155,"about_ca_system_score_gemma":0.000016033362,"threshold_uncertainty_score":0.9991391},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083162844,0.00020858372,0.9089719,0.00075321743,0.000075162614,0.00023372051,0.000004611043,0.00026525138,0.0063247313],"genre_scores_gemma":[0.8620816,0.0000036075219,0.13647918,0.00004383432,0.00019990702,0.000032077234,0.000009336185,0.0000106746675,0.0011397998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900496,0.000062135165,0.0002651338,0.00030920233,0.00018011271,0.00017847579],"domain_scores_gemma":[0.99922353,0.0001577173,0.00014509157,0.000360399,0.00005944437,0.00005382151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004374794,0.00013640294,0.00016966427,0.000116447336,0.00026988663,0.00013319691,0.000294106,0.00007591328,0.00002702305],"category_scores_gemma":[0.000053379263,0.000120105804,0.00004206481,0.00028383787,0.000035591496,0.0005744831,0.00022164421,0.00011079325,0.00006033553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007199101,0.000153214,0.0035955042,0.00008160439,0.000051019215,0.000003856945,0.0012234806,0.000023890578,0.0047516115,0.9061882,0.0033339807,0.080586426],"study_design_scores_gemma":[0.0016176633,0.00020709625,0.023212675,0.000117158685,0.00007005619,0.00010459897,0.000097620425,0.4594932,0.007948091,0.4884357,0.017892381,0.0008037887],"about_ca_topic_score_codex":0.000032765212,"about_ca_topic_score_gemma":0.000002408657,"teacher_disagreement_score":0.77891874,"about_ca_system_score_codex":0.000016726453,"about_ca_system_score_gemma":0.000013299427,"threshold_uncertainty_score":0.48977724},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07556864,0.000104368475,0.9233484,0.00030943291,0.00017230297,0.00004140963,0.0000020252432,0.0000073642636,0.0004460082],"genre_scores_gemma":[0.6137076,0.0000043245686,0.38619727,0.000034603756,0.000040305564,3.8830663e-7,3.8781755e-7,0.0000030136246,0.000012102672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858415,0.000093589384,0.0007566992,0.000062859624,0.0004269626,0.00007576266],"domain_scores_gemma":[0.996942,0.0012119075,0.0010663467,0.00011514094,0.0006177791,0.00004685923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000729578,0.00008007214,0.00038521772,0.00014040997,0.000033062286,0.000014812062,0.00038213245,0.000024496916,0.000007447883],"category_scores_gemma":[0.0001800989,0.00006248162,0.00012911085,0.0001891752,0.00008740778,0.00021081751,0.000051499872,0.00008859939,0.0000032466646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015915286,0.00043243432,0.00006410786,0.00048251273,0.0002732231,0.000004008229,0.0030635016,0.17921062,0.00048048072,0.81098646,0.0004101023,0.004576636],"study_design_scores_gemma":[0.0003809403,0.00024787808,0.00030815348,0.00018905356,0.000023700199,0.0001343974,0.00011104325,0.30331805,0.0019265478,0.6932105,0.00008240849,0.00006734757],"about_ca_topic_score_codex":1.5374769e-7,"about_ca_topic_score_gemma":2.0586867e-8,"teacher_disagreement_score":0.538139,"about_ca_system_score_codex":0.000015820622,"about_ca_system_score_gemma":0.000054222422,"threshold_uncertainty_score":0.25479263},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038488965,0.0000731186,0.95825744,0.0020354555,0.000040069954,0.00025346107,0.00001047394,0.0000899249,0.000751087],"genre_scores_gemma":[0.99057204,0.000030696705,0.008157087,0.0006132708,0.00010712315,0.000084576204,0.000008406786,0.0000090629665,0.00041772498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919647,0.00005498186,0.00017836053,0.00027953883,0.00014062141,0.00015002245],"domain_scores_gemma":[0.9991365,0.00014153626,0.00008617643,0.00048189622,0.000071470575,0.00008241658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020452366,0.00010590117,0.00013949364,0.00005003648,0.00010785936,0.00003171241,0.0003191316,0.00005290719,0.000025312265],"category_scores_gemma":[0.00004173496,0.000086315566,0.000035507674,0.00023284387,0.000024133746,0.00016420498,0.000097368364,0.00008238693,0.00006127884],"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.0000051558645,0.000090629044,0.00008814097,0.00003743428,0.000009931896,4.8545155e-7,0.00019407617,0.000062458166,0.002078341,0.95571893,0.000045378347,0.041669022],"study_design_scores_gemma":[0.001664356,0.00061925786,0.004307624,0.00013109182,0.00006336958,0.00001999045,0.000057036035,0.4779878,0.12368548,0.08821715,0.30236998,0.0008768719],"about_ca_topic_score_codex":0.0000043959553,"about_ca_topic_score_gemma":0.0000015455072,"teacher_disagreement_score":0.9520831,"about_ca_system_score_codex":0.0000042474285,"about_ca_system_score_gemma":0.000014818078,"threshold_uncertainty_score":0.35198468},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6712091,0.03165034,0.28886893,0.004325696,0.00044910028,0.0006815989,0.000013945776,0.00009474858,0.0027065647],"genre_scores_gemma":[0.90803516,0.00021813028,0.091312155,0.00016480386,0.000033799377,0.000012639494,6.2842906e-7,0.0000031664847,0.00021952947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991656,0.00007856627,0.00019491835,0.00020677649,0.00019044883,0.00016369461],"domain_scores_gemma":[0.9993663,0.0002696651,0.00008003516,0.000226485,0.00002658228,0.000030955907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006178028,0.00008748446,0.00015283596,0.00011390246,0.00009497642,0.000018677769,0.0003400733,0.000025020427,0.000010821668],"category_scores_gemma":[0.000023708786,0.000057417128,0.000031792744,0.0003732644,0.00017221022,0.00054855656,0.0004013103,0.000099445635,0.000003211926],"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.00007264589,0.00032823902,0.0032096696,0.00007103709,0.00001896999,0.000007597062,0.0012489298,0.0104533,0.00072122377,0.53119487,0.000037362384,0.45263615],"study_design_scores_gemma":[0.01837166,0.0010236527,0.019179111,0.0006127785,0.0000389625,0.0002003062,0.00038993973,0.48494372,0.072132654,0.32669556,0.07489421,0.0015174416],"about_ca_topic_score_codex":0.000010044037,"about_ca_topic_score_gemma":0.000013351937,"teacher_disagreement_score":0.47449043,"about_ca_system_score_codex":0.000014496448,"about_ca_system_score_gemma":0.000012186421,"threshold_uncertainty_score":0.23414025},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4799178,0.00014096888,0.51866686,0.000057004974,0.00003599166,0.00007898129,1.2698469e-7,0.000004696374,0.0010975385],"genre_scores_gemma":[0.38185164,0.000043117594,0.6180426,0.00003766037,0.000019062189,6.4045076e-7,1.1063955e-8,0.0000022945426,0.0000029468295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985724,0.000008191569,0.0005068091,0.00020960686,0.000517758,0.000185225],"domain_scores_gemma":[0.9983112,0.0010268947,0.00031699886,0.00016508925,0.0000688267,0.00011098685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008377963,0.0001084422,0.00025090776,0.0002838095,0.00012515599,0.00021042631,0.00043808058,0.000042349006,0.0000059851327],"category_scores_gemma":[0.000070660986,0.000059813996,0.000027116219,0.0004784045,0.00025069682,0.00036195276,0.00015241737,0.00013389219,0.0000016163035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012120155,0.00012393444,0.00009126117,0.000032303327,0.000004220197,0.00002313465,0.0018002139,0.000062830986,0.0004480159,0.83634007,0.000011046353,0.16094176],"study_design_scores_gemma":[0.0004761442,0.00023008134,0.0006423409,0.00012803754,0.0000046889077,0.00024394154,0.00060814846,0.004144572,0.00069086975,0.9926559,0.00007929258,0.00009603899],"about_ca_topic_score_codex":3.0209875e-7,"about_ca_topic_score_gemma":0.0000012637793,"teacher_disagreement_score":0.16084573,"about_ca_system_score_codex":0.000012078724,"about_ca_system_score_gemma":0.00004506093,"threshold_uncertainty_score":0.29036513},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025380155,0.00041013391,0.967697,0.0046828683,0.00081420806,0.0006406924,0.000028294002,0.00013823347,0.00020840047],"genre_scores_gemma":[0.9970529,0.0000010694096,0.0019499039,0.00056819717,0.00015903843,0.00008392209,0.000004543164,0.000011293887,0.00016912635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825925,0.00022478205,0.0004814274,0.00033213382,0.000333749,0.0003686896],"domain_scores_gemma":[0.99871534,0.00026057987,0.00024999582,0.0005517734,0.00012649936,0.00009583488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005280923,0.00018652965,0.0003539595,0.00017479953,0.00017654923,0.00018097069,0.00056842016,0.0000587385,0.000016381277],"category_scores_gemma":[0.000040988587,0.00016551482,0.0001473438,0.00030206967,0.00008454864,0.0005675262,0.00006477701,0.00013398736,0.0001313653],"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.000021641687,0.00008398901,0.000095367854,0.00008567923,0.0001389449,0.000021473395,0.0014507908,0.061777715,0.067651555,0.8683269,0.00015217498,0.00019378676],"study_design_scores_gemma":[0.017384155,0.0007334577,0.0013413595,0.0010664002,0.00020894458,0.00017754987,0.00091090356,0.95431334,0.0018030595,0.017239625,0.0029966729,0.0018245527],"about_ca_topic_score_codex":0.00018707686,"about_ca_topic_score_gemma":0.000007882477,"teacher_disagreement_score":0.9716728,"about_ca_system_score_codex":0.00008272709,"about_ca_system_score_gemma":0.00007665479,"threshold_uncertainty_score":0.6749499},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07041308,0.0017704722,0.90508825,0.0027132225,0.000073217656,0.00086535263,0.000039537597,0.00032093408,0.01871595],"genre_scores_gemma":[0.9311421,0.00045546924,0.06330946,0.00071320473,0.00037462567,0.00015082657,0.0000123944965,0.000016638061,0.0038253174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993047,0.000027434638,0.00018678802,0.00022937873,0.000117068645,0.0001346332],"domain_scores_gemma":[0.99942404,0.000076162694,0.000042461197,0.0003201349,0.000048119975,0.00008907254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012295035,0.000083758685,0.00012802117,0.000034031138,0.00012413914,0.000018912091,0.0003636923,0.000043810847,0.00028888977],"category_scores_gemma":[0.00000928936,0.0000735378,0.00004185664,0.00032299996,0.000034811088,0.000157794,0.000042899126,0.00008106984,0.00027020802],"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.000009778101,0.00021879029,0.00005873453,0.000048043123,0.000020196836,0.0000016856192,0.0005645351,0.00012409278,0.00066664035,0.758674,0.00029926866,0.23931421],"study_design_scores_gemma":[0.0011051662,0.0002334058,0.0017166903,0.000034458495,0.000040936313,0.000056078108,0.000042162344,0.4471067,0.015183375,0.053844728,0.47996065,0.00067566213],"about_ca_topic_score_codex":0.000006016151,"about_ca_topic_score_gemma":1.3399996e-7,"teacher_disagreement_score":0.860729,"about_ca_system_score_codex":0.000003479741,"about_ca_system_score_gemma":0.000020273907,"threshold_uncertainty_score":0.3473068},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03453549,0.00010095903,0.96045977,0.002942457,0.0002040467,0.0007136326,0.000010781047,0.00010915407,0.0009236931],"genre_scores_gemma":[0.48384112,0.000016464273,0.5146637,0.00027017368,0.0001550262,0.000051929153,0.0000062639,0.000023140212,0.00097220787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998849,0.000057948895,0.00037814782,0.00024099591,0.00028082627,0.00019313346],"domain_scores_gemma":[0.9985047,0.0005685406,0.00025291104,0.0004572827,0.00017646715,0.00004009657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007667263,0.00013905088,0.00021890856,0.000056786357,0.00015468309,0.00010805541,0.0006201664,0.00003268246,0.000047591293],"category_scores_gemma":[0.00013238714,0.00009849901,0.000098699435,0.00023452891,0.000054559536,0.0002632644,0.00006191352,0.00006963213,0.00008503778],"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.00009174332,0.0010164492,0.000076510274,0.0014810927,0.00023212424,0.000008262577,0.009285466,0.023808604,0.00048038896,0.365423,0.009069896,0.58902645],"study_design_scores_gemma":[0.00044449518,0.000076667675,0.00045178467,0.000102512065,0.00002580368,0.000022340437,0.0000929567,0.6344751,0.0030169464,0.3598916,0.0012300481,0.00016971295],"about_ca_topic_score_codex":0.00000202749,"about_ca_topic_score_gemma":6.121141e-7,"teacher_disagreement_score":0.6106665,"about_ca_system_score_codex":0.000014994079,"about_ca_system_score_gemma":0.000024586712,"threshold_uncertainty_score":0.4016673},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020757497,0.00007717428,0.99636424,0.000028849598,0.00007152425,0.00058533356,0.000010614111,0.000050025094,0.0026046825],"genre_scores_gemma":[0.13920406,0.000008167401,0.86054796,0.000017278837,0.0000105694935,0.00018444778,0.00000950958,0.0000064291044,0.000011589131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999156,0.000027196715,0.00039782107,0.00016895666,0.00012854321,0.00012149465],"domain_scores_gemma":[0.99901736,0.00043254724,0.00025304718,0.00013728929,0.00013627257,0.000023471077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037546802,0.000092102455,0.00016118199,0.00013088457,0.000045772922,0.000016046968,0.00030459443,0.000038869497,0.000018682775],"category_scores_gemma":[0.00008481996,0.000090524976,0.00004360112,0.00025476917,0.00006234298,0.0005881363,0.000044528657,0.000053075157,0.000001336017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025269203,0.00010134631,0.000011880709,0.0001786999,0.0000042901124,3.444422e-7,0.0007584911,0.4706985,0.000019260193,0.52678835,0.0000016805378,0.0014346393],"study_design_scores_gemma":[0.00016401039,0.000047921574,0.000007954762,0.00009090163,0.0000019428753,0.000009932954,0.000028411747,0.49678114,0.00075251574,0.50204194,0.000013653692,0.00005969365],"about_ca_topic_score_codex":4.7337466e-7,"about_ca_topic_score_gemma":8.028093e-7,"teacher_disagreement_score":0.13899648,"about_ca_system_score_codex":0.000018265664,"about_ca_system_score_gemma":0.000047923026,"threshold_uncertainty_score":0.36915013},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00722578,0.000033402277,0.9255528,0.00044889838,0.0001543432,0.0003937946,0.000009241739,0.00032892756,0.06585286],"genre_scores_gemma":[0.13187978,0.0000070611086,0.8669953,0.00029011766,0.00006939842,0.000067724795,0.000025995652,0.000025320498,0.00063932134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985913,0.000033559358,0.00046234304,0.0002918557,0.00031457932,0.00030632992],"domain_scores_gemma":[0.99885106,0.00020668388,0.00013862425,0.0006121146,0.000029747569,0.000161745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004991969,0.00019102724,0.00028673568,0.0001539031,0.0000858077,0.00025215233,0.0008458059,0.000054853565,0.000025497446],"category_scores_gemma":[0.000024968407,0.00017262077,0.00004976452,0.0005573619,0.000053454867,0.00031798542,0.0005501827,0.00017127919,0.00076985295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029046682,0.00023289879,0.000012742831,0.00005945604,0.000011856554,0.0000051790353,0.0028524236,0.000584426,0.000022618055,0.9889808,0.0039910446,0.0032436175],"study_design_scores_gemma":[0.00071238173,0.000027948525,0.000032284715,0.00005357429,0.000008491759,0.000020120207,0.0010050964,0.109918706,0.00027877145,0.8600332,0.027604252,0.0003051797],"about_ca_topic_score_codex":0.000003924428,"about_ca_topic_score_gemma":0.0000036589263,"teacher_disagreement_score":0.12894763,"about_ca_system_score_codex":0.000034248544,"about_ca_system_score_gemma":0.00008617094,"threshold_uncertainty_score":0.9895159},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26706696,0.000019787569,0.7295583,0.00023659498,0.000027145474,0.0003982148,6.3742834e-7,0.000041115767,0.0026512628],"genre_scores_gemma":[0.9891944,0.0000038925873,0.010540669,0.00011080211,0.000015066984,0.00005404475,6.6100355e-8,0.0000037606244,0.00007727617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856293,0.00006050844,0.0001443819,0.00049412047,0.00053040485,0.00020765857],"domain_scores_gemma":[0.99893415,0.00021182896,0.00009595292,0.00063025136,0.00006115027,0.000066640474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015618922,0.00010465369,0.00012561741,0.000090254354,0.00048922177,0.000048785692,0.0012872935,0.000020904754,0.0000018385979],"category_scores_gemma":[0.000033579377,0.00006930009,0.000017242164,0.00073672907,0.00025257585,0.00018049295,0.00031895208,0.0001039488,0.00001636008],"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.000011412156,0.00022775927,0.00018566565,0.0000046741093,0.00000498776,0.0000026490625,0.0098888045,0.00031105548,0.23877458,0.723706,0.000014171574,0.026868206],"study_design_scores_gemma":[0.00041582496,0.00019103468,0.0120205125,0.0000057121947,0.0000066080634,0.00003266832,0.000524128,0.7465498,0.18184659,0.058039553,0.000094585805,0.0002730283],"about_ca_topic_score_codex":0.0000043783975,"about_ca_topic_score_gemma":8.8972996e-7,"teacher_disagreement_score":0.7462387,"about_ca_system_score_codex":0.00001389781,"about_ca_system_score_gemma":0.000059538994,"threshold_uncertainty_score":0.3762748},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021193001,0.00013239546,0.97587967,0.0009118944,0.0000547843,0.00018655304,0.000007170444,0.00016498851,0.0014695615],"genre_scores_gemma":[0.9837896,0.000053134896,0.0147119,0.0003440509,0.0002764826,0.000068365276,0.000012271975,0.000007753647,0.00073639594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993767,0.00003471644,0.00012974546,0.00023821385,0.00008686674,0.00013374284],"domain_scores_gemma":[0.9994308,0.000079283105,0.000044052234,0.0003224815,0.00003548704,0.00008789969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015148075,0.00008202897,0.00009069759,0.000040637668,0.00017099384,0.00006868067,0.00034288655,0.000036207774,0.00002762571],"category_scores_gemma":[0.000008391539,0.00007300567,0.00002643866,0.0001573726,0.000014806143,0.00015850915,0.000119552606,0.00007523683,0.00023228818],"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":[3.895123e-7,0.000026240363,0.00010716401,0.000013793696,0.000003290535,1.2758294e-7,0.00006242613,0.000008804649,0.0003014301,0.9756389,0.000080865146,0.023756562],"study_design_scores_gemma":[0.00051401416,0.000078126024,0.004084586,0.000020052794,0.00001692235,0.000032474276,0.000027607663,0.53681254,0.0048974566,0.10603095,0.3470508,0.00043447388],"about_ca_topic_score_codex":0.0000027329784,"about_ca_topic_score_gemma":6.2662446e-7,"teacher_disagreement_score":0.96259665,"about_ca_system_score_codex":0.000003757759,"about_ca_system_score_gemma":0.000007319909,"threshold_uncertainty_score":0.2985672},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58648413,0.00032030558,0.4010614,0.0002460717,0.0016752601,0.0005654296,0.000035763267,0.0001341031,0.009477549],"genre_scores_gemma":[0.9609116,0.000035814464,0.038730744,0.0000626603,0.00014723813,0.000019962225,0.000002383616,0.000005644657,0.00008400403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994776,0.000018691397,0.000115152274,0.00017258087,0.00008054276,0.00013538862],"domain_scores_gemma":[0.9995226,0.00014712378,0.00005309493,0.00022051166,0.000026282583,0.000030384546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021964853,0.0000683719,0.0001046796,0.000031092248,0.00006870618,0.000020517029,0.00018758877,0.000036758138,0.0000067322735],"category_scores_gemma":[0.000026876332,0.00006107041,0.000037771897,0.0001617703,0.000033346387,0.00015971548,0.00006996652,0.00008000121,0.0000016407238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010398881,0.000114333416,0.00078086,0.000058050944,0.000009416868,5.882011e-7,0.0012345901,0.000044609475,0.039934427,0.7700408,0.000038836817,0.18773308],"study_design_scores_gemma":[0.0019714416,0.0003438658,0.007655804,0.000070655726,0.000038405535,0.000008058422,0.0007680295,0.15584013,0.0972016,0.71269387,0.022720227,0.0006879343],"about_ca_topic_score_codex":0.000006000032,"about_ca_topic_score_gemma":0.0000069404628,"teacher_disagreement_score":0.3744274,"about_ca_system_score_codex":0.0000036785327,"about_ca_system_score_gemma":0.000018463612,"threshold_uncertainty_score":0.24903789},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45866886,0.00021587573,0.53949255,0.000458494,0.000033144435,0.00028599557,0.000028410977,0.000048204154,0.0007684493],"genre_scores_gemma":[0.99542797,0.00011862564,0.004172651,0.00005548202,0.000024997424,0.000020626549,0.0000075762036,0.0000034457034,0.00016861496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995587,0.000020366768,0.0001773687,0.00010779806,0.000073844116,0.00006191341],"domain_scores_gemma":[0.999557,0.000033244432,0.00010559486,0.00021316798,0.000055648954,0.000035331494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000069702124,0.00004878207,0.00009330357,0.0000469287,0.00005155821,0.000008513082,0.0002197833,0.000026829284,0.000027708753],"category_scores_gemma":[0.0000075213497,0.000045018158,0.000022210792,0.00025252812,0.00002885147,0.00014224023,0.00006225507,0.00003574506,0.000015972662],"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.0000016482404,0.00020053147,0.0002083277,0.00006891895,0.00001778051,2.2734555e-7,0.0007196089,0.000004967761,0.1001186,0.85006183,0.000021085782,0.048576467],"study_design_scores_gemma":[0.0010345208,0.00021465923,0.009141119,0.00007860316,0.000049827573,0.000024899648,0.00006108794,0.49714682,0.42335102,0.0381509,0.030241422,0.000505127],"about_ca_topic_score_codex":0.0000010942424,"about_ca_topic_score_gemma":8.0524536e-8,"teacher_disagreement_score":0.8119109,"about_ca_system_score_codex":0.0000017534818,"about_ca_system_score_gemma":0.0000039646447,"threshold_uncertainty_score":0.18357873},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20257196,0.00047821374,0.77115035,0.0013412536,0.000074071,0.0007795786,0.000046491863,0.00014285062,0.023415223],"genre_scores_gemma":[0.98878986,0.00011723337,0.010248096,0.00017499206,0.00006628375,0.00005528361,0.000008516662,0.000005256071,0.00053446606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993864,0.000022883503,0.00015836002,0.00020800055,0.00011097031,0.00011333483],"domain_scores_gemma":[0.9994584,0.00011360623,0.00007869328,0.00023502494,0.000057921894,0.000056399414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000098545795,0.000078863,0.00009900803,0.000055986286,0.00012682358,0.00002511526,0.0003005001,0.000024751389,0.000064339336],"category_scores_gemma":[0.0000097742895,0.000068254325,0.000026752728,0.00028416023,0.000026158501,0.00013774663,0.0000889838,0.000056609082,0.000073700656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040836026,0.00008546017,0.000020236663,0.000010564739,0.000008922793,5.245176e-7,0.0002115356,0.000031458207,0.00038190137,0.9869714,0.0000644657,0.012209478],"study_design_scores_gemma":[0.0019984657,0.0008822636,0.0044899858,0.00009375866,0.000055915465,0.0000549455,0.00036494227,0.33712047,0.019442644,0.54799163,0.08662599,0.0008789504],"about_ca_topic_score_codex":0.000004096924,"about_ca_topic_score_gemma":0.0000011095743,"teacher_disagreement_score":0.7862179,"about_ca_system_score_codex":0.0000052408645,"about_ca_system_score_gemma":0.000012923533,"threshold_uncertainty_score":0.27833307},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022072645,0.00023766619,0.99074453,0.002112608,0.0000563289,0.0002007384,0.0000059702948,0.00017144092,0.004263469],"genre_scores_gemma":[0.898644,0.000059225942,0.09544043,0.0020324097,0.0006734038,0.00035988426,0.000019688607,0.000018301493,0.0027526894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938715,0.000031121224,0.00012118017,0.00024006158,0.00008267871,0.0001378391],"domain_scores_gemma":[0.99939805,0.00009876098,0.000038403003,0.00033373106,0.00003874551,0.000092336246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001541122,0.000078849596,0.000090399066,0.000036614958,0.00019251947,0.00006530977,0.00037354967,0.000032602908,0.000035770357],"category_scores_gemma":[0.000011474579,0.00007020995,0.000026385489,0.00016885197,0.00002706839,0.0001355159,0.00012350692,0.000073135,0.00043575282],"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":[4.906034e-7,0.000020888228,0.0000071480376,0.0000102477725,0.0000032820808,1.2803363e-7,0.000057362275,0.0000037438758,0.00024154349,0.9691622,0.00035585472,0.030137083],"study_design_scores_gemma":[0.00018666075,0.00003765842,0.00022719378,0.000005295597,0.0000056413082,0.000009970217,0.000007268499,0.16984652,0.0012082398,0.120642334,0.70766383,0.00015940199],"about_ca_topic_score_codex":0.0000016463165,"about_ca_topic_score_gemma":5.233952e-7,"teacher_disagreement_score":0.8964367,"about_ca_system_score_codex":0.0000030801343,"about_ca_system_score_gemma":0.000009645415,"threshold_uncertainty_score":0.5600866},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1825706,0.0027647137,0.7526726,0.0007511563,0.0006349608,0.0005581068,0.000017665237,0.00041899196,0.059611164],"genre_scores_gemma":[0.92430454,0.00006282505,0.07366592,0.00018632624,0.000044735876,0.000017922957,0.000003172069,0.0000209602,0.0016936071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99831533,0.00010452932,0.0002926741,0.0004323771,0.00037438958,0.00048069813],"domain_scores_gemma":[0.9987117,0.00010835594,0.00018214928,0.0007957131,0.000077026176,0.00012506048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005656586,0.00019502138,0.0002781574,0.0001443135,0.0001296193,0.00006849346,0.0007563255,0.00007858362,0.00009106207],"category_scores_gemma":[0.000033987257,0.00016138572,0.000086409826,0.00079335994,0.00008188191,0.000531351,0.000119304044,0.00014760699,0.000059283848],"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.000024585457,0.00029457913,0.0022099041,0.000096718984,0.00007532471,0.000018859551,0.000672271,0.0003575578,0.0046476373,0.98350537,0.0014962041,0.0066010053],"study_design_scores_gemma":[0.0035393867,0.0021889063,0.0014658058,0.000547368,0.00013384988,0.0005186789,0.0021364202,0.013568556,0.6701336,0.22923304,0.07434641,0.0021879547],"about_ca_topic_score_codex":0.00004055368,"about_ca_topic_score_gemma":0.00001487585,"teacher_disagreement_score":0.7542723,"about_ca_system_score_codex":0.000025374675,"about_ca_system_score_gemma":0.00008274701,"threshold_uncertainty_score":0.6581119},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61493284,0.0070467475,0.37528077,0.00040559238,0.00006751664,0.00047735387,0.0000398323,0.00006183311,0.0016875006],"genre_scores_gemma":[0.9886804,0.00066345464,0.01035928,0.0000677615,0.00009892179,0.000028716817,0.000006125988,0.0000046876594,0.00009063541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99949926,0.000035264275,0.00016099373,0.000121329016,0.00009072226,0.0000924252],"domain_scores_gemma":[0.99949944,0.000116122086,0.000100912075,0.00017926474,0.00004866415,0.00005561282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020587683,0.000064821485,0.000103225015,0.00006029865,0.00006482724,0.0000120841205,0.00014887695,0.00003297469,0.000012491305],"category_scores_gemma":[0.000014091108,0.000052726984,0.000020071984,0.0001948767,0.000041126183,0.00017083663,0.00006247034,0.000029708008,0.0000064861338],"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.0000018474866,0.00006283538,0.00035040965,0.000034618715,0.000007569517,2.0504753e-8,0.00032935812,0.000009618674,0.0021488352,0.98638093,0.000021301772,0.010652671],"study_design_scores_gemma":[0.0010364346,0.00039104663,0.024697911,0.000118910735,0.00012373044,0.000026432841,0.00024191289,0.08042969,0.5356814,0.32624742,0.030208968,0.00079613714],"about_ca_topic_score_codex":0.0000024126089,"about_ca_topic_score_gemma":1.4440937e-7,"teacher_disagreement_score":0.6601335,"about_ca_system_score_codex":0.000001902864,"about_ca_system_score_gemma":0.000007835386,"threshold_uncertainty_score":0.2150144},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52420336,0.00016764615,0.46984667,0.00019519082,0.00021552741,0.00013496332,0.0000014833139,0.000018473107,0.0052166604],"genre_scores_gemma":[0.75521916,0.000009375066,0.2446313,0.000019295358,0.00007613657,7.3452566e-7,6.1710665e-8,0.0000054117504,0.000038499802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990048,0.00012156086,0.00042493694,0.00010977678,0.00022426818,0.00011467618],"domain_scores_gemma":[0.99887294,0.00035809437,0.00031268335,0.00020351748,0.00017677135,0.00007599506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000743575,0.00008248297,0.00027592975,0.000039985218,0.000056997204,0.000054843924,0.00021675149,0.000020277925,0.000014651697],"category_scores_gemma":[0.00044976937,0.00006142784,0.000069520334,0.0002221358,0.00008844119,0.00041224534,0.00004903143,0.00015339047,0.0000028201848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033860963,0.00023248851,0.0006082384,0.000122388,0.000043163014,0.000011443678,0.00090719527,0.0001270144,0.003474805,0.9889698,0.00009682926,0.005403269],"study_design_scores_gemma":[0.0004290452,0.00009212828,0.00008894362,0.00014330135,0.00003313431,0.0007714521,0.0004127608,0.0037067991,0.08672448,0.9073762,0.00008533782,0.00013640517],"about_ca_topic_score_codex":2.2452804e-7,"about_ca_topic_score_gemma":1.33035e-8,"teacher_disagreement_score":0.2310158,"about_ca_system_score_codex":0.000009197501,"about_ca_system_score_gemma":0.000056602305,"threshold_uncertainty_score":0.25049546},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004858521,0.000094177594,0.99238217,0.0012108238,0.00034549332,0.00004284704,0.00002984223,0.000005614527,0.0010305102],"genre_scores_gemma":[0.9648606,0.0000048734178,0.034565475,0.00018437742,0.0003485633,5.796514e-7,3.357224e-7,0.000004702982,0.00003048684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992447,0.00008483911,0.0002530615,0.000055043005,0.00021288151,0.0001495014],"domain_scores_gemma":[0.99896777,0.00031231515,0.00027339192,0.00023916869,0.00011741656,0.00008995655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002546506,0.000068731584,0.00015278671,0.000014084065,0.00005783916,0.000022521053,0.00050978444,0.000027153033,0.000033575845],"category_scores_gemma":[0.00006832958,0.000039404873,0.000079077174,0.00016941756,0.00008828236,0.00019621624,0.00008414823,0.00018351508,0.000008144967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003285727,0.00010843806,0.0008119113,0.000009954299,0.000023230072,7.44921e-7,0.00042136994,0.00004285544,0.00058873626,0.9743468,0.0012995314,0.022343123],"study_design_scores_gemma":[0.00036526212,0.000120981604,0.04729215,0.0000349079,0.0000577074,0.00011574585,0.00006370332,0.001035534,0.0036125048,0.9434679,0.0036859836,0.00014762781],"about_ca_topic_score_codex":0.0000011240097,"about_ca_topic_score_gemma":1.3430584e-7,"teacher_disagreement_score":0.96000206,"about_ca_system_score_codex":0.000014861924,"about_ca_system_score_gemma":0.000054916996,"threshold_uncertainty_score":0.16068842},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00549172,0.0001045296,0.9912768,0.0021066384,0.0005986582,0.00022056272,0.000002759714,0.000039945877,0.00015840017],"genre_scores_gemma":[0.74175215,0.00006452081,0.25581983,0.0003779108,0.00085637614,0.0000167943,0.0000032084697,0.00001775506,0.0010914425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892044,0.00008530873,0.000286337,0.00016690172,0.00026458415,0.00027642844],"domain_scores_gemma":[0.9983015,0.0010184345,0.0001935005,0.00028464283,0.000112259375,0.00008962917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004802076,0.000121590965,0.00012852457,0.000061740255,0.0011886745,0.00023094659,0.0006320024,0.000047239613,0.00004894612],"category_scores_gemma":[0.00024132396,0.00007696622,0.00014074163,0.00017180736,0.00007446037,0.0005532208,0.00007831413,0.00020928933,0.000018896066],"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.0002651577,0.00051085936,0.00033105904,0.00004186787,0.000379543,0.00027324262,0.01205352,0.4523177,0.0053030085,0.37906194,0.0054086773,0.14405343],"study_design_scores_gemma":[0.0006881419,0.000047284495,0.00006147418,0.000012908352,0.000018469704,0.0006337938,0.000035302568,0.9680206,0.00011876071,0.027405482,0.0028270439,0.0001307104],"about_ca_topic_score_codex":0.0000045244915,"about_ca_topic_score_gemma":8.1267166e-7,"teacher_disagreement_score":0.7362604,"about_ca_system_score_codex":0.000037755883,"about_ca_system_score_gemma":0.00008536889,"threshold_uncertainty_score":0.9142443},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07000862,0.0010515082,0.9239165,0.0016882232,0.00010272489,0.0018903186,0.000048718495,0.00030613499,0.0009872115],"genre_scores_gemma":[0.8075514,0.000118493874,0.18786365,0.00056340505,0.0007461588,0.0016707709,0.00003175059,0.00003325142,0.001421168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905497,0.000029097637,0.00023005427,0.00037667982,0.00008403476,0.00022518166],"domain_scores_gemma":[0.99923736,0.00014151797,0.000069342066,0.00031455324,0.00008722912,0.00014999454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018809075,0.00013731454,0.00016891102,0.00006254785,0.00023442983,0.00016692464,0.00033150802,0.000060939277,0.000018251629],"category_scores_gemma":[0.00001708059,0.000118413824,0.000049199774,0.00018096303,0.00004062334,0.0003163464,0.00013767323,0.00008116801,0.00012636605],"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.0000018322713,0.000036028123,0.000014140675,0.00011400989,0.000019237887,3.285969e-7,0.00020282935,0.0000022895165,0.0009148463,0.9757568,0.0002069188,0.022730686],"study_design_scores_gemma":[0.00089038134,0.00021906765,0.00062136055,0.00006401603,0.000046359597,0.00010740471,0.00021787686,0.8583063,0.009320392,0.09060149,0.039038066,0.00056729175],"about_ca_topic_score_codex":0.0000074257896,"about_ca_topic_score_gemma":8.865774e-7,"teacher_disagreement_score":0.8851554,"about_ca_system_score_codex":0.000010347601,"about_ca_system_score_gemma":0.000021349631,"threshold_uncertainty_score":0.48287755},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006324397,0.00012930216,0.988669,0.0006117735,0.0007326451,0.0009477056,0.0023211385,0.00018143456,0.00008261373],"genre_scores_gemma":[0.79138696,0.000001210676,0.20646,0.000015719846,0.00091295165,0.00011711638,0.00086708047,0.000017340753,0.00022160188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982491,0.000039841794,0.00042468694,0.0005647685,0.00018401188,0.00053758075],"domain_scores_gemma":[0.99866885,0.0004959997,0.00014127445,0.0003433539,0.00020014853,0.00015034596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031246885,0.00022178036,0.00025539694,0.00010946506,0.0008297119,0.00023858945,0.00037654422,0.00008398519,0.000011104139],"category_scores_gemma":[0.00009123294,0.00023034075,0.00015980894,0.00030788872,0.00013905216,0.00041553978,0.00015161453,0.0001193127,0.000004022409],"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.00009614372,0.00031817658,0.0000019018161,0.000023219964,0.00004055175,0.000002745085,0.00012874021,0.029803688,0.000864276,0.9609502,0.0031213015,0.0046490626],"study_design_scores_gemma":[0.0019024387,0.00017890066,0.000022834372,0.000012093663,0.00005068679,0.000030620104,0.000023399038,0.8122053,0.00030886315,0.1848329,0.00020370673,0.00022823548],"about_ca_topic_score_codex":0.00007232494,"about_ca_topic_score_gemma":0.000006848216,"teacher_disagreement_score":0.78506255,"about_ca_system_score_codex":0.000054840024,"about_ca_system_score_gemma":0.00013545707,"threshold_uncertainty_score":0.9393023},"labels":[],"label_agreement":null},{"id":"W2056707245","doi":"10.1002/nla.258","title":"On the growth factor in Gaussian elimination for generalized Higham matrices","year":2002,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Gaussian elimination; Hermitian matrix; Mathematics; Positive-definite matrix; Matrix (chemical analysis); Gaussian; Combinatorics; Class (philosophy); Factor (programming language); Upper and lower bounds; Pure mathematics; Mathematical analysis; Physics; Computer science; Chemistry; Computational chemistry","score_opus":0.01661374818348609,"score_gpt":0.2450198333137332,"score_spread":0.2284060851302471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056707245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033053958,0.0000593501,0.98454875,0.009927425,0.00003338033,0.0009015914,0.00001836191,0.00013671366,0.0010690505],"genre_scores_gemma":[0.8873215,0.00002574186,0.10934124,0.0010923396,0.00017151104,0.0016088473,0.000013939015,0.000019857454,0.0004050274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989392,0.000063353946,0.00020916182,0.0003482011,0.00020633981,0.00023374862],"domain_scores_gemma":[0.99884874,0.00047020087,0.00009908132,0.0004350247,0.000068428104,0.000078556164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013044363,0.00014023844,0.00013881647,0.00009320819,0.00020817286,0.000082753184,0.0006317405,0.000051186,0.00010809554],"category_scores_gemma":[0.000043406177,0.00008679354,0.000052884458,0.0008296615,0.000043594988,0.00015880005,0.00004146391,0.00013826275,0.00014545543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009372258,0.00016129616,0.000029617204,0.000009124406,0.000007005121,5.728335e-7,0.00012359806,0.00009221931,0.00003405858,0.9865963,0.00041774375,0.012519131],"study_design_scores_gemma":[0.001472485,0.00047755693,0.0020222827,0.0000276199,0.00002684389,0.000012487646,0.000039267336,0.80545056,0.0025729123,0.14981095,0.03747532,0.00061173656],"about_ca_topic_score_codex":0.000008931739,"about_ca_topic_score_gemma":0.000001535676,"teacher_disagreement_score":0.8840161,"about_ca_system_score_codex":0.000030174038,"about_ca_system_score_gemma":0.000013450309,"threshold_uncertainty_score":0.35393375},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52629197,0.0000054517914,0.47218487,0.0013177827,0.000060542803,0.0001100371,0.00000437812,0.00001077625,0.000014178264],"genre_scores_gemma":[0.9033016,0.00012299558,0.09625329,0.00016737536,0.00012296592,0.00000660424,0.0000060875723,0.000004646716,0.000014438621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989467,0.00005257258,0.00038077618,0.00013347034,0.0003652035,0.00012126326],"domain_scores_gemma":[0.9985538,0.00019589547,0.0006321345,0.00019975603,0.0003646961,0.000053710606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004876882,0.00009322752,0.00012874044,0.000114179835,0.00014840139,0.00012376675,0.0004746529,0.000021658467,0.00001297323],"category_scores_gemma":[0.000011167768,0.00006561981,0.00003301504,0.0001572961,0.000085358646,0.000809568,0.00016250357,0.00017035077,0.0000026624543],"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.0009214086,0.0012739407,0.18540159,0.00015996718,0.0012442039,0.00011597868,0.007074826,0.08934039,0.0012446472,0.39957306,0.0018152598,0.31183472],"study_design_scores_gemma":[0.0055434615,0.0010211458,0.26509696,0.00044049026,0.00023107443,0.009079608,0.0014658164,0.67956644,0.0068952907,0.01578177,0.014087141,0.00079081213],"about_ca_topic_score_codex":0.000038590108,"about_ca_topic_score_gemma":0.000009410358,"teacher_disagreement_score":0.59022605,"about_ca_system_score_codex":0.00003991795,"about_ca_system_score_gemma":0.000080447826,"threshold_uncertainty_score":0.2675898},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041763536,0.0009950374,0.9935998,0.00045362773,0.000040674935,0.00044498488,0.000012226543,0.000019197598,0.0002581534],"genre_scores_gemma":[0.9545455,0.00011738616,0.044137277,0.00014518322,0.00006886722,0.00028255885,0.000004510038,0.00000775313,0.00069093786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995696,0.000022428289,0.00015078757,0.00012195261,0.000061189574,0.000074063035],"domain_scores_gemma":[0.999399,0.00016173103,0.00007330072,0.00022775667,0.000115546674,0.000022680297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020113731,0.000051058316,0.00008189388,0.000032590346,0.00010554005,0.000013805786,0.00015923729,0.000027107548,0.000016182761],"category_scores_gemma":[0.00003282478,0.00003601268,0.000035096324,0.00028149466,0.000029351719,0.000087424065,0.000025689389,0.000032434054,0.000003905022],"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.0000068484383,0.00004010484,0.000006227023,0.000036707595,0.00001122422,1.300022e-8,0.00013142698,0.000017711312,0.0033336147,0.98665875,0.000049977636,0.009707371],"study_design_scores_gemma":[0.0019753017,0.00046439093,0.0006402086,0.000041613992,0.00015870214,0.000024296758,0.0003224339,0.2672601,0.06278406,0.29453528,0.37141138,0.00038221385],"about_ca_topic_score_codex":0.0000025322909,"about_ca_topic_score_gemma":5.3136034e-7,"teacher_disagreement_score":0.9503692,"about_ca_system_score_codex":0.0000017459938,"about_ca_system_score_gemma":0.000024079169,"threshold_uncertainty_score":0.14685544},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07605301,0.00001945949,0.9220637,0.0002504998,0.0002682427,0.000062142004,0.0000013717622,0.000014752911,0.0012667896],"genre_scores_gemma":[0.58855873,0.0000056224376,0.41092244,0.000042657884,0.00035060314,2.6493703e-7,3.3332591e-7,0.000010585231,0.00010878685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976797,0.00038318278,0.00050845346,0.00012026791,0.0009989253,0.00030947337],"domain_scores_gemma":[0.9973769,0.0011756434,0.0002889344,0.0003068862,0.00069964974,0.00015194742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00463143,0.00009243919,0.0002412376,0.00037919448,0.00029714435,0.00027777493,0.0010161523,0.000045603065,0.00004017906],"category_scores_gemma":[0.00062551314,0.00007167652,0.0000995772,0.00045871708,0.00009344657,0.00037592565,0.00034684726,0.00045474494,0.000033307377],"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.000006141423,0.0003668046,0.00041685565,0.00022600537,0.000084121195,0.00006247587,0.004354968,0.0034480228,0.0069737225,0.9740372,0.00084206543,0.00918167],"study_design_scores_gemma":[0.000306769,0.00012782929,0.00008416392,0.00016126344,0.0000066728253,0.0003065255,0.00026618788,0.8896635,0.000690846,0.10483115,0.003440225,0.00011487173],"about_ca_topic_score_codex":0.0000021182202,"about_ca_topic_score_gemma":5.9638256e-7,"teacher_disagreement_score":0.88621545,"about_ca_system_score_codex":0.000052093397,"about_ca_system_score_gemma":0.00013797266,"threshold_uncertainty_score":0.29228836},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040142607,0.00004569357,0.95767194,0.00046878468,0.0003340684,0.000015326423,0.000002139776,0.000009154267,0.0013102955],"genre_scores_gemma":[0.9841296,0.000007796305,0.0148458695,0.00008083534,0.00032368305,7.7707966e-7,0.0000018334488,0.0000024485971,0.0006071667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987931,0.000111374524,0.00044038755,0.00010878282,0.00045161013,0.00009469815],"domain_scores_gemma":[0.9986522,0.00018403582,0.00045635446,0.00017802641,0.00045736512,0.00007202309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009661492,0.00007091336,0.00026266597,0.000606484,0.00008094351,0.000031615913,0.00030477907,0.000031208234,0.00018827849],"category_scores_gemma":[0.00010082378,0.000052510604,0.00049503415,0.0014847083,0.000036146223,0.00032164456,0.000042252344,0.0001300382,0.000008255016],"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.00016773176,0.00062761304,0.03720713,0.000041032476,0.0063876333,0.000018733825,0.00031946567,0.10156164,0.0058300737,0.79687715,0.0031460077,0.047815777],"study_design_scores_gemma":[0.0019453445,0.0013745638,0.2273902,0.000050183884,0.0036174594,0.00064347516,0.00016912073,0.5896197,0.006332642,0.1338057,0.03439295,0.00065864413],"about_ca_topic_score_codex":0.000004836768,"about_ca_topic_score_gemma":0.0000038844655,"teacher_disagreement_score":0.94398695,"about_ca_system_score_codex":0.000017801474,"about_ca_system_score_gemma":0.00008132564,"threshold_uncertainty_score":0.21413204},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015801629,0.000087120294,0.9748614,0.0010067987,0.00044585092,0.00017551528,0.0000019690347,0.00019687638,0.0074228346],"genre_scores_gemma":[0.6635354,0.000037377937,0.33526367,0.0010596162,0.000032129068,0.000019719606,0.0000059619592,0.000006824231,0.000039293755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998796,0.00026231376,0.00031925488,0.00028582753,0.00013141855,0.00020522768],"domain_scores_gemma":[0.9943652,0.0008871732,0.0000979555,0.0045497552,0.00004337181,0.000056521756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039642834,0.00014420666,0.00014597122,0.00024058101,0.00014068224,0.00008659086,0.0048943902,0.000084502804,0.00010668681],"category_scores_gemma":[0.00008721973,0.00014387835,0.00006504379,0.00045844197,0.00007707165,0.0004624505,0.0023636664,0.0003551718,0.00017873765],"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.000009896448,0.00031653605,0.0008425485,0.000005155653,0.000016102607,0.0000065308777,0.0034627577,0.00010872896,0.0000057014972,0.90210205,0.0009173979,0.09220661],"study_design_scores_gemma":[0.00035286596,0.00012776155,0.0075855483,0.000063463485,0.000003382831,0.000006575751,0.000009542344,0.5348138,0.00008682323,0.45532018,0.0014066475,0.00022336986],"about_ca_topic_score_codex":0.000052790383,"about_ca_topic_score_gemma":0.000037558657,"teacher_disagreement_score":0.6477338,"about_ca_system_score_codex":0.000028283122,"about_ca_system_score_gemma":0.00002742754,"threshold_uncertainty_score":0.9095077},"labels":[],"label_agreement":null},{"id":"W2063957170","doi":"10.1002/nla.521","title":"Mathematical Modelling and Mathematical Methods in Energy","year":2006,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Fundação Araucária","keywords":"Library science; Bachelor; Mathematics; Operations research; Geography; Computer science; Archaeology","score_opus":0.013189107157339524,"score_gpt":0.2776829384344822,"score_spread":0.2644938312771427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063957170","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024142655,0.0001183477,0.9942882,0.00056821486,0.000007000414,0.00019592066,0.000001705006,0.00014494639,0.0044342414],"genre_scores_gemma":[0.04181817,0.000007020457,0.9574242,0.00015626618,0.000079345715,0.00027814155,0.000004442754,0.0000163215,0.00021605482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986691,0.00009653496,0.00034846162,0.00041708647,0.00018853204,0.00028032425],"domain_scores_gemma":[0.99888945,0.00041202502,0.000068980175,0.00046713112,0.000039358772,0.00012305976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033057533,0.00016500567,0.00026008056,0.00009264321,0.00010344447,0.00007522156,0.00038265574,0.00007530382,0.000038808834],"category_scores_gemma":[0.000010665018,0.00012764074,0.000038777966,0.00064008054,0.00010242017,0.0001643655,0.00011932706,0.0001642599,0.000050461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003407523,0.00017366327,0.000010892352,0.000016905335,0.0000045457286,0.0000028407524,0.00003625156,0.0060507962,0.00003937361,0.9802117,0.000013255276,0.013436421],"study_design_scores_gemma":[0.00011568011,0.00001780614,0.000008517883,0.000008054924,0.0000048239212,0.00002897173,0.0000056425015,0.5356194,0.00032137704,0.46084794,0.0029141991,0.000107614316],"about_ca_topic_score_codex":0.000015597394,"about_ca_topic_score_gemma":6.7848606e-7,"teacher_disagreement_score":0.52956855,"about_ca_system_score_codex":0.000018305758,"about_ca_system_score_gemma":0.0000295553,"threshold_uncertainty_score":0.5205038},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045988683,0.00038487467,0.9531733,0.0002771517,0.000092112896,0.000023947918,7.347273e-8,0.00001568789,0.00004420604],"genre_scores_gemma":[0.7910185,0.000014467367,0.20878145,0.000045210116,0.00013315844,6.786203e-7,5.9937754e-8,0.0000025267868,0.0000039927645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994747,0.00002165923,0.00021826004,0.00007216179,0.000091491485,0.00012174847],"domain_scores_gemma":[0.9995995,0.00009567185,0.00006965081,0.00010990288,0.000057743495,0.000067497014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002574378,0.00006621713,0.0001261715,0.00016367076,0.000037104503,0.0001102887,0.00046597267,0.000031735522,0.0000014237182],"category_scores_gemma":[0.000009136877,0.00005356792,0.000029876986,0.00031066497,0.000013196631,0.00034725264,0.000103608,0.0004891687,4.5836313e-7],"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.000007919235,0.00014986022,0.0005135884,0.00002076904,0.000013305969,0.00006518279,0.0008287423,0.0024256469,0.008645603,0.12709145,0.000039222843,0.86019874],"study_design_scores_gemma":[0.0001820578,0.00008606472,0.0018801511,0.000026774476,0.0000018185123,0.00026094005,9.233054e-7,0.99433845,0.00039193477,0.0017396142,0.0010199762,0.000071288334],"about_ca_topic_score_codex":4.7187785e-7,"about_ca_topic_score_gemma":3.4710823e-7,"teacher_disagreement_score":0.9919128,"about_ca_system_score_codex":0.000008955225,"about_ca_system_score_gemma":0.00002938212,"threshold_uncertainty_score":0.21844365},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016421725,0.0016656328,0.99020034,0.003406385,0.00023911425,0.0012905742,0.00006866523,0.0001784479,0.0013086483],"genre_scores_gemma":[0.4734903,0.00882963,0.50132155,0.004338746,0.002321028,0.0032207214,0.00021454188,0.00015397611,0.006109476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978964,0.00025739314,0.00042644673,0.0008802116,0.0002300326,0.00030956825],"domain_scores_gemma":[0.9980938,0.00019925628,0.00026584696,0.001116292,0.00012756417,0.00019725013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082692417,0.00034063024,0.00039704327,0.00010234125,0.00044552315,0.00031220805,0.0012956783,0.00023236893,0.000039033806],"category_scores_gemma":[0.000025156185,0.00024124599,0.00015378009,0.00016888477,0.00013010745,0.00015034297,0.002065835,0.00060910184,0.000050527604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014682803,0.000072445415,0.0000126485675,0.00012373859,0.0001013793,0.0000029606203,0.00073805434,0.000038768256,0.00007037412,0.8961504,0.000087765264,0.102586776],"study_design_scores_gemma":[0.0018980725,0.00009169041,0.0013685792,0.00014562526,0.00038839292,0.00016605487,0.000142449,0.18721612,0.0022098664,0.7668961,0.038237162,0.0012398782],"about_ca_topic_score_codex":0.00008674737,"about_ca_topic_score_gemma":0.000007735389,"teacher_disagreement_score":0.4888788,"about_ca_system_score_codex":0.000011476762,"about_ca_system_score_gemma":0.000068761285,"threshold_uncertainty_score":0.9837726},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026114676,0.0004093861,0.9958291,0.00020532805,0.00013323092,0.00021330515,0.000007645062,0.00001968528,0.0005708393],"genre_scores_gemma":[0.040189,0.000020319356,0.95944536,0.00009067122,0.00016418335,0.000007991004,0.000004498363,0.000008065777,0.00006988627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987201,0.000017194905,0.0006620948,0.000105452826,0.00033501792,0.00016010497],"domain_scores_gemma":[0.99752295,0.0013933398,0.00054147193,0.00015094518,0.00027955117,0.0001117479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016987849,0.000118791795,0.00028466329,0.00011630296,0.00015858276,0.00014700822,0.0004674136,0.00004916625,0.0000016529253],"category_scores_gemma":[0.000022116745,0.000095926756,0.0000794083,0.00013860535,0.000053099087,0.00017897149,0.00007758335,0.00012819067,0.0000023299579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013136978,0.00015570878,8.881251e-7,0.00007192876,0.000044592056,0.0000027461256,0.00050702883,0.011940248,0.000017470016,0.9330996,0.00026033024,0.053886294],"study_design_scores_gemma":[0.0009509123,0.000065934815,0.000040316474,0.000054004926,0.000017834838,0.00026477865,0.0004033369,0.42958605,0.00005710592,0.5669098,0.0015237167,0.00012620981],"about_ca_topic_score_codex":3.7372592e-7,"about_ca_topic_score_gemma":1.102396e-7,"teacher_disagreement_score":0.4176458,"about_ca_system_score_codex":0.000021679918,"about_ca_system_score_gemma":0.00006953923,"threshold_uncertainty_score":0.39117795},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000055920536,0.00008959951,0.99370116,0.0035154086,0.0000457496,0.00021222462,9.767217e-7,0.00011804906,0.0022609315],"genre_scores_gemma":[0.17732775,0.00020052353,0.81856686,0.0015755565,0.00029231643,0.00037620805,0.0000801346,0.000017392511,0.0015632459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993157,0.00007284654,0.0001744927,0.00021124701,0.00011980548,0.000105900326],"domain_scores_gemma":[0.9992659,0.00023998288,0.000087037806,0.00022690326,0.00011727849,0.00006287664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021606611,0.000077112054,0.00006493195,0.000038378163,0.0007037568,0.00023626548,0.0003012962,0.000027914932,0.0000052785813],"category_scores_gemma":[0.000017163105,0.00005894055,0.000025830428,0.00027844834,0.00007159749,0.0001646265,0.00006925828,0.00005019542,0.000014817908],"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":[7.111299e-7,0.000008151707,0.000012857837,0.0000014898991,0.0000022835227,3.7664197e-8,0.000016611451,0.37000614,8.7243626e-7,0.60976624,0.00019761025,0.019987002],"study_design_scores_gemma":[0.00017558316,0.000008175892,0.00010613363,0.0000017338415,0.0000024482754,0.000010044339,0.0000044903195,0.81776303,0.000006406142,0.13986745,0.041987054,0.00006742018],"about_ca_topic_score_codex":9.854808e-7,"about_ca_topic_score_gemma":3.0042258e-7,"teacher_disagreement_score":0.4698988,"about_ca_system_score_codex":0.000009648343,"about_ca_system_score_gemma":0.000023365441,"threshold_uncertainty_score":0.54128},"labels":[],"label_agreement":null},{"id":"W2067594519","doi":"10.1002/nla.428","title":"Asymptotic properties of the <i>QR</i> factorization of banded Hessenberg–Toeplitz matrices","year":2005,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Toeplitz matrix; Mathematics; QR decomposition; Factorization; Diagonal; Matrix decomposition; Matrix (chemical analysis); Combinatorics; Applied mathematics; Algebra over a field; Pure mathematics; Algorithm; Eigenvalues and eigenvectors; Geometry","score_opus":0.008905594285361623,"score_gpt":0.21267136045333165,"score_spread":0.20376576616797004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067594519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01022198,0.00021607375,0.987137,0.0011376007,0.00003337149,0.0004852232,0.000008571285,0.0000853865,0.00067477603],"genre_scores_gemma":[0.957874,0.000012128202,0.04164734,0.00010501668,0.00009497768,0.0000905513,0.0000029010591,0.000010240425,0.00016282526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989065,0.000060389684,0.00032523484,0.00024690074,0.00030358555,0.00015738908],"domain_scores_gemma":[0.998812,0.00007238123,0.00024487122,0.00064915273,0.00016074756,0.0000608285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119804645,0.00012320893,0.00018855833,0.000046803023,0.00012470142,0.000024151404,0.0007844951,0.000047954938,0.0000179099],"category_scores_gemma":[0.000021104162,0.00007249413,0.00006723402,0.0009535705,0.00013279027,0.00021839348,0.000114743336,0.00010786986,0.000022834283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006196437,0.0011288241,0.0029802204,0.00029056548,0.00012651728,3.6656152e-7,0.0013247894,0.007301954,0.022466384,0.90195215,0.00017480754,0.062191457],"study_design_scores_gemma":[0.0016623407,0.00042989675,0.006127289,0.00024018656,0.0001780333,0.00004186799,0.00015249614,0.18434416,0.7130809,0.023389421,0.06934007,0.0010133567],"about_ca_topic_score_codex":0.000013372547,"about_ca_topic_score_gemma":0.0000015380077,"teacher_disagreement_score":0.94765204,"about_ca_system_score_codex":0.000017609165,"about_ca_system_score_gemma":0.00008516853,"threshold_uncertainty_score":0.29562247},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067786975,0.00028929842,0.9905166,0.0001923454,0.000015257458,0.00018947173,0.00000600783,0.000054014406,0.0019583188],"genre_scores_gemma":[0.7392456,0.00011824317,0.25842205,0.0003278507,0.00010127933,0.00009358282,0.00001550625,0.000011269201,0.0016646213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956584,0.000009288143,0.00013253764,0.00014683955,0.000062358515,0.00008313682],"domain_scores_gemma":[0.9995807,0.000024841958,0.000058700236,0.00021307221,0.0000365297,0.000086176435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000064446314,0.000056523513,0.000070244336,0.000032337237,0.00006136996,0.000012699201,0.00024200839,0.000031300446,0.000050151557],"category_scores_gemma":[0.000009093824,0.00005107777,0.000020440535,0.00021105379,0.000010172084,0.00019222143,0.000063909196,0.000037366786,0.000027022195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016516897,0.000034777262,0.000019581332,0.000010062066,0.000005637115,7.060912e-8,0.00043510072,2.8086856e-7,0.0033674538,0.9577419,0.0005305473,0.03785292],"study_design_scores_gemma":[0.0009115909,0.00021331022,0.0010112541,0.00002707053,0.000035758578,0.000021471626,0.00008086319,0.047467202,0.2570927,0.51535314,0.1772832,0.0005023832],"about_ca_topic_score_codex":0.000011973449,"about_ca_topic_score_gemma":5.144567e-7,"teacher_disagreement_score":0.7324669,"about_ca_system_score_codex":0.0000023275888,"about_ca_system_score_gemma":0.000026142741,"threshold_uncertainty_score":0.20828912},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019429845,0.00006957263,0.99584913,0.00014709828,0.00033646074,0.0002906387,0.0000069780644,0.00038213728,0.00097499636],"genre_scores_gemma":[0.05800691,0.0000021082844,0.9411253,0.00016188857,0.0003683897,0.000010089757,0.000010004062,0.00002484873,0.00029046214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984846,0.000059494603,0.00041367026,0.00036619577,0.00026193258,0.00041406768],"domain_scores_gemma":[0.99861455,0.00039771418,0.00016506026,0.00059891917,0.00010602108,0.00011771412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047837672,0.00020679423,0.0003188028,0.000068300855,0.00020538362,0.00020703612,0.0008429874,0.000083142,0.00002346157],"category_scores_gemma":[0.00005375494,0.00017747095,0.000112636844,0.00044186992,0.000045172725,0.00024968575,0.0001183598,0.00011710954,0.0000850614],"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.000005959771,0.0010874128,0.000020647754,0.00015028122,0.000029729805,0.000023514578,0.00056260754,0.0005243282,0.0015198584,0.6416856,0.0016970901,0.35269293],"study_design_scores_gemma":[0.00031065792,0.0001640079,0.000026940561,0.000020064997,0.000010752157,0.000028235425,0.000027947475,0.8524691,0.00095960486,0.14164402,0.0040930957,0.00024561546],"about_ca_topic_score_codex":0.000008338767,"about_ca_topic_score_gemma":2.0894123e-7,"teacher_disagreement_score":0.85194474,"about_ca_system_score_codex":0.000023853132,"about_ca_system_score_gemma":0.000031432377,"threshold_uncertainty_score":0.72370553},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.981341,0.00015928574,0.016138196,0.0012186017,0.00008653545,0.00022013456,0.0000012335729,0.000008962243,0.000826039],"genre_scores_gemma":[0.990835,0.00013530703,0.008873702,0.000095031646,0.000031652187,0.0000033472254,5.6658095e-8,0.000003333588,0.000022548704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986547,0.00017401713,0.00050027546,0.00021388548,0.00027389827,0.00018319405],"domain_scores_gemma":[0.9985633,0.00065839075,0.00036369835,0.00026672755,0.0000702035,0.00007767415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003167734,0.00012336602,0.00027631456,0.000085617685,0.00008279406,0.000055811648,0.00045459822,0.000056320576,0.000016735125],"category_scores_gemma":[0.00013101817,0.00007799043,0.000048745813,0.00028060496,0.00013280846,0.00017777519,0.00009034785,0.00029180478,8.595022e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030398997,0.00026697837,0.010709733,0.00010553923,0.00002259997,0.00002618153,0.0020688304,0.00045781204,0.0013856757,0.9540253,0.000011994143,0.030615328],"study_design_scores_gemma":[0.0006807325,0.0004314601,0.01317008,0.000114046095,0.000010705666,0.00013262546,0.00031509838,0.020393934,0.0034884529,0.96092165,0.00014680729,0.00019443104],"about_ca_topic_score_codex":0.000013402671,"about_ca_topic_score_gemma":0.00000912169,"teacher_disagreement_score":0.030420898,"about_ca_system_score_codex":0.000039380804,"about_ca_system_score_gemma":0.000077003715,"threshold_uncertainty_score":0.31803575},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053731374,0.00008138005,0.9337686,0.0013990406,0.00025076407,0.00011863606,0.000003955314,0.00003901744,0.010607255],"genre_scores_gemma":[0.99540144,0.000012533329,0.0035208378,0.00061730464,0.000041961222,0.000011115866,5.820087e-7,0.0000037372508,0.00039046677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991799,0.00027843425,0.00015442191,0.00016477959,0.000114033464,0.000108403365],"domain_scores_gemma":[0.99860543,0.0008656643,0.00004670282,0.000377071,0.00006332386,0.000041805768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011858995,0.000085292006,0.00009976828,0.000040942283,0.00016478496,0.00006370894,0.0004433601,0.00003111922,0.00015543733],"category_scores_gemma":[0.00033846742,0.000048272716,0.000040879084,0.00016534241,0.00013203507,0.00013001788,0.00006283728,0.00012139407,0.000033272026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007564077,0.000017890932,0.000013106524,0.0000024727065,0.0000063825632,2.9600244e-7,0.00030499074,0.000014135711,0.0005829673,0.9836256,0.00006317142,0.015361422],"study_design_scores_gemma":[0.00021220918,0.00030549066,0.00020587617,0.000054717733,0.000008612472,0.000005488831,0.00029236858,0.11844548,0.01789594,0.86063224,0.0017655926,0.00017600469],"about_ca_topic_score_codex":0.0000075297826,"about_ca_topic_score_gemma":0.0000015356433,"teacher_disagreement_score":0.94167006,"about_ca_system_score_codex":0.0000064489936,"about_ca_system_score_gemma":0.000024718805,"threshold_uncertainty_score":0.19685042},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78705114,0.010245543,0.16780253,0.015270587,0.001040819,0.00078708393,0.000035309673,0.00039063115,0.017376356],"genre_scores_gemma":[0.97187227,0.00025076576,0.02680685,0.0004690914,0.000033174027,0.0000047886647,0.0000027322183,0.0000075546777,0.00055276055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992831,0.00011865905,0.00015663358,0.00019586807,0.000108603956,0.00013718441],"domain_scores_gemma":[0.999184,0.0002817973,0.000077318844,0.0003744,0.000035465255,0.000046996138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038656496,0.00008273375,0.00012473579,0.000036255344,0.000056630666,0.000032758,0.00036647051,0.000034480752,0.00017604773],"category_scores_gemma":[0.00043075066,0.00007523285,0.000025886231,0.000126414,0.00004344191,0.00007342379,0.00011993506,0.000050775685,0.000021127198],"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.00009316445,0.00068434316,0.014194987,0.0013702506,0.00018175234,0.000054394175,0.0036835605,0.000435792,0.048339512,0.48319155,0.3091143,0.13865641],"study_design_scores_gemma":[0.0029850702,0.00077060773,0.018508988,0.00059711287,0.00005684102,0.00020030844,0.0002678023,0.0025216735,0.26395983,0.039231047,0.6693726,0.0015280766],"about_ca_topic_score_codex":0.000021410351,"about_ca_topic_score_gemma":5.7508964e-7,"teacher_disagreement_score":0.4439605,"about_ca_system_score_codex":0.000004555195,"about_ca_system_score_gemma":0.00002043306,"threshold_uncertainty_score":0.30679065},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008119797,0.0005321392,0.9478931,0.03826854,0.00009548663,0.0007066716,0.0000023983475,0.00008713344,0.0042947605],"genre_scores_gemma":[0.98108363,0.00012567498,0.011151616,0.0027408593,0.00069312815,0.0008296892,0.0000061416504,0.000009223329,0.0033600423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994401,0.000025830692,0.00014220829,0.000151467,0.000100238394,0.00014015273],"domain_scores_gemma":[0.998911,0.00062352,0.000043577442,0.00030986077,0.00006091403,0.00005110034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021201711,0.00006171795,0.000047389334,0.000009913461,0.0007886692,0.00018213714,0.0004834214,0.00003096284,0.000042033516],"category_scores_gemma":[0.00003379245,0.00003301716,0.000028453438,0.00014428057,0.00003848132,0.00018313497,0.00014167972,0.00011992249,0.00015883158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.1250863e-7,0.000009050455,0.000011987363,0.0000018937634,0.000004885426,5.13494e-8,0.00008959958,0.000002623531,0.00015629345,0.91962636,0.0006361038,0.079460755],"study_design_scores_gemma":[0.0001680671,0.000042381467,0.0008705627,0.00000495417,0.000009040053,0.000026597709,0.00008775357,0.34275162,0.0027434267,0.36358386,0.28953052,0.0001812113],"about_ca_topic_score_codex":0.000012142544,"about_ca_topic_score_gemma":0.0000049632017,"teacher_disagreement_score":0.9729638,"about_ca_system_score_codex":0.000004348728,"about_ca_system_score_gemma":0.000030118896,"threshold_uncertainty_score":0.60658854},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7696841,0.00207358,0.16355161,0.041189186,0.00034730753,0.0013554237,0.000040396517,0.00028537074,0.021473065],"genre_scores_gemma":[0.8794612,0.00014690503,0.11227146,0.0029457335,0.00035610347,0.00006347098,0.000007499221,0.00006378776,0.004683825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99846655,0.00019972693,0.0003477877,0.0003409911,0.0002352364,0.00040968697],"domain_scores_gemma":[0.998487,0.00036464643,0.0000757003,0.00047110685,0.000048102633,0.0005534335],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00060526526,0.0001899771,0.00037095623,0.00019351042,0.00013194779,0.00009787132,0.00065311085,0.00010333792,0.0028378638],"category_scores_gemma":[0.000371641,0.00015828076,0.000079122176,0.00033226612,0.000079022604,0.000067917616,0.000094624316,0.00014652958,0.00047965604],"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.00006593322,0.00017507293,0.0001582854,0.0002770636,0.00008996152,0.00049730483,0.0011852481,0.00021506226,0.00024304198,0.97049606,0.01348637,0.013110591],"study_design_scores_gemma":[0.0048349444,0.0008056937,0.00045165373,0.00061112514,0.00011043836,0.00052524207,0.00030029283,0.26994824,0.0059196525,0.20215802,0.5124901,0.0018446309],"about_ca_topic_score_codex":0.0006838578,"about_ca_topic_score_gemma":0.000044494645,"teacher_disagreement_score":0.768338,"about_ca_system_score_codex":0.000039900424,"about_ca_system_score_gemma":0.000093728406,"threshold_uncertainty_score":0.9980737},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104760885,0.00020271841,0.88414586,0.0083034495,0.0010882849,0.0003676656,0.000007588688,0.000017088109,0.001106455],"genre_scores_gemma":[0.30611268,0.000099521836,0.69316727,0.00023234816,0.00018609322,0.000006880012,2.5754332e-7,0.000008313673,0.00018659851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998392,0.00002379847,0.00054324087,0.00015281438,0.00073449995,0.00015364039],"domain_scores_gemma":[0.9976349,0.0011492561,0.00048677303,0.00018589218,0.00047057949,0.000072628136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002111366,0.00011884358,0.00023944845,0.00012570297,0.00012568798,0.00016501045,0.0013090605,0.00003055555,0.000027916816],"category_scores_gemma":[0.0014275179,0.000064209125,0.000106224456,0.0002578329,0.00033676936,0.000325805,0.00015211539,0.00011015366,0.000008241223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013906549,0.0002658294,0.0000033309984,0.00006299427,0.000051232404,0.000005822273,0.00074706215,0.0006178005,0.00053831714,0.995472,0.00023657488,0.0019851443],"study_design_scores_gemma":[0.0005453556,0.0003662568,0.000014345375,0.0002511017,0.000024567807,0.00022833303,0.0003500415,0.021560937,0.0030512423,0.9731557,0.00035760071,0.00009452516],"about_ca_topic_score_codex":0.0000035512458,"about_ca_topic_score_gemma":0.0000018089881,"teacher_disagreement_score":0.2013518,"about_ca_system_score_codex":0.000023857681,"about_ca_system_score_gemma":0.00013812803,"threshold_uncertainty_score":0.2618372},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40374902,0.00064382964,0.58842766,0.0029827205,0.0001313566,0.00050370395,0.000026765452,0.0002899417,0.0032450024],"genre_scores_gemma":[0.9680653,0.00007141899,0.030653387,0.00021203587,0.00020586727,0.00006027602,0.000004972588,0.000006582163,0.0007201436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945194,0.000016118305,0.0000956681,0.00024795684,0.00006636117,0.000121945006],"domain_scores_gemma":[0.9994681,0.0000908321,0.000032882454,0.00026814526,0.000032804674,0.000107253305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015570538,0.00007943757,0.00007939113,0.000035582165,0.00020941942,0.00008541113,0.00021237132,0.000054282908,0.000017122662],"category_scores_gemma":[0.00001201819,0.00007103073,0.000017620761,0.00015965765,0.000041450952,0.00022012046,0.00014578569,0.00015551395,0.000051642302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.310667e-7,0.000026524265,0.000073107694,0.000009421484,0.000003760524,5.6760035e-7,0.00008787969,3.7416777e-7,0.010879732,0.9659512,0.000045767785,0.022920927],"study_design_scores_gemma":[0.0011534775,0.00015480055,0.013209114,0.000021906751,0.000058220732,0.00044085228,0.000068238114,0.2386726,0.04859754,0.38535473,0.31111807,0.0011504415],"about_ca_topic_score_codex":0.00000356077,"about_ca_topic_score_gemma":0.000003126125,"teacher_disagreement_score":0.58059645,"about_ca_system_score_codex":0.0000015978736,"about_ca_system_score_gemma":0.000012293313,"threshold_uncertainty_score":0.2896549},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045187376,0.000041010117,0.9529353,0.00024777692,0.0005617485,0.0002325304,0.000040216648,0.000068134075,0.0006859071],"genre_scores_gemma":[0.8402361,0.000043408112,0.1587398,0.00015290672,0.0006750634,0.000028266955,0.000023836395,0.00001912635,0.0000814482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994071,0.000041435575,0.00014315532,0.00016407075,0.00012272417,0.000121490215],"domain_scores_gemma":[0.9993276,0.00017763638,0.00012569044,0.00024666762,0.00008821574,0.000034184795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023798275,0.00008136747,0.00008988361,0.000027074198,0.0003011054,0.00013636639,0.00028473674,0.00004536967,0.0000071097857],"category_scores_gemma":[0.000024749303,0.00006200694,0.00004747179,0.00019040325,0.00009271729,0.00034284827,0.00006976855,0.00011078461,0.000009005677],"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.0000034806276,0.000030960135,0.0000014461054,0.0000073355686,0.000009593961,2.297955e-7,0.0003749006,0.00003156883,0.010937781,0.61730343,0.00028186743,0.37101743],"study_design_scores_gemma":[0.0002875284,0.00011832855,0.00019498979,0.0000063188327,0.000016401149,0.00000501384,0.00009407523,0.80102456,0.007585736,0.18447343,0.0060582105,0.00013539338],"about_ca_topic_score_codex":0.000011292349,"about_ca_topic_score_gemma":0.000002820383,"teacher_disagreement_score":0.800993,"about_ca_system_score_codex":0.0000066441353,"about_ca_system_score_gemma":0.000028599023,"threshold_uncertainty_score":0.25285697},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027384875,0.0010823308,0.94068354,0.02693431,0.00007004782,0.001440378,0.000025282747,0.00011908773,0.0022601706],"genre_scores_gemma":[0.99567235,0.00012302879,0.001286842,0.002244744,0.00013591384,0.00020075758,0.000008180411,0.0000048102333,0.00032336437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993817,0.00003650476,0.000118504715,0.00023318168,0.00009479876,0.00013530356],"domain_scores_gemma":[0.9988611,0.0006518582,0.00005374061,0.00034288882,0.000043584816,0.000046843725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032158924,0.00009263272,0.00007156206,0.000026439273,0.0006615673,0.00014859959,0.00035109106,0.000032289958,0.000014281743],"category_scores_gemma":[0.000028389954,0.00005012946,0.00003163352,0.00016211018,0.000065847365,0.00012273263,0.0000467363,0.00009429317,0.000013500761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036987892,0.000044899487,3.1463665e-7,0.0000032125774,0.0000052904925,1.03206126e-7,0.00019577955,0.000023064604,0.00016414755,0.9742008,0.00047231157,0.02488641],"study_design_scores_gemma":[0.00030180995,0.00018372596,0.00078626804,0.000011244549,0.000023205203,0.000013417035,0.00021022938,0.23143703,0.0020611752,0.7388952,0.025920276,0.00015642791],"about_ca_topic_score_codex":5.6561015e-7,"about_ca_topic_score_gemma":3.280598e-7,"teacher_disagreement_score":0.96828747,"about_ca_system_score_codex":0.0000037969528,"about_ca_system_score_gemma":0.0000123244,"threshold_uncertainty_score":0.5088308},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07860874,0.0000981584,0.9171213,0.0010215031,0.00021900063,0.000043098218,0.0000012437849,0.000027934066,0.0028590441],"genre_scores_gemma":[0.9807162,0.00002017612,0.018330058,0.00023238365,0.0006176177,3.7949488e-7,3.7125417e-7,0.000005400285,0.00007735783],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99924934,0.00010971184,0.00019927144,0.000074137046,0.0002499884,0.000117566655],"domain_scores_gemma":[0.9991571,0.00016667673,0.00018370207,0.00034016118,0.00007962993,0.000072772906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003687121,0.00006679152,0.000116440344,0.000012644515,0.00005181469,0.00005350828,0.00080434093,0.000023917904,0.00004163647],"category_scores_gemma":[0.000032647968,0.00004186254,0.000062325635,0.00023721285,0.00004424637,0.00068859826,0.0000633418,0.00019711906,0.0000139775275],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093914554,0.00062113034,0.000061573344,0.000029254908,0.00012655696,0.00002218487,0.0046287994,0.0047612214,0.6631098,0.18547802,0.01009011,0.1309775],"study_design_scores_gemma":[0.00039116386,0.00011045773,0.000016040649,0.000025275533,0.000040557763,0.00009796299,0.000045015422,0.17416896,0.4423755,0.38199943,0.00058595353,0.00014365943],"about_ca_topic_score_codex":0.0000016887137,"about_ca_topic_score_gemma":7.567399e-9,"teacher_disagreement_score":0.90210754,"about_ca_system_score_codex":0.000014535977,"about_ca_system_score_gemma":0.000009733641,"threshold_uncertainty_score":0.17071047},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8581967,0.000002769813,0.1406323,0.00012841339,0.00017477915,0.000032905165,4.6581334e-7,0.000059518086,0.0007721491],"genre_scores_gemma":[0.82338405,5.504205e-7,0.17635076,0.0000889016,0.000054327284,1.04657914e-7,2.817569e-7,0.0000017169979,0.00011933733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957067,0.000009090501,0.000051717907,0.00016680363,0.00008075791,0.00012098898],"domain_scores_gemma":[0.9996666,0.000024859895,0.000025067631,0.00021337294,0.000020793457,0.000049308925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009775585,0.000065551205,0.00006701123,0.00002163206,0.00012939246,0.00007929193,0.00025927427,0.000027885131,0.0000440639],"category_scores_gemma":[0.0000026911296,0.000043284133,0.0000048909924,0.000099170065,0.000044274137,0.00024349298,0.00013119362,0.00015226321,0.0000065642603],"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.00000924761,0.00001825808,0.012333278,0.000022223945,0.000011407086,0.00001110839,0.00037097637,0.00024487922,0.004554763,0.73722637,0.00006096604,0.24513654],"study_design_scores_gemma":[0.0015211186,0.00037872847,0.20903431,0.00003488546,0.000012345791,0.0005669131,0.000038327755,0.6325116,0.12389005,0.028272534,0.0028636735,0.00087550696],"about_ca_topic_score_codex":0.000010236719,"about_ca_topic_score_gemma":0.000012416397,"teacher_disagreement_score":0.7089538,"about_ca_system_score_codex":0.0000015694043,"about_ca_system_score_gemma":0.000010743358,"threshold_uncertainty_score":0.17650756},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.270402,0.00033030362,0.7230456,0.000055950877,0.0015807968,0.0005668498,0.00010683328,0.0002740742,0.003637611],"genre_scores_gemma":[0.98883754,0.00009461353,0.005636212,0.000048454483,0.00025456693,0.0000037800605,0.00002518226,0.000020897021,0.005078728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983306,0.00019642309,0.00019999627,0.00075479667,0.00007856249,0.00043964921],"domain_scores_gemma":[0.9982452,0.0003371857,0.000305677,0.00075512676,0.0001932031,0.00016360119],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040630563,0.00033610372,0.00036203,0.0001896728,0.00019430902,0.00012920334,0.0015907866,0.000281848,0.00008313011],"category_scores_gemma":[0.000060667084,0.0003438791,0.00022724309,0.000354525,0.0001127305,0.0006567292,0.0015558216,0.0003458434,0.00009216963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020278574,0.00018811908,0.002000207,0.00046477656,0.00020838685,0.00011172845,0.0031099024,0.002517248,0.00006127649,0.986857,0.00060536945,0.0036732208],"study_design_scores_gemma":[0.0019980436,0.0005125576,0.0022689062,0.00050032494,0.00047397456,0.00002428467,0.0015783568,0.47511706,0.0042470265,0.49578345,0.014329346,0.0031666912],"about_ca_topic_score_codex":0.00003803043,"about_ca_topic_score_gemma":0.0000054699303,"teacher_disagreement_score":0.7184355,"about_ca_system_score_codex":0.00009845471,"about_ca_system_score_gemma":0.00014561506,"threshold_uncertainty_score":0.9999013},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03120343,0.00084341585,0.8762981,0.042831518,0.00009497427,0.0009445784,0.000012592983,0.0003990257,0.04737232],"genre_scores_gemma":[0.98665214,0.000080249956,0.007233549,0.003272907,0.0004102106,0.00015993297,0.000003304236,0.000009549697,0.0021781395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937284,0.000037886624,0.000116215546,0.00022523513,0.00010598482,0.0001418483],"domain_scores_gemma":[0.9991826,0.00024398117,0.00003882759,0.0004401802,0.000030015259,0.00006442525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021554861,0.00008917226,0.00006702953,0.00003117052,0.00033066006,0.00010434324,0.0005172037,0.00003310982,0.00009851599],"category_scores_gemma":[0.000018638118,0.00005670401,0.00003236801,0.0002074176,0.000040806968,0.00017648198,0.00009962022,0.00012037889,0.00054148195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.9613653e-7,0.000031747593,7.1245717e-7,0.0000017968523,0.0000043713335,1.3539949e-7,0.00012932866,0.000019541725,0.000106378044,0.96340173,0.00057584525,0.03572761],"study_design_scores_gemma":[0.00021276575,0.000053225154,0.0000921322,0.000009942463,0.000009652193,0.000015443558,0.0000554149,0.13152866,0.0068133012,0.48322967,0.37775037,0.00022943322],"about_ca_topic_score_codex":5.419634e-7,"about_ca_topic_score_gemma":6.350498e-7,"teacher_disagreement_score":0.95544875,"about_ca_system_score_codex":0.000005310387,"about_ca_system_score_gemma":0.0000130496355,"threshold_uncertainty_score":0.6959835},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068509583,0.00055528124,0.9914403,0.00011820067,0.00010261179,0.00041724206,0.0000032167623,0.00008165645,0.00043054993],"genre_scores_gemma":[0.2939793,0.000049226084,0.7056887,0.000049689854,0.00007285691,0.00008721717,0.0000048803663,0.000011767888,0.000056384062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992107,0.0000069854227,0.00023254931,0.00024454604,0.00013530602,0.00016990249],"domain_scores_gemma":[0.999387,0.00027160672,0.000112620706,0.0001239106,0.000035389312,0.00006943816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029955813,0.00012302409,0.0001881559,0.000040008475,0.00023330467,0.00040458064,0.00012766222,0.00004682824,0.0000019217396],"category_scores_gemma":[0.00000925109,0.00011012519,0.000026093547,0.000086135544,0.000037702142,0.00012427253,0.00006680769,0.000052202067,0.0000071285026],"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.0000019865988,0.00006299389,0.0000011694593,0.00022464558,0.000018359453,0.0000017833963,0.0016256862,0.0018428055,0.00014474434,0.89964664,0.00018380859,0.09624537],"study_design_scores_gemma":[0.00044891366,0.000033864795,0.000010508297,0.00002022982,0.00000989636,0.00003758555,0.00009306676,0.8823186,0.000027165888,0.11657589,0.00029504663,0.00012922785],"about_ca_topic_score_codex":0.0000019291429,"about_ca_topic_score_gemma":1.1561601e-7,"teacher_disagreement_score":0.8804758,"about_ca_system_score_codex":0.000008718438,"about_ca_system_score_gemma":0.0000071983372,"threshold_uncertainty_score":0.44907752},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3307829,0.0001966489,0.6558035,0.011402903,0.00020536377,0.0007593792,0.0000039479564,0.000025511137,0.000819864],"genre_scores_gemma":[0.37997547,0.0000041407043,0.6190197,0.000055897894,0.00033274677,0.000023130971,1.9597358e-7,0.000019370393,0.0005693645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964458,0.0006529555,0.0006756826,0.00020688261,0.0014769563,0.0005417641],"domain_scores_gemma":[0.9969951,0.0015954027,0.0002565358,0.0004953101,0.0004200951,0.00023753603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008768795,0.00014751201,0.0003602046,0.00040650246,0.00023317702,0.0005430016,0.0017647184,0.00006951145,0.000035830933],"category_scores_gemma":[0.00038149374,0.000081216735,0.00011870857,0.0007705012,0.00013043634,0.00048685624,0.00061655574,0.00081208657,0.00008462154],"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.0002564676,0.0027026404,0.00087989547,0.0016035908,0.0004833135,0.0014753698,0.36267,0.0029554784,0.028719215,0.5155956,0.019526662,0.063131735],"study_design_scores_gemma":[0.0030855623,0.0022541108,0.003090617,0.0032084116,0.00004263516,0.003098707,0.21889965,0.6981576,0.020492276,0.044883084,0.0019258555,0.00086148037],"about_ca_topic_score_codex":0.00004714954,"about_ca_topic_score_gemma":0.000007291396,"teacher_disagreement_score":0.6952021,"about_ca_system_score_codex":0.00018088243,"about_ca_system_score_gemma":0.00020643084,"threshold_uncertainty_score":0.5236177},"labels":[],"label_agreement":null},{"id":"W2075200087","doi":"10.1007/s11075-009-9286-z","title":"Rayleigh quotient algorithms for nonsymmetric matrix pencils","year":2009,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rayleigh quotient iteration; Mathematics; Eigenvalues and eigenvectors; Rayleigh quotient; Convergence (economics); Matrix (chemical analysis); Theory of computation; Iterative method; Quotient; Algorithm; Mathematical analysis; Applied mathematics; Algebra over a field; Pure mathematics; Preconditioner","score_opus":0.021588814093993998,"score_gpt":0.29193035395969674,"score_spread":0.27034153986570275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075200087","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038366232,0.0006816627,0.9910551,0.0025661385,0.0013980455,0.0008485468,0.00003954191,0.00070290774,0.0023244217],"genre_scores_gemma":[0.121811785,0.00006883313,0.87237537,0.0017322607,0.0012632195,0.00015977063,0.00003490518,0.000052222986,0.0025016074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955958,0.00026916378,0.0007817264,0.0012271891,0.00088415504,0.0012419322],"domain_scores_gemma":[0.99696857,0.00073932606,0.00026978352,0.0011203204,0.0002998307,0.000602156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014804648,0.0005538646,0.00070354453,0.00044945476,0.00055823004,0.0003804518,0.002129242,0.0002442963,0.00009667371],"category_scores_gemma":[0.0003760053,0.00048519767,0.00047775498,0.0023110346,0.00008451858,0.0007898011,0.0002378768,0.00051020907,0.0003924973],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040082246,0.00069343223,0.000027251672,0.000024632744,0.000048073358,0.00006405847,0.0002955928,0.00020936887,0.00028666083,0.09652146,0.004158094,0.8976313],"study_design_scores_gemma":[0.00277062,0.0021553158,0.0013069392,0.00004671595,0.000067452165,0.00020009781,0.00009728172,0.78585166,0.005816136,0.089911744,0.11003133,0.0017447216],"about_ca_topic_score_codex":0.000022806664,"about_ca_topic_score_gemma":2.8178974e-7,"teacher_disagreement_score":0.8958866,"about_ca_system_score_codex":0.0001650544,"about_ca_system_score_gemma":0.00016588191,"threshold_uncertainty_score":0.99976},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20009677,0.0009819602,0.6702202,0.0068615754,0.0023332217,0.002142506,0.000026453657,0.0021932921,0.11514405],"genre_scores_gemma":[0.3027229,0.0027468165,0.58184,0.0116248485,0.0013464491,0.0007533991,0.00006806736,0.00018423685,0.0987133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99845093,0.00012465834,0.00028019064,0.0005120858,0.00022723035,0.00040488227],"domain_scores_gemma":[0.9990388,0.0000456533,0.0001004802,0.0005202449,0.00007110596,0.00022369332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047319103,0.0002120883,0.00019635183,0.00014087849,0.00029015413,0.00019455033,0.00048549258,0.00009377178,0.00013401899],"category_scores_gemma":[0.000018525769,0.00019344156,0.00007518224,0.0005583113,0.00012455799,0.00075568847,0.0002985623,0.00018496781,0.00038630998],"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.0000770577,0.0006436529,0.0060581053,0.00028636074,0.00025679843,0.00033840418,0.006595892,0.009384917,0.015287756,0.78557694,0.07075097,0.10474313],"study_design_scores_gemma":[0.0026459966,0.00023930748,0.000101680314,0.000082441,0.000047560217,0.0005217155,0.00017847435,0.2371769,0.0011639876,0.2089477,0.5479647,0.0009295773],"about_ca_topic_score_codex":0.00013566775,"about_ca_topic_score_gemma":0.00007667953,"teacher_disagreement_score":0.5766293,"about_ca_system_score_codex":0.00003494977,"about_ca_system_score_gemma":0.00006670993,"threshold_uncertainty_score":0.7888318},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014922123,0.0005274088,0.97845525,0.002098857,0.0004127498,0.00043500072,0.0000056920867,0.0004896964,0.0026532228],"genre_scores_gemma":[0.4629003,0.00006897523,0.5366569,0.0001908118,0.000046368783,0.00006664617,0.000011388563,0.000011472132,0.000047102403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980964,0.0004011707,0.0004990072,0.00047075335,0.00018804215,0.00034459308],"domain_scores_gemma":[0.99174505,0.00048455497,0.00017200546,0.0073753754,0.00011251181,0.000110472734],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00067733816,0.00021480511,0.00022679374,0.0002592294,0.00025771649,0.00012120273,0.00865518,0.000108296445,0.00004921994],"category_scores_gemma":[0.00008451516,0.00022063781,0.0000917823,0.0008627087,0.00015461321,0.00072779425,0.0037590927,0.00038622014,0.00029795582],"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.000009559669,0.0007060427,0.0026809636,0.000016160388,0.000036466685,0.000010164235,0.0053692586,0.00003829346,0.00016241046,0.81213313,0.00089078397,0.17794675],"study_design_scores_gemma":[0.0015459502,0.00025081984,0.04590357,0.0001092326,0.000025562904,0.00010225106,0.00010111046,0.6649694,0.0019679924,0.2632458,0.02065855,0.001119791],"about_ca_topic_score_codex":0.00013791044,"about_ca_topic_score_gemma":0.000050105824,"teacher_disagreement_score":0.66493106,"about_ca_system_score_codex":0.00007150453,"about_ca_system_score_gemma":0.000065945926,"threshold_uncertainty_score":0.99670845},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16872348,0.0028495796,0.8264238,0.00059702125,0.00009675032,0.0006738748,0.00005605055,0.000080542915,0.00049885974],"genre_scores_gemma":[0.70647144,0.00064926274,0.28989625,0.00032926025,0.00027242466,0.00021311035,0.000009669924,0.000021487047,0.0021371155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939346,0.00002037886,0.00016960813,0.00022020176,0.00007002775,0.00012629441],"domain_scores_gemma":[0.9994627,0.00010160722,0.000066439,0.00023613754,0.000057943547,0.00007515058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009092621,0.00008641165,0.00012754127,0.000057853762,0.0002266428,0.000046364003,0.00018260724,0.00005164442,0.00005156912],"category_scores_gemma":[0.000016531363,0.000074746655,0.000040686762,0.00016476373,0.00005417553,0.00019098482,0.00012778638,0.00004682569,0.000005100267],"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.000009256351,0.00014570418,0.00004428039,0.00008653832,0.000028812225,4.333791e-7,0.00064185576,0.000059825263,0.02839127,0.9564577,0.0006055411,0.0135288285],"study_design_scores_gemma":[0.0011205171,0.00007139938,0.000046456153,0.000033322307,0.000048366823,0.000021092437,0.000051098923,0.8587249,0.013604882,0.04464542,0.08133519,0.0002973814],"about_ca_topic_score_codex":0.0000028655807,"about_ca_topic_score_gemma":2.4854134e-7,"teacher_disagreement_score":0.91181225,"about_ca_system_score_codex":0.000003490683,"about_ca_system_score_gemma":0.000009498359,"threshold_uncertainty_score":0.30480802},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29000106,0.000025580406,0.70730364,0.000006941546,0.000048903294,0.00016130795,0.0000039962874,0.000021036722,0.002427486],"genre_scores_gemma":[0.8927351,0.000010365132,0.10719827,0.000013345524,0.000008497911,0.0000073630076,0.00000969708,0.000005848023,0.000011469585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993438,0.000029418039,0.00028796116,0.00014532183,0.00011119132,0.0000822761],"domain_scores_gemma":[0.99935764,0.00015827524,0.00025861032,0.00012123526,0.00006708949,0.000037166847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034084276,0.000099690806,0.00020789843,0.000048007954,0.000056489294,0.00003516099,0.00006760606,0.000050136445,0.0000046408586],"category_scores_gemma":[0.0000128041565,0.00008764157,0.000022388596,0.00013005584,0.000078753525,0.00011977971,0.00002817364,0.000043957436,0.0000035979215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023096004,0.00007025584,0.000015947266,0.0003697508,0.000020526268,5.2604474e-7,0.0018715705,0.0008053442,0.0036034826,0.9909227,0.000028312099,0.002289264],"study_design_scores_gemma":[0.00060752255,0.000043337655,0.000031470234,0.00009459636,0.000019930892,0.000048220674,0.0010773401,0.4864454,0.014487964,0.49691138,0.00007752808,0.00015528678],"about_ca_topic_score_codex":0.0000037081784,"about_ca_topic_score_gemma":2.2546084e-7,"teacher_disagreement_score":0.6027341,"about_ca_system_score_codex":0.0000067844085,"about_ca_system_score_gemma":0.000015904292,"threshold_uncertainty_score":0.35739195},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9880645,0.0021117283,0.0019348472,0.00012936741,0.0014976708,0.00025518768,0.00000969331,0.00010512434,0.0058918255],"genre_scores_gemma":[0.9872672,0.00020491134,0.0118546765,0.000025398795,0.000014534448,0.0000106670095,0.0000016601119,0.000013272862,0.0006076838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822444,0.00016669303,0.00048910495,0.00038000377,0.00044044934,0.00029930915],"domain_scores_gemma":[0.99847686,0.00015227706,0.00040182896,0.00069249986,0.00017397886,0.00010254429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041000295,0.00018093495,0.0003747881,0.00020653462,0.00007977986,0.000051694926,0.0010643122,0.00009004007,0.00016262587],"category_scores_gemma":[0.000053524345,0.0001723975,0.00013708178,0.0008412554,0.00009284318,0.00055666274,0.000267343,0.00011937281,0.000049360737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022743387,0.0004988641,0.0006472921,0.00009052765,0.00005943223,0.000021281332,0.0014183912,0.000021817259,0.0075347293,0.98104733,0.0014523873,0.0071852044],"study_design_scores_gemma":[0.0065191695,0.0010453427,0.0046142144,0.00029213016,0.00011330244,0.00006164921,0.00020841608,0.039603658,0.25030628,0.69353396,0.0025715567,0.0011303301],"about_ca_topic_score_codex":0.00005753129,"about_ca_topic_score_gemma":2.3177017e-7,"teacher_disagreement_score":0.2875134,"about_ca_system_score_codex":0.000026919151,"about_ca_system_score_gemma":0.00003081469,"threshold_uncertainty_score":0.70301664},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13314676,0.00031069384,0.8603326,0.0035089725,0.00038234465,0.00028787015,0.0000035003259,0.0003556493,0.0016716289],"genre_scores_gemma":[0.5470387,0.00006765709,0.45238018,0.00039655578,0.00004490381,0.000018365661,0.000014472956,0.000010340265,0.000028834182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980709,0.0002880873,0.0005393419,0.00044981876,0.0003037109,0.00034815993],"domain_scores_gemma":[0.994576,0.0009741495,0.00016102509,0.003998065,0.00018864319,0.00010214392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005741587,0.00022046771,0.0002554317,0.00033761904,0.00050710834,0.00011887397,0.0053001237,0.000091724854,0.000024435896],"category_scores_gemma":[0.000094060786,0.00022896854,0.000090096066,0.001386109,0.00021501906,0.00028355507,0.0027321705,0.000413621,0.00021563521],"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.000015343918,0.0024226522,0.0046519474,0.000042638807,0.00008861415,0.00009347566,0.006677463,0.07320286,0.00007867753,0.27947906,0.0031604876,0.6300868],"study_design_scores_gemma":[0.00067938596,0.000051744017,0.032801162,0.000047157842,0.0000047802328,0.00016390841,0.000017203902,0.94758385,0.00006511197,0.016113074,0.002108788,0.0003638028],"about_ca_topic_score_codex":0.000053557138,"about_ca_topic_score_gemma":0.000020647803,"teacher_disagreement_score":0.874381,"about_ca_system_score_codex":0.000086708,"about_ca_system_score_gemma":0.00017136331,"threshold_uncertainty_score":0.9849037},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057307158,0.00037941267,0.9402197,0.0011347972,0.00009854284,0.000035354667,0.000008204188,0.000016340575,0.0008005037],"genre_scores_gemma":[0.94398755,0.000046127025,0.055671055,0.00025515066,0.000026278412,2.8502583e-7,5.1909336e-7,0.0000016415557,0.000011368304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991107,0.00009584731,0.00027251733,0.00018521554,0.00018730677,0.00014839233],"domain_scores_gemma":[0.99806535,0.0014458911,0.000107296866,0.00008641676,0.000108288994,0.0001867797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003348351,0.00010706429,0.00021567661,0.000075954755,0.0001580496,0.00016237532,0.000115283074,0.000047640926,0.0000021425835],"category_scores_gemma":[0.0005733582,0.00007834029,0.000017310409,0.00008681956,0.00019833083,0.00040760168,0.000043146072,0.0003978673,3.5203638e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045507542,0.00005761149,0.0002360571,0.000008427037,0.000007637207,0.000050405666,0.00013102396,0.00014498724,0.000022726248,0.9831001,0.00013930567,0.016056182],"study_design_scores_gemma":[0.0002800855,0.00061362545,0.06320874,0.00006612828,0.0000108888835,0.00022879941,0.00002585603,0.1769605,0.0000066565085,0.7585077,0.0000053585236,0.00008561413],"about_ca_topic_score_codex":0.0000035374549,"about_ca_topic_score_gemma":2.2189856e-7,"teacher_disagreement_score":0.8866804,"about_ca_system_score_codex":0.000013597413,"about_ca_system_score_gemma":0.0000599238,"threshold_uncertainty_score":0.31946242},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049305395,0.0015386348,0.98950857,0.00244002,0.000030668623,0.0004436656,0.000018055847,0.00015076439,0.00093905575],"genre_scores_gemma":[0.37852478,0.00036634135,0.61509466,0.0009017526,0.0013212868,0.0008406253,0.00001919421,0.000021398633,0.002909988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993542,0.000012165031,0.00013958759,0.00025276048,0.00008642643,0.00015487945],"domain_scores_gemma":[0.99946266,0.00010173386,0.000043844495,0.00024539387,0.00006675966,0.0000796129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016670699,0.00008443862,0.000088214736,0.000044443153,0.00022136449,0.000081967395,0.00035237207,0.000039282946,0.0000137650495],"category_scores_gemma":[0.000013802885,0.000074359334,0.000039366965,0.00017503573,0.000018462963,0.00025959278,0.000073175346,0.000051550654,0.00007886983],"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.0000028765085,0.00004593494,0.0000035103653,0.000014834244,0.000009051356,8.5078675e-8,0.00013397049,0.0001434268,0.0004547769,0.86673903,0.00048096242,0.13197151],"study_design_scores_gemma":[0.00030274355,0.000046462315,0.00005317475,0.000005080263,0.000015047297,0.00001059665,0.000021819138,0.20453256,0.007990517,0.01533347,0.77148527,0.0002032754],"about_ca_topic_score_codex":8.3597956e-7,"about_ca_topic_score_gemma":6.912694e-7,"teacher_disagreement_score":0.85140556,"about_ca_system_score_codex":0.000005949498,"about_ca_system_score_gemma":0.000019427707,"threshold_uncertainty_score":0.30322856},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011479842,0.00020619044,0.9861522,0.0006416238,0.0011027645,0.00007060744,0.00012652704,0.0000052624487,0.00021498952],"genre_scores_gemma":[0.33079958,0.000011703643,0.6662937,0.00042455498,0.0009154048,0.0000020024584,0.000013269871,0.00001687528,0.0015229286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884593,0.000042039188,0.00041220055,0.00019129663,0.00020331582,0.00030522284],"domain_scores_gemma":[0.9982645,0.0006530813,0.00018897543,0.00018238714,0.00036983445,0.00034123383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019565725,0.0000958584,0.00015071903,0.00041687785,0.00014134443,0.000100766054,0.00025259444,0.000047169076,0.00003592457],"category_scores_gemma":[0.0006720173,0.000093623195,0.000046341072,0.00022682006,0.00005844497,0.00034442986,0.0000136703175,0.00019056766,0.0000035504743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051374536,0.00007834407,0.0030960534,0.0000528999,0.00008445625,0.001015872,0.0016063317,0.036810275,0.00017698015,0.88745046,0.024237098,0.044877477],"study_design_scores_gemma":[0.002731109,0.0007061586,0.031204825,0.0001877621,0.000047441536,0.0015365111,0.0005678651,0.39996874,0.0010208234,0.50668705,0.054606054,0.00073563476],"about_ca_topic_score_codex":0.0005335347,"about_ca_topic_score_gemma":0.006310643,"teacher_disagreement_score":0.3807634,"about_ca_system_score_codex":0.0001515194,"about_ca_system_score_gemma":0.0014191293,"threshold_uncertainty_score":0.38178432},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030846944,0.00006704947,0.96472836,0.0009178092,0.00009294582,0.000058708927,0.000002945408,0.000013007294,0.0032722177],"genre_scores_gemma":[0.9194484,0.000010558417,0.08017746,0.00017210124,0.00016253737,6.7297907e-7,0.0000022073375,0.0000016552744,0.000024405294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991964,0.000029482997,0.00036500712,0.00010790458,0.00023346132,0.00006772007],"domain_scores_gemma":[0.9982501,0.00008886544,0.0004500794,0.00010069242,0.0010791265,0.000031120788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003990489,0.00006511597,0.00012373169,0.00020483516,0.000056007353,0.000045121506,0.00061475526,0.000024541217,0.000001463648],"category_scores_gemma":[0.000033358017,0.00005572033,0.00003701996,0.0004465602,0.000043418528,0.0001796862,0.00008361393,0.00012909151,9.488697e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000180138,0.00020230813,0.00014058079,0.000004735884,0.000049051494,0.0000021902142,0.00038098387,0.0013852076,0.0031457518,0.72931975,0.00022550838,0.26512593],"study_design_scores_gemma":[0.005926734,0.0012262312,0.039305475,0.00052175246,0.000036898105,0.0012366117,0.00096874364,0.44230837,0.028999675,0.4541265,0.02441068,0.0009323333],"about_ca_topic_score_codex":9.637473e-7,"about_ca_topic_score_gemma":1.3729231e-8,"teacher_disagreement_score":0.8886014,"about_ca_system_score_codex":0.000018436333,"about_ca_system_score_gemma":0.000041765576,"threshold_uncertainty_score":0.22722091},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00096601446,0.000067499415,0.9953082,0.0011434461,0.00052209134,0.00017278593,0.00000946452,0.0002480521,0.001562432],"genre_scores_gemma":[0.0019692003,0.0000039059955,0.986762,0.0004652725,0.00018287361,0.00000891788,0.000011367064,0.000006797863,0.010589667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992305,0.000035447865,0.00013867229,0.00023701787,0.00016368918,0.0001946935],"domain_scores_gemma":[0.99928874,0.00007518109,0.00004159599,0.00032668698,0.00010421026,0.00016359499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039791001,0.00008964699,0.00010868932,0.00006501118,0.000058687856,0.000060919898,0.0005357271,0.000050813564,0.000017335395],"category_scores_gemma":[0.000046468685,0.00007187216,0.000059355614,0.00021509729,0.00001865712,0.0003443624,0.00018425955,0.00005979657,0.00010684003],"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.000012629794,0.00015346686,0.000008366319,0.000010043037,0.000013229579,0.000012053572,0.00028661708,0.000038105245,0.00008864564,0.22353514,0.03590121,0.7399405],"study_design_scores_gemma":[0.0009228688,0.00017423565,0.0000053789686,0.00000566496,0.0000039903916,0.000013467338,0.000073098214,0.84289354,0.001077134,0.055923507,0.098761275,0.00014585679],"about_ca_topic_score_codex":0.000012413386,"about_ca_topic_score_gemma":0.000001744818,"teacher_disagreement_score":0.8428554,"about_ca_system_score_codex":0.000028037406,"about_ca_system_score_gemma":0.000065540924,"threshold_uncertainty_score":0.29308614},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7841939,0.0013128466,0.20320909,0.0012248453,0.00042994064,0.0005227236,0.000055231656,0.0008166595,0.0082347905],"genre_scores_gemma":[0.93998265,0.00031895802,0.0517976,0.0008972789,0.00044266254,0.000013045406,0.000016702195,0.000026847756,0.0065042726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987512,0.00008179996,0.00023536662,0.00043896827,0.00017435782,0.0003182641],"domain_scores_gemma":[0.9992446,0.00011460357,0.000034307,0.0003822781,0.00004609468,0.00017815894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025175168,0.00019638707,0.00021950848,0.000058535417,0.00016821027,0.00009572706,0.00036547985,0.00009888944,0.0003287044],"category_scores_gemma":[0.000017137712,0.00017231,0.00008522806,0.0002173267,0.00009626984,0.000362536,0.00007059759,0.0002016893,0.00039510563],"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.00024169488,0.0004892033,0.0005792069,0.00014268719,0.00016515107,0.00030918603,0.008201701,0.0004697537,0.0055506583,0.12737948,0.00090828224,0.855563],"study_design_scores_gemma":[0.0024955114,0.00024858123,0.001528294,0.000056198984,0.000036612255,0.00020440294,0.00014325495,0.8802249,0.016981263,0.004848332,0.09240117,0.00083147915],"about_ca_topic_score_codex":0.000024331022,"about_ca_topic_score_gemma":0.0000023095306,"teacher_disagreement_score":0.87975514,"about_ca_system_score_codex":0.0000075344115,"about_ca_system_score_gemma":0.00002580296,"threshold_uncertainty_score":0.7026598},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03724376,0.0010347248,0.95649666,0.0013560192,0.000021855389,0.00040901045,0.00002310372,0.00012697806,0.0032878655],"genre_scores_gemma":[0.94542456,0.00004329335,0.05390369,0.000078088444,0.000108593325,0.00007641036,0.000010102051,0.000007808052,0.00034747616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941283,0.000019289819,0.0001528434,0.00019542276,0.0001089148,0.00011067321],"domain_scores_gemma":[0.9995506,0.000048766993,0.000078218625,0.00022305782,0.000053102358,0.000046262707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000818338,0.000077025514,0.00011796617,0.00004754632,0.000089684545,0.00002769416,0.00021188815,0.000029142555,0.000016653947],"category_scores_gemma":[0.0000028126708,0.000058405054,0.00002505092,0.00031957717,0.000032586693,0.00013535516,0.000063725674,0.000055621873,0.000031047242],"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.000006414363,0.00016033596,0.00023475797,0.0000546741,0.00001447809,0.000002028463,0.00013666546,0.00007808751,0.00087756885,0.9826311,0.00035376716,0.015450127],"study_design_scores_gemma":[0.0034868824,0.00084997766,0.032541875,0.0001382843,0.00017337275,0.00026644807,0.00016633808,0.39159325,0.053381942,0.26191613,0.25373697,0.0017485272],"about_ca_topic_score_codex":0.000017010185,"about_ca_topic_score_gemma":9.4479077e-7,"teacher_disagreement_score":0.9081808,"about_ca_system_score_codex":0.000003517405,"about_ca_system_score_gemma":0.000015335145,"threshold_uncertainty_score":0.23816891},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4516614,0.0012212945,0.527704,0.015366894,0.0011326161,0.0006966797,0.000027552083,0.0000923853,0.002097159],"genre_scores_gemma":[0.8120562,0.00012688247,0.18589304,0.00050439127,0.0006613003,0.0000083377945,1.8128151e-7,0.000011027507,0.0007386861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975516,0.00007940569,0.00074601645,0.00028273242,0.0009229649,0.00041723918],"domain_scores_gemma":[0.99762845,0.000819627,0.00079798186,0.0002191727,0.00030337393,0.0002314041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021270078,0.0001928822,0.0004061971,0.00021398644,0.00037118242,0.000465157,0.0014156041,0.00007712973,0.000072801755],"category_scores_gemma":[0.0004990273,0.00012479915,0.00020270028,0.00062824466,0.00018435814,0.0013640891,0.0001567113,0.00015145402,0.000037872484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028465458,0.0052420516,0.0024130763,0.0017077407,0.0004787962,0.00017228893,0.020565039,0.012532927,0.020177042,0.8169791,0.05633075,0.06311651],"study_design_scores_gemma":[0.002727133,0.0020254033,0.0004606902,0.001183839,0.00021921463,0.0011937735,0.0027431685,0.3088142,0.11170459,0.5117796,0.05579449,0.0013539033],"about_ca_topic_score_codex":0.000001509391,"about_ca_topic_score_gemma":0.0000020940174,"teacher_disagreement_score":0.36039478,"about_ca_system_score_codex":0.000053767446,"about_ca_system_score_gemma":0.00018447696,"threshold_uncertainty_score":0.50891614},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026432551,0.00012451482,0.97057545,0.0023376066,0.0000028243637,0.00022372956,0.0000050500757,0.000005881549,0.00029240196],"genre_scores_gemma":[0.93158674,0.000018466908,0.068208516,0.000036961967,0.000041359217,0.000046034536,0.0000022316958,0.0000034852812,0.000056209174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894553,0.000038422753,0.0005825758,0.0001473659,0.00018942457,0.000096686716],"domain_scores_gemma":[0.9989831,0.0002768309,0.00029650566,0.0001899445,0.00017206733,0.000081573955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005592502,0.000078555466,0.00032767365,0.00032512902,0.000056595298,0.00004172998,0.00024084539,0.000032818298,0.0000063716852],"category_scores_gemma":[0.000033478995,0.000061212595,0.00007880784,0.0012562406,0.000031406504,0.00013006032,0.0000683884,0.00007656808,0.0000039778815],"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.000002291724,0.00028919693,0.00024922215,0.000060573555,0.000052649968,4.0729805e-7,0.00012947373,0.0033370252,0.0028091867,0.9891119,0.0000070866604,0.003951014],"study_design_scores_gemma":[0.0002750843,0.000052187006,0.0024002993,0.000044010612,0.00021456057,0.000017889173,0.0000526134,0.6997126,0.0011184906,0.29457837,0.0014014266,0.00013246576],"about_ca_topic_score_codex":0.000011333165,"about_ca_topic_score_gemma":0.00001814426,"teacher_disagreement_score":0.90515417,"about_ca_system_score_codex":0.000011992211,"about_ca_system_score_gemma":0.000018241042,"threshold_uncertainty_score":0.24961773},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020845262,0.0004986141,0.9776893,0.00014863508,0.0001859533,0.00014802556,0.000016964297,0.00002882634,0.00043840305],"genre_scores_gemma":[0.31639352,0.0000074284185,0.6817878,0.000063550135,0.0012674266,0.000013598292,0.000004509202,0.000034187728,0.00042798612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982855,0.000037456903,0.00053485617,0.00018525995,0.00068802433,0.0002689401],"domain_scores_gemma":[0.9981582,0.0002951905,0.00045309472,0.00031290567,0.00043078282,0.00034982263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009195099,0.00017316267,0.00038802376,0.000045639244,0.000063321786,0.00018877213,0.00097104086,0.00008200319,0.000031623462],"category_scores_gemma":[0.00019217441,0.000113489514,0.00014262904,0.00017687229,0.000049869785,0.00025238137,0.00012771689,0.00022570166,0.0000048395473],"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.0029892395,0.015871895,0.00071986375,0.050570644,0.009115593,0.008575465,0.030848034,0.21899174,0.11242145,0.33528933,0.06353106,0.15107568],"study_design_scores_gemma":[0.0016259524,0.0002502179,0.0000026243606,0.00043719154,0.0000823846,0.0045954897,0.0004870864,0.9528714,0.016286764,0.021805016,0.0012546134,0.00030126283],"about_ca_topic_score_codex":7.407561e-7,"about_ca_topic_score_gemma":2.8262068e-8,"teacher_disagreement_score":0.7338796,"about_ca_system_score_codex":0.000072130264,"about_ca_system_score_gemma":0.00020979535,"threshold_uncertainty_score":0.4627968},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117800266,0.000045104625,0.87171453,0.00054059987,0.00020481115,0.00041093968,0.000008463094,0.000098566765,0.009176708],"genre_scores_gemma":[0.78800297,0.000004095889,0.21148293,0.00005655182,0.00011560922,0.000019005234,0.000007725728,0.000014163083,0.00029695648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964448,0.00021967155,0.0005166522,0.00040992085,0.0018743671,0.00053455384],"domain_scores_gemma":[0.9971325,0.0012562457,0.00019782053,0.00045723852,0.00079929177,0.00015689472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072764596,0.00017675447,0.00019484833,0.00042713445,0.00029397936,0.0007399213,0.0013874413,0.00006813907,0.00018115505],"category_scores_gemma":[0.0007795907,0.00014507769,0.000056067325,0.0004814594,0.00024069409,0.0010386392,0.00033879804,0.00035756433,0.00018148516],"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.000033177126,0.00048069473,0.0004131867,0.00015064103,0.00018225383,0.00019242293,0.0026688694,0.00039667008,0.008946283,0.9798146,0.00006366315,0.0066575245],"study_design_scores_gemma":[0.001147749,0.00027139563,0.00038539318,0.00056008267,0.000019796682,0.00012586093,0.0017704235,0.8969936,0.020624064,0.07730495,0.00032909703,0.00046758345],"about_ca_topic_score_codex":0.00002424714,"about_ca_topic_score_gemma":0.00001987665,"teacher_disagreement_score":0.9025096,"about_ca_system_score_codex":0.00019852142,"about_ca_system_score_gemma":0.00016694718,"threshold_uncertainty_score":0.7135078},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025606265,0.004732298,0.965649,0.0027725957,0.00004663665,0.0005398032,0.000024719677,0.00013173664,0.00049693],"genre_scores_gemma":[0.77495766,0.0071049277,0.20657092,0.0028618942,0.0012479073,0.0013679045,0.000060292416,0.000041613333,0.0057869093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936783,0.00002059847,0.0001537072,0.00024175068,0.00006942845,0.00014670579],"domain_scores_gemma":[0.9994424,0.00019487135,0.000046323108,0.00019043118,0.00004434707,0.00008163813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019168103,0.00008623548,0.00010318842,0.000052520245,0.00024435352,0.0000766902,0.00021113954,0.000039057664,0.000008247281],"category_scores_gemma":[0.000014658871,0.00007553452,0.00002689315,0.00017011416,0.000033360095,0.00024241307,0.00009960661,0.000047922116,0.000014532466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004737621,0.000027702468,0.00004539666,0.000043475513,0.000010581206,4.794671e-7,0.00029905787,0.0000056838117,0.00019388087,0.95612377,0.00018636743,0.04305887],"study_design_scores_gemma":[0.0007096517,0.00010602059,0.00048623845,0.000019208772,0.000032407395,0.000059551072,0.00021151829,0.13899252,0.0009851892,0.46206468,0.39595753,0.0003754711],"about_ca_topic_score_codex":0.000005620478,"about_ca_topic_score_gemma":0.0000012451422,"teacher_disagreement_score":0.7590781,"about_ca_system_score_codex":0.0000036969325,"about_ca_system_score_gemma":0.000013899922,"threshold_uncertainty_score":0.30802083},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3679222,0.00671685,0.60673606,0.00798434,0.00020952676,0.0018557267,0.00007206343,0.00060120114,0.007902027],"genre_scores_gemma":[0.9812857,0.00032414924,0.014967265,0.00063177414,0.00023522513,0.00025338805,0.000011173901,0.000016107206,0.0022752406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988612,0.00007242857,0.00030417024,0.00039128956,0.0001413232,0.00022958392],"domain_scores_gemma":[0.9991658,0.00015000957,0.00007428821,0.00046556926,0.000033787557,0.000110569235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027084886,0.00013689017,0.00019132967,0.00011635255,0.00013352533,0.00007939603,0.00042998165,0.00007779351,0.00017436329],"category_scores_gemma":[0.00003758935,0.00012610506,0.00005181254,0.00057932,0.000032287582,0.00034330998,0.00015402283,0.00014094979,0.00022461395],"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.0000026813454,0.00018905857,0.00019881944,0.000023727494,0.000008601061,0.000002395197,0.00038149467,0.000018071694,0.00025633903,0.96877,0.00042217723,0.029726617],"study_design_scores_gemma":[0.0019752467,0.00009686662,0.0062868106,0.000035382094,0.000021246144,0.00003452406,0.00005271337,0.6522799,0.0023258268,0.19346276,0.14266533,0.0007633844],"about_ca_topic_score_codex":0.000016875687,"about_ca_topic_score_gemma":0.0000075687317,"teacher_disagreement_score":0.77530724,"about_ca_system_score_codex":0.000015264519,"about_ca_system_score_gemma":0.000009761953,"threshold_uncertainty_score":0.5142416},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018297926,0.00058470154,0.9793428,0.00056137814,0.00002576287,0.00038973108,0.000040575298,0.00006962444,0.00068746286],"genre_scores_gemma":[0.872297,0.000035141944,0.12634127,0.000080360864,0.00018822936,0.00019684601,0.00002943752,0.000007826917,0.0008238999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995459,0.000010463969,0.00014202198,0.00015212527,0.000053931548,0.00009559415],"domain_scores_gemma":[0.99950284,0.00014932634,0.00004952456,0.00019262884,0.00007620676,0.000029485886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009290193,0.0000598627,0.000085394095,0.00003740567,0.0001356768,0.000025007812,0.0002175428,0.0000310495,0.0000043851323],"category_scores_gemma":[0.000014177665,0.000052894913,0.000030445117,0.00016072919,0.00004155555,0.000116349256,0.000053710162,0.000030154202,0.000007975348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014892038,0.000039933584,0.000036633624,0.00002329773,0.000003720489,4.6974197e-8,0.000045081193,0.000027175061,0.0013671861,0.9921757,0.00010412967,0.0061756163],"study_design_scores_gemma":[0.0007470865,0.0000918557,0.0014770351,0.00001726025,0.000027506881,0.000007046547,0.00006940346,0.20977871,0.08353667,0.4894013,0.21453159,0.00031452987],"about_ca_topic_score_codex":0.0000083903615,"about_ca_topic_score_gemma":0.0000029035305,"teacher_disagreement_score":0.8539991,"about_ca_system_score_codex":0.0000020818838,"about_ca_system_score_gemma":0.000015134524,"threshold_uncertainty_score":0.2156992},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20733708,0.00015921313,0.7779189,0.005588517,0.0005861422,0.00043060616,0.000032562944,0.00003821743,0.007908765],"genre_scores_gemma":[0.9946195,0.00010350004,0.0043399967,0.00043871216,0.00013833202,0.000014874666,0.0000028996935,0.0000058193805,0.00033634916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859196,0.00043470028,0.00039901942,0.00018648096,0.00027407715,0.00011375285],"domain_scores_gemma":[0.9986428,0.000495547,0.0003477303,0.00029500495,0.00016504864,0.00005384854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001697321,0.00010277108,0.00014580983,0.00016055992,0.00011487215,0.00006798802,0.0010750452,0.000043973756,0.00053443044],"category_scores_gemma":[0.000074798445,0.000070141694,0.000047094178,0.00019067251,0.00011328462,0.0003984182,0.000117197844,0.00019611698,0.000009740929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006198622,0.00022534345,0.00009537981,0.000006305978,0.00001939649,0.0000017294767,0.0006834233,0.000089387635,0.0050274963,0.97928464,0.00022824289,0.014276642],"study_design_scores_gemma":[0.00075336214,0.00015814658,0.0017957608,0.00008009588,0.0000066719463,0.00010195909,0.00018453559,0.06835808,0.006078721,0.9129784,0.009351968,0.0001522861],"about_ca_topic_score_codex":0.000003756884,"about_ca_topic_score_gemma":7.1505076e-7,"teacher_disagreement_score":0.78728247,"about_ca_system_score_codex":0.000025240344,"about_ca_system_score_gemma":0.000018668148,"threshold_uncertainty_score":0.5851639},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0151162725,0.000022629034,0.98377806,0.00052904646,0.0002675659,0.00012716655,0.0000032727803,0.000031335985,0.00012463673],"genre_scores_gemma":[0.0446889,0.0000055396176,0.9549131,0.00018217767,0.00017870912,0.0000028238323,0.000002812308,0.000012399052,0.000013531807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984092,0.00012381421,0.00065815385,0.00013198925,0.00050915545,0.00016767808],"domain_scores_gemma":[0.99736977,0.0004148197,0.0010605279,0.00023712276,0.00080134306,0.00011640193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042520778,0.00015545759,0.00031586702,0.00023581601,0.00010470527,0.000205427,0.0007396041,0.00002458334,0.000054239656],"category_scores_gemma":[0.00017851195,0.0001288593,0.000106206935,0.00057706627,0.00013190671,0.0010618495,0.000115745854,0.00016056788,0.000016388762],"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.0000037706538,0.00019158467,0.000008926672,0.000013352244,0.000065552704,0.000010154841,0.0015610676,0.82519424,0.00008687581,0.036452573,0.0003144486,0.13609746],"study_design_scores_gemma":[0.00024045154,0.0001789552,0.00005829974,0.00006231513,0.00001250842,0.00031993378,0.00034881747,0.82940054,0.00011370494,0.16912854,0.000016680091,0.00011925139],"about_ca_topic_score_codex":0.000008588464,"about_ca_topic_score_gemma":1.0909367e-7,"teacher_disagreement_score":0.13597822,"about_ca_system_score_codex":0.00006529168,"about_ca_system_score_gemma":0.00014034129,"threshold_uncertainty_score":0.525473},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5300132,0.00066072773,0.45291024,0.011786815,0.002164271,0.0007725191,0.00018487895,0.00012621627,0.001381095],"genre_scores_gemma":[0.9926436,0.00010991176,0.002409545,0.0030779424,0.0015080944,0.0000094585,0.000006040991,0.000050697934,0.00018473239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662006,0.00039489105,0.0007363638,0.00047672036,0.0008188238,0.0009531716],"domain_scores_gemma":[0.99656314,0.00038942695,0.0006549066,0.0009582032,0.0004827403,0.00095158746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011437366,0.0004593287,0.0005323576,0.000230318,0.0010695802,0.00046701683,0.002163836,0.00015877809,0.000048734317],"category_scores_gemma":[0.00011562159,0.00029641585,0.0004644897,0.00083171297,0.00031368743,0.0014549132,0.00012102411,0.0008211909,0.00011201928],"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.0002102308,0.0005624109,0.0061353277,0.00030910785,0.001613554,0.0104099,0.103648655,0.08324636,0.0070793615,0.39159262,0.12856098,0.26663148],"study_design_scores_gemma":[0.006653438,0.0017097212,0.006219496,0.00086908106,0.0006103805,0.013707723,0.003619619,0.46423367,0.11992364,0.2691293,0.10900047,0.0043234704],"about_ca_topic_score_codex":0.00090677675,"about_ca_topic_score_gemma":0.00028207788,"teacher_disagreement_score":0.46263036,"about_ca_system_score_codex":0.0002644863,"about_ca_system_score_gemma":0.0022270745,"threshold_uncertainty_score":0.9999488},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005708474,0.00044099195,0.99145865,0.00048646773,0.00051482656,0.00053417607,0.000008181722,0.00032470535,0.00052352337],"genre_scores_gemma":[0.97708297,0.0000054834213,0.021251343,0.00016783086,0.00014548538,0.00006502806,0.000004065993,0.000011430917,0.001266342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986968,0.000096434254,0.00024124554,0.00034499605,0.00018762003,0.0004328925],"domain_scores_gemma":[0.99917686,0.00011802854,0.00008758364,0.00042684938,0.000090802285,0.00009987176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005630629,0.00016144721,0.0002088478,0.000087463915,0.00031141317,0.00021442445,0.00047228916,0.000060910323,0.0000020036543],"category_scores_gemma":[0.000021759135,0.00012669511,0.000085581014,0.00022993538,0.00002853509,0.0003889701,0.000022009033,0.00008770967,0.00001719326],"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.000056015528,0.00024179317,0.000048603077,0.0001851051,0.00007172566,0.00003225151,0.0033608177,0.03417527,0.0008246156,0.9501963,0.00085451774,0.009952953],"study_design_scores_gemma":[0.0013028356,0.00048073856,0.00028976548,0.0002812596,0.000020120342,0.000037355487,0.00020426785,0.9845188,0.00040726067,0.0012090149,0.010841262,0.00040727828],"about_ca_topic_score_codex":0.000082976134,"about_ca_topic_score_gemma":0.000017952807,"teacher_disagreement_score":0.9713745,"about_ca_system_score_codex":0.000041291703,"about_ca_system_score_gemma":0.00005412966,"threshold_uncertainty_score":0.5166477},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0102137,0.000024882696,0.9877081,0.0005045093,0.00013241637,0.0007068743,0.000007701407,0.000118201104,0.0005836439],"genre_scores_gemma":[0.2918804,0.000008398442,0.70758176,0.0002433609,0.000048593025,0.00014919965,0.000011419171,0.000010795117,0.00006603613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988736,0.000014863188,0.0002784464,0.0003495053,0.00025648324,0.00022713846],"domain_scores_gemma":[0.99910045,0.00037370122,0.00012165297,0.00024302745,0.00006686464,0.00009433269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002765273,0.00017118125,0.00019967507,0.000113646034,0.00023435705,0.00016968923,0.00025916848,0.000058071462,0.000003698013],"category_scores_gemma":[0.000025258641,0.00015576446,0.00004274316,0.00022051088,0.000021169875,0.00006246243,0.000109278924,0.000070327886,0.00006890887],"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.000005385928,0.00021863396,1.1626172e-7,0.0000425112,0.000012778386,8.7130655e-7,0.0018295724,0.015024862,0.000506867,0.30893192,0.00012005449,0.6733064],"study_design_scores_gemma":[0.00043066381,0.00016150618,0.000015825584,0.00002952679,0.000014173704,0.000004080656,0.00003570791,0.90924144,0.00030080762,0.08949687,0.00009004988,0.00017934252],"about_ca_topic_score_codex":0.0000013478059,"about_ca_topic_score_gemma":1.9610067e-7,"teacher_disagreement_score":0.8942166,"about_ca_system_score_codex":0.000033462467,"about_ca_system_score_gemma":0.00000725974,"threshold_uncertainty_score":0.635189},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032571174,0.0005685919,0.94988656,0.001400937,0.002550111,0.001182509,0.0001911878,0.00032359562,0.011325359],"genre_scores_gemma":[0.5348003,0.00037720622,0.41482443,0.0027653975,0.0030642636,0.00066829106,0.00020460752,0.0002483832,0.043047123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972504,0.00015503741,0.0005901772,0.00077203603,0.0005308542,0.00070150633],"domain_scores_gemma":[0.9976312,0.000654667,0.00038723485,0.00094712526,0.00013093192,0.00024884366],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007462406,0.00047366167,0.00056268286,0.00015573401,0.0006987156,0.00017142465,0.0009610793,0.00023776169,0.0008782016],"category_scores_gemma":[0.00020766632,0.00044919067,0.0003783216,0.00035945547,0.00022012836,0.0004357309,0.00016436553,0.00033628725,0.0024475735],"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.00026628183,0.0011974113,0.000010340062,0.0006134032,0.00036955657,0.00022270576,0.016387962,0.0005723547,0.00036539155,0.8786987,0.09032776,0.010968124],"study_design_scores_gemma":[0.006478189,0.002654047,0.000114792434,0.0009623457,0.00032179622,0.00083748845,0.0008066487,0.6752206,0.018493474,0.09126967,0.19959843,0.0032424966],"about_ca_topic_score_codex":0.000005610061,"about_ca_topic_score_gemma":2.3856717e-7,"teacher_disagreement_score":0.78742903,"about_ca_system_score_codex":0.00006732247,"about_ca_system_score_gemma":0.0001317648,"threshold_uncertainty_score":0.999796},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9259066,0.00030336346,0.06688418,0.005797853,0.00035267713,0.00020809875,0.000014115927,0.000009777883,0.0005233586],"genre_scores_gemma":[0.9866403,0.000017466611,0.01293184,0.00024570388,0.00015374953,1.7688063e-7,1.3228606e-7,0.0000035156304,0.000007159938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988103,0.00015330642,0.0004893921,0.000060739527,0.00036575954,0.0001205032],"domain_scores_gemma":[0.99792874,0.0009411965,0.00068903196,0.0002575726,0.00010950013,0.000073955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009867721,0.00008986803,0.00037544908,0.000028085142,0.00003990769,0.000019909861,0.0003831703,0.00003379925,0.000003938802],"category_scores_gemma":[0.00016164135,0.00004743088,0.00010267992,0.000104524945,0.0001587165,0.00027159377,0.000113973445,0.00018687228,0.0000016261025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016037778,0.00021181963,0.0000056568265,0.00012672851,0.000049578026,0.0000010837819,0.0017532184,0.000016864378,0.001980471,0.9934407,0.000451558,0.001801948],"study_design_scores_gemma":[0.0013522418,0.00015314978,0.00012019851,0.00013587406,0.00004231378,0.000039456198,0.00008461566,0.0024748896,0.074440464,0.9210294,0.00006156447,0.000065857894],"about_ca_topic_score_codex":6.4943305e-7,"about_ca_topic_score_gemma":1.1049575e-8,"teacher_disagreement_score":0.072459996,"about_ca_system_score_codex":0.00000947058,"about_ca_system_score_gemma":0.000018640056,"threshold_uncertainty_score":0.19341752},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5063984,0.015668115,0.4751318,0.0006581311,0.0001475414,0.0011293978,0.00006209832,0.00013719535,0.00066734396],"genre_scores_gemma":[0.97010577,0.0007693326,0.028697219,0.00005330569,0.00009381844,0.000059321803,0.000011478942,0.000010033751,0.00019975283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989775,0.00008322624,0.00034770128,0.00020616621,0.00019622293,0.0001892285],"domain_scores_gemma":[0.9989448,0.0001881138,0.000265867,0.00035758517,0.00011929796,0.00012432243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004936498,0.0001327065,0.00024117573,0.00015371953,0.00015034011,0.000021781385,0.0003537778,0.00006485922,0.000010380473],"category_scores_gemma":[0.000022522658,0.00011891236,0.000053886215,0.00039477294,0.00008568054,0.00045201802,0.00020606714,0.00010993023,0.000009235678],"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.000012866829,0.000428361,0.0008539589,0.00021250703,0.0000416257,4.1885505e-7,0.0016096544,0.000012659643,0.003345434,0.9662383,0.000052935913,0.027191242],"study_design_scores_gemma":[0.012952781,0.001529014,0.03075743,0.00042051246,0.0007037672,0.0003701775,0.0015942869,0.5332794,0.13928798,0.21874134,0.05777362,0.0025896726],"about_ca_topic_score_codex":0.00001695532,"about_ca_topic_score_gemma":0.0000010115377,"teacher_disagreement_score":0.74749696,"about_ca_system_score_codex":0.000008579355,"about_ca_system_score_gemma":0.000031975644,"threshold_uncertainty_score":0.48491052},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012279158,0.00013745777,0.9758739,0.000161979,0.010824359,0.00024033038,0.000006422286,0.00010758906,0.00036884382],"genre_scores_gemma":[0.14372295,0.0000010197253,0.8548165,0.000105522464,0.0010032748,0.0000011999866,0.000008931697,0.000014624106,0.00032598895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976252,0.00030250748,0.00073788315,0.00051355123,0.00037727066,0.00044364072],"domain_scores_gemma":[0.9974772,0.0010256018,0.0005417365,0.00039546972,0.00035558353,0.00020441784],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.010727796,0.00017152163,0.00025211825,0.00041858768,0.0010233321,0.0019285402,0.00078009756,0.000070058355,0.00003289561],"category_scores_gemma":[0.00031669787,0.00014807837,0.00016860355,0.00056606584,0.0000648505,0.0006116258,0.0001755421,0.00031875542,0.000020895164],"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.00007071536,0.00015037434,0.000030036057,0.00005364986,0.000099355966,0.000053389394,0.003921534,0.6136011,0.007519483,0.023357563,0.0013163016,0.34982648],"study_design_scores_gemma":[0.00041019445,0.000086314416,0.00002913111,0.00024489235,0.000009627395,0.0001282311,0.00022643962,0.98609024,0.0045740264,0.003997607,0.0040131384,0.00019014093],"about_ca_topic_score_codex":0.0000026309058,"about_ca_topic_score_gemma":4.575685e-7,"teacher_disagreement_score":0.37248915,"about_ca_system_score_codex":0.00011800209,"about_ca_system_score_gemma":0.000079492114,"threshold_uncertainty_score":0.99910754},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02261116,0.00008337811,0.97501254,0.00010705405,0.0012664748,0.00071617047,0.000104676474,0.000042683023,0.00005585086],"genre_scores_gemma":[0.9782484,0.000014040562,0.021224206,0.000031822274,0.000107508655,0.00011259821,0.00000528311,0.000012432634,0.00024366204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988147,0.00007078491,0.0003438279,0.00019006713,0.00025334838,0.00032724487],"domain_scores_gemma":[0.9992667,0.00009525016,0.00013759916,0.00029618223,0.00010910214,0.00009517979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005546387,0.00013274232,0.00015118148,0.00012361283,0.00016662557,0.000033390377,0.00021812724,0.00005928985,0.00004285536],"category_scores_gemma":[0.0000030955498,0.00011887833,0.00009400547,0.00020828453,0.000024273246,0.00013036224,0.0000028745098,0.000086125554,0.000022449878],"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.0004083964,0.007646357,0.0002438671,0.0014476129,0.00027637932,0.000008166755,0.01672237,0.24207021,0.060213644,0.32926223,0.000593866,0.3411069],"study_design_scores_gemma":[0.0023932287,0.0011381974,0.0005584195,0.00006705884,0.00012121581,0.000016883756,0.00058186415,0.7525813,0.23796313,0.0002353738,0.00391629,0.00042705203],"about_ca_topic_score_codex":0.000013353059,"about_ca_topic_score_gemma":0.0000075430944,"teacher_disagreement_score":0.9556373,"about_ca_system_score_codex":0.00003529674,"about_ca_system_score_gemma":0.000050003888,"threshold_uncertainty_score":0.48477176},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2657336,0.00023809994,0.7286594,0.0020742326,0.0009554673,0.0002518421,0.000003779478,0.00019649856,0.0018870493],"genre_scores_gemma":[0.5594596,0.00005710239,0.44032076,0.00008388697,0.000042708536,0.000011214302,0.0000025971356,0.0000058173773,0.00001628938],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884737,0.00010121034,0.00040111493,0.00025588842,0.00017017109,0.00022423049],"domain_scores_gemma":[0.99388164,0.0006690602,0.00015003292,0.0051466324,0.000088027744,0.00006462382],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005252691,0.00013606844,0.00020905714,0.0002666443,0.00014282555,0.0001014457,0.007820747,0.00007939273,0.0000182312],"category_scores_gemma":[0.00005975749,0.00013573645,0.00007106588,0.0007779302,0.00012907079,0.00057221897,0.0036631771,0.000454322,0.000038223134],"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.000005488831,0.0006099149,0.012851868,0.00007467378,0.00005138924,0.000006672182,0.004983429,0.00020919854,0.008963144,0.44882327,0.0003970332,0.5230239],"study_design_scores_gemma":[0.0010535878,0.00013579367,0.027501656,0.00015453278,0.000014854919,0.00004391642,0.000066050314,0.8220381,0.015552631,0.11859041,0.014118926,0.00072950765],"about_ca_topic_score_codex":0.000079193174,"about_ca_topic_score_gemma":0.000037850332,"teacher_disagreement_score":0.82182896,"about_ca_system_score_codex":0.000016126987,"about_ca_system_score_gemma":0.000058708873,"threshold_uncertainty_score":0.9975474},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5741825,0.0005446719,0.37138566,0.0040106615,0.00052192074,0.0006201856,0.000005169137,0.000029282364,0.0486999],"genre_scores_gemma":[0.9086082,0.000068293135,0.08975693,0.000051555322,0.000096769116,0.0000036308934,1.3025029e-7,0.0000123994905,0.0014021017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978348,0.00021821063,0.0004892435,0.00010450432,0.0011008363,0.00025241173],"domain_scores_gemma":[0.99650955,0.0017178237,0.0003121691,0.00034241157,0.0009904079,0.00012761583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032639988,0.00008495348,0.00024872363,0.00046404585,0.000067287256,0.00014634675,0.0011923618,0.00004931511,0.00028749453],"category_scores_gemma":[0.0005564762,0.000056864163,0.00011597424,0.0004221047,0.000098581615,0.00035145166,0.00020751139,0.0004660033,0.00019963125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042842712,0.0013698257,0.0000231692,0.00036245963,0.0001633886,0.00009930467,0.0075161844,0.00012999844,0.006528962,0.9438466,0.022029495,0.017887793],"study_design_scores_gemma":[0.0005404274,0.001575207,0.00019722014,0.00067399646,0.000008839543,0.0002044267,0.0019236559,0.021398572,0.025747325,0.94724387,0.0003187039,0.00016772996],"about_ca_topic_score_codex":0.0000069409157,"about_ca_topic_score_gemma":1.5969236e-7,"teacher_disagreement_score":0.33442566,"about_ca_system_score_codex":0.000048861035,"about_ca_system_score_gemma":0.000096515636,"threshold_uncertainty_score":0.31478634},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080489516,0.00004090942,0.9150154,0.0015536854,0.00012480174,0.00008520362,4.0678506e-7,0.00009444809,0.0025956552],"genre_scores_gemma":[0.8087801,0.0000061542264,0.18762758,0.003088817,0.0003310838,0.000026008996,7.4787914e-7,0.00002121836,0.00011830669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991261,0.00010617816,0.00016998389,0.00022070829,0.00018058815,0.00019645298],"domain_scores_gemma":[0.99935246,0.00021922973,0.000047248384,0.00028689756,0.0000149173,0.000079231526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004953649,0.00011039196,0.00015925143,0.00004761221,0.00004394817,0.00011099292,0.0003477038,0.000029914701,0.0000043068385],"category_scores_gemma":[0.0000406484,0.00009470289,0.000027432912,0.000263926,0.000106579915,0.00037666026,0.00019517847,0.00014122199,0.000059982198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053124872,0.00006283753,0.00003823368,0.0000790774,0.0000070489114,0.000017893557,0.0018219313,0.00011113456,0.0021133323,0.9816789,0.00018459464,0.013879727],"study_design_scores_gemma":[0.00019673197,0.000015389312,0.000038861202,0.000048330472,0.000003757314,0.000020489575,0.00007592599,0.019596035,0.0009479757,0.9788247,0.00009390068,0.00013790652],"about_ca_topic_score_codex":0.0000011268794,"about_ca_topic_score_gemma":1.1566963e-7,"teacher_disagreement_score":0.72829056,"about_ca_system_score_codex":0.000026645675,"about_ca_system_score_gemma":0.000009483344,"threshold_uncertainty_score":0.3861872},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09170804,0.000038804552,0.9075035,0.00026504288,0.00031914058,0.00013242851,0.00000965594,0.0000041121307,0.000019271596],"genre_scores_gemma":[0.9612305,0.0000036809606,0.038538683,0.000043501946,0.00015824217,0.0000015874361,0.0000071831323,0.0000048981738,0.000011700203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991211,0.00006849751,0.00034880108,0.00008576197,0.0002921566,0.00008366858],"domain_scores_gemma":[0.99553955,0.0032324097,0.0005328357,0.000084232466,0.0005801188,0.00003086941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064792525,0.0000830702,0.00016733176,0.00006287432,0.00010823255,0.000028635095,0.00020005772,0.000025813943,0.000008181104],"category_scores_gemma":[0.00016975933,0.0000554964,0.00006605876,0.0002854726,0.00008335789,0.0003041007,0.000028116328,0.0000852285,3.6302364e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089136964,0.00003795188,0.00009892116,0.000045168552,0.00007708423,3.0962892e-7,0.0003463922,0.6016169,0.00032840774,0.37771538,0.00008577371,0.019558553],"study_design_scores_gemma":[0.0014564606,0.0008458647,0.009652846,0.00010366475,0.000071433504,0.000012761256,0.00003047935,0.54754895,0.015677826,0.42442465,0.00005299513,0.00012208744],"about_ca_topic_score_codex":0.0000027949761,"about_ca_topic_score_gemma":5.2330176e-7,"teacher_disagreement_score":0.8695225,"about_ca_system_score_codex":0.000011273327,"about_ca_system_score_gemma":0.000073229945,"threshold_uncertainty_score":0.22630775},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.432014,0.000013725232,0.5663423,0.00020600054,0.00030480168,0.00042166983,0.000008487409,0.000021772272,0.0006672303],"genre_scores_gemma":[0.99464667,0.000006337184,0.0050956802,0.000058603982,0.000023383307,0.00002247795,8.273472e-7,0.0000040702143,0.00014197952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993011,0.00003418101,0.00020205225,0.0001659525,0.00014768812,0.00014902352],"domain_scores_gemma":[0.998992,0.000437507,0.00015127029,0.00035177937,0.000038156468,0.000029267196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008085572,0.000090220135,0.00012392274,0.00004750571,0.0002582415,0.000045457098,0.00051885704,0.00003590438,0.00000799182],"category_scores_gemma":[0.000030517085,0.00004609607,0.000047583206,0.00013059539,0.0002252713,0.00014759322,0.00007683313,0.00011921671,0.0000014661119],"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.00001535763,0.000042476473,0.00023929247,0.00008453379,0.000017318273,1.18633224e-7,0.0011760875,0.0018107465,0.002726851,0.9934902,0.000110965135,0.00028602328],"study_design_scores_gemma":[0.0005211951,0.00017628397,0.00047094122,0.00004567087,0.000006759183,0.000006013874,0.00087659655,0.991399,0.0034605425,0.0028256034,0.00011401615,0.00009740606],"about_ca_topic_score_codex":0.000009834827,"about_ca_topic_score_gemma":0.000005062917,"teacher_disagreement_score":0.9906646,"about_ca_system_score_codex":0.0000110388255,"about_ca_system_score_gemma":0.000021625488,"threshold_uncertainty_score":0.1986211},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09361033,0.0017716996,0.8902199,0.00045657446,0.00006957873,0.00052793184,0.00009253377,0.00011067776,0.013140723],"genre_scores_gemma":[0.9647474,0.00013090989,0.034536906,0.00015493222,0.000046410383,0.00006484631,0.000016941995,0.0000058981113,0.0002957274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942225,0.000039233702,0.0001575736,0.00019134491,0.000084070394,0.000105515486],"domain_scores_gemma":[0.9994708,0.000134868,0.00008331035,0.00018042083,0.00007470048,0.00005595014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012522707,0.000073460455,0.000095720105,0.000062377076,0.000119671466,0.000028875253,0.00017299302,0.000039105187,0.000028239325],"category_scores_gemma":[0.000019211042,0.00006831337,0.000030097632,0.00029445556,0.00003662024,0.0001886221,0.000037791953,0.000054052147,0.00005595706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001348416,0.0000463595,0.000023569748,0.000013993193,0.000007765551,3.6466344e-7,0.0001281401,0.0000033182157,0.0015515253,0.99521184,0.000037322374,0.0029744315],"study_design_scores_gemma":[0.0018647757,0.00051316194,0.004953301,0.000088950444,0.00013151616,0.00016264532,0.0003591726,0.04457871,0.3012988,0.55880296,0.08617261,0.0010734309],"about_ca_topic_score_codex":0.0000016306694,"about_ca_topic_score_gemma":2.8156487e-7,"teacher_disagreement_score":0.8711371,"about_ca_system_score_codex":0.000003667445,"about_ca_system_score_gemma":0.000023213861,"threshold_uncertainty_score":0.27857384},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5761035,0.0013134959,0.41835335,0.002234936,0.00005619675,0.00080323743,0.000021756368,0.00020566331,0.00090788543],"genre_scores_gemma":[0.96048665,0.00054112205,0.038249884,0.0002334803,0.000112053465,0.00015395043,0.000008069755,0.000012307263,0.00020245441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935037,0.000023949862,0.00015266916,0.00021344234,0.000117986645,0.00014157237],"domain_scores_gemma":[0.9992623,0.00006700459,0.00008769133,0.0004314159,0.00006019041,0.00009141237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015555456,0.000087166416,0.00008724019,0.00004981744,0.00031158113,0.00007325604,0.00047663596,0.000029868404,0.0000034138816],"category_scores_gemma":[0.000006658487,0.00005469013,0.000024882896,0.00051336136,0.000100388555,0.00031941995,0.00007878472,0.0000736357,0.000024639427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006734301,0.000080440055,0.000067272194,0.0000129943255,0.000013002013,6.3351507e-7,0.00033634753,0.00015309219,0.0008149867,0.99002075,0.000014353936,0.008479408],"study_design_scores_gemma":[0.0027085468,0.000998994,0.0047646984,0.00007779371,0.000111988506,0.00009604346,0.00065409834,0.05376964,0.06014189,0.8162353,0.05945869,0.0009822856],"about_ca_topic_score_codex":0.000012485598,"about_ca_topic_score_gemma":0.000018606044,"teacher_disagreement_score":0.38438317,"about_ca_system_score_codex":0.000003929854,"about_ca_system_score_gemma":0.000034271583,"threshold_uncertainty_score":0.23964615},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030759789,0.0000032898986,0.96222216,0.004654781,0.00013964235,0.00013147833,0.0000041969547,0.00007837942,0.0020063103],"genre_scores_gemma":[0.5318216,0.000015788799,0.46301815,0.0049244612,0.000058272177,0.000009588843,0.000010788874,0.000010806901,0.00013051085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921453,0.000049012415,0.00022470624,0.00016663996,0.00020248738,0.00014260969],"domain_scores_gemma":[0.99949783,0.000048588143,0.00006228298,0.00027551825,0.000047588543,0.00006816335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013992451,0.00008520259,0.00009853097,0.00018090713,0.0001803102,0.000017438273,0.00038097927,0.000022667266,0.000048494116],"category_scores_gemma":[0.000027468199,0.00008118804,0.000049523846,0.00057190703,0.000038946924,0.0003118918,0.00002417285,0.00005998379,0.00005016118],"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.0000041316266,0.000057754343,0.000015237917,0.0000047961353,0.000003921732,0.0000035527407,0.001596757,0.9512744,0.00037964078,0.045049697,0.00074133277,0.00086875935],"study_design_scores_gemma":[0.00042148205,0.00017431423,0.00016739508,0.000024191513,0.000004840798,0.000022100368,0.00002647199,0.9880897,0.008323072,0.00022844618,0.0022684531,0.00024955568],"about_ca_topic_score_codex":0.0000030081517,"about_ca_topic_score_gemma":1.6249356e-7,"teacher_disagreement_score":0.50106186,"about_ca_system_score_codex":0.0000138459645,"about_ca_system_score_gemma":0.000022217904,"threshold_uncertainty_score":0.33107522},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011003976,0.000094610965,0.9870099,0.0003871502,0.00012698003,0.0004940351,0.000003841608,0.000117191026,0.0007623402],"genre_scores_gemma":[0.2774735,0.0000034180773,0.72220236,0.000045848625,0.00008992627,0.000035749064,0.000005180352,0.0000111463005,0.00013284043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889016,0.00003437181,0.000453348,0.00019679862,0.0002400967,0.00018522823],"domain_scores_gemma":[0.99896413,0.00030785718,0.000251561,0.00027015255,0.0001550787,0.000051198585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005610693,0.00012891972,0.00023652625,0.00011001791,0.00008345843,0.0000767728,0.00042908467,0.000048313635,0.0000066032485],"category_scores_gemma":[0.00005701628,0.000117964766,0.00009178305,0.00021670059,0.000032769392,0.00036773286,0.000063710206,0.00005099655,0.000035255136],"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.0000036675237,0.00055620086,0.0000041506974,0.0007017743,0.000047348403,6.2785324e-7,0.006974253,0.06736103,0.001621763,0.6828353,0.00038526463,0.23950864],"study_design_scores_gemma":[0.00027649672,0.00008034603,0.000009687962,0.00004012856,0.000009591875,0.000008260365,0.00003438066,0.7576169,0.0040580165,0.2373231,0.0004349951,0.00010810487],"about_ca_topic_score_codex":0.0000016678256,"about_ca_topic_score_gemma":8.747042e-7,"teacher_disagreement_score":0.6902559,"about_ca_system_score_codex":0.000022524202,"about_ca_system_score_gemma":0.000039424085,"threshold_uncertainty_score":0.48104638},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055243988,0.00030375057,0.99093866,0.0027232622,0.000004948097,0.00007309434,0.0000023130601,0.000006710314,0.0004228772],"genre_scores_gemma":[0.62023306,0.00013197132,0.37882936,0.000066426124,0.0000782581,0.000018638199,2.1318377e-7,0.000003534024,0.00063856156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991799,0.000031039865,0.00036115336,0.00010844306,0.00022684569,0.00009259026],"domain_scores_gemma":[0.99900734,0.00019051996,0.00028426867,0.0002579474,0.00012545324,0.00013445578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032139724,0.00006922383,0.00031586914,0.00023725338,0.000054375047,0.00010975807,0.0004450076,0.000024928535,0.000061804865],"category_scores_gemma":[0.00003643886,0.000047208683,0.00017886408,0.0009003575,0.00003126619,0.00017911512,0.000073598254,0.00006374513,0.000008287166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044511394,0.0006479964,0.00016681531,0.00011369454,0.0005902463,0.0000046079945,0.0008034018,0.00039083807,0.0014151654,0.9501465,0.0007327414,0.044983536],"study_design_scores_gemma":[0.0008542648,0.00036739893,0.00104563,0.00013273844,0.0021452282,0.00017471057,0.0007031335,0.2754328,0.0036484373,0.68597734,0.028912572,0.00060573546],"about_ca_topic_score_codex":4.7045003e-7,"about_ca_topic_score_gemma":2.3711105e-7,"teacher_disagreement_score":0.61470866,"about_ca_system_score_codex":0.000004454043,"about_ca_system_score_gemma":0.0000040565897,"threshold_uncertainty_score":0.19251142},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55041945,0.009901493,0.39881653,0.018507129,0.0030000035,0.0033313865,0.000023924962,0.0009661518,0.015033923],"genre_scores_gemma":[0.99817437,0.000071095965,0.0011609566,0.0003700115,0.000012823796,0.000023764906,3.9525884e-7,0.0000027103242,0.00018389997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938893,0.000022304901,0.000100913494,0.00020474786,0.00010841231,0.00017470162],"domain_scores_gemma":[0.9994168,0.00013234158,0.000030525705,0.00030742705,0.000058362893,0.00005449801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029073327,0.00008830547,0.00008741355,0.000015933703,0.00023682254,0.00011503653,0.00037344027,0.000036434918,0.000009035612],"category_scores_gemma":[0.000026278829,0.000057690035,0.00005214704,0.00029870527,0.000037976726,0.00011634391,0.000045307035,0.00007808745,0.0000024005685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040998316,0.00005705443,0.00041730714,0.00001178612,0.0000024511562,6.793669e-7,0.00017425304,3.0742146e-7,0.0000093354165,0.9721418,0.00041033837,0.026770597],"study_design_scores_gemma":[0.00029521578,0.00017736321,0.004630087,0.0000034986256,0.000007441831,0.000010871249,0.000033612007,0.005285597,0.0001382503,0.98500323,0.0043168264,0.00009800087],"about_ca_topic_score_codex":0.0000016606549,"about_ca_topic_score_gemma":3.6219785e-7,"teacher_disagreement_score":0.44775486,"about_ca_system_score_codex":0.000005233155,"about_ca_system_score_gemma":0.000019459665,"threshold_uncertainty_score":0.23525314},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2844429,0.0006435827,0.71387,0.00032767557,0.000027658842,0.00007029998,0.0000037294667,0.000033505374,0.0005806929],"genre_scores_gemma":[0.983672,0.000064525404,0.016129348,0.000058531117,0.000011115393,0.000005971148,0.0000054259767,0.00000265581,0.00005042289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990802,0.00003142946,0.0002396578,0.00028449664,0.00023081586,0.00013343057],"domain_scores_gemma":[0.99950206,0.00015446794,0.00010203321,0.00015019071,0.00004068284,0.000050548715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015871902,0.00009843361,0.0002305654,0.00025833855,0.000059742877,0.000041736992,0.00026193992,0.00003300275,0.00013364569],"category_scores_gemma":[0.0000058585692,0.00009161275,0.000074781834,0.0011907535,0.00006367027,0.000121668636,0.00009616325,0.00006845353,0.000019564855],"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.0000078302555,0.000130624,0.002478179,0.00002391042,0.00022057409,0.0000062901786,0.00063884753,0.017644936,0.0003375389,0.9554005,0.00004177163,0.023068944],"study_design_scores_gemma":[0.00027833707,0.000014662421,0.0117466645,0.0000056625468,0.000051518426,0.0000015600477,0.000048117312,0.9561742,0.00073795207,0.030713204,0.00010148144,0.00012663017],"about_ca_topic_score_codex":0.000013442813,"about_ca_topic_score_gemma":0.000001860864,"teacher_disagreement_score":0.93852925,"about_ca_system_score_codex":0.000010459576,"about_ca_system_score_gemma":0.000012268638,"threshold_uncertainty_score":0.37358594},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007928294,0.00061455584,0.9896271,0.00066310924,0.00003440374,0.0004471031,0.000017158161,0.00012269383,0.00054558436],"genre_scores_gemma":[0.81412077,0.00017833531,0.18157132,0.000369547,0.00081533974,0.00095156534,0.000111800706,0.000021823726,0.0018594996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948984,0.000012203503,0.00013073062,0.00020363452,0.000058533064,0.00010506828],"domain_scores_gemma":[0.99960846,0.00007819032,0.00004489584,0.00016840141,0.00006821048,0.00003186639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010266816,0.00006337486,0.000063798994,0.000046007764,0.00018258467,0.00007941621,0.00017633356,0.000032052987,0.000008543775],"category_scores_gemma":[0.000008103321,0.000057889818,0.000023987592,0.00021923649,0.000012976074,0.0002275984,0.000042564025,0.000026680775,0.00001859033],"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.0000014112362,0.000036164034,0.000016266857,0.000027834441,0.0000017003472,6.224918e-8,0.00003953324,0.00002037539,0.0013622312,0.98556,0.00019335873,0.01274104],"study_design_scores_gemma":[0.00046214944,0.00007513912,0.000527953,0.000011153072,0.000018496436,0.000009654681,0.000024746032,0.36298394,0.0103371795,0.33830974,0.28695264,0.0002872173],"about_ca_topic_score_codex":0.0000035224934,"about_ca_topic_score_gemma":0.0000014265935,"teacher_disagreement_score":0.80805576,"about_ca_system_score_codex":0.000004990315,"about_ca_system_score_gemma":0.000012079188,"threshold_uncertainty_score":0.23606782},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16115661,0.0065600714,0.7799066,0.006243139,0.00015928569,0.002792969,0.00016073308,0.0007289398,0.042291705],"genre_scores_gemma":[0.98378164,0.0004289064,0.01408374,0.00017076268,0.00009047523,0.00014516334,0.000004220632,0.000008121407,0.0012869857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993248,0.000027442577,0.00015919149,0.00025642305,0.00011456227,0.00011758468],"domain_scores_gemma":[0.9992331,0.0001758054,0.00008949591,0.00037645458,0.00005416741,0.00007093392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000893657,0.000087450484,0.000106482796,0.00006351334,0.00011244644,0.00002358872,0.00043649573,0.00004121912,0.000052544507],"category_scores_gemma":[0.000018832536,0.000075483964,0.000035790694,0.00034630048,0.00002928295,0.00017496952,0.00010461215,0.00007969951,0.00012748844],"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.000002438294,0.00016311713,0.00004194157,0.0000320431,0.000015796957,3.7206823e-7,0.00052681833,0.000034752185,0.0008787715,0.9739681,0.00046026162,0.023875616],"study_design_scores_gemma":[0.0011918262,0.0003818801,0.0016272835,0.000064689826,0.000042200238,0.000017827204,0.00017301296,0.74628854,0.060359042,0.050456446,0.1387015,0.0006957379],"about_ca_topic_score_codex":0.0000029768084,"about_ca_topic_score_gemma":3.553707e-7,"teacher_disagreement_score":0.9235116,"about_ca_system_score_codex":0.0000048501406,"about_ca_system_score_gemma":0.000004297898,"threshold_uncertainty_score":0.30781466},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24495809,0.0024739825,0.74999166,0.000830047,0.000042051775,0.0008032869,0.000024824902,0.00018776879,0.00068829686],"genre_scores_gemma":[0.99636805,0.00011272094,0.0030215753,0.00017335096,0.00007599648,0.000037886803,0.000007284403,0.0000053519284,0.00019781063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991732,0.00005990241,0.00022473693,0.0002561402,0.00012223786,0.00016374848],"domain_scores_gemma":[0.9994388,0.000055259254,0.00010253603,0.00025446413,0.0000821799,0.00006673666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028134874,0.0001040898,0.00014647559,0.00004980564,0.0001160023,0.000060282484,0.0003867383,0.00004037324,0.000011299416],"category_scores_gemma":[0.000015432299,0.00008470495,0.0000317761,0.00029740107,0.000032985194,0.00021134886,0.000057961835,0.00008838007,0.000025081015],"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.000032045304,0.0008736454,0.0032698773,0.0004596822,0.00011928556,0.0000047503695,0.006183797,0.0008085147,0.058479797,0.5973363,0.00034185327,0.33209047],"study_design_scores_gemma":[0.0025161884,0.0013416497,0.045805875,0.00045638945,0.00009949603,0.00009117731,0.00024587245,0.7162401,0.14317603,0.068227366,0.019682128,0.0021176822],"about_ca_topic_score_codex":0.000021861326,"about_ca_topic_score_gemma":0.0000050171184,"teacher_disagreement_score":0.75140995,"about_ca_system_score_codex":0.0000054922252,"about_ca_system_score_gemma":0.000030553587,"threshold_uncertainty_score":0.34541675},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08225533,0.0019572207,0.9126826,0.00005847327,0.0026243513,0.00022732235,0.000001225433,0.000019174524,0.00017430795],"genre_scores_gemma":[0.9992586,0.0000053015738,0.000559662,0.00000703952,0.00012479344,0.000004675886,1.0294937e-8,0.0000062638483,0.00003369459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978836,0.00009120823,0.0006081126,0.00018111218,0.00095443544,0.0002815195],"domain_scores_gemma":[0.9981321,0.0005288781,0.00048988656,0.00031404753,0.0003869341,0.00014813556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053261793,0.00014594728,0.0003390544,0.00040932852,0.00016488347,0.0003177912,0.00086084276,0.000040005045,6.6758906e-7],"category_scores_gemma":[0.00069859944,0.00008780316,0.00005674002,0.00089964934,0.00009207444,0.00057423214,0.000054605574,0.00019137657,0.0000029104458],"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.000004343731,0.000026307702,0.000010190104,0.00020923438,0.000023211434,0.000018498871,0.0007530032,0.61213785,0.013145567,0.37332785,0.000044644512,0.0002992633],"study_design_scores_gemma":[0.00029691105,0.00028092347,0.00011686081,0.0013128382,0.00001714524,0.0014756689,0.0006178102,0.99465823,0.0005464517,0.0001983774,0.00026711522,0.00021164872],"about_ca_topic_score_codex":0.000008790242,"about_ca_topic_score_gemma":9.3002434e-8,"teacher_disagreement_score":0.9170032,"about_ca_system_score_codex":0.000068739086,"about_ca_system_score_gemma":0.00019141224,"threshold_uncertainty_score":0.35805088},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04015559,0.0022553285,0.9558085,0.00040170533,0.000028343902,0.0011760412,0.000019222687,0.00005152512,0.000103711725],"genre_scores_gemma":[0.9840095,0.00005978079,0.014710238,0.00010460808,0.00020792686,0.00077997544,0.000011337823,0.0000112453945,0.00010537078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922186,0.00003822037,0.00025170017,0.00022448799,0.00007417531,0.00018956444],"domain_scores_gemma":[0.9990479,0.0003397798,0.00013097808,0.0003172503,0.00007096963,0.00009313111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036993215,0.00012865195,0.00015193316,0.000051796433,0.0004151985,0.00006138443,0.00018325956,0.000058526064,0.0000038001544],"category_scores_gemma":[0.000023184133,0.00008644251,0.000041083804,0.00022180422,0.00007055674,0.0003023516,0.0001194949,0.00008196424,0.0000024323865],"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.000008962448,0.00006017739,0.00024023368,0.00011476368,0.000029480558,1.5837502e-8,0.0009051715,0.0000067946585,0.00563612,0.94240284,0.00001588898,0.050579555],"study_design_scores_gemma":[0.0016080192,0.00018340314,0.006205681,0.000050015504,0.00019150798,0.00007447971,0.00066872814,0.79964787,0.0044789053,0.16978362,0.016538456,0.0005693361],"about_ca_topic_score_codex":0.0000029107543,"about_ca_topic_score_gemma":0.0000014912563,"teacher_disagreement_score":0.9438539,"about_ca_system_score_codex":0.000005065611,"about_ca_system_score_gemma":0.000014725001,"threshold_uncertainty_score":0.35250235},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056177538,0.00074435276,0.93838465,0.00033826067,0.00013039056,0.0001130476,0.00004538376,0.00020765248,0.003858727],"genre_scores_gemma":[0.9446645,0.00003793106,0.05211852,0.0004012717,0.00016685172,0.000009525668,0.000060305352,0.00001612223,0.002525006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968219,0.00063244544,0.00070163235,0.00072016043,0.00067465485,0.00044921436],"domain_scores_gemma":[0.9972589,0.00028136055,0.00037548284,0.0017082326,0.00019248949,0.00018353974],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0024990032,0.00028092077,0.00095251214,0.0018718147,0.0002001071,0.00012485668,0.0013588793,0.0001123209,0.00095417484],"category_scores_gemma":[0.00012318601,0.00024523228,0.0013507486,0.0108377775,0.00015784627,0.0004275902,0.00025101315,0.00016790646,0.000078268335],"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.00005930585,0.00068031845,0.0044736746,0.000040734292,0.05812826,0.00007060115,0.0047019087,0.24835478,0.00042004976,0.5458328,0.00079917663,0.13643838],"study_design_scores_gemma":[0.00028980616,0.000046705074,0.0018351095,0.000009684766,0.016127434,0.0000023795246,0.00012846726,0.96215636,0.0021103923,0.013710994,0.0031517774,0.00043088666],"about_ca_topic_score_codex":0.00004808078,"about_ca_topic_score_gemma":0.000032653224,"teacher_disagreement_score":0.8884869,"about_ca_system_score_codex":0.000058099846,"about_ca_system_score_gemma":0.00006742855,"threshold_uncertainty_score":1},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018106197,0.00012444214,0.99708223,0.00025828768,0.0009931462,0.0004002065,0.000009748269,0.00027268112,0.00067820423],"genre_scores_gemma":[0.11649847,0.000015049298,0.88048875,0.0002084923,0.000596711,0.00013578674,0.000019728606,0.000017885677,0.0020191043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891293,0.000022472417,0.0002372875,0.0003342501,0.00020089131,0.00029217984],"domain_scores_gemma":[0.99932,0.000117510266,0.000075763244,0.00029937818,0.000090914065,0.00009645849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033072018,0.0001345239,0.00016015796,0.00007015574,0.0001772392,0.0002563489,0.0004830826,0.000064753694,0.000011751033],"category_scores_gemma":[0.000029277984,0.00011395516,0.00008482246,0.00020972683,0.000016701842,0.00054488593,0.00007900441,0.00006232507,0.00003763658],"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.0000033878623,0.000057591293,0.0000047909534,0.000022037351,0.000015775593,0.000003826414,0.00023240547,0.0033640706,0.00018061546,0.942988,0.00018149901,0.052946035],"study_design_scores_gemma":[0.0020163686,0.0002090971,0.000052584586,0.000042246556,0.000009649861,0.000037024445,0.00009566679,0.8489993,0.0029271,0.13646978,0.008701256,0.0004398827],"about_ca_topic_score_codex":0.000037403468,"about_ca_topic_score_gemma":0.000001200502,"teacher_disagreement_score":0.8456353,"about_ca_system_score_codex":0.00006258402,"about_ca_system_score_gemma":0.00009415279,"threshold_uncertainty_score":0.46469566},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001532145,0.000119237855,0.9942858,0.0006328565,0.000544015,0.00017060891,0.000008935381,0.00025505794,0.0024512997],"genre_scores_gemma":[0.67213035,0.0000054852094,0.3177731,0.00053632504,0.001666785,0.00007630645,0.000018152768,0.000013071165,0.0077804187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915135,0.00002139776,0.00019048057,0.00022511673,0.00013066891,0.00028096515],"domain_scores_gemma":[0.99944913,0.00014738874,0.000047641086,0.00022465229,0.000039521314,0.00009165402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005848012,0.00007736859,0.00010625811,0.0000660847,0.00018254886,0.00012493649,0.00039432838,0.000053188745,0.00009796756],"category_scores_gemma":[0.000043823817,0.00006442403,0.00005416286,0.0001249229,0.000016874481,0.00041288428,0.00009056552,0.00006558759,0.00012758747],"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.000002552302,0.000107443455,0.00001595034,0.000050502058,0.000018300021,0.0000021247479,0.0003039573,0.0005326408,0.00030035214,0.97026145,0.006694157,0.02171056],"study_design_scores_gemma":[0.00033796066,0.00004590337,0.000011791065,0.000022162498,0.0000025685142,0.000017937184,0.000036840334,0.85827154,0.0010600775,0.0017347737,0.1383469,0.00011155949],"about_ca_topic_score_codex":0.0000024307787,"about_ca_topic_score_gemma":0.0000012013413,"teacher_disagreement_score":0.96852666,"about_ca_system_score_codex":0.0000189615,"about_ca_system_score_gemma":0.000029805267,"threshold_uncertainty_score":0.26271355},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8004881,0.0042169862,0.1917031,0.003248122,0.00017960269,0.00008655674,0.0000011722318,0.000025815918,0.000050526327],"genre_scores_gemma":[0.9947856,0.00045262743,0.0042861584,0.00018861891,0.00021367223,4.474774e-7,1.5422142e-7,0.0000067350807,0.00006596812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989602,0.00008289286,0.0002634349,0.00012483152,0.00023493092,0.000333706],"domain_scores_gemma":[0.99931264,0.000097264754,0.0002034956,0.00021526768,0.0000741852,0.00009712062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006053651,0.00010661176,0.0001563344,0.00010338319,0.00020234768,0.00008309754,0.00047600988,0.000044098157,0.0000157271],"category_scores_gemma":[0.000039559527,0.00006853629,0.000097299104,0.0002736477,0.000056166085,0.00041409035,0.00009461741,0.00049183297,0.000011059141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007612353,0.00021537887,0.000095767486,0.000028312938,0.000230102,0.0012283352,0.0030951197,0.00026508304,0.0022896456,0.9547698,0.000114365386,0.037591953],"study_design_scores_gemma":[0.005500307,0.0034780302,0.00034773367,0.00017259481,0.00014396002,0.04999362,0.0006987216,0.0073267967,0.03278183,0.885684,0.013124397,0.0007480094],"about_ca_topic_score_codex":0.000012280595,"about_ca_topic_score_gemma":0.000008565221,"teacher_disagreement_score":0.1942975,"about_ca_system_score_codex":0.000064707456,"about_ca_system_score_gemma":0.00023097514,"threshold_uncertainty_score":0.27948287},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053967274,0.00013524128,0.9958743,0.00056406116,0.0025489149,0.00019475928,0.000009004988,0.00008564983,0.00004841116],"genre_scores_gemma":[0.048451032,0.000013730506,0.9506065,0.00021527358,0.00061456003,0.0000311719,0.0000029705109,0.00001235952,0.000052385647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874026,0.00008102249,0.00038082976,0.00023885838,0.00023215097,0.00032687403],"domain_scores_gemma":[0.9989415,0.00049320504,0.000116272604,0.00015245573,0.00016975882,0.00012685372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016819814,0.00014235839,0.00020131591,0.00027456525,0.00006916828,0.00023541256,0.0011095377,0.00006132687,0.00001620728],"category_scores_gemma":[0.00047881043,0.00012775819,0.0001548761,0.00020455824,0.0000043847917,0.0006910384,0.000044081466,0.00022296017,0.0000013937508],"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.00013271817,0.00037190292,0.000044415887,0.000022711616,0.00007559183,0.0000431116,0.00035780197,0.020691581,0.011839257,0.32003057,0.00015101844,0.64623934],"study_design_scores_gemma":[0.00083440676,0.00022418983,0.00040139872,0.000037788686,0.000005437244,0.0001122862,0.0000139636495,0.92576987,0.0047583524,0.057071812,0.010574591,0.00019592566],"about_ca_topic_score_codex":5.244312e-7,"about_ca_topic_score_gemma":4.9187253e-8,"teacher_disagreement_score":0.9050783,"about_ca_system_score_codex":0.00008761042,"about_ca_system_score_gemma":0.000027773876,"threshold_uncertainty_score":0.5209828},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23875077,0.00008033756,0.75723284,0.000120213466,0.000017241442,0.00038752813,0.000026591539,0.000062742016,0.0033217287],"genre_scores_gemma":[0.9803936,0.0000140368875,0.0191694,0.00007549942,0.00004004759,0.000068761525,0.0000046293844,0.0000056517347,0.0002283618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999465,0.000019906898,0.00012132521,0.00020383939,0.00007917782,0.00011074509],"domain_scores_gemma":[0.9995099,0.00004047106,0.00006749511,0.00024619754,0.000065912456,0.00007003385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006942351,0.00007984253,0.00009376738,0.000040263145,0.00007644082,0.000013820355,0.00027109974,0.00002911044,0.000025398009],"category_scores_gemma":[0.000003005546,0.00006208888,0.000020074898,0.00018221742,0.000038473496,0.00014242431,0.00007832634,0.00005606348,0.000019586945],"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.000010263958,0.00015633255,0.0010270893,0.000029613097,0.00002349614,0.000002683759,0.0018660566,0.0000022923657,0.00043131254,0.9802988,0.000006381154,0.016145686],"study_design_scores_gemma":[0.0045189317,0.0034381428,0.27454826,0.00038574325,0.00034598127,0.00045625996,0.0014692552,0.092617616,0.48361692,0.118718244,0.016857782,0.0030268545],"about_ca_topic_score_codex":0.000016393255,"about_ca_topic_score_gemma":0.0000033582257,"teacher_disagreement_score":0.86158055,"about_ca_system_score_codex":0.000002767762,"about_ca_system_score_gemma":0.0000215791,"threshold_uncertainty_score":0.2531911},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030537486,0.00021476772,0.96029925,0.00038620958,0.00029327566,0.0005623016,0.000045430468,0.00016657273,0.0074946913],"genre_scores_gemma":[0.9420349,0.000009741621,0.053384155,0.00012829337,0.00021470277,0.00017282995,0.000014869642,0.000020585298,0.0040199407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985368,0.00018549926,0.00049569475,0.0002780062,0.00022382668,0.00028015787],"domain_scores_gemma":[0.9979656,0.0010247995,0.00024373975,0.00060333416,0.00010576091,0.00005680588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016917796,0.00015578567,0.0003384666,0.000120198274,0.00014037162,0.00009014745,0.0006347578,0.00006753491,0.000061790575],"category_scores_gemma":[0.00010631752,0.00012416176,0.00015968147,0.0003574741,0.00007404094,0.000444619,0.00013694359,0.00008590881,0.000115983144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016574333,0.00018589156,0.000023844632,0.0010150993,0.00003311303,0.0000019282936,0.00023477193,0.000049006983,0.0015354342,0.9948774,0.0010003358,0.0010266191],"study_design_scores_gemma":[0.00049726834,0.0000924492,0.0010666399,0.000093830124,0.00007024282,0.000013829384,0.00015618886,0.036463544,0.01296336,0.9474556,0.0008445551,0.0002825362],"about_ca_topic_score_codex":0.000020464304,"about_ca_topic_score_gemma":8.1985075e-7,"teacher_disagreement_score":0.9114974,"about_ca_system_score_codex":0.000024813555,"about_ca_system_score_gemma":0.000051428484,"threshold_uncertainty_score":0.50631696},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4346994,0.00017878486,0.51188,0.0010561302,0.0009339288,0.00026386755,0.000018109877,0.0003576656,0.050612137],"genre_scores_gemma":[0.9857117,9.632568e-7,0.013202176,0.000119270495,0.00003131265,0.0000010185677,3.9559959e-7,0.0000017627035,0.0009313897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938,0.00004677096,0.00015939996,0.00016106904,0.00013548213,0.000117265845],"domain_scores_gemma":[0.9993928,0.00013126804,0.00004103853,0.00034979728,0.000033469827,0.000051647505],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019351736,0.000057157064,0.00010600831,0.000027761771,0.00003611705,0.000015049644,0.00034120044,0.000026190111,0.0018385642],"category_scores_gemma":[0.000034571625,0.000044267865,0.000050219976,0.00013057668,0.000032623237,0.00017769799,0.00012134015,0.00003626421,0.00009005189],"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.000008741422,0.00058223656,0.0029484483,0.000036249352,0.000034068635,0.000008143317,0.000577064,0.0002076416,0.020237258,0.8762344,0.017126624,0.08199914],"study_design_scores_gemma":[0.0013125617,0.00041701266,0.01047956,0.000013582363,0.000010871191,0.000028111172,0.000032877848,0.3588929,0.34852672,0.24020112,0.039305355,0.00077935256],"about_ca_topic_score_codex":0.000017019715,"about_ca_topic_score_gemma":5.562956e-7,"teacher_disagreement_score":0.6360333,"about_ca_system_score_codex":0.0000073038655,"about_ca_system_score_gemma":0.0000075034845,"threshold_uncertainty_score":0.99907386},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10650505,0.000014832017,0.8753047,0.005047878,0.00009593165,0.00020910156,0.000019072662,0.00005376906,0.012749681],"genre_scores_gemma":[0.9799232,0.0000021432147,0.01881013,0.00044184623,0.000041282765,0.000012280676,0.0000055745145,0.000008555234,0.0007550239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991697,0.000030087784,0.00022415277,0.00017739135,0.00015230944,0.0002463455],"domain_scores_gemma":[0.99920225,0.00008291197,0.000070278526,0.0002897038,0.0000680277,0.00028683522],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00027177052,0.00009610374,0.00017164127,0.0002863236,0.000065138265,0.000046230634,0.00043367344,0.00005718161,0.0017970261],"category_scores_gemma":[0.00020628737,0.00008698856,0.000051665364,0.00063348043,0.000056884244,0.000070902795,0.000040801344,0.00008096959,0.002116863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001809403,0.00005627725,0.0000068118234,0.00006281556,0.000012145605,0.000029861045,0.0005728767,0.000013960512,0.00090633036,0.9935685,0.00013842719,0.0046302057],"study_design_scores_gemma":[0.0020207828,0.00041293312,0.0024137888,0.00044124975,0.00003481988,0.00015925725,0.00011231416,0.0044083116,0.052022554,0.8911849,0.04577123,0.0010178104],"about_ca_topic_score_codex":0.00016481493,"about_ca_topic_score_gemma":0.000026927934,"teacher_disagreement_score":0.8734181,"about_ca_system_score_codex":0.00007588915,"about_ca_system_score_gemma":0.00016786707,"threshold_uncertainty_score":0.99911547},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01652904,0.000088476256,0.9803035,0.0012258223,0.00056087825,0.00073174504,0.000031148105,0.00031621498,0.00021313175],"genre_scores_gemma":[0.81374866,0.000029756591,0.18470143,0.00026555613,0.000075804055,0.00006275329,0.0000028039806,0.000016601269,0.0010966277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984203,0.000059833805,0.00033182802,0.00047946328,0.0002718394,0.00043671273],"domain_scores_gemma":[0.99869215,0.00021672889,0.00009307863,0.00070376205,0.00013849126,0.00015579865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020380285,0.00024457826,0.00019610992,0.00017182455,0.00028790435,0.0001240817,0.00058929843,0.000124401,0.000029867599],"category_scores_gemma":[0.000012874801,0.0002454022,0.00016560915,0.00041786284,0.000047749083,0.00007227295,0.000002070394,0.00021976185,0.0000775174],"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.00023197473,0.0024513938,0.000001724266,0.00006552736,0.000036574573,0.000011714827,0.00094846316,0.17658123,0.10633216,0.043163702,0.0005884954,0.669587],"study_design_scores_gemma":[0.0011039342,0.0017763136,0.00016756107,0.000015485157,0.00004429506,0.0000189125,0.000018175726,0.9318887,0.06039347,0.003088164,0.0011252544,0.00035971135],"about_ca_topic_score_codex":0.0000030859464,"about_ca_topic_score_gemma":0.000002909862,"teacher_disagreement_score":0.79721963,"about_ca_system_score_codex":0.00007117602,"about_ca_system_score_gemma":0.00005103409,"threshold_uncertainty_score":0.9999998},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23049223,0.00047491767,0.07714728,0.6001561,0.0012692146,0.0026554265,0.00015854901,0.00036993017,0.087276325],"genre_scores_gemma":[0.9806834,0.000002267153,0.0021844623,0.010759324,0.00017744744,0.000014858159,0.0000011673313,0.00001659825,0.0061605005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786055,0.00055730087,0.00039900106,0.00030711532,0.00038437953,0.00049166527],"domain_scores_gemma":[0.99698114,0.0013034883,0.00011946935,0.0011381628,0.00006674127,0.00039100935],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014767903,0.00019310197,0.0002852038,0.00009895463,0.0003779209,0.000097208154,0.0016356688,0.00011789242,0.0026465794],"category_scores_gemma":[0.0009892272,0.000112113696,0.00020987196,0.00034109334,0.0002885353,0.00004834626,0.00011269277,0.00038176012,0.0019546703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006106388,0.000055114397,0.0000010328469,0.000007794151,0.000010819829,0.000014577376,0.0001126535,0.000010537228,0.00011879716,0.98862183,0.007909734,0.0031310297],"study_design_scores_gemma":[0.0002067318,0.00008826284,0.0008415241,0.00011906132,0.000021268863,0.00005201252,0.000057064768,0.0020115878,0.00077920454,0.97739714,0.018212797,0.00021334003],"about_ca_topic_score_codex":0.000023571505,"about_ca_topic_score_gemma":0.000021203932,"teacher_disagreement_score":0.75019115,"about_ca_system_score_codex":0.000050833456,"about_ca_system_score_gemma":0.0003382727,"threshold_uncertainty_score":0.99882245},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050064316,0.000011760518,0.9941564,0.0003913543,0.0025636402,0.00036748606,0.000022694272,0.00020213476,0.0017838666],"genre_scores_gemma":[0.99786764,0.000009011945,0.0011203845,0.00043434685,0.0000446866,0.00016016782,0.0000023764335,0.0000055146875,0.0003558787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987613,0.00029017474,0.00039492143,0.000110850946,0.0002183862,0.00022436706],"domain_scores_gemma":[0.99799126,0.0011166398,0.00015779851,0.0005367796,0.000131874,0.00006563277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023844843,0.00012213111,0.00011392431,0.0000936513,0.0006973927,0.00035104374,0.0005525195,0.00006144651,0.000015231987],"category_scores_gemma":[0.00004091271,0.00008353017,0.00011112814,0.00017111312,0.000058727383,0.001245716,0.0000022555948,0.00013745329,0.00020852091],"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.000055088953,0.000019316725,1.01997145e-7,0.000018102755,0.000015092102,2.8837023e-8,0.0006059551,0.0044124713,0.0000152351895,0.9575779,0.00016234019,0.03711838],"study_design_scores_gemma":[0.0009000208,0.00030359637,0.000010771986,0.000027135398,0.000014689848,0.000011241531,0.0006059375,0.63204783,0.0040396214,0.2532774,0.108469896,0.0002918852],"about_ca_topic_score_codex":0.0000030870456,"about_ca_topic_score_gemma":3.7833533e-7,"teacher_disagreement_score":0.99736696,"about_ca_system_score_codex":0.000035253073,"about_ca_system_score_gemma":0.000031679654,"threshold_uncertainty_score":0.5363851},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0173663,0.000100873,0.9804598,0.00033376677,0.00005846482,0.00015284322,0.000009001594,0.0000141125975,0.0015048498],"genre_scores_gemma":[0.9966583,0.0000016912396,0.0031889353,0.000022159993,0.000005950007,0.000008141744,3.291808e-7,0.0000011978605,0.00011328975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995009,0.000058584967,0.00018002737,0.000096248994,0.00008303598,0.0000812496],"domain_scores_gemma":[0.99950707,0.0002308168,0.000060263766,0.00013761819,0.00004238905,0.000021814936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024096419,0.000043656364,0.000116823474,0.000100434845,0.000028365977,0.000016741933,0.0001190123,0.00002230495,0.0000037390569],"category_scores_gemma":[0.000039521226,0.000035156692,0.000018913079,0.00018718153,0.00003773974,0.00013002632,0.000027452916,0.000038539452,0.0000030307929],"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.0000037436753,0.000053690088,0.000013960629,0.000011545777,0.0000047907192,8.351929e-7,0.00039331606,0.008738019,0.00067156047,0.9899414,0.000003077276,0.0001640171],"study_design_scores_gemma":[0.0033014023,0.00047912347,0.00049545907,0.0001982326,0.000009419021,0.000009194713,0.0003146707,0.7461459,0.0031632814,0.24567412,0.00004086752,0.00016830784],"about_ca_topic_score_codex":0.000081161095,"about_ca_topic_score_gemma":0.000014598788,"teacher_disagreement_score":0.979292,"about_ca_system_score_codex":0.000014848179,"about_ca_system_score_gemma":0.000036265512,"threshold_uncertainty_score":0.14336483},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55787575,0.0006663232,0.42990252,0.008241529,0.0005243899,0.0007812674,0.00017499467,0.00020665007,0.0016265563],"genre_scores_gemma":[0.943601,0.000013941605,0.05565109,0.00040894948,0.00015859866,0.000013403082,0.000021141419,0.0000068388185,0.00012499581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803704,0.00012598211,0.00026628096,0.00084050396,0.00027968627,0.00045052418],"domain_scores_gemma":[0.9990613,0.00032403367,0.00003065539,0.00041993783,0.000044604032,0.00011947103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095381844,0.00019716533,0.00026464002,0.00009719792,0.00050731725,0.00044497743,0.0010358496,0.00007539178,0.000036500038],"category_scores_gemma":[0.0000729902,0.00015924215,0.00004058121,0.00045400148,0.00022654011,0.0013747577,0.00021648186,0.00015976052,0.0000040796],"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.0009313955,0.0016473082,0.014377289,0.000845859,0.00025608053,0.000060283848,0.08242662,0.14358962,0.26597768,0.30715045,0.02110054,0.16163684],"study_design_scores_gemma":[0.0019028105,0.00032993287,0.0007112939,0.00018037429,0.000014061092,0.000028627273,0.00043807,0.9470259,0.03869611,0.005004745,0.005080693,0.0005873746],"about_ca_topic_score_codex":0.000032415628,"about_ca_topic_score_gemma":0.00008880966,"teacher_disagreement_score":0.8034363,"about_ca_system_score_codex":0.000020677768,"about_ca_system_score_gemma":0.000073253446,"threshold_uncertainty_score":0.6493706},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24338229,0.0008022728,0.75029296,0.0028368724,0.000033953715,0.00047898875,0.000012002407,0.00011957068,0.0020411203],"genre_scores_gemma":[0.98197246,0.000084702166,0.017374782,0.00032260997,0.000053926327,0.00001749533,0.000004071899,0.000003006186,0.00016697726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951094,0.000015647442,0.00012818487,0.00018687043,0.00007251971,0.0000858144],"domain_scores_gemma":[0.99961287,0.000052002422,0.000050163904,0.00019216065,0.000032437998,0.000060384897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008274179,0.00006802635,0.000088157016,0.000055101358,0.00009938936,0.000030819396,0.00014528426,0.00003420158,0.0000070185542],"category_scores_gemma":[0.000005725513,0.000061022405,0.000019376068,0.00016133279,0.000018911509,0.00012473113,0.000032879492,0.000056063123,0.000017685988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034133677,0.00005516385,0.000005494424,0.0000084882095,0.000002907812,2.8205528e-7,0.000067631474,0.00001025303,0.0023373282,0.9685463,0.000048510035,0.028914249],"study_design_scores_gemma":[0.0010559938,0.0007852129,0.006784166,0.00006753231,0.000033231696,0.00006228313,0.000027448968,0.14636475,0.038164653,0.79306215,0.013118833,0.00047373897],"about_ca_topic_score_codex":7.5252154e-7,"about_ca_topic_score_gemma":1.2992064e-7,"teacher_disagreement_score":0.7385901,"about_ca_system_score_codex":0.0000032228365,"about_ca_system_score_gemma":0.000008710952,"threshold_uncertainty_score":0.24884215},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028617216,0.001129167,0.9588164,0.0019245007,0.000093714785,0.0004023934,0.000023651659,0.00018010825,0.0088128215],"genre_scores_gemma":[0.9797107,0.00014761425,0.016494041,0.00013449551,0.00013970857,0.000096135926,0.0000052306978,0.000007267036,0.0032648193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938524,0.000022020347,0.00017709851,0.00020083628,0.00008981875,0.0001249739],"domain_scores_gemma":[0.99940205,0.000084707506,0.000052944517,0.00033274957,0.00004556806,0.00008197171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006779721,0.00007654106,0.000101187856,0.00006339692,0.00018343942,0.000025400115,0.00024673977,0.000034420184,0.00019170152],"category_scores_gemma":[0.0000135270475,0.00006864917,0.000040414856,0.00037504826,0.000038663296,0.00018100205,0.00006317364,0.0000785571,0.00020528141],"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":[5.925559e-7,0.00014363734,0.00002274212,0.000017055407,0.000012012954,4.7047158e-7,0.00036699674,0.000024773484,0.0022474318,0.9815566,0.00055816997,0.0150494985],"study_design_scores_gemma":[0.000992057,0.00030474094,0.0014994966,0.00004401561,0.00008646179,0.00009535258,0.00034303966,0.73077154,0.021225907,0.11586603,0.12800132,0.0007700092],"about_ca_topic_score_codex":0.0000016744177,"about_ca_topic_score_gemma":0.0000011109454,"teacher_disagreement_score":0.9510935,"about_ca_system_score_codex":0.0000038988023,"about_ca_system_score_gemma":0.000009249233,"threshold_uncertainty_score":0.2799432},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0376736,0.00041166917,0.95715606,0.0012343797,0.0023433522,0.0005958209,0.000013514617,0.000039167477,0.00053244684],"genre_scores_gemma":[0.34154943,0.000025255906,0.65215176,0.00022977935,0.00061380514,0.000018600027,0.0000036432696,0.000021909304,0.0053857965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972076,0.00055489247,0.0007234143,0.00055502314,0.00047076694,0.0004883427],"domain_scores_gemma":[0.9948448,0.0033804018,0.00050710415,0.0006684547,0.00048295705,0.00011626879],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.011375649,0.0002049652,0.0003109916,0.0001736327,0.001492288,0.0013395277,0.0014219146,0.000051227213,0.00010933719],"category_scores_gemma":[0.00030148868,0.00013910573,0.00021617762,0.00061649375,0.00023836715,0.0004947927,0.00012258522,0.00025775094,0.000007679019],"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.00056799746,0.00022965834,0.000030426656,0.00011141476,0.00019385583,0.000007720773,0.01580085,0.03838886,0.0054704966,0.37964985,0.012798839,0.54675007],"study_design_scores_gemma":[0.002103071,0.0014563015,0.0002431294,0.0003476554,0.000057416866,0.00015178214,0.0029723588,0.7613063,0.040630516,0.11463715,0.07553747,0.00055684324],"about_ca_topic_score_codex":0.0000020082666,"about_ca_topic_score_gemma":0.0000014583878,"teacher_disagreement_score":0.72291744,"about_ca_system_score_codex":0.00004431829,"about_ca_system_score_gemma":0.00031089206,"threshold_uncertainty_score":0.99980766},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79769105,0.0002474028,0.15782222,0.0022140644,0.00014673549,0.00016586535,0.00008442092,0.0005492671,0.04107899],"genre_scores_gemma":[0.9605568,0.00005108782,0.019159865,0.0006711896,0.00014853591,0.000006409205,0.00005537371,0.000009893252,0.019340847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998298,0.00015454108,0.00027695764,0.00056085497,0.00040799487,0.00030167488],"domain_scores_gemma":[0.99849415,0.00015994279,0.000078394194,0.0010448435,0.00006770132,0.00015499977],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040804176,0.00018302482,0.0005154784,0.00080695463,0.00016821537,0.00018182443,0.00080858485,0.000073377574,0.004545748],"category_scores_gemma":[0.000015375024,0.00015875007,0.0007749391,0.007514355,0.000048503614,0.00020021464,0.000046708305,0.00014297437,0.00061760686],"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.0001977468,0.0019794109,0.075460106,0.000044372573,0.07045093,0.00050362456,0.00456262,0.24219233,0.00027461222,0.07935546,0.0024050793,0.5225737],"study_design_scores_gemma":[0.00022541755,0.00007147057,0.0036600265,0.0000025529034,0.003471166,0.0000021743995,0.000037123784,0.9708894,0.001227557,0.00048171668,0.019570637,0.00036074227],"about_ca_topic_score_codex":0.000110417765,"about_ca_topic_score_gemma":0.00019205832,"teacher_disagreement_score":0.72869706,"about_ca_system_score_codex":0.000023826202,"about_ca_system_score_gemma":0.000024747542,"threshold_uncertainty_score":0.99636424},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41877085,0.0007641871,0.5707755,0.0075486614,0.0004787995,0.00037825125,0.0000042055008,0.00009344009,0.0011861025],"genre_scores_gemma":[0.9957632,0.000079925776,0.0030821674,0.00058640295,0.00014129234,0.0000010492349,0.0000013931286,0.0000054088578,0.00033916856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989836,0.00017096227,0.00022880483,0.00012071609,0.0003049854,0.0001909124],"domain_scores_gemma":[0.99919677,0.000019081454,0.00024916718,0.00039932257,0.00006979443,0.00006586467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065839256,0.00010161979,0.00010760649,0.000036089248,0.00040031102,0.00013790494,0.0013449915,0.000046881363,0.000018947841],"category_scores_gemma":[0.000016179993,0.000051927866,0.00007784218,0.00027194532,0.00003688675,0.00063945726,0.000067734036,0.00023350105,0.00000540969],"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.00040375482,0.0016786311,0.002456673,0.0001765566,0.00013151443,0.000035175006,0.021651816,0.019267539,0.13226104,0.37396228,0.117970474,0.33000454],"study_design_scores_gemma":[0.0013604177,0.00072131335,0.0038271735,0.00015512234,0.000051719384,0.0007238207,0.00036382454,0.7535579,0.04696509,0.18550417,0.006339124,0.00043029073],"about_ca_topic_score_codex":0.0000018998958,"about_ca_topic_score_gemma":3.7603616e-7,"teacher_disagreement_score":0.73429036,"about_ca_system_score_codex":0.000019423713,"about_ca_system_score_gemma":0.000044248878,"threshold_uncertainty_score":0.30789092},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011010038,0.00010919966,0.99681264,0.0007046311,0.00030063215,0.00032009918,0.0000056864947,0.000017761382,0.0006283165],"genre_scores_gemma":[0.42564628,0.000050145725,0.57365084,0.00013191762,0.00040083582,0.00002627654,0.0000102421845,0.000007510856,0.000075935015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992404,0.00007422375,0.00030221057,0.00012400384,0.0001415213,0.000117657684],"domain_scores_gemma":[0.9988076,0.0002679334,0.00045606116,0.00011221488,0.000313645,0.000042534262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010916446,0.00007994314,0.00012364665,0.000030169578,0.00024470096,0.00024971995,0.00026049995,0.000049991664,0.0000024336061],"category_scores_gemma":[0.0002304928,0.00005492245,0.000072963136,0.00014388651,0.000032679625,0.00074080506,0.000027954,0.00006737469,3.0428157e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046711782,0.00003276489,0.00012457455,0.000042868465,0.000028047561,4.3448814e-8,0.00021649033,0.8346738,0.000007587635,0.14895737,0.00021804076,0.015651656],"study_design_scores_gemma":[0.0006371909,0.00022457054,0.00053119246,0.00003202386,0.000036777168,0.00004060697,0.00004684257,0.97539705,0.000022884864,0.022562126,0.00039779078,0.00007093521],"about_ca_topic_score_codex":0.0000033666752,"about_ca_topic_score_gemma":0.0000013046039,"teacher_disagreement_score":0.4245453,"about_ca_system_score_codex":0.000049851904,"about_ca_system_score_gemma":0.00003861184,"threshold_uncertainty_score":0.24080552},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005469183,0.0016486471,0.99120855,0.00062525587,0.000043070748,0.00072589837,0.000021156056,0.000047071408,0.00021119158],"genre_scores_gemma":[0.6997859,0.00014854495,0.29927146,0.00031104856,0.000065266824,0.00021189994,0.000023365657,0.000007940237,0.00017458478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988499,0.00012603302,0.00039537493,0.00034859157,0.00008513049,0.00019492612],"domain_scores_gemma":[0.99823767,0.0011242754,0.00013967959,0.0003014186,0.00012271278,0.00007422482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008436353,0.0001355672,0.00022757056,0.000275514,0.00016413757,0.000028975612,0.00038599066,0.00006570375,0.000011946265],"category_scores_gemma":[0.00012575286,0.00012578547,0.000064728105,0.0011620685,0.0000495075,0.0004372744,0.000027499169,0.00010636545,0.0000058286982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054681736,0.000100345685,0.000023244422,0.000019031217,0.000009171621,1.5599987e-7,0.00060921296,0.000042934094,0.0024242334,0.91784847,0.0000033761303,0.07891436],"study_design_scores_gemma":[0.00043371317,0.00011327536,0.0018444866,0.00002365426,0.000025393745,0.0000024979686,0.00007450575,0.1764414,0.035396874,0.78438413,0.0010295276,0.00023053304],"about_ca_topic_score_codex":0.0000025880206,"about_ca_topic_score_gemma":7.187339e-7,"teacher_disagreement_score":0.69431674,"about_ca_system_score_codex":0.000011349522,"about_ca_system_score_gemma":0.00006033229,"threshold_uncertainty_score":0.5129383},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017137019,0.00052209775,0.9695572,0.0062394403,0.00005946359,0.0008006208,0.000020200208,0.000095125506,0.005568833],"genre_scores_gemma":[0.9873832,0.000088681154,0.011532234,0.00038677914,0.00009833954,0.00017751264,0.000004938017,0.000007555255,0.00032074968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990719,0.00006553144,0.00023510135,0.00027660807,0.0001922488,0.00015863134],"domain_scores_gemma":[0.9987562,0.00054518855,0.00015288476,0.0003843015,0.000102571015,0.00005886577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025683574,0.00011450317,0.00011699856,0.00014129959,0.00027228452,0.0000403984,0.00040812505,0.000054728807,0.0000464673],"category_scores_gemma":[0.000103713784,0.000083622384,0.00005038921,0.0010356042,0.000063287844,0.00018708505,0.00009329856,0.0001227663,0.00020135047],"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.0000026660462,0.00014159695,0.0000061511287,0.000011074655,0.000011367569,1.9770454e-7,0.000743036,0.000015313302,0.00082730333,0.941523,0.00020508327,0.05651321],"study_design_scores_gemma":[0.0003601164,0.00019971385,0.0007645097,0.000022317268,0.000023673723,0.00000775907,0.000059580656,0.936701,0.0130489655,0.042388745,0.0061992854,0.00022431699],"about_ca_topic_score_codex":0.0000044288,"about_ca_topic_score_gemma":9.1073497e-7,"teacher_disagreement_score":0.9702462,"about_ca_system_score_codex":0.000013654264,"about_ca_system_score_gemma":0.000014904413,"threshold_uncertainty_score":0.34100217},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8577513,0.00006304091,0.13992448,0.000011402914,0.00002842665,0.00008769699,0.000026686592,0.000015746013,0.002091233],"genre_scores_gemma":[0.9675125,0.0000091023985,0.032264166,0.000027945867,0.000009843158,0.000011465851,0.0000072938888,0.0000032476294,0.00015445685],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99943686,0.000012370534,0.00012752065,0.00025581574,0.000060598675,0.00010685622],"domain_scores_gemma":[0.99934626,0.000038246824,0.00008085519,0.00042146622,0.000040487965,0.00007270434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024923726,0.00006887418,0.0001694378,0.00003280547,0.000045096083,0.000058177975,0.0010420545,0.00003854837,0.0001698938],"category_scores_gemma":[0.000019050694,0.00006540906,0.000047297563,0.00031287014,0.000047664565,0.00025163536,0.0002483255,0.000030881867,0.0000012243308],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018984449,0.000900438,0.048284225,0.00062042975,0.0017383491,0.00003071046,0.003556158,0.00016285846,0.7948597,0.10145157,0.00027492936,0.04793079],"study_design_scores_gemma":[0.00023555267,0.000027885873,0.0040139034,0.000007849066,0.00011719083,0.0000026425296,0.00008651141,0.085392855,0.9056305,0.0042349915,0.00008443203,0.00016568071],"about_ca_topic_score_codex":0.000044713255,"about_ca_topic_score_gemma":9.797885e-7,"teacher_disagreement_score":0.11077081,"about_ca_system_score_codex":0.000005530261,"about_ca_system_score_gemma":0.000026503803,"threshold_uncertainty_score":0.2667304},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12840365,0.00063347287,0.854249,0.010255162,0.00061377557,0.00022319349,0.000004762838,0.000022049537,0.0055949413],"genre_scores_gemma":[0.67412776,0.00044484562,0.32364228,0.00045743794,0.00038483916,0.000008526648,1.4758528e-7,0.00000956535,0.00092459173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987721,0.000024472594,0.0004123182,0.00014449735,0.000473813,0.00017282316],"domain_scores_gemma":[0.99820215,0.0012748186,0.00019211434,0.000123983,0.00011747927,0.00008946065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018960255,0.000114301154,0.0001934364,0.000070562855,0.00019308478,0.0006041801,0.0011128266,0.000031734515,0.00019058486],"category_scores_gemma":[0.00021231214,0.00006028701,0.00009276893,0.000099265904,0.0004277512,0.0004149298,0.000105578474,0.00010777621,0.0000050875706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011962262,0.00010606999,0.0000046616456,0.000020206206,0.000048857644,0.000009132194,0.0012316223,0.00001796674,0.00006121049,0.95258373,0.0001720015,0.045732565],"study_design_scores_gemma":[0.00032470032,0.00022695867,0.000026465928,0.00010153024,0.000021057784,0.00094409555,0.0003158103,0.10169971,0.00023104328,0.8929758,0.0030339975,0.00009884167],"about_ca_topic_score_codex":0.000001303346,"about_ca_topic_score_gemma":7.6638406e-7,"teacher_disagreement_score":0.5457241,"about_ca_system_score_codex":0.00001436575,"about_ca_system_score_gemma":0.00004309613,"threshold_uncertainty_score":0.5826123},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52175814,0.00028867985,0.4729806,0.0008775229,0.00020975289,0.0003262817,0.00018656717,0.0000322683,0.0033401786],"genre_scores_gemma":[0.9018089,0.000030795047,0.098009884,0.00006856814,0.000012940294,0.0000025904897,9.709778e-7,0.0000043473037,0.000060990307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990857,0.000046697493,0.000432784,0.00011574028,0.00020271327,0.00011636163],"domain_scores_gemma":[0.99894404,0.0003028492,0.00028966597,0.00031354316,0.0001193233,0.000030548174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000288564,0.00011670991,0.00031441892,0.000054017237,0.000049016286,0.000018549546,0.0004477648,0.000035454403,0.000007791456],"category_scores_gemma":[0.00025599537,0.0000642927,0.000059286274,0.0001494885,0.00058528996,0.00012709544,0.00014580929,0.000052216816,0.0000010707586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000108635795,0.00015364695,0.0000058746473,0.00039746848,0.000023797276,0.0000011276475,0.00024388335,0.00020849972,0.002566185,0.9946102,0.0003000965,0.0014783619],"study_design_scores_gemma":[0.000236143,0.00011605061,0.00006825677,0.0002764725,0.000012917455,0.0000075985395,0.000050371007,0.02048262,0.10718111,0.8713301,0.00014127837,0.0000971182],"about_ca_topic_score_codex":0.000042301905,"about_ca_topic_score_gemma":0.0000029136402,"teacher_disagreement_score":0.38005075,"about_ca_system_score_codex":0.0000022036206,"about_ca_system_score_gemma":0.000046328045,"threshold_uncertainty_score":0.26217803},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2184988,0.0059055868,0.016479425,0.0060168523,0.008543352,0.00039908997,0.0027236976,0.0014526076,0.7399806],"genre_scores_gemma":[0.9517675,0.0052118585,0.008031927,0.006173617,0.008945275,0.010330718,0.005148855,0.0030216523,0.0013685935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9686899,0.0020937473,0.006502342,0.006710357,0.0080315545,0.0079720905],"domain_scores_gemma":[0.97140884,0.008617431,0.0070133894,0.0078055537,0.0010830843,0.004071681],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0069042635,0.0033212737,0.0011741928,0.0023796964,0.009454782,0.0070768334,0.009675591,0.0076109366,0.6555319],"category_scores_gemma":[0.0064252308,0.006393654,0.006578066,0.0057088477,0.006301646,0.0058726054,0.0072861933,0.0063414834,0.008219648],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029766692,0.0010326845,0.000014399668,0.0019735703,0.003707097,0.0016043298,0.0043753446,0.004929771,0.0032524678,0.5294229,0.44108954,0.005621266],"study_design_scores_gemma":[0.0057032756,0.004673426,0.00010676958,0.0023833034,0.004998374,0.0057681636,0.004292749,0.07866115,0.8656635,0.0021038975,0.01991989,0.0057254657],"about_ca_topic_score_codex":0.004539099,"about_ca_topic_score_gemma":0.0032194238,"teacher_disagreement_score":0.8624111,"about_ca_system_score_codex":0.00007939015,"about_ca_system_score_gemma":0.005829767,"threshold_uncertainty_score":0.9998063},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036441186,0.00013137802,0.99557525,0.000745236,0.00051153393,0.00033140194,0.0000047512867,0.0001707775,0.0021652628],"genre_scores_gemma":[0.03865837,0.0000027576941,0.95934355,0.000507274,0.00014461846,0.00008967141,0.0000035165608,0.000008064551,0.0012421749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902976,0.000056366865,0.00018162158,0.00030193754,0.00016797477,0.00026233465],"domain_scores_gemma":[0.9993342,0.00013523041,0.000049427585,0.00033721264,0.000044776876,0.00009910791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000598761,0.00010885028,0.00015957435,0.000031931195,0.00015340459,0.0002600776,0.00057301554,0.00004267575,0.000021911053],"category_scores_gemma":[0.000019016528,0.00008438115,0.000102158934,0.00013118895,0.00001986966,0.00022342797,0.000093247734,0.00005902548,0.00009710893],"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.0000056000695,0.00004146688,0.0000046055634,0.000022753475,0.000015938544,0.000009903118,0.00016044754,0.008630036,0.00010775568,0.986705,0.00034562443,0.003950889],"study_design_scores_gemma":[0.001851842,0.00017063179,0.00008365903,0.000029825625,0.000013726913,0.00026024264,0.00008082421,0.76785606,0.001018167,0.19490811,0.03333949,0.00038743627],"about_ca_topic_score_codex":0.00010285587,"about_ca_topic_score_gemma":0.0000029364387,"teacher_disagreement_score":0.79179686,"about_ca_system_score_codex":0.000031213367,"about_ca_system_score_gemma":0.00009349559,"threshold_uncertainty_score":0.34409633},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047695465,0.00007368497,0.9404511,0.0021444145,0.0001194938,0.0012380917,0.000010081945,0.00016477896,0.008102885],"genre_scores_gemma":[0.96698207,0.000012095339,0.03167273,0.00017028658,0.00013192548,0.000059832106,0.000004047844,0.000003307111,0.00096369244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989571,0.00017412822,0.00023676147,0.00026012227,0.00023042175,0.00014149224],"domain_scores_gemma":[0.99887186,0.000106332656,0.00010078399,0.00070144614,0.00015274428,0.00006681693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045352627,0.00010158547,0.00018292303,0.00003781097,0.00013031333,0.00008577092,0.0005625719,0.000035829664,0.0000075257694],"category_scores_gemma":[0.00001457607,0.000054507207,0.00003820087,0.00032642036,0.00003686799,0.00012977779,0.00003078411,0.000049751485,0.0000039065303],"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.000050048428,0.000033949804,0.000055331104,0.0000075217295,0.00001405399,3.5046807e-7,0.00056464726,0.0033746518,0.0014035946,0.98101544,0.00021495929,0.013265431],"study_design_scores_gemma":[0.0044127633,0.0016977664,0.033872038,0.00004433437,0.00010074984,0.00006845258,0.00057774544,0.6841769,0.010283246,0.25514543,0.008693941,0.00092659204],"about_ca_topic_score_codex":0.00020200139,"about_ca_topic_score_gemma":0.000018025119,"teacher_disagreement_score":0.9192866,"about_ca_system_score_codex":0.000028378232,"about_ca_system_score_gemma":0.0000487122,"threshold_uncertainty_score":0.22227395},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122612074,0.000020754558,0.87437385,0.000063046115,0.0023590457,0.00013552229,0.000001843001,0.000048598453,0.0003852338],"genre_scores_gemma":[0.6765639,0.0000059135527,0.32162687,0.00043777976,0.0012993823,0.0000012176935,0.0000035166145,0.000013420193,0.000047974932],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891096,0.000017924465,0.0004613409,0.00012771362,0.00024682592,0.00023523795],"domain_scores_gemma":[0.99871695,0.00016085652,0.00040499843,0.00020912378,0.00039145772,0.000116622046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095669,0.00011961334,0.00017547027,0.00017126289,0.00027952212,0.0001928451,0.0006119389,0.00006952066,0.000015115507],"category_scores_gemma":[0.00012150139,0.000092804665,0.00008990444,0.0003626435,0.000029795186,0.00047550103,0.00007760516,0.00033021555,0.000009751821],"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.000027982176,0.00011059574,0.00007630102,0.000023556651,0.000029238528,0.0000063583097,0.00037412567,0.0021835773,0.0042681713,0.11796106,0.00030278097,0.87463623],"study_design_scores_gemma":[0.002609705,0.0012365797,0.00006385252,0.0000667321,0.000010921416,0.00036101922,0.0000414538,0.8768154,0.059802733,0.017390192,0.041256502,0.00034491485],"about_ca_topic_score_codex":4.9568143e-7,"about_ca_topic_score_gemma":1.788649e-7,"teacher_disagreement_score":0.8746318,"about_ca_system_score_codex":0.000015669597,"about_ca_system_score_gemma":0.00010590877,"threshold_uncertainty_score":0.37844643},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021316279,0.000016615495,0.97568715,0.00029070998,0.0005359358,0.0006724021,0.000019506533,0.00046558346,0.000995825],"genre_scores_gemma":[0.9660773,0.000006093079,0.03237336,0.00079309166,0.000052343923,0.00030226773,7.283434e-7,0.00002157022,0.0003732119],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982889,0.00010988547,0.00039553625,0.00045809022,0.00029385556,0.00045370153],"domain_scores_gemma":[0.99865633,0.00050773995,0.00013114214,0.00052308664,0.00005386505,0.0001278575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046936795,0.00026502775,0.00033363872,0.0002146499,0.0005051541,0.00022339665,0.000510228,0.00009764465,0.00012528857],"category_scores_gemma":[0.000012239122,0.00024681044,0.00020756044,0.0002535372,0.000116610514,0.00039570028,0.000001791172,0.0002022006,0.000101830396],"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.000030231695,0.0005073436,0.0000045456695,0.00015458114,0.00014810318,0.0000051565953,0.0009557737,0.036028273,0.0010473096,0.0021742352,0.00009501719,0.95884943],"study_design_scores_gemma":[0.0021826127,0.00032984023,0.000049575865,0.00009280736,0.00003891945,0.000045285182,0.0000434144,0.9941258,0.0024506839,0.00028974673,0.00006732279,0.00028401808],"about_ca_topic_score_codex":7.270366e-7,"about_ca_topic_score_gemma":5.5098e-7,"teacher_disagreement_score":0.9585654,"about_ca_system_score_codex":0.00007695799,"about_ca_system_score_gemma":0.000038423575,"threshold_uncertainty_score":0.9999984},"labels":[],"label_agreement":null},{"id":"W2118811613","doi":"10.1137/s089547980036838x","title":"Twice Differentiable Spectral Functions","year":2001,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Differentiable function; Hessian matrix; Eigenvalues and eigenvectors; Pure mathematics; Symmetric matrix; Function (biology); Mathematical analysis; Matrix (chemical analysis); Applied mathematics","score_opus":0.007979552960835083,"score_gpt":0.2555741821285429,"score_spread":0.2475946291677078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118811613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017431684,0.00029162792,0.9764917,0.0011858307,0.00004677095,0.000090357,0.000005180834,0.00006477467,0.004392113],"genre_scores_gemma":[0.97480875,0.0007760816,0.012518055,0.00024975798,0.0006194842,0.000043148615,0.000011457333,0.000010732664,0.01096254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989212,0.00006465918,0.00028018892,0.0002810516,0.00021939256,0.00023348308],"domain_scores_gemma":[0.9990737,0.000083431856,0.0001513463,0.00041059358,0.00007438856,0.0002065678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030726969,0.00013047502,0.00021342697,0.00041384622,0.0006573855,0.00042484162,0.00041841043,0.00004083329,0.00029865257],"category_scores_gemma":[0.0000065756594,0.00010432177,0.00023297004,0.0018028766,0.000034212277,0.00025252646,0.000057922185,0.0002446789,0.00013235296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002389501,0.0005601052,0.005420151,0.000010706678,0.001120663,0.000027336948,0.00011575897,0.003420671,0.00090525224,0.9247822,0.0018779323,0.061735302],"study_design_scores_gemma":[0.0013498303,0.00043221362,0.035952095,0.00002832256,0.0022101586,0.0008565624,0.00032090818,0.12975688,0.00054319587,0.19432239,0.63311684,0.001110599],"about_ca_topic_score_codex":0.000005772965,"about_ca_topic_score_gemma":0.0000047665644,"teacher_disagreement_score":0.9639736,"about_ca_system_score_codex":0.000024711051,"about_ca_system_score_gemma":0.00002293997,"threshold_uncertainty_score":0.5056144},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013172168,0.000105136845,0.9748476,0.0033037025,0.0001014025,0.00066940294,1.9032719e-7,0.0010401692,0.018615147],"genre_scores_gemma":[0.19816594,0.000035290304,0.797818,0.00089456845,0.0001953843,0.00016217632,0.0000013499263,0.0000131306815,0.0027141273],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912286,0.000028736626,0.00012675715,0.0003315832,0.00013966758,0.00025037478],"domain_scores_gemma":[0.99944496,0.000012112006,0.00005014248,0.0003891852,0.00006182042,0.00004180573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021399118,0.000116489944,0.00011377691,0.00021167597,0.00013648414,0.00008501607,0.0004681015,0.00007090517,0.00002920677],"category_scores_gemma":[0.0000095723535,0.00008171063,0.000024508065,0.0008646526,0.000037468053,0.00041628006,0.000049085567,0.00014261773,0.0000423551],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007659276,0.000046531524,0.000009911978,0.0000035066626,0.0000047283966,0.000011168295,0.00006613956,0.0000038601975,0.00018098581,0.15887555,0.00005847338,0.8407315],"study_design_scores_gemma":[0.002934088,0.006864822,0.0010860028,0.00018270963,0.000023354414,0.00153513,0.0003657783,0.24004021,0.25943437,0.33027318,0.1555645,0.001695851],"about_ca_topic_score_codex":0.0000029208709,"about_ca_topic_score_gemma":7.5502635e-7,"teacher_disagreement_score":0.83903563,"about_ca_system_score_codex":0.000019404884,"about_ca_system_score_gemma":0.000045570196,"threshold_uncertainty_score":0.33320627},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07486405,0.0005151348,0.9172498,0.0063697053,0.0004774893,0.00009157487,0.0000017152855,0.00005870818,0.00037182955],"genre_scores_gemma":[0.9821038,0.00019547214,0.013199825,0.00018384123,0.0007823027,7.439313e-7,0.0000010590243,0.000015667021,0.0035172931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99853843,0.00009483917,0.00027596505,0.00018010043,0.00036146058,0.0005491785],"domain_scores_gemma":[0.99890226,0.00010157358,0.00021725136,0.00029296847,0.00026786828,0.00021805144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005332267,0.00014218464,0.0002158954,0.00028282593,0.00014848312,0.00023033307,0.0010510841,0.00005824794,0.000035184574],"category_scores_gemma":[0.00014226872,0.0001247303,0.00013025667,0.00093359733,0.000020624255,0.0009546574,0.00010799259,0.00043633505,0.000026951378],"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.000075760705,0.00023914526,0.0003360178,0.000009692952,0.00018852284,0.00024764254,0.0012200677,0.002401581,0.004313404,0.9729465,0.002641788,0.015379833],"study_design_scores_gemma":[0.0028002716,0.0031002585,0.0003117289,0.00009390344,0.00011178475,0.0032695273,0.00070841156,0.017254928,0.015135306,0.094158426,0.86200243,0.0010530086],"about_ca_topic_score_codex":0.0000032146922,"about_ca_topic_score_gemma":0.000005738674,"teacher_disagreement_score":0.90723974,"about_ca_system_score_codex":0.00015018995,"about_ca_system_score_gemma":0.0004833869,"threshold_uncertainty_score":0.5086354},"labels":[],"label_agreement":null},{"id":"W2122266675","doi":"10.1002/nla.547","title":"An efficient linear programming solver for optimal filter synthesis","year":2007,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Sun Microsystems; Intel Corporation","keywords":"Solver; Linear programming; Deconvolution; Mathematics; Linear system; Mathematical optimization; Filter (signal processing); Algorithm; Point (geometry); Block (permutation group theory); System of linear equations; Applied mathematics; Computer science","score_opus":0.011562888039975466,"score_gpt":0.2707725232927044,"score_spread":0.25920963525272894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122266675","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027738132,0.000024155548,0.9951846,0.00036903305,0.000043216536,0.00097505574,0.00001593779,0.0003753484,0.00023883734],"genre_scores_gemma":[0.2162343,7.237355e-7,0.78231025,0.00021214414,0.00033391593,0.0007885004,0.000018016335,0.000025479056,0.00007669556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825835,0.00003313034,0.00031156093,0.0006012416,0.00027676765,0.0005189741],"domain_scores_gemma":[0.9982077,0.00042259815,0.00011500356,0.0007857848,0.00016451886,0.00030440235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005700638,0.00020545431,0.00021109359,0.0000932308,0.00035239576,0.00009979151,0.0008225828,0.000086074884,0.000031964722],"category_scores_gemma":[0.00003846343,0.00016282022,0.00009824732,0.00066723884,0.00010019272,0.00017872646,0.00008075069,0.00016352454,0.00009898704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019281678,0.0019357721,0.00015628565,0.000071286304,0.00009077487,0.000011272339,0.00056143745,0.019660318,0.00066628313,0.3749789,0.00015159267,0.6015233],"study_design_scores_gemma":[0.00043355837,0.000385023,0.00018932774,0.000016390755,0.00004542754,0.000029581926,0.000074004514,0.88029844,0.010482028,0.00079643633,0.10674202,0.00050777505],"about_ca_topic_score_codex":0.0000049948403,"about_ca_topic_score_gemma":7.8169575e-7,"teacher_disagreement_score":0.86063814,"about_ca_system_score_codex":0.000030895957,"about_ca_system_score_gemma":0.000058979793,"threshold_uncertainty_score":0.6639615},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008042817,0.0003257849,0.99068284,0.0003818141,0.00039920045,0.00005852912,0.0000046851237,0.0000050813296,0.00009922075],"genre_scores_gemma":[0.9227806,0.0000032056323,0.076858595,0.00025443846,0.000074597476,0.0000014867625,2.0518779e-7,0.0000035239266,0.000023361617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875504,0.0001673893,0.00038282585,0.00012032771,0.0004705842,0.00010386365],"domain_scores_gemma":[0.99857026,0.00017723275,0.000526384,0.00006993703,0.0006052434,0.000050927603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005589686,0.00009862953,0.00016151014,0.00009607565,0.00007961205,0.000102183316,0.0005000344,0.000033657576,0.000031989504],"category_scores_gemma":[0.000096565025,0.000065042776,0.000105671024,0.00009647619,0.0001001829,0.00061038794,0.000034087592,0.00014591833,7.615368e-7],"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.00033727314,0.00029099968,0.0007084494,0.000033993176,0.00029548164,0.000079247286,0.00095719117,0.011722333,0.015236958,0.036659878,0.000080973805,0.9335972],"study_design_scores_gemma":[0.0014930883,0.00013910365,0.00093347905,0.00015698375,0.000025340085,0.00012391596,0.000040417228,0.960453,0.013236368,0.023135135,0.00016203728,0.00010115589],"about_ca_topic_score_codex":0.0000021416647,"about_ca_topic_score_gemma":1.8287665e-7,"teacher_disagreement_score":0.94873065,"about_ca_system_score_codex":0.000021494438,"about_ca_system_score_gemma":0.0001477201,"threshold_uncertainty_score":0.26523674},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039672256,0.0003546405,0.9904485,0.0040006707,0.0006786236,0.00013287351,0.000001832171,0.000033028587,0.00038264092],"genre_scores_gemma":[0.21006842,0.0002235594,0.78329545,0.0028745886,0.001906228,0.0000044719472,0.0000027042781,0.000017514652,0.0016070675],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99850684,0.000036870148,0.00061047147,0.00015695357,0.00046197546,0.00022685734],"domain_scores_gemma":[0.99793595,0.00032013835,0.0005028303,0.0002464467,0.0008373107,0.00015734979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011987502,0.0001348549,0.00027152384,0.00067955494,0.00014232156,0.0003099273,0.00085778,0.00008593921,0.00003366044],"category_scores_gemma":[0.0008563929,0.00009748345,0.00014776131,0.0021576989,0.000015795984,0.0010291442,0.000031014803,0.00017415165,0.000005454288],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011707061,0.00042493464,0.000078881036,0.000026052412,0.00005605549,0.00004423621,0.00053556066,0.00029059293,0.0017473854,0.038703762,0.026549628,0.93142587],"study_design_scores_gemma":[0.010557721,0.007919354,0.0032709409,0.0001483161,0.00015036704,0.0021971734,0.00026749296,0.17225401,0.18082947,0.2327417,0.38817158,0.0014918904],"about_ca_topic_score_codex":2.1390278e-7,"about_ca_topic_score_gemma":1.717009e-7,"teacher_disagreement_score":0.92993397,"about_ca_system_score_codex":0.00006245402,"about_ca_system_score_gemma":0.00020478258,"threshold_uncertainty_score":0.39752594},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5414879,0.000014824671,0.45535934,0.0015887684,0.000030385985,0.0006815726,0.000006376104,0.00007177667,0.0007590973],"genre_scores_gemma":[0.3976346,0.000003800009,0.6018493,0.00041886425,0.000042293363,0.000021984148,1.9367691e-7,0.000006918286,0.000022017071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989148,0.000006365657,0.00027055893,0.00027776937,0.00023520915,0.0002952965],"domain_scores_gemma":[0.99913615,0.00018536596,0.00027989026,0.00012557751,0.00014627901,0.00012676002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010656922,0.00012591605,0.00023672002,0.000026083817,0.00018117653,0.000070928174,0.0006229223,0.000025741787,0.0000032139194],"category_scores_gemma":[0.00005525328,0.00008660334,0.00012057993,0.00041580154,0.0003217102,0.0003188649,0.00025345632,0.000082356804,0.0000013453583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005751127,0.00022423512,0.0016910309,0.0004218331,0.00008875371,9.464979e-8,0.007044589,0.000001939376,0.031637013,0.90769017,0.0011697158,0.049973127],"study_design_scores_gemma":[0.0006014879,0.00096080126,0.003025371,0.00014560504,0.00008819047,0.000043273256,0.007204476,0.032308556,0.04351739,0.91102755,0.0005847563,0.0004925267],"about_ca_topic_score_codex":0.000011512692,"about_ca_topic_score_gemma":5.582266e-7,"teacher_disagreement_score":0.14648998,"about_ca_system_score_codex":0.000039084145,"about_ca_system_score_gemma":0.00001600926,"threshold_uncertainty_score":0.35315815},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26391703,0.0012763372,0.65070343,0.0093956245,0.00020147397,0.0015409371,0.00005377588,0.0011644787,0.07174691],"genre_scores_gemma":[0.9348948,0.00056833983,0.050222527,0.0023322995,0.00062227185,0.0002980758,0.000024518773,0.000027407636,0.011009774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992657,0.000030507037,0.00013612268,0.0002852114,0.00010061776,0.00018189744],"domain_scores_gemma":[0.99944067,0.00008919143,0.000026510079,0.0003050384,0.0000248114,0.00011376981],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009642438,0.00010201903,0.00010711715,0.00003753642,0.00023434457,0.00006116371,0.00032336803,0.00004336935,0.0003287528],"category_scores_gemma":[0.0000052737378,0.000086573105,0.000035707453,0.00026128956,0.000024303296,0.00017019424,0.00004361141,0.00010501199,0.0008939823],"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.000012345759,0.00015881016,0.000040700463,0.000010402617,0.000013094939,0.0000023342332,0.00015651094,0.00034511194,0.00013583893,0.73632324,0.00048864726,0.26231295],"study_design_scores_gemma":[0.00047797957,0.00014323715,0.0008758057,0.000011032466,0.00001294393,0.000032957174,0.000015223189,0.19642745,0.0037398136,0.01601692,0.78188,0.00036664004],"about_ca_topic_score_codex":0.0000026642604,"about_ca_topic_score_gemma":2.600798e-7,"teacher_disagreement_score":0.7813913,"about_ca_system_score_codex":0.000004798783,"about_ca_system_score_gemma":0.000014165682,"threshold_uncertainty_score":0.99988395},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83580774,0.001968652,0.09400214,0.0003313696,0.0018708896,0.0002796258,0.0000110249,0.00027327755,0.06545529],"genre_scores_gemma":[0.96503943,0.00029712907,0.031959377,0.00007411929,0.0023837963,0.0000039982892,7.2385626e-7,0.000009960441,0.00023148382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989058,0.000107023836,0.00026321592,0.00027100832,0.00025588777,0.0001970986],"domain_scores_gemma":[0.9990963,0.0003168188,0.00022163433,0.00024326082,0.000047998394,0.000073998184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005025554,0.0001267765,0.00020803987,0.0001681709,0.00011928469,0.00014601702,0.0005973421,0.00004397158,0.000062194704],"category_scores_gemma":[0.00010451122,0.000109784436,0.000052914995,0.00034512256,0.000079643374,0.000499751,0.00025112004,0.000073555864,0.00003126947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001598728,0.00005877872,0.0050605396,0.00019515,0.000029179342,0.000009846281,0.0018159071,0.000049576232,0.0010907553,0.5987276,0.0008084489,0.3921382],"study_design_scores_gemma":[0.0025313601,0.0012514231,0.024135236,0.00032983598,0.00013427426,0.00007550385,0.0011243118,0.06072486,0.07436605,0.72006387,0.113180645,0.0020826505],"about_ca_topic_score_codex":0.000061867315,"about_ca_topic_score_gemma":0.0000052653686,"teacher_disagreement_score":0.39005557,"about_ca_system_score_codex":0.000008221651,"about_ca_system_score_gemma":0.000018306962,"threshold_uncertainty_score":0.44768792},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01481033,0.012424956,0.96491957,0.0035129888,0.0016150193,0.00071461615,0.00004267743,0.00046803584,0.0014918057],"genre_scores_gemma":[0.23323227,0.0011150716,0.7515832,0.0008356875,0.0065137586,0.00016176337,0.00004651978,0.00009184022,0.00641984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976739,0.00012894407,0.0006521762,0.00065521884,0.00018589357,0.00070384255],"domain_scores_gemma":[0.9982296,0.0006890799,0.00029959183,0.0004884238,0.00006571504,0.00022755806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036790656,0.00030863582,0.0005397816,0.00040134424,0.00024029908,0.0002131893,0.00083464326,0.00023627457,0.00003846702],"category_scores_gemma":[0.000062660685,0.00029762462,0.0001369115,0.00053016806,0.00004922357,0.00046243632,0.00028909338,0.0001366999,0.000102446946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010076337,0.00024331428,0.012229577,0.00045531822,0.00007920414,0.0003132138,0.00030572448,0.0000752391,0.00046478532,0.57938915,0.3131351,0.09320865],"study_design_scores_gemma":[0.014761193,0.0005698563,0.0079521965,0.000026751224,0.0006880729,0.013656988,0.0000855171,0.047401197,0.01090917,0.50371736,0.3958782,0.004353485],"about_ca_topic_score_codex":0.00019897085,"about_ca_topic_score_gemma":0.0000056987697,"teacher_disagreement_score":0.21842195,"about_ca_system_score_codex":0.000027751154,"about_ca_system_score_gemma":0.00020828284,"threshold_uncertainty_score":0.9999476},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07298796,0.0013019209,0.91305774,0.0037379365,0.00006385307,0.0013024987,0.000008842195,0.0001734902,0.007365738],"genre_scores_gemma":[0.8515617,0.00028148858,0.14212947,0.0034724744,0.0005790122,0.00054136297,0.00002458297,0.0000248753,0.0013850345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989633,0.000062866275,0.00025018794,0.00030397178,0.0001604869,0.00025916824],"domain_scores_gemma":[0.9992492,0.00015553366,0.00005930506,0.00042401455,0.0000385628,0.000073346935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088326266,0.00011550688,0.00011141132,0.00008503482,0.00021004387,0.00008896649,0.0006701381,0.000058653757,0.000020264224],"category_scores_gemma":[0.000011736154,0.00008256977,0.000038361948,0.0006353168,0.000036935202,0.00017960163,0.000110386245,0.00015298791,0.00008897937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023768264,0.00006212064,0.00003640549,0.000009874309,0.0000044859075,0.0000027617086,0.0006589914,0.000009594278,0.0004357161,0.9763077,0.00011038393,0.022359585],"study_design_scores_gemma":[0.0014594847,0.0001292159,0.0043823863,0.000029392775,0.00003073369,0.00015580263,0.00034534835,0.06016592,0.008135744,0.59224695,0.33217204,0.0007469651],"about_ca_topic_score_codex":0.00001152609,"about_ca_topic_score_gemma":0.0000091560405,"teacher_disagreement_score":0.77857375,"about_ca_system_score_codex":0.0000091205375,"about_ca_system_score_gemma":0.000026449074,"threshold_uncertainty_score":0.33670974},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14781623,0.00008887309,0.7978747,0.0019396369,0.00016609125,0.00011504925,3.404227e-7,0.00013367661,0.051865384],"genre_scores_gemma":[0.98395604,0.0000017269357,0.014866815,0.00059285166,0.000067327885,7.230337e-7,6.4995376e-8,0.0000021086942,0.0005123602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994052,0.00006566579,0.00012036503,0.00012605035,0.00016069229,0.000121998084],"domain_scores_gemma":[0.9992882,0.00030146135,0.000045123626,0.00031385964,0.000029025008,0.000022348455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045661943,0.000055511307,0.000069380265,0.000027198861,0.00010539936,0.00003647091,0.0005819467,0.000013729713,0.000071004964],"category_scores_gemma":[0.00003843756,0.000032007443,0.0000405067,0.00017556205,0.00003074116,0.00009130183,0.0001117803,0.000060507387,0.00008640851],"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":[9.450593e-7,0.000026141552,0.000012657262,0.0000027936594,0.0000043367527,5.310486e-7,0.0005653085,0.0009072518,0.000082455525,0.9393124,0.00029723477,0.05878797],"study_design_scores_gemma":[0.00025648705,0.0001874667,0.0005582351,0.000025799465,0.000005469868,0.000026201671,0.000090042166,0.824641,0.019417878,0.1520908,0.0025290009,0.00017162549],"about_ca_topic_score_codex":0.000006367161,"about_ca_topic_score_gemma":0.0000027880242,"teacher_disagreement_score":0.8361398,"about_ca_system_score_codex":0.000011571714,"about_ca_system_score_gemma":0.000023599114,"threshold_uncertainty_score":0.13052256},"labels":[],"label_agreement":null},{"id":"W2128985516","doi":"10.1002/nla.1826","title":"Finding off‐diagonal entries of the inverse of a large symmetric sparse matrix","year":2012,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Diagonal; Inverse; Mathematics; Diagonal matrix; Node (physics); Matrix (chemical analysis); Combinatorics; Vertex (graph theory); Algorithm; Block matrix; Band matrix; Square matrix; Symmetric matrix; Eigenvalues and eigenvectors; Geometry; Graph","score_opus":0.012424760643217217,"score_gpt":0.2608739387652651,"score_spread":0.2484491781220479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128985516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03665892,0.0003538045,0.9608626,0.00048679145,0.00009410202,0.000505873,0.0000527679,0.000069784415,0.0009153955],"genre_scores_gemma":[0.9201736,0.0000135006585,0.07926497,0.00012816492,0.00011854681,0.00008645309,0.000005487735,0.000010413287,0.00019888271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988113,0.000078817866,0.00029703352,0.00019368783,0.0003190793,0.00030009818],"domain_scores_gemma":[0.99863446,0.00026528336,0.00025356186,0.0006247237,0.00009602439,0.00012592417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003327007,0.00012314552,0.00020616128,0.00011180196,0.00014229974,0.000014429951,0.00075582933,0.000053273707,0.000058842725],"category_scores_gemma":[0.0000673292,0.0000810329,0.000097782235,0.0019571315,0.00013174799,0.00022156019,0.00024524596,0.00015754651,0.00005995221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013448173,0.00048775537,0.01023492,0.000042229807,0.00003954156,3.1485908e-7,0.00040138743,0.000113762326,0.00023857802,0.9822902,0.00026487702,0.0058729616],"study_design_scores_gemma":[0.00493291,0.00073021953,0.0680006,0.00023846391,0.00050326256,0.00019933135,0.0008157172,0.27495122,0.10164351,0.048018057,0.49784276,0.0021239633],"about_ca_topic_score_codex":0.0000069483935,"about_ca_topic_score_gemma":8.821312e-7,"teacher_disagreement_score":0.93427217,"about_ca_system_score_codex":0.0000181699,"about_ca_system_score_gemma":0.00007814502,"threshold_uncertainty_score":0.33044258},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011552539,0.00025756317,0.98568684,0.00011826204,0.0008986854,0.00037612318,0.00014775616,0.0003206309,0.00064157543],"genre_scores_gemma":[0.9971347,0.000046255172,0.0021135225,0.000096060394,0.00009757592,0.00015940393,0.00003310768,0.000016263974,0.00030314707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981277,0.00021447096,0.00037640345,0.00041239263,0.00033408243,0.000534937],"domain_scores_gemma":[0.9989169,0.000104994826,0.00016368115,0.00039884538,0.00009168006,0.00032385695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004573295,0.00029573662,0.00029523481,0.00020005037,0.0006539209,0.00028363065,0.0003159293,0.00014334981,0.000013824282],"category_scores_gemma":[0.0000067623196,0.0002615512,0.000076661134,0.0006975091,0.00008692267,0.00093805505,0.000004577677,0.00031027038,0.00005586789],"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.0002765325,0.0013379124,0.00024613077,0.00062111235,0.00022717049,0.000031807085,0.0028933098,0.89669967,0.00029799892,0.08139401,0.0015506875,0.014423673],"study_design_scores_gemma":[0.0035185425,0.00051760615,0.00062222703,0.0007043216,0.00012946021,0.00042626486,0.0019863208,0.9822044,0.0008145222,0.002757736,0.0047694365,0.0015491584],"about_ca_topic_score_codex":0.000016061706,"about_ca_topic_score_gemma":0.0000021267672,"teacher_disagreement_score":0.9855821,"about_ca_system_score_codex":0.000042967273,"about_ca_system_score_gemma":0.000050906947,"threshold_uncertainty_score":0.99998367},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066283226,0.002926454,0.927373,0.0021148608,0.000041744977,0.0006793344,0.000027629221,0.000036916193,0.0005168264],"genre_scores_gemma":[0.97829777,0.00086384726,0.020340575,0.00009157715,0.000069397596,0.00014081976,0.0000034845998,0.0000044246303,0.00018808308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995276,0.000019086754,0.0001708869,0.00012863235,0.0000730449,0.000080748025],"domain_scores_gemma":[0.9991852,0.0003317759,0.000112784204,0.00026878732,0.00007467925,0.000026740467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020536518,0.000055008146,0.00010260564,0.00003392074,0.000120397446,0.00002245423,0.00039541273,0.000024749064,0.0000059781787],"category_scores_gemma":[0.000015446005,0.00003748066,0.00003294406,0.00027081766,0.000049801656,0.00012405557,0.00007795325,0.000034451376,0.0000023213643],"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.000007514359,0.00006535815,0.00007034796,0.00006118902,0.000010642103,1.530112e-7,0.0004060487,0.00001268745,0.0021781176,0.9770821,0.00003899609,0.020066861],"study_design_scores_gemma":[0.0010723916,0.0004432385,0.00448485,0.00011359422,0.00012161577,0.00007064574,0.0006419833,0.58505285,0.060958408,0.24064411,0.10592042,0.00047590796],"about_ca_topic_score_codex":0.000013061091,"about_ca_topic_score_gemma":0.000003953398,"teacher_disagreement_score":0.91201454,"about_ca_system_score_codex":0.0000017475164,"about_ca_system_score_gemma":0.000013574561,"threshold_uncertainty_score":0.15284169},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03218874,0.00000958665,0.9657278,0.00090085366,0.00034189626,0.000494504,0.0000026754092,0.0001806782,0.00015326514],"genre_scores_gemma":[0.20294307,2.0322017e-7,0.79567844,0.0010846729,0.00012582107,0.000026651269,0.000012815928,0.000007580637,0.00012072902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898094,0.00013123764,0.00022593535,0.0003167128,0.00013311695,0.00021207937],"domain_scores_gemma":[0.9991053,0.00037005875,0.000124452,0.0001405257,0.0001905982,0.00006910231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026721443,0.00013003185,0.00015412386,0.00008338705,0.00018909421,0.00030130552,0.00029024665,0.000039786904,0.000010687931],"category_scores_gemma":[0.00004179673,0.000116809206,0.000078651145,0.00024079367,0.000016806747,0.0007010904,0.00010479352,0.00008249525,0.00003254347],"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.000026196423,0.00014145629,0.000032966866,0.0000720378,0.00004842512,0.000003764684,0.004240467,0.18410327,0.04944257,0.17723587,0.0059907874,0.5786622],"study_design_scores_gemma":[0.00072464143,0.00008122709,0.00020658357,0.0000067182796,0.000003977486,0.000017251496,0.000020700036,0.97377676,0.0018574509,0.02291653,0.00024858638,0.00013960007],"about_ca_topic_score_codex":0.00004531948,"about_ca_topic_score_gemma":0.0000016815139,"teacher_disagreement_score":0.78967345,"about_ca_system_score_codex":0.000022589393,"about_ca_system_score_gemma":0.00001824471,"threshold_uncertainty_score":0.47633412},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007027093,0.00012305345,0.9604318,0.000216826,0.00040509074,0.00020504813,0.0000025112495,0.00020697879,0.03138161],"genre_scores_gemma":[0.3903805,0.00001769345,0.60272735,0.0006837027,0.00013941934,0.00003273912,0.0000032773123,0.000013516063,0.006001814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917483,0.000085869375,0.00012481741,0.00028952392,0.00010711539,0.00021786665],"domain_scores_gemma":[0.9992956,0.00007605439,0.000036554717,0.00044244432,0.0000480141,0.000101336314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050654134,0.000088225606,0.00008833933,0.00005036597,0.0001472053,0.00014128092,0.0004953095,0.000043076656,0.00013893496],"category_scores_gemma":[0.000028222748,0.000072006944,0.000052251846,0.00019064563,0.000015675321,0.000562006,0.000023989212,0.000039677267,0.000056275872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027639505,0.00004886676,0.000019400737,0.000010301423,0.0000027164588,0.0000019631966,0.00010803721,0.000021629834,0.00029277557,0.94935536,0.000605646,0.049530525],"study_design_scores_gemma":[0.00084332045,0.0006700417,0.00013820204,0.000019170258,0.000010302532,0.000053107018,0.00022784673,0.071335375,0.065590024,0.60146695,0.25904086,0.0006047948],"about_ca_topic_score_codex":0.0000050704616,"about_ca_topic_score_gemma":0.0000016003648,"teacher_disagreement_score":0.3833534,"about_ca_system_score_codex":0.00001184837,"about_ca_system_score_gemma":0.00003134886,"threshold_uncertainty_score":0.29363582},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012674231,0.00033515776,0.97854745,0.002910285,0.00009288544,0.00071319484,0.00004127861,0.00010368201,0.004581815],"genre_scores_gemma":[0.9933305,0.0000055701926,0.0053910916,0.0003927117,0.00014252498,0.00034219152,0.0000034033299,0.0000060249454,0.0003860215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993087,0.000052184925,0.00016609361,0.00014776326,0.00010817204,0.00021710194],"domain_scores_gemma":[0.9990912,0.00025296668,0.000045497964,0.00040468897,0.000066891494,0.00013877549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035909878,0.00007646567,0.00009062867,0.000053307256,0.0003867919,0.000038048518,0.00033166024,0.000029288842,0.000028736104],"category_scores_gemma":[0.000047816116,0.000054282667,0.000031302632,0.0004238439,0.000022954107,0.00017497649,0.00012343159,0.000069883055,0.0002702342],"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":[6.277908e-7,0.00005226432,0.000003722216,0.000010518355,0.0000064762667,3.4052295e-8,0.0003028109,0.000040127605,0.00062653964,0.9970662,0.0002352936,0.0016553915],"study_design_scores_gemma":[0.0013364913,0.00058466196,0.002110891,0.00038095997,0.00018752112,0.000093145514,0.0032172976,0.609496,0.067220986,0.06728572,0.24635313,0.0017332088],"about_ca_topic_score_codex":0.0000052109044,"about_ca_topic_score_gemma":0.0000011483718,"teacher_disagreement_score":0.9806562,"about_ca_system_score_codex":0.0000143887255,"about_ca_system_score_gemma":0.000030809868,"threshold_uncertainty_score":0.3473404},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46027654,0.0009997297,0.5345199,0.0013628217,0.00007011494,0.00024723104,0.000010367895,0.000012072228,0.002501191],"genre_scores_gemma":[0.9378239,0.00009895773,0.061766077,0.000067886125,0.00018881733,0.0000028222119,2.2907604e-7,0.0000043290815,0.00004697617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991943,0.000017737266,0.00038974237,0.000110255176,0.0001866859,0.00010125965],"domain_scores_gemma":[0.99908006,0.00006858317,0.00048403203,0.00017888287,0.000104418,0.00008400985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040052086,0.00008405243,0.0002355687,0.00009237115,0.00007145687,0.000043189742,0.0003423678,0.000048878363,0.000017951143],"category_scores_gemma":[0.000011397555,0.00006567436,0.00004107079,0.00016270595,0.000074720876,0.00022370124,0.00013046514,0.00012617298,0.0000015321313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026744128,0.000089338806,0.00031747934,0.000051514835,0.000046300444,0.0000023715843,0.00023413866,0.00004517099,0.0051124315,0.89784235,0.00010303848,0.09612912],"study_design_scores_gemma":[0.007805244,0.00082083134,0.03514345,0.00027259006,0.00030810476,0.0016923469,0.00069662393,0.006659169,0.045126073,0.87221515,0.028248386,0.0010120539],"about_ca_topic_score_codex":5.480761e-7,"about_ca_topic_score_gemma":0.0000013150811,"teacher_disagreement_score":0.47754738,"about_ca_system_score_codex":0.0000037887523,"about_ca_system_score_gemma":0.000054136726,"threshold_uncertainty_score":0.26781225},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007403778,0.00030068564,0.99017733,0.0009623735,0.000019385427,0.0003066545,0.0000035566675,0.0000744099,0.00075183436],"genre_scores_gemma":[0.9012978,0.000040618615,0.09828532,0.00009515596,0.00006796182,0.000099311335,0.0000045022985,0.0000052964792,0.00010404223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993853,0.000019817404,0.00017934316,0.00019724762,0.00009956849,0.00011873768],"domain_scores_gemma":[0.9995555,0.00003398419,0.00006586714,0.00022918906,0.000049879553,0.0000655377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011491426,0.00007103245,0.00010020213,0.00004083279,0.000118885015,0.000020868118,0.00024037075,0.0000375137,0.0000086451155],"category_scores_gemma":[0.000009096501,0.00006306653,0.000031121777,0.0003137719,0.00003094125,0.00016086196,0.000058351066,0.00006458179,0.00005799749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011164253,0.00008881674,0.00000683999,0.00002738663,0.0000061596884,2.5185324e-7,0.00024091192,0.00022568613,0.002050555,0.988709,0.000010468969,0.008632809],"study_design_scores_gemma":[0.0009898281,0.00027637466,0.00053939066,0.000055810186,0.00003518519,0.000057367175,0.000050036586,0.17854863,0.054930508,0.7537154,0.010343089,0.0004583646],"about_ca_topic_score_codex":0.000010905138,"about_ca_topic_score_gemma":5.8560516e-7,"teacher_disagreement_score":0.893894,"about_ca_system_score_codex":0.000008996382,"about_ca_system_score_gemma":0.000046498262,"threshold_uncertainty_score":0.25717783},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015299168,0.000018847159,0.97658974,0.0002880208,0.00010374385,0.00013646678,0.000004424344,0.00006422182,0.021264628],"genre_scores_gemma":[0.7919381,0.000026380028,0.20242435,0.0006090532,0.00006332155,0.00001194952,0.0000024439703,0.000011866318,0.004912518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917394,0.00003912405,0.00022457608,0.00020813629,0.00022768874,0.00012652324],"domain_scores_gemma":[0.99925613,0.00007375187,0.0000860195,0.00037318846,0.00014368627,0.00006721351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017137939,0.00008030104,0.00014208649,0.00012344077,0.000041519597,0.000013327157,0.0003777554,0.000034255296,0.0001304048],"category_scores_gemma":[0.00007023293,0.000064159096,0.00003930183,0.00057727296,0.000024977699,0.000144813,0.0000507165,0.000039802762,0.000045247863],"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.0000085113925,0.00052628556,0.00002297162,0.00006175739,0.000019316962,0.0000038684016,0.0028722654,0.0029273746,0.00725007,0.59287536,0.0060670893,0.38736516],"study_design_scores_gemma":[0.0007139871,0.0013758108,0.0003646658,0.00021091918,0.000016979759,0.000014591313,0.00023190596,0.55198044,0.38483799,0.05083751,0.008878874,0.0005363117],"about_ca_topic_score_codex":0.000012209914,"about_ca_topic_score_gemma":0.0000015144238,"teacher_disagreement_score":0.7904082,"about_ca_system_score_codex":0.000006572182,"about_ca_system_score_gemma":0.000009922273,"threshold_uncertainty_score":0.2616332},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2920172,0.000014129462,0.70663816,0.00020950133,0.000043570104,0.00010980749,0.000005622962,0.000048307873,0.0009137112],"genre_scores_gemma":[0.5116799,0.0000029934295,0.48824528,0.000016547781,0.000013727917,0.000004882092,0.000005843066,0.00000298427,0.000027829341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911696,0.00004272128,0.00031959746,0.00017262844,0.0002386364,0.000109481996],"domain_scores_gemma":[0.99876195,0.00058349187,0.00013860503,0.00025793025,0.00020261103,0.000055390636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003884665,0.00009148068,0.00014572518,0.00007740314,0.00014729805,0.00007221001,0.00029570147,0.000029787756,0.00006985653],"category_scores_gemma":[0.0001301629,0.00008865244,0.00004217991,0.00025248592,0.00010970826,0.00034127277,0.00013767039,0.000058906764,0.000021406948],"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.000003332408,0.00027915568,0.00029509224,0.00005955716,0.000021355381,0.0000012657327,0.001291943,0.023094585,0.000078083125,0.9707465,0.000022618331,0.004106469],"study_design_scores_gemma":[0.00016902115,0.000027986323,0.0013402221,0.000010911412,0.0000052400164,0.000028563429,0.000063738415,0.62476534,0.00022893582,0.37311697,0.00016243303,0.00008063144],"about_ca_topic_score_codex":0.0000037644056,"about_ca_topic_score_gemma":9.426057e-7,"teacher_disagreement_score":0.60167074,"about_ca_system_score_codex":0.000017069662,"about_ca_system_score_gemma":0.000060865543,"threshold_uncertainty_score":0.36151415},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55944157,0.000033164357,0.43974894,0.00032990964,0.00025758368,0.00008081481,0.000015611502,0.0000027313395,0.00008964646],"genre_scores_gemma":[0.98546976,0.000026241702,0.014249298,0.00006342614,0.000052290896,0.0000011923808,4.3885316e-7,0.000005600129,0.00013174197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999157,0.00004847134,0.00052022986,0.000099078374,0.00007174868,0.00010345946],"domain_scores_gemma":[0.9986018,0.00019334102,0.0007753606,0.00024844124,0.00013263425,0.000048406047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006383941,0.00008997062,0.00029576372,0.000092149305,0.000041809057,0.00006799617,0.00039058714,0.000053139658,0.000010950666],"category_scores_gemma":[0.000026652264,0.000060735096,0.000095307136,0.00004287432,0.00008925578,0.00063240906,0.000042163898,0.00020063444,5.402668e-7],"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.00018411032,0.00013305784,0.0011372169,0.00006281748,0.0003179919,0.0000035590845,0.0008355716,0.07385349,0.0044280826,0.8454477,0.000032942637,0.07356345],"study_design_scores_gemma":[0.00076718733,0.00007409183,0.0004988382,0.000010474418,0.000022214988,0.00006202095,0.00002696248,0.9654673,0.000041612682,0.032891456,0.00007529177,0.000062597246],"about_ca_topic_score_codex":0.0000075445532,"about_ca_topic_score_gemma":0.00005310753,"teacher_disagreement_score":0.8916138,"about_ca_system_score_codex":0.000018808763,"about_ca_system_score_gemma":0.00007905436,"threshold_uncertainty_score":0.24767053},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034589577,0.00009858628,0.9879319,0.0070811873,0.0005251331,0.00067052554,0.0000046541522,0.00010322422,0.00012584656],"genre_scores_gemma":[0.010638017,0.0000064050146,0.98508835,0.00030079423,0.00027754897,0.000011970058,0.0000010200839,0.000027920958,0.0036480022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980933,0.00010881231,0.0006127373,0.00038327873,0.0003042854,0.00049760676],"domain_scores_gemma":[0.99815893,0.0004570186,0.00031736778,0.0007661112,0.00012351146,0.00017707681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002118431,0.00026076532,0.0004944379,0.000019717656,0.00026905487,0.00014772163,0.0014163796,0.0001481786,0.00016455754],"category_scores_gemma":[0.00024245429,0.0001840949,0.000608416,0.0002998443,0.00015493996,0.000079127894,0.0003407488,0.00024616113,0.000072694005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052768017,0.00026747718,0.0000033819301,0.001241836,0.00030672736,0.0000024599892,0.0022537122,0.016088441,0.014787667,0.9518635,0.011114354,0.0020176352],"study_design_scores_gemma":[0.0032800373,0.00015988298,0.000005315696,0.00087057863,0.00022482534,0.00014962516,0.00034109977,0.17875402,0.029403156,0.747296,0.038802337,0.0007131619],"about_ca_topic_score_codex":0.00005926914,"about_ca_topic_score_gemma":1.612313e-7,"teacher_disagreement_score":0.20456757,"about_ca_system_score_codex":0.0000770047,"about_ca_system_score_gemma":0.000095140895,"threshold_uncertainty_score":0.7507172},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5894926,0.004189568,0.40103748,0.0018139468,0.00026394977,0.00022885975,0.0000018253314,0.000049929873,0.0029218048],"genre_scores_gemma":[0.9883641,0.0001791369,0.010818827,0.00018487591,0.00010565106,0.0000012589062,1.860191e-7,0.00001104756,0.00033492947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876857,0.00016223388,0.00023629518,0.00016950225,0.00028536492,0.0003780142],"domain_scores_gemma":[0.99914455,0.00019259017,0.0002703704,0.00016987613,0.00011705101,0.000105535844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080556195,0.00013229107,0.00021688401,0.00012268712,0.0001225583,0.000086196495,0.0003692793,0.000040486877,0.000031675983],"category_scores_gemma":[0.00007152366,0.000094820185,0.00005425361,0.00032238872,0.000050831593,0.00037689804,0.000026761632,0.0004343171,0.000012681816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011306075,0.00012462883,0.00014846982,0.00001303185,0.00013699036,0.00008452467,0.00066856766,0.00022561495,0.0001516337,0.99238384,0.00026621725,0.0056833997],"study_design_scores_gemma":[0.007615839,0.01829702,0.00066801754,0.0003676419,0.00015858523,0.005187397,0.00066006725,0.011789688,0.03736006,0.8818084,0.034852404,0.0012348641],"about_ca_topic_score_codex":0.0000019899724,"about_ca_topic_score_gemma":0.0000051310576,"teacher_disagreement_score":0.39887145,"about_ca_system_score_codex":0.000059685382,"about_ca_system_score_gemma":0.00030144956,"threshold_uncertainty_score":0.3866655},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1045761,0.00010367969,0.86238724,0.00013081815,0.0000686245,0.00028931323,0.0000041742337,0.00012122452,0.0323188],"genre_scores_gemma":[0.96482563,0.000015058077,0.034615763,0.000024806359,0.00003779095,0.000010589916,9.1771165e-7,0.0000069912794,0.00046246412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879885,0.000009102972,0.00029206803,0.00038686377,0.0002385725,0.0002745238],"domain_scores_gemma":[0.99913037,0.00011267676,0.000102753074,0.00015305095,0.00034009348,0.00016106776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010555324,0.00014996868,0.00035301992,0.00033652617,0.00008739517,0.00013988129,0.000568735,0.00008008103,0.0000052830255],"category_scores_gemma":[0.00009794238,0.00013283023,0.000055907956,0.0014869132,0.0000496986,0.0003592777,0.000101263846,0.000100407015,0.000011319285],"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.00039112364,0.00082301366,0.0068636667,0.0025334894,0.00140454,0.00001240832,0.033811294,0.00037977906,0.06558373,0.7227476,0.000389666,0.16505969],"study_design_scores_gemma":[0.0004325942,0.00026293664,0.001211158,0.00025135087,0.00044453895,0.000042008105,0.0014136494,0.8769562,0.11505196,0.0018927378,0.0012357289,0.00080512266],"about_ca_topic_score_codex":0.000026911504,"about_ca_topic_score_gemma":5.542228e-7,"teacher_disagreement_score":0.8765764,"about_ca_system_score_codex":0.00001604807,"about_ca_system_score_gemma":0.00003724966,"threshold_uncertainty_score":0.5416659},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017388018,0.00037317144,0.9935762,0.0003440148,0.0031741366,0.0002216522,0.00001922985,0.000054148415,0.0004986057],"genre_scores_gemma":[0.008324332,0.00007460954,0.98848593,0.00022073393,0.002215565,0.0000126429495,0.000004367192,0.000021199612,0.000640632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975768,0.00006288513,0.0010109643,0.00022624471,0.00083969854,0.00028344773],"domain_scores_gemma":[0.99740535,0.0008668869,0.000602475,0.00028148215,0.0006974833,0.00014631801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012434089,0.0002202146,0.0004346808,0.0004066685,0.00008448774,0.00057621056,0.0021204937,0.00007487742,0.00005737525],"category_scores_gemma":[0.0000440546,0.0001844863,0.00034805248,0.0002739368,0.000032532498,0.0006737598,0.00013235945,0.00020948585,0.000044912667],"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.000026764053,0.00039271417,0.0000046377318,0.000050623785,0.00031815888,0.00011253025,0.00065211067,0.0056183925,0.000019325227,0.16611953,0.0028376163,0.8238476],"study_design_scores_gemma":[0.001133528,0.00022822071,0.000017793616,0.00020966132,0.000023731855,0.0015964027,0.000023033761,0.9360663,0.00009070662,0.044920444,0.015476692,0.00021347454],"about_ca_topic_score_codex":0.000002631101,"about_ca_topic_score_gemma":8.1311114e-8,"teacher_disagreement_score":0.93044794,"about_ca_system_score_codex":0.00010257462,"about_ca_system_score_gemma":0.00012430802,"threshold_uncertainty_score":0.75231326},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031214973,0.00013405409,0.99438244,0.0036991658,0.00010390565,0.00024145705,0.0005587495,0.0001566155,0.00041148075],"genre_scores_gemma":[0.12551688,0.00008158056,0.87170374,0.0005302019,0.000066427514,0.000027924421,0.0016325171,0.0000096306,0.0004310975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895525,0.00015688624,0.00018334009,0.0003924664,0.00012850428,0.00018352865],"domain_scores_gemma":[0.99790066,0.00062067795,0.00009015519,0.0012520874,0.000059632093,0.00007675445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006257521,0.00012150115,0.0001426762,0.00003112241,0.00025758124,0.00016883391,0.0012895602,0.00005196347,0.00002164967],"category_scores_gemma":[0.0001093853,0.00010467732,0.000029317964,0.0001740343,0.000053543663,0.00054745725,0.0006356716,0.00009740977,0.000013314622],"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.000012795773,0.0001263353,0.000011547097,0.000026515128,0.000031508836,0.0000015736271,0.000091071335,0.000058506812,0.00006947264,0.6156761,0.033616506,0.35027808],"study_design_scores_gemma":[0.0005050605,0.000067292705,0.00013080139,0.000019400375,0.000009660244,0.000008971559,0.000026682957,0.9193735,0.0012235729,0.0082212,0.070251994,0.00016187252],"about_ca_topic_score_codex":0.000005261232,"about_ca_topic_score_gemma":0.0000011742245,"teacher_disagreement_score":0.919315,"about_ca_system_score_codex":0.000024809427,"about_ca_system_score_gemma":0.0000075060357,"threshold_uncertainty_score":0.42686173},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09583239,0.00020172584,0.8913198,0.00034325593,0.00007354119,0.00014872573,5.5335596e-7,0.000044098888,0.012035908],"genre_scores_gemma":[0.59378904,0.00013073697,0.4030117,0.00007515894,0.000067059125,5.7366185e-7,0.0000030401077,0.000007928721,0.0029147237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990874,0.00016072621,0.00011993949,0.00020860518,0.0002594875,0.00016383249],"domain_scores_gemma":[0.99918354,0.0001371048,0.00018123444,0.00037632242,0.000060643615,0.000061149934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004878669,0.00009591386,0.00020303609,0.000111175454,0.00023075067,0.00003124415,0.001256812,0.000045427332,0.000027229065],"category_scores_gemma":[0.000011217534,0.00008389506,0.00010122688,0.00019776606,0.00021094321,0.0006572851,0.00025294992,0.00012172113,0.000007412716],"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.0003239969,0.00046777428,0.00016574025,0.00013874883,0.00018670435,0.000021683389,0.054729905,0.00026615846,0.0004179462,0.65482557,0.0005016003,0.28795415],"study_design_scores_gemma":[0.0017489498,0.00012241163,0.00039195988,0.000028154956,0.000042173473,0.000012666012,0.00084302115,0.97363466,0.0013963407,0.0109591335,0.010620628,0.00019991062],"about_ca_topic_score_codex":0.0002636854,"about_ca_topic_score_gemma":0.000002750462,"teacher_disagreement_score":0.97336847,"about_ca_system_score_codex":0.000024544568,"about_ca_system_score_gemma":0.00004059603,"threshold_uncertainty_score":0.34211412},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23663436,0.0055967295,0.009725888,0.0025207351,0.007499089,0.00027127867,0.0019387188,0.0011655157,0.7346477],"genre_scores_gemma":[0.96037227,0.004779488,0.009250275,0.0035821502,0.0068843844,0.006470208,0.0047572474,0.0029733102,0.0009306694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.96753424,0.0023899993,0.006865607,0.0066714715,0.0084126955,0.00812599],"domain_scores_gemma":[0.9724891,0.0061121685,0.007977662,0.007980754,0.0010878356,0.0043524415],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.007154878,0.0032188774,0.001220039,0.0028769271,0.0074836332,0.0056274147,0.009908464,0.0078889085,0.74818],"category_scores_gemma":[0.005827368,0.0066294502,0.0064547514,0.0070855888,0.0065180548,0.0059956196,0.008702371,0.0061184573,0.006759962],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030869055,0.0012321532,0.000035901507,0.002985095,0.004181836,0.0015984741,0.004465473,0.003612528,0.005087547,0.5268931,0.44002062,0.0068003554],"study_design_scores_gemma":[0.005815737,0.004555967,0.00022424402,0.002629484,0.0053992947,0.0049922294,0.004896954,0.049536135,0.9028594,0.0020791101,0.0110933045,0.0059181456],"about_ca_topic_score_codex":0.0065850536,"about_ca_topic_score_gemma":0.0034529169,"teacher_disagreement_score":0.89777184,"about_ca_system_score_codex":0.00008110653,"about_ca_system_score_gemma":0.0058164783,"threshold_uncertainty_score":0.99981964},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010547562,0.000030212093,0.9951734,0.0019920322,0.00041440438,0.0008734322,0.00009674218,0.000267713,0.00009733752],"genre_scores_gemma":[0.84549344,0.0000010276531,0.15358378,0.00028630352,0.000049193724,0.00031080632,0.0000014462847,0.000013070001,0.00026094905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984812,0.00010531458,0.00051842054,0.0003145563,0.00027658412,0.00030389463],"domain_scores_gemma":[0.997688,0.0013925241,0.00019259911,0.0004742065,0.00015089002,0.0001017785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004985145,0.00019960983,0.00032928836,0.00027824347,0.00026568002,0.000090389374,0.00043167372,0.00007005017,0.000114691364],"category_scores_gemma":[0.000028324,0.00018349395,0.00025379428,0.00033671962,0.00005490965,0.0003617307,0.0000013791497,0.00010868589,0.000034275985],"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.000072801224,0.0013006072,0.000001060528,0.00016927384,0.00027058186,0.000004170677,0.0023979684,0.29190207,0.0053670313,0.04484842,0.00015615186,0.65350986],"study_design_scores_gemma":[0.002385236,0.00025942517,0.000006291434,0.000062629304,0.00006260855,0.0000039676124,0.000029533503,0.98196596,0.013395289,0.0013424768,0.0003039755,0.00018258026],"about_ca_topic_score_codex":0.0000052553314,"about_ca_topic_score_gemma":0.000012545882,"teacher_disagreement_score":0.8444387,"about_ca_system_score_codex":0.000087221786,"about_ca_system_score_gemma":0.00012338765,"threshold_uncertainty_score":0.7482666},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21723606,0.0010698644,0.73237336,0.0046442524,0.00008572285,0.00078754977,0.00005003859,0.00066895207,0.043084223],"genre_scores_gemma":[0.9438719,0.0009205285,0.042066537,0.0029689674,0.00071724644,0.00021724691,0.000030450328,0.000023821001,0.009183285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993608,0.000018031358,0.00012745094,0.00025779847,0.000082653794,0.0001532937],"domain_scores_gemma":[0.99954075,0.000037675294,0.000022142416,0.00030501018,0.000016647491,0.00007775283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007281041,0.00008614961,0.0000793535,0.000031134314,0.00015039786,0.00006621575,0.00035947544,0.000035504654,0.00041421328],"category_scores_gemma":[0.0000019151996,0.00007816133,0.00003125465,0.00018241191,0.000016838361,0.00021788263,0.00004336654,0.00009461886,0.00044480324],"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.0000016981771,0.000065778564,0.000055704455,0.0000127489475,0.000008775448,0.0000025709587,0.00014412301,0.000006751534,0.0002411835,0.8653987,0.00015740028,0.13390455],"study_design_scores_gemma":[0.0008118056,0.00015698926,0.0076851267,0.000033466495,0.000030673542,0.0001507537,0.000033426706,0.10395776,0.012334784,0.2690857,0.6048189,0.0009006622],"about_ca_topic_score_codex":0.0000027402052,"about_ca_topic_score_gemma":7.554143e-7,"teacher_disagreement_score":0.7266359,"about_ca_system_score_codex":0.000003528685,"about_ca_system_score_gemma":0.000015662843,"threshold_uncertainty_score":0.5717194},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079656824,0.004859668,0.8898246,0.003544805,0.000033149154,0.0026447647,0.000045300276,0.0006477658,0.018743096],"genre_scores_gemma":[0.975705,0.0016994929,0.0145276515,0.0006432307,0.0003769737,0.0018371433,0.000016258897,0.000021746422,0.005172469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919826,0.000018190698,0.0001791106,0.00033213262,0.000097170625,0.00017510891],"domain_scores_gemma":[0.99947816,0.000031740634,0.000026507987,0.0003047199,0.000035783738,0.00012311197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001109295,0.00011735694,0.00011049801,0.00004223533,0.00034841598,0.00009657164,0.00030171114,0.000051384133,0.00006261586],"category_scores_gemma":[0.0000025063553,0.000095339026,0.000026115553,0.00024921895,0.000072335286,0.00029881526,0.000047743528,0.00009954729,0.00010948371],"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.0000035446558,0.00007174402,0.000010980067,0.00003952593,0.000010470143,2.6920682e-7,0.0004050601,0.000013034252,0.00067098095,0.6834564,0.000021623577,0.31529632],"study_design_scores_gemma":[0.00059791765,0.000092813214,0.0005435706,0.000023252873,0.000032884247,0.00007548217,0.000093780625,0.055024445,0.0063813417,0.05334755,0.88326967,0.00051732204],"about_ca_topic_score_codex":0.000003479943,"about_ca_topic_score_gemma":0.0000014591404,"teacher_disagreement_score":0.8960482,"about_ca_system_score_codex":0.000005147251,"about_ca_system_score_gemma":0.000024550009,"threshold_uncertainty_score":0.38878125},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.993305,0.0006515233,0.0045305467,0.0011185606,0.000063102336,0.00008044445,0.0000057748316,0.000013831792,0.00023118476],"genre_scores_gemma":[0.99800557,0.000020677004,0.0016205326,0.000007814114,0.00012954658,0.0000013493307,2.636034e-7,0.0000070022556,0.00020727215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986133,0.00011453796,0.0005664133,0.000119232674,0.0004059908,0.00018050626],"domain_scores_gemma":[0.9952612,0.0036499456,0.00052620895,0.00027497695,0.00015500975,0.00013266994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027120484,0.00012965695,0.00027873085,0.000023762259,0.0002551946,0.00012525823,0.00065174716,0.00015348072,0.000016595102],"category_scores_gemma":[0.0029469077,0.00007073418,0.00009813761,0.0001744815,0.00019437796,0.00016814776,0.00018985657,0.0007499898,0.0000013652875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119663666,0.00070507417,0.30205914,0.002282897,0.0010107233,0.00008714211,0.0061600273,0.000041739688,0.05462748,0.62712306,0.00086551765,0.0049175173],"study_design_scores_gemma":[0.0009613024,0.00010245943,0.08597413,0.00023193331,0.00020859968,0.000517748,0.00032025116,0.013580113,0.03707241,0.8604523,0.00021611109,0.00036263358],"about_ca_topic_score_codex":7.976639e-7,"about_ca_topic_score_gemma":4.0274472e-7,"teacher_disagreement_score":0.23332924,"about_ca_system_score_codex":0.000014147251,"about_ca_system_score_gemma":0.0000717483,"threshold_uncertainty_score":0.35279366},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07802142,0.00076772505,0.9006034,0.004583571,0.000093286646,0.00087381894,0.000012752655,0.00044501032,0.014598991],"genre_scores_gemma":[0.96296114,0.00008905638,0.030445512,0.00068967073,0.00035049734,0.00036248757,0.000016943544,0.00001212253,0.0050725704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994286,0.00001651476,0.000118963784,0.0002162764,0.000076143435,0.0001435157],"domain_scores_gemma":[0.9994505,0.00006491632,0.000032289125,0.00029144232,0.000059366645,0.00010150161],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007088306,0.000082212595,0.00007608099,0.00004106544,0.00015614045,0.00009274737,0.0003373381,0.0000380451,0.00015530725],"category_scores_gemma":[0.000009477632,0.000070672824,0.000023048347,0.00027023707,0.000024032563,0.00033823666,0.00013691028,0.000080948856,0.0007825569],"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":[2.782572e-7,0.000038465398,0.000017623819,0.000007723327,0.00000570856,3.005721e-7,0.00010033351,0.0000036288511,0.0012760031,0.9526217,0.0005983587,0.045329854],"study_design_scores_gemma":[0.00075206,0.00013537581,0.0027874561,0.00001944003,0.000023560242,0.000080488666,0.0001444664,0.29860532,0.012182826,0.27778652,0.4066812,0.00080129906],"about_ca_topic_score_codex":0.000006608172,"about_ca_topic_score_gemma":5.9742075e-7,"teacher_disagreement_score":0.88493973,"about_ca_system_score_codex":0.0000040900436,"about_ca_system_score_gemma":0.000012372176,"threshold_uncertainty_score":0.99999547},"labels":[],"label_agreement":null},{"id":"W2141654299","doi":"10.1002/nla.318","title":"Consistency adjustments for pairwise comparison matrices","year":2002,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Consistency (knowledge bases); Rank (graph theory); Pairwise comparison; Transitive relation; Matrix (chemical analysis); Applied mathematics; Low-rank approximation; Linear least squares; Least-squares function approximation; Mathematical optimization; Linear model; Combinatorics; Discrete mathematics; Statistics; Mathematical analysis","score_opus":0.0225620477831706,"score_gpt":0.26577950657403887,"score_spread":0.24321745879086826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141654299","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002851773,0.00056064426,0.99396265,0.0012157491,0.00004832766,0.00085697393,0.00002265224,0.00031675957,0.0027310427],"genre_scores_gemma":[0.35111922,0.000034483994,0.64535505,0.0007130075,0.00023601948,0.0015711193,0.000028079096,0.000026460055,0.00091658114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986916,0.00003829801,0.00029940452,0.00044633128,0.00022079937,0.00030356293],"domain_scores_gemma":[0.9986995,0.00024587708,0.00014581408,0.00061036693,0.000114900446,0.00018357583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011165036,0.00016991213,0.00023448499,0.000067422814,0.00030697137,0.00007810808,0.0006747645,0.000058179532,0.00011086814],"category_scores_gemma":[0.000019717689,0.00013565745,0.000081239144,0.0006559338,0.00007777636,0.00020865185,0.000076906406,0.00012284346,0.00041439533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023776225,0.001144559,0.0009131056,0.00007043934,0.00007882342,0.000002984412,0.00031220607,0.00034326073,0.000044986056,0.7635603,0.006065694,0.22743988],"study_design_scores_gemma":[0.0010208405,0.0003916497,0.0003755413,0.000016781758,0.00006083898,0.000024380633,0.000053771808,0.6616463,0.0005210453,0.013818304,0.3215867,0.0004838395],"about_ca_topic_score_codex":0.0000041425146,"about_ca_topic_score_gemma":5.1168206e-7,"teacher_disagreement_score":0.749742,"about_ca_system_score_codex":0.000023339739,"about_ca_system_score_gemma":0.000022448163,"threshold_uncertainty_score":0.553195},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17775492,0.000043172884,0.7974679,0.0008763187,0.0001846025,0.00011095126,0.0000046099303,0.00005315277,0.023504363],"genre_scores_gemma":[0.99375534,0.0000042042207,0.0042510577,0.00019589388,0.000018795117,0.0000033416618,5.0435037e-8,0.0000025752229,0.0017687662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994929,0.00006668722,0.00009809093,0.00013070696,0.00011928816,0.00009233354],"domain_scores_gemma":[0.9993094,0.0003443719,0.000040855677,0.0002584448,0.000014020964,0.000032878543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019791797,0.000059147886,0.000070877395,0.00004184418,0.00012694212,0.000043696535,0.0002045004,0.000018653442,0.00023206596],"category_scores_gemma":[0.000056603232,0.00003583291,0.000025940732,0.00012950612,0.00004119275,0.0001264324,0.000072029725,0.000044188062,0.000029315379],"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.000014038774,0.00071554945,0.00012381529,0.000021069802,0.000084794185,0.000010376593,0.00080106454,0.0003225884,0.0027381976,0.5487966,0.004597316,0.4417746],"study_design_scores_gemma":[0.00052577263,0.00019358066,0.00008087188,0.00004325356,0.000029545314,0.000019585868,0.00012271355,0.9581864,0.025299534,0.013374047,0.0019222825,0.00020241176],"about_ca_topic_score_codex":0.0000051896714,"about_ca_topic_score_gemma":1.9840782e-7,"teacher_disagreement_score":0.9578638,"about_ca_system_score_codex":0.0000075300354,"about_ca_system_score_gemma":0.0000040079535,"threshold_uncertainty_score":0.25409594},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.582134,0.0015043576,0.4008296,0.006272265,0.0005565608,0.0025530579,0.0000603602,0.00069981685,0.005389942],"genre_scores_gemma":[0.9502214,0.00017089609,0.04563701,0.0005125727,0.00042207114,0.00026655605,0.000014181824,0.000021566484,0.0027336967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921465,0.0000251773,0.00018243233,0.00031211044,0.000090035086,0.00017557833],"domain_scores_gemma":[0.99932885,0.00006925618,0.000066036344,0.00033800228,0.00003751623,0.00016036461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001946298,0.00011534041,0.00011906476,0.00005997534,0.00025103966,0.00012485155,0.0003065958,0.0000727902,0.00003528972],"category_scores_gemma":[0.000017674678,0.00010398521,0.000026234806,0.00019643977,0.00006185625,0.0002926402,0.00015040947,0.00017321356,0.00010716367],"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.000002004821,0.00009878271,0.00014912973,0.000071559036,0.000016877022,0.0000015203617,0.00054336543,0.000005384624,0.017431952,0.94941604,0.00022243854,0.03204096],"study_design_scores_gemma":[0.0019662492,0.00021327508,0.0023047677,0.00006367876,0.0000870617,0.00025220442,0.0002075959,0.41543812,0.017207127,0.23989227,0.32100657,0.0013610796],"about_ca_topic_score_codex":0.000008311925,"about_ca_topic_score_gemma":0.000016310434,"teacher_disagreement_score":0.70952374,"about_ca_system_score_codex":0.0000031655798,"about_ca_system_score_gemma":0.000030185245,"threshold_uncertainty_score":0.4240394},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013301721,0.0010185216,0.98037916,0.0033370757,0.00003676759,0.0004740038,0.000015500102,0.000038742648,0.001398477],"genre_scores_gemma":[0.9957226,0.00022937005,0.0031539195,0.000312591,0.000067073015,0.000110251975,0.0000032172784,0.0000051874345,0.0003957749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993864,0.00007457601,0.0001597699,0.00018542666,0.000087941786,0.00010586762],"domain_scores_gemma":[0.9992835,0.0003175293,0.0000618386,0.0002500929,0.000034137705,0.00005291312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026520595,0.00007669587,0.000112910246,0.000036219466,0.00019415759,0.000042591768,0.00020877614,0.000029433495,0.000030903055],"category_scores_gemma":[0.000036125653,0.000052234987,0.00003494625,0.00022226272,0.00009831249,0.000103887236,0.000048261158,0.00007805397,0.000013668526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025145623,0.000037566617,0.00001674695,0.0000114006725,0.000009913772,1.5574174e-7,0.0003004239,0.000005913816,0.00014480909,0.98829,0.000039264032,0.011141297],"study_design_scores_gemma":[0.004397663,0.00014352608,0.0016268772,0.00003597601,0.00008500475,0.00010292713,0.00020411352,0.18785775,0.028029203,0.724661,0.05230445,0.00055152306],"about_ca_topic_score_codex":0.0000029000262,"about_ca_topic_score_gemma":0.0000010711951,"teacher_disagreement_score":0.9824209,"about_ca_system_score_codex":0.000002628029,"about_ca_system_score_gemma":0.000027591173,"threshold_uncertainty_score":0.2130081},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71219224,0.000012558632,0.27937207,0.0026703319,0.00005160424,0.0002806551,7.0551846e-7,0.00012564112,0.0052941707],"genre_scores_gemma":[0.9669483,0.0000057889783,0.032159247,0.00024699265,0.000023972161,0.0000062364015,2.5162254e-7,0.0000026052276,0.00060660497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994271,0.00002795046,0.000114266455,0.00015931834,0.00015117315,0.00012020722],"domain_scores_gemma":[0.9993195,0.00008881763,0.00006966657,0.00045473638,0.000041254556,0.00002601419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023966123,0.00007187116,0.000077487624,0.00003044641,0.00008946582,0.00003633426,0.0004366681,0.000019740393,0.000020472136],"category_scores_gemma":[0.00001275685,0.000041639363,0.000021186679,0.00025120555,0.000025238294,0.00016814547,0.00003182226,0.00007079713,0.000029805014],"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.0001416358,0.00023584196,0.00041193262,0.00003301647,0.000013635732,0.000004062382,0.0011781679,0.0041998117,0.015500376,0.8632345,0.00026873362,0.11477827],"study_design_scores_gemma":[0.00047882315,0.0009661917,0.011575323,0.00007448319,0.0000053395956,0.000016967608,0.000027910688,0.86210775,0.12132079,0.0016166363,0.0015853181,0.0002244859],"about_ca_topic_score_codex":0.000006139178,"about_ca_topic_score_gemma":0.0000022876734,"teacher_disagreement_score":0.86161786,"about_ca_system_score_codex":0.000010891267,"about_ca_system_score_gemma":0.000019451238,"threshold_uncertainty_score":0.1698004},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4624674,0.00009146556,0.53610444,0.00019023138,0.000951996,0.00005382262,0.0000015348644,0.000011470447,0.00012762398],"genre_scores_gemma":[0.864638,0.0000012170857,0.13483277,0.000011737063,0.00039104547,2.591751e-7,8.679051e-7,0.0000030461579,0.00012108778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877876,0.00004658838,0.0005456001,0.00015511435,0.00029462937,0.00017928274],"domain_scores_gemma":[0.9984709,0.00022507532,0.00080898975,0.00014828437,0.00028889766,0.000057872432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016820583,0.000071942646,0.00017533032,0.00029405946,0.0002344539,0.0003072676,0.00057177275,0.000025391273,0.00001692758],"category_scores_gemma":[0.00007122789,0.00006182725,0.00015296337,0.00036852554,0.00004803557,0.0006634495,0.00007786543,0.00010080459,0.0000026679631],"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.00006203916,0.00059616263,0.0015022479,0.00029548808,0.000158924,0.0000064891497,0.0068285796,0.049979024,0.04582956,0.16625337,0.0040804204,0.7244077],"study_design_scores_gemma":[0.00085956574,0.00017731397,0.0040912377,0.00020580618,0.000028195851,0.00011497157,0.00012079367,0.9336421,0.04231402,0.015962893,0.002318104,0.00016499653],"about_ca_topic_score_codex":3.6463015e-7,"about_ca_topic_score_gemma":7.721993e-7,"teacher_disagreement_score":0.88366306,"about_ca_system_score_codex":0.000037650254,"about_ca_system_score_gemma":0.00006743887,"threshold_uncertainty_score":0.29629883},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040687804,0.0009867639,0.9958251,0.0011446156,0.00004975395,0.0005036628,0.000010685984,0.00015104952,0.0009214825],"genre_scores_gemma":[0.03240717,0.000060966217,0.9664787,0.00018134294,0.00016087382,0.00032754312,0.000004172113,0.000009302315,0.00036991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991127,0.0000721779,0.00019811123,0.0003554873,0.00006499444,0.00019649479],"domain_scores_gemma":[0.9989894,0.00039149294,0.000056029658,0.00038129927,0.00006695175,0.00011483463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038300295,0.00010412138,0.00014212205,0.000037068225,0.00026237158,0.000076332355,0.0003623796,0.00004070465,0.0000833922],"category_scores_gemma":[0.000046889403,0.00009399047,0.00005955986,0.00028561748,0.000028771137,0.00020818155,0.00012053736,0.00009081882,0.00004766495],"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.0000019058186,0.00008640184,0.000004893953,0.000023628885,0.000009812998,1.3196022e-7,0.00022746652,0.000038992177,0.001128792,0.8512519,0.00008090478,0.14714517],"study_design_scores_gemma":[0.00027583452,0.00003615862,0.000008420038,0.0000026275663,0.00001205782,0.00000859075,0.000021615291,0.8935222,0.006145175,0.037154406,0.06265279,0.00016013149],"about_ca_topic_score_codex":0.000001409238,"about_ca_topic_score_gemma":9.80347e-8,"teacher_disagreement_score":0.8934832,"about_ca_system_score_codex":0.00000948505,"about_ca_system_score_gemma":0.000009051505,"threshold_uncertainty_score":0.38328204},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5859311,0.000029849249,0.40138903,0.0072388914,0.0002031584,0.00042235226,0.000007641612,0.0000791909,0.0046987836],"genre_scores_gemma":[0.83310825,0.00008912005,0.15802999,0.0011116322,0.00016550621,0.000021547057,0.000004696871,0.000026091442,0.007443175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887705,0.00007594209,0.0003854669,0.00015754357,0.000319951,0.00018402492],"domain_scores_gemma":[0.99910057,0.00010503761,0.00024432296,0.0004620026,0.00004762472,0.000040455314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005362536,0.00010200123,0.00020485306,0.000010441326,0.000067694884,0.000020715332,0.0008280247,0.000053592543,0.000747121],"category_scores_gemma":[0.000058894286,0.00006825656,0.00026750233,0.00019974491,0.00010622214,0.000038075555,0.0002638765,0.00009474979,0.00005839492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018920196,0.0007080128,0.0006516829,0.00039495685,0.000109740104,0.0000019186873,0.0015546601,0.000010915022,0.05458098,0.93126094,0.0033803717,0.007326874],"study_design_scores_gemma":[0.0024168945,0.00030161696,0.010334447,0.000516455,0.00010529368,0.00009063511,0.00015837807,0.045336436,0.21412158,0.6559042,0.06995489,0.00075917155],"about_ca_topic_score_codex":0.0000018134313,"about_ca_topic_score_gemma":4.1322963e-8,"teacher_disagreement_score":0.27535677,"about_ca_system_score_codex":0.000014518423,"about_ca_system_score_gemma":0.000014573208,"threshold_uncertainty_score":0.8180451},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4976034,0.000020331643,0.5005928,0.0011178588,0.000034185414,0.00033108616,0.00024373816,0.000024740642,0.000031836065],"genre_scores_gemma":[0.6098067,0.00000222725,0.3896409,0.00038173315,0.00004917465,0.00002588776,0.000063155254,0.00000944317,0.000020744164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742645,0.00052454846,0.0006339362,0.00059952884,0.00049112475,0.0003244003],"domain_scores_gemma":[0.9985306,0.00048020977,0.00021558297,0.0005798868,0.000116566385,0.00007710222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014193812,0.00025343348,0.00031910764,0.00008628571,0.0001779949,0.00007793563,0.00041511576,0.00007235464,0.0000062851805],"category_scores_gemma":[0.00016496018,0.00019527074,0.000044210246,0.0002808071,0.00060017157,0.00020480424,0.00014959465,0.00028704616,0.0000023184275],"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.00012057588,0.0006522218,0.00577016,0.00037218523,0.000014295246,0.000030357121,0.0006074393,0.010586411,0.0004038742,0.9786207,0.00047087116,0.002350914],"study_design_scores_gemma":[0.0004560936,0.00016618002,0.008029062,0.000035535646,0.000014134987,0.000008446484,0.000008050272,0.54754406,0.00011142803,0.44338462,0.00003384013,0.00020857537],"about_ca_topic_score_codex":0.00067369867,"about_ca_topic_score_gemma":0.000103198836,"teacher_disagreement_score":0.5369576,"about_ca_system_score_codex":0.00005400867,"about_ca_system_score_gemma":0.00009868436,"threshold_uncertainty_score":0.79629093},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05844304,0.0011626217,0.9312868,0.0013666264,0.000043130276,0.0003917309,0.000029332723,0.00011077499,0.0071659423],"genre_scores_gemma":[0.9620684,0.00014509777,0.03726303,0.00014997594,0.00008759311,0.000042243813,0.000006839498,0.0000055492505,0.00023127312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994945,0.000011039043,0.00013475856,0.00017746104,0.00008443755,0.00009783118],"domain_scores_gemma":[0.99957156,0.000049388495,0.000059515543,0.00020119887,0.00006198752,0.000056324297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007877875,0.00006578461,0.00008696629,0.00004663456,0.000094348885,0.000027111417,0.00026942437,0.00003171969,0.00000879554],"category_scores_gemma":[0.000006639052,0.000058106827,0.000028464636,0.00028344442,0.000030349835,0.00018080797,0.00009001798,0.000051234256,0.00004610176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011730157,0.000035267305,0.0000041620237,0.000011267238,0.0000069302746,4.9544207e-7,0.0001935919,0.000029018984,0.0018409854,0.99084824,0.000006997203,0.0070218607],"study_design_scores_gemma":[0.0014952612,0.00035910067,0.0030273532,0.0000825721,0.0000577609,0.00009431535,0.00016384858,0.016660366,0.23795336,0.7236277,0.01577246,0.00070591347],"about_ca_topic_score_codex":0.0000071417962,"about_ca_topic_score_gemma":7.4470364e-7,"teacher_disagreement_score":0.90362537,"about_ca_system_score_codex":0.0000053050485,"about_ca_system_score_gemma":0.000029196475,"threshold_uncertainty_score":0.23695275},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075029265,0.000029784374,0.98997134,0.0004066676,0.0018414358,0.00020043552,0.000014390937,0.000022592036,0.00001043056],"genre_scores_gemma":[0.01724744,0.000010826304,0.98232967,0.00004250723,0.0002935812,0.0000397563,0.000002537079,0.000009426248,0.000024285147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921453,0.000031529624,0.00027508583,0.00017607346,0.00013280424,0.00016995835],"domain_scores_gemma":[0.99858165,0.0010405306,0.000079869955,0.0000657513,0.00013453014,0.00009765795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089787,0.00011012887,0.00014189494,0.00014702561,0.00008700678,0.0001582506,0.00026857003,0.00004705655,0.0000040619498],"category_scores_gemma":[0.0007233248,0.00009658536,0.000051707113,0.00008177659,0.000020020208,0.00036477068,0.00010258087,0.00026064165,1.976239e-7],"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.00018631511,0.00028627945,0.0008382828,0.0001716527,0.00033829745,0.000016285832,0.0025812632,0.13298896,0.033172294,0.22434941,0.000052637995,0.6050183],"study_design_scores_gemma":[0.00061170256,0.00007936842,0.00023703568,0.000034347097,0.00000624321,0.00006766207,0.000009567009,0.97968614,0.0017141303,0.008495975,0.008942487,0.00011531491],"about_ca_topic_score_codex":0.0000014909283,"about_ca_topic_score_gemma":9.453729e-7,"teacher_disagreement_score":0.8466972,"about_ca_system_score_codex":0.00003091995,"about_ca_system_score_gemma":0.0000184374,"threshold_uncertainty_score":0.39386365},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016686939,0.0009499303,0.97536016,0.002991538,0.00013597429,0.001387656,0.00011672166,0.00034606896,0.0020250236],"genre_scores_gemma":[0.7799645,0.00045469753,0.19935189,0.0015989686,0.0016368652,0.0017202056,0.00014195293,0.00008535376,0.015045568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870956,0.00003161483,0.00029801982,0.0004975208,0.00015478223,0.00030850948],"domain_scores_gemma":[0.99893725,0.00018891662,0.00010712075,0.00048037915,0.00010827804,0.00017807982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019908253,0.00017997273,0.0001784242,0.00010321187,0.00037254323,0.00009718349,0.00048816449,0.00009230428,0.00015658591],"category_scores_gemma":[0.000033165437,0.00016929579,0.00009418314,0.00039344796,0.000075023665,0.00014921401,0.00011680748,0.0001244463,0.000529501],"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.0000039896686,0.00022070312,0.0000036829645,0.00007647119,0.00002986082,7.8868527e-7,0.0005292682,0.0013329183,0.0005476301,0.9820994,0.0024720281,0.012683242],"study_design_scores_gemma":[0.0004825804,0.00007180192,0.000024545738,0.0000116457995,0.000024012705,0.0000131616525,0.00003502513,0.89232993,0.002659435,0.016673494,0.087398075,0.0002763028],"about_ca_topic_score_codex":0.0000011360611,"about_ca_topic_score_gemma":4.4212058e-7,"teacher_disagreement_score":0.9654259,"about_ca_system_score_codex":0.000017362758,"about_ca_system_score_gemma":0.000019045938,"threshold_uncertainty_score":0.6903682},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04424365,0.000012066004,0.95266396,0.0023798863,0.00005836639,0.00013323646,0.0000040170985,0.00008405058,0.00042075923],"genre_scores_gemma":[0.65245974,0.000006021369,0.34662685,0.0006449237,0.000012528355,0.0000044575168,1.17279434e-7,0.0000039650104,0.00024136879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999087,0.00006089057,0.00022212366,0.00018107363,0.00026146718,0.00018749197],"domain_scores_gemma":[0.9990774,0.00016964562,0.00010945173,0.00052009383,0.000045347264,0.00007808776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022955748,0.00011203009,0.00021876881,0.000013565832,0.00020923559,0.000019563024,0.0006486942,0.000025526215,0.00006148721],"category_scores_gemma":[0.000019323015,0.000072075185,0.00038094664,0.0004501831,0.00031444008,0.00014087456,0.000021629396,0.00016318826,0.000026149022],"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.00005408008,0.002919675,0.000048979997,0.00012047038,0.00038281595,0.0000030571698,0.010024086,0.006676848,0.07287129,0.69070256,0.0019713887,0.21422474],"study_design_scores_gemma":[0.0013524812,0.0005712155,0.003116876,0.0001241781,0.00012342156,0.00006828925,0.0014449649,0.7249625,0.06994914,0.19621426,0.001261435,0.0008112599],"about_ca_topic_score_codex":0.0000047170183,"about_ca_topic_score_gemma":9.6794274e-8,"teacher_disagreement_score":0.7182856,"about_ca_system_score_codex":0.000024180003,"about_ca_system_score_gemma":0.000037069614,"threshold_uncertainty_score":0.29391408},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024280192,0.00020819165,0.9950517,0.00023736546,0.000022787037,0.00046792466,0.000014361698,0.000031501164,0.0015381759],"genre_scores_gemma":[0.49089774,0.0000148154395,0.50828654,0.00024642312,0.000038021903,0.000046307578,0.000014119965,0.000006022097,0.00044998789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986975,0.00020405646,0.00026787704,0.00035707682,0.000119766206,0.0003537321],"domain_scores_gemma":[0.99752927,0.002086817,0.000120320736,0.00020287154,0.000026552665,0.00003416198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018180892,0.00013268438,0.00019328928,0.00012654012,0.00013988836,0.00014835535,0.00023646928,0.000041844767,0.0000100785055],"category_scores_gemma":[0.000048230002,0.00011997795,0.0000751664,0.0002746639,0.000034013017,0.00042826156,0.000100706886,0.0000621752,0.0000013431813],"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.00011668776,0.00019163298,0.00012905347,0.000009835,0.000080127415,0.000001574124,0.0004375207,0.022528244,0.00011505818,0.97414553,0.000044016648,0.0022006962],"study_design_scores_gemma":[0.0009718002,0.00036350454,0.00079466874,0.0000038712556,0.00009808945,0.0000018496897,0.0018181495,0.8106961,0.00017416361,0.1824309,0.0024655967,0.0001812592],"about_ca_topic_score_codex":0.000016396458,"about_ca_topic_score_gemma":0.00007164106,"teacher_disagreement_score":0.79171467,"about_ca_system_score_codex":0.00002638588,"about_ca_system_score_gemma":0.000023759603,"threshold_uncertainty_score":0.48925588},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05028994,0.00040526263,0.93885577,0.0031268164,0.000049369963,0.0011487029,0.000019623161,0.00044922082,0.005655309],"genre_scores_gemma":[0.9883031,0.000042756394,0.008721352,0.00069147296,0.0000872781,0.00061702944,0.000032216467,0.000015239184,0.001489552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905914,0.000045259974,0.000176898,0.00033619502,0.00017571435,0.00020680475],"domain_scores_gemma":[0.99873537,0.0005222987,0.00010531504,0.00037834994,0.00013254117,0.00012611477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012978245,0.00013651694,0.0001248439,0.000100200385,0.0003407957,0.00015922745,0.00041389352,0.00005744544,0.00010717903],"category_scores_gemma":[0.00007514299,0.000105315565,0.000028313336,0.0006825849,0.000038728693,0.00040263895,0.0000764921,0.00012432887,0.0006108648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.7009025e-7,0.00010989689,0.0000152277835,0.0000058243204,0.00002095767,3.1562863e-7,0.00012788516,0.0000377847,0.0001092991,0.9873649,0.0003250207,0.0118821105],"study_design_scores_gemma":[0.0012198983,0.0004774613,0.004320974,0.00008478565,0.00007270923,0.000014977486,0.00010302943,0.4544449,0.002503225,0.5251054,0.010660092,0.0009925741],"about_ca_topic_score_codex":0.0000078529,"about_ca_topic_score_gemma":0.0000023828845,"teacher_disagreement_score":0.93801314,"about_ca_system_score_codex":0.000013411415,"about_ca_system_score_gemma":0.000034342534,"threshold_uncertainty_score":0.78516346},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41465783,0.0065904898,0.26026717,0.0007146898,0.0015654811,0.0009263235,0.0000066090665,0.0002639885,0.31500742],"genre_scores_gemma":[0.805453,0.00014004475,0.19427788,0.000024868341,0.000027345202,0.000009298115,2.5600247e-8,0.0000022678814,0.00006526419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985069,0.00009690924,0.00037013224,0.00030407307,0.00037890373,0.00034308652],"domain_scores_gemma":[0.99886566,0.00068111013,0.00014029762,0.00021055609,0.000050532995,0.000051827254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013930487,0.00012278436,0.00031991294,0.00025198518,0.00012851808,0.000026295227,0.0011162006,0.0000266289,0.00006868432],"category_scores_gemma":[0.0005495509,0.00008050012,0.00006347887,0.0020347675,0.0010508528,0.00037589791,0.00034983674,0.00008268702,0.000036690984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027995,0.00013614386,0.00054113194,0.00006946759,0.000015809752,0.000011784322,0.008091585,0.0000045973698,0.000020378346,0.9881437,0.00003526265,0.0029273706],"study_design_scores_gemma":[0.00016460722,0.00022743216,0.0009540313,0.00008996235,0.000006326364,0.0000119343595,0.0025793836,0.00572779,0.0040431404,0.9860374,0.000015362348,0.00014264068],"about_ca_topic_score_codex":0.000008844077,"about_ca_topic_score_gemma":0.0000026474183,"teacher_disagreement_score":0.39079517,"about_ca_system_score_codex":0.00002613579,"about_ca_system_score_gemma":0.000028492079,"threshold_uncertainty_score":0.3871911},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.4735579e-7,0.39597598,0.6000762,0.000042427266,0.00020917447,0.0025228343,0.0009439378,0.00010306254,0.00012625408],"genre_scores_gemma":[0.0000057438738,0.28497326,0.7120887,0.0000262542,0.00017550187,0.0009353535,0.0016347176,0.000058728827,0.00010173006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99503624,0.00042212426,0.0024424605,0.0009830311,0.00068398047,0.00043216458],"domain_scores_gemma":[0.99436766,0.0016325666,0.0019155425,0.001048945,0.0007063262,0.00032898385],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007456825,0.0007760904,0.0024608057,0.0005630318,0.00038331925,0.00021954112,0.0017407561,0.00018372326,0.000039314604],"category_scores_gemma":[0.0000804292,0.0006022046,0.00040882445,0.0015417928,0.00014786307,0.0003513201,0.0011817468,0.00042187644,0.001574149],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044610447,0.00015692378,2.971255e-7,0.012537309,0.00015628261,0.000012548615,0.00026294144,0.014101205,8.8912714e-8,0.25975835,0.0029692857,0.71004033],"study_design_scores_gemma":[0.0002667243,0.00042663622,0.000002076747,0.021881122,0.0006613822,0.00022142296,0.000068988964,0.5285223,2.4148363e-7,0.009433908,0.43752816,0.0009870457],"about_ca_topic_score_codex":0.000012363449,"about_ca_topic_score_gemma":0.0000060991215,"teacher_disagreement_score":0.7090533,"about_ca_system_score_codex":0.00029496913,"about_ca_system_score_gemma":0.0004935019,"threshold_uncertainty_score":0.9996429},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017821072,0.0012834563,0.986874,0.0049956646,0.00008983683,0.0004335283,0.00000801741,0.0001875411,0.0043458724],"genre_scores_gemma":[0.6123536,0.00026828906,0.3754233,0.0017968729,0.004508962,0.00061831553,0.000014196063,0.00003503575,0.0049814107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908537,0.000078421064,0.00021126031,0.00028632593,0.00012188724,0.00021673932],"domain_scores_gemma":[0.99927396,0.00013913115,0.00007204095,0.00039715032,0.000034830766,0.000082863626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039181486,0.000110084,0.00011236141,0.000030018531,0.00040757985,0.00018138066,0.0004944719,0.00004060133,0.000029329654],"category_scores_gemma":[0.000013041137,0.00007673046,0.00004254944,0.00028076378,0.000027726845,0.0002754755,0.000104189654,0.00015216158,0.00013986236],"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":[5.98398e-7,0.000021785658,0.0000053561093,0.000007154416,0.000009322104,2.811265e-7,0.00020648741,0.00021749659,0.00034996358,0.9802179,0.00026617254,0.01869748],"study_design_scores_gemma":[0.00017879988,0.000032671505,0.00010832326,0.000010048794,0.00001766982,0.00006908015,0.00009078401,0.7084717,0.004815326,0.01672636,0.26925313,0.00022611265],"about_ca_topic_score_codex":0.00000391406,"about_ca_topic_score_gemma":0.0000017786989,"teacher_disagreement_score":0.96349156,"about_ca_system_score_codex":0.000010071659,"about_ca_system_score_gemma":0.000024196925,"threshold_uncertainty_score":0.3134816},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025684511,0.000083017454,0.9688911,0.0025356764,0.0009068893,0.00018062338,0.00002670829,0.00023115032,0.0014603166],"genre_scores_gemma":[0.79221314,0.00035604593,0.2033845,0.001310553,0.0011674254,0.000016929394,0.00009524147,0.000027762884,0.0014283798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867505,0.00007053626,0.00032008882,0.00036165165,0.00035406646,0.00021858855],"domain_scores_gemma":[0.9992489,0.000044418568,0.00019132326,0.0001748623,0.00028965043,0.000050829043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003637798,0.00017898872,0.00014551837,0.000048306472,0.00028734645,0.00040655656,0.00025163664,0.000088501416,0.000021720003],"category_scores_gemma":[0.0000044135495,0.0001706529,0.00011903686,0.00019579775,0.00006764091,0.0009861939,0.00009294804,0.00011440287,0.000013019143],"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.00010229134,0.0011596334,0.003933328,0.0002954608,0.00070629903,0.00009619647,0.0066123283,0.429788,0.1877285,0.3443401,0.016905403,0.0083324835],"study_design_scores_gemma":[0.00036714156,0.000024395717,0.00015888536,0.000030559087,0.000015089691,0.000088872635,0.000073253024,0.9873378,0.007183108,0.0019431035,0.0025347217,0.00024301455],"about_ca_topic_score_codex":0.00009795835,"about_ca_topic_score_gemma":0.0000029848215,"teacher_disagreement_score":0.76652867,"about_ca_system_score_codex":0.00008500426,"about_ca_system_score_gemma":0.000042160755,"threshold_uncertainty_score":0.69590235},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025990076,0.00067288836,0.9693777,0.00040906778,0.000055772623,0.0002102164,0.000008298789,0.00008176032,0.0031942343],"genre_scores_gemma":[0.9545844,0.00006713158,0.0444538,0.00015874823,0.00025820168,0.000018336807,0.00000367118,0.0000062673785,0.00044939798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993732,0.000012673796,0.00019426085,0.00018338965,0.000097161945,0.00013933328],"domain_scores_gemma":[0.9994483,0.00013060935,0.00007242958,0.00022162778,0.000042602223,0.000084439765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022088575,0.000067931374,0.00010165681,0.00006343016,0.00009185384,0.000021601645,0.0003164341,0.00004162711,0.000021148478],"category_scores_gemma":[0.000010763794,0.000060072518,0.0000324998,0.00035253173,0.000028481938,0.00013172827,0.0000976465,0.00006533926,0.000052229134],"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.000010446054,0.00016336884,0.0001542958,0.000037034843,0.000019394354,0.0000017593707,0.00033366177,0.000009459947,0.0054134843,0.86505353,0.00074471126,0.12805882],"study_design_scores_gemma":[0.001573592,0.00038735985,0.007900042,0.00004040722,0.00007572612,0.00011851756,0.00022175543,0.0929765,0.20245375,0.031661976,0.6614914,0.0010989752],"about_ca_topic_score_codex":0.0000040748005,"about_ca_topic_score_gemma":3.317669e-7,"teacher_disagreement_score":0.92859435,"about_ca_system_score_codex":0.0000038050325,"about_ca_system_score_gemma":0.00001718096,"threshold_uncertainty_score":0.24496862},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006486202,0.00017989762,0.9816983,0.0004090178,0.00003805767,0.00057519216,0.000011808817,0.00010799238,0.010493564],"genre_scores_gemma":[0.88934106,0.00002722592,0.10927905,0.00039333015,0.00010714637,0.00023257191,0.0000338905,0.000009900573,0.00057580764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992418,0.00006491515,0.0001498965,0.0002884941,0.000110445195,0.00014439251],"domain_scores_gemma":[0.9994018,0.00009119895,0.000047844846,0.00025963483,0.00008411223,0.00011537304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020764906,0.00009628999,0.00010521728,0.000072979215,0.00023433524,0.00005895671,0.00020258538,0.000044609536,0.000012305152],"category_scores_gemma":[0.000027461236,0.00009120163,0.000024745463,0.0004053101,0.000017586937,0.00024954506,0.00004585385,0.0000907994,0.00012099705],"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.0000018525504,0.00007264442,0.0000135631635,0.000007507802,0.000006187786,1.3475254e-7,0.00017632473,0.00012143696,0.0006409357,0.99583757,0.000076932236,0.0030448963],"study_design_scores_gemma":[0.0012152792,0.00018047729,0.004786601,0.000021472699,0.00005453321,0.00009927292,0.00035846513,0.36359188,0.008980417,0.21530822,0.40442213,0.0009812494],"about_ca_topic_score_codex":0.0000026491148,"about_ca_topic_score_gemma":3.200867e-7,"teacher_disagreement_score":0.8828549,"about_ca_system_score_codex":0.000012305981,"about_ca_system_score_gemma":0.000020957881,"threshold_uncertainty_score":0.37190947},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013070957,0.00075187045,0.97745186,0.001768382,0.00009803538,0.00022719419,0.0000054521374,0.00007379201,0.0065524285],"genre_scores_gemma":[0.9647786,0.00016581216,0.029039718,0.00019501521,0.0003573603,0.00006199691,0.0000056134786,0.000009597541,0.0053862873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994416,0.000016520868,0.00016182933,0.00015215616,0.000085449516,0.00014242288],"domain_scores_gemma":[0.99929565,0.00024609757,0.000059714508,0.0002661372,0.00007869676,0.000053681222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023600594,0.000064465115,0.000065151115,0.00003206092,0.00033530383,0.00003283185,0.00028702288,0.000028060475,0.0000193685],"category_scores_gemma":[0.000014719735,0.00004495408,0.000026170565,0.00041919952,0.00008037214,0.000118358745,0.000073650415,0.000076311364,0.000030528703],"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.0000019997624,0.000028390941,0.000030663483,0.0000038526573,0.000009469223,1.3603521e-7,0.00009644856,0.0000037352552,0.0010808709,0.9785146,0.00008759061,0.020142255],"study_design_scores_gemma":[0.0005490783,0.00015462279,0.019699423,0.000013811655,0.00003075549,0.000020243306,0.00032474648,0.012504634,0.03831413,0.22249293,0.7054835,0.0004121416],"about_ca_topic_score_codex":0.000001972891,"about_ca_topic_score_gemma":0.0000026704595,"teacher_disagreement_score":0.95170766,"about_ca_system_score_codex":0.000003920674,"about_ca_system_score_gemma":0.000018206962,"threshold_uncertainty_score":0.25789198},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8298272,0.005420911,0.15480392,0.0054950723,0.00024560594,0.00018333025,0.000005448549,0.00002285792,0.0039956667],"genre_scores_gemma":[0.9982907,0.00052581326,0.0008762544,0.00008492572,0.00009242367,5.1924656e-7,1.01984604e-7,0.000006001005,0.00012321779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99865484,0.00014809667,0.00043651013,0.0000990878,0.00037612813,0.00028533879],"domain_scores_gemma":[0.9986735,0.00048256628,0.00042634606,0.0002406966,0.00013210048,0.000044790046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010731104,0.00010575123,0.00025575171,0.000119584285,0.00006399679,0.000019106754,0.00080821733,0.000043201482,0.00010632708],"category_scores_gemma":[0.00006208951,0.00006522374,0.0001943631,0.00036634717,0.000060982584,0.00026281885,0.000027836339,0.00040154246,0.000007802208],"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.000062384745,0.00032878036,0.00002779659,0.00003344197,0.00014398979,0.000012669578,0.0008013612,0.0001643276,0.0030958469,0.97001135,0.00034131506,0.024976758],"study_design_scores_gemma":[0.0021140636,0.0066955644,0.00039646224,0.0003111941,0.000145213,0.00072543055,0.00020441669,0.037449937,0.48453262,0.46254504,0.0044074175,0.00047264062],"about_ca_topic_score_codex":0.0000052901855,"about_ca_topic_score_gemma":0.000002961128,"teacher_disagreement_score":0.50746626,"about_ca_system_score_codex":0.000036248857,"about_ca_system_score_gemma":0.00012109193,"threshold_uncertainty_score":0.2659747},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58014154,0.0012261842,0.41252324,0.0018615936,0.00029809456,0.0000703382,0.000004796717,0.000013546376,0.0038606483],"genre_scores_gemma":[0.9517301,0.000052088457,0.047533333,0.00024022603,0.00009126461,3.7058422e-7,1.8367773e-7,0.0000056556473,0.00034678992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929273,0.00003606786,0.0003016553,0.000075272386,0.00010993602,0.00018435177],"domain_scores_gemma":[0.9989317,0.00010647415,0.00019392827,0.00021404894,0.00008607279,0.0004677913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005845217,0.00007808649,0.00027301835,0.00041222858,0.000085229825,0.00014516166,0.00043758616,0.00003722801,0.0000805771],"category_scores_gemma":[0.00008070822,0.00006487569,0.00009460643,0.00048486426,0.000052075466,0.00020192316,0.000017622582,0.00009332988,0.0000114187615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007693391,0.0001613226,0.018408567,0.00013860576,0.0021897447,0.002825617,0.016176553,0.0005879025,0.00039050262,0.86300945,0.005219653,0.090884395],"study_design_scores_gemma":[0.0036772266,0.00079865044,0.01784048,0.00044641056,0.0026991842,0.026659794,0.0042527537,0.2209717,0.0030143242,0.5712308,0.14604534,0.0023633225],"about_ca_topic_score_codex":0.00017604638,"about_ca_topic_score_gemma":0.00091286754,"teacher_disagreement_score":0.37158853,"about_ca_system_score_codex":0.000026823387,"about_ca_system_score_gemma":0.0002489489,"threshold_uncertainty_score":0.26455536},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053286585,0.002115508,0.9765623,0.008293241,0.000065873326,0.0009842941,0.000070350885,0.0002782923,0.0063014794],"genre_scores_gemma":[0.24367143,0.00056482013,0.7033248,0.009419823,0.0022011348,0.0021621757,0.0003406459,0.00008042964,0.03823472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909097,0.000044306304,0.00018578609,0.00030903475,0.00018721326,0.00018269832],"domain_scores_gemma":[0.99937665,0.0001489851,0.000044566812,0.0002859912,0.000058799316,0.00008502513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022183362,0.000112546564,0.00008832411,0.000025544488,0.0005601679,0.00011457256,0.00041505756,0.00003633981,0.00029630482],"category_scores_gemma":[0.000004318451,0.00008135114,0.00003758456,0.00028298263,0.000053090014,0.00025597715,0.000087151224,0.00013114688,0.00024985557],"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.0000028442907,0.00012962162,0.0000025914699,0.0000052813243,0.00002165101,7.733633e-7,0.00026905173,0.00025330528,0.0008313672,0.4744224,0.004119561,0.51994157],"study_design_scores_gemma":[0.0005267925,0.00004118737,0.00003276685,0.000011315899,0.0000139886815,0.00005979837,0.000013492098,0.7222482,0.0018491197,0.07846964,0.19646695,0.00026676126],"about_ca_topic_score_codex":0.000004847777,"about_ca_topic_score_gemma":6.943024e-7,"teacher_disagreement_score":0.7219949,"about_ca_system_score_codex":0.0000072903063,"about_ca_system_score_gemma":0.000039521517,"threshold_uncertainty_score":0.43084148},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020568098,0.00023190428,0.9966402,0.002055524,0.00008793668,0.00066103274,0.000024645138,0.00005234785,0.00004071074],"genre_scores_gemma":[0.1477605,0.00005376693,0.8518004,0.00015099511,0.00010893401,0.00007324481,0.000031322757,0.000007992351,0.000012896581],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999074,0.00012423951,0.0003129354,0.00019952151,0.00012093357,0.00016839268],"domain_scores_gemma":[0.9958287,0.0021957075,0.0002257498,0.0015615512,0.00014515994,0.000043128064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009266996,0.00011294668,0.00013020425,0.00005095079,0.00033525328,0.00006804886,0.0012835904,0.000026757527,0.0000018746274],"category_scores_gemma":[0.000009774164,0.00009102988,0.000074973555,0.00028468156,0.000078405435,0.00015846427,0.00067618466,0.00011973685,0.0000018195398],"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.0000036592637,0.000058093872,0.000041175394,0.000017308432,0.00003413182,4.010483e-8,0.0016536704,0.0014096285,0.0004661373,0.3950832,0.00006454543,0.60116845],"study_design_scores_gemma":[0.00050487625,0.00007535427,0.0026555404,0.000012939641,0.00003118381,0.000002813533,0.000119026925,0.9294759,0.0039111874,0.054260097,0.008811156,0.00013991758],"about_ca_topic_score_codex":0.00002559254,"about_ca_topic_score_gemma":0.00002332077,"teacher_disagreement_score":0.92806625,"about_ca_system_score_codex":0.000018520243,"about_ca_system_score_gemma":0.00002930988,"threshold_uncertainty_score":0.37120906},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008350225,0.0004860898,0.9893029,0.00016019215,0.00020380523,0.00024137787,0.0000027690028,0.000046623754,0.0012060441],"genre_scores_gemma":[0.2565253,0.000016613234,0.74230754,0.00007144829,0.000075952936,0.000019128483,3.0372348e-7,0.00000440608,0.000979296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992241,0.00007692673,0.00020766146,0.00017753484,0.00012250227,0.00019121938],"domain_scores_gemma":[0.9990422,0.000470951,0.00009963177,0.00029726478,0.000051842664,0.000038101236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012157105,0.0000833118,0.00014873508,0.00006735756,0.00015753998,0.000053559652,0.00039828918,0.0000303784,0.0000119363785],"category_scores_gemma":[0.00007544692,0.000050375314,0.000036413698,0.00035870334,0.000020680729,0.0001991487,0.00011232639,0.00006189073,0.0000082626275],"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.000013925743,0.00015632312,0.0006024769,0.0006029615,0.000056337987,0.0000024671726,0.0014655126,0.025439046,0.000107235624,0.7726384,0.0012099516,0.19770536],"study_design_scores_gemma":[0.00026982528,0.00008271403,0.000045339777,0.00001702804,0.0000060642697,0.000017080762,0.000026768404,0.9972454,0.0002409383,0.0005732798,0.001402865,0.00007274263],"about_ca_topic_score_codex":0.000009594316,"about_ca_topic_score_gemma":3.5330328e-7,"teacher_disagreement_score":0.9718063,"about_ca_system_score_codex":0.000004440151,"about_ca_system_score_gemma":0.00000560339,"threshold_uncertainty_score":0.20542458},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4606209,0.0018268399,0.5043257,0.026406134,0.00014030232,0.0011565255,0.000010215041,0.000061682884,0.0054517095],"genre_scores_gemma":[0.99868166,0.00015804576,0.000649532,0.00017972273,0.00004605717,0.000027229366,4.3040242e-7,0.0000024741807,0.00025484324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995547,0.000030603358,0.00013561679,0.000102345606,0.000112101254,0.00006464659],"domain_scores_gemma":[0.9993487,0.00014030385,0.000103485305,0.00033855045,0.000050056373,0.000018897397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014794062,0.000048009224,0.000059569877,0.000024590852,0.00012037898,0.00001423373,0.0004216074,0.000017872251,0.000016873013],"category_scores_gemma":[0.000018540919,0.00002542873,0.000024235736,0.00048987096,0.000037238435,0.000053378677,0.0000730787,0.00005479066,0.000012324862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015817969,0.000048655707,0.000042719323,0.000009535847,0.0000054029656,4.0672436e-8,0.000112115296,0.000068804686,0.00048128577,0.9951394,0.00005938805,0.0040310672],"study_design_scores_gemma":[0.0006005567,0.0002489724,0.009678174,0.00014485161,0.00006184599,0.00004670336,0.00026386642,0.18024711,0.13114953,0.63349414,0.043708883,0.00035536033],"about_ca_topic_score_codex":0.0000053010485,"about_ca_topic_score_gemma":0.0000010951591,"teacher_disagreement_score":0.5380608,"about_ca_system_score_codex":0.0000040711802,"about_ca_system_score_gemma":0.000018843028,"threshold_uncertainty_score":0.10369535},"labels":[],"label_agreement":null},{"id":"W2166356498","doi":"10.1002/nla.787","title":"On the perturbation of the Q‐factor of the QR factorization","year":2011,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Perturbation (astronomy); Mathematics; Invertible matrix; Factorization; Applied mathematics; Combinatorics; Pure mathematics; Algorithm; Physics; Quantum mechanics","score_opus":0.016871562044017387,"score_gpt":0.21272173993302815,"score_spread":0.19585017788901077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166356498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013472318,0.00001051597,0.9824405,0.0012411819,0.00007834666,0.0005869971,0.000015432952,0.00003596675,0.0021187635],"genre_scores_gemma":[0.99399465,0.0000013909141,0.005437082,0.00023739199,0.000037111273,0.000082491955,0.000001355895,0.000006906141,0.00020159798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991726,0.0001005979,0.00019104361,0.00016854085,0.00026807882,0.00009911849],"domain_scores_gemma":[0.9985486,0.00022898325,0.00022131533,0.00086050987,0.00011096974,0.00002960198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010227702,0.00008922376,0.000093141054,0.00001858464,0.00018526842,0.000011636814,0.0010343554,0.000037656893,0.00006347882],"category_scores_gemma":[0.00006422613,0.000036195666,0.000070965376,0.0007303793,0.00013916242,0.00007719571,0.0001071746,0.00013628768,0.000014986617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066735397,0.0001070035,0.00053067715,0.0000056731465,0.000011721436,1.7767706e-8,0.00059157005,0.000049566614,0.00039907475,0.995233,0.000034168123,0.0030308305],"study_design_scores_gemma":[0.00084772275,0.0005835417,0.12602903,0.00011619901,0.00010500239,0.000012292695,0.00022402868,0.096441396,0.2708145,0.4907951,0.013361632,0.0006695416],"about_ca_topic_score_codex":0.000011603426,"about_ca_topic_score_gemma":6.787318e-7,"teacher_disagreement_score":0.98052233,"about_ca_system_score_codex":0.000011893776,"about_ca_system_score_gemma":0.000051819217,"threshold_uncertainty_score":0.19221069},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008900077,0.00008241833,0.9902342,0.00020980026,0.00012014698,0.00010283065,8.831826e-7,0.0000068070785,0.00034282496],"genre_scores_gemma":[0.031388953,0.000006008819,0.96788776,0.00012821805,0.00026485196,0.0000054493917,2.5889275e-7,0.0000061520504,0.00031235823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992371,0.000088584085,0.00029133647,0.00010025779,0.00015289344,0.00012979782],"domain_scores_gemma":[0.9993777,0.00016139662,0.00016283775,0.00010679547,0.000108761444,0.000082501545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083783176,0.00008602031,0.00020082641,0.000028103306,0.00007048021,0.00011634299,0.00015419294,0.000028248589,0.000007581676],"category_scores_gemma":[0.00006637443,0.00005954751,0.000103186474,0.00008942438,0.00001646966,0.0002820528,0.000022029124,0.00007777684,0.0000026888777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023690732,0.000081654616,0.0000021363494,0.000062110565,0.000020004634,0.0000013890465,0.0003172812,0.00040245202,0.0021610777,0.9816058,0.00007167832,0.015272029],"study_design_scores_gemma":[0.0002927599,0.00014211563,0.0000034505204,0.000024170064,0.000015421778,0.00010203993,0.0000058849164,0.18752572,0.007256529,0.80394405,0.0006196931,0.000068172856],"about_ca_topic_score_codex":1.1171819e-7,"about_ca_topic_score_gemma":2.7263576e-8,"teacher_disagreement_score":0.18712327,"about_ca_system_score_codex":0.000008092281,"about_ca_system_score_gemma":0.000033397017,"threshold_uncertainty_score":0.2428277},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007639644,0.00021845214,0.989378,0.0016935418,0.0005210895,0.00010449325,0.000014363957,0.0000053374024,0.00042512495],"genre_scores_gemma":[0.99039644,0.000010132027,0.008042705,0.00028709468,0.00052746444,0.0000034545756,7.9495726e-7,0.000006432587,0.00072550046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995005,0.000026330872,0.00014074756,0.00006081642,0.000098640594,0.00017297975],"domain_scores_gemma":[0.9993015,0.00009385482,0.000113599825,0.00019125726,0.00010836719,0.0001913993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002135091,0.0000589968,0.000084399726,0.00004622276,0.0003858544,0.00006677881,0.0005906712,0.000017571223,0.000009191764],"category_scores_gemma":[0.000027179216,0.000042654756,0.00009413725,0.00016910698,0.00005287482,0.00032724504,0.000011364609,0.000116100215,0.0000063573057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037105046,0.000029878893,0.00010904143,0.000016850796,0.00006692441,0.0000697267,0.0040937094,0.0037298289,0.00020357623,0.9267305,0.010214466,0.054731768],"study_design_scores_gemma":[0.0019300448,0.00052252447,0.0016870031,0.00008518874,0.000057288416,0.0009509834,0.0003661787,0.20341551,0.010838294,0.47623673,0.3032583,0.000651961],"about_ca_topic_score_codex":0.000121213256,"about_ca_topic_score_gemma":0.00009127295,"teacher_disagreement_score":0.9827568,"about_ca_system_score_codex":0.000046177778,"about_ca_system_score_gemma":0.000553852,"threshold_uncertainty_score":0.2967719},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92372316,0.0033239156,0.066909164,0.004197154,0.00034908205,0.00044195866,0.0000014754147,0.000039800907,0.0010142806],"genre_scores_gemma":[0.9980533,0.00011668206,0.0009339358,0.0004929693,0.00022587279,0.0000015367999,1.7979177e-7,0.000008993197,0.00016652698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975665,0.00036426823,0.00068903563,0.00021001059,0.00069278205,0.000477363],"domain_scores_gemma":[0.99772865,0.00081747264,0.00067724945,0.00050055055,0.00019372597,0.000082377475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026530258,0.00018748108,0.0003760405,0.00040412534,0.00013697555,0.000067122724,0.00175737,0.000056576882,0.00002896331],"category_scores_gemma":[0.00025638545,0.000116376556,0.0002166898,0.0013205314,0.000033592376,0.00032446062,0.00008055922,0.00070557784,0.00001843335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010278632,0.0025293613,0.00007216207,0.000023293176,0.00032784272,0.00013969606,0.0021264944,0.00056393084,0.0007058668,0.93756056,0.0009924645,0.05393047],"study_design_scores_gemma":[0.012760871,0.12159866,0.008503792,0.0004888721,0.00066916546,0.0018395286,0.0019273745,0.07491245,0.038357463,0.73332137,0.0040063127,0.0016141185],"about_ca_topic_score_codex":0.0000026800367,"about_ca_topic_score_gemma":4.3133227e-7,"teacher_disagreement_score":0.20423916,"about_ca_system_score_codex":0.00006633291,"about_ca_system_score_gemma":0.0003340558,"threshold_uncertainty_score":0.47456983},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4396288,0.008160943,0.54447365,0.005518032,0.00030821547,0.00018948985,0.000002849958,0.0000723829,0.0016456463],"genre_scores_gemma":[0.974844,0.00040169084,0.023310987,0.0005189441,0.0005328094,0.0000010226285,9.4406033e-7,0.000012302553,0.0003773136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99838555,0.000078686564,0.00046949,0.00017481596,0.00033206053,0.0005593908],"domain_scores_gemma":[0.9991578,0.000066230095,0.00028981638,0.00023616735,0.00009866032,0.00015133395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011895167,0.00015072485,0.00025231967,0.00015321752,0.00016008843,0.00009216288,0.000722996,0.0000449794,0.00008168888],"category_scores_gemma":[0.000033755652,0.00011689868,0.000103709695,0.00022240919,0.00003794075,0.0008431223,0.00013711471,0.0005058508,0.000039857077],"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.00004106993,0.00014137308,0.00025258554,0.000015040564,0.00015136364,0.000021705342,0.00036895525,0.000085417945,0.0006863726,0.84373546,0.00065791956,0.15384273],"study_design_scores_gemma":[0.0073546562,0.0036682137,0.002061475,0.00016336425,0.00012903933,0.0037259418,0.00019884933,0.07524752,0.017889379,0.37656134,0.5118309,0.0011692815],"about_ca_topic_score_codex":0.0000017991623,"about_ca_topic_score_gemma":0.0000064962715,"teacher_disagreement_score":0.5352152,"about_ca_system_score_codex":0.000083898085,"about_ca_system_score_gemma":0.00021961045,"threshold_uncertainty_score":0.47669896},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007498054,0.00086882635,0.98667896,0.0018263619,0.0009754806,0.0005974092,0.00015160812,0.00028706584,0.0011162529],"genre_scores_gemma":[0.8151703,0.00025244188,0.18174525,0.0003402504,0.00096710725,0.00051626534,0.00012022116,0.000044524924,0.00084366236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967131,0.000028549568,0.0008075428,0.0010286393,0.00070726697,0.00071488146],"domain_scores_gemma":[0.9977469,0.0003442659,0.0005402282,0.00017181406,0.0008991712,0.0002976349],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009682049,0.00047693672,0.0005323511,0.0002567069,0.0009052266,0.0009998934,0.0012259118,0.00019634183,0.00000466242],"category_scores_gemma":[0.00018509486,0.00043441934,0.00019313261,0.00044988288,0.00012434622,0.0018285542,0.000245066,0.00030691322,0.000007253362],"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.0036153719,0.002795206,0.009610637,0.004418592,0.0016989933,0.00040136304,0.018919269,0.051224705,0.09848585,0.74179786,0.032291263,0.034740895],"study_design_scores_gemma":[0.0031733934,0.00022741675,0.000517613,0.00033981516,0.00006834114,0.0011061393,0.00034382462,0.9671594,0.0023700683,0.013273701,0.010434956,0.0009853377],"about_ca_topic_score_codex":0.000030553398,"about_ca_topic_score_gemma":4.2562942e-7,"teacher_disagreement_score":0.9159347,"about_ca_system_score_codex":0.00014710338,"about_ca_system_score_gemma":0.00025211682,"threshold_uncertainty_score":0.99981076},"labels":[],"label_agreement":null},{"id":"W2170774163","doi":"10.1002/nla.1825","title":"Hermitian‐type generalized singular value decomposition with applications","year":2012,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Shanghai Municipal Education Commission; National Natural Science Foundation of China; McGill University; Natural Science Foundation of Shanghai","keywords":"Hermitian matrix; Mathematics; Hermitian function; Singular value decomposition; Matrix (chemical analysis); Matrix function; Rank (graph theory); Pure mathematics; Algebra over a field; Applied mathematics; Symmetric matrix; Mathematical analysis; Combinatorics; Algorithm; Physics","score_opus":0.009507974454374934,"score_gpt":0.26415630785386945,"score_spread":0.2546483333994945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170774163","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019779254,0.00027356923,0.9933146,0.0008153757,0.000043902186,0.00094723515,0.000010377169,0.00045103888,0.002165923],"genre_scores_gemma":[0.2907889,0.000013375214,0.7063423,0.00082230184,0.0005314156,0.0011152494,0.000111478985,0.000040478124,0.00023454924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99824256,0.00010281625,0.0002940314,0.0005047872,0.00035428477,0.0005015443],"domain_scores_gemma":[0.9981669,0.00011810551,0.00016128748,0.000979836,0.0001861858,0.00038768706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021469146,0.0002594363,0.00025835712,0.000093726754,0.00045855978,0.000107225016,0.00069078046,0.00009017427,0.00006369594],"category_scores_gemma":[0.000006598801,0.00020085988,0.000062880994,0.001424311,0.00012699665,0.00049255,0.000103377504,0.00023233962,0.00046855325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003828603,0.0005794837,0.0005090151,0.0000209191,0.00006380944,0.0000021750188,0.00013652939,0.0008543854,0.0006614615,0.97279096,0.00014411325,0.024198886],"study_design_scores_gemma":[0.0033218272,0.0010138202,0.004368764,0.000087104236,0.0003891496,0.0007657743,0.00009284598,0.14230229,0.017706586,0.048505846,0.77860236,0.0028436345],"about_ca_topic_score_codex":0.000014519756,"about_ca_topic_score_gemma":6.331073e-7,"teacher_disagreement_score":0.9242851,"about_ca_system_score_codex":0.000054018215,"about_ca_system_score_gemma":0.00009408587,"threshold_uncertainty_score":0.8190828},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34203318,0.0006971417,0.64933705,0.0024396274,0.00036630788,0.0000868683,0.0000042382458,0.000016003021,0.0050195875],"genre_scores_gemma":[0.6582291,0.00018956143,0.34143534,0.00004255266,0.00005548993,0.0000010404478,9.1432064e-8,0.0000032725281,0.000043524946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867785,0.00001530704,0.00049506925,0.00012460748,0.00056493684,0.0001222497],"domain_scores_gemma":[0.9988204,0.0003891888,0.00040774906,0.00008800842,0.00019426059,0.00010034074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010666299,0.00009498337,0.0002271346,0.0003304282,0.00008004405,0.00016115003,0.00067041535,0.00003284828,0.00002060696],"category_scores_gemma":[0.00027804353,0.000064101245,0.00006907293,0.00030601857,0.00027839476,0.00047135164,0.0001682358,0.000083622544,0.0000048721645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025119355,0.00021138637,0.000025617863,0.000052214007,0.000045070443,0.000013324779,0.00091878243,0.000076369986,0.00036394157,0.9844345,0.000014291876,0.013842],"study_design_scores_gemma":[0.0005984627,0.00033592663,0.00009332431,0.0002358195,0.000031952415,0.0013593232,0.0014878039,0.008949133,0.0014287442,0.9851509,0.00018961003,0.00013900296],"about_ca_topic_score_codex":0.0000039385527,"about_ca_topic_score_gemma":3.8115033e-7,"teacher_disagreement_score":0.31619596,"about_ca_system_score_codex":0.00001844738,"about_ca_system_score_gemma":0.0000797561,"threshold_uncertainty_score":0.26139727},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06916845,0.00014336726,0.9293619,0.0010355052,0.000019841471,0.00015913906,0.000006355114,0.0000051746697,0.00010031806],"genre_scores_gemma":[0.9635736,0.000024599503,0.03617468,0.000015610152,0.00006274856,0.000010550529,6.9156755e-7,0.000002707447,0.0001348637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985819,0.00007875034,0.00071302074,0.00012516174,0.00038137252,0.0001198166],"domain_scores_gemma":[0.99844664,0.0002032203,0.0006531409,0.00029220016,0.0003174751,0.00008734817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006474465,0.000082546154,0.00031609833,0.00032249285,0.000081169936,0.000032996813,0.00048283706,0.000038963874,0.0000678505],"category_scores_gemma":[0.00010597709,0.000054076216,0.0002211278,0.0020655633,0.000046818936,0.0002334118,0.0001454115,0.000083726045,0.00000833589],"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.000025839614,0.0012138616,0.00043579034,0.00024662763,0.00058447535,2.408004e-7,0.0007693801,0.005691201,0.12297175,0.83762115,0.00019799788,0.030241672],"study_design_scores_gemma":[0.00035258554,0.00011112437,0.0036152315,0.00006657402,0.00097258796,0.00001653872,0.000058450943,0.8889656,0.05921313,0.046152472,0.000306656,0.00016904002],"about_ca_topic_score_codex":0.0000031902173,"about_ca_topic_score_gemma":0.0000015146782,"teacher_disagreement_score":0.8944051,"about_ca_system_score_codex":0.000024914982,"about_ca_system_score_gemma":0.000040662908,"threshold_uncertainty_score":0.22051641},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.896298e-7,0.00073359726,0.23648098,0.00033251214,0.00053960725,0.0001246493,0.000006853948,0.0009513535,0.76083016],"genre_scores_gemma":[0.000011387751,0.00006205908,0.10254655,0.00032315837,0.0008671417,0.000006451734,0.000010487229,0.0001268508,0.8960459],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988052,0.000039335853,0.00016179252,0.00045742202,0.00023561486,0.00030059856],"domain_scores_gemma":[0.99889076,0.00002079513,0.000108601256,0.0008672162,0.000009075266,0.0001035702],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015446507,0.00025198402,0.00024802273,0.0002198719,0.00007439895,0.00010034383,0.0014833275,0.00021914998,0.060594037],"category_scores_gemma":[0.0000046754253,0.00020652937,0.00010713926,0.00019939708,0.00003210481,0.00011198586,0.0005239781,0.00017176237,0.014708892],"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":[2.7501008e-7,0.00001927342,2.6500538e-7,0.000009644698,0.000012700535,0.000008901558,0.000016722019,5.535392e-7,0.0000014288701,0.39785662,0.57070524,0.03136835],"study_design_scores_gemma":[0.0001243832,0.000023420424,4.925811e-7,0.00003056464,0.0000050086755,0.000020126114,0.0000021302567,0.0009762182,0.000056917004,0.003661842,0.9948075,0.00029141837],"about_ca_topic_score_codex":0.000036385034,"about_ca_topic_score_gemma":0.000015287374,"teacher_disagreement_score":0.42410222,"about_ca_system_score_codex":0.0000150774695,"about_ca_system_score_gemma":0.00004264548,"threshold_uncertainty_score":0.9860583},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07168048,0.000010884948,0.9266544,0.00010215315,0.0009057325,0.00020317141,0.00001157293,0.00021142735,0.00022020911],"genre_scores_gemma":[0.60317785,0.000013334936,0.39651605,0.000051009738,0.00007558179,0.000006418001,6.480951e-7,0.000012101897,0.00014701393],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988197,0.00005670131,0.00035218016,0.000290061,0.0002653259,0.00021600285],"domain_scores_gemma":[0.9990048,0.00011495164,0.00011641406,0.0005367962,0.00014472143,0.00008232075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027807086,0.00017648337,0.00018071187,0.00020121138,0.0002027117,0.00009290271,0.00050502265,0.00014216144,0.000080942766],"category_scores_gemma":[0.0000066214757,0.00017361461,0.000101114194,0.000333279,0.00008357717,0.00031119888,0.0000054132447,0.00044657447,0.000010664561],"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.000012196538,0.00032764013,0.0000041632657,0.000034963963,0.00001257227,0.00000726327,0.0007521073,0.0064236904,0.39471138,0.0021576786,0.000018814886,0.59553754],"study_design_scores_gemma":[0.00018565949,0.00011882292,0.000016898988,0.000022064323,0.000020754436,0.000027646152,0.000027655802,0.40893972,0.58793855,0.002242237,0.0002781318,0.00018186745],"about_ca_topic_score_codex":0.000054561035,"about_ca_topic_score_gemma":0.000023995646,"teacher_disagreement_score":0.5953557,"about_ca_system_score_codex":0.00001564385,"about_ca_system_score_gemma":0.000054794844,"threshold_uncertainty_score":0.7079798},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3112626,0.000031168496,0.6864316,0.00006098161,0.00047851316,0.00013607553,0.000003086128,0.00006936867,0.0015265903],"genre_scores_gemma":[0.9953598,0.000077293116,0.0041868566,0.00011770072,0.0000135956725,0.000011090116,1.2348337e-7,0.000008144534,0.0002254077],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990908,0.000060956303,0.00021532855,0.00019192579,0.00023854028,0.00020244239],"domain_scores_gemma":[0.99932003,0.00006946997,0.00008530097,0.0003768865,0.00009502296,0.0000533013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026278745,0.00012579214,0.00010748814,0.00012220656,0.00027634692,0.00002958307,0.0004858579,0.00004156426,0.000031817537],"category_scores_gemma":[0.000002531193,0.00009294426,0.000049669445,0.00057290087,0.00013124016,0.0001596007,0.0000025072497,0.00022041326,0.000015129212],"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.0004017628,0.0015219506,0.00006308187,0.00052724394,0.00012737459,0.000029598143,0.042576328,0.035205454,0.03414541,0.04312359,0.00005299944,0.8422252],"study_design_scores_gemma":[0.00039711985,0.001551884,0.00022674732,0.00014807748,0.00003953003,0.000016314098,0.00032314885,0.09324692,0.9026899,0.00089116656,0.0002152068,0.00025401794],"about_ca_topic_score_codex":0.000004984917,"about_ca_topic_score_gemma":0.0000060471425,"teacher_disagreement_score":0.86854446,"about_ca_system_score_codex":0.00001146587,"about_ca_system_score_gemma":0.000054370998,"threshold_uncertainty_score":0.37901568},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9796166,0.00010173519,0.01422295,0.004111288,0.0005603042,0.00007966915,3.6559427e-7,0.000011494109,0.0012955865],"genre_scores_gemma":[0.9921976,0.0000042127417,0.006941841,0.0004143961,0.00015756395,0.0000020856717,1.3638088e-7,0.0000021280518,0.00028008522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998635,0.00024467704,0.00031463674,0.00017286891,0.00040776547,0.00022508093],"domain_scores_gemma":[0.9987199,0.00045775218,0.00034680133,0.00019355929,0.00020381171,0.00007818446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021396875,0.00009096855,0.00015426177,0.0001888444,0.00019024932,0.00012734893,0.0009299172,0.000046400244,0.000017886603],"category_scores_gemma":[0.00024491546,0.000047300833,0.00003557871,0.00045512943,0.00023882314,0.0008837236,0.000096113574,0.00026181035,0.000009013975],"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.00012745002,0.0001646126,0.019960789,0.000004977363,0.000020325278,0.000116860705,0.004435899,0.94560534,0.00011308949,0.021832626,0.00044277174,0.0071752355],"study_design_scores_gemma":[0.0020426556,0.0035054735,0.052878898,0.00012888703,0.000017535114,0.0007801586,0.0019653204,0.83355254,0.0013651421,0.09917322,0.0042064767,0.00038369684],"about_ca_topic_score_codex":0.000029517352,"about_ca_topic_score_gemma":0.000077332945,"teacher_disagreement_score":0.11205282,"about_ca_system_score_codex":0.000027102406,"about_ca_system_score_gemma":0.00020264815,"threshold_uncertainty_score":0.19288719},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002918156,0.00038164074,0.99472016,0.00021512281,0.0014510832,0.00055966823,0.000040242823,0.0001401759,0.0024627286],"genre_scores_gemma":[0.024592048,0.000057460442,0.97285706,0.00034450984,0.0006044169,0.000028867706,0.0000044873786,0.00003964042,0.0014715169],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969997,0.000039173046,0.00056669634,0.001186162,0.00067187496,0.00053643103],"domain_scores_gemma":[0.99657464,0.0013564737,0.00051092164,0.0010930154,0.00034009857,0.00012484616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011484111,0.00043469324,0.0005759919,0.0007971725,0.0001947519,0.00024983086,0.0029827915,0.00027219357,0.000024325063],"category_scores_gemma":[0.00023721781,0.00034493307,0.00020981528,0.00042175665,0.00047420987,0.00074668246,0.0007498691,0.00024546165,0.000019474182],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010731647,0.00002046535,0.000013433749,0.000111407295,0.0000064595724,0.000017325428,0.00025516658,0.00035444763,0.00011723501,0.029809896,0.000010785533,0.9692727],"study_design_scores_gemma":[0.00076903566,0.00058303267,0.00005003409,0.0014890924,0.00003109476,0.00007556714,1.8449478e-7,0.20269406,0.011498732,0.7756332,0.005954952,0.0012209972],"about_ca_topic_score_codex":0.000004227702,"about_ca_topic_score_gemma":0.000015060754,"teacher_disagreement_score":0.9680517,"about_ca_system_score_codex":0.00014497085,"about_ca_system_score_gemma":0.0003540861,"threshold_uncertainty_score":0.9999003},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018583349,0.00068123976,0.99531204,0.00023745144,0.0013581568,0.00063119683,0.000006149721,0.00028236757,0.0013055489],"genre_scores_gemma":[0.0023722337,0.0000137665975,0.99043477,0.00011162992,0.00044306723,0.000107042906,0.0000028412915,0.000013988233,0.0065006586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984401,0.00024714705,0.0003083251,0.00045790302,0.0001913175,0.00035521766],"domain_scores_gemma":[0.9989371,0.00035328043,0.00010292606,0.00039917906,0.00010855042,0.00009899106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001061478,0.00017492089,0.00023858338,0.00012211983,0.0002519867,0.0002618301,0.00048493582,0.000091523456,0.00005506872],"category_scores_gemma":[0.000074054595,0.00014113175,0.00013838381,0.00034838793,0.000027763108,0.0005287981,0.00008832674,0.00009786387,0.000018944354],"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.000027361397,0.00025429935,0.000008873258,0.00013018573,0.00008775735,0.000008742077,0.00095424126,0.002963666,0.0022618945,0.5723137,0.002921046,0.41806823],"study_design_scores_gemma":[0.0004977552,0.00009688479,0.0000033359581,0.000011660166,0.000010629742,0.00007879705,0.000059301314,0.97325027,0.0007286864,0.004859688,0.020187156,0.00021583245],"about_ca_topic_score_codex":0.000052947635,"about_ca_topic_score_gemma":4.77003e-7,"teacher_disagreement_score":0.9702866,"about_ca_system_score_codex":0.0000618649,"about_ca_system_score_gemma":0.000027826232,"threshold_uncertainty_score":0.5755186},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005374123,0.00045969166,0.9956962,0.0016093003,0.0003101326,0.0004920245,0.00003892749,0.00014207013,0.00071423186],"genre_scores_gemma":[0.44296396,0.00009358232,0.54023325,0.0014398826,0.00080082036,0.00036269258,0.000016721215,0.00004351508,0.014045598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998882,0.00017226386,0.00018494194,0.00031129067,0.00012069624,0.0003287837],"domain_scores_gemma":[0.99844265,0.00089559256,0.00006714492,0.00046637465,0.00003728657,0.000090970716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086074916,0.00014104748,0.0001556114,0.000034794983,0.00037121953,0.00018926029,0.0004981637,0.00005127664,0.000009047463],"category_scores_gemma":[0.00010231359,0.00007907903,0.000064699496,0.0001251288,0.000027791071,0.000054281933,0.00012584194,0.00011564433,0.000011952175],"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.00008565637,0.00016213518,0.0000066874245,0.00006923634,0.00008346922,0.000009155085,0.00060160714,0.002604593,0.00042010003,0.87838244,0.0051134992,0.11246141],"study_design_scores_gemma":[0.00058734533,0.00013423324,0.000014626198,0.000008543639,0.0000057528264,0.000015857777,0.000047719728,0.97115606,0.00048742414,0.0062528197,0.021158565,0.00013106428],"about_ca_topic_score_codex":0.00001395855,"about_ca_topic_score_gemma":0.0000061654387,"teacher_disagreement_score":0.96855146,"about_ca_system_score_codex":0.000008651418,"about_ca_system_score_gemma":0.0000071947297,"threshold_uncertainty_score":0.3224749},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013241894,0.0104666045,0.6221891,0.00079806044,0.009531241,0.0016139431,0.002572269,0.000934797,0.35176158],"genre_scores_gemma":[0.0015435305,0.0039368374,0.72612005,0.000049792536,0.00056650816,0.000017765902,0.000118186435,0.00009240838,0.2675549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99830174,0.000032517863,0.000445184,0.00062552374,0.00030905486,0.00028598835],"domain_scores_gemma":[0.9985225,0.00023598793,0.0002702349,0.00072986056,0.00014897404,0.00009244826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028650856,0.00037900006,0.00044275442,0.00023991475,0.00017262029,0.0003203599,0.0006679798,0.00024810972,0.00006941307],"category_scores_gemma":[0.00012798121,0.00038303653,0.000029023453,0.00010953428,0.00024271649,0.00037990307,0.00050198706,0.0005892103,0.0000401696],"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.0000066286602,0.000012745185,0.000061540544,0.00019078578,0.000023986633,0.000061869396,0.00025808785,0.000002816749,0.00006336548,0.9939368,0.0005244642,0.004856935],"study_design_scores_gemma":[0.00018744697,0.00007889318,0.00018335326,0.00011574008,0.000034267683,0.000045814293,0.000009283421,0.0002616483,0.0004079354,0.26207125,0.7358718,0.00073256093],"about_ca_topic_score_codex":0.000017776118,"about_ca_topic_score_gemma":0.000058145146,"teacher_disagreement_score":0.73534733,"about_ca_system_score_codex":0.00004016863,"about_ca_system_score_gemma":0.00012853689,"threshold_uncertainty_score":0.99986213},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000071398204,0.00039495918,0.03368014,0.00038843206,0.0014627429,0.0002308345,0.000022890443,0.00033807932,0.9634748],"genre_scores_gemma":[0.00022829928,0.00019963819,0.01733773,0.0048469775,0.00073007384,0.000006746709,0.000015527503,0.000036659807,0.9765983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99849105,0.000018881861,0.00032415945,0.00058356376,0.00029259306,0.0002897502],"domain_scores_gemma":[0.99870294,0.00005744484,0.000108009874,0.0009297901,0.00004871949,0.00015307424],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002688541,0.00034872838,0.00030917555,0.00015909008,0.00010738264,0.00012466499,0.001511696,0.00019839936,0.00506365],"category_scores_gemma":[0.0000039810343,0.0002911115,0.0001698464,0.000026973361,0.00006317651,0.00054574915,0.00072686456,0.00029395265,0.0025551424],"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.0000023441503,0.000008925944,4.7955325e-7,0.000011993119,0.0000373507,0.000044924887,0.00006831357,3.1764975e-7,0.000008967629,0.9680115,0.0066460464,0.025158819],"study_design_scores_gemma":[0.00015438876,0.00008715461,0.0000016805582,0.00003642445,0.000016501752,0.00001646571,0.0000022866195,0.00018493771,0.0012647004,0.4428699,0.5548498,0.00051573507],"about_ca_topic_score_codex":0.000017391643,"about_ca_topic_score_gemma":0.0000029413,"teacher_disagreement_score":0.54820377,"about_ca_system_score_codex":0.000033170032,"about_ca_system_score_gemma":0.00007548409,"threshold_uncertainty_score":0.9999541},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000001132561,0.00007029335,0.024113359,0.0003786905,0.000245566,0.000115772214,0.000007088363,0.00019297955,0.9748751],"genre_scores_gemma":[0.000676423,0.000030423747,0.0060965996,0.001132144,0.0002431715,0.0000013847794,0.000004015077,0.000010096431,0.99180573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903226,0.000014926336,0.00016326395,0.0004045468,0.00022387312,0.00016111374],"domain_scores_gemma":[0.99910235,0.00014882079,0.000087204644,0.0005383702,0.000042944124,0.00008029059],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000104387684,0.00024986416,0.00021717176,0.0000956388,0.00007697634,0.00009039969,0.0006090701,0.00016058779,0.00087979116],"category_scores_gemma":[0.000009272728,0.00019426427,0.00011534716,0.000022788498,0.000044470384,0.00012305375,0.00008450696,0.00025431465,0.001040234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025646546,0.000008125853,1.1328162e-8,0.0000025370775,0.00000935587,0.00022941975,0.000029965193,0.0000037648545,6.30532e-7,0.8789092,0.0031558373,0.117648646],"study_design_scores_gemma":[0.00009781771,0.00042152725,0.000001434279,0.00007412373,0.0000070815468,0.00009912149,0.0000032161995,0.0003788083,0.00020640994,0.5202014,0.47812787,0.0003812311],"about_ca_topic_score_codex":0.00000265901,"about_ca_topic_score_gemma":0.000003023867,"teacher_disagreement_score":0.47497204,"about_ca_system_score_codex":0.000025062649,"about_ca_system_score_gemma":0.0000494579,"threshold_uncertainty_score":0.99973756},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025813105,0.000814642,0.9675413,0.0017965114,0.000061117826,0.00060052815,0.000014952912,0.0003851968,0.002972649],"genre_scores_gemma":[0.97405976,0.000037859772,0.023032468,0.00067833415,0.00017863986,0.000266474,0.00007406983,0.000028644852,0.0016437648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988067,0.00007706834,0.00020410195,0.00039961096,0.0002873749,0.00022514853],"domain_scores_gemma":[0.9986689,0.00034014825,0.00013243649,0.0004903555,0.00015430158,0.00021383876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035621732,0.000160575,0.0001592375,0.000122059355,0.00030077633,0.00013439888,0.00046032254,0.000074159885,0.00001032744],"category_scores_gemma":[0.0001878622,0.00013099452,0.00003261431,0.00086375757,0.00005286199,0.00031636274,0.0000920639,0.00013518907,0.00014453132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003838412,0.00014164881,0.000012347182,0.000005354288,0.00002801295,0.0000018676977,0.00029277868,0.00011837958,0.00006524451,0.9926769,0.00028725681,0.0063663577],"study_design_scores_gemma":[0.0019300845,0.0006842302,0.00040230027,0.00010103562,0.00011775765,0.000030232426,0.00016557385,0.36724055,0.00330694,0.5895287,0.035503227,0.0009893565],"about_ca_topic_score_codex":0.0000035728617,"about_ca_topic_score_gemma":0.0000021296983,"teacher_disagreement_score":0.94824666,"about_ca_system_score_codex":0.00002840571,"about_ca_system_score_gemma":0.00009198386,"threshold_uncertainty_score":0.5341801},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19655493,0.004724065,0.7191604,0.029219508,0.0020261768,0.0018443029,0.000100986064,0.0016981378,0.044671517],"genre_scores_gemma":[0.78384095,0.0012772465,0.20649426,0.00038149115,0.00021337777,0.00010198319,0.00010235804,0.00006396397,0.007524364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935663,0.0037717666,0.00048385395,0.0012156104,0.0005159195,0.00044654636],"domain_scores_gemma":[0.9939081,0.0013910991,0.0004709315,0.0030848936,0.000891065,0.00025392525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004991791,0.0004057959,0.00041953006,0.0002343472,0.00044717913,0.0007363312,0.0025629748,0.00030811367,0.000027711772],"category_scores_gemma":[0.0011430952,0.00039711932,0.0001488677,0.00029986788,0.00027749827,0.00031524268,0.0028551053,0.00073706836,0.00007875012],"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.000017527076,0.00082647626,0.00041336063,0.00031433394,0.00007916002,0.000021613487,0.005231233,0.00017283167,0.00040989785,0.9069332,0.0010216878,0.08455867],"study_design_scores_gemma":[0.002991333,0.000013581797,0.007692548,0.009562967,0.0001457923,0.00011277337,0.00012694724,0.5463321,0.07643291,0.30170557,0.05148089,0.0034025928],"about_ca_topic_score_codex":0.0001134262,"about_ca_topic_score_gemma":0.00004225283,"teacher_disagreement_score":0.60522765,"about_ca_system_score_codex":0.000049739734,"about_ca_system_score_gemma":0.00022327794,"threshold_uncertainty_score":0.99984807},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.3987206e-7,0.000023073671,0.4498073,0.00007495172,0.0003168708,0.000035081106,6.8656215e-7,0.00024275851,0.549499],"genre_scores_gemma":[0.000031234133,0.0000066947737,0.17247695,0.0001240543,0.00017548284,0.000003603089,0.0000021321418,0.00004033046,0.8271395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99960107,0.000018334831,0.000051537645,0.00017060706,0.000080099715,0.00007837373],"domain_scores_gemma":[0.9995884,0.000021534772,0.000054010194,0.00030134356,0.000008301356,0.000026462883],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000056958783,0.000083591716,0.00007716368,0.00008392734,0.000017985636,0.00005132167,0.00043874895,0.00011089812,0.0034006303],"category_scores_gemma":[0.000009461501,0.00006553595,0.000024423265,0.00008402575,0.000019864981,0.00006023966,0.000070359005,0.00010313031,0.000519774],"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":[1.6271146e-7,0.00000964783,0.000001024527,0.000009535204,0.000006862537,0.000002339614,0.00005432604,1.01420724e-7,0.00008860949,0.7032557,0.21800257,0.07856909],"study_design_scores_gemma":[0.000045671557,0.0000067879478,0.0000071451745,0.000010845319,0.0000010111182,0.000001830003,0.0000020028901,0.00063267007,0.0005004833,0.0106026055,0.9880743,0.00011465712],"about_ca_topic_score_codex":0.000014446358,"about_ca_topic_score_gemma":0.00001714758,"teacher_disagreement_score":0.7700717,"about_ca_system_score_codex":0.0000018972116,"about_ca_system_score_gemma":0.00001603066,"threshold_uncertainty_score":0.9975104},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106564924,0.00025475054,0.8895823,0.0013480524,0.00058219704,0.0001816457,0.000034191788,0.000012024744,0.0014399367],"genre_scores_gemma":[0.833224,0.00001152496,0.16613534,0.00008910123,0.00021270444,0.0000035574578,5.326324e-7,0.000015111068,0.00030815622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991417,0.000024851037,0.00030332635,0.00010501714,0.00014833861,0.00027676875],"domain_scores_gemma":[0.9983305,0.00012419473,0.0004978917,0.0005002911,0.00014726966,0.0003998703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010392511,0.00010566687,0.00024581273,0.00011885682,0.0006188003,0.0004939357,0.0013041083,0.000051491334,0.00001576254],"category_scores_gemma":[0.0002038015,0.00008821911,0.00014918618,0.000043995406,0.00007924432,0.0005082962,0.000029088935,0.000102392034,0.00001066313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023442904,0.00021223318,0.0007902092,0.0014058265,0.00032719361,0.0013707244,0.016366715,0.00021279532,0.001567951,0.9093757,0.0063227774,0.062024433],"study_design_scores_gemma":[0.0038656213,0.00073866925,0.00296849,0.0010097307,0.00027222928,0.00567344,0.0007713366,0.21960302,0.015643256,0.7132769,0.03470415,0.0014731274],"about_ca_topic_score_codex":0.00012197592,"about_ca_topic_score_gemma":0.0009009267,"teacher_disagreement_score":0.72665906,"about_ca_system_score_codex":0.00006976068,"about_ca_system_score_gemma":0.00040545268,"threshold_uncertainty_score":0.47630334},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99163735,0.00008993929,0.0068437476,0.00066152983,0.00024925798,0.00022859251,0.000032575605,0.00005059099,0.00020641282],"genre_scores_gemma":[0.5370669,0.00079151534,0.0025544693,0.000083758925,0.000057221758,8.6928253e-7,0.0005534161,0.000023732471,0.45886818],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.9990903,0.00007803696,0.00010203244,0.00034142798,0.00017036991,0.00021782288],"domain_scores_gemma":[0.9993955,0.000028137169,0.00019104888,0.00025218315,0.00006676119,0.0000663617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014845403,0.00016659434,0.00032233965,0.00028906556,0.0001281388,0.000031440857,0.00042452515,0.00019558969,0.000039109862],"category_scores_gemma":[0.0000063516914,0.00019642407,0.00006285078,0.00021886878,0.000040274674,0.0004954551,0.0000644414,0.0001738107,0.000018135046],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077984115,0.00078186946,0.0099127,0.0013372815,0.00029205682,0.001018243,0.81471336,0.000030348441,0.07427238,0.047223423,0.00069042423,0.048948064],"study_design_scores_gemma":[0.033519864,0.0014743494,0.56968427,0.0028850725,0.00050756795,0.00018699175,0.17108518,0.14498442,0.02076686,0.0055343453,0.042505123,0.0068659787],"about_ca_topic_score_codex":0.0022915374,"about_ca_topic_score_gemma":0.00609782,"teacher_disagreement_score":0.6436282,"about_ca_system_score_codex":0.000028184855,"about_ca_system_score_gemma":0.000050794297,"threshold_uncertainty_score":0.8009941},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045756283,0.00055574044,0.99251527,0.00022932903,0.0021885894,0.00029043012,0.000007796939,0.00016179966,0.0035934765],"genre_scores_gemma":[0.4955071,0.000049862978,0.5015375,0.0010479524,0.0013100752,0.000002679021,0.000005906769,0.000050889525,0.00048806114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996047,0.00007814645,0.0007859857,0.0014049252,0.0009929787,0.0006909264],"domain_scores_gemma":[0.99654263,0.00088013586,0.0006864992,0.0014477049,0.00024386273,0.00019918183],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014678126,0.0005862745,0.00082357926,0.0009831171,0.0002697117,0.00028345382,0.0046064346,0.00033922703,0.000035975183],"category_scores_gemma":[0.000115280665,0.00052478886,0.00021703477,0.0007406535,0.00085593126,0.00044198512,0.0020726216,0.00072715455,0.00005003162],"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.000014730014,0.000044531025,0.00018993941,0.00020415858,0.000025801713,0.000080936305,0.0010904581,0.02565849,0.00024807506,0.10592029,0.00015458341,0.866368],"study_design_scores_gemma":[0.00075947936,0.00046858593,0.00018198606,0.0010437731,0.00002666617,0.00015571175,7.609117e-7,0.8472039,0.006935938,0.13635585,0.005385586,0.0014817636],"about_ca_topic_score_codex":0.000048044927,"about_ca_topic_score_gemma":0.000019739358,"teacher_disagreement_score":0.8648862,"about_ca_system_score_codex":0.00013446172,"about_ca_system_score_gemma":0.0004583509,"threshold_uncertainty_score":0.9997204},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15772443,0.00006427146,0.8409284,0.0000132251525,0.000066316614,0.00019703497,0.000014396622,0.00004700255,0.00094496197],"genre_scores_gemma":[0.97998077,0.00012412669,0.01950188,0.00000733915,0.000023468072,0.0000015597798,0.0000045602155,0.0000062471527,0.0003500294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990223,0.00007950751,0.00017991776,0.00050048216,0.00007309167,0.00014471092],"domain_scores_gemma":[0.99827904,0.00012553493,0.0004408081,0.0008824831,0.00020305456,0.00006906344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020559622,0.00016183192,0.0002913674,0.0001579826,0.0000512729,0.000018451196,0.0015848585,0.00010521983,0.000029967805],"category_scores_gemma":[0.0000060808493,0.00015666193,0.000096025346,0.0004984053,0.0001921935,0.00015819006,0.00074309966,0.00017411914,0.000016330787],"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.000030771,0.00008790505,0.0018331386,0.00031381357,0.000074075615,0.000011947269,0.000101921396,0.2799136,0.000078540426,0.71718156,0.000030365136,0.0003423693],"study_design_scores_gemma":[0.0006432847,0.00022728622,0.0009256971,0.00022353248,0.00015442239,0.000007546998,0.00013038292,0.928511,0.012235279,0.0554843,0.00082685315,0.00063041254],"about_ca_topic_score_codex":0.000043382257,"about_ca_topic_score_gemma":0.000001997726,"teacher_disagreement_score":0.8222564,"about_ca_system_score_codex":0.000017629676,"about_ca_system_score_gemma":0.0001187222,"threshold_uncertainty_score":0.63884884},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6818249,0.000077773126,0.30862716,0.000346157,0.0002972733,0.00019902011,0.000060437535,0.00015560976,0.008411671],"genre_scores_gemma":[0.98598313,0.000024839432,0.013253478,0.0001219568,0.000042348973,2.620178e-7,0.0000025533266,0.0000037588693,0.00056768366],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993573,0.000036609497,0.000071002214,0.00014874767,0.00017053974,0.00021580402],"domain_scores_gemma":[0.9994541,0.00003592569,0.000040744904,0.0002464672,0.000053647032,0.00016913937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021649766,0.000025580313,0.00010829156,0.000053094605,0.00019170789,0.000058001988,0.0005360551,0.000042775588,0.00006809799],"category_scores_gemma":[0.000008627945,0.00009182791,0.00006974902,0.0004088616,0.000037690614,0.0007589424,0.00008020144,0.000075764954,0.000255739],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025798154,0.00016069763,0.00046731916,0.000026524855,0.000012084552,0.000014099475,0.0009088422,0.00004103993,0.000042550902,0.0006279017,0.0027261805,0.9949702],"study_design_scores_gemma":[0.0008863794,0.00018963729,0.9750379,0.00012076964,0.000022434284,0.00008502055,0.0005538999,0.0042237286,0.000017364122,0.0017848468,0.016677689,0.00040036585],"about_ca_topic_score_codex":0.0031583824,"about_ca_topic_score_gemma":0.0023827087,"teacher_disagreement_score":0.99456984,"about_ca_system_score_codex":0.000023564602,"about_ca_system_score_gemma":0.000021721375,"threshold_uncertainty_score":0.47745505},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55773735,0.000035641842,0.44052058,0.001125288,0.000024421035,0.00018200505,0.000011844019,0.00004226601,0.0003206088],"genre_scores_gemma":[0.9958949,0.00010841999,0.0036088275,0.000065416345,0.00003547375,0.00003605397,0.0000036810732,0.0000036777872,0.00024352706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995522,0.000015590731,0.00013998,0.00015040091,0.00005583944,0.00008600897],"domain_scores_gemma":[0.9996943,0.000038153434,0.00005248692,0.00015983892,0.000022403274,0.0000328249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009604542,0.000050549537,0.0000728289,0.00006961591,0.000034004068,0.000011875706,0.00018772323,0.000025427134,0.000015983996],"category_scores_gemma":[0.0000057097404,0.000036294205,0.000017255335,0.00023932222,0.000020287753,0.00022425357,0.000046333043,0.000030159308,0.00002038802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012153168,0.000027429602,0.00020449056,0.000007766475,0.0000017922383,1.7005041e-7,0.000109682165,1.8412833e-7,0.100385465,0.87661994,0.000001830942,0.022640048],"study_design_scores_gemma":[0.0012048725,0.00011501915,0.07025968,0.00010623896,0.000012046521,0.000022316046,0.000023810739,0.014465765,0.2571615,0.6409735,0.015155836,0.0004994147],"about_ca_topic_score_codex":0.0000016316914,"about_ca_topic_score_gemma":6.414163e-7,"teacher_disagreement_score":0.4381576,"about_ca_system_score_codex":0.000003548685,"about_ca_system_score_gemma":0.000010126473,"threshold_uncertainty_score":0.14800347},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059574533,0.00039925726,0.9371201,0.0024026432,0.000091352,0.00027106976,0.00010246778,0.000009568045,0.000029012233],"genre_scores_gemma":[0.96630716,0.0004093247,0.032917682,0.00017659403,0.0000733709,0.000018621906,0.000003220526,0.000014451251,0.00007957641],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977538,0.00023429803,0.00086072437,0.0003930846,0.00045453515,0.0003035736],"domain_scores_gemma":[0.9957866,0.0022325753,0.000894501,0.0005095869,0.00038360013,0.00019310864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012020307,0.00028213585,0.0010257347,0.00034239035,0.00013317753,0.00024838862,0.00079588656,0.000114965536,0.0000546223],"category_scores_gemma":[0.00040843865,0.0001526747,0.0006498298,0.00054516934,0.00015782609,0.0004241814,0.00029282796,0.00039960735,5.37178e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021774685,0.001600565,0.0024132354,0.0012722986,0.013836035,0.000058356884,0.006284088,0.016281439,0.0016167533,0.08840448,0.0022423654,0.8638129],"study_design_scores_gemma":[0.002133728,0.0012402412,0.0010389534,0.0004666406,0.0028481495,0.000065234126,0.0001582983,0.60022336,0.0022180146,0.3840765,0.004767329,0.00076352985],"about_ca_topic_score_codex":0.00003177032,"about_ca_topic_score_gemma":0.0000036418878,"teacher_disagreement_score":0.9067326,"about_ca_system_score_codex":0.000050263618,"about_ca_system_score_gemma":0.00012058712,"threshold_uncertainty_score":0.6225893},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31070843,0.000030464033,0.68773496,0.00059629895,0.0001479033,0.00018646402,0.000039381746,0.000102403224,0.00045372976],"genre_scores_gemma":[0.27056447,0.000007091479,0.7283792,0.0004971633,0.0001634098,0.00026952816,0.000040476763,0.00005262882,0.000026052146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725795,0.000084940635,0.00095166627,0.0005545877,0.00069860613,0.00045226124],"domain_scores_gemma":[0.9961763,0.0011072963,0.0006849382,0.0015809295,0.00013785846,0.00031264607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017008566,0.00030481332,0.00036705562,0.00014946371,0.00019414652,0.00011153308,0.0011759019,0.00020209925,0.000025782074],"category_scores_gemma":[0.0003286679,0.00033683065,0.0002297114,0.00077127584,0.00018396997,0.00027206063,0.00062999094,0.00029060588,0.0002753429],"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.000038254268,0.00020767907,4.4524262e-7,0.0002665285,0.00012669705,0.0000040248297,0.0023231916,0.0037810504,0.012064427,0.9783266,0.00041198367,0.0024490785],"study_design_scores_gemma":[0.00063486176,0.00014429052,0.0000022612114,0.00007232921,0.00016833481,0.000019655805,0.00045038617,0.9167214,0.051947743,0.028416112,0.0010611918,0.00036144245],"about_ca_topic_score_codex":0.00012547783,"about_ca_topic_score_gemma":0.000015781949,"teacher_disagreement_score":0.9499105,"about_ca_system_score_codex":0.000023555658,"about_ca_system_score_gemma":0.0003125123,"threshold_uncertainty_score":0.9999084},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009860415,0.00068119785,0.9825586,0.00383096,0.00017121623,0.000096594275,1.2726038e-7,0.000061696825,0.0027391987],"genre_scores_gemma":[0.99277145,0.00022380086,0.0016362505,0.0001897902,0.0003333955,0.000004295266,4.1859354e-7,0.000010291822,0.0048302845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981872,0.00019265583,0.00013528416,0.00017494855,0.00027923647,0.0010306828],"domain_scores_gemma":[0.9993873,0.00007511976,0.00014363871,0.00027428658,0.000068510984,0.00005113073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021767942,0.000116005765,0.000099086625,0.000052714753,0.00044937793,0.00021138763,0.00085630413,0.00003501019,0.000012267281],"category_scores_gemma":[0.00002187286,0.000049358892,0.000050929844,0.00024633305,0.000041423078,0.0004602276,0.00005930245,0.0010118845,0.00005801696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023302642,0.000025957565,0.00017525667,0.0000028663922,0.000036419726,0.0000016037401,0.00032612088,0.0009766613,0.000037190282,0.8538709,0.00020903628,0.14431465],"study_design_scores_gemma":[0.0013931721,0.0016454349,0.00063751865,0.000041730465,0.000059358346,0.0035711098,0.0009107359,0.28672296,0.00016032063,0.65168035,0.0526396,0.00053775543],"about_ca_topic_score_codex":0.00001588493,"about_ca_topic_score_gemma":0.00008055127,"teacher_disagreement_score":0.98291105,"about_ca_system_score_codex":0.00014164903,"about_ca_system_score_gemma":0.00052062055,"threshold_uncertainty_score":0.43961912},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016569069,0.000021334425,0.98158467,0.00047398487,0.00023910298,0.00014672024,0.0000052958103,0.000027313068,0.0009325065],"genre_scores_gemma":[0.1627636,0.0000013318007,0.83669543,0.00012732652,0.00028592214,0.0000016323248,0.0000039145166,0.000008365885,0.000112459194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865746,0.000026336696,0.0006525277,0.000089184694,0.00041554554,0.0001589375],"domain_scores_gemma":[0.99768656,0.0008767739,0.0005960666,0.00009677894,0.0006547556,0.00008905135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012664383,0.00010270883,0.00020357019,0.000119497345,0.000099695404,0.000071686336,0.00036041232,0.000046627327,0.00003174818],"category_scores_gemma":[0.00006473794,0.000083481194,0.00013354038,0.0001899301,0.0000323111,0.0003923562,0.000034099165,0.00011726702,0.00002951413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000287706,0.00031344086,0.000031159972,0.00015612533,0.00006293198,0.000020893103,0.00092029147,0.0071798037,0.00007343226,0.98203176,0.0014673653,0.0077140285],"study_design_scores_gemma":[0.00055056077,0.000113784285,0.00010814975,0.00007878775,0.000013711025,0.00029944896,0.00006331463,0.17923555,0.0005138731,0.81773967,0.0011890406,0.000094117015],"about_ca_topic_score_codex":1.4963166e-7,"about_ca_topic_score_gemma":1.4348495e-7,"teacher_disagreement_score":0.17205574,"about_ca_system_score_codex":0.000032944612,"about_ca_system_score_gemma":0.00008924848,"threshold_uncertainty_score":0.34042642},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06460162,0.00035607573,0.93388706,0.0006255334,0.000083654406,0.00036422804,0.000012276847,0.0000060638836,0.00006346706],"genre_scores_gemma":[0.99066657,0.000060248032,0.009006879,0.000013849682,0.00019235788,0.000037654263,0.0000015144259,0.0000026886871,0.0000182626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991493,0.000073014315,0.00036434658,0.0000768533,0.00025347376,0.00008296521],"domain_scores_gemma":[0.9983168,0.00054170506,0.00045713145,0.00021945401,0.00042238625,0.000042480606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001392788,0.000065773864,0.00013858508,0.00010083007,0.00018832133,0.000047410555,0.00043941982,0.000026505899,0.0000055086343],"category_scores_gemma":[0.000107424,0.000042752272,0.0000575183,0.0002453718,0.000055932527,0.00017216962,0.000034192562,0.00006203234,0.0000012681782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001816685,0.00019373727,0.000029912455,0.000020008238,0.000062749976,5.052378e-8,0.0015376627,0.0071295886,0.0072911233,0.8444543,0.000017092669,0.13924563],"study_design_scores_gemma":[0.0015902404,0.0002632201,0.0020833262,0.00003898514,0.00037341684,0.000018989755,0.00028571027,0.05497671,0.0054576644,0.9343827,0.00038331535,0.0001457644],"about_ca_topic_score_codex":0.000010089193,"about_ca_topic_score_gemma":0.0000033268946,"teacher_disagreement_score":0.9260649,"about_ca_system_score_codex":0.000034417568,"about_ca_system_score_gemma":0.00022759647,"threshold_uncertainty_score":0.1743387},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013105614,0.00020246512,0.9918869,0.00062821887,0.00008409535,0.0002686047,0.0000045755837,0.00026623797,0.00534834],"genre_scores_gemma":[0.5314118,0.000005407131,0.4663508,0.0006241065,0.0001610323,0.00011652653,0.00002158368,0.000013002471,0.001295717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902064,0.000079203935,0.00020731708,0.00031770614,0.0002101627,0.00016499822],"domain_scores_gemma":[0.99913186,0.00006791038,0.000090822025,0.00039820815,0.00010251507,0.0002086844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047607438,0.0001213892,0.00013202906,0.000075785116,0.00012118151,0.00021712107,0.00038137712,0.000052817624,0.000012550311],"category_scores_gemma":[0.000015273497,0.00010504905,0.000024562485,0.000323362,0.00006340904,0.00032575396,0.000056593155,0.00009953804,0.00006667545],"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.000013070309,0.00020968441,0.0004988054,0.000029585453,0.000021065263,0.000007473073,0.000482948,0.0021067942,0.00011992704,0.8156052,0.0047538816,0.17615154],"study_design_scores_gemma":[0.00081905094,0.00011781987,0.00021496124,0.000013518909,0.000010148348,0.000020152645,0.00030676206,0.9430895,0.0030078257,0.03386307,0.018253354,0.0002838666],"about_ca_topic_score_codex":0.000054287506,"about_ca_topic_score_gemma":0.000015432543,"teacher_disagreement_score":0.9409827,"about_ca_system_score_codex":0.00002306378,"about_ca_system_score_gemma":0.00014471848,"threshold_uncertainty_score":0.42837757},"labels":[],"label_agreement":null},{"id":"W2287475882","doi":"10.1007/s11075-015-0085-4","title":"Optimal Rates of Linear Convergence of Relaxed Alternating Projections and Generalized Douglas-Rachford Methods for Two Subspaces","year":2015,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Linear subspace; Rate of convergence; Mathematics; Projection (relational algebra); Eigenvalues and eigenvectors; Theory of computation; Convergence (economics); Applied mathematics; Nonlinear system; Projection method; Intersection (aeronautics); Matrix (chemical analysis); Dykstra's projection algorithm; Mathematical optimization; Algorithm; Pure mathematics; Computer science","score_opus":0.06371311389702866,"score_gpt":0.39677105204245355,"score_spread":0.3330579381454249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287475882","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029236106,0.0005197507,0.9688386,0.00019699548,0.00070406374,0.00032603004,0.0000136130075,0.0000699167,0.00009498001],"genre_scores_gemma":[0.031718526,0.000034525918,0.96776986,0.000030820294,0.00017631883,0.00005347558,0.000004097637,0.000013838029,0.00019850806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829596,0.00032532518,0.00048433506,0.00039028123,0.00022505205,0.00027906222],"domain_scores_gemma":[0.99824905,0.00059988926,0.00032341245,0.000319241,0.0003406905,0.000167718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015105383,0.00018090564,0.0004370513,0.00010623457,0.00010633321,0.000036737583,0.0005053462,0.00006428166,0.000008502606],"category_scores_gemma":[0.00043636007,0.00015151461,0.000110628396,0.0005170224,0.00015810714,0.00033681124,0.0002299334,0.00013242228,0.0000017580995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061070616,0.0011860315,0.00348259,0.0005020819,0.00058406586,0.000020420932,0.011509667,0.023101829,0.0267431,0.16612452,0.00070070353,0.76543427],"study_design_scores_gemma":[0.001174366,0.0004011901,0.000043167987,0.00001917378,0.000021300708,0.000023506745,0.00014420185,0.9285871,0.063849255,0.003975532,0.0015750187,0.0001861948],"about_ca_topic_score_codex":0.00021499443,"about_ca_topic_score_gemma":8.366147e-7,"teacher_disagreement_score":0.9054853,"about_ca_system_score_codex":0.000018242356,"about_ca_system_score_gemma":0.00010347323,"threshold_uncertainty_score":0.61785865},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40288043,0.00019010218,0.5923703,0.0032260127,0.00019721758,0.000047947873,0.0000017272476,0.00007028914,0.0010159928],"genre_scores_gemma":[0.9768206,0.00027410488,0.021667566,0.00021952575,0.00024111205,0.0000015102257,1.966847e-7,0.000009785627,0.0007656261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989148,0.00016322704,0.0002951161,0.00021388188,0.00015700559,0.00025600128],"domain_scores_gemma":[0.9991586,0.00012157788,0.00016841771,0.00030182797,0.000064379674,0.0001851969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055527827,0.00015915387,0.00021736091,0.0001633677,0.00018255034,0.00024339784,0.00043455692,0.000059956423,0.00008678649],"category_scores_gemma":[0.000035307294,0.000080106525,0.00011912692,0.00017733984,0.000036064754,0.0006665856,0.00015450071,0.00016598984,0.00006366015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003630117,0.00018162346,0.0028221854,0.000041052725,0.00027276995,0.00073881063,0.0026857085,0.000030438025,0.124182716,0.72208893,0.003535207,0.14338428],"study_design_scores_gemma":[0.0019554559,0.0005408935,0.019922197,0.0004229211,0.000058328358,0.00807934,0.00019780875,0.030574331,0.06438077,0.8648303,0.00805321,0.0009844535],"about_ca_topic_score_codex":0.000002922911,"about_ca_topic_score_gemma":0.0000026435425,"teacher_disagreement_score":0.57394016,"about_ca_system_score_codex":0.000042397307,"about_ca_system_score_gemma":0.000040089293,"threshold_uncertainty_score":0.32666492},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016842203,0.00041961588,0.9230732,0.009754958,0.0006117051,0.00045357848,0.000022894767,0.00043550634,0.048386365],"genre_scores_gemma":[0.7961023,0.00013722855,0.19801551,0.00039752925,0.00006596559,0.000087760825,0.00013781046,0.0000570908,0.004998843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99076855,0.005977668,0.00066674897,0.0012773288,0.0007480868,0.00056160416],"domain_scores_gemma":[0.99336696,0.0016989588,0.0004105748,0.0031924744,0.0009675329,0.0003635111],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.006829949,0.00043336095,0.00053316815,0.00033481835,0.00020962428,0.00038946138,0.0036259196,0.00036513386,0.00010835193],"category_scores_gemma":[0.002117925,0.00044138075,0.00023169022,0.00085972087,0.00017288644,0.00025821573,0.00278877,0.0012918169,0.0002487644],"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.000033404445,0.0013196877,0.0004069073,0.00008722886,0.00003928097,0.000060310183,0.008736454,0.0020365468,0.000086718996,0.9304389,0.0033871739,0.053367425],"study_design_scores_gemma":[0.0012842888,0.000003892677,0.0009535912,0.0015843031,0.000022025019,0.00002573212,0.00008438447,0.7427636,0.0072411923,0.23074168,0.014056336,0.0012390234],"about_ca_topic_score_codex":0.00047331856,"about_ca_topic_score_gemma":0.000064660715,"teacher_disagreement_score":0.77926004,"about_ca_system_score_codex":0.00023032716,"about_ca_system_score_gemma":0.0005623199,"threshold_uncertainty_score":0.9998038},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004344875,0.0008640421,0.9304021,0.046720654,0.00020865182,0.00082089636,0.0000062508757,0.000100034216,0.016532505],"genre_scores_gemma":[0.9184815,0.00040948295,0.07981796,0.00035170699,0.00006377369,0.00015868097,0.0000012329508,0.000013107132,0.00070254086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880385,0.00029184262,0.00027786975,0.00019720386,0.00018572398,0.00024350268],"domain_scores_gemma":[0.99293715,0.0014573338,0.00012943216,0.005330523,0.00006833068,0.0000772237],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015494112,0.00012981052,0.00016246956,0.000022059136,0.00171598,0.0006103754,0.0068773916,0.000031638312,0.0000049365763],"category_scores_gemma":[0.0004855781,0.0000760676,0.000045180273,0.00019344217,0.0005512499,0.00033629587,0.002745739,0.0003507418,0.00013540956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017748254,0.000059536902,0.000043013602,0.000011593667,0.0000069338903,3.3542142e-7,0.0017136484,0.000010530431,0.00001343427,0.94496036,0.00017817844,0.053000685],"study_design_scores_gemma":[0.000104911014,0.000019318612,0.00040627073,0.000054010823,0.0000051873603,0.000002865312,0.000224826,0.124974675,0.000038612263,0.8621487,0.011902215,0.00011837669],"about_ca_topic_score_codex":0.000009285907,"about_ca_topic_score_gemma":0.000016482292,"teacher_disagreement_score":0.91413665,"about_ca_system_score_codex":0.000029912238,"about_ca_system_score_gemma":0.000033213877,"threshold_uncertainty_score":0.99958366},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09686806,0.00015339974,0.831046,0.0011154579,0.0001657198,0.00041975972,0.00002421756,0.00006992493,0.07013748],"genre_scores_gemma":[0.7985622,5.19028e-7,0.20059349,0.0003259274,0.000031607993,0.0000063670022,9.761865e-7,0.000014567297,0.00046433075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986709,0.0001694758,0.0003723221,0.00023345885,0.0001634414,0.00039044747],"domain_scores_gemma":[0.99879974,0.00031249723,0.00011287619,0.0003674008,0.00006326821,0.0003442232],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007760749,0.00013728412,0.0002727375,0.00014611767,0.00012757118,0.00007607815,0.00042131456,0.000072345734,0.0017757488],"category_scores_gemma":[0.00057573273,0.00012778516,0.00008005661,0.00023504098,0.00008837399,0.000062803636,0.000040203697,0.00009069894,0.0004209567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010332164,0.000020714497,0.000015556183,0.00006738221,0.000013751456,0.000024587991,0.00047695113,0.000038525846,0.00050088676,0.99745864,0.00046643353,0.00091551756],"study_design_scores_gemma":[0.0011778034,0.00022667594,0.00009718217,0.00083824963,0.00007245005,0.0005475132,0.0009957617,0.08020858,0.07743762,0.8161833,0.020692602,0.0015222583],"about_ca_topic_score_codex":0.00048717074,"about_ca_topic_score_gemma":0.00004280477,"teacher_disagreement_score":0.7016942,"about_ca_system_score_codex":0.0000742914,"about_ca_system_score_gemma":0.0002202303,"threshold_uncertainty_score":0.99913675},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055200565,0.00014898271,0.9890956,0.0008562111,0.00046628923,0.00021256326,0.0000018477269,0.00005369331,0.0036447172],"genre_scores_gemma":[0.9342064,0.0000194986,0.060208306,0.00017040454,0.000040815037,0.000025243435,0.0000013476186,0.0000037647155,0.0053241937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993393,0.000020144096,0.00016086751,0.00016172309,0.00011547633,0.00020249597],"domain_scores_gemma":[0.9986626,0.00093665073,0.000029692701,0.00028519146,0.00004883758,0.000037009162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097246876,0.00005706553,0.000058193276,0.00019668975,0.00022026832,0.00004634497,0.00049197767,0.0000275624,0.00003496272],"category_scores_gemma":[0.00026257124,0.000036858066,0.000033240372,0.0016958421,0.00003497822,0.00026424092,0.00008816827,0.00007472059,0.000039372077],"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.000008161762,0.00008444794,0.00088765845,0.0000034928391,0.0000035963876,0.0000022774939,0.0005615891,0.0008114773,0.000043049837,0.866346,0.0009283365,0.13031992],"study_design_scores_gemma":[0.0022012598,0.0005277467,0.08990387,0.00009046532,0.000024296958,0.00007243512,0.0023163303,0.43198997,0.0076237433,0.14381003,0.32033288,0.0011069631],"about_ca_topic_score_codex":0.000008988287,"about_ca_topic_score_gemma":0.000025779951,"teacher_disagreement_score":0.9288873,"about_ca_system_score_codex":0.000015687476,"about_ca_system_score_gemma":0.000026362926,"threshold_uncertainty_score":0.16941482},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18345623,0.0077571124,0.2114194,0.0047247056,0.021312492,0.0010317201,0.000049846472,0.0019214833,0.568327],"genre_scores_gemma":[0.8863471,0.00027165815,0.08135498,0.0008063762,0.026882749,0.000031296608,0.00002104673,0.00004527002,0.004239514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855024,0.00009678546,0.00023909456,0.0003344655,0.00046814114,0.00031125854],"domain_scores_gemma":[0.9991129,0.000094217125,0.0001292753,0.00033689567,0.00008854904,0.00023818774],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004768596,0.000158117,0.00018883495,0.00017880919,0.00013147519,0.00035094318,0.0011142917,0.000058516507,0.00023547246],"category_scores_gemma":[0.00003677043,0.00013953322,0.00010051763,0.0006388562,0.000045123572,0.00085539307,0.0002933813,0.00012407155,0.0014649425],"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.000034067252,0.00015954174,0.0018648626,0.000029578017,0.0000302793,0.000076001365,0.0012598754,0.00009661093,0.00004468983,0.8638264,0.06448864,0.06808943],"study_design_scores_gemma":[0.0014894508,0.00028620788,0.004225204,0.00003357735,0.00003486631,0.00014833713,0.0004799369,0.0077103064,0.0009803633,0.21989276,0.7638456,0.00087334466],"about_ca_topic_score_codex":0.000044817512,"about_ca_topic_score_gemma":0.000007827281,"teacher_disagreement_score":0.7028909,"about_ca_system_score_codex":0.000052701984,"about_ca_system_score_gemma":0.000096446274,"threshold_uncertainty_score":0.9993125},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054810286,0.00019752246,0.75090265,0.099005505,0.0029734105,0.00119567,0.00005029496,0.00076573296,0.09009894],"genre_scores_gemma":[0.9842912,0.00001587211,0.010408279,0.0019617341,0.00021861773,0.00011585344,0.000048216927,0.00000939697,0.0029308388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999207,0.00009019165,0.00016920594,0.00023219516,0.0001237618,0.00017761292],"domain_scores_gemma":[0.9990215,0.0000869283,0.00006764045,0.0006437476,0.000097327866,0.000082858845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006137531,0.00008379116,0.000071488284,0.00009932239,0.00037401007,0.0002773814,0.00062583527,0.000034526143,0.000098339355],"category_scores_gemma":[0.000054849228,0.00005812621,0.000039159288,0.00034477882,0.00010855384,0.0006161381,0.00020448669,0.00020469898,0.000054209457],"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.0000038692565,0.00006124,0.0014652389,0.000002354926,0.000018672836,2.0762043e-7,0.00014620942,3.8529004e-7,0.00006516202,0.9682761,0.0061693215,0.02379128],"study_design_scores_gemma":[0.0017399369,0.000032113017,0.035342995,0.0000047740796,0.000022422999,0.00004616876,0.00005234002,0.025775447,0.00004162053,0.0777859,0.8589494,0.00020686371],"about_ca_topic_score_codex":0.000018079892,"about_ca_topic_score_gemma":0.000032528114,"teacher_disagreement_score":0.9294809,"about_ca_system_score_codex":0.0000065900886,"about_ca_system_score_gemma":0.000028940296,"threshold_uncertainty_score":0.2876621},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093113317,0.000043919557,0.9930192,0.0034511043,0.00102046,0.0005936968,0.00008814312,0.00017116504,0.00068117084],"genre_scores_gemma":[0.63223916,0.0000074967197,0.36555418,0.0008298785,0.00019581607,0.000069822825,0.00013063176,0.000021059192,0.0009519309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978019,0.00007708306,0.0004842884,0.0005793655,0.0005336473,0.0005236888],"domain_scores_gemma":[0.9950255,0.0035585242,0.00014736796,0.0005372323,0.0005611224,0.00017022561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000797547,0.00029678724,0.00022678252,0.0001613796,0.0006275735,0.00031739578,0.001243235,0.000109582514,0.000040730032],"category_scores_gemma":[0.00024711707,0.00023832818,0.00017062097,0.000406628,0.00014114138,0.0003209803,0.0002057979,0.0002640047,0.00012758124],"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.00003427094,0.00012384435,0.000037802354,0.000007889335,0.00003527332,0.0000049934733,0.0002425971,0.28583765,0.000014026247,0.6902483,0.0002755232,0.0231378],"study_design_scores_gemma":[0.0009222498,0.00011954082,0.0026614312,0.000022024595,0.000014505397,0.000014792717,0.000036230253,0.9454935,0.0000143338675,0.049694292,0.00070932007,0.00029774243],"about_ca_topic_score_codex":0.000018778108,"about_ca_topic_score_gemma":0.00006741458,"teacher_disagreement_score":0.65965587,"about_ca_system_score_codex":0.00011461043,"about_ca_system_score_gemma":0.00030187285,"threshold_uncertainty_score":0.9718741},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008925843,0.0006180067,0.9802708,0.0061012544,0.00004896038,0.0003166389,0.000026457528,0.0002190535,0.0034729864],"genre_scores_gemma":[0.9421048,0.0006801384,0.050693363,0.001283046,0.00052844884,0.0002656776,0.00000777936,0.000022130796,0.004414623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992162,0.000030743304,0.00015191596,0.00031582196,0.00011036959,0.00017497588],"domain_scores_gemma":[0.99924296,0.00021568498,0.000054405893,0.00029790003,0.00006947918,0.00011954603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012662123,0.00010046272,0.00009770566,0.000056658424,0.00017523555,0.000058850448,0.00042241995,0.000048593512,0.000052295214],"category_scores_gemma":[0.000020626305,0.000065634464,0.00003529959,0.0002608902,0.00004189253,0.00033564665,0.00015938305,0.00005241604,0.00041689607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015232288,0.000028015864,0.000014693345,0.0000044158496,0.000007976954,8.4934675e-7,0.00005119572,1.7036272e-7,0.0025057679,0.9077641,0.00012287027,0.08949842],"study_design_scores_gemma":[0.0014226115,0.00026372357,0.0038369896,0.00009300013,0.00005046609,0.00012393044,0.000040223353,0.011646019,0.057147335,0.6668327,0.25747567,0.0010673633],"about_ca_topic_score_codex":0.000001180869,"about_ca_topic_score_gemma":3.8926322e-7,"teacher_disagreement_score":0.93317896,"about_ca_system_score_codex":0.000007476262,"about_ca_system_score_gemma":0.00002280458,"threshold_uncertainty_score":0.53584945},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002171235,0.00005917766,0.9782253,0.0027884692,0.00022944497,0.0003742758,0.000028816134,0.00019099655,0.015932277],"genre_scores_gemma":[0.6962613,0.000026132459,0.28929585,0.00018306874,0.00027906217,0.00010751081,0.000001949254,0.000033090466,0.01381205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899036,0.000043979846,0.00018664575,0.00029756821,0.00017322369,0.00030821215],"domain_scores_gemma":[0.9986712,0.00065084855,0.00008407859,0.0004293558,0.00008071436,0.00008384212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003818198,0.00014503612,0.00020919563,0.000063262894,0.00017530813,0.000072496056,0.000622422,0.000043715234,0.00005224945],"category_scores_gemma":[0.000100328936,0.00009232349,0.000108294815,0.0001689774,0.00009435061,0.0003539288,0.00021937262,0.000039778406,0.0002192482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007983003,0.000057974772,0.0000041812123,0.00002750642,0.00003963236,0.0000064824376,0.0007247774,1.4374972e-7,0.00047292095,0.99290085,0.001795426,0.003962131],"study_design_scores_gemma":[0.0012975319,0.0002634727,0.00007926644,0.00014821024,0.000037655558,0.00003426258,0.00023046795,0.001500173,0.0041423086,0.9812472,0.010633582,0.00038588227],"about_ca_topic_score_codex":0.0000010179646,"about_ca_topic_score_gemma":6.699714e-7,"teacher_disagreement_score":0.69409007,"about_ca_system_score_codex":0.000049267604,"about_ca_system_score_gemma":0.000061603045,"threshold_uncertainty_score":0.37648427},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101458535,0.00004158677,0.8948369,0.0010900652,0.0005238769,0.0003801594,0.00009333704,0.000314668,0.0012608853],"genre_scores_gemma":[0.61620855,0.0000012155334,0.38279045,0.00045617245,0.00015273895,0.000012953063,0.0002825443,0.000023158105,0.00007219046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965459,0.00016825082,0.0006770342,0.0010386286,0.0009635391,0.0006066399],"domain_scores_gemma":[0.9978241,0.00044225735,0.00025193774,0.0006274234,0.00056730193,0.00028699508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039451438,0.00050700974,0.00043626694,0.0003930704,0.00059745903,0.00041049393,0.0012835007,0.00017835438,0.00006674053],"category_scores_gemma":[0.000050818777,0.00050876156,0.00018278275,0.00080374035,0.00022065802,0.0006908436,0.00037095952,0.00047708437,0.00011847694],"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.000015154436,0.00012410249,0.00006790803,0.000009562699,0.000030054623,0.000005470511,0.00007743471,0.53843135,0.000039524184,0.44355035,0.00005907471,0.017590035],"study_design_scores_gemma":[0.0007844905,0.000085661704,0.005369051,0.000045229393,0.00001738275,0.00014201574,0.0000114548575,0.90109056,0.0000095533205,0.09188592,0.00004880842,0.00050984306],"about_ca_topic_score_codex":0.000048052883,"about_ca_topic_score_gemma":0.00005941167,"teacher_disagreement_score":0.51475006,"about_ca_system_score_codex":0.00035551598,"about_ca_system_score_gemma":0.0006295286,"threshold_uncertainty_score":0.9997364},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3569948,0.002254122,0.6319978,0.0021821805,0.00006778299,0.00093363295,0.000084962674,0.00015259771,0.0053320965],"genre_scores_gemma":[0.97346747,0.00018573369,0.025834812,0.000036861704,0.0000577817,0.000056011737,0.0000029471257,0.0000068928225,0.00035147936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999243,0.000021399288,0.00015734408,0.0003075222,0.00013421709,0.00013651406],"domain_scores_gemma":[0.99894875,0.000108001805,0.00018168041,0.00058651285,0.00008199473,0.00009303848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017373101,0.00010868293,0.00015897104,0.00008592331,0.0004850135,0.0001495548,0.0005845642,0.0000384076,0.0000040162363],"category_scores_gemma":[0.000036376998,0.00008407523,0.000025318193,0.00023325096,0.00016219288,0.00031734264,0.00021883243,0.00007646913,0.000007801432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008274213,0.000047161127,0.0008590415,0.000065596825,0.000018188766,0.000001481875,0.00015547161,0.0000018356775,0.00032226802,0.97418594,0.0000111075105,0.024323605],"study_design_scores_gemma":[0.003864475,0.0012795498,0.24757567,0.00032070765,0.00033212823,0.0002765232,0.00030916088,0.17009355,0.042951025,0.49812636,0.03271593,0.0021549247],"about_ca_topic_score_codex":0.000022210452,"about_ca_topic_score_gemma":0.0000032759108,"teacher_disagreement_score":0.61647266,"about_ca_system_score_codex":0.000002808649,"about_ca_system_score_gemma":0.000022712375,"threshold_uncertainty_score":0.37303805},"labels":[],"label_agreement":null},{"id":"W2338260032","doi":"10.1002/nla.2050","title":"Towards an optimal condition number of certain augmented Lagrangian‐type saddle‐point matrices","year":2016,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Invertible matrix; Saddle point; Eigenvalues and eigenvectors; Augmented Lagrangian method; Rank (graph theory); Block (permutation group theory); Matrix (chemical analysis); Saddle; Applied mathematics; Type (biology); Singular value decomposition; Combinatorics; Block matrix; Lagrangian; Singular value; Pure mathematics; Mathematical optimization; Algorithm; Geometry","score_opus":0.009549939276433841,"score_gpt":0.2723625157209429,"score_spread":0.26281257644450906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338260032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014967477,0.00003197958,0.9820624,0.0010512174,0.000048267502,0.00034873324,0.000044709042,0.00021940231,0.0012258122],"genre_scores_gemma":[0.7118313,0.000018503728,0.28732964,0.00015760459,0.00015601373,0.00017276793,0.000044655917,0.000021526255,0.0002680106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99859244,0.00009122934,0.00031576722,0.0004318551,0.00030155946,0.00026714508],"domain_scores_gemma":[0.9985677,0.00016457433,0.00018619782,0.0006589258,0.00022228318,0.00020032442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020182089,0.0001740152,0.00022415943,0.00006873751,0.00012536669,0.000041139585,0.00066072866,0.00007494752,0.00052044465],"category_scores_gemma":[0.000027293638,0.000112272195,0.000063405365,0.0007843094,0.00013039191,0.00047221934,0.00009674564,0.000097928074,0.00039006342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019081206,0.000931918,0.00069610396,0.0000543867,0.00010796475,0.000007827032,0.00031724045,0.00021864811,0.0034913386,0.79436976,0.00040507436,0.19920895],"study_design_scores_gemma":[0.01280144,0.0059306826,0.01613641,0.0005732731,0.0006043768,0.0008399537,0.00078183226,0.26286483,0.1805145,0.21706466,0.29617614,0.00571191],"about_ca_topic_score_codex":0.000021482692,"about_ca_topic_score_gemma":7.44764e-7,"teacher_disagreement_score":0.6968638,"about_ca_system_score_codex":0.000032173495,"about_ca_system_score_gemma":0.00008966559,"threshold_uncertainty_score":0.56985044},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5260288,0.000072761315,0.46916464,0.0013675157,0.00017817202,0.00040728535,0.0000034606824,0.00015115169,0.0026261832],"genre_scores_gemma":[0.97693044,0.0000037634675,0.022228776,0.00017328348,0.000041341078,0.000031470994,0.0000043083974,0.000008861597,0.0005777684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890065,0.00009396488,0.0002839226,0.00026356595,0.00020898372,0.00024892768],"domain_scores_gemma":[0.9991189,0.000040863306,0.00015060903,0.00048169974,0.0000993696,0.00010851489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027094578,0.00012919572,0.00016176132,0.000111993504,0.0000578285,0.00008500362,0.00052503846,0.00004261773,0.00010485508],"category_scores_gemma":[0.000011615745,0.00011276067,0.00005545769,0.00034943467,0.000079243364,0.0007335198,0.000103935774,0.00010008816,0.00028400583],"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.000016776523,0.00029433836,0.0183568,0.00080653967,0.0002334636,0.000026575877,0.023484973,0.003203965,0.11563909,0.4212619,0.008794771,0.4078808],"study_design_scores_gemma":[0.00085146516,0.0004104192,0.018188238,0.0001296881,0.000015755819,0.000017523795,0.00021287292,0.4754275,0.042416487,0.45942637,0.0022230062,0.0006806518],"about_ca_topic_score_codex":0.00011329069,"about_ca_topic_score_gemma":0.0000049188384,"teacher_disagreement_score":0.47222355,"about_ca_system_score_codex":0.00001915149,"about_ca_system_score_gemma":0.000040679122,"threshold_uncertainty_score":0.45982465},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9371805,0.0031610334,0.054931466,0.0032331564,0.00042604117,0.00019885802,0.000055433415,0.000037099257,0.00077639485],"genre_scores_gemma":[0.8936569,0.00064576406,0.09422062,0.00009846645,0.00019810401,3.9073134e-7,0.0000015966701,0.000007503356,0.011170616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999231,0.00008205714,0.00022937353,0.000090212954,0.00026237193,0.00010502797],"domain_scores_gemma":[0.9989841,0.00012547208,0.00033539892,0.000081814695,0.00041897694,0.000054210956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003524543,0.00008214129,0.00019040518,0.00029077666,0.00012569725,0.000046791985,0.00033723246,0.000032433974,0.000039504655],"category_scores_gemma":[0.000057144414,0.00007152791,0.00012215157,0.00016773799,0.000098525474,0.0009817552,0.00008505579,0.000064307824,0.0000011615543],"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.00013778024,0.000109158784,0.00020210812,0.00019481525,0.00015928668,0.000022230151,0.0037620289,0.0008933383,0.0011203315,0.98780364,0.004395227,0.0012000828],"study_design_scores_gemma":[0.025031911,0.0023043887,0.0014815916,0.0009244727,0.00060151,0.0016188188,0.022629177,0.41546792,0.026369918,0.16024323,0.34141648,0.0019105846],"about_ca_topic_score_codex":0.000022361417,"about_ca_topic_score_gemma":0.0000055121086,"teacher_disagreement_score":0.82756037,"about_ca_system_score_codex":0.000050880073,"about_ca_system_score_gemma":0.00005830789,"threshold_uncertainty_score":0.29168236},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29438934,0.000100437945,0.70014006,0.00050545495,0.00074702594,0.00007861501,0.0000034931481,0.000015341286,0.0040202034],"genre_scores_gemma":[0.9926526,0.000016082404,0.006551387,0.000024365845,0.000049163154,1.8410054e-8,1.412509e-7,0.0000023259227,0.0007039336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99897844,0.00024860303,0.00021830628,0.000086851884,0.0003247986,0.00014299969],"domain_scores_gemma":[0.9989359,0.00007549807,0.00047635575,0.00021428344,0.0002312583,0.000066696906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007128064,0.00007745094,0.00013843788,0.00012493141,0.00020630808,0.000024069452,0.0007092874,0.00004972221,0.00003455522],"category_scores_gemma":[0.00006747203,0.000059995484,0.0001657946,0.00039920115,0.00006871107,0.00092105067,0.00010699693,0.00019223851,0.0000051761053],"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.0001755665,0.00031558305,0.005923772,0.000058628502,0.00011055499,0.000081925835,0.0018620549,0.006259455,0.0057370486,0.96701026,0.0012899843,0.01117514],"study_design_scores_gemma":[0.02004427,0.005250648,0.17266344,0.0011289996,0.0010159137,0.0033300098,0.010187506,0.16948889,0.23837571,0.1628159,0.21260904,0.0030896717],"about_ca_topic_score_codex":0.000011824204,"about_ca_topic_score_gemma":0.0000030030435,"teacher_disagreement_score":0.8041944,"about_ca_system_score_codex":0.000075698474,"about_ca_system_score_gemma":0.00015061285,"threshold_uncertainty_score":0.24465448},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004297345,0.0001053693,0.98704946,0.000019259389,0.000053319003,0.00030683202,0.000002606809,0.000030807798,0.0081350105],"genre_scores_gemma":[0.9403211,0.000014668068,0.058778387,0.0000093766375,0.000007919116,0.000029695928,0.000001586981,0.000004280853,0.0008329807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992162,0.00005594182,0.00029413123,0.00017571545,0.0001347615,0.00012324729],"domain_scores_gemma":[0.9993797,0.000045292323,0.00012091811,0.0003548383,0.0000694133,0.000029862415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041716703,0.00006734566,0.00013073035,0.00014794743,0.000022935956,0.000013702098,0.0003339684,0.000046495254,0.00003544237],"category_scores_gemma":[0.00002374941,0.00005987736,0.00003296417,0.0008757324,0.000024224668,0.00021314144,0.0000428053,0.000054785414,0.000008609325],"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":[6.54341e-7,0.00010776235,0.00078748923,0.00007744169,0.0000038109338,1.1054405e-7,0.00013678905,0.0002757311,0.010587331,0.982491,0.0000073604238,0.0055244896],"study_design_scores_gemma":[0.0010674222,0.00016686822,0.0016309607,0.0000655107,0.000010830964,0.000008020471,0.00019048752,0.026586324,0.5335339,0.4283698,0.007970343,0.00039958738],"about_ca_topic_score_codex":0.000040670115,"about_ca_topic_score_gemma":0.0000028955146,"teacher_disagreement_score":0.9360238,"about_ca_system_score_codex":0.0000146278435,"about_ca_system_score_gemma":0.000052568554,"threshold_uncertainty_score":0.24417278},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033550493,0.00008185151,0.98946345,0.0007157993,0.00027222218,0.00039141055,0.0000041146786,0.0002593807,0.005456737],"genre_scores_gemma":[0.060340405,0.000031321975,0.93590397,0.00073026394,0.00012895909,0.000038744118,0.0000029222963,0.000010370292,0.0028130354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990656,0.000022830855,0.0001672857,0.00029088408,0.00015622443,0.0002972157],"domain_scores_gemma":[0.99935555,0.000118286705,0.000059830963,0.00030608385,0.000060567563,0.00009968814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028492027,0.00010850962,0.000111388734,0.00018085905,0.00012720207,0.0002054191,0.0005871011,0.000043758802,0.000025880892],"category_scores_gemma":[0.000043716907,0.000086937514,0.0000846354,0.000766042,0.000019469291,0.0007245417,0.00012343802,0.000053378677,0.00013604686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038622106,0.00005437257,0.000033081407,0.000021083852,0.000008675199,0.000003850384,0.00010528797,0.00060251256,0.00007309888,0.9827362,0.0007267737,0.01563126],"study_design_scores_gemma":[0.00272214,0.00036512513,0.00023934306,0.00003137913,0.000024415855,0.00004196412,0.00007416455,0.06031883,0.016782712,0.83343804,0.085311025,0.0006508593],"about_ca_topic_score_codex":0.00004676278,"about_ca_topic_score_gemma":0.000005103177,"teacher_disagreement_score":0.1492981,"about_ca_system_score_codex":0.000041935447,"about_ca_system_score_gemma":0.00006405396,"threshold_uncertainty_score":0.3545209},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1717931,0.0030620599,0.80153817,0.002144561,0.004499137,0.0017744814,0.000056821576,0.0002025759,0.014929081],"genre_scores_gemma":[0.9934219,0.00004245852,0.0045754286,0.000045450248,0.000085077525,0.000014282813,0.0000029586886,0.000016267277,0.0017961778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974227,0.00051791104,0.0006359014,0.000375659,0.0005756972,0.00047215578],"domain_scores_gemma":[0.9974243,0.0004999617,0.00054669456,0.0012509092,0.000195519,0.00008262736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015428215,0.0002254583,0.00029212338,0.00017908552,0.0005051308,0.00010870291,0.0015152416,0.00011367103,0.000019998359],"category_scores_gemma":[0.00057706813,0.00014509543,0.00023738353,0.0016831971,0.00021446752,0.00033898797,0.00021876066,0.00021323234,0.000020136511],"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.000038697624,0.00019863345,0.0006883339,0.00008064533,0.000041742987,0.0000036789554,0.0009671014,0.0003531403,0.0069252583,0.967755,0.0009047635,0.022043005],"study_design_scores_gemma":[0.0074965176,0.0011736142,0.018907579,0.00044078907,0.00028265145,0.00017820836,0.0010413496,0.22856754,0.4371361,0.1712512,0.13147432,0.0020501271],"about_ca_topic_score_codex":0.0000631656,"about_ca_topic_score_gemma":0.000026282762,"teacher_disagreement_score":0.8216288,"about_ca_system_score_codex":0.00007581025,"about_ca_system_score_gemma":0.00016913147,"threshold_uncertainty_score":0.591682},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2968564,0.00052888395,0.69483703,0.0007744201,0.0008332843,0.00087366434,0.00010197988,0.00024866965,0.0049456414],"genre_scores_gemma":[0.9849648,0.000065488886,0.012773022,0.00015526888,0.00023510033,0.000068774796,0.00003154921,0.000033016546,0.0016729695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977778,0.00018381025,0.00050825655,0.0006346419,0.0003322624,0.00056320755],"domain_scores_gemma":[0.99815077,0.00040529037,0.00031415047,0.0007721018,0.0002054597,0.00015220238],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079581037,0.00031010123,0.00044296618,0.00029123473,0.00025553003,0.00017501446,0.0011918504,0.00014559257,0.000029416524],"category_scores_gemma":[0.00008409549,0.00028626493,0.00021372152,0.0007898532,0.0001099737,0.000651352,0.00020849989,0.00015055558,0.00004002129],"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.0008011493,0.0011135342,0.005919963,0.0008323714,0.00021096153,0.00035922963,0.007917176,0.00070105254,0.01060964,0.8003366,0.0016350069,0.16956332],"study_design_scores_gemma":[0.017884135,0.005554666,0.039841104,0.002137828,0.00046589406,0.0012643731,0.0015508343,0.21793698,0.26522985,0.19529128,0.24635088,0.006492167],"about_ca_topic_score_codex":0.00013071953,"about_ca_topic_score_gemma":0.00002794636,"teacher_disagreement_score":0.6881084,"about_ca_system_score_codex":0.00005340242,"about_ca_system_score_gemma":0.00008313456,"threshold_uncertainty_score":0.99995893},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18226883,0.0011822273,0.8108676,0.0015976587,0.00047478869,0.00039578576,0.000019144072,0.00053547934,0.0026584747],"genre_scores_gemma":[0.76047766,0.00012525795,0.23587653,0.00035435148,0.00043766206,0.000021487123,0.0000027334033,0.000008117304,0.002696212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992566,0.00004819895,0.0002388951,0.00016491459,0.00012783345,0.00016354915],"domain_scores_gemma":[0.99942917,0.00015736782,0.00009146931,0.00022930032,0.000055090648,0.000037629303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046721625,0.00008440394,0.00013999388,0.00007089509,0.000054635206,0.000053927844,0.00043209948,0.000031889806,0.00002711621],"category_scores_gemma":[0.0000127474095,0.00006602472,0.00006335113,0.00008276286,0.000021646063,0.0006305791,0.000085186184,0.00002674169,0.000037010504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062387967,0.000044446486,0.000029372633,0.00006238677,0.000013393113,2.8593394e-7,0.0010075228,0.000063137864,0.00038580867,0.98602283,0.00027092063,0.01209365],"study_design_scores_gemma":[0.001229511,0.00045504837,0.0001337645,0.000043657164,0.000023024772,0.000010261693,0.00030988627,0.2628658,0.30586872,0.37755942,0.05097212,0.0005287434],"about_ca_topic_score_codex":0.000016502203,"about_ca_topic_score_gemma":0.0000018521035,"teacher_disagreement_score":0.6084634,"about_ca_system_score_codex":0.000010025078,"about_ca_system_score_gemma":0.000022671005,"threshold_uncertainty_score":0.26924098},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007785555,0.0005493399,0.9907254,0.0063188234,0.000041446066,0.00064697966,0.000021216392,0.00010134331,0.0008168833],"genre_scores_gemma":[0.6850667,0.0031361897,0.27376306,0.0017816265,0.0011994559,0.00798092,0.000016123073,0.00007802507,0.026977913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933124,0.000020008627,0.00014427662,0.00024517844,0.00007412912,0.00018515409],"domain_scores_gemma":[0.9990872,0.00035579116,0.000054126493,0.0003532186,0.00007742029,0.000072248506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022202374,0.000082828374,0.000071331815,0.000026868864,0.000501338,0.00007687411,0.00045825003,0.000035083976,0.000006568091],"category_scores_gemma":[0.000018834335,0.00004359705,0.000048490187,0.00019932883,0.000048040354,0.00015089738,0.000088278015,0.00003571529,0.000059764294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019689712,0.000015252118,0.0000054066027,0.0000065832332,0.000008467818,4.769254e-8,0.00003949908,3.8954727e-7,0.00065826316,0.84004086,0.00050248334,0.15872076],"study_design_scores_gemma":[0.00025486902,0.00004157665,0.000044466684,0.000008925998,0.000008518411,0.000004777965,0.000007608046,0.0025211393,0.0040371525,0.5495651,0.4433832,0.00012272311],"about_ca_topic_score_codex":9.1816077e-7,"about_ca_topic_score_gemma":0.0000019533356,"teacher_disagreement_score":0.71696234,"about_ca_system_score_codex":0.0000049107684,"about_ca_system_score_gemma":0.000022739301,"threshold_uncertainty_score":0.38559374},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96356034,0.000017515431,0.0030367991,0.0034590152,0.0050118696,0.00028498578,0.0000014863156,0.00025513239,0.024372865],"genre_scores_gemma":[0.99474186,0.0000032321705,0.0036628405,0.00076381146,0.000018620303,0.00001878417,8.2038343e-7,0.000008648102,0.0007813928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905837,0.00010533563,0.00013277426,0.0002535634,0.00021864583,0.00023129469],"domain_scores_gemma":[0.9988095,0.00022774762,0.000058947222,0.00079392665,0.000042522362,0.00006733828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005748992,0.00011991333,0.00010528641,0.00003802631,0.00024039709,0.00016994558,0.001145616,0.000057355024,0.00014451759],"category_scores_gemma":[0.00005854484,0.000077343815,0.00006131309,0.00025069504,0.000051266714,0.00017590329,0.0001782222,0.00032914968,0.00027443742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002670636,0.000053679825,0.000022135187,0.0000020381415,0.000006640318,0.00000854964,0.000114577604,0.0000034440225,0.002032696,0.9928673,0.003262637,0.0016236319],"study_design_scores_gemma":[0.0003649454,0.000049206905,0.000118599986,0.000004746929,0.000001987255,0.000008075595,0.0000021994233,0.0034045377,0.008027722,0.98012376,0.007772935,0.00012130949],"about_ca_topic_score_codex":0.000008013811,"about_ca_topic_score_gemma":0.0000011491874,"teacher_disagreement_score":0.031181518,"about_ca_system_score_codex":0.0000067357882,"about_ca_system_score_gemma":0.000031888823,"threshold_uncertainty_score":0.35274294},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102151625,0.00008765689,0.8878655,0.00022468825,0.0005328685,0.00039388632,0.00002510345,0.0005344428,0.008184235],"genre_scores_gemma":[0.99336964,0.000024867442,0.0032678195,0.00009514505,0.00008036781,0.0000017401516,0.000043673765,0.000023073122,0.003093686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977408,0.00031444017,0.0002000165,0.0011449449,0.00020530305,0.00039447306],"domain_scores_gemma":[0.997277,0.00038743808,0.0004284594,0.0014112886,0.00026391665,0.00023188979],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006943112,0.0003572698,0.00036573812,0.00041740842,0.0002640242,0.00021811748,0.0018595252,0.0002811432,0.0000228589],"category_scores_gemma":[0.00025158166,0.00035511,0.0001424436,0.0013944866,0.00011316951,0.00040571523,0.00089634553,0.00060421723,0.00015946187],"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.00006810759,0.0005334572,0.00015463005,0.000054052845,0.00027766643,0.0005647202,0.0011223778,0.30162865,0.00001961341,0.6929293,0.00084493734,0.0018024896],"study_design_scores_gemma":[0.00079119246,0.00025446076,0.000119113356,0.00029682225,0.00015176609,0.000003955666,0.000053861513,0.72665024,0.00017358664,0.2702858,0.00049118936,0.00072804285],"about_ca_topic_score_codex":0.00007351412,"about_ca_topic_score_gemma":0.000022084056,"teacher_disagreement_score":0.891218,"about_ca_system_score_codex":0.0003605123,"about_ca_system_score_gemma":0.00056350033,"threshold_uncertainty_score":0.9998901},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5977355,0.0023816035,0.39605498,0.0031355505,0.00022791167,0.00009489746,0.000002500485,0.00004042076,0.0003266287],"genre_scores_gemma":[0.98904705,0.0007094077,0.009184613,0.00014017127,0.00038290973,5.4171903e-7,2.1394712e-7,0.000010407015,0.00052469975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986069,0.00014175878,0.00032410218,0.00019332484,0.00029818714,0.00043573568],"domain_scores_gemma":[0.9989166,0.00024378662,0.00028518957,0.00021652685,0.00019811651,0.00013973784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009759912,0.0001363381,0.0002267953,0.00012382555,0.00010858076,0.000053180032,0.0006151245,0.0000598299,0.00002692038],"category_scores_gemma":[0.00011126717,0.000086350025,0.000107502514,0.00020223614,0.000049091173,0.0007955092,0.00016821241,0.00027875355,0.000022983217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036126585,0.00022410763,0.00093891344,0.000036608475,0.00046580093,0.00028553992,0.0009039256,0.000033438344,0.013487092,0.89555854,0.00061282865,0.087091915],"study_design_scores_gemma":[0.010735892,0.009631678,0.011111663,0.0007781462,0.00031616134,0.009059041,0.00022159402,0.0172545,0.24536516,0.67192155,0.021542758,0.0020618476],"about_ca_topic_score_codex":0.0000047902545,"about_ca_topic_score_gemma":0.000003375263,"teacher_disagreement_score":0.39131153,"about_ca_system_score_codex":0.00007500115,"about_ca_system_score_gemma":0.0002722943,"threshold_uncertainty_score":0.3521252},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74307823,0.22602656,0.0066004577,0.004730648,0.013311156,0.0022352254,0.000095735864,0.00015987258,0.0037621276],"genre_scores_gemma":[0.98510194,0.0026976643,0.011859443,0.00010301326,0.000054145068,0.000034623314,6.621226e-7,0.0000067206875,0.00014177329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99532217,0.00016022657,0.000871955,0.0011370217,0.0013620545,0.0011466001],"domain_scores_gemma":[0.99711674,0.0012743248,0.0006442309,0.0006213236,0.00022516493,0.00011819599],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0024449497,0.00034398504,0.0005079071,0.00054857734,0.00050336355,0.00013754996,0.0065490217,0.00008099037,0.000010308864],"category_scores_gemma":[0.0011497607,0.00017683687,0.00020357473,0.0065526594,0.005738704,0.00996839,0.0006180391,0.00031853587,0.0000011050515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021640216,0.00026725378,0.028043734,0.00018221223,0.000011240817,0.0000042960814,0.0006129916,0.000948333,0.10550623,0.5437067,0.00011940955,0.3203812],"study_design_scores_gemma":[0.0029422767,0.0007586455,0.012699761,0.001093677,0.0000136144,0.000034531895,0.000442105,0.026139338,0.37005013,0.5660722,0.018610684,0.0011430375],"about_ca_topic_score_codex":0.00005763585,"about_ca_topic_score_gemma":0.00031463275,"teacher_disagreement_score":0.31923816,"about_ca_system_score_codex":0.00016978977,"about_ca_system_score_gemma":0.00033964295,"threshold_uncertainty_score":0.998826},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95226586,0.0017596667,0.022111261,0.016191216,0.0010973001,0.0035714924,0.000020832904,0.00012277339,0.0028596157],"genre_scores_gemma":[0.9984078,0.000024821433,0.00072339276,0.00028698274,0.000010024784,0.00018951994,6.5120315e-7,0.0000064066717,0.00035040063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993766,0.00004047365,0.00014198059,0.00018236566,0.00011677259,0.0001418274],"domain_scores_gemma":[0.99829215,0.0011068677,0.000074429576,0.00039686923,0.00008705054,0.000042606167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003597018,0.00009271892,0.000106491236,0.000025798861,0.00028136393,0.00013679173,0.0004959369,0.00003080324,0.000029193767],"category_scores_gemma":[0.000045673693,0.000052173957,0.00003494191,0.00014055998,0.000092611546,0.00014279163,0.00016139813,0.000074877345,0.000021650618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038954977,0.000042569274,0.000028776896,0.000012097743,0.000011786772,9.1727436e-8,0.00014585708,0.0000010015118,0.00014637034,0.99465454,0.0014829257,0.0034701054],"study_design_scores_gemma":[0.00035479036,0.0001300572,0.0012572753,0.0000087166845,0.000008252066,0.0000042929064,0.00004073873,0.021068772,0.00035087042,0.9678995,0.008788887,0.00008783409],"about_ca_topic_score_codex":0.000010073688,"about_ca_topic_score_gemma":4.5864977e-7,"teacher_disagreement_score":0.04614196,"about_ca_system_score_codex":0.000006606226,"about_ca_system_score_gemma":0.000013717997,"threshold_uncertainty_score":0.21640523},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45790505,0.00008948014,0.5315294,0.00025517552,0.008893258,0.00026287558,0.0000032110709,0.00022964123,0.00083185564],"genre_scores_gemma":[0.96962804,0.0000021445965,0.02962763,0.00022419656,0.00011313175,0.0000396702,0.00001678855,0.000012250086,0.0003361234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906164,0.000109059765,0.00018284198,0.0002959483,0.00013221182,0.00021831032],"domain_scores_gemma":[0.9992254,0.0001212918,0.000058145706,0.0003627913,0.00015023304,0.00008218307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044430594,0.00011506838,0.00013096572,0.00005199248,0.00034839794,0.00019389862,0.00037545827,0.000058163285,0.000018960809],"category_scores_gemma":[0.00006800885,0.00011370769,0.00006152115,0.00019569785,0.000018497416,0.00034701676,0.00009734466,0.000077544544,0.00007330477],"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.000010518322,0.000050899027,0.000045441,0.000009056898,0.0000122592255,7.875143e-7,0.0001041576,0.00011665265,0.007214509,0.97883743,0.0019601462,0.011638121],"study_design_scores_gemma":[0.0023186968,0.0007642698,0.00018551084,0.00003102075,0.000030779694,0.000022301367,0.000035901685,0.4760974,0.032312687,0.4473486,0.040251695,0.000601144],"about_ca_topic_score_codex":0.000006002885,"about_ca_topic_score_gemma":7.6247323e-7,"teacher_disagreement_score":0.53148884,"about_ca_system_score_codex":0.00002893395,"about_ca_system_score_gemma":0.00003769882,"threshold_uncertainty_score":0.46368653},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6564985,0.00004360134,0.0028755704,0.001572166,0.04846998,0.00036229176,0.0000042653783,0.0005914214,0.28958222],"genre_scores_gemma":[0.9918874,0.000005507267,0.00616723,0.00034907938,0.00047093985,0.000008421409,0.0000017197711,0.0000139096655,0.0010958143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883455,0.00006191883,0.00017532565,0.0003512956,0.00029106555,0.0002858709],"domain_scores_gemma":[0.99882346,0.00015580827,0.00007844229,0.0007595202,0.000052608968,0.00013015268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004729593,0.00014580938,0.0001475708,0.00009645652,0.00016193774,0.00016744713,0.0010977465,0.00007627026,0.00023579811],"category_scores_gemma":[0.0000678781,0.00013357113,0.00007278607,0.0003587345,0.000045941448,0.00029143578,0.00020293302,0.00041759294,0.00075132196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006342314,0.00008067572,0.00007751924,0.0000028995094,0.000004997935,0.000030017009,0.00008780939,0.0000016492348,0.00034106613,0.9781646,0.0054533505,0.015749045],"study_design_scores_gemma":[0.00073892315,0.00008926825,0.00048777158,0.000008163284,0.0000035535193,0.000018426766,0.0000041820767,0.0014410603,0.0034808468,0.95393676,0.039573967,0.00021708458],"about_ca_topic_score_codex":0.00000827168,"about_ca_topic_score_gemma":0.0000036467118,"teacher_disagreement_score":0.3353889,"about_ca_system_score_codex":0.00001759085,"about_ca_system_score_gemma":0.000044927056,"threshold_uncertainty_score":0.9656974},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8473888,0.00021215277,0.009409137,0.000491329,0.012258748,0.0004157593,0.000004843564,0.000980373,0.12883887],"genre_scores_gemma":[0.9937016,0.000005465896,0.0044449433,0.0002835928,0.0000138220375,0.000010584178,7.043325e-7,0.000013049625,0.0015262859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988952,0.00008925328,0.00018569455,0.00033216813,0.00020018523,0.00029744813],"domain_scores_gemma":[0.9989188,0.00009736919,0.00007317441,0.0007466686,0.00003924533,0.00012476204],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033896446,0.00015297855,0.00015827635,0.000094339724,0.00012089425,0.00006810746,0.0010236127,0.00007309335,0.00022134639],"category_scores_gemma":[0.000038404803,0.00013782502,0.0000750298,0.00027111903,0.000037495636,0.0003166231,0.000200221,0.00014930857,0.0011683472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001249958,0.000120595636,0.00007823795,0.000003591139,0.000010397097,0.000027624475,0.00037443923,7.477217e-7,0.000080368205,0.9947168,0.002619932,0.0019547264],"study_design_scores_gemma":[0.0004999181,0.00019441982,0.00068524893,0.000011303262,0.000004262037,0.000009033001,0.000008563286,0.0004481712,0.008520317,0.9873499,0.002062636,0.00020622739],"about_ca_topic_score_codex":0.0000211253,"about_ca_topic_score_gemma":3.8758196e-7,"teacher_disagreement_score":0.14631276,"about_ca_system_score_codex":0.000026706439,"about_ca_system_score_gemma":0.000034443892,"threshold_uncertainty_score":0.99960935},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8122468,0.001510775,0.17443347,0.001548118,0.006787095,0.00061044935,0.000010537189,0.00021217241,0.0026405775],"genre_scores_gemma":[0.9943739,0.000023262268,0.004739303,0.000045955567,0.00001847006,0.000019830011,0.0000012779722,0.0000067406195,0.00077121914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933094,0.00007702743,0.00019577847,0.00017225432,0.000086245,0.00013774079],"domain_scores_gemma":[0.99884784,0.0006322333,0.000096341864,0.0003306255,0.000058449285,0.000034536828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006367998,0.00008294775,0.0001276391,0.000041878386,0.0002784259,0.00006135169,0.00032212268,0.00004505949,0.0000057346247],"category_scores_gemma":[0.00012327437,0.00006021927,0.00005068124,0.00017333333,0.00006586581,0.00014466069,0.00011723889,0.00007208146,0.0000055364403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028553345,0.000015868096,0.00010107569,0.000010188352,0.000018862698,1.5026923e-7,0.00026530153,0.000094482195,0.0012217893,0.9831746,0.00057148864,0.014523292],"study_design_scores_gemma":[0.0012378456,0.00021434845,0.00082145986,0.000020692964,0.000037622576,0.000013995894,0.00016134251,0.29376197,0.0043513896,0.6896321,0.009537358,0.00020988456],"about_ca_topic_score_codex":0.00001398959,"about_ca_topic_score_gemma":7.6155357e-7,"teacher_disagreement_score":0.2936675,"about_ca_system_score_codex":0.0000068317045,"about_ca_system_score_gemma":0.00001953499,"threshold_uncertainty_score":0.24556705},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9323436,0.000029184275,0.0073469346,0.0063929455,0.01725975,0.000275886,0.0000010241534,0.0003189746,0.036031686],"genre_scores_gemma":[0.99753416,0.0000014350286,0.0011128264,0.00062034954,0.000017686174,0.0000065070913,6.44131e-7,0.000005378495,0.0007010138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930674,0.000065563334,0.00009706899,0.00017937014,0.00019455675,0.0001566995],"domain_scores_gemma":[0.99877733,0.00040212902,0.00004378732,0.0006669845,0.000060029033,0.000049743885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005104345,0.00008142784,0.00006547291,0.00003095186,0.0001902926,0.0001192021,0.00089952315,0.000045480832,0.00016091892],"category_scores_gemma":[0.00020396011,0.000054172495,0.00003297708,0.0002853028,0.000039702674,0.0001553101,0.00012169453,0.00026017096,0.0007226225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020377981,0.000033999335,0.000024384335,8.8447416e-7,0.0000035903352,0.0000027794033,0.000090749236,0.0000029328276,0.00041204656,0.99450237,0.0025809016,0.0023433005],"study_design_scores_gemma":[0.00013786358,0.000058459573,0.00021224089,0.0000029048076,0.0000014295232,0.0000032983994,0.0000044772787,0.005896795,0.0027881765,0.98459506,0.00621804,0.000081253216],"about_ca_topic_score_codex":0.000003807608,"about_ca_topic_score_gemma":5.9694776e-7,"teacher_disagreement_score":0.065190546,"about_ca_system_score_codex":0.0000072763646,"about_ca_system_score_gemma":0.000033799428,"threshold_uncertainty_score":0.9288091},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072628615,0.00018880921,0.9963734,0.00021209868,0.0009878174,0.00039168532,0.000019905645,0.00006305757,0.0010369418],"genre_scores_gemma":[0.015958043,0.000041442207,0.98268396,0.00040009257,0.00032319766,0.000011738624,0.0000024745395,0.000024036834,0.00055501884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973296,0.000018744877,0.00047711044,0.0010732905,0.0005753466,0.0005258967],"domain_scores_gemma":[0.998111,0.00056085084,0.0003134993,0.00071358366,0.0001588695,0.00014217354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010624179,0.00038424038,0.00045949477,0.00052885903,0.00025180005,0.00013056878,0.0017074511,0.00021225464,0.000012227715],"category_scores_gemma":[0.000042245938,0.00029054118,0.00009426668,0.000237577,0.00030667914,0.0002974363,0.0007958469,0.00025465002,0.000016825294],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033183303,0.0000645681,0.000021714328,0.00014176653,0.000020388488,0.000015324531,0.0022337479,0.0010154159,0.00032120707,0.08486963,0.000018662715,0.9112444],"study_design_scores_gemma":[0.0026643632,0.001059902,0.0001720948,0.00248236,0.00003521653,0.00007080863,0.0000026361301,0.5443557,0.03701105,0.35445353,0.055235077,0.0024572397],"about_ca_topic_score_codex":8.561275e-7,"about_ca_topic_score_gemma":0.000013088211,"teacher_disagreement_score":0.90878713,"about_ca_system_score_codex":0.00009234411,"about_ca_system_score_gemma":0.00035266837,"threshold_uncertainty_score":0.9999547},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055603657,0.000058095553,0.9394262,0.0018388705,0.00034963014,0.000040586336,0.0000023969203,0.000059261063,0.0026213184],"genre_scores_gemma":[0.9654452,0.000013233644,0.031711377,0.00016289075,0.00027518498,0.0000023275245,1.5377672e-7,0.0000056861168,0.0023839176],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994132,0.000054701257,0.00010205743,0.00011120174,0.00015213311,0.00016670131],"domain_scores_gemma":[0.9995122,0.00009871544,0.00007462789,0.00016070253,0.00004853517,0.00010520429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002452708,0.000063739295,0.00006631038,0.000056482193,0.00015007368,0.00011123143,0.00035768785,0.000019009214,0.00019897046],"category_scores_gemma":[0.000029092585,0.00003165861,0.000033904762,0.00008333041,0.00003610114,0.00063014345,0.000037259775,0.00007770006,0.00010443625],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120073644,0.00020781207,0.010278684,0.00002183099,0.00018807543,0.0005979713,0.0017029374,0.00020269997,0.015882723,0.1948599,0.023871725,0.75206554],"study_design_scores_gemma":[0.014425903,0.0023269616,0.038739685,0.0012138974,0.00005713346,0.021555435,0.00041876035,0.013391448,0.13269976,0.53057295,0.24238588,0.0022121714],"about_ca_topic_score_codex":8.161745e-7,"about_ca_topic_score_gemma":0.00000185729,"teacher_disagreement_score":0.9098416,"about_ca_system_score_codex":0.000017908327,"about_ca_system_score_gemma":0.00004487589,"threshold_uncertainty_score":0.2178587},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0679972,0.00049902755,0.93099034,0.0003125335,0.000005862654,0.000089027286,0.0000125717015,0.000003878138,0.00008958086],"genre_scores_gemma":[0.90775716,0.00027204482,0.09184146,0.000006286575,0.000033926386,0.000013781008,2.8887624e-7,0.0000027344854,0.00007229741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991661,0.000031056847,0.0004894511,0.00010043939,0.00014205894,0.0000709261],"domain_scores_gemma":[0.9981505,0.00093761034,0.00048123067,0.00015702202,0.00020634079,0.000067283036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005018605,0.00006461088,0.00033256886,0.00039358772,0.00006178522,0.000018416591,0.00019695834,0.000025757989,0.000019369772],"category_scores_gemma":[0.00010964899,0.000035786972,0.00016877822,0.00093289826,0.000101867394,0.00015312542,0.00004510566,0.000027174563,6.50045e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008206695,0.00024495245,0.0012415386,0.00016081808,0.00071424927,1.6438604e-7,0.00019427914,0.0000131073275,0.005669914,0.92017335,0.000028452183,0.07155097],"study_design_scores_gemma":[0.0006672096,0.00037584794,0.00947248,0.00011819512,0.001953042,0.000030252604,0.00037553467,0.010745058,0.023121951,0.95202315,0.0009011292,0.00021616585],"about_ca_topic_score_codex":7.907975e-7,"about_ca_topic_score_gemma":2.8152732e-7,"teacher_disagreement_score":0.83976,"about_ca_system_score_codex":0.0000046468153,"about_ca_system_score_gemma":0.000016188424,"threshold_uncertainty_score":0.14593503},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9553241,0.000019043782,0.035564665,0.0024978456,0.00010551349,0.00024097638,0.00001474688,0.00014744147,0.0060856394],"genre_scores_gemma":[0.9957544,0.0000017850033,0.00056473934,0.00017831082,0.000024958668,2.9173756e-7,0.0000015145501,0.000008941806,0.003465011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990626,0.00013796105,0.00006689277,0.00030303918,0.0001841023,0.0002454178],"domain_scores_gemma":[0.9991292,0.0002436946,0.00008690489,0.00038861547,0.00006158453,0.000090035996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009312953,0.00016653923,0.00013589172,0.00011524299,0.00022924636,0.000189325,0.0006564944,0.00009021693,0.00012072298],"category_scores_gemma":[0.00002096401,0.00010742244,0.00003554622,0.00043901254,0.0001275815,0.00030149706,0.00018679287,0.00024496135,0.000048710455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008009929,0.000110544024,0.008348971,0.000010707534,0.00019829291,0.00010086113,0.004322179,0.0005302968,0.00022209344,0.96903306,0.00032316896,0.016719753],"study_design_scores_gemma":[0.016251145,0.0033766746,0.30779114,0.0021338903,0.0005226745,0.00027588318,0.038710475,0.24430014,0.0033206223,0.3643127,0.012155559,0.0068490854],"about_ca_topic_score_codex":0.000029885634,"about_ca_topic_score_gemma":0.00006700065,"teacher_disagreement_score":0.6047203,"about_ca_system_score_codex":0.000018243178,"about_ca_system_score_gemma":0.00002216383,"threshold_uncertainty_score":0.43805602},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003296195,0.00023607758,0.49898162,0.0010715602,0.00010410908,0.0013682448,0.000030640036,0.00080351613,0.49737126],"genre_scores_gemma":[0.012227281,0.000051362465,0.7104415,0.0017238033,0.00066531444,0.0005603066,0.000020657488,0.0010923565,0.2732174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99629205,0.00028537735,0.0008252364,0.00080436096,0.00093905424,0.0008539326],"domain_scores_gemma":[0.9939874,0.002018558,0.0014317419,0.0021510993,0.000056879006,0.0003543255],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015689271,0.0009380413,0.0014227219,0.00010475761,0.00028608507,0.00033557438,0.0022659004,0.00027684425,0.0009325748],"category_scores_gemma":[0.00014915245,0.0005270352,0.0005290585,0.0006464316,0.0008838177,0.00023213297,0.000617862,0.0008208822,0.0008496723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008842747,0.00070357684,0.0000034544826,0.00078860554,0.0005276769,0.000011698308,0.0037664524,0.0000022406086,0.000025831032,0.7998454,0.19273823,0.001578003],"study_design_scores_gemma":[0.002653012,0.0012709304,0.0000109381135,0.008354689,0.0004886933,0.00017467036,0.0040835296,0.048912913,0.0005806281,0.6695693,0.25845906,0.0054416],"about_ca_topic_score_codex":0.00004914656,"about_ca_topic_score_gemma":9.551936e-7,"teacher_disagreement_score":0.22415383,"about_ca_system_score_codex":0.000092435206,"about_ca_system_score_gemma":0.00018935086,"threshold_uncertainty_score":0.9999807},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015693437,0.000013584579,0.9936003,0.001695725,0.000071837865,0.00065783894,0.000019515888,0.00038378747,0.0019880529],"genre_scores_gemma":[0.19578218,0.000008329131,0.8022341,0.00045717089,0.00018020437,0.0006098816,0.000009244922,0.00002995038,0.00068892544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876684,0.000035285422,0.00024943496,0.00043280964,0.000244411,0.00027122762],"domain_scores_gemma":[0.9975013,0.0010562623,0.00016260454,0.0010674443,0.00007388497,0.00013850906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014624019,0.00021171235,0.0001959442,0.00012882272,0.00023098072,0.0001132831,0.0009780944,0.00005376987,0.000030133742],"category_scores_gemma":[0.000023668807,0.00012741555,0.00006902202,0.00028734328,0.00011071299,0.00018579017,0.00014487657,0.00010515331,0.00030841943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010331296,0.00040596406,0.000028815657,0.00006918393,0.00006239014,0.000004250731,0.0007931739,0.00051151746,0.0006597649,0.8556566,0.0016095523,0.14018846],"study_design_scores_gemma":[0.002883394,0.00047557458,0.00054816937,0.0006263645,0.00005229886,0.00019560581,0.000062608924,0.07451938,0.0100737,0.8556078,0.053708043,0.001247033],"about_ca_topic_score_codex":5.7652954e-7,"about_ca_topic_score_gemma":0.0000015630338,"teacher_disagreement_score":0.19421284,"about_ca_system_score_codex":0.000033269036,"about_ca_system_score_gemma":0.00003925963,"threshold_uncertainty_score":0.51958555},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7756489,0.00015989413,0.16056165,0.04758605,0.00020613211,0.0006454159,0.00024069817,0.00013462224,0.014816643],"genre_scores_gemma":[0.9821913,0.000028280716,0.014046372,0.00048988796,0.000036643483,0.000014597597,0.0000032439104,0.000008913137,0.0031807607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994531,0.000020454794,0.0001513089,0.00016047618,0.00007193185,0.0001426754],"domain_scores_gemma":[0.99916834,0.00026776377,0.00004277831,0.00021484167,0.00003896679,0.0002673129],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012909879,0.00006665323,0.00011341028,0.000078167344,0.0000803315,0.00003168145,0.00012604946,0.0000357249,0.0010528048],"category_scores_gemma":[0.00027622544,0.00004817316,0.000016005439,0.00009030093,0.00017449043,0.000062626124,0.000060535054,0.000032304633,0.00018162464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.7359336e-7,0.000009283363,0.000247623,0.00002951517,0.000006405005,0.000013947272,0.00032610516,7.723818e-8,0.00080891926,0.99408144,0.0016705832,0.002805233],"study_design_scores_gemma":[0.0012167769,0.00016278982,0.0115085235,0.00046835694,0.000044438606,0.0004325816,0.000362718,0.0046296334,0.0019977535,0.9212929,0.05724208,0.0006414407],"about_ca_topic_score_codex":0.000091114074,"about_ca_topic_score_gemma":0.00007016467,"teacher_disagreement_score":0.2065424,"about_ca_system_score_codex":0.0000109059,"about_ca_system_score_gemma":0.000059272446,"threshold_uncertainty_score":0.99986035},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019193321,0.00007841678,0.052464023,0.000021924476,0.00031949082,0.00019843185,0.00003423725,0.00031644545,0.94654787],"genre_scores_gemma":[0.0004018882,0.000024077899,0.0054807193,0.00016270632,0.00020969454,1.673471e-7,0.000008970831,0.000022747725,0.993689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99862725,0.000050280545,0.00019859994,0.0005984914,0.0002363085,0.00028905115],"domain_scores_gemma":[0.9986505,0.000060345505,0.00018584663,0.0008021707,0.00011618201,0.00018496311],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015671262,0.00035805738,0.00035212384,0.00018933573,0.00023707053,0.00011237791,0.0015822743,0.0002814498,0.000004353359],"category_scores_gemma":[0.000008397953,0.00040592722,0.00021546296,0.000013613357,0.00010224462,0.00024363383,0.00077955594,0.00054494455,0.000040306113],"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.00001033899,0.000005126508,1.5079038e-7,0.000019188872,0.000039259376,0.00030771884,0.000058269816,0.00000495472,0.000018860388,0.97672486,0.0030205841,0.019790672],"study_design_scores_gemma":[0.00029284193,0.00007800682,0.0000010583574,0.0001742222,0.00004116502,0.000030414569,0.000008099243,0.006035634,0.00045248898,0.00013582419,0.9922283,0.0005219352],"about_ca_topic_score_codex":0.000019041947,"about_ca_topic_score_gemma":2.6663213e-7,"teacher_disagreement_score":0.98920774,"about_ca_system_score_codex":0.000111411624,"about_ca_system_score_gemma":0.00009781738,"threshold_uncertainty_score":0.99983925},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.3208428e-7,0.00029569064,0.22683129,0.00035082197,0.0003572076,0.000057056302,0.0000016087461,0.0005902097,0.77151597],"genre_scores_gemma":[0.000010169911,0.00003288728,0.099777564,0.00030347006,0.0005523456,0.0000013072266,0.0000014099161,0.000046821147,0.89927405],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999392,0.00002563796,0.000066811204,0.0002479608,0.00012309106,0.00014450283],"domain_scores_gemma":[0.9994155,0.00001564586,0.000052671265,0.00045637385,0.0000068816535,0.00005293029],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007350016,0.00013331283,0.00014395562,0.0000978819,0.00001852849,0.00006853983,0.0006995487,0.00011467331,0.0030172886],"category_scores_gemma":[0.000005582365,0.00010117142,0.00005112399,0.00012466272,0.000014649086,0.000045173947,0.0000788377,0.00008948242,0.0015479991],"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":[2.646789e-7,0.000013953525,3.0862512e-7,0.000007823692,0.000007578617,0.000012375142,0.000013691053,4.7931303e-7,0.000002707814,0.24873818,0.7295615,0.021641107],"study_design_scores_gemma":[0.00005370507,0.00002554767,0.0000021882088,0.000025010126,0.0000020038651,0.000003853931,9.655741e-7,0.00115374,0.00008814234,0.0030060287,0.9954839,0.00015494222],"about_ca_topic_score_codex":0.000023170836,"about_ca_topic_score_gemma":0.000007389069,"teacher_disagreement_score":0.26592234,"about_ca_system_score_codex":0.0000048525562,"about_ca_system_score_gemma":0.000022642203,"threshold_uncertainty_score":0.99922943},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06900941,0.000042614,0.9282601,0.002327238,0.00009238319,0.00013331743,0.0000010653366,0.000014563961,0.000119298194],"genre_scores_gemma":[0.95728976,0.0000072591374,0.04189565,0.0001682764,0.0004671742,0.0000024619917,2.688339e-7,0.000012989902,0.00015619092],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99889386,0.00027320054,0.00023977377,0.00012579758,0.00031440938,0.00015294085],"domain_scores_gemma":[0.9988085,0.00037008588,0.00032926214,0.0002902901,0.00016277072,0.0000390772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001396631,0.0001135396,0.00017609663,0.000027980657,0.00006444059,0.000046105513,0.0005174476,0.00002527648,0.000010582285],"category_scores_gemma":[0.00006899689,0.000045154262,0.000051237235,0.00028102729,0.00006946619,0.00049889984,0.00006163394,0.00021125088,0.000010904861],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014768138,0.00010546139,0.000009806211,0.0000062069853,0.00003939129,0.0000043600494,0.00059837446,0.0006856052,0.9395499,0.0009777913,0.000116595336,0.057758775],"study_design_scores_gemma":[0.000838499,0.00006256343,0.000022652861,0.00007197083,0.000043502143,0.00012641697,0.000027274074,0.024574688,0.9693088,0.0046702935,0.00014551847,0.000107828135],"about_ca_topic_score_codex":0.0000066997495,"about_ca_topic_score_gemma":7.208127e-7,"teacher_disagreement_score":0.88828033,"about_ca_system_score_codex":0.00006295037,"about_ca_system_score_gemma":0.00007846508,"threshold_uncertainty_score":0.18413374},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004650843,0.00012659829,0.016514229,0.000070703216,0.00036674988,0.00034878508,0.00027016047,0.00019973502,0.98205656],"genre_scores_gemma":[0.0007614099,0.00006747326,0.0010571077,0.000114371636,0.000100578385,9.4126773e-7,0.000008999078,0.0000271769,0.9978619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99821645,0.000111986614,0.00025764227,0.00080643105,0.0002550307,0.0003524588],"domain_scores_gemma":[0.99817586,0.00020815566,0.00020014845,0.0011351621,0.00010966808,0.0001709988],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036739904,0.00037620857,0.00039370183,0.00025869737,0.00013449255,0.00006212206,0.0017585846,0.000302568,0.0000036676574],"category_scores_gemma":[0.000025510819,0.00035615265,0.00015882905,0.000016765336,0.0002127126,0.00031753065,0.00092225685,0.0004086885,0.000041040577],"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.00018419634,0.0000073603896,1.10953984e-7,0.000022633814,0.000028496928,0.0006128231,0.000105092084,0.0000035295727,0.000040636558,0.97625214,0.0016328638,0.02111011],"study_design_scores_gemma":[0.0018515717,0.00006526449,0.000005613223,0.00040753896,0.000023490977,0.00001821404,0.000022679427,0.0001883443,0.0007852978,0.0011096455,0.9948645,0.0006578189],"about_ca_topic_score_codex":0.000006709595,"about_ca_topic_score_gemma":6.266171e-7,"teacher_disagreement_score":0.99323165,"about_ca_system_score_codex":0.00017312255,"about_ca_system_score_gemma":0.00014310401,"threshold_uncertainty_score":0.999889},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078472117,0.000014433673,0.46200812,0.004576701,0.0005258743,0.00042884756,0.0000026260625,0.00007676893,0.5315819],"genre_scores_gemma":[0.6808965,0.000006830165,0.005631405,0.0030126204,0.00014315137,0.00013140775,0.0000022712647,0.000011355889,0.31016442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994403,0.00015901207,0.00007380093,0.00016624389,0.0000726629,0.00008794183],"domain_scores_gemma":[0.99898267,0.0006567837,0.000034749926,0.0002658641,0.000026286101,0.000033642893],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003617184,0.000060385788,0.00006381526,0.00002428209,0.0019147855,0.001125481,0.00040916467,0.000027128266,0.00017237004],"category_scores_gemma":[0.00013821336,0.000039548606,0.000018582356,0.00039008312,0.000033856166,0.00016874634,0.00015927912,0.000093588664,0.00002250142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000731533,0.000031057305,0.000012944707,0.0000012391589,0.00000971994,3.9012266e-7,0.00022911777,0.00046952543,0.000009141018,0.7405105,0.25296554,0.0057535027],"study_design_scores_gemma":[0.0004300609,0.00024369502,0.00034100885,0.000017883816,0.000008578721,0.000031169486,0.000048173093,0.27422175,0.00037910018,0.49711913,0.22698563,0.00017381548],"about_ca_topic_score_codex":0.00029141066,"about_ca_topic_score_gemma":0.000093071874,"teacher_disagreement_score":0.6801118,"about_ca_system_score_codex":0.000011733669,"about_ca_system_score_gemma":0.00002365874,"threshold_uncertainty_score":0.9999114},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018794388,0.00014216796,0.95859474,0.03331355,0.001656244,0.0006405904,0.000037998936,0.00013008174,0.0054658093],"genre_scores_gemma":[0.0010160846,0.000032180094,0.9850613,0.00073646975,0.0031156077,0.00008492574,0.000019517307,0.000027317803,0.009906594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786234,0.00007926134,0.00039820527,0.00087248534,0.00043194555,0.00035577008],"domain_scores_gemma":[0.9980823,0.0007417152,0.00019724932,0.00065233215,0.0001427229,0.00018370444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018822508,0.00036326647,0.00038003275,0.00017335457,0.0009107028,0.00041867053,0.0009817237,0.00022032036,0.00010054889],"category_scores_gemma":[0.0007742526,0.00019577553,0.00010438832,0.00020884705,0.0009606246,0.00108385,0.00025934153,0.00023951597,0.00003276333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017692275,0.000010895692,3.450692e-8,0.000039357787,0.000015258643,8.691731e-7,0.00026252106,0.00088576804,0.0003421485,0.90675145,0.00012885068,0.09154514],"study_design_scores_gemma":[0.000065671156,0.00037025055,4.26753e-7,0.00007466535,0.000023853629,0.00012987689,0.0000027808026,0.004972684,0.00095275184,0.7496143,0.24352147,0.00027124988],"about_ca_topic_score_codex":0.000002598489,"about_ca_topic_score_gemma":0.000015731726,"teacher_disagreement_score":0.24339262,"about_ca_system_score_codex":0.00004119544,"about_ca_system_score_gemma":0.00014278323,"threshold_uncertainty_score":0.79834944},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015017262,0.00031919644,0.97887546,0.0029700466,0.00005267904,0.000301807,0.000014472429,0.000078032805,0.002371045],"genre_scores_gemma":[0.95892614,0.00080737215,0.035162352,0.00026047076,0.00039761365,0.00019855125,0.0000039142856,0.000015556772,0.0042280233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937123,0.000014530845,0.0001939016,0.00015909312,0.00010092573,0.00016034157],"domain_scores_gemma":[0.9992122,0.00021724057,0.000082118946,0.00035140742,0.00007552713,0.00006150561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024055377,0.00007338716,0.00008066646,0.00003508622,0.00031981486,0.000025771993,0.00046533466,0.000034033674,0.000010312957],"category_scores_gemma":[0.000022311177,0.00003941948,0.00003659972,0.00023846216,0.00006131476,0.00022574674,0.0001642254,0.000051178075,0.000055722718],"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.0000017812041,0.000016186043,0.000018928919,0.00000909619,0.000008089834,1.3420205e-7,0.00018060282,6.6751664e-7,0.0013502302,0.8828237,0.000040683462,0.11554988],"study_design_scores_gemma":[0.0008817066,0.00013033715,0.0008838061,0.00006362164,0.000017899298,0.00003637119,0.00016038051,0.06968364,0.040254317,0.24264096,0.6448359,0.00041109652],"about_ca_topic_score_codex":0.000001740428,"about_ca_topic_score_gemma":0.000001473759,"teacher_disagreement_score":0.9439089,"about_ca_system_score_codex":0.0000055373066,"about_ca_system_score_gemma":0.000027683609,"threshold_uncertainty_score":0.24597897},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025493535,0.0039703916,0.9745694,0.0014296485,0.0007304021,0.00035891103,0.00003146849,0.00009634474,0.018787982],"genre_scores_gemma":[0.92947096,0.0018992703,0.048608597,0.012614562,0.0045800074,0.000076677294,0.000082676896,0.00003790538,0.0026293565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983122,0.000039533734,0.0005887762,0.00030960081,0.00048668796,0.00026322642],"domain_scores_gemma":[0.9987326,0.0005019092,0.0003706802,0.00024117154,0.00007163703,0.00008199516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070766505,0.0002589211,0.00038715938,0.00030490814,0.00023055266,0.0007104902,0.00065700576,0.00025137202,0.000020954243],"category_scores_gemma":[0.00010015392,0.00019101542,0.00006287181,0.00013214881,0.00017711993,0.0036779516,0.00010872886,0.0003697299,0.00006537394],"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.000011523777,0.000009591877,0.000037072437,0.000057483612,0.000025982124,0.0000031959269,0.0013303506,0.05994383,0.000012578237,0.59201854,0.00003173867,0.3465181],"study_design_scores_gemma":[0.00045953837,0.00008488916,0.000023458237,0.00017646003,0.000008713197,0.000013795155,0.00000469445,0.80196565,0.000014014995,0.115362324,0.08156269,0.0003237793],"about_ca_topic_score_codex":0.00007235503,"about_ca_topic_score_gemma":0.0000052044875,"teacher_disagreement_score":0.92944545,"about_ca_system_score_codex":0.000037149763,"about_ca_system_score_gemma":0.00010700108,"threshold_uncertainty_score":0.7789383},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003949444,0.00062161207,0.68121207,0.00008963167,0.0017186715,0.00032525067,0.000034285087,0.00046018336,0.31514335],"genre_scores_gemma":[0.0041713417,0.00020651927,0.60814476,0.0006639687,0.0019338212,0.000008497376,0.000012224941,0.0001492801,0.38470957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744797,0.000072963885,0.000516069,0.0010343242,0.00044485647,0.00048383672],"domain_scores_gemma":[0.99788374,0.00021854266,0.0003740711,0.0010513188,0.00010874948,0.0003635678],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004461039,0.0005842673,0.0005894312,0.0003095337,0.00039924888,0.0006439467,0.0010972106,0.00031138113,0.0005927836],"category_scores_gemma":[0.000008925759,0.00044017975,0.00014051831,0.00006082635,0.00020500328,0.0011615303,0.00084408495,0.00032189934,0.000086783184],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011808822,0.000031878037,0.0000056781737,0.000039063936,0.00006258236,0.00048607253,0.00019065554,0.000010227441,0.00023284138,0.3098429,0.00017666696,0.6889096],"study_design_scores_gemma":[0.0028857032,0.0007595603,0.00002247642,0.0030498542,0.00021970259,0.0019027868,0.000045718654,0.4759079,0.0009763472,0.36805877,0.1419384,0.0042328048],"about_ca_topic_score_codex":0.000013322195,"about_ca_topic_score_gemma":0.000005377951,"teacher_disagreement_score":0.6846768,"about_ca_system_score_codex":0.00005192658,"about_ca_system_score_gemma":0.00011475976,"threshold_uncertainty_score":0.999805},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35829496,0.0020150852,0.6373891,0.00096594705,0.00046425167,0.00038374958,0.0000027239064,0.00009231225,0.00039184952],"genre_scores_gemma":[0.94084394,0.00017670238,0.05758709,0.00051719125,0.00075016357,0.000006282111,0.0000017497606,0.0000273813,0.00008952473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796724,0.00013596816,0.00051443017,0.00029203203,0.00040690642,0.00068344874],"domain_scores_gemma":[0.99853003,0.0002685546,0.0004976885,0.00033706575,0.00018939692,0.00017728936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017169317,0.00021558229,0.00033799693,0.0005410785,0.00022920225,0.00015046752,0.0011167777,0.000075474105,0.000010116017],"category_scores_gemma":[0.00017598223,0.00016936011,0.00024074929,0.000781956,0.000035319394,0.00076423376,0.00006376403,0.00056419306,0.000018238525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121055244,0.00016947965,0.000008531168,0.000025823729,0.00010798647,0.00002716076,0.0003821644,0.011131898,0.0008424298,0.9742926,0.00011418354,0.012776723],"study_design_scores_gemma":[0.004127432,0.0038609074,0.000015173633,0.00009916298,0.00006656086,0.0005687652,0.000063035375,0.011414389,0.025862953,0.95047575,0.0030802551,0.00036561344],"about_ca_topic_score_codex":0.000010541834,"about_ca_topic_score_gemma":0.000010017438,"teacher_disagreement_score":0.582549,"about_ca_system_score_codex":0.00025350074,"about_ca_system_score_gemma":0.00066424266,"threshold_uncertainty_score":0.69063044},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000040716104,0.00014148022,0.29765466,0.00026734843,0.00035181982,0.00010376886,0.00017886366,0.00037467104,0.7009233],"genre_scores_gemma":[0.00009918195,0.00002814792,0.10368333,0.00031006202,0.00038548827,0.000007177685,0.00019858181,0.000049847644,0.89523816],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99881446,0.000066457535,0.00020891332,0.00052396936,0.00020532147,0.00018089733],"domain_scores_gemma":[0.998642,0.00007641548,0.00014844192,0.0010407232,0.000011618387,0.00008078874],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00011866212,0.0001830843,0.00028424378,0.00029946942,0.000025179954,0.00011713162,0.001048354,0.00011627758,0.022307144],"category_scores_gemma":[0.000007804268,0.00014210564,0.00015721397,0.0004961477,0.000017506964,0.00008321788,0.00023417195,0.000097924916,0.0022555138],"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.0000015013801,0.000021430038,0.000006457815,0.0000023951548,0.0006951816,0.00000782537,0.00003477469,0.0000024851229,0.0000036253234,0.019574357,0.97024983,0.009400158],"study_design_scores_gemma":[0.00026382797,0.000016252654,0.00007501993,0.000013965846,0.00016391932,2.2286683e-7,0.000007188933,0.012555753,0.00008545647,0.0018414176,0.98467,0.00030697603],"about_ca_topic_score_codex":0.0047503076,"about_ca_topic_score_gemma":0.00024194116,"teacher_disagreement_score":0.19431485,"about_ca_system_score_codex":0.00001342196,"about_ca_system_score_gemma":0.00001712142,"threshold_uncertainty_score":0.9985213},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009184945,0.0035008318,0.14652713,0.00009917989,0.00046789213,0.00019186553,0.0000073970073,0.000120907425,0.84899294],"genre_scores_gemma":[0.0018591853,0.00006092147,0.0064357906,0.000115111965,0.00011825711,0.0000030603705,0.00000433989,0.000013258708,0.99139005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907076,0.00011630761,0.00024394739,0.00025621883,0.00014583398,0.0001669066],"domain_scores_gemma":[0.99909496,0.00013255299,0.000108551845,0.00052232185,0.000054209766,0.00008738981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059169583,0.0001727735,0.00027700776,0.000069838075,0.000041918625,0.000050365525,0.0005339066,0.00024433038,0.00027332254],"category_scores_gemma":[0.000020290772,0.0001340254,0.00006522347,0.00005002887,0.00008066276,0.0002053659,0.00035020272,0.00020642599,0.00004224585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000312501,0.000012932588,0.000001581107,0.000042183787,0.000029757144,0.000004360519,0.0004030644,9.022752e-7,0.000014375899,0.92279917,0.0007665298,0.075922035],"study_design_scores_gemma":[0.00017981324,0.000045855602,0.000008004629,0.00005802972,0.000024259376,0.000028187833,0.000004946109,0.0022000626,0.00022839975,0.9441953,0.05278009,0.0002470993],"about_ca_topic_score_codex":7.2962837e-7,"about_ca_topic_score_gemma":1.9521669e-7,"teacher_disagreement_score":0.14239712,"about_ca_system_score_codex":0.000017038497,"about_ca_system_score_gemma":0.00012689095,"threshold_uncertainty_score":0.5465397},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032553424,0.000026531423,0.40978932,0.000080633174,0.000049374194,0.00015972531,0.000004243021,0.00013038456,0.5897272],"genre_scores_gemma":[0.016909325,0.00006427115,0.43669805,0.0034257614,0.00034576544,0.000022853681,0.00001596376,0.00013129147,0.5423867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834996,0.000029925051,0.0005699897,0.00038545748,0.0004057351,0.00025894423],"domain_scores_gemma":[0.9984982,0.00017529802,0.00047086462,0.00062563195,0.00010463024,0.00012536674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033827394,0.00032587725,0.0006639955,0.00004852763,0.000086476706,0.00007088428,0.00085556076,0.00014641025,0.00011275751],"category_scores_gemma":[0.00002208726,0.00028202793,0.00046948862,0.00005065903,0.00045018631,0.00009223955,0.00027080934,0.0003046712,0.00006668652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015780272,0.000015684172,3.2072418e-7,0.00007157744,0.00006334234,0.0000030887884,0.0014010526,0.0000029005225,0.000035404264,0.8960441,0.0003816006,0.1019794],"study_design_scores_gemma":[0.0002554189,0.00044664572,0.0000018767743,0.000668258,0.00009314461,0.000034570374,0.00018619973,0.01938794,0.0010190704,0.9432483,0.033817787,0.0008407926],"about_ca_topic_score_codex":0.0000026071382,"about_ca_topic_score_gemma":1.8808748e-7,"teacher_disagreement_score":0.10113861,"about_ca_system_score_codex":0.00004796226,"about_ca_system_score_gemma":0.00007830961,"threshold_uncertainty_score":0.99996316},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07509287,0.0005015985,0.91926175,0.000039448532,0.0006249223,0.0023580163,0.00044804782,0.00007852246,0.0015948177],"genre_scores_gemma":[0.29623187,0.000008671401,0.70332134,0.000015222967,0.00012888758,0.0000101530095,0.00003548619,0.00005204911,0.00019633415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971563,0.000107057764,0.0013837795,0.00052238937,0.00050947914,0.000320989],"domain_scores_gemma":[0.9969525,0.00026293422,0.0014384382,0.0010150645,0.00014100513,0.00019007527],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009820451,0.000476618,0.001470655,0.0003133027,0.000059805494,0.000035637804,0.0006725677,0.0003322032,0.000031047668],"category_scores_gemma":[0.00005827984,0.00042714592,0.00015670444,0.00013322248,0.00033222465,0.00034622996,0.00039500376,0.00028423194,4.347767e-7],"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.00094037247,0.00028268524,0.0000066596676,0.0020052665,0.00009156279,0.000020398422,0.0030095014,0.00018025005,0.3400763,0.6401824,0.000014222522,0.01319044],"study_design_scores_gemma":[0.001909847,0.000454176,0.000024468021,0.0017285697,0.00012256508,0.00001963256,0.00046528084,0.027557652,0.6650507,0.30090743,0.00079474057,0.0009649664],"about_ca_topic_score_codex":0.00001182584,"about_ca_topic_score_gemma":0.00000554002,"teacher_disagreement_score":0.3392749,"about_ca_system_score_codex":0.00003529432,"about_ca_system_score_gemma":0.00022561743,"threshold_uncertainty_score":0.999818},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018605977,0.00018884642,0.6231807,0.0005292777,0.00028679371,0.00012362303,0.000013876212,0.0001243433,0.3755339],"genre_scores_gemma":[0.069534756,0.00032033343,0.0030509746,0.00017471243,0.0009284392,0.0000134520815,0.00007087703,0.000047430163,0.92585903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990679,0.000019671446,0.00019452431,0.00036982985,0.00018159772,0.00016648021],"domain_scores_gemma":[0.9993935,0.000055095454,0.00007946119,0.00038711578,0.000013051071,0.00007172595],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006675384,0.0002159227,0.00019390283,0.00013106252,0.00015105316,0.00018107609,0.0003469299,0.0001630994,0.0018749632],"category_scores_gemma":[0.000005864184,0.00019316103,0.000079810845,0.000031042367,0.00006002926,0.00013790638,0.00012491221,0.0002780149,0.00023862052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027526285,0.000006621727,1.8630209e-7,0.000004673051,0.000011589131,0.000008991484,0.00008260309,0.0000014380087,0.000009870412,0.9213885,0.00017976406,0.07830301],"study_design_scores_gemma":[0.00021324234,0.000094913776,0.000024232508,0.00007621459,0.000031568925,0.000024320441,0.0000027972583,0.030156104,0.0002278348,0.88970876,0.07902802,0.00041198955],"about_ca_topic_score_codex":0.00001785009,"about_ca_topic_score_gemma":0.00002845281,"teacher_disagreement_score":0.62012976,"about_ca_system_score_codex":0.00003360911,"about_ca_system_score_gemma":0.000027617916,"threshold_uncertainty_score":0.99903744},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043720155,0.008543123,0.07844376,0.00042280843,0.0006923852,0.0009417051,0.000036817906,0.00011889974,0.9103633],"genre_scores_gemma":[0.7411657,0.056470998,0.085760355,0.0014873984,0.001237654,0.00075062516,0.000048730468,0.00021446151,0.11286406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799,0.000013470981,0.0006209912,0.00081143866,0.00014432169,0.00041977942],"domain_scores_gemma":[0.9984772,0.0007853888,0.00015265623,0.0004380968,0.000039946604,0.00010667667],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005953538,0.00040191744,0.0007481765,0.0008009046,0.000107682405,0.000036238915,0.00047693693,0.0002249746,0.000080566075],"category_scores_gemma":[0.0000903245,0.00036403586,0.000076801,0.00045027933,0.000736402,0.00016059841,0.00065094,0.0006347293,0.00011363894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009096025,0.000038251594,0.0000059165927,0.00007320502,0.000030433797,0.000006352794,0.00023768064,0.0014462892,7.614563e-7,0.9021963,0.000018141112,0.09593756],"study_design_scores_gemma":[0.0007562995,0.000092626986,0.000017691764,0.000115837356,0.000013659723,0.0000063705984,0.000114605886,0.0031441993,0.000012215683,0.9707872,0.024405204,0.00053406414],"about_ca_topic_score_codex":2.2403647e-7,"about_ca_topic_score_gemma":0.000004030402,"teacher_disagreement_score":0.79749924,"about_ca_system_score_codex":0.00013996789,"about_ca_system_score_gemma":0.00001876496,"threshold_uncertainty_score":0.99988115},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15927425,0.000022326501,0.72928923,0.0011182236,0.00023821187,0.00023509398,7.3363736e-7,0.000088793306,0.10973314],"genre_scores_gemma":[0.9519581,3.480891e-7,0.04777137,0.00012525091,0.000027773433,0.000010779874,4.911429e-8,0.0000015578087,0.00010476295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894017,0.000058166683,0.00018062608,0.00023655448,0.00039383298,0.00019067581],"domain_scores_gemma":[0.9992072,0.00015982316,0.00007737573,0.00043358307,0.00003107087,0.000090943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025646323,0.00006743403,0.00011189519,0.000019052244,0.00012895289,0.00006220651,0.0010139314,0.000032975087,0.000033100463],"category_scores_gemma":[0.00019602623,0.000037055554,0.00004072928,0.0005220557,0.00036070496,0.0001406013,0.00025737166,0.00006674921,0.00003705237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002735432,0.00004695038,0.00002758814,0.0000116775955,0.0000016183532,9.403672e-8,0.00044039555,0.00003454985,0.0007098903,0.9953448,0.00016657908,0.0032131153],"study_design_scores_gemma":[0.00007323308,0.00004147557,0.0002786193,0.000007797149,0.0000037783382,0.000004993509,0.00017714007,0.007670395,0.007927406,0.98349965,0.00025920125,0.000056329645],"about_ca_topic_score_codex":0.000003052981,"about_ca_topic_score_gemma":4.808577e-7,"teacher_disagreement_score":0.79268384,"about_ca_system_score_codex":0.000018549556,"about_ca_system_score_gemma":0.00013408647,"threshold_uncertainty_score":0.18841536},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95842105,0.00045608234,0.039284453,0.0003054818,0.0003995183,0.00020549654,0.000021374384,0.00008137583,0.00082519226],"genre_scores_gemma":[0.97384244,0.00018871216,0.02548715,0.00006392829,0.0001913733,0.000004037001,0.0000021025182,0.000010946011,0.0002093072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987447,0.00006646609,0.00029040486,0.0003402173,0.00026309668,0.000295083],"domain_scores_gemma":[0.998294,0.00027482005,0.00021134634,0.0010151732,0.000063545405,0.00014112888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064535433,0.00015363363,0.00020367884,0.000037083955,0.0008936897,0.00030035927,0.0013602318,0.00006655789,0.000010153314],"category_scores_gemma":[0.00012335018,0.00010256166,0.000082752755,0.000060461498,0.00023803579,0.0007634413,0.00069839845,0.00019684655,0.000009754152],"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.0002192617,0.00037424875,0.012234024,0.00031134032,0.00012947804,0.00010280714,0.0027637284,0.00007597702,0.008601768,0.40510955,0.00009264184,0.56998515],"study_design_scores_gemma":[0.00091460446,0.0002092915,0.03231118,0.00007435142,0.000015487307,0.000021823449,0.00004483505,0.94091946,0.0047572386,0.015895944,0.004553262,0.0002825368],"about_ca_topic_score_codex":0.000116020674,"about_ca_topic_score_gemma":0.000031453354,"teacher_disagreement_score":0.94084346,"about_ca_system_score_codex":0.0000065736176,"about_ca_system_score_gemma":0.00004303597,"threshold_uncertainty_score":0.6873629},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054433346,0.000008120047,0.98947114,0.0026441065,0.00010052377,0.0009452247,0.00006344896,0.0002762977,0.0010477826],"genre_scores_gemma":[0.25860584,0.0000010277669,0.74008465,0.0006105736,0.00013334319,0.00036473357,0.0000062672048,0.000038030026,0.00015555568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984858,0.000022839587,0.00029360343,0.0004063219,0.00027856915,0.0005128678],"domain_scores_gemma":[0.9983259,0.0007407616,0.00020487879,0.00054480374,0.0000805284,0.000103139115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004838486,0.00023177688,0.00027925838,0.00010543952,0.00029907943,0.00009487179,0.0006035181,0.000049892213,0.0000047983062],"category_scores_gemma":[0.000019863515,0.00014248095,0.000083496125,0.000263293,0.0001285093,0.00014744187,0.00016284763,0.00006982536,0.00012513077],"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.000018350453,0.00009899845,2.2698134e-7,0.00013419327,0.000062419866,0.000007511799,0.001126077,0.00015163369,0.015161107,0.9816309,0.00051000214,0.0010985766],"study_design_scores_gemma":[0.014514192,0.0012636672,0.000029356277,0.00348182,0.00047083173,0.00067079964,0.004591632,0.70376664,0.17067592,0.09293677,0.003290767,0.0043075816],"about_ca_topic_score_codex":0.0000012760302,"about_ca_topic_score_gemma":8.2578407e-7,"teacher_disagreement_score":0.8886941,"about_ca_system_score_codex":0.00010955658,"about_ca_system_score_gemma":0.00004330515,"threshold_uncertainty_score":0.5810205},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055975313,0.00018887807,0.9829941,0.00019391048,0.0013734107,0.0008749581,0.00010997849,0.00011938809,0.008547853],"genre_scores_gemma":[0.49202996,0.00009940368,0.50308335,0.000023650013,0.00033448468,0.00016359973,0.000013159805,0.000019414816,0.004232962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983829,0.00006013201,0.00037336163,0.00064726174,0.00025094196,0.00028539915],"domain_scores_gemma":[0.9969801,0.00061923463,0.00062266213,0.001488281,0.00020276343,0.00008699814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006610852,0.00028080677,0.000493349,0.00013312351,0.00019800373,0.00024898513,0.0028603615,0.00020944876,0.00002462969],"category_scores_gemma":[0.00023708165,0.0002294783,0.00031086733,0.00006097646,0.000115382034,0.00028939144,0.0019243723,0.00023375571,0.000018953322],"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.00033290024,0.0011234804,0.0021828539,0.006328708,0.0013568422,0.00005752619,0.016735816,0.0055354806,0.002059479,0.4630233,0.010160857,0.49110276],"study_design_scores_gemma":[0.0010301933,0.00018659842,0.0011038836,0.00031173942,0.00006235002,0.0000043404198,0.00013574288,0.48854524,0.07983799,0.42610663,0.0018140358,0.00086127076],"about_ca_topic_score_codex":0.00028304526,"about_ca_topic_score_gemma":0.000013646966,"teacher_disagreement_score":0.49024147,"about_ca_system_score_codex":0.000025146954,"about_ca_system_score_gemma":0.00014356941,"threshold_uncertainty_score":0.93578535},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046203965,0.0003120014,0.9722591,0.008954627,0.0006455578,0.00067609723,0.00005058481,0.000444389,0.012037234],"genre_scores_gemma":[0.23893623,0.0002245069,0.7524533,0.00038114926,0.00012523419,0.00025088628,0.0003518479,0.00006361486,0.00721319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933573,0.0036527147,0.0006637189,0.0012443708,0.0005067985,0.00057506945],"domain_scores_gemma":[0.99240595,0.0022284517,0.0005764511,0.0031889107,0.0013675058,0.00023273035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0059659127,0.00045379114,0.00053016737,0.00018362621,0.00047308882,0.0009471218,0.0033399644,0.00034992213,0.00006592404],"category_scores_gemma":[0.0009111263,0.00046396078,0.00040184075,0.00031144166,0.00020566086,0.00036978192,0.002078986,0.0006720659,0.00007396227],"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.000026563714,0.0003449964,0.000044811946,0.0002081795,0.000072331044,0.000004437555,0.0037343397,0.0031842014,0.00016349697,0.960435,0.0043268544,0.027454844],"study_design_scores_gemma":[0.0008139418,0.0000028704833,0.00015731472,0.0008262126,0.00004093097,0.000010283955,0.00012400039,0.63468283,0.004974426,0.28074607,0.07676725,0.0008538686],"about_ca_topic_score_codex":0.0003021246,"about_ca_topic_score_gemma":0.00014250194,"teacher_disagreement_score":0.6796889,"about_ca_system_score_codex":0.00010379699,"about_ca_system_score_gemma":0.0005823209,"threshold_uncertainty_score":0.9997812},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041361176,0.0018834627,0.9881241,0.004895701,0.00078719715,0.000112534406,9.061726e-7,0.000025294257,0.00003470709],"genre_scores_gemma":[0.99259645,0.00020459876,0.004360556,0.00018665114,0.0017381487,0.0000067891588,2.3905554e-7,0.000013120224,0.0008934253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987962,0.000092346636,0.00031870513,0.00013018546,0.00025657789,0.00040596144],"domain_scores_gemma":[0.9988724,0.0004588769,0.00024496226,0.00023161118,0.00012841228,0.00006376042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012262333,0.000101584075,0.00015788946,0.000065708846,0.00015504048,0.000048042068,0.0007142669,0.000044056193,0.00009312562],"category_scores_gemma":[0.000093372095,0.000049225164,0.00021960668,0.00013179457,0.000031131956,0.0003885597,0.00004159606,0.0002071234,0.000040617695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006669469,0.00013626904,0.000043701642,0.000013000559,0.00029249012,0.000010298787,0.00021969494,0.00009490117,0.0053650276,0.7500931,0.0036677797,0.23939678],"study_design_scores_gemma":[0.008663276,0.0055252253,0.00047539137,0.00010816728,0.00026723792,0.0013029361,0.00008631001,0.036348794,0.020860188,0.5304898,0.39517272,0.0006999471],"about_ca_topic_score_codex":0.0000012932235,"about_ca_topic_score_gemma":5.921192e-7,"teacher_disagreement_score":0.98846036,"about_ca_system_score_codex":0.00005276315,"about_ca_system_score_gemma":0.00018705126,"threshold_uncertainty_score":0.20073439},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011673188,0.000016532364,0.9333021,0.002888605,0.00014748276,0.000053635573,3.765966e-7,0.00023777856,0.05168031],"genre_scores_gemma":[0.90137804,0.0000021940841,0.097195834,0.00033902892,0.000026033496,0.0000035421153,7.3624574e-7,0.0000026971506,0.0010519115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995205,0.0000061623814,0.00009004746,0.00016167155,0.00010539345,0.000116217234],"domain_scores_gemma":[0.9995727,0.0000350989,0.000021905576,0.00030390156,0.000018312036,0.000048101512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009590855,0.0000481989,0.000043588272,0.000037935104,0.000104290375,0.000094681374,0.00033756995,0.000018309423,0.00008193579],"category_scores_gemma":[0.0000128345055,0.00004091239,0.00003239455,0.0001729353,0.000019471996,0.0003972317,0.000064418804,0.000054574382,0.00017683579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.767196e-7,0.000024268807,0.000021283671,0.0000022671538,0.000003849469,0.000016213882,0.00035767833,0.0015209236,0.0004096647,0.98758733,0.00009576493,0.009960405],"study_design_scores_gemma":[0.00075273606,0.000041696392,0.014938335,0.000020024012,0.0000044927783,0.00007614025,0.0005398585,0.0070414,0.012763742,0.9612436,0.0022458672,0.00033210442],"about_ca_topic_score_codex":0.00004817166,"about_ca_topic_score_gemma":0.0000034605732,"teacher_disagreement_score":0.8897048,"about_ca_system_score_codex":0.000014311121,"about_ca_system_score_gemma":0.00003148689,"threshold_uncertainty_score":0.22729254},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68251956,0.00049899775,0.31643787,0.00014455138,0.00011866562,0.00003687769,0.000011332282,0.000008147007,0.00022401211],"genre_scores_gemma":[0.99566305,0.000019680303,0.0040631304,0.000066520246,0.00009024758,4.027052e-7,0.000005903287,0.0000036923218,0.00008736318],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988606,0.0001414934,0.00040592495,0.000101254,0.0003202613,0.00017044674],"domain_scores_gemma":[0.9987152,0.00017334541,0.0005723583,0.00015307807,0.00026900176,0.000116966105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009952631,0.00010533135,0.00042325415,0.00036983786,0.00006878742,0.000047090485,0.00021471798,0.000043146858,0.00007595593],"category_scores_gemma":[0.000030300176,0.00007429376,0.00017307785,0.0011513006,0.00005127189,0.00047481037,0.000055249122,0.0001480002,8.0715216e-7],"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.00028225002,0.0013894215,0.93513805,0.00008439934,0.011723839,0.000024106377,0.0013476101,0.0007414715,0.00060704857,0.011782605,0.00019777431,0.036681406],"study_design_scores_gemma":[0.006226477,0.0020581407,0.6646714,0.00018722944,0.01119408,0.00015296684,0.0017120132,0.30085438,0.0054815616,0.0012316386,0.0052573076,0.00097276823],"about_ca_topic_score_codex":0.000019752704,"about_ca_topic_score_gemma":0.000009457604,"teacher_disagreement_score":0.31314352,"about_ca_system_score_codex":0.000019888024,"about_ca_system_score_gemma":0.00003179694,"threshold_uncertainty_score":0.30296117},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010071238,0.00023523415,0.94512033,0.01932276,0.00049251586,0.0004961694,0.000024502753,0.00055537676,0.023681872],"genre_scores_gemma":[0.45571217,0.00015973792,0.534875,0.0008470965,0.00009855972,0.00016230773,0.0003078516,0.00005905685,0.007778266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9911578,0.0058360924,0.000631045,0.0012393302,0.00065476797,0.00048092776],"domain_scores_gemma":[0.99221534,0.002098239,0.00054869975,0.0038155345,0.00093472475,0.00038747236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004648926,0.00044859076,0.00044365803,0.00025454757,0.0005413095,0.0004766833,0.0033564542,0.0003446059,0.00007791556],"category_scores_gemma":[0.0015249266,0.00046021046,0.0002951152,0.0004670499,0.0002995784,0.00021385276,0.0027285796,0.0010344302,0.0002641392],"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.000020717975,0.0006535314,0.00014066696,0.00012606887,0.00006594333,0.000012046923,0.005586582,0.0060783117,0.00012043263,0.9574845,0.0044580824,0.02525312],"study_design_scores_gemma":[0.00070031895,0.000004984094,0.0011245162,0.0017463489,0.0000464973,0.000019108862,0.000044342054,0.83941275,0.012621023,0.11230758,0.03098985,0.0009826783],"about_ca_topic_score_codex":0.00017285168,"about_ca_topic_score_gemma":0.000025160425,"teacher_disagreement_score":0.84517694,"about_ca_system_score_codex":0.00011373512,"about_ca_system_score_gemma":0.00036723187,"threshold_uncertainty_score":0.99978495},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03716085,0.00020701032,0.9603065,0.000018134484,0.0001357003,0.00023318201,0.000003956843,0.000028940052,0.0019056834],"genre_scores_gemma":[0.60712004,0.00000611811,0.39269572,0.0000096655895,0.000014622528,0.0000033468143,0.0000010366933,0.0000016886879,0.00014779468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983957,0.000551845,0.00039282942,0.00015711553,0.00040850852,0.00009400902],"domain_scores_gemma":[0.9984429,0.00020513419,0.00026850306,0.00035620792,0.0006998947,0.000027351187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003383306,0.00008250865,0.0002535204,0.000092958966,0.000029506618,0.000009848387,0.00038228565,0.00004126094,0.000028652761],"category_scores_gemma":[0.00014908571,0.000064462794,0.00005250464,0.0003190466,0.000034817465,0.00031241568,0.000036799338,0.000047148613,0.0000020056596],"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.00006427621,0.0003261277,0.00039964035,0.0003834457,0.0000799735,8.205281e-7,0.0051732794,0.061938826,0.032432694,0.14274131,0.00016706453,0.7562926],"study_design_scores_gemma":[0.00023699345,0.00028971152,0.0005551631,0.00007822791,0.000015062854,0.0000022363668,0.000039310722,0.78189653,0.21549535,0.0012992752,0.000029468027,0.000062696556],"about_ca_topic_score_codex":0.000006539132,"about_ca_topic_score_gemma":8.740102e-8,"teacher_disagreement_score":0.7562299,"about_ca_system_score_codex":0.000014396594,"about_ca_system_score_gemma":0.000086964945,"threshold_uncertainty_score":0.26287165},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13432795,0.00022940061,0.84606606,0.0005642126,0.0008631796,0.0007573361,0.00006906408,0.0003946717,0.01672814],"genre_scores_gemma":[0.88161993,0.00025739468,0.09489434,0.00008627225,0.00019539904,9.1414717e-7,0.000006082841,0.00003821012,0.022901466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972706,0.0007094317,0.0003194348,0.0009101313,0.000296393,0.000494035],"domain_scores_gemma":[0.99666405,0.0013518846,0.0004886183,0.000830725,0.00035035968,0.00031437573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067878206,0.00036259124,0.0005746894,0.00084042706,0.0006024065,0.00006752357,0.0015268596,0.0002615535,0.000014924975],"category_scores_gemma":[0.0000881536,0.00034260837,0.00028167668,0.00091657817,0.00032690814,0.0011010586,0.0005628147,0.00017632743,0.0000088469515],"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.0017659374,0.0006085349,0.0025423812,0.00032603994,0.0005204799,0.00040726914,0.00095935346,0.000051617833,0.19509411,0.7021342,0.0014288481,0.09416126],"study_design_scores_gemma":[0.020438392,0.0042791497,0.013297722,0.0013510261,0.0009243519,0.00030108963,0.0028181956,0.014178483,0.32804275,0.009713671,0.600584,0.0040711714],"about_ca_topic_score_codex":0.00007620436,"about_ca_topic_score_gemma":0.000007101127,"teacher_disagreement_score":0.7511717,"about_ca_system_score_codex":0.0003793606,"about_ca_system_score_gemma":0.00023918472,"threshold_uncertainty_score":0.9999026},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020976383,0.00040273782,0.959718,0.035138324,0.0001406111,0.0004779877,0.000020970943,0.00007437864,0.0019293632],"genre_scores_gemma":[0.1431445,0.000065843844,0.8472404,0.0026647148,0.00052071357,0.00041492793,0.0000044433773,0.00007007204,0.0058743986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812716,0.0002878296,0.00036990285,0.00044469087,0.00014770526,0.0006227327],"domain_scores_gemma":[0.99455214,0.0042241593,0.00009536368,0.00049783697,0.00008136049,0.00054912834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019443828,0.0002012238,0.00027948365,0.000080667756,0.0005148966,0.00038981275,0.00068182347,0.00009736519,0.0002537045],"category_scores_gemma":[0.0012048497,0.00010857046,0.00010363442,0.00015583147,0.00019719811,0.00008178219,0.00011871713,0.00012031622,0.00035753803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041534086,0.000010460645,0.0000038856774,0.00004613936,0.000023021255,0.000013782968,0.00025582127,8.493175e-8,0.00020866348,0.8817793,0.0014891834,0.116165504],"study_design_scores_gemma":[0.00042523665,0.00006923377,0.00008837815,0.00017663889,0.000022421033,0.00011540792,0.000067325935,0.012106076,0.000513966,0.7149993,0.27107915,0.00033685294],"about_ca_topic_score_codex":0.00004391375,"about_ca_topic_score_gemma":0.000037519025,"teacher_disagreement_score":0.26959,"about_ca_system_score_codex":0.0000955792,"about_ca_system_score_gemma":0.00015224169,"threshold_uncertainty_score":0.4595547},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023450183,0.000016358274,0.87300575,0.07442503,0.00024187595,0.00024742345,0.000058226036,0.000095604926,0.02845956],"genre_scores_gemma":[0.87865335,0.000014706024,0.084901474,0.006421559,0.0001721888,0.00004524247,0.0000052388264,0.000028928982,0.029757302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992374,0.00005296192,0.000216861,0.00015858292,0.00010638118,0.00022781947],"domain_scores_gemma":[0.9991047,0.0001371145,0.00005138272,0.00036879853,0.000050302137,0.00028773097],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00019308546,0.0000847388,0.00014892756,0.00009988728,0.000050340506,0.000030940995,0.00045587803,0.00004647862,0.009895564],"category_scores_gemma":[0.00018201754,0.00005626685,0.000054142714,0.00011566757,0.000076435375,0.00006595751,0.000050785944,0.000031922464,0.0045469017],"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.000001071609,0.000017654284,0.000013697321,0.000021739917,0.000009628929,0.000017196577,0.00017476662,2.7344487e-7,0.0012575886,0.9802309,0.013751594,0.0045038345],"study_design_scores_gemma":[0.00079396873,0.00006196293,0.00016787433,0.00024340439,0.00001550619,0.00005890016,0.000028286131,0.001551612,0.008509291,0.2581669,0.7299481,0.00045417636],"about_ca_topic_score_codex":0.00007589942,"about_ca_topic_score_gemma":0.000047995658,"teacher_disagreement_score":0.85520315,"about_ca_system_score_codex":0.000029894461,"about_ca_system_score_gemma":0.00010441022,"threshold_uncertainty_score":0.99622816},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40001446,0.00016330254,0.34975547,0.030280575,0.00056773657,0.00066194497,0.00004718001,0.0003090945,0.21820022],"genre_scores_gemma":[0.9601601,0.000001049708,0.031901155,0.0011480137,0.00023228748,0.000010928771,6.923327e-7,0.000011422788,0.0065343957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902576,0.00006321412,0.00015714424,0.0002591615,0.000109990426,0.00038475532],"domain_scores_gemma":[0.99885345,0.00018251213,0.00003133689,0.00034982213,0.000041858708,0.0005410192],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004761718,0.00011364408,0.00016667212,0.00007511223,0.00020238318,0.00017574451,0.0003167069,0.00006043952,0.0053078732],"category_scores_gemma":[0.00022016362,0.00010137405,0.000029166411,0.00012783057,0.0001805926,0.00008201208,0.000102795515,0.00008701872,0.0063912333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031988625,0.000029567202,0.000016735248,0.000041010233,0.000013127391,0.00004268239,0.0006183449,4.1499416e-7,0.0001469248,0.96499926,0.021544563,0.012544161],"study_design_scores_gemma":[0.0008499422,0.00035696552,0.00085994316,0.00014656862,0.000021934073,0.0004658625,0.00014857626,0.02413702,0.006360536,0.64975405,0.31583506,0.001063523],"about_ca_topic_score_codex":0.0006500329,"about_ca_topic_score_gemma":0.00031815236,"teacher_disagreement_score":0.5601456,"about_ca_system_score_codex":0.000040888433,"about_ca_system_score_gemma":0.0001151147,"threshold_uncertainty_score":0.9956014},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6755947,0.00023602195,0.30571127,0.00056173163,0.00078001386,0.0005184817,0.000068671674,0.00019908094,0.01633003],"genre_scores_gemma":[0.98343277,0.0000917914,0.00393689,0.000013801262,0.000043043354,8.094734e-8,8.8458404e-7,0.000011169119,0.012469586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979831,0.0004814136,0.0002977985,0.0005264333,0.00038636578,0.00032487084],"domain_scores_gemma":[0.9980358,0.00027566988,0.00053243735,0.00068859255,0.00030827243,0.00015923489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003139705,0.00023991567,0.00040791876,0.00040117942,0.0004399252,0.000032843564,0.0013816415,0.00017013641,0.000012636771],"category_scores_gemma":[0.00003191809,0.00019544331,0.00022247889,0.0009659249,0.0005328858,0.0009359017,0.0008863017,0.00014227425,0.0000052655105],"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.0009448081,0.0007630947,0.044697672,0.0006042176,0.00087683095,0.00045771783,0.0045293584,0.0010956387,0.27204233,0.6420443,0.0017297522,0.03021427],"study_design_scores_gemma":[0.017130556,0.0019754062,0.05784157,0.0022208223,0.0011349595,0.00044129952,0.008336381,0.016058564,0.80016404,0.011307731,0.0796307,0.003757947],"about_ca_topic_score_codex":0.00014767224,"about_ca_topic_score_gemma":0.000009784032,"teacher_disagreement_score":0.6307366,"about_ca_system_score_codex":0.00021064834,"about_ca_system_score_gemma":0.00028627127,"threshold_uncertainty_score":0.7969947},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60902226,0.0001737625,0.38961402,0.00051177084,0.000037304646,0.0002584912,0.00020562534,0.00008081968,0.000095954085],"genre_scores_gemma":[0.96435434,0.000020721935,0.035269845,0.000035634566,0.00017902108,0.00001698828,0.000009380581,0.000008988802,0.000105103725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990908,0.000057183664,0.00019885325,0.00033563504,0.00011980652,0.00019770488],"domain_scores_gemma":[0.9993047,0.00009969866,0.000081984326,0.00030727414,0.000059284557,0.00014703795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015598527,0.00013024885,0.00015975263,0.0000672221,0.00017606167,0.000057931025,0.00021861428,0.00007099173,0.000034887125],"category_scores_gemma":[0.000016429665,0.00009738168,0.000031041283,0.00017802592,0.0000798902,0.00047137143,0.00014920773,0.000091232454,0.0000063298207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002430933,0.000074338124,0.000085359374,0.00003321173,0.000022039712,0.000008273434,0.00040151927,0.000029042541,0.019824477,0.89952457,0.00001168312,0.07996119],"study_design_scores_gemma":[0.0040608193,0.0011981631,0.008102111,0.00012075447,0.0001274017,0.0012484606,0.00031901122,0.30216098,0.14560376,0.5335945,0.0019258151,0.0015382651],"about_ca_topic_score_codex":0.000005069324,"about_ca_topic_score_gemma":0.0000024375354,"teacher_disagreement_score":0.3659301,"about_ca_system_score_codex":0.000009539595,"about_ca_system_score_gemma":0.000036799516,"threshold_uncertainty_score":0.39711097},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041748113,0.000026576403,0.9935521,0.0013119435,0.00018015529,0.00003664277,0.00003821299,0.0000059042573,0.0006736377],"genre_scores_gemma":[0.97232544,0.000011655391,0.027281538,0.00007624305,0.00020521042,4.818096e-7,1.07780686e-7,0.000004745569,0.00009457131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990445,0.000090583475,0.00028283568,0.00008581581,0.0003545538,0.00014175531],"domain_scores_gemma":[0.99797124,0.001383439,0.00025325108,0.00021382545,0.000109319386,0.00006890973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031895895,0.000078618585,0.00017194194,0.00001772131,0.00004269048,0.000029154815,0.000507249,0.000016555774,0.00006846873],"category_scores_gemma":[0.0001818789,0.00003587196,0.00007904697,0.00012503481,0.00011704657,0.00017462793,0.000041589767,0.00013210077,0.000022554963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000344557,0.000075954165,0.000013700801,0.00001018029,0.000016734592,0.000024461497,0.000064430074,0.000018412116,0.00046752294,0.9811694,0.0016423963,0.016462347],"study_design_scores_gemma":[0.00026650928,0.000324824,0.00030036113,0.00009332463,0.000008777487,0.000015448626,0.000010519922,0.0015304316,0.0022531645,0.9947648,0.0003678491,0.00006400908],"about_ca_topic_score_codex":5.131849e-7,"about_ca_topic_score_gemma":1.12638205e-7,"teacher_disagreement_score":0.9681506,"about_ca_system_score_codex":0.000024384623,"about_ca_system_score_gemma":0.00004879094,"threshold_uncertainty_score":0.1462816},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01132729,0.00031186765,0.979101,0.0064061927,0.00005746637,0.0002387198,0.000017448243,0.00020882781,0.0023312117],"genre_scores_gemma":[0.96720195,0.0004160413,0.026710693,0.0020362146,0.0004650473,0.00016036344,0.0000055859437,0.000018311905,0.002985806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992664,0.000022643022,0.00014246996,0.00030248973,0.00009179547,0.00017423816],"domain_scores_gemma":[0.9993143,0.00011526157,0.000039918796,0.00039016388,0.000041161355,0.000099194636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009530078,0.000094522555,0.00008935641,0.00004666958,0.00016648907,0.00004034997,0.00035996374,0.00003963452,0.00007034165],"category_scores_gemma":[0.000011533766,0.00006280769,0.000036430374,0.0001724903,0.000033984783,0.00024865483,0.00012428098,0.00006393671,0.00039103988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.293613e-7,0.00004650445,0.0000425636,0.0000059806043,0.00000784756,0.0000025389045,0.0000555874,2.8326642e-7,0.0054553235,0.8430316,0.00034045544,0.15101047],"study_design_scores_gemma":[0.0013063381,0.00018674645,0.007643959,0.000096005686,0.000039866165,0.00019131224,0.000032475513,0.02310254,0.04107656,0.5642792,0.36098298,0.0010620235],"about_ca_topic_score_codex":0.0000013728908,"about_ca_topic_score_gemma":8.562023e-7,"teacher_disagreement_score":0.9558746,"about_ca_system_score_codex":0.0000052009395,"about_ca_system_score_gemma":0.00002295858,"threshold_uncertainty_score":0.5026157},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005720845,0.000032682292,0.99832755,0.00015229893,0.0001109149,0.00069064536,0.0000012404587,0.0000805931,0.000031983735],"genre_scores_gemma":[0.049850497,0.00000671648,0.9499393,0.000037437017,0.000043009622,0.00010499012,4.74832e-7,0.000015338075,0.0000022115887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886847,0.000086139575,0.00030298912,0.00037395282,0.0001373606,0.00023107456],"domain_scores_gemma":[0.9990948,0.000281464,0.00011374533,0.00040112573,0.000041374693,0.000067513116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019021048,0.00017523134,0.00024974433,0.00015252022,0.000052629322,0.000053469117,0.0004249169,0.00006542359,7.3507726e-7],"category_scores_gemma":[0.000011591352,0.00010629157,0.00002544972,0.0004982597,0.000012328363,0.000105660474,0.00022759609,0.00011339672,3.9074916e-7],"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.0000031451711,0.00001148938,7.0409453e-7,0.000077667704,0.000010334757,2.5598774e-7,0.00040273115,0.08035426,0.15409619,0.52341205,5.3435286e-7,0.24163066],"study_design_scores_gemma":[0.00029568575,0.000046003966,0.000005365315,0.000114803945,0.0000069795797,0.000018535544,0.000012929057,0.94502056,0.017301539,0.036746744,0.00026705145,0.00016380058],"about_ca_topic_score_codex":0.000002454723,"about_ca_topic_score_gemma":5.5135376e-7,"teacher_disagreement_score":0.8646663,"about_ca_system_score_codex":0.00002799599,"about_ca_system_score_gemma":0.000019818888,"threshold_uncertainty_score":0.43344444},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08954854,0.0001925231,0.89625114,0.00019376454,0.0003556206,0.00009117875,4.806652e-7,0.00005709783,0.013309642],"genre_scores_gemma":[0.8879886,0.00003073541,0.11036263,0.000056464884,0.000029394101,0.000008122826,1.8253532e-7,0.0000037634452,0.0015200742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992154,0.00023471184,0.00015088772,0.00013549476,0.00013032918,0.00013312882],"domain_scores_gemma":[0.9991832,0.00016850771,0.000042360847,0.00051652413,0.00005751187,0.00003190758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009980004,0.00005498232,0.00008041515,0.000011184887,0.00012643453,0.00004385946,0.0005006013,0.000018742672,0.000104309336],"category_scores_gemma":[0.000077658755,0.000030746105,0.00004692326,0.00016627497,0.000070097296,0.00011494271,0.000058956444,0.00003643767,0.0000054524317],"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.0000018478163,0.000021230757,0.00006983829,0.0000036913484,0.0000046738924,2.4762312e-7,0.00006836193,0.00026909928,0.00023503057,0.9946178,0.000108012086,0.004600176],"study_design_scores_gemma":[0.00083003595,0.000106823165,0.0005742923,0.0000075824382,0.000009636973,0.000016682108,0.00027860972,0.20388338,0.4361255,0.32563382,0.032143213,0.00039040664],"about_ca_topic_score_codex":0.0000061728515,"about_ca_topic_score_gemma":0.0000035049507,"teacher_disagreement_score":0.7984401,"about_ca_system_score_codex":0.00000630421,"about_ca_system_score_gemma":0.000037914477,"threshold_uncertainty_score":0.12537898},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30433333,0.0036494082,0.68165344,0.0017298989,0.00018624337,0.0007886338,0.000046218764,0.00029222795,0.0073206117],"genre_scores_gemma":[0.96206,0.0002543129,0.036033023,0.00033748537,0.00042436668,0.00007259791,0.0000073109895,0.000009486257,0.00080141297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936247,0.000028099175,0.0001772673,0.00021372939,0.00009330811,0.00012513089],"domain_scores_gemma":[0.999341,0.000064124426,0.000057518413,0.0003320555,0.00012686387,0.000078439785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015502729,0.0000795035,0.00010516918,0.00007099512,0.00017702709,0.000038435013,0.0004032025,0.000041917992,0.000074168296],"category_scores_gemma":[0.00001303563,0.000067693465,0.000025369352,0.00048152625,0.00008192514,0.00024400598,0.00013944884,0.00006236524,0.00019418451],"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.000004050991,0.000062743326,0.000074438685,0.000030830473,0.000015613341,4.2557218e-7,0.00027606127,0.0000036051965,0.0042096367,0.9754857,0.00027579535,0.019561093],"study_design_scores_gemma":[0.0013114148,0.00051108183,0.0017766386,0.00007952986,0.00007821196,0.000038314898,0.00016380972,0.18765098,0.23741429,0.09019057,0.47990766,0.0008775199],"about_ca_topic_score_codex":0.0000042000433,"about_ca_topic_score_gemma":8.225442e-7,"teacher_disagreement_score":0.88529515,"about_ca_system_score_codex":0.0000026965988,"about_ca_system_score_gemma":0.0000285215,"threshold_uncertainty_score":0.27604595},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047908314,0.000050763152,0.94691056,0.00016720576,0.00007559696,0.00032960364,0.0000052354467,0.000039428516,0.0045132795],"genre_scores_gemma":[0.81407,0.000001133644,0.18555579,0.000046169927,0.000009400349,0.00003199972,1.7475175e-7,0.0000039510915,0.0002813743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990678,0.00012708992,0.0002952326,0.00020840453,0.00016636211,0.000135133],"domain_scores_gemma":[0.9989572,0.000195899,0.00016116907,0.00047929742,0.00014685282,0.000059566286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007671213,0.00009044511,0.0002187086,0.00006836864,0.000026425978,0.00001347283,0.0003772756,0.000032238964,0.000047698228],"category_scores_gemma":[0.000017419985,0.000049231523,0.000026447104,0.0002121688,0.000047531954,0.00032032764,0.000043058008,0.000036428737,0.000017095545],"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.00006483943,0.00008497368,0.0011022369,0.0001823474,0.000048726928,9.4213385e-7,0.0004850921,0.00013900793,0.19098172,0.6866541,0.000034205106,0.120221846],"study_design_scores_gemma":[0.0060855807,0.0058270725,0.013901367,0.00074676407,0.00007770203,0.00015018284,0.00026843447,0.22700305,0.72974277,0.012369226,0.0024751332,0.0013527384],"about_ca_topic_score_codex":0.000017234132,"about_ca_topic_score_gemma":8.203596e-7,"teacher_disagreement_score":0.7661617,"about_ca_system_score_codex":0.000015512014,"about_ca_system_score_gemma":0.00008006469,"threshold_uncertainty_score":0.20076032},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49108836,0.00030842918,0.5072747,0.0007169473,0.00031808688,0.000086150605,0.0000012870472,0.000012372069,0.00019365581],"genre_scores_gemma":[0.9128965,0.000024868472,0.08667443,0.000035157173,0.00028336435,0.0000012700743,3.4913995e-7,0.0000053018525,0.00007877412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993402,0.000036139096,0.00023102906,0.00011056003,0.00016523594,0.00011686517],"domain_scores_gemma":[0.9989486,0.00011916573,0.00053717365,0.00014866647,0.00016826382,0.000078181685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065994513,0.0000750632,0.00016834658,0.00010967609,0.00033692288,0.00039890214,0.0003733401,0.000028851768,0.0000024400852],"category_scores_gemma":[0.00006507869,0.00006208948,0.00006216867,0.000055371478,0.00003749114,0.000389644,0.00006973604,0.000058114776,0.000006340221],"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.00016867106,0.00043496862,0.00043175224,0.00020663919,0.00022312318,0.000065687884,0.0053780256,0.19199324,0.0058576944,0.13999069,0.0052837403,0.64996576],"study_design_scores_gemma":[0.00074303814,0.00019045407,0.0014916641,0.000046350066,0.000021401946,0.000115815295,0.000024161773,0.97584206,0.0021459754,0.018481227,0.00077893556,0.00011893279],"about_ca_topic_score_codex":0.00000264411,"about_ca_topic_score_gemma":1.727269e-7,"teacher_disagreement_score":0.7838488,"about_ca_system_score_codex":0.000018019264,"about_ca_system_score_gemma":0.000048793587,"threshold_uncertainty_score":0.38466227},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9875332,0.000042740405,0.002556608,0.002292852,0.0018946803,0.00012983377,0.0000048369207,0.00007825045,0.005466958],"genre_scores_gemma":[0.9975222,0.000020806963,0.00094013655,0.00040730587,0.000018200823,0.000009709483,2.961984e-7,0.0000068784725,0.0010745148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990495,0.00012820285,0.00017063698,0.00020928045,0.0002413267,0.00020105031],"domain_scores_gemma":[0.998737,0.0004785949,0.000099771285,0.00057390594,0.000044058692,0.00006667973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004086841,0.000105344,0.00012091379,0.00006239179,0.00008626591,0.000030395511,0.0009497686,0.000043206797,0.0001093283],"category_scores_gemma":[0.00008256933,0.00005553349,0.00007878528,0.00027669853,0.00008556939,0.00019147109,0.00017235334,0.000076787495,0.0002293675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005208983,0.00004855435,0.00013455113,0.0000027754213,0.000010774591,0.000005027619,0.0000704377,0.0000024093515,0.0012153776,0.9877389,0.006738997,0.0040269783],"study_design_scores_gemma":[0.00047570455,0.00009254385,0.00057032274,0.000021965363,0.0000035965927,0.0000041184053,0.0000038490966,0.0011319993,0.012001483,0.98324984,0.0023351773,0.00010942436],"about_ca_topic_score_codex":0.000010674916,"about_ca_topic_score_gemma":9.551466e-7,"teacher_disagreement_score":0.010786106,"about_ca_system_score_codex":0.00002494501,"about_ca_system_score_gemma":0.000040231072,"threshold_uncertainty_score":0.29481316},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99094296,0.000033614953,0.0037631954,0.00021285226,0.000690092,0.00008664389,0.0000031102652,0.00009265929,0.0041748704],"genre_scores_gemma":[0.9988373,0.000007817153,0.00078534015,0.000058750113,0.000006791762,0.0000030457375,3.6769995e-7,0.0000076064107,0.0002929984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906164,0.00008661738,0.00014293822,0.00022965187,0.00028898614,0.00019017736],"domain_scores_gemma":[0.99897224,0.00030078625,0.00011544165,0.00047987723,0.000060345614,0.000071334514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028888034,0.000114539456,0.00014371148,0.00006875967,0.00008010277,0.00004686632,0.0006555257,0.00004055806,0.000041932904],"category_scores_gemma":[0.000036978658,0.00006930572,0.000036941557,0.00025910884,0.000047254303,0.00045989544,0.00013709806,0.00007921735,0.000041950654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017158338,0.00009026296,0.00090691657,0.000011702743,0.000012335462,0.000012946221,0.00009005319,0.000003771193,0.0008551439,0.9944018,0.00034241617,0.0032554667],"study_design_scores_gemma":[0.0012586485,0.000429396,0.0076552033,0.0001387168,0.000008493664,0.000009373811,0.000011102025,0.00030462348,0.012205347,0.97698,0.00078258617,0.00021651408],"about_ca_topic_score_codex":0.000015227663,"about_ca_topic_score_gemma":0.0000013170508,"teacher_disagreement_score":0.017421832,"about_ca_system_score_codex":0.000028515446,"about_ca_system_score_gemma":0.000034809524,"threshold_uncertainty_score":0.28262052},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032534658,0.00046941423,0.9591574,0.036528703,0.000076047414,0.00022751954,0.000018014227,0.00007342418,0.00019599912],"genre_scores_gemma":[0.0053205737,0.000100345795,0.87221897,0.000016290436,0.00003345159,0.0000032997643,0.0005593986,0.000026944697,0.121720746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988136,0.00025433372,0.000023483337,0.00044569603,0.0002604809,0.0002023553],"domain_scores_gemma":[0.9979141,0.00051266176,0.000548694,0.0004119684,0.00047880993,0.0001337899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080868613,0.00018799517,0.0005237315,0.0005491618,0.00025081742,0.00005645452,0.00063745707,0.00019517634,0.0000025125833],"category_scores_gemma":[0.00019050078,0.00020278405,0.00017520337,0.0018321341,0.00007039431,0.00036641315,0.0000641532,0.00013927126,0.0000015855687],"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.00066679186,0.00048576275,0.0008818539,0.0009609331,0.013845131,0.00009323008,0.019784166,0.0016077672,0.00034722118,0.36639646,0.11530903,0.47962165],"study_design_scores_gemma":[0.003902649,0.0014972053,0.0036857869,0.0004893874,0.012998508,0.000010717092,0.021520067,0.5906207,0.00033768232,0.012612548,0.35002425,0.0023004792],"about_ca_topic_score_codex":0.0000158612,"about_ca_topic_score_gemma":0.0001645908,"teacher_disagreement_score":0.589013,"about_ca_system_score_codex":0.000068917536,"about_ca_system_score_gemma":0.00020195097,"threshold_uncertainty_score":0.82692933},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8855787,0.000833164,0.1121248,0.0008660525,0.00012814724,0.00006758061,0.0000050572635,0.0000086313585,0.0003878611],"genre_scores_gemma":[0.98914033,0.0001101339,0.01034441,0.000096319935,0.00006803669,0.0000010688276,0.0000011630169,0.000004067602,0.00023444432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985512,0.00015319149,0.0006904302,0.00016385941,0.00027877677,0.00016257474],"domain_scores_gemma":[0.99856347,0.0002524611,0.0004668104,0.0002433745,0.000327089,0.00014677702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008480148,0.000115566436,0.000547946,0.0010590113,0.000052145093,0.0000783642,0.0003766207,0.00005981888,0.00019539546],"category_scores_gemma":[0.00009062697,0.000091499445,0.00028137915,0.0025000926,0.00008291651,0.00048903516,0.000066627836,0.00023693008,0.000012258635],"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.00025338243,0.0037428623,0.30541196,0.00032650956,0.010220515,0.00038974392,0.004707748,0.003860426,0.0050111953,0.122296475,0.0014874567,0.5422917],"study_design_scores_gemma":[0.0033958748,0.0008948167,0.16427384,0.000085337786,0.0016778057,0.00028251982,0.0014312516,0.7960842,0.0033687542,0.025334295,0.0025085523,0.00066271896],"about_ca_topic_score_codex":0.00010216631,"about_ca_topic_score_gemma":0.000017533186,"teacher_disagreement_score":0.7922238,"about_ca_system_score_codex":0.000015619158,"about_ca_system_score_gemma":0.000062647036,"threshold_uncertainty_score":0.3731239},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8993722,0.000051091414,0.06847633,0.013726306,0.00013252722,0.00048051344,0.000013561032,0.00019104121,0.0175564],"genre_scores_gemma":[0.8677617,0.000010914661,0.1317149,0.00032615816,0.00005097632,0.00000791656,6.775645e-8,0.000009210245,0.000118213444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989532,0.000008693946,0.00020856549,0.0002640223,0.00029633066,0.00026913622],"domain_scores_gemma":[0.9989062,0.00010513296,0.00046260838,0.0003540863,0.00006690239,0.00010507943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004333905,0.00014211504,0.00034750445,0.000009191218,0.0004665061,0.00025308394,0.0016791517,0.000026536462,0.000011152665],"category_scores_gemma":[0.00018492927,0.00009116752,0.00022225213,0.00012615688,0.00097417674,0.000324484,0.0009184756,0.00017447319,0.000010371627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014530449,0.0001603163,0.004855424,0.0002651164,0.00009196564,7.759603e-7,0.0027128286,4.503247e-7,0.005747048,0.97350127,0.002065454,0.010584806],"study_design_scores_gemma":[0.0005836048,0.0001902889,0.04359878,0.00012693784,0.00005416302,0.00009123505,0.00054931635,0.0842629,0.003039926,0.86613184,0.0009218211,0.00044919358],"about_ca_topic_score_codex":0.000010656825,"about_ca_topic_score_gemma":3.6587945e-8,"teacher_disagreement_score":0.107369445,"about_ca_system_score_codex":0.000016624977,"about_ca_system_score_gemma":0.000011047002,"threshold_uncertainty_score":0.37177038},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055280633,0.0005858489,0.90682477,0.006960479,0.0002610152,0.0002335021,0.00000872172,0.0003812787,0.029463744],"genre_scores_gemma":[0.99257094,0.00031732544,0.0064057745,0.0001437005,0.00003724099,0.000020101555,0.000002657703,0.000009337791,0.00049292395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988796,0.000014421576,0.0002959119,0.00033706528,0.0002292709,0.00024373471],"domain_scores_gemma":[0.99934447,0.000100021294,0.00010981825,0.00030930442,0.00009274463,0.0000436172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013395533,0.00014869007,0.00017048257,0.0006827439,0.00010330629,0.00004362054,0.0007887719,0.00015502503,0.000036801095],"category_scores_gemma":[0.00003807534,0.0001479154,0.000043481552,0.0009690798,0.00010438194,0.00008246101,0.00014142004,0.00024682496,0.000040535844],"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.000005722256,0.00012142286,0.000018060466,0.000005148996,0.00002469864,0.0000032450623,0.000049093003,0.0003277589,0.054804765,0.9348474,0.000016533042,0.009776135],"study_design_scores_gemma":[0.00044770687,0.00036158803,0.00000997185,0.000015129247,0.000011761604,0.000045113728,0.000020509213,0.8480765,0.010083459,0.14040327,0.00033531693,0.00018962458],"about_ca_topic_score_codex":0.0000015424822,"about_ca_topic_score_gemma":4.1802858e-7,"teacher_disagreement_score":0.9372903,"about_ca_system_score_codex":0.000026048116,"about_ca_system_score_gemma":0.000008373732,"threshold_uncertainty_score":0.6031815},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03522293,0.0012469742,0.9203458,0.03435667,0.0009399728,0.00085798575,0.000046981742,0.0006221893,0.006360486],"genre_scores_gemma":[0.9846114,0.0005646352,0.012563122,0.00052467926,0.00016196028,0.00017751606,0.0000148102035,0.00001670095,0.0013652054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844956,0.000018343351,0.00033301773,0.00050755613,0.00025916498,0.0004323294],"domain_scores_gemma":[0.9990724,0.00027562812,0.00015409254,0.00032012913,0.00010752133,0.00007027129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021749649,0.00022343034,0.00020567585,0.0007664564,0.00031604577,0.00014545946,0.0008678027,0.00019581158,0.000019319015],"category_scores_gemma":[0.00007770757,0.00021690088,0.00007355373,0.00082852243,0.00015197405,0.00018074797,0.00016435776,0.00027045736,0.000054832242],"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.000024693965,0.00018600344,0.000009440181,0.0000068543923,0.000034490604,0.00000467672,0.000026511272,0.000012914072,0.08094368,0.90061235,0.00021477818,0.017923616],"study_design_scores_gemma":[0.0024532005,0.002233075,0.00010857765,0.00003243944,0.000054607437,0.00015708662,0.000027029926,0.48466533,0.043501135,0.4502949,0.015753938,0.0007186402],"about_ca_topic_score_codex":0.0000014204842,"about_ca_topic_score_gemma":0.0000011260856,"teacher_disagreement_score":0.94938844,"about_ca_system_score_codex":0.000077225406,"about_ca_system_score_gemma":0.000018501229,"threshold_uncertainty_score":0.88449615},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9625888,0.000045415276,0.0038913426,0.0020964397,0.0031986893,0.00024753655,0.0000031674983,0.0002473025,0.027681315],"genre_scores_gemma":[0.9933109,0.000004104149,0.0058114333,0.00019192448,0.000013766507,0.00000916417,9.693412e-7,0.000010918871,0.0006467872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989288,0.000058787613,0.00011347852,0.00036449166,0.00023852626,0.00029592312],"domain_scores_gemma":[0.9982606,0.0001056122,0.00012901436,0.0013577482,0.000027021628,0.0001199869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021888578,0.00015779807,0.00017305928,0.000050190665,0.00046058503,0.00044106838,0.0016263545,0.000049328137,0.000020583042],"category_scores_gemma":[0.000045349745,0.00012609358,0.000057131267,0.000072944924,0.00011126345,0.0005841825,0.00018145869,0.00019293424,0.00018432469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002724151,0.00007997366,0.00042466065,0.000004518333,0.000020691985,0.00014413492,0.00011608085,0.0000103612865,0.000021575379,0.99371266,0.0012587241,0.004179372],"study_design_scores_gemma":[0.0010965595,0.00051401625,0.0060785366,0.000035831807,0.0000065051627,0.000027947886,0.000004933099,0.0021741083,0.003962296,0.9847593,0.0010847269,0.00025527293],"about_ca_topic_score_codex":0.000019234873,"about_ca_topic_score_gemma":9.52132e-7,"teacher_disagreement_score":0.030722141,"about_ca_system_score_codex":0.000027873213,"about_ca_system_score_gemma":0.00004116066,"threshold_uncertainty_score":0.51419467},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82836694,0.00018430712,0.16128758,0.0033270118,0.00029504776,0.00042332133,0.00002239467,0.0001508332,0.005942595],"genre_scores_gemma":[0.9978584,0.000011108686,0.0007937482,0.000048528796,0.00003184511,0.00003246603,0.000007678498,0.0000065745576,0.0012096179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990188,0.000026438405,0.00026620497,0.00022558607,0.0002981076,0.00016485089],"domain_scores_gemma":[0.999245,0.000104367275,0.0002334999,0.00023014164,0.00017109116,0.00001592498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015175702,0.00011881485,0.00015780928,0.00033152892,0.00009255489,0.0000252433,0.000534749,0.00011323206,0.0000049137248],"category_scores_gemma":[0.000032306067,0.000070029986,0.00003538011,0.0011493098,0.00023258381,0.000046095305,0.00010668358,0.00017163121,0.000001567421],"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.000022597622,0.00017876491,0.00087262935,0.000005666223,0.000046256042,8.738277e-7,0.0000077016275,0.00048679498,0.12348622,0.87427974,0.000044033848,0.0005687037],"study_design_scores_gemma":[0.006459591,0.0051204027,0.073055275,0.00038562313,0.00020696661,0.00034178424,0.00009761508,0.3320824,0.40075675,0.17827727,0.001867356,0.0013489568],"about_ca_topic_score_codex":0.000014960789,"about_ca_topic_score_gemma":0.000005529722,"teacher_disagreement_score":0.6960025,"about_ca_system_score_codex":0.000031107807,"about_ca_system_score_gemma":0.00003964028,"threshold_uncertainty_score":0.285574},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26074466,0.0006185795,0.7104234,0.006217786,0.00019524721,0.0011170544,0.000086520144,0.00025019445,0.02034654],"genre_scores_gemma":[0.98855567,0.000032565662,0.0104196025,0.00011359336,0.00010172923,0.00003211885,0.000005705376,0.000005624638,0.00073340227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999384,0.000014584234,0.00015132295,0.00022103895,0.00011425804,0.00011482904],"domain_scores_gemma":[0.99907494,0.00006361853,0.00012523675,0.0006142291,0.000050972914,0.00007101598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012394438,0.000081264065,0.000114324816,0.000038611313,0.0003992569,0.000083803585,0.00064155285,0.000034735385,0.000035619625],"category_scores_gemma":[0.000019624147,0.00007052626,0.000038189937,0.00005395898,0.00006497868,0.00015087459,0.000184049,0.00006777468,0.0000870146],"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.0000026318153,0.000054038526,0.000024430787,0.00001806617,0.000005390639,5.166912e-7,0.000079405734,0.000008468929,0.0018076487,0.9870218,0.00011187954,0.010865706],"study_design_scores_gemma":[0.0016888028,0.00033183835,0.018930012,0.000098699544,0.000054818316,0.00005495893,0.000060224167,0.44971895,0.032359187,0.3923386,0.10349325,0.00087063],"about_ca_topic_score_codex":0.0000046277946,"about_ca_topic_score_gemma":4.973686e-7,"teacher_disagreement_score":0.727811,"about_ca_system_score_codex":0.0000037580141,"about_ca_system_score_gemma":0.0000128110505,"threshold_uncertainty_score":0.30708018},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018696532,0.000026345944,0.95450056,0.013834568,0.00043856684,0.0003659563,0.000016356442,0.000021928721,0.0120992],"genre_scores_gemma":[0.9455475,0.00004489999,0.0534424,0.00032514567,0.000092153954,0.0000816827,0.0000065019494,0.000003596451,0.00045606957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760795,0.00049376895,0.00041957168,0.00029620316,0.0009486564,0.00023382835],"domain_scores_gemma":[0.99856794,0.0007858602,0.00004796536,0.00024002623,0.00032851737,0.000029682154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034032874,0.00008920097,0.00010940127,0.00064661284,0.00018727801,0.0001766088,0.0012366683,0.000049468657,0.00016172555],"category_scores_gemma":[0.00016908108,0.000074611875,0.000059408765,0.0010930859,0.000062060004,0.000868628,0.000020206686,0.0006051713,0.00001286166],"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.000058354766,0.000806257,0.00041854085,0.000012562129,0.000028404012,0.000039571652,0.0060554286,0.017033586,0.019908343,0.8829194,0.00004128291,0.0726783],"study_design_scores_gemma":[0.0010639963,0.00023178544,0.02671885,0.00015863875,0.0000030525057,0.00020690728,0.0010727504,0.88320506,0.020844389,0.06177512,0.0044299494,0.00028953236],"about_ca_topic_score_codex":0.00022236962,"about_ca_topic_score_gemma":0.00006140667,"teacher_disagreement_score":0.92685103,"about_ca_system_score_codex":0.00011084165,"about_ca_system_score_gemma":0.00022487463,"threshold_uncertainty_score":0.30425838},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6461385,0.00105272,0.3470281,0.0031859356,0.0010727695,0.0005735922,0.00004772836,0.00014124584,0.00075939996],"genre_scores_gemma":[0.70543104,0.00009750038,0.2943116,0.000057360252,0.00007247432,0.0000043980062,0.0000067115852,0.000008979631,0.00000994174],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9979196,0.00035450328,0.00091840257,0.0003293932,0.0002099453,0.00026812954],"domain_scores_gemma":[0.98919237,0.0010568488,0.0011955429,0.008342347,0.00014749641,0.00006541626],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0010044706,0.00019966884,0.0005571854,0.00029191456,0.00039536582,0.00020885069,0.012996839,0.00009976986,0.000013133318],"category_scores_gemma":[0.00029283445,0.00020122532,0.0001246601,0.00026858805,0.00038594083,0.0005908155,0.006393813,0.00024394221,0.000008534872],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041816995,0.00064769364,0.018937178,0.00027472657,0.00020195119,0.00001107664,0.0048821843,0.0002665351,0.008921429,0.33791617,0.0004237268,0.6274755],"study_design_scores_gemma":[0.0031429862,0.0002969048,0.49415234,0.0009811688,0.000076100674,0.00008039615,0.000088980385,0.33176768,0.023679705,0.14252906,0.0019022074,0.0013024674],"about_ca_topic_score_codex":0.00015893046,"about_ca_topic_score_gemma":0.000023067765,"teacher_disagreement_score":0.626173,"about_ca_system_score_codex":0.000030782452,"about_ca_system_score_gemma":0.00009680852,"threshold_uncertainty_score":0.9923433},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019798086,0.00005467743,0.9833318,0.0012710609,0.00020766119,0.00047340814,0.0000072153825,0.00030560954,0.012368748],"genre_scores_gemma":[0.27962872,0.000005531527,0.69261754,0.0008186589,0.0003465282,0.0003565919,0.0000581876,0.000022661285,0.026145602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990286,0.000024908804,0.00022535255,0.0003094961,0.00013039343,0.00028122775],"domain_scores_gemma":[0.9994032,0.00008806295,0.00007070954,0.00031696376,0.00006166623,0.000059441158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003319036,0.00011866307,0.00012983562,0.000061807536,0.00015094627,0.00014513714,0.00045181412,0.000047429658,0.00023448573],"category_scores_gemma":[0.000011242711,0.0000996349,0.00008721681,0.00012931824,0.00003327226,0.00046258088,0.00007038855,0.0000553957,0.00013253602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008223686,0.00009485431,0.000020085701,0.00003094865,0.000011265669,0.0000021262765,0.000059164242,0.0028476808,0.00046824742,0.98179865,0.012584952,0.0020738011],"study_design_scores_gemma":[0.001276915,0.0001699401,0.000252842,0.000014461094,0.000007589416,0.000022298216,0.000024164921,0.4040295,0.0022467326,0.56866986,0.022939753,0.0003459231],"about_ca_topic_score_codex":0.000040640312,"about_ca_topic_score_gemma":0.000020652173,"teacher_disagreement_score":0.41312876,"about_ca_system_score_codex":0.000021551217,"about_ca_system_score_gemma":0.000045289515,"threshold_uncertainty_score":0.40629932},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27567387,0.0004638847,0.67105657,0.0068315538,0.0017597668,0.00062330987,0.000005228328,0.00008531152,0.0435005],"genre_scores_gemma":[0.80554414,0.00005668322,0.192045,0.000015910764,0.00035387446,0.0000027285198,7.7494576e-8,0.000015500074,0.001966105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99692744,0.0002836483,0.0005870293,0.00016135776,0.0016089095,0.0004316433],"domain_scores_gemma":[0.9962789,0.000919292,0.00066229486,0.0011282496,0.00077560515,0.00023570086],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.012356374,0.000112965536,0.00032558345,0.00030059076,0.0010296854,0.0018136434,0.0045852805,0.000045043416,0.00006307561],"category_scores_gemma":[0.0021122105,0.000088946756,0.00012231575,0.00017734211,0.00016796165,0.0011742011,0.0012944707,0.00082817755,0.000106704436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007648976,0.0016258827,0.00024016477,0.00058731815,0.00019579096,0.0008420031,0.009129984,0.00005939451,0.015160504,0.9450502,0.011191664,0.015840638],"study_design_scores_gemma":[0.0017225102,0.001462487,0.00045887337,0.0006994023,0.000018537936,0.0010058155,0.0009164316,0.057020642,0.009025287,0.92365736,0.0036807917,0.00033186201],"about_ca_topic_score_codex":0.000018213175,"about_ca_topic_score_gemma":0.0000139508375,"teacher_disagreement_score":0.5298703,"about_ca_system_score_codex":0.000086912776,"about_ca_system_score_gemma":0.000247692,"threshold_uncertainty_score":0.9992226},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20742722,0.002137334,0.7830584,0.0050009573,0.0014273743,0.00034137227,0.0000050406834,0.000045718425,0.000556583],"genre_scores_gemma":[0.9933719,0.0005701001,0.0043838657,0.00009676145,0.0008673835,0.000007801378,5.231552e-7,0.000012268796,0.0006893704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998437,0.00008326014,0.00043188056,0.00017688691,0.00027280598,0.0005981925],"domain_scores_gemma":[0.99785906,0.00030170288,0.0008911837,0.0006081348,0.0002429951,0.00009693855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018267846,0.00014107957,0.0002307719,0.000050440554,0.0010433074,0.000500656,0.0025252576,0.00005058702,0.0000092309765],"category_scores_gemma":[0.0004054087,0.000092471455,0.00018364035,0.00007165242,0.000107609616,0.00076260907,0.00012861947,0.00039627275,0.0000165636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002627083,0.00008508504,0.000036501522,0.00004681904,0.0002078611,0.000048529695,0.00049460254,0.000028370767,0.011159557,0.7585454,0.00013260072,0.22895195],"study_design_scores_gemma":[0.006252121,0.003898709,0.0023201704,0.00035062624,0.00019710425,0.0017849241,0.00013726593,0.056281116,0.12599555,0.6386066,0.16287713,0.0012986881],"about_ca_topic_score_codex":0.0000022559009,"about_ca_topic_score_gemma":0.0000054917277,"teacher_disagreement_score":0.7859447,"about_ca_system_score_codex":0.00007744661,"about_ca_system_score_gemma":0.0005275219,"threshold_uncertainty_score":0.8024382},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42879656,0.00010661394,0.51025265,0.00046009128,0.0058441046,0.0009070732,0.000121575074,0.0009776822,0.05253364],"genre_scores_gemma":[0.98203844,0.000096615724,0.0014942868,0.00013984395,0.00026930013,0.000001983061,0.00002143333,0.000020325322,0.015917758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790204,0.00014572396,0.0001892473,0.0012546026,0.00011554607,0.00039284892],"domain_scores_gemma":[0.9965416,0.00013831547,0.00038134656,0.0025252323,0.00018146056,0.00023201689],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034687424,0.00037841356,0.00036715675,0.00026888718,0.00046584607,0.00031341545,0.003267803,0.00032945967,0.00016879202],"category_scores_gemma":[0.000077763165,0.00041262718,0.00028624298,0.0001707673,0.00014710687,0.0004654855,0.001782815,0.0006702157,0.0007082054],"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.00007678377,0.00033585614,0.00036188387,0.00013236178,0.00022962804,0.0010628019,0.00027412677,0.1250017,0.000027408341,0.866303,0.0034483746,0.002746036],"study_design_scores_gemma":[0.0012061985,0.00014607294,0.0012920059,0.000298648,0.00011228711,0.000015876125,0.000023497538,0.53157276,0.0007178079,0.45712408,0.006261509,0.0012292141],"about_ca_topic_score_codex":0.00003670641,"about_ca_topic_score_gemma":0.000014389454,"teacher_disagreement_score":0.5532419,"about_ca_system_score_codex":0.0001328566,"about_ca_system_score_gemma":0.00018053723,"threshold_uncertainty_score":0.9998326},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016583918,0.00040173464,0.9741123,0.0004992476,0.000113343995,0.0016709559,0.00010209045,0.00045591602,0.020986049],"genre_scores_gemma":[0.028427035,0.00008484014,0.9665132,0.00007255901,0.0001505696,0.00023559005,0.000029273377,0.00007410309,0.0044128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976062,0.000009757984,0.0009304802,0.00047137428,0.000515191,0.0004669647],"domain_scores_gemma":[0.9973273,0.00041972665,0.00059869076,0.001263543,0.000091679336,0.00029900676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018656613,0.00043196924,0.00065746735,0.00020896792,0.00018154651,0.00068986794,0.001756792,0.00012952327,0.000067671564],"category_scores_gemma":[0.00007369143,0.00033802548,0.00026615302,0.0007640864,0.00012944224,0.004935534,0.00036881844,0.00014633033,0.00011881768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069541825,0.00071979006,0.0000071218897,0.0017854022,0.00010411683,0.000013234708,0.0012299466,0.00016368905,0.0000468794,0.9722837,0.0022818197,0.021357344],"study_design_scores_gemma":[0.001524968,0.00034846552,0.0000024437977,0.00061811565,0.000108760585,0.00034574157,0.00027626046,0.14162052,0.0052599465,0.808163,0.040899664,0.00083213445],"about_ca_topic_score_codex":6.5578087e-7,"about_ca_topic_score_gemma":3.528929e-7,"teacher_disagreement_score":0.16412073,"about_ca_system_score_codex":0.000022934066,"about_ca_system_score_gemma":0.000103047896,"threshold_uncertainty_score":0.9999072},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000033243628,0.0007928977,0.65819204,0.007117277,0.0003766381,0.0008519013,0.000028368675,0.00023134776,0.33240622],"genre_scores_gemma":[0.8708907,0.0023725138,0.03099418,0.007969699,0.011033825,0.0018618021,0.0005941755,0.0006344437,0.073648706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981635,0.0000051234983,0.00045238162,0.00056951167,0.00037167844,0.00043777455],"domain_scores_gemma":[0.99794835,0.00083098316,0.00029049788,0.00036954868,0.0004466694,0.000113930815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044334924,0.00046977936,0.00035861728,0.00021577964,0.00092286797,0.00055264204,0.0013812685,0.00040865265,0.0001233189],"category_scores_gemma":[0.00022963405,0.00034046845,0.0003316937,0.0002001582,0.00011423542,0.00044572592,0.00009168762,0.00060331385,0.000047880803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000940873,0.000011773825,1.352279e-7,0.000074516836,0.00006747029,7.624151e-7,0.001333618,0.00007379082,0.00016202265,0.9432653,0.0003272607,0.0546739],"study_design_scores_gemma":[0.00018799133,0.00007488285,7.1579154e-7,0.00009372575,0.000117270894,0.000035630612,0.0000120600025,0.011676684,0.0013891004,0.7444419,0.24161041,0.00035959316],"about_ca_topic_score_codex":0.0000029779237,"about_ca_topic_score_gemma":0.0000036710614,"teacher_disagreement_score":0.87088734,"about_ca_system_score_codex":0.00006906998,"about_ca_system_score_gemma":0.00014873198,"threshold_uncertainty_score":0.99990475},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02719579,0.00011954305,0.9655433,0.0014139896,0.00027989043,0.00080076297,0.000018488945,0.0001709809,0.004457239],"genre_scores_gemma":[0.9921974,0.000005333373,0.006402108,0.000060303428,0.00012793134,0.0002355562,0.000003300477,0.0000130837325,0.00095501746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987006,0.00009878832,0.0002785816,0.00032488673,0.00035291014,0.00024422022],"domain_scores_gemma":[0.997168,0.00021344621,0.00041853546,0.0019907008,0.00013325535,0.00007606067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005423429,0.00015395171,0.0001982366,0.00007091766,0.00092116016,0.00036939967,0.0021117781,0.00005725168,0.000020177591],"category_scores_gemma":[0.00003252242,0.00010000435,0.00008305021,0.0002481331,0.00018956441,0.00054076273,0.0003499497,0.00011441446,0.00009322959],"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.000009182301,0.00004224513,0.0003479955,0.000043436525,0.000036901693,0.0000032415269,0.00024563284,0.000038874485,0.00023331327,0.9963281,0.00017383588,0.0024972125],"study_design_scores_gemma":[0.010729531,0.0018440059,0.075473286,0.0012802705,0.0008108654,0.0004872271,0.002809661,0.499395,0.03697397,0.27672642,0.089325614,0.0041441526],"about_ca_topic_score_codex":0.00011394151,"about_ca_topic_score_gemma":0.00003007887,"teacher_disagreement_score":0.9650016,"about_ca_system_score_codex":0.000035620815,"about_ca_system_score_gemma":0.00011480707,"threshold_uncertainty_score":0.70849127},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000074069474,0.001386314,0.114347324,0.00024305642,0.0012743939,0.0002815449,0.000028411321,0.0005512896,0.8818136],"genre_scores_gemma":[0.006349371,0.0026212372,0.039195146,0.0011481508,0.0012129411,0.000050584367,0.00011035759,0.0002094843,0.9491027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821067,0.000014036042,0.00042533237,0.0005777068,0.0003336682,0.00043856882],"domain_scores_gemma":[0.9987057,0.000055663306,0.00015080457,0.0008257033,0.00008660331,0.00017552519],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034966427,0.0005068403,0.0004579637,0.00052601803,0.00020959321,0.00023659268,0.0012445339,0.00039832862,0.00026907976],"category_scores_gemma":[0.0000043352798,0.00042493528,0.00048185472,0.00015802366,0.0003563104,0.0007492684,0.00014046389,0.00058524264,0.0001451638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020740537,0.000008869365,0.000003709963,0.000038584658,0.000050144063,0.000058074107,0.00041657634,5.377602e-7,0.0000035730463,0.85573846,0.00030941446,0.14335129],"study_design_scores_gemma":[0.00014990044,0.0001777939,0.000017488166,0.00011483578,0.000024430194,0.000066475724,0.000036333917,0.00005822857,0.00038059845,0.5222384,0.47618145,0.0005540999],"about_ca_topic_score_codex":0.000005743864,"about_ca_topic_score_gemma":0.000023865388,"teacher_disagreement_score":0.47587204,"about_ca_system_score_codex":0.000023292932,"about_ca_system_score_gemma":0.000058941965,"threshold_uncertainty_score":0.99982023},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021013928,0.0017277794,0.7939845,0.003499144,0.005422289,0.00032510204,0.000045785255,0.00031307482,0.19466133],"genre_scores_gemma":[0.058186825,0.0014715906,0.061649553,0.0025973043,0.0027483879,0.00025546938,0.00031230028,0.00010901115,0.8726696],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971693,0.00006758344,0.00041332343,0.0012175436,0.0005214645,0.0006107891],"domain_scores_gemma":[0.9972369,0.0000690009,0.00033366922,0.0018243403,0.0000688182,0.0004672644],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039317558,0.0005197108,0.0011856987,0.0004083357,0.0006348295,0.0007295139,0.00197627,0.00040515114,0.00014972306],"category_scores_gemma":[0.000042888892,0.00044264694,0.00044605165,0.001171037,0.00015092864,0.00025420266,0.00096207,0.0008208025,0.00022442288],"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.000034233406,0.00007613143,0.000013145032,0.000059942387,0.0022174174,0.00007197196,0.0003333559,0.00002240763,0.0000192531,0.07601706,0.82969147,0.09144364],"study_design_scores_gemma":[0.00017429567,0.00008308424,0.00032317647,0.000022198836,0.0012655093,0.000010327951,0.000028144557,0.010125589,0.000054188982,0.023736618,0.9632866,0.00089030614],"about_ca_topic_score_codex":0.00004633592,"about_ca_topic_score_gemma":0.000005821203,"teacher_disagreement_score":0.7323349,"about_ca_system_score_codex":0.000040389674,"about_ca_system_score_gemma":0.00014016098,"threshold_uncertainty_score":0.99980253},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08871445,0.0010241106,0.9077638,0.0012932657,0.00007498301,0.0002928398,0.00011759001,0.000109937224,0.00060906145],"genre_scores_gemma":[0.9095501,0.0006265215,0.08905952,0.00010975203,0.00011573964,0.000056422057,0.00017158635,0.00002007075,0.00029030512],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974741,0.00008125606,0.00049687224,0.001114478,0.0004364666,0.00039684103],"domain_scores_gemma":[0.99845093,0.00024067867,0.00031221428,0.0005886437,0.000096528835,0.00031098354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050848833,0.0004582269,0.0009075116,0.00024542725,0.0007906007,0.00092345604,0.0006479866,0.0002446677,0.000039493945],"category_scores_gemma":[0.000009254221,0.00040782825,0.00020559433,0.0003541691,0.0003403858,0.0003475791,0.0011082642,0.00051942037,0.00000811463],"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.00016964326,0.00027385907,0.005356357,0.0006743216,0.011225299,0.00008033922,0.0066593946,0.04582649,0.00013532687,0.45365295,0.00028102385,0.475665],"study_design_scores_gemma":[0.0009939276,0.00007331631,0.042254224,0.000056115045,0.0020373,0.000020182522,0.00024566796,0.3719235,0.00010424897,0.5804102,0.00083121785,0.001050109],"about_ca_topic_score_codex":0.000079731486,"about_ca_topic_score_gemma":0.0000070549686,"teacher_disagreement_score":0.82083565,"about_ca_system_score_codex":0.000031354146,"about_ca_system_score_gemma":0.00018030615,"threshold_uncertainty_score":0.99983734},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.277482,0.0004521147,0.6967573,0.0053839833,0.0011277384,0.00087122817,0.00004275876,0.000025780748,0.017857095],"genre_scores_gemma":[0.87053275,0.00007350505,0.12765543,0.000023901515,0.00031234595,0.0000075378375,9.169378e-7,0.000015711475,0.001377878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981504,0.00013846609,0.00043887994,0.00011045687,0.0009099159,0.0002518646],"domain_scores_gemma":[0.99673885,0.0011249885,0.00061055267,0.000708459,0.0007033179,0.000113855356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006465765,0.00007754336,0.00026854328,0.000559048,0.00047997522,0.00035872962,0.0016865949,0.00006147987,0.000019659317],"category_scores_gemma":[0.0018793907,0.000059525377,0.00014046651,0.00020234006,0.00018221885,0.00041713082,0.00018509377,0.00032440547,0.000014491464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055747627,0.0005990175,0.000018178764,0.0004645046,0.000079024794,0.00004908176,0.00074631174,0.00006265273,0.0016978168,0.96658754,0.0067770244,0.022863092],"study_design_scores_gemma":[0.0012632932,0.0017532764,0.00044680265,0.00054530933,0.000016865935,0.00015754046,0.00029196643,0.032074425,0.023267746,0.9298681,0.010162607,0.00015206549],"about_ca_topic_score_codex":0.000001930657,"about_ca_topic_score_gemma":6.6933956e-7,"teacher_disagreement_score":0.5930508,"about_ca_system_score_codex":0.000048168098,"about_ca_system_score_gemma":0.00016827576,"threshold_uncertainty_score":0.36916298},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79895204,0.0011332723,0.17902298,0.0005876397,0.0039720065,0.0015908254,0.000058848964,0.000031081214,0.014651321],"genre_scores_gemma":[0.6504755,0.00017862592,0.24242929,0.00026589632,0.0014276464,0.00013642461,0.0012817143,0.00013984594,0.10366507],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9963079,0.0006586845,0.00072782085,0.0010450989,0.00041182048,0.0008486754],"domain_scores_gemma":[0.9978159,0.00021245345,0.00059053226,0.0008089827,0.00030059845,0.00027152814],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0022128879,0.000526651,0.00058182655,0.00019634311,0.0006332691,0.0016660284,0.0022671386,0.0005570324,0.0011488855],"category_scores_gemma":[0.00013971713,0.0005933354,0.00018660624,0.000764528,0.00007742032,0.0010929939,0.000382216,0.0006294054,0.0010819476],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017083649,0.0012661132,0.0008655691,0.00067546515,0.00052976643,0.0018692344,0.04918476,0.013070005,0.027297748,0.036971606,0.0016476791,0.8649137],"study_design_scores_gemma":[0.005535562,0.0013045896,0.012972038,0.004258655,0.0011472557,0.00153048,0.0032150382,0.42482048,0.44881594,0.036301132,0.05533391,0.0047649406],"about_ca_topic_score_codex":0.0015483422,"about_ca_topic_score_gemma":0.0006825801,"teacher_disagreement_score":0.8601487,"about_ca_system_score_codex":0.0003737688,"about_ca_system_score_gemma":0.0011604247,"threshold_uncertainty_score":0.9997642},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034127403,0.00039027454,0.83043045,0.011561019,0.002210648,0.0008728074,0.000015167703,0.00030458227,0.12008762],"genre_scores_gemma":[0.89936036,0.000044988818,0.07232127,0.00032322967,0.0006218216,0.000046400903,0.0000039369734,0.000042849228,0.027235117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752295,0.00013668703,0.0006382557,0.00061340176,0.000582408,0.00050630706],"domain_scores_gemma":[0.9955107,0.00035817712,0.0008279339,0.002904373,0.00021677646,0.00018206934],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001732274,0.00033314066,0.0004314973,0.00008505113,0.0017632771,0.0022278943,0.0027188102,0.0001429426,0.0010059524],"category_scores_gemma":[0.0013047437,0.00028402783,0.00018743965,0.00011895,0.0003154997,0.0015794341,0.0008647295,0.00022876312,0.008191015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066951156,0.00019452316,0.000045826328,0.0002455536,0.000046773235,0.000022293703,0.0022495207,0.000007239201,0.00014969881,0.9519956,0.00066837727,0.044367895],"study_design_scores_gemma":[0.00086631766,0.00013773113,0.0023665263,0.0006634063,0.00010937352,0.00007361321,0.00019816347,0.25422874,0.0019694478,0.7299513,0.008557152,0.0008781918],"about_ca_topic_score_codex":0.000031020147,"about_ca_topic_score_gemma":0.000002601351,"teacher_disagreement_score":0.865233,"about_ca_system_score_codex":0.00003474305,"about_ca_system_score_gemma":0.00010377265,"threshold_uncertainty_score":0.9999612},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015294721,0.000033701257,0.98101145,0.0008212021,0.00064615224,0.0013258932,0.00037317842,0.00018174735,0.00031192458],"genre_scores_gemma":[0.7410754,0.000009194958,0.2572707,0.00009938082,0.00010822232,0.0002812355,0.00097140175,0.000024510433,0.00015996536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801594,0.00006625754,0.0004629926,0.00068523345,0.00039278777,0.00037677432],"domain_scores_gemma":[0.99682665,0.00047138013,0.00049316377,0.0006092767,0.0014752746,0.0001242771],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00046842845,0.00030531475,0.0003362369,0.00016188654,0.001162877,0.0012248143,0.0010152832,0.00008548861,0.000018927189],"category_scores_gemma":[0.00018242732,0.00028992092,0.00011885383,0.000085234395,0.00014947554,0.0012742919,0.00015254621,0.000103812155,0.000010320929],"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.000060059,0.000038456645,0.00003340512,0.000059092217,0.000038286787,0.0000021862106,0.00004568809,0.52739275,0.000023896297,0.46709046,0.000062966836,0.005152778],"study_design_scores_gemma":[0.0013554852,0.00023026169,0.0010424005,0.00009849512,0.000029639386,0.000036320213,0.000022864253,0.944665,0.000021618935,0.05206479,0.00004836425,0.0003847683],"about_ca_topic_score_codex":0.000022770862,"about_ca_topic_score_gemma":0.000019396983,"teacher_disagreement_score":0.72578067,"about_ca_system_score_codex":0.00014614686,"about_ca_system_score_gemma":0.000320164,"threshold_uncertainty_score":0.9999553},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00902126,0.00051796075,0.98304284,0.0034250098,0.00012958668,0.0029185845,0.000025408548,0.00043354084,0.00048578857],"genre_scores_gemma":[0.595051,0.000077740464,0.3953711,0.000803741,0.00024272612,0.0068844506,0.000039923307,0.000041596235,0.0014877135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983735,0.00009997852,0.0003656388,0.00047768123,0.0001826394,0.00050056615],"domain_scores_gemma":[0.9981258,0.00068271044,0.0002477264,0.0006224611,0.00018997265,0.00013132728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010864154,0.00023476474,0.00022286309,0.00015114807,0.0006889771,0.0007592394,0.000728406,0.00016252109,0.00001169618],"category_scores_gemma":[0.00019662753,0.00018001023,0.00013335812,0.00026655276,0.00010210042,0.0010986512,0.00016885881,0.00022804705,0.0000055808114],"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.000047340527,0.00016994185,0.0012359124,0.0002303517,0.000088692526,4.3918456e-7,0.0015530392,0.006451089,0.0018371571,0.85717875,0.0026887457,0.12851852],"study_design_scores_gemma":[0.0004988507,0.00016192265,0.00636103,0.000035153975,0.000029031233,0.00003507823,0.00013421732,0.892625,0.0016273969,0.09706835,0.0011421262,0.00028185558],"about_ca_topic_score_codex":0.001638338,"about_ca_topic_score_gemma":0.0001522721,"teacher_disagreement_score":0.8861739,"about_ca_system_score_codex":0.00010107159,"about_ca_system_score_gemma":0.00008133933,"threshold_uncertainty_score":0.7340604},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018517004,0.0005449206,0.95240825,0.0110723395,0.0005569118,0.00067019154,0.00006716725,0.00039782852,0.0324307],"genre_scores_gemma":[0.51917213,0.00027424723,0.46861413,0.00027915888,0.000108270375,0.00036557743,0.0001607907,0.00006419288,0.010961513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943326,0.0028309207,0.0006072085,0.001169961,0.0004868517,0.0005724635],"domain_scores_gemma":[0.9931359,0.0017555032,0.0004947614,0.002867929,0.0014944386,0.00025143364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0040871142,0.00042537082,0.00047246853,0.00016490219,0.00044699328,0.00090423814,0.0031931405,0.00030187637,0.000068351364],"category_scores_gemma":[0.000501349,0.0003716721,0.00037351937,0.00025558576,0.00020649715,0.00035902747,0.0015200394,0.0004519393,0.00005985149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020769901,0.0002620823,0.000029851497,0.00013645546,0.000063743755,0.0000063163625,0.003992409,0.0007507594,0.00039655674,0.95910287,0.0019846542,0.033253502],"study_design_scores_gemma":[0.0016093843,0.0000027387498,0.0003127411,0.002046709,0.000051199,0.000023737473,0.0002438909,0.33066228,0.019871894,0.5765238,0.067232974,0.0014186334],"about_ca_topic_score_codex":0.00016291598,"about_ca_topic_score_gemma":0.000061493054,"teacher_disagreement_score":0.5173204,"about_ca_system_score_codex":0.00011438931,"about_ca_system_score_gemma":0.00056051544,"threshold_uncertainty_score":0.9998735},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032962136,0.000057891604,0.9478013,0.0004866024,0.00030873087,0.00007607443,0.000004266648,0.000067657646,0.018235357],"genre_scores_gemma":[0.8708778,0.000011623335,0.12793183,0.000028708864,0.000052781685,0.000002784333,0.0000010714641,0.0000026852103,0.0010907289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994171,0.000025050273,0.00013943367,0.00014770239,0.00015713119,0.00011354595],"domain_scores_gemma":[0.9991894,0.000053690386,0.00015667742,0.0005213294,0.00003723286,0.00004167997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033530197,0.00006287356,0.00009742531,0.0000467742,0.00021541522,0.0001612861,0.0009584884,0.000029464305,0.00008266252],"category_scores_gemma":[0.000062613144,0.00005076909,0.000044051045,0.000053451357,0.000044208147,0.0006496821,0.00018665139,0.00004124794,0.0000850653],"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.0000039748343,0.000055056018,0.00033414058,0.00001855594,0.0000114129225,0.0000049865575,0.00011091908,0.0005565086,0.00029891406,0.831021,0.00029337182,0.16729116],"study_design_scores_gemma":[0.00072199095,0.000120717654,0.02020211,0.000035656252,0.000016844364,0.000024039296,0.000022736596,0.80605835,0.05901765,0.11239126,0.001083327,0.00030529388],"about_ca_topic_score_codex":0.000036029203,"about_ca_topic_score_gemma":0.0000022803138,"teacher_disagreement_score":0.83791566,"about_ca_system_score_codex":0.0000052779747,"about_ca_system_score_gemma":0.000030619754,"threshold_uncertainty_score":0.20703034},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82843274,0.0050606006,0.15717301,0.0008640915,0.000452872,0.0010623896,0.0003401605,0.0008144037,0.0057997303],"genre_scores_gemma":[0.6441914,0.0011394649,0.34365606,0.00040453364,0.0005245905,0.00009183708,0.00006307254,0.00010093782,0.009828112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987843,0.00002331104,0.00044846136,0.00026475618,0.00020422244,0.00027492136],"domain_scores_gemma":[0.9987635,0.0004689315,0.0002125805,0.00041361153,0.000027906475,0.00011345495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014943427,0.0001977437,0.00035314812,0.00015883359,0.00007524029,0.0005189726,0.0006203835,0.00007258374,0.000013002045],"category_scores_gemma":[0.00006019415,0.0001661969,0.0001216761,0.0002503342,0.00008361886,0.0031709347,0.0003665715,0.000056000088,0.000011292399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013350175,0.00013634704,0.00014131046,0.00083233014,0.00004352095,0.000014871588,0.0007588157,0.000011768678,0.00030290955,0.9946273,0.00076288456,0.0023545832],"study_design_scores_gemma":[0.00060161017,0.000116001036,0.000017486851,0.00012210997,0.000022366712,0.000121053745,0.0003285971,0.022282211,0.0069318195,0.9649143,0.0042112735,0.00033116428],"about_ca_topic_score_codex":9.06283e-7,"about_ca_topic_score_gemma":3.420639e-8,"teacher_disagreement_score":0.18648306,"about_ca_system_score_codex":0.000005393547,"about_ca_system_score_gemma":0.00004748454,"threshold_uncertainty_score":0.6777313},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7359,0.000034935692,0.26166657,0.00005444876,0.00017568482,0.0001171497,0.000010273075,0.00007212264,0.001968806],"genre_scores_gemma":[0.9947268,0.0000042916863,0.0027733142,0.000024901345,0.00002725029,4.4570544e-7,0.000008700363,0.0000061122887,0.0024282052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906904,0.00014018532,0.000101286445,0.00030942966,0.00018978753,0.00019028665],"domain_scores_gemma":[0.99930596,0.00009580532,0.00009188978,0.00033589493,0.00006412657,0.00010630613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026565633,0.00012775419,0.00016004383,0.00014979662,0.0004462586,0.00006768428,0.000280724,0.00007970357,0.00015473769],"category_scores_gemma":[0.000022263595,0.00014221943,0.00009962375,0.0002503402,0.00016681197,0.0004953186,0.00009076271,0.00010838627,0.00015552617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001697553,0.00015008883,0.0012155545,0.000012047757,0.000033192304,0.000011821743,0.000994134,0.0001324351,0.000120105375,0.99654675,0.00018983282,0.0005770403],"study_design_scores_gemma":[0.0006338149,0.00014330844,0.00655772,0.000013331727,0.000041373798,0.000027752852,0.00061205856,0.0039234213,0.000014655742,0.98734343,0.00047252333,0.000216594],"about_ca_topic_score_codex":0.000020569443,"about_ca_topic_score_gemma":0.000016200718,"teacher_disagreement_score":0.25889325,"about_ca_system_score_codex":0.000044153938,"about_ca_system_score_gemma":0.000031246727,"threshold_uncertainty_score":0.579954},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037935204,0.008659107,0.9421018,0.034752943,0.0005745513,0.0006369102,0.00015110189,0.00052397384,0.008806124],"genre_scores_gemma":[0.38003257,0.0029732455,0.57901686,0.0047911326,0.0012629256,0.00023397217,0.000028906697,0.00011383683,0.03154657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965111,0.00041288845,0.000875746,0.00067672227,0.0005926376,0.0009308913],"domain_scores_gemma":[0.99683,0.00042702394,0.0005367103,0.0015511428,0.00022653151,0.0004286128],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011934525,0.00047219836,0.0005414366,0.0006838469,0.00031860478,0.00028290876,0.0015044964,0.0004675787,0.00019054704],"category_scores_gemma":[0.0002704289,0.0005020931,0.0003276645,0.0014868592,0.00024310242,0.0010119559,0.0003933597,0.00055223715,0.0001605909],"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.000046702386,0.0005974095,0.0003038863,0.00008186147,0.000034436114,0.0000404288,0.0007195689,0.012152328,0.00076695194,0.6571039,0.0051425705,0.32300997],"study_design_scores_gemma":[0.000711766,0.00051956734,0.0024007973,0.00039316234,0.00008166746,0.00019009,0.00004554776,0.8075307,0.025193237,0.023301195,0.13894458,0.00068766164],"about_ca_topic_score_codex":0.00466158,"about_ca_topic_score_gemma":0.0025381232,"teacher_disagreement_score":0.7953784,"about_ca_system_score_codex":0.00040994651,"about_ca_system_score_gemma":0.00042954204,"threshold_uncertainty_score":0.99974304},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053415406,0.0000719053,0.30798054,0.060267907,0.0006336607,0.00060150627,0.00003470749,0.00020042465,0.57679397],"genre_scores_gemma":[0.91968614,0.000004199041,0.044630755,0.0017863434,0.00022444908,0.00004261753,0.0000028293261,0.000024985584,0.033597685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909645,0.00003529176,0.00013720679,0.00028849152,0.00012412242,0.00031842865],"domain_scores_gemma":[0.99850696,0.00010808293,0.000053330255,0.0008217167,0.00002773767,0.00048218734],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00036664514,0.00012139644,0.00014709184,0.0000804384,0.000640598,0.0004349208,0.00066398823,0.000073332136,0.0016133308],"category_scores_gemma":[0.00035719023,0.00010322711,0.000036923102,0.00003630965,0.00014292153,0.00008505457,0.00012517141,0.00016244489,0.0044668736],"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.000004228633,0.000034782002,0.000017176602,0.000033219454,0.000012669568,0.00009270067,0.00014787387,0.0000051332213,0.000008826061,0.9566853,0.024474176,0.01848391],"study_design_scores_gemma":[0.001352652,0.00033506023,0.0022102431,0.00037251454,0.000036272068,0.0003554664,0.00018739553,0.0586253,0.00032154424,0.34446642,0.59049517,0.0012419514],"about_ca_topic_score_codex":0.00015457255,"about_ca_topic_score_gemma":0.0000849837,"teacher_disagreement_score":0.8662707,"about_ca_system_score_codex":0.000031999287,"about_ca_system_score_gemma":0.00006550925,"threshold_uncertainty_score":0.99929935},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5550466,0.00008906704,0.43645102,0.000102697035,0.0005172611,0.00027444973,0.0000040939917,0.00007357433,0.0074411808],"genre_scores_gemma":[0.99732304,0.00004021427,0.0010573347,0.000017050237,0.000052932857,4.9918054e-7,6.0216775e-7,0.000004821833,0.0015034893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915266,0.00010779877,0.00011172035,0.00045189337,0.000045275636,0.00013063446],"domain_scores_gemma":[0.99861157,0.00008127842,0.0003265873,0.00083459244,0.00010465322,0.0000413026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039682325,0.00013627589,0.00018451778,0.00004523036,0.0002180762,0.00011114508,0.001100639,0.00010736681,0.000009283575],"category_scores_gemma":[0.000058952035,0.00011430377,0.00008798484,0.00010007596,0.00014773819,0.00023320573,0.0015802926,0.00031971885,0.0000042483057],"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.0000895161,0.00008462211,0.0020946863,0.00033282884,0.00021892972,0.00013012408,0.0036206616,0.005691819,0.00017638474,0.9630793,0.00016011565,0.024321053],"study_design_scores_gemma":[0.0007646627,0.00015129281,0.0017735264,0.0005656863,0.00010912353,0.00003899362,0.001209126,0.7193837,0.0009103568,0.2737377,0.0008517372,0.00050409575],"about_ca_topic_score_codex":0.00042885868,"about_ca_topic_score_gemma":0.00011741455,"teacher_disagreement_score":0.7136919,"about_ca_system_score_codex":0.000048064583,"about_ca_system_score_gemma":0.000099540965,"threshold_uncertainty_score":0.46611726},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06270496,0.00003042674,0.9303766,0.0006627261,0.00060703716,0.000114217764,7.8834984e-7,0.00015648313,0.0053467546],"genre_scores_gemma":[0.9144912,0.0000012423727,0.08515567,0.00012355797,0.00012131598,0.0000021785775,0.0000030141011,0.000005878639,0.00009597984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989947,0.000071717215,0.00022292852,0.00031120738,0.00014142117,0.00025799774],"domain_scores_gemma":[0.9991445,0.00014045271,0.00020048926,0.00042109005,0.00003672318,0.00005672062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054040976,0.00010792007,0.00014111448,0.00008631564,0.0005186093,0.0004052938,0.0008778396,0.000045811707,0.000007863778],"category_scores_gemma":[0.00008807813,0.00011281793,0.000046486777,0.000088904664,0.00005609522,0.00058269995,0.00032883446,0.00014984111,0.00007129593],"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.000010903069,0.00013452084,0.008748101,0.00006350716,0.000025693284,0.000093894516,0.0030343458,0.08187975,0.0001301522,0.29198846,0.00072902057,0.6131616],"study_design_scores_gemma":[0.0005488246,0.000023756058,0.0377972,0.000059771646,0.0000016268617,0.00001543089,0.00003319319,0.9032069,0.000092464135,0.057715025,0.0003074355,0.0001983606],"about_ca_topic_score_codex":0.000028323675,"about_ca_topic_score_gemma":0.000006714845,"teacher_disagreement_score":0.8517862,"about_ca_system_score_codex":0.000029674351,"about_ca_system_score_gemma":0.000033482236,"threshold_uncertainty_score":0.46005815},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013621574,0.0001494617,0.981686,0.001917731,0.000065064836,0.0004505,0.000026137699,0.0001043077,0.001979252],"genre_scores_gemma":[0.9221196,0.00013438065,0.07525148,0.000500575,0.0005592053,0.00037021353,0.000012425609,0.000016354363,0.0010357647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993903,0.000007532747,0.000116984775,0.00026386624,0.00006058179,0.00016070968],"domain_scores_gemma":[0.9992328,0.00006299202,0.0000754029,0.0005293624,0.000034909852,0.00006449423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000113925045,0.00008588197,0.000090212714,0.000026807282,0.0006279033,0.0002264074,0.00065177714,0.000035997327,0.000011260957],"category_scores_gemma":[0.000017451948,0.000080387035,0.000039338818,0.00003624902,0.000023203464,0.00031627444,0.0001336322,0.00006795857,0.000024738447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018947574,0.00003221267,0.000090507776,0.000030837044,0.000009990996,7.307362e-7,0.0000859807,0.0000027110389,0.0007641964,0.96017015,0.00007397686,0.03873679],"study_design_scores_gemma":[0.0014134963,0.00022128838,0.0148411915,0.00006088755,0.000045846184,0.00003176798,0.000052240895,0.22913334,0.037741184,0.4914156,0.22407153,0.000971636],"about_ca_topic_score_codex":0.0000034429552,"about_ca_topic_score_gemma":0.0000020559578,"teacher_disagreement_score":0.90849805,"about_ca_system_score_codex":0.0000035214273,"about_ca_system_score_gemma":0.0000195494,"threshold_uncertainty_score":0.4829388},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091719,0.00013201045,0.90757364,0.00022994659,0.0000071598433,0.00012461623,0.000005121032,0.0000028775703,0.0002056171],"genre_scores_gemma":[0.92256206,0.000040851904,0.077304326,0.0000031506256,0.0000455085,0.0000049351443,4.799296e-7,0.0000019846022,0.000036677036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901956,0.000030603696,0.0005947487,0.00010368031,0.00018380967,0.00006762391],"domain_scores_gemma":[0.99798465,0.00018640145,0.0010895584,0.00039264286,0.00024867887,0.000098080935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007903234,0.00006656667,0.00045008678,0.000100042256,0.00011766169,0.000080351376,0.00034500755,0.000034820783,0.000008949784],"category_scores_gemma":[0.00011884318,0.000045747413,0.00012935205,0.0001712305,0.00010755206,0.0002463492,0.00009233562,0.00006686165,4.7514692e-7],"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.000018277316,0.00048001984,0.0016781949,0.00062447396,0.0007698444,0.0000012469748,0.0016197994,0.00034128482,0.0018289102,0.95573646,0.000025009596,0.03687646],"study_design_scores_gemma":[0.0006885284,0.00018563244,0.004145118,0.00013073802,0.0011308091,0.000059268517,0.0006445368,0.55916667,0.0041558314,0.4293999,0.000119571145,0.00017338379],"about_ca_topic_score_codex":0.000013574048,"about_ca_topic_score_gemma":0.0000014671498,"teacher_disagreement_score":0.8308431,"about_ca_system_score_codex":0.000005997579,"about_ca_system_score_gemma":0.000028050727,"threshold_uncertainty_score":0.18655252},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22627114,0.00014398317,0.7723356,0.00022645113,0.00013226132,0.00007616412,0.0000035823844,0.0000086271975,0.0008021833],"genre_scores_gemma":[0.64878976,0.000009880185,0.35110265,0.000017086919,0.000067138964,7.324227e-7,4.924415e-7,0.000003806002,0.000008430625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987683,0.00001729365,0.00055380363,0.000104307255,0.00044854512,0.000107693304],"domain_scores_gemma":[0.9979877,0.00030048998,0.0012716886,0.00013614923,0.00022664665,0.000077318124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007427572,0.00010803312,0.00028953532,0.00012101151,0.00023329345,0.00015713982,0.0005051396,0.00003782657,0.000004420897],"category_scores_gemma":[0.000050443665,0.000085154454,0.00007813017,0.00007404255,0.00009497066,0.0001263046,0.00013403535,0.00010731796,0.0000041880007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018397526,0.00029482646,0.00002393944,0.00015517659,0.00006413821,0.000008109617,0.00068313023,0.14726733,0.00038756622,0.8347513,0.00007463366,0.016271466],"study_design_scores_gemma":[0.0008887263,0.000092498594,0.0021479072,0.00010143364,0.000037001944,0.00016700609,0.00007720302,0.4828863,0.0011357592,0.5122902,0.00004464379,0.00013132684],"about_ca_topic_score_codex":4.9671416e-7,"about_ca_topic_score_gemma":6.5196005e-8,"teacher_disagreement_score":0.42251864,"about_ca_system_score_codex":0.000010808981,"about_ca_system_score_gemma":0.00007779301,"threshold_uncertainty_score":0.34724978},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14509274,0.002235154,0.8491562,0.001833038,0.0006185799,0.00008060703,9.02192e-7,0.000020425303,0.00096234475],"genre_scores_gemma":[0.9722765,0.00013760425,0.026237998,0.000032378524,0.00054924213,1.7237535e-7,2.1563442e-7,0.000008603374,0.0007572671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998716,0.00006649914,0.0004247682,0.00012256746,0.00031923558,0.0003509541],"domain_scores_gemma":[0.99827164,0.000060591512,0.0008778937,0.0005387251,0.00013331848,0.00011782695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009303795,0.00010970015,0.0002871635,0.00010808914,0.00016464028,0.00010337028,0.0017854568,0.00005123904,0.00005819129],"category_scores_gemma":[0.00008726345,0.000089398425,0.00016923914,0.000093542156,0.00004053491,0.00060155557,0.00015572543,0.00039378053,0.000022868682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006954193,0.00010252188,0.00036152467,0.000022610264,0.00014060891,0.00003884863,0.0004035348,0.00010433215,0.0038540158,0.9364876,0.0011860126,0.057228852],"study_design_scores_gemma":[0.0060946424,0.003200389,0.005802321,0.0003410247,0.00013499212,0.0019881995,0.000074670694,0.025207482,0.11034149,0.795984,0.050060034,0.00077069894],"about_ca_topic_score_codex":0.000015411504,"about_ca_topic_score_gemma":0.00000426671,"teacher_disagreement_score":0.8271838,"about_ca_system_score_codex":0.000043892607,"about_ca_system_score_gemma":0.00058712834,"threshold_uncertainty_score":0.3645562},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000036162107,0.0002889936,0.23992784,0.00019857372,0.00020303819,0.00009910509,0.0000030907008,0.00007764792,0.75919807],"genre_scores_gemma":[0.0010752012,0.00021641306,0.005320909,0.00025051436,0.00011044105,0.000002921386,0.000017008357,0.000013880402,0.9929927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935615,0.0000075263197,0.0001357277,0.0002572993,0.00013920963,0.00010411563],"domain_scores_gemma":[0.9991623,0.000046415647,0.00011585004,0.0005716668,0.000037664446,0.00006609501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015631414,0.00016012917,0.00016366158,0.00007016003,0.00017790816,0.00019460157,0.0005189759,0.00012223353,0.00018285189],"category_scores_gemma":[0.000011979789,0.00012316219,0.00004142298,0.0000059245235,0.00006215418,0.0004059217,0.00024567972,0.000107768996,0.00010047149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.342431e-7,0.000002011808,0.0000013387132,0.000021773129,0.00001009371,0.000011635882,0.00004292477,4.6710502e-7,5.856433e-7,0.96330947,0.0004901214,0.03610896],"study_design_scores_gemma":[0.00008205235,0.00003281437,0.000011662311,0.0000556722,0.000009126671,0.000021126973,0.0000012845959,0.0042034932,0.000014892754,0.86957717,0.12578487,0.0002058528],"about_ca_topic_score_codex":0.0000047213593,"about_ca_topic_score_gemma":0.000009702514,"teacher_disagreement_score":0.23460694,"about_ca_system_score_codex":0.000009467934,"about_ca_system_score_gemma":0.00003766464,"threshold_uncertainty_score":0.50224084},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019264839,0.0007484025,0.023666697,0.00078823994,0.009802203,0.0012179952,0.00008855747,0.0012669826,0.96049446],"genre_scores_gemma":[0.1439116,0.00010395212,0.007421991,0.0001117292,0.0021907778,0.0000149420885,0.00021778043,0.00010865728,0.8459186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99288905,0.0002881909,0.001355444,0.0024449055,0.0020470852,0.0009753162],"domain_scores_gemma":[0.99272037,0.00038048264,0.0023810375,0.0029427977,0.00085525296,0.00072006165],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0005982856,0.0014345612,0.0012303623,0.0009977487,0.0060466463,0.00086393923,0.003718652,0.001070236,0.00006649679],"category_scores_gemma":[0.00015355014,0.0015810418,0.0010436849,0.00020601507,0.0010318473,0.0014538558,0.0012508384,0.0015110046,0.0001531063],"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.0003070088,0.00082125055,0.0005962745,0.00062632404,0.001407575,0.009431951,0.0019759152,0.0024487008,0.0020977193,0.9523351,0.0059141233,0.02203806],"study_design_scores_gemma":[0.003633497,0.00073001534,0.00066079275,0.0035658046,0.0012143957,0.0020307626,0.00012720391,0.018131368,0.008802814,0.0051207184,0.95146745,0.0045151915],"about_ca_topic_score_codex":0.0002845864,"about_ca_topic_score_gemma":0.000041823336,"teacher_disagreement_score":0.94721437,"about_ca_system_score_codex":0.0022838155,"about_ca_system_score_gemma":0.0025554535,"threshold_uncertainty_score":0.99984044},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85237956,0.00071907527,0.11090473,0.0069602365,0.01983299,0.0028108752,0.00011395878,0.0002587208,0.006019866],"genre_scores_gemma":[0.9936245,0.000015608652,0.0060204044,0.00009673639,0.000024246094,0.00004832142,0.0000026841444,0.000012066851,0.00015541914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884087,0.000060584756,0.0003438332,0.0002514003,0.00020300584,0.00030033037],"domain_scores_gemma":[0.9972753,0.0006075847,0.00045441874,0.0014510816,0.00013960943,0.00007203547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007935246,0.00016561463,0.00032409854,0.000060867886,0.0007085925,0.0002125429,0.0027772742,0.00006199324,0.000009914033],"category_scores_gemma":[0.00026767617,0.00011810868,0.00022008382,0.00009377459,0.00020471957,0.00049655954,0.0004611607,0.0001066397,0.00001574231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021538392,0.00005584545,0.00006525802,0.00004110619,0.0000676586,0.0000017658565,0.00037933784,0.0000027994245,0.00042266317,0.9883553,0.0013078767,0.009278849],"study_design_scores_gemma":[0.0013845416,0.00030228362,0.0023706506,0.000073748226,0.000034030556,0.00001030978,0.00007550202,0.013077892,0.009247792,0.9695276,0.0036923322,0.00020328563],"about_ca_topic_score_codex":0.00005093717,"about_ca_topic_score_gemma":0.0000061728183,"teacher_disagreement_score":0.14124496,"about_ca_system_score_codex":0.000025486912,"about_ca_system_score_gemma":0.000049636797,"threshold_uncertainty_score":0.5449992},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.165391,0.00017423843,0.4157848,0.13731658,0.0007519764,0.0014690853,0.00004169218,0.00011064908,0.27896],"genre_scores_gemma":[0.99496555,0.000005161916,0.0038683754,0.0005150388,0.000026321162,0.000009538839,6.2982963e-7,0.0000049343435,0.00060443406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935156,0.00004944476,0.00017727718,0.00013437674,0.00013209655,0.0001552712],"domain_scores_gemma":[0.9989912,0.00008848578,0.00009508241,0.0006499662,0.000027015978,0.00014824531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002947395,0.000070760456,0.00011581694,0.000030204748,0.00034247668,0.00015107486,0.00068934,0.000043343192,0.00021708896],"category_scores_gemma":[0.00018002337,0.00005056811,0.000047903904,0.000050931067,0.00014116157,0.00014325441,0.00006636964,0.0000755289,0.00014792912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001465897,0.000010992632,0.000056354875,0.000051462823,0.0000054853317,0.0000024886738,0.000529901,0.0000012077329,0.00013325035,0.98906106,0.0015989909,0.008547357],"study_design_scores_gemma":[0.0011659695,0.00008352472,0.00703759,0.00031851477,0.000043280183,0.0001204347,0.00016422031,0.017406894,0.009929896,0.8192221,0.14398225,0.000525329],"about_ca_topic_score_codex":0.0005785283,"about_ca_topic_score_gemma":0.0002810045,"teacher_disagreement_score":0.8295746,"about_ca_system_score_codex":0.000016264752,"about_ca_system_score_gemma":0.0000344527,"threshold_uncertainty_score":0.26340884},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024138484,0.00009746016,0.9695597,0.003782522,0.0006274375,0.00012243059,0.000002307233,0.00003961177,0.0016300237],"genre_scores_gemma":[0.3888267,0.000018199817,0.61032635,0.0001305458,0.00024021536,0.0000029166804,1.5983117e-7,0.000012024066,0.00044290535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842125,0.00006324695,0.0005752398,0.00014544776,0.00044197706,0.0003528486],"domain_scores_gemma":[0.997508,0.00021720341,0.0007420805,0.00094930344,0.0003030297,0.0002803818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015747607,0.00015983524,0.0003664946,0.0001571084,0.0006676331,0.0004419004,0.0020154947,0.00006596218,0.0000324308],"category_scores_gemma":[0.00089592324,0.00012254079,0.00018808497,0.00011594143,0.00007792678,0.00063924555,0.00040056396,0.00025094155,0.00008914914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003837994,0.0011804071,0.000120877456,0.00023206492,0.0002662305,0.0011318086,0.011950523,0.0020907165,0.01130038,0.9253981,0.0075364183,0.03875409],"study_design_scores_gemma":[0.0020297472,0.0008534843,0.0007513891,0.0009039343,0.00017997927,0.0030674702,0.0025550723,0.084111124,0.0023783462,0.89047295,0.011656698,0.0010398224],"about_ca_topic_score_codex":0.0000018881132,"about_ca_topic_score_gemma":0.0000015790264,"teacher_disagreement_score":0.36468822,"about_ca_system_score_codex":0.00003276564,"about_ca_system_score_gemma":0.00010537212,"threshold_uncertainty_score":0.5134961},"labels":[],"label_agreement":null},{"id":"W2765671816","doi":"10.1137/140986566","title":"On the Symmetric Componentwise Relative Backward Error for Linear Systems of Equations","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fondation Sciences et Technologies pour l’Aéronautique et l’Espace","keywords":"Mathematics; Upper and lower bounds; Order (exchange); Applied mathematics; Mathematical analysis","score_opus":0.034737947332930105,"score_gpt":0.32145655974525583,"score_spread":0.2867186124123257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765671816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003936555,0.00022817434,0.9920432,0.0024486457,0.00006505183,0.00039490502,0.000044286742,0.000013907573,0.0008252607],"genre_scores_gemma":[0.9920871,0.00008795539,0.0068608327,0.000050206225,0.00015331242,0.00009508694,0.000005358958,0.000006438009,0.0006536847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988625,0.000116967865,0.0003920313,0.00022220903,0.00025974525,0.00014655452],"domain_scores_gemma":[0.99689305,0.0012397433,0.00074901263,0.00079129776,0.000225945,0.00010092405],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011058816,0.00011800702,0.0002806498,0.00039232522,0.001474946,0.0003425058,0.00087031355,0.000044940665,0.000011469638],"category_scores_gemma":[0.0001962984,0.00007480011,0.00028733897,0.0006849046,0.00008763461,0.00021164381,0.00007411919,0.00019359365,0.00002099023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007644047,0.000083020226,0.00007608614,0.000009245312,0.00030915235,4.3567343e-7,0.00004659151,0.004495625,0.000041674764,0.9927825,0.00009704652,0.0020509893],"study_design_scores_gemma":[0.0006888795,0.0002661932,0.0022379882,0.00006451296,0.0009226763,0.000012029007,0.00015718798,0.85030794,0.00023661491,0.13542224,0.009406458,0.00027724658],"about_ca_topic_score_codex":0.0000097681495,"about_ca_topic_score_gemma":0.0000015491005,"teacher_disagreement_score":0.9881506,"about_ca_system_score_codex":0.000022273369,"about_ca_system_score_gemma":0.000031714666,"threshold_uncertainty_score":0.999825},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20621541,0.00015586709,0.7840511,0.0052906238,0.0006371599,0.00082010427,0.0000041400763,0.000008898044,0.002816651],"genre_scores_gemma":[0.89056057,0.000018758528,0.107838415,0.000023974182,0.00014912912,0.000011264,5.6189094e-8,0.000011677454,0.0013861343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982901,0.00011284314,0.00047488813,0.00008903491,0.00079479907,0.0002383113],"domain_scores_gemma":[0.9971745,0.00057040644,0.0006162375,0.00090593664,0.00066373264,0.000069189286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055664694,0.00007282408,0.0002271615,0.00012268267,0.00045376693,0.00041208894,0.0027598515,0.000048198042,0.000008592049],"category_scores_gemma":[0.001356385,0.000038369242,0.00016433974,0.00009377,0.00016438069,0.0005601613,0.00045598674,0.00029563616,0.0000043195287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006869249,0.0009956193,0.0002421948,0.002323147,0.00013972682,0.00003245633,0.010011025,0.00004208431,0.010547581,0.9396363,0.0025302034,0.03343101],"study_design_scores_gemma":[0.00074997905,0.00056634145,0.0006270019,0.00060189504,0.000014734581,0.00020831046,0.00024929186,0.03827929,0.020325322,0.93690246,0.0013723801,0.00010300203],"about_ca_topic_score_codex":0.0000017366261,"about_ca_topic_score_gemma":0.0000019495872,"teacher_disagreement_score":0.6843452,"about_ca_system_score_codex":0.000030641942,"about_ca_system_score_gemma":0.0001778639,"threshold_uncertainty_score":0.5128537},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045785468,0.000462658,0.9457176,0.0041166963,0.00024186049,0.0006254175,0.00002210071,0.0002606035,0.0027676416],"genre_scores_gemma":[0.9890057,0.0001943405,0.0073878327,0.00051355624,0.0007508486,0.00020024611,0.000006893551,0.000009277635,0.0019313038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992959,0.000035370587,0.00014868766,0.00024193192,0.00010042918,0.00017768354],"domain_scores_gemma":[0.9992117,0.00014500663,0.00005848306,0.0004163041,0.00008741638,0.000081057624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024461024,0.00008330562,0.00007222918,0.000020121119,0.0006644422,0.00013084925,0.0005577864,0.000032780215,0.000016080608],"category_scores_gemma":[0.000033947028,0.0000574973,0.000023238319,0.00022583382,0.00012416003,0.00015978058,0.00014777808,0.00008660654,0.00034210135],"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.000002138455,0.000020906191,0.00001009335,0.0000050018875,0.0000053182116,4.1561285e-7,0.00016512498,1.2679048e-7,0.0010219333,0.94909745,0.000052648604,0.049618866],"study_design_scores_gemma":[0.00028428185,0.00015232973,0.0012865182,0.000014136482,0.00001542959,0.000053407235,0.00003376697,0.12482538,0.006825017,0.078363255,0.7878194,0.00032708523],"about_ca_topic_score_codex":0.000001583941,"about_ca_topic_score_gemma":0.0000015814081,"teacher_disagreement_score":0.94322026,"about_ca_system_score_codex":0.0000061720507,"about_ca_system_score_gemma":0.000031979667,"threshold_uncertainty_score":0.51104194},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027297417,0.0045985696,0.9533932,0.004886805,0.018031096,0.0035664442,0.0010367153,0.00084624015,0.013367945],"genre_scores_gemma":[0.009060188,0.0063641,0.04969279,0.004715499,0.026331777,0.003271613,0.0036236523,0.00049504166,0.89644533],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958101,0.00012795656,0.00079745636,0.0017521902,0.00064739527,0.0008649303],"domain_scores_gemma":[0.99540406,0.00009980335,0.0006189667,0.0028629184,0.00032365363,0.0006905929],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00053902634,0.0008046043,0.00086534844,0.00037782695,0.0012062002,0.00063023274,0.0034744286,0.0009284336,0.00027224413],"category_scores_gemma":[0.00006424645,0.00077157136,0.00026387975,0.00042557437,0.00010132221,0.00052901945,0.0013197011,0.0015389712,0.0031023114],"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.000009928473,0.00020442031,0.000030138748,0.0003492387,0.000105193874,0.000015877404,0.0003184413,0.000011771318,0.000126022,0.2018317,0.7754912,0.021506077],"study_design_scores_gemma":[0.00032222553,0.000095302006,0.00019249141,0.00013672894,0.000076341545,0.000044024866,0.00002473897,0.0199443,0.0003370767,0.0066483207,0.9712347,0.00094378076],"about_ca_topic_score_codex":0.000064465494,"about_ca_topic_score_gemma":0.000018435285,"teacher_disagreement_score":0.9037004,"about_ca_system_score_codex":0.00006640675,"about_ca_system_score_gemma":0.00028414375,"threshold_uncertainty_score":0.9994735},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12030785,0.0005061026,0.8745412,0.00045213246,0.0033133167,0.00029790407,0.00000879243,0.000039054623,0.0005336173],"genre_scores_gemma":[0.86470866,0.00003354858,0.13457264,0.00004481639,0.00054803427,0.0000010352048,0.000006649536,0.000016644528,0.000067960544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703234,0.00030036794,0.0015201697,0.00029375567,0.0006257033,0.00022767176],"domain_scores_gemma":[0.9953081,0.00045906438,0.0029692263,0.00044063604,0.00071933784,0.00010363591],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001688994,0.00026501386,0.00085347367,0.0006154554,0.000078063174,0.00022156806,0.0012198451,0.00020964033,0.00001527961],"category_scores_gemma":[0.00010488466,0.00024584308,0.0004410929,0.00035240388,0.000051179424,0.0004121134,0.0006858975,0.0006565236,0.000020332342],"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.000072642026,0.0004236227,0.00019748726,0.00088428624,0.00036062853,0.00003251163,0.004290024,0.8804597,0.0009332293,0.03088893,0.0014513312,0.08000556],"study_design_scores_gemma":[0.0011825452,0.0002314808,0.0017361961,0.0009185466,0.000103297956,0.00021447826,0.00009560847,0.9365437,0.0009126943,0.057380002,0.00027681465,0.00040462537],"about_ca_topic_score_codex":0.000011323516,"about_ca_topic_score_gemma":2.0743175e-7,"teacher_disagreement_score":0.7444008,"about_ca_system_score_codex":0.00009214192,"about_ca_system_score_gemma":0.00047422695,"threshold_uncertainty_score":0.9999994},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009438164,0.00009979965,0.97081083,0.00191062,0.000072486066,0.00056919816,0.000018729404,0.00013520525,0.016944945],"genre_scores_gemma":[0.9250031,0.00003670927,0.065803766,0.0006391786,0.00037212053,0.0007292125,0.000014099021,0.000014682251,0.0073871133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924994,0.000017708033,0.00012866862,0.00035398814,0.00008910283,0.0001606012],"domain_scores_gemma":[0.9987892,0.000027430086,0.000051670115,0.0008855081,0.00006948043,0.00017673695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014133487,0.00010024624,0.00010703706,0.00005221101,0.0010074488,0.0003092005,0.0007718658,0.000045437584,0.00001099091],"category_scores_gemma":[0.000029193387,0.00008937459,0.00002933467,0.00015217156,0.000034567987,0.00032625042,0.0002959103,0.000091953945,0.00029567478],"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.0000019605975,0.00008548559,0.000016426604,0.000008124984,0.000010020689,2.6090515e-7,0.00016517646,0.000028287637,0.0008040893,0.9849348,0.00036647977,0.013578853],"study_design_scores_gemma":[0.0010929605,0.00015585354,0.004500812,0.000021970438,0.000049635248,0.000047020974,0.00018911134,0.28251544,0.008525523,0.041071597,0.6608502,0.0009798245],"about_ca_topic_score_codex":0.0000073016827,"about_ca_topic_score_gemma":9.225428e-7,"teacher_disagreement_score":0.9438632,"about_ca_system_score_codex":0.00000628873,"about_ca_system_score_gemma":0.000028546614,"threshold_uncertainty_score":0.77485836},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16285834,0.00005785387,0.8351169,0.0009039466,0.00010511192,0.00033506763,0.000015312133,0.00004763596,0.00055979483],"genre_scores_gemma":[0.59542376,0.0000055497235,0.40403655,0.000038958002,0.00003536275,0.0000087901735,0.0000013089116,0.000012167582,0.00043756262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986189,0.000029631587,0.00043550544,0.00031246385,0.00035823288,0.00024524194],"domain_scores_gemma":[0.99820065,0.00034174442,0.00045998124,0.0006707602,0.00019945842,0.00012740893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006898607,0.00018848853,0.00035588717,0.0001442565,0.00033232506,0.0005336351,0.00074134616,0.00006042082,0.000009793403],"category_scores_gemma":[0.0003278946,0.00017307824,0.00007065234,0.00014492737,0.00007840369,0.00050712336,0.0004545002,0.000084685955,0.000052205833],"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.00011297681,0.0029599182,0.0013422173,0.0043889554,0.00032468568,0.00017285303,0.0951661,0.0108073745,0.08710345,0.62421197,0.0038806356,0.16952889],"study_design_scores_gemma":[0.0007014342,0.00025266947,0.0015642358,0.0003530908,0.000036454447,0.000062437255,0.00019490987,0.81841916,0.013745711,0.16392891,0.00037388297,0.0003670876],"about_ca_topic_score_codex":0.00001939688,"about_ca_topic_score_gemma":0.0000021973112,"teacher_disagreement_score":0.8076118,"about_ca_system_score_codex":0.000021922071,"about_ca_system_score_gemma":0.00006831247,"threshold_uncertainty_score":0.70579255},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039296936,0.000009926407,0.9217377,0.0014510402,0.00017876345,0.00013520119,1.3959809e-7,0.00017070533,0.037019596],"genre_scores_gemma":[0.93253815,0.0000025325135,0.060813688,0.00072059844,0.000052372092,0.000029707007,6.504103e-7,0.0000029419912,0.0058393776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949133,0.0000259129,0.00009949514,0.00014899917,0.00010657639,0.00012770042],"domain_scores_gemma":[0.99960566,0.0000332212,0.000020622902,0.00024325785,0.000045875775,0.000051352206],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012364455,0.000053761196,0.00005517491,0.00003051598,0.000045349225,0.00011671615,0.0003117866,0.000020414831,0.00065065495],"category_scores_gemma":[0.000006865556,0.000041660045,0.000027925931,0.00011565519,0.0000077207,0.00049688056,0.000042505966,0.00003511347,0.0012659957],"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":[4.5820278e-7,0.000029079598,0.000032638465,0.0000027885978,0.0000036208903,0.000001128947,0.00038310967,0.000011931431,0.0042024953,0.8937,0.0052364273,0.09639633],"study_design_scores_gemma":[0.0010513507,0.00019490856,0.010374014,0.00002271441,0.0000068193867,0.000035590918,0.00024302008,0.65665156,0.05620771,0.23706585,0.03744116,0.00070532766],"about_ca_topic_score_codex":0.000031824293,"about_ca_topic_score_gemma":0.0000010112248,"teacher_disagreement_score":0.89324117,"about_ca_system_score_codex":0.000005805063,"about_ca_system_score_gemma":0.000007669021,"threshold_uncertainty_score":0.99951166},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25325474,0.001384901,0.14959764,0.096465945,0.024818191,0.0022552223,0.00013007919,0.0007615038,0.47133178],"genre_scores_gemma":[0.9780263,0.00004402889,0.0043535633,0.001514168,0.0120413,0.00002461372,0.0000016012128,0.000013158372,0.003981306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911386,0.00004103883,0.00012112085,0.00025434216,0.00024115593,0.00022849083],"domain_scores_gemma":[0.9987273,0.00006638575,0.000108473825,0.0009827913,0.00003483683,0.0000801656],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031182397,0.00011074191,0.000115528586,0.000043431995,0.00085513503,0.0010193794,0.0024958,0.000035520643,0.00022234414],"category_scores_gemma":[0.000052641164,0.00006983192,0.000060669547,0.00009375068,0.000050056005,0.00033761776,0.00054124056,0.0001095914,0.00079490594],"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.000024064006,0.00004872609,0.00035798407,0.000022596194,0.000026174504,0.00007403376,0.0035797814,0.000045161592,0.00010351658,0.79403275,0.07868466,0.12300053],"study_design_scores_gemma":[0.00019294675,0.0000648796,0.007607577,0.000013996552,0.000007642442,0.000026689228,0.00007261333,0.00052809296,0.00031937432,0.024615528,0.96634877,0.00020191725],"about_ca_topic_score_codex":0.00008444595,"about_ca_topic_score_gemma":0.000087086984,"teacher_disagreement_score":0.8876641,"about_ca_system_score_codex":0.000019016321,"about_ca_system_score_gemma":0.000032826312,"threshold_uncertainty_score":0.9999831},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007286687,0.0006291759,0.96551484,0.010454014,0.0005556264,0.0010989736,0.000052119696,0.0003680159,0.020598566],"genre_scores_gemma":[0.023886157,0.00018391447,0.9705688,0.00010702232,0.000069483176,0.00039345634,0.00015491275,0.000047958725,0.0045883255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.990565,0.006623217,0.0006836701,0.00124068,0.00034280494,0.00054465],"domain_scores_gemma":[0.99037737,0.003645335,0.00071783457,0.0029639765,0.0020525518,0.00024290588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.015114595,0.0004330394,0.0005079789,0.0004807972,0.0005135997,0.0007878014,0.0033720136,0.0003697912,0.000035665904],"category_scores_gemma":[0.0010081474,0.00039485176,0.00039607452,0.0007321319,0.0001340658,0.0003610202,0.002458904,0.00048347397,0.000041220363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008563689,0.0003533254,0.000029335924,0.00028967162,0.00007993299,0.0000017782368,0.0025059362,0.00011844312,0.00361215,0.68167186,0.00088347384,0.31044555],"study_design_scores_gemma":[0.0012174457,0.0000018347832,0.00021903736,0.002357978,0.000049450842,0.00002392803,0.000028857325,0.25415722,0.07815325,0.63386554,0.028944597,0.0009808781],"about_ca_topic_score_codex":0.00006998493,"about_ca_topic_score_gemma":0.000036744696,"teacher_disagreement_score":0.30946466,"about_ca_system_score_codex":0.00016725177,"about_ca_system_score_gemma":0.0002726161,"threshold_uncertainty_score":0.99985033},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015274364,0.0017354188,0.8767911,0.0013441974,0.0016093535,0.0009902576,0.000049465365,0.000377036,0.101828806],"genre_scores_gemma":[0.77600837,0.00018480046,0.01474147,0.0005850873,0.00026568046,0.000052685737,0.00018638992,0.000026604563,0.20794891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998486,0.0001275963,0.00031767404,0.0005749799,0.00025223228,0.00024155206],"domain_scores_gemma":[0.9982951,0.0002587306,0.00026801872,0.00087251974,0.00017494684,0.00013064913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037117713,0.00030049845,0.0006062579,0.00026873496,0.00042180577,0.00058055884,0.00091336534,0.00024916098,0.0002145665],"category_scores_gemma":[0.0001074326,0.0002414292,0.00019451865,0.0002745172,0.000031765718,0.00036478095,0.000045901885,0.00029480027,0.000052517815],"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.0003838721,0.0003593508,0.0008386989,0.0006778533,0.008920404,0.00039545455,0.017461115,0.0007043257,0.0010816042,0.7311913,0.0035581836,0.23442784],"study_design_scores_gemma":[0.0028504066,0.0007946819,0.004086003,0.000229398,0.003227298,0.000016463455,0.0011917055,0.95410436,0.009096929,0.013335374,0.008541476,0.0025259182],"about_ca_topic_score_codex":0.00016415029,"about_ca_topic_score_gemma":0.0012851594,"teacher_disagreement_score":0.9534,"about_ca_system_score_codex":0.000013041283,"about_ca_system_score_gemma":0.00010622399,"threshold_uncertainty_score":0.9845197},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013328744,0.0062426343,0.013298277,0.0001394453,0.0003376631,0.00016620534,0.000034336124,0.000101618476,0.97954655],"genre_scores_gemma":[0.020921547,0.004336519,0.009741554,0.00009184046,0.00024944474,0.0000029947792,0.000008373712,0.0000371799,0.9646105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901104,0.0000161932,0.00026856828,0.00037310625,0.00016471758,0.00016637045],"domain_scores_gemma":[0.99837023,0.00015388893,0.0004032256,0.00091822934,0.0000744065,0.00008002167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030859018,0.0002733293,0.0004073012,0.00021167041,0.00014736508,0.00012255009,0.0014260391,0.00017614143,0.000120047545],"category_scores_gemma":[0.000008899128,0.00018849349,0.00010318868,0.000018602725,0.00014244333,0.00039402963,0.0006201123,0.00016152608,0.000036469322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003725509,0.000006580511,0.0000058529936,0.000110143454,0.000050594597,0.000018410741,0.00011787506,3.4393076e-7,0.000007798141,0.908924,0.00038783258,0.09036684],"study_design_scores_gemma":[0.00031365268,0.00015544302,0.00010679188,0.0002880402,0.000046327074,0.00008025115,0.000027483655,0.0020951722,0.00075314357,0.840956,0.15443379,0.0007439518],"about_ca_topic_score_codex":0.00003811403,"about_ca_topic_score_gemma":0.000008879009,"teacher_disagreement_score":0.15404595,"about_ca_system_score_codex":0.000006599223,"about_ca_system_score_gemma":0.000048942296,"threshold_uncertainty_score":0.76865417},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06921041,0.00014143091,0.92881453,0.00029091767,0.000445396,0.000008351385,5.5701474e-7,0.000013027731,0.0010754066],"genre_scores_gemma":[0.96701986,0.00010648012,0.031611495,0.00023748267,0.0008805874,2.5163845e-7,1.6728687e-7,0.0000036814047,0.00013998503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932647,0.00007329163,0.00017830034,0.000112345595,0.00018301245,0.00012659366],"domain_scores_gemma":[0.9994396,0.000053888267,0.00012263357,0.000159151,0.00014022084,0.00008448608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002070456,0.00007853484,0.00015260543,0.00003153737,0.00009414084,0.000051569325,0.00035864284,0.00004273275,0.000011269497],"category_scores_gemma":[0.000008257825,0.000055259996,0.000053721513,0.000121546225,0.000092546004,0.0005478909,0.00011916952,0.00009367507,0.000002489888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011733044,0.000036762245,0.0000031634522,0.0000014199576,0.0000095173955,0.000013003019,0.00010723341,0.00018612541,0.0001416691,0.96858793,0.00017327834,0.030728176],"study_design_scores_gemma":[0.00019379254,0.00038011363,0.000029553174,0.000012328527,0.000005218283,0.00009284283,0.000009374795,0.015553288,0.010308594,0.9721367,0.0012035633,0.00007467677],"about_ca_topic_score_codex":0.000008169932,"about_ca_topic_score_gemma":3.8176134e-7,"teacher_disagreement_score":0.89780945,"about_ca_system_score_codex":0.000012395114,"about_ca_system_score_gemma":0.00003002097,"threshold_uncertainty_score":0.22534372},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036077235,0.000978177,0.9569842,0.00046136198,0.0020841158,0.0024488484,0.00027133434,0.0005193692,0.00017532849],"genre_scores_gemma":[0.7342254,0.000103294566,0.2623774,0.0008430808,0.0012450967,0.00019376558,0.0005129864,0.000120653705,0.0003783012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99362355,0.00046802667,0.0016676339,0.0016333204,0.0011394146,0.001468041],"domain_scores_gemma":[0.9958665,0.00045866135,0.0010797976,0.00081138476,0.0011360866,0.00064757135],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012122681,0.0010778053,0.0013830285,0.00043522014,0.0014581648,0.0015224019,0.0009669285,0.0005106748,0.00007582435],"category_scores_gemma":[0.00020620643,0.00093801867,0.00039594912,0.0011057849,0.00027179817,0.0029468765,0.00034069663,0.00038244235,0.00004348805],"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.0013080202,0.0008418088,0.00018456399,0.0005798244,0.0009531733,0.0000550027,0.005456984,0.42245087,0.007899594,0.52572805,0.0010368841,0.033505265],"study_design_scores_gemma":[0.0057190713,0.00082661404,0.00008650006,0.00015791874,0.00023476855,0.00008423992,0.00012746167,0.9793629,0.0004195278,0.0055114594,0.006407289,0.0010622151],"about_ca_topic_score_codex":0.000027301025,"about_ca_topic_score_gemma":0.000015216791,"teacher_disagreement_score":0.6981482,"about_ca_system_score_codex":0.00040018983,"about_ca_system_score_gemma":0.00025727059,"threshold_uncertainty_score":0.9998418},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6298585,0.00020796638,0.3000006,0.00017048682,0.00030658412,0.00013737977,0.0000098830415,0.00019379523,0.06911478],"genre_scores_gemma":[0.9812383,0.000098914206,0.017917255,0.000113670474,0.00006983284,0.0000016475874,0.0000022589231,0.000008711652,0.0005493859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887985,0.0001848517,0.00014442285,0.00025891722,0.00024967792,0.00028229193],"domain_scores_gemma":[0.9985304,0.0007140055,0.00014741742,0.00045661037,0.00004670476,0.000104879364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061728625,0.00013580668,0.00022165144,0.00046926198,0.00010693545,0.00009028063,0.00091495353,0.000114301845,0.00006821122],"category_scores_gemma":[0.00009799866,0.00013514764,0.00011608015,0.0011408962,0.00012182293,0.0005765836,0.00022653754,0.00013426914,0.000045209446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001985592,0.00008440192,0.0021872069,0.000055812372,0.000034586028,0.000022517042,0.0014380859,0.00018696408,0.00032659245,0.8988069,0.0013370055,0.09550004],"study_design_scores_gemma":[0.004432136,0.00079247536,0.12162354,0.00012783296,0.00013708044,0.00007975209,0.0012180387,0.2616337,0.008000026,0.3847438,0.21565063,0.0015609646],"about_ca_topic_score_codex":0.0001424909,"about_ca_topic_score_gemma":0.000007730656,"teacher_disagreement_score":0.5140631,"about_ca_system_score_codex":0.00003940462,"about_ca_system_score_gemma":0.000054919656,"threshold_uncertainty_score":0.55111605},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7124931,0.0006834646,0.01063989,0.014704823,0.06438992,0.0010630765,0.000008001923,0.001915099,0.19410263],"genre_scores_gemma":[0.9935302,0.000008501415,0.00050233974,0.0003627439,0.0000902989,0.000011119886,6.7462844e-7,0.00001223943,0.005481863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868476,0.00014237221,0.00018353258,0.0003183329,0.00031893112,0.00035206007],"domain_scores_gemma":[0.9985694,0.000254508,0.00008160188,0.00089027046,0.00010278319,0.00010140109],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004727627,0.00015331083,0.000120689205,0.000051839623,0.0005532006,0.00024678436,0.0013520021,0.00007436113,0.00008515688],"category_scores_gemma":[0.000025164083,0.000102270154,0.000060662056,0.00045812188,0.00014782355,0.00021354888,0.00024963677,0.00018551604,0.0009665108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013328295,0.00004533996,0.0001457771,0.0000015373838,0.000013183007,0.000007277732,0.00008107236,2.2704037e-7,0.000032738386,0.9860658,0.0073355087,0.006258176],"study_design_scores_gemma":[0.00048805354,0.00022855784,0.0018748224,0.000010914746,0.000003055557,0.00000415241,0.0000061182977,0.0034444917,0.0018609735,0.8775025,0.11440794,0.00016839984],"about_ca_topic_score_codex":0.000007899588,"about_ca_topic_score_gemma":0.0000010350007,"teacher_disagreement_score":0.28103712,"about_ca_system_score_codex":0.000036089637,"about_ca_system_score_gemma":0.000039223643,"threshold_uncertainty_score":0.99981135},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049103764,0.00010867899,0.9898391,0.0020341256,0.00021467394,0.0002872229,0.0000012270665,0.00016199218,0.0024426247],"genre_scores_gemma":[0.009480035,0.000016450225,0.98650783,0.00008187905,0.000022459843,8.504728e-7,0.00000633437,0.000010595854,0.0038735862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895054,0.000028776783,0.00011578869,0.00036362966,0.00023458252,0.0003066896],"domain_scores_gemma":[0.99905765,0.00008136115,0.00013071648,0.00049360207,0.00009904325,0.00013760068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029104136,0.00014029854,0.00022635557,0.00015152416,0.00024091308,0.000030141136,0.00096220983,0.00010792454,0.000044579083],"category_scores_gemma":[0.000019007663,0.00016737568,0.00017372801,0.00028894754,0.00010265089,0.00041190226,0.00017564667,0.00012520915,0.000060578608],"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.00022601691,0.0006732075,0.00012840121,0.0002624769,0.000099261095,0.00018419031,0.0019548514,0.0007031619,0.0017617835,0.8111753,0.004518368,0.17831299],"study_design_scores_gemma":[0.007019158,0.00071519974,0.0006542437,0.000116324554,0.000078396624,0.000016761089,0.0000807047,0.74784154,0.009997168,0.11468491,0.11800157,0.0007940107],"about_ca_topic_score_codex":0.0002769842,"about_ca_topic_score_gemma":0.0000022798977,"teacher_disagreement_score":0.7471384,"about_ca_system_score_codex":0.00006952975,"about_ca_system_score_gemma":0.0001744672,"threshold_uncertainty_score":0.6825382},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17832632,0.00006899802,0.8211727,0.00009608909,0.00001802536,0.000188035,0.000006783218,0.00003511341,0.000087918226],"genre_scores_gemma":[0.6303755,0.000011478247,0.3695303,0.000016967355,0.000016184435,0.000011259677,0.0000011492258,0.000006064074,0.00003111486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823886,0.000099469726,0.0006453709,0.0004697487,0.00031265998,0.00023386815],"domain_scores_gemma":[0.9983954,0.00046243324,0.00029749345,0.0004408008,0.00021244833,0.000191429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005492553,0.00019427524,0.0007081263,0.00041295768,0.0001096512,0.00005769616,0.0002810309,0.00010180865,0.000025998657],"category_scores_gemma":[0.000118050935,0.00015566697,0.00014951447,0.0017036202,0.0001947681,0.00018874733,0.00016131075,0.00009082284,0.000016720942],"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.00049468904,0.002195409,0.0012453585,0.0015313642,0.002525542,0.00008448149,0.018278882,0.045426533,0.0039871554,0.7678323,0.0000476965,0.15635058],"study_design_scores_gemma":[0.00018956156,0.00019823397,0.000015884772,0.000029188524,0.000256344,0.00003724856,0.000098625744,0.9245421,0.0039057652,0.0705496,0.000012730933,0.00016467544],"about_ca_topic_score_codex":0.00003495391,"about_ca_topic_score_gemma":5.808496e-7,"teacher_disagreement_score":0.8791156,"about_ca_system_score_codex":0.000011632705,"about_ca_system_score_gemma":0.000013920994,"threshold_uncertainty_score":0.6347915},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03644435,0.008836688,0.9494175,0.0020452992,0.0002780199,0.0013374878,0.00023601128,0.00012539879,0.0012792605],"genre_scores_gemma":[0.8179247,0.007117726,0.17004311,0.0002686298,0.0018691401,0.0010830674,0.00009742366,0.000054346594,0.0015418726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989534,0.00007958237,0.00036027716,0.00030441728,0.0001695229,0.0001328048],"domain_scores_gemma":[0.99852675,0.00022205121,0.00032287795,0.0007010952,0.00016814233,0.000059086895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003276397,0.0001332185,0.00024874447,0.00005294945,0.00015013502,0.000047550482,0.0009904257,0.00010780158,0.000015780914],"category_scores_gemma":[0.000025289353,0.000092060145,0.0000925231,0.00025928463,0.00011477232,0.000053605676,0.0007547639,0.00015473517,0.000016512742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015318805,0.0000733981,0.000045250923,0.0002551481,0.00008876621,3.462535e-7,0.00059817237,0.00004346324,0.000273387,0.9726583,0.00070480246,0.025243647],"study_design_scores_gemma":[0.0008946092,0.00018342784,0.00069460616,0.0001376958,0.00017434412,0.000020332405,0.00007145374,0.36876068,0.012995698,0.43170184,0.18362986,0.0007354621],"about_ca_topic_score_codex":0.00001493666,"about_ca_topic_score_gemma":6.707459e-7,"teacher_disagreement_score":0.7814803,"about_ca_system_score_codex":0.000004537097,"about_ca_system_score_gemma":0.00005722856,"threshold_uncertainty_score":0.37541038},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062950132,0.0020208878,0.11530475,0.0001697144,0.0024946486,0.0016774621,0.00008339483,0.00060445035,0.8713497],"genre_scores_gemma":[0.0006049868,0.0006679061,0.7715474,0.0002670277,0.00014893209,0.00001708007,0.000019994617,0.00006754258,0.22665912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855334,0.000022102175,0.0005008119,0.00042508263,0.00024837794,0.00025029844],"domain_scores_gemma":[0.99895555,0.000120119264,0.00030021768,0.00048378346,0.000061295905,0.00007902319],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003822392,0.00039822506,0.00047789022,0.00028998606,0.00008986228,0.00016022476,0.00084485067,0.00024557958,0.000231603],"category_scores_gemma":[0.000029474462,0.00031146588,0.000050299823,0.00008331355,0.00010501355,0.00017820451,0.00057884405,0.00020085594,0.000106338135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033527656,0.000020342222,0.000009494864,0.00030535983,0.000095519295,0.000030931362,0.007209228,0.0000010566906,0.000017791424,0.975355,0.0013878015,0.015564109],"study_design_scores_gemma":[0.00031543046,0.000016366577,0.00001502584,0.00032585664,0.000008626109,0.000042918036,0.000052218566,0.0016751301,0.00029432494,0.9380142,0.058750313,0.0004895698],"about_ca_topic_score_codex":9.512621e-7,"about_ca_topic_score_gemma":0.0000056122144,"teacher_disagreement_score":0.65624267,"about_ca_system_score_codex":0.000055679324,"about_ca_system_score_gemma":0.00010153482,"threshold_uncertainty_score":0.9999337},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87253296,0.016654572,0.091796085,0.011322105,0.00042795762,0.004120019,0.00073562574,0.00016756493,0.002243095],"genre_scores_gemma":[0.98057365,0.00071062276,0.018229147,0.00011124837,0.00022981879,0.000038410075,0.000020429854,0.000014735167,0.0000719072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848294,0.00007596363,0.0003851137,0.00061302417,0.0002746926,0.0001682336],"domain_scores_gemma":[0.9982687,0.0003984763,0.00038502,0.00070968847,0.00015123263,0.000086846114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019087364,0.00023216965,0.0003567344,0.00031490764,0.00012265009,0.000071828115,0.0008499057,0.00013511932,0.000019276275],"category_scores_gemma":[0.00017157722,0.00016306546,0.00006529995,0.0017432818,0.000093073104,0.00008137319,0.0006983832,0.00044520525,0.000008049889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005084182,0.000055143126,0.000014236835,0.00032555297,0.000047585283,4.4011162e-7,0.00021915627,0.000026558391,0.0010113791,0.9898244,0.00010646101,0.008363981],"study_design_scores_gemma":[0.0003902847,0.00025485962,0.0029468276,0.00012405677,0.00016901596,0.000019548415,0.000052502313,0.04341918,0.072769575,0.8753301,0.003939905,0.0005841573],"about_ca_topic_score_codex":0.000009881404,"about_ca_topic_score_gemma":5.8154876e-7,"teacher_disagreement_score":0.11449434,"about_ca_system_score_codex":0.000008797713,"about_ca_system_score_gemma":0.00008305028,"threshold_uncertainty_score":0.66496164},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31948245,0.008124673,0.6613468,0.0013892289,0.0073980303,0.0016578637,0.00013744058,0.00007381777,0.00038967203],"genre_scores_gemma":[0.4551549,0.00027310467,0.54187715,0.00077652634,0.001741661,0.00002387517,0.000015982816,0.000052852905,0.00008393866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974308,0.00011459193,0.0008551291,0.0005975099,0.00054159306,0.00046037213],"domain_scores_gemma":[0.99761814,0.0004002774,0.00076672673,0.000744553,0.0002410515,0.0002292293],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006995637,0.0005085118,0.0007899384,0.0003975103,0.00017266734,0.00055102404,0.002476133,0.00026144378,0.000024671572],"category_scores_gemma":[0.000037543705,0.00043555239,0.0004121505,0.00012666539,0.000045836587,0.00051753956,0.002617867,0.00066362566,0.000010400668],"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.0026358378,0.006223291,0.0005598679,0.003614233,0.004602722,0.0014816462,0.04539084,0.012656161,0.097204894,0.14541383,0.017902039,0.66231465],"study_design_scores_gemma":[0.004327588,0.0038195448,0.00024373816,0.0012638604,0.00010984934,0.001338878,0.00048999663,0.9278987,0.030792564,0.019474413,0.008679879,0.0015609899],"about_ca_topic_score_codex":0.0000037055936,"about_ca_topic_score_gemma":2.153598e-7,"teacher_disagreement_score":0.91524255,"about_ca_system_score_codex":0.0001476182,"about_ca_system_score_gemma":0.00012696165,"threshold_uncertainty_score":0.9998096},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032627452,0.00004301531,0.89953107,0.0009319496,0.00018734577,0.00036579676,0.0000028829272,0.00022905535,0.06608146],"genre_scores_gemma":[0.9805166,0.0000053974695,0.01601982,0.000031653228,0.0000164637,0.0000080001055,0.0000063796756,0.00001179892,0.003383861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986961,0.00032777,0.00026779008,0.0002905896,0.00019175159,0.00022599018],"domain_scores_gemma":[0.999219,0.00020548314,0.00006969473,0.00037248843,0.000016146882,0.000117198455],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001670087,0.00013311293,0.0002031021,0.0000545477,0.00006212612,0.00015732233,0.00034606847,0.000079499114,0.00045408893],"category_scores_gemma":[0.00007374882,0.000094541465,0.00004555211,0.0002838006,0.00005356928,0.0003608648,0.00016539339,0.00014590228,0.0008740599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.90471e-7,0.000041639018,0.00064274936,0.00007304446,0.00000915324,0.0000023017337,0.00038105782,0.000006569395,0.000053350148,0.9908311,0.000010001285,0.0079484945],"study_design_scores_gemma":[0.00031057606,0.00007817967,0.010568201,0.00010330107,0.000005043304,0.000045260615,0.000021032269,0.13972542,0.00013311062,0.84862494,0.00015351805,0.0002314397],"about_ca_topic_score_codex":0.0000036876993,"about_ca_topic_score_gemma":9.59876e-7,"teacher_disagreement_score":0.94788915,"about_ca_system_score_codex":0.000014828475,"about_ca_system_score_gemma":0.00001585425,"threshold_uncertainty_score":0.99990386},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021130977,0.00009950857,0.97601753,0.00044547816,0.0011578542,0.0004917256,0.000007047423,0.00025817845,0.0003916711],"genre_scores_gemma":[0.99176204,0.0000012973354,0.0076011526,0.00028035988,0.00020830544,0.000071798415,0.000026340418,0.000005490861,0.000043240878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989761,0.000046353856,0.00041634194,0.00016364083,0.00018371273,0.00021381272],"domain_scores_gemma":[0.99921685,0.00005045686,0.00029419598,0.00011882125,0.00023813387,0.00008155383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003970576,0.00012516453,0.0001345298,0.00013013605,0.0005086145,0.00085259735,0.00021560729,0.000050406747,0.0000021146784],"category_scores_gemma":[0.0000363503,0.000110827124,0.00003196218,0.00020363709,0.00005003113,0.0035663093,0.000050038096,0.000058247973,0.000025278512],"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.000064313586,0.00006533186,0.00029694405,0.0023483143,0.000043529548,0.0000010699089,0.023963066,0.005529683,0.0002403755,0.15283337,0.0031152957,0.8114987],"study_design_scores_gemma":[0.0003394335,0.00013225342,0.00040041166,0.00011468171,0.000005801385,0.00003462402,0.000110667985,0.9911131,0.00066678744,0.0016468378,0.005275068,0.00016027749],"about_ca_topic_score_codex":0.000009698578,"about_ca_topic_score_gemma":0.0000012710055,"teacher_disagreement_score":0.9855835,"about_ca_system_score_codex":0.00004656398,"about_ca_system_score_gemma":0.000042140262,"threshold_uncertainty_score":0.8221616},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01916954,0.00023322231,0.97895575,0.0012064887,0.0001694739,0.00012152568,0.000015680169,0.0000063012603,0.00012203126],"genre_scores_gemma":[0.98610806,0.000034655994,0.013130823,0.00017245916,0.0004342784,0.000026843049,0.0000011991295,0.0000021843973,0.000089509274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992339,0.000032472784,0.00034060853,0.000118016236,0.00019742234,0.00007755007],"domain_scores_gemma":[0.9986294,0.00029773652,0.00022969008,0.00010175568,0.00068229524,0.0000591402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007028956,0.00005405795,0.00017008319,0.00095574936,0.0000657082,0.00023182767,0.0005566724,0.000018872857,0.000004535007],"category_scores_gemma":[0.000079323865,0.000044226872,0.000090602996,0.0008586687,0.000026828542,0.00022199337,0.00004256073,0.00003853448,0.0000035167147],"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.00017659477,0.00020889948,0.01187523,0.000015531978,0.0018271029,0.00000852,0.0009820418,0.0065064305,0.0016610636,0.88005835,0.00085596595,0.0958243],"study_design_scores_gemma":[0.003480048,0.00081305165,0.030372877,0.00017960773,0.001027296,0.00017055249,0.0014827787,0.7411298,0.0037989272,0.07630439,0.14054428,0.00069636933],"about_ca_topic_score_codex":0.000014835876,"about_ca_topic_score_gemma":0.000006472105,"teacher_disagreement_score":0.9669385,"about_ca_system_score_codex":0.000026611719,"about_ca_system_score_gemma":0.000023170642,"threshold_uncertainty_score":0.22355194},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008505155,0.000038296275,0.9904381,0.00022976146,0.000025816436,0.00020908094,0.0000037034324,0.000018825687,0.00053128635],"genre_scores_gemma":[0.31080085,0.0000030087929,0.68892473,0.000074625845,0.00016177377,0.000010414986,0.0000012261034,0.0000044170088,0.00001897141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934846,0.0000062554664,0.00027448963,0.00009218636,0.00018968561,0.00008892939],"domain_scores_gemma":[0.9986502,0.0006020947,0.00032435817,0.00007498162,0.0002883267,0.000060034698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023709245,0.00008159227,0.00015140913,0.00007838211,0.0001489145,0.00009178113,0.0002153405,0.000024200539,0.0000031699599],"category_scores_gemma":[0.0000080477885,0.000058289777,0.00003133225,0.00014306801,0.000056246074,0.00012576877,0.000030460847,0.000051401516,0.000004589528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044219254,0.00015803898,0.0000010813313,0.00010893929,0.000048915586,0.0000023183065,0.00083949394,0.011424054,0.00022441841,0.95385593,0.00010724657,0.033185348],"study_design_scores_gemma":[0.00059924566,0.00030456096,0.000009117653,0.000038800204,0.000030582203,0.00040114578,0.00010446049,0.25062355,0.0007032132,0.74495536,0.0021167505,0.000113175076],"about_ca_topic_score_codex":5.928006e-8,"about_ca_topic_score_gemma":1.1850997e-7,"teacher_disagreement_score":0.30229568,"about_ca_system_score_codex":0.000010201149,"about_ca_system_score_gemma":0.0000458271,"threshold_uncertainty_score":0.23769881},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4261168,0.0010554058,0.56791395,0.0029914633,0.00034246323,0.00033037257,0.000004112254,0.0002663332,0.0009790878],"genre_scores_gemma":[0.63487446,0.00018164021,0.36434022,0.0005102328,0.000057392488,0.000012483322,0.000003301384,0.0000061096957,0.000014191106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984129,0.0004345782,0.00033858424,0.00040058157,0.00014431267,0.0002690538],"domain_scores_gemma":[0.9944319,0.0013790434,0.00012054335,0.0038056448,0.00018310771,0.0000797608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038755938,0.00017471632,0.0002674869,0.000316583,0.00032758102,0.00022832608,0.004294759,0.000069067304,0.000009089415],"category_scores_gemma":[0.000110526285,0.00017362605,0.00004247817,0.0012399466,0.0006257717,0.0005119065,0.0050434554,0.00027292094,0.00005660353],"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.000008156925,0.00034475056,0.012728846,0.000026422855,0.000056528846,0.000007451358,0.0038157997,0.000017460246,0.00026396054,0.5727707,0.0005885136,0.40937144],"study_design_scores_gemma":[0.0014971466,0.0005027605,0.30192798,0.0001235899,0.00001244918,0.00009701015,0.00010224389,0.37410787,0.00087510224,0.29255697,0.027390294,0.00080660015],"about_ca_topic_score_codex":0.000030087418,"about_ca_topic_score_gemma":0.000010046001,"teacher_disagreement_score":0.40856484,"about_ca_system_score_codex":0.000024959429,"about_ca_system_score_gemma":0.000035697358,"threshold_uncertainty_score":0.79808027},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6873753,0.00050455244,0.29738307,0.0021012947,0.00025948335,0.00094298343,0.000058136233,0.00006861915,0.01130653],"genre_scores_gemma":[0.9954529,0.000020667609,0.0027742505,0.00009925073,0.000046053807,0.00003966445,0.000002189183,0.0000037541267,0.0015613029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994857,0.000021759093,0.00014509098,0.00014964938,0.00013205053,0.00006579534],"domain_scores_gemma":[0.99933857,0.00021810977,0.000098494136,0.00024895844,0.00007221009,0.000023689996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011144671,0.000058443115,0.00008860091,0.00003384868,0.00008259932,0.0000085659185,0.00025002478,0.000028168428,0.000059267582],"category_scores_gemma":[0.0000184589,0.000040211846,0.000046145637,0.00026505275,0.00003813857,0.0001121572,0.000066858185,0.000060809052,0.000024605151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003992016,0.00006780545,0.00013646534,0.000018730509,0.000011521602,9.708669e-9,0.00012653676,0.000062118066,0.0033989986,0.9903559,0.000053011572,0.0057648728],"study_design_scores_gemma":[0.0010560505,0.00035131787,0.04505844,0.00010671775,0.000033265416,0.000018491975,0.00015697541,0.051267456,0.30529234,0.5314046,0.064818926,0.0004354187],"about_ca_topic_score_codex":0.0000014676156,"about_ca_topic_score_gemma":3.8192283e-7,"teacher_disagreement_score":0.45895135,"about_ca_system_score_codex":0.0000039410984,"about_ca_system_score_gemma":0.000025300984,"threshold_uncertainty_score":0.16397916},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015506761,0.000054189357,0.981294,0.00048351652,0.0014360792,0.000362854,0.000006542483,0.0004563938,0.00039967854],"genre_scores_gemma":[0.2986522,0.000008254971,0.69983655,0.0008681284,0.0003877153,0.000027320144,0.00003177466,0.000026026093,0.00016204799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983583,0.00007992028,0.00033752449,0.0005830571,0.00020454961,0.00043666468],"domain_scores_gemma":[0.9987683,0.00015640259,0.00008400367,0.0005979777,0.00025196734,0.00014134373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035277556,0.00023145319,0.00023965354,0.00015004685,0.00027364568,0.00025263889,0.0011058172,0.00010985691,0.00007965942],"category_scores_gemma":[0.000038584785,0.00021925416,0.00014076605,0.0004035248,0.00013871002,0.00044692177,0.00037623986,0.000101350706,0.00007798814],"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.00029485754,0.0005511457,0.00010733723,0.00019371133,0.0003168359,0.000048371254,0.002212042,0.05923972,0.010413482,0.3122643,0.020889191,0.593469],"study_design_scores_gemma":[0.0004950584,0.0003638149,0.0001364522,0.000043139666,0.000012186913,0.000013546475,0.000004978222,0.9926813,0.0004650548,0.0044226414,0.001078215,0.00028357733],"about_ca_topic_score_codex":0.0000042735724,"about_ca_topic_score_gemma":0.0000033952817,"teacher_disagreement_score":0.93344164,"about_ca_system_score_codex":0.0000663722,"about_ca_system_score_gemma":0.00006923928,"threshold_uncertainty_score":0.8940925},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16000994,0.00016902098,0.8390176,0.0003822144,0.000069841524,0.00007284108,0.000010944146,0.0000035006244,0.00026404439],"genre_scores_gemma":[0.9689147,0.000032639913,0.030791705,0.000046752783,0.00011653107,0.0000022405625,0.000003508365,0.0000022886293,0.0000896519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991395,0.000024625502,0.0004312701,0.00010371158,0.00024028936,0.000060618535],"domain_scores_gemma":[0.9986153,0.00023136093,0.0004952724,0.00012673806,0.00049758045,0.00003370722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038899117,0.000055221237,0.00022670269,0.00031736513,0.000028922981,0.00003665495,0.00052512396,0.000022940667,0.000014605104],"category_scores_gemma":[0.000019439287,0.000044197375,0.00023783302,0.0004008689,0.000032249758,0.00013396377,0.00006317742,0.000059755217,6.323869e-7],"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.00012077856,0.00069078093,0.026980279,0.000042798678,0.0037494756,0.0000024385602,0.00038564202,0.0076159975,0.010322306,0.71842426,0.00020638765,0.23145884],"study_design_scores_gemma":[0.0007184202,0.00025750953,0.010266571,0.000034521057,0.00036034314,0.00003527548,0.0000332985,0.91646385,0.0034258615,0.064806044,0.0034624496,0.00013586904],"about_ca_topic_score_codex":0.000006908718,"about_ca_topic_score_gemma":9.123591e-7,"teacher_disagreement_score":0.90884787,"about_ca_system_score_codex":0.000011411539,"about_ca_system_score_gemma":0.000035679797,"threshold_uncertainty_score":0.18023166},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053904373,0.000058918376,0.94117486,0.0006550412,0.0011148769,0.00006141899,5.6958504e-7,0.000032634118,0.0029972778],"genre_scores_gemma":[0.7420111,0.000008603773,0.25670883,0.00028164306,0.000500747,0.0000024134838,5.0251396e-7,0.000008577332,0.0004776139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990658,0.00016122604,0.0003414346,0.00008490515,0.00023679578,0.00010982659],"domain_scores_gemma":[0.9988963,0.00021714905,0.0003432154,0.00028877036,0.00016296172,0.000091620415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025687253,0.00007240659,0.00013704444,0.00016222712,0.000087160595,0.00008531458,0.0006371065,0.000054865563,0.00013715652],"category_scores_gemma":[0.00029694542,0.000053803444,0.00011376889,0.00020283496,0.000041630803,0.00071852317,0.000052534684,0.0003133587,0.000031883053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017365492,0.000054279448,0.0000035221706,0.000004828165,0.000011372731,0.000010212361,0.0005694677,0.00001714667,0.014273508,0.93360424,0.00026376368,0.05117029],"study_design_scores_gemma":[0.000590076,0.00008460052,0.00011083908,0.000015660005,0.000011547812,0.00032840445,0.00014154971,0.0057038586,0.025212182,0.96092284,0.006770342,0.00010812346],"about_ca_topic_score_codex":1.399105e-7,"about_ca_topic_score_gemma":1.11945965e-7,"teacher_disagreement_score":0.68810666,"about_ca_system_score_codex":0.000007847053,"about_ca_system_score_gemma":0.00006848649,"threshold_uncertainty_score":0.21940407},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029248727,0.00020361796,0.021270633,0.00042640857,0.00043684506,0.00024840966,0.000023293756,0.00018852796,0.97690976],"genre_scores_gemma":[0.0135179,0.00007039678,0.05869078,0.000116172894,0.00022964006,0.00001450097,0.000016870628,0.000101898855,0.92724186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997807,0.00004709201,0.00074657326,0.0005724843,0.0004163978,0.00041044632],"domain_scores_gemma":[0.9976291,0.0003623816,0.00043219002,0.0014099666,0.00007460091,0.000091733666],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00061113865,0.00048452048,0.0008775124,0.00062642124,0.000056288718,0.00014842986,0.0012774038,0.0003242823,0.000618615],"category_scores_gemma":[0.000055774286,0.00043995425,0.00018178916,0.00020181056,0.00006700185,0.00022662124,0.00036757253,0.00047848877,0.0008701838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021402006,0.00006907874,0.000008557454,0.0001563615,0.00004373903,0.000022735154,0.0017658321,0.00002232614,0.000031580577,0.98366344,0.00080729026,0.013406919],"study_design_scores_gemma":[0.00096022576,0.00018727772,0.000089196925,0.0011207559,0.00007425422,0.000103707134,0.00007991526,0.046214223,0.0003897196,0.9249096,0.024342362,0.0015287661],"about_ca_topic_score_codex":0.0000041166063,"about_ca_topic_score_gemma":0.000023473305,"teacher_disagreement_score":0.058753844,"about_ca_system_score_codex":0.00007396413,"about_ca_system_score_gemma":0.000097374446,"threshold_uncertainty_score":0.99990773},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05701747,0.00009187886,0.941949,0.00010526504,0.00016658775,0.00021856412,0.0000032011728,0.00001797002,0.00043002082],"genre_scores_gemma":[0.50373435,0.0000050891854,0.49598667,0.00004545592,0.00013147066,0.0000024212222,0.0000023843468,0.000007564937,0.000084633895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989852,0.000013061285,0.0004672449,0.00011095234,0.00030401174,0.00011952891],"domain_scores_gemma":[0.9984427,0.00070480746,0.0005170843,0.00008520451,0.00018487033,0.00006530639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006188077,0.0001043031,0.00025380048,0.00019372572,0.00007357192,0.000117854914,0.00024552547,0.00004284949,0.00000853728],"category_scores_gemma":[0.00005574341,0.000083379105,0.00007978032,0.00027296488,0.000012830593,0.00021536264,0.0000491249,0.00008933642,0.000009882143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013444827,0.000075737335,0.000007969866,0.00016910642,0.00003382728,9.629131e-7,0.00035128498,0.012052309,0.0009204203,0.9754628,0.00011926572,0.010792869],"study_design_scores_gemma":[0.0012555803,0.00013568366,0.00008638818,0.000052790685,0.000023623701,0.000085792344,0.00010060219,0.29123032,0.0017532416,0.70441884,0.00071156566,0.00014557272],"about_ca_topic_score_codex":4.945855e-8,"about_ca_topic_score_gemma":1.2564229e-8,"teacher_disagreement_score":0.44671685,"about_ca_system_score_codex":0.00001788694,"about_ca_system_score_gemma":0.00005339715,"threshold_uncertainty_score":0.3400101},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03179489,0.000022441101,0.95440257,0.0054808925,0.00075853,0.0019387618,0.00040689186,0.00035346538,0.004841576],"genre_scores_gemma":[0.8172689,0.00009804319,0.17989542,0.0014418492,0.00023918763,0.000045903107,0.000120149445,0.000076848344,0.00081369793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641263,0.0008080264,0.000494319,0.00094235,0.00082043,0.0005222157],"domain_scores_gemma":[0.9948208,0.0010799782,0.0007287706,0.0026198844,0.0005684317,0.0001821695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011181813,0.00056398916,0.00067459984,0.0005482823,0.00042078865,0.0001586053,0.0031102886,0.00036042344,0.00013677597],"category_scores_gemma":[0.00035418512,0.00042847655,0.00039342165,0.0011076137,0.0008175631,0.00028070272,0.001221316,0.0007654459,0.000029077291],"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.0017482884,0.0015011724,0.000191095,0.00065065804,0.00053880335,0.00008115646,0.006010134,0.12104161,0.002493979,0.83547384,0.013265868,0.017003411],"study_design_scores_gemma":[0.0015432201,0.0021330682,0.0025004228,0.0023077473,0.0003300219,0.0000084060275,0.00039826924,0.86433953,0.033022206,0.058294836,0.0330799,0.0020423995],"about_ca_topic_score_codex":0.0006368326,"about_ca_topic_score_gemma":0.000048798007,"teacher_disagreement_score":0.785474,"about_ca_system_score_codex":0.00022025031,"about_ca_system_score_gemma":0.0004519443,"threshold_uncertainty_score":0.9998167},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19243923,0.000093175375,0.80353385,0.0018511926,0.0010941193,0.0004983759,0.0000082543065,0.000082896935,0.00039893124],"genre_scores_gemma":[0.99326164,0.000007445314,0.005186835,0.0001594664,0.000025149942,0.000034446042,0.000009133119,0.000008679218,0.001307236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990352,0.0000466925,0.0001891872,0.00031458357,0.00021635019,0.0001980284],"domain_scores_gemma":[0.9990578,0.00008549966,0.000109291985,0.00062292826,0.000072303555,0.000052142295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004130495,0.00011083031,0.00013316672,0.00009989264,0.00014700512,0.000090678746,0.0005343293,0.000060471375,0.000004466005],"category_scores_gemma":[0.000012331147,0.00008370026,0.000042543852,0.00041646528,0.000041064228,0.0004668936,0.00020407682,0.00010077118,0.000094417126],"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.00008923309,0.00014112079,0.0011441597,0.00007299042,0.0000493179,8.3366524e-7,0.0019220845,0.017393112,0.015337763,0.55981773,0.0064740973,0.39755756],"study_design_scores_gemma":[0.00016768689,0.00011082911,0.0017069649,0.000016196203,0.0000048972493,0.000013866188,0.00009142725,0.96422637,0.001495122,0.028356928,0.0036865086,0.00012322172],"about_ca_topic_score_codex":0.000051223054,"about_ca_topic_score_gemma":0.000020885984,"teacher_disagreement_score":0.94683325,"about_ca_system_score_codex":0.00003572025,"about_ca_system_score_gemma":0.000046400786,"threshold_uncertainty_score":0.34131974},"labels":[],"label_agreement":null},{"id":"W2924691308","doi":"10.1137/19m1245505","title":"The Block Rational Arnoldi Method","year":2020,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Engineering and Physical Sciences Research Council","keywords":"Orthonormal basis; Mathematics; Applied mathematics; Eigenvalues and eigenvectors; Block (permutation group theory); Arnoldi iteration; Krylov subspace; MATLAB; Rational function; Stability (learning theory); Generalized minimal residual method; Elliptic rational functions; Mathematical optimization; Pure mathematics; Computer science; Iterative method; Combinatorics","score_opus":0.012178461811036483,"score_gpt":0.2954704634421431,"score_spread":0.2832920016311066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2924691308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025517208,0.00043012394,0.97944236,0.018963633,0.000022599379,0.00009346482,0.000004636927,0.00003390849,0.00075412827],"genre_scores_gemma":[0.6176237,0.0019797788,0.36979428,0.005262974,0.0025240928,0.00015581987,0.000014338658,0.00002765381,0.0026173599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99890274,0.00015189058,0.00029314472,0.00023629925,0.00026341146,0.00015249252],"domain_scores_gemma":[0.99890465,0.00033941263,0.00018747833,0.000271069,0.00009477781,0.00020263513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007041113,0.00010175285,0.00016408137,0.000099916164,0.00095998513,0.00053001684,0.00059317553,0.000030285759,0.000029040335],"category_scores_gemma":[0.000030121932,0.00006469802,0.0001999127,0.0012869707,0.00003439772,0.00013588188,0.00007734959,0.00024215512,0.000048945152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006556877,0.00003308352,0.000082552644,0.000003015875,0.00032679198,0.0000028177951,0.00009385565,0.0062126843,0.00023967573,0.9355275,0.0007595952,0.056711897],"study_design_scores_gemma":[0.00041239217,0.00011652728,0.0010004278,0.0000044976705,0.00047866593,0.00008890524,0.00013663154,0.42073652,0.0006009565,0.08819294,0.48792705,0.00030450083],"about_ca_topic_score_codex":8.782352e-7,"about_ca_topic_score_gemma":8.589042e-7,"teacher_disagreement_score":0.8473345,"about_ca_system_score_codex":0.000010795466,"about_ca_system_score_gemma":0.00003927402,"threshold_uncertainty_score":0.73835266},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092411004,0.0014462507,0.7751628,0.009821334,0.0026181163,0.01111979,0.00043984022,0.00037695293,0.10660391],"genre_scores_gemma":[0.92198575,0.00012676325,0.023529079,0.00028071605,0.00045882404,0.00015849204,0.000016973585,0.0001040117,0.053339377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984761,0.00008984597,0.00035783494,0.00039151916,0.0004922003,0.00019250141],"domain_scores_gemma":[0.99729484,0.00028391278,0.00061052304,0.00139525,0.00037117695,0.00004427635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057026575,0.0002636783,0.00030167555,0.00015318925,0.00034207208,0.000096388634,0.0017801787,0.00010663007,0.000009876115],"category_scores_gemma":[0.000027662136,0.00012425789,0.00010825893,0.00041530817,0.00033668222,0.0003021807,0.0004661892,0.00028629875,0.000020213034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014602498,0.000025762392,0.00011563266,0.00006272889,0.00013135585,6.7389044e-7,0.003043039,0.00036648475,0.00039166075,0.97790885,0.00003870212,0.017769098],"study_design_scores_gemma":[0.0022887234,0.007730488,0.040981486,0.0021764175,0.0006723867,0.00018806051,0.0038423773,0.006579136,0.295522,0.37564725,0.26045525,0.0039164326],"about_ca_topic_score_codex":0.00002553739,"about_ca_topic_score_gemma":0.00007285753,"teacher_disagreement_score":0.82957476,"about_ca_system_score_codex":0.000045899036,"about_ca_system_score_gemma":0.00013298813,"threshold_uncertainty_score":0.506709},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34399548,0.0035065252,0.603181,0.0101236785,0.00050516904,0.0020084013,0.000036852416,0.0008382596,0.035804626],"genre_scores_gemma":[0.97150934,0.0008353053,0.019833513,0.00046279677,0.00033609927,0.000106981264,0.000009895782,0.000015521586,0.006890525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933654,0.000026522517,0.000115509254,0.00029321123,0.000088648725,0.00013959222],"domain_scores_gemma":[0.99947006,0.00009346438,0.000034398472,0.00027820337,0.000028641178,0.00009525605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010692197,0.0000909196,0.00011781163,0.00003383944,0.000109651686,0.00006109296,0.0002213643,0.00005103803,0.00007146974],"category_scores_gemma":[0.0000029286698,0.000076910896,0.000022795979,0.0001867079,0.000026729906,0.00016772626,0.00011420121,0.00008705853,0.00025267282],"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.00000371545,0.000032405766,0.00018034742,0.000020359723,0.000009414783,5.004938e-7,0.00012019692,0.0000043599543,0.0010541299,0.9735684,0.00015445451,0.024851749],"study_design_scores_gemma":[0.0018118756,0.00023986174,0.012337598,0.000027138516,0.000044373483,0.000051394258,0.000058160433,0.15892698,0.005628177,0.09264912,0.72735757,0.00086778984],"about_ca_topic_score_codex":0.000005393804,"about_ca_topic_score_gemma":1.8503698e-7,"teacher_disagreement_score":0.8809193,"about_ca_system_score_codex":0.000003662293,"about_ca_system_score_gemma":0.000012140577,"threshold_uncertainty_score":0.32476822},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027467858,0.0009515715,0.9209671,0.0015465089,0.037595816,0.00018917375,0.0000030918038,0.00010140984,0.011177481],"genre_scores_gemma":[0.9272774,0.000037385937,0.0669696,0.00011669319,0.005076018,5.8338935e-7,2.7477586e-7,0.000011921493,0.00051012915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983404,0.00020456372,0.00049039646,0.00011241192,0.00053499127,0.00031721775],"domain_scores_gemma":[0.9983427,0.00040840427,0.00048136018,0.0002806535,0.00012714826,0.0003597206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017257509,0.00013731068,0.00024373335,0.00018418694,0.00009184284,0.00014151377,0.00091744814,0.00007938345,0.00002662329],"category_scores_gemma":[0.00021435865,0.00010625555,0.0001482176,0.00033169714,0.000015595411,0.0010415063,0.00007704539,0.00028810362,0.000089979694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048129298,0.00030012577,0.000029831304,0.0000066011603,0.000046232788,0.00006294311,0.00074858847,0.00013624488,0.0005357798,0.94226015,0.036786746,0.018605458],"study_design_scores_gemma":[0.019201132,0.009666692,0.0017851441,0.00036763484,0.00016824358,0.0013295324,0.0001401124,0.0019951535,0.09665499,0.523318,0.3438822,0.0014911753],"about_ca_topic_score_codex":0.0000028085014,"about_ca_topic_score_gemma":2.138189e-8,"teacher_disagreement_score":0.89980954,"about_ca_system_score_codex":0.000051261162,"about_ca_system_score_gemma":0.00015997195,"threshold_uncertainty_score":0.43329757},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05067801,0.00014032952,0.940734,0.0002327023,0.0013896032,0.00020926737,0.000007116203,0.0003136642,0.0062952614],"genre_scores_gemma":[0.9911686,0.000039492388,0.002988933,0.00013872198,0.0002673723,6.4256676e-7,0.000016583223,0.00001785534,0.005361784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834806,0.0001958895,0.00015890745,0.00080346287,0.00010189149,0.00039179943],"domain_scores_gemma":[0.9982202,0.00008359742,0.00020080953,0.0011823041,0.000089909474,0.00022317271],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003022047,0.000298873,0.00025707058,0.0001944176,0.0001901615,0.00015127077,0.0014378402,0.0002931282,0.00012566835],"category_scores_gemma":[0.000020535392,0.00032482963,0.00020275844,0.00039051517,0.00008206906,0.0005448447,0.001232459,0.00047528552,0.00027357024],"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.000012068032,0.00009572706,0.00017516816,0.000052238054,0.000053643867,0.00007575764,0.0002935723,0.020832092,0.00007712827,0.9773813,0.00009785851,0.00085344084],"study_design_scores_gemma":[0.0005297204,0.00004329808,0.0024413385,0.00011234493,0.00012152917,0.000013586738,0.000073641975,0.5145454,0.0005431017,0.478235,0.00237006,0.0009709625],"about_ca_topic_score_codex":0.000033850596,"about_ca_topic_score_gemma":0.0000030792814,"teacher_disagreement_score":0.9404906,"about_ca_system_score_codex":0.00019045228,"about_ca_system_score_gemma":0.00013185236,"threshold_uncertainty_score":0.99992037},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03875517,0.000018714587,0.9567611,0.00007797602,0.0005365449,0.0007881404,0.000052299816,0.00044983788,0.0025601757],"genre_scores_gemma":[0.94153893,0.000034385142,0.051884376,0.0001637798,0.00029504433,0.0000070359365,0.000039322178,0.000035384826,0.006001744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977234,0.00018285317,0.00023030686,0.0013151848,0.0000877621,0.00046048086],"domain_scores_gemma":[0.9973682,0.0002716088,0.00028920162,0.0016029514,0.0001836353,0.00028437193],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000683805,0.00037053943,0.00038155625,0.000247714,0.00024429633,0.00019947857,0.0026692206,0.0003312036,0.000026126449],"category_scores_gemma":[0.00006195975,0.00041578236,0.0002730737,0.00036755495,0.00010637005,0.00050236756,0.0014634967,0.00041459655,0.00013712923],"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.000040880266,0.0002669566,0.00039573995,0.00035307885,0.0000688076,0.00008208007,0.00036148576,0.13883886,0.00008463688,0.8564461,0.0013103284,0.0017510946],"study_design_scores_gemma":[0.00049222587,0.00018834793,0.00003000763,0.00005100798,0.000051512987,0.0000054721027,0.000028183327,0.7044838,0.00013882466,0.29051492,0.0035664255,0.00044928095],"about_ca_topic_score_codex":0.00006223872,"about_ca_topic_score_gemma":0.00003196011,"teacher_disagreement_score":0.90487677,"about_ca_system_score_codex":0.000116286756,"about_ca_system_score_gemma":0.00022731525,"threshold_uncertainty_score":0.9998294},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30393305,0.00003309344,0.6944175,0.0000369652,0.00035341637,0.00027011405,0.000046687444,0.00007320765,0.00083597464],"genre_scores_gemma":[0.9299429,0.000109300534,0.067915164,0.000044569842,0.00009351889,0.0000021980495,0.000009261278,0.000016636155,0.0018664274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857384,0.000052018906,0.00021314276,0.00076788984,0.00008556793,0.00030753238],"domain_scores_gemma":[0.9987168,0.00016068853,0.00027392112,0.0006111577,0.0001064169,0.00013101926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039029468,0.00024317275,0.00030965125,0.00022470938,0.00015990406,0.000035779278,0.00096388836,0.0001869051,0.00001594428],"category_scores_gemma":[0.000016126134,0.00022544952,0.0001281112,0.00018991363,0.00006234233,0.00018177478,0.0011008364,0.00017322366,0.000026444202],"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.00047119084,0.0006813477,0.0016717215,0.00096311053,0.00039926817,0.00013630424,0.0036987702,0.009187858,0.00045892937,0.96618366,0.00059478823,0.01555306],"study_design_scores_gemma":[0.007066864,0.00058810104,0.0019586014,0.0013619834,0.00029124215,0.000011036733,0.0007970323,0.6734264,0.020308204,0.23411283,0.05717538,0.002902341],"about_ca_topic_score_codex":0.0000036025283,"about_ca_topic_score_gemma":0.000007971222,"teacher_disagreement_score":0.7320708,"about_ca_system_score_codex":0.00006836151,"about_ca_system_score_gemma":0.00016346984,"threshold_uncertainty_score":0.91935647},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10869148,0.00007860677,0.88199353,0.00009533798,0.00048597466,0.00028743036,0.000024767112,0.0004253554,0.0079175215],"genre_scores_gemma":[0.9963257,0.000027690723,0.001003249,0.000101057754,0.000071894334,0.0000016320981,0.000031615487,0.000017192264,0.002420005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982718,0.0002526209,0.00015809253,0.0007759189,0.00014048447,0.00040105305],"domain_scores_gemma":[0.997614,0.00062651257,0.0003581337,0.0010726372,0.00014015113,0.00018854343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040522055,0.00031113863,0.00028692448,0.00029593226,0.00025132418,0.00013794586,0.0016743258,0.0002379064,0.00008714543],"category_scores_gemma":[0.000106076994,0.0002989345,0.00013661553,0.00094100763,0.00008586368,0.00045118647,0.00083465443,0.0005414989,0.00026681696],"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.000013498833,0.00021438001,0.00026042206,0.000022195045,0.0001278186,0.00006932233,0.00023538912,0.04404811,0.0000022577133,0.9542981,0.00015165702,0.00055686163],"study_design_scores_gemma":[0.0009721932,0.00019395737,0.0017254314,0.00031119923,0.0002560759,0.0000041078665,0.000060447182,0.5332763,0.00011447203,0.46160558,0.00029251195,0.0011876915],"about_ca_topic_score_codex":0.000033028664,"about_ca_topic_score_gemma":0.000015846219,"teacher_disagreement_score":0.88763416,"about_ca_system_score_codex":0.00018462571,"about_ca_system_score_gemma":0.00016381245,"threshold_uncertainty_score":0.9999463},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5013314,0.00026348906,0.49012962,0.0014708629,0.0028083543,0.001709646,0.000045694585,0.0006311603,0.0016097769],"genre_scores_gemma":[0.8932317,0.0009460431,0.08789011,0.0015789878,0.0022980494,0.0014642512,0.00010805752,0.00014553561,0.012337254],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974606,0.00012943734,0.0005079407,0.0011621056,0.00024241206,0.00049752026],"domain_scores_gemma":[0.9974136,0.0001449115,0.00024171664,0.0018483325,0.00015606871,0.00019536653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047472698,0.0004028565,0.00049554615,0.00014574699,0.00025508855,0.00012976851,0.0021282157,0.00028837085,0.000028571098],"category_scores_gemma":[0.00012422765,0.00037987524,0.0003521092,0.00019086504,0.00011127687,0.00029463705,0.001915915,0.00056487095,0.0002078505],"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.00140549,0.0049679354,0.2376406,0.0056963577,0.0055076494,0.0024872767,0.034657277,0.14923641,0.01324677,0.22831252,0.13834631,0.17849539],"study_design_scores_gemma":[0.0036440687,0.0006564887,0.010385895,0.00061104214,0.00012217124,0.00009862213,0.000087490575,0.7017474,0.06346311,0.02381197,0.19183637,0.00353533],"about_ca_topic_score_codex":0.000048577804,"about_ca_topic_score_gemma":0.0000013896611,"teacher_disagreement_score":0.55251104,"about_ca_system_score_codex":0.000056117202,"about_ca_system_score_gemma":0.0001954606,"threshold_uncertainty_score":0.9998653},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13018881,0.00002584705,0.8680215,0.00009810331,0.00031932615,0.0003642254,0.00021912625,0.00012081149,0.00064224156],"genre_scores_gemma":[0.9822118,0.000051801322,0.014307279,0.00005831291,0.00012517223,0.0000034076977,0.000082142215,0.000016754031,0.0031433085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998148,0.0001424371,0.00035836335,0.00093968643,0.000088716624,0.0003227695],"domain_scores_gemma":[0.99761724,0.00051224465,0.0005102719,0.0009858072,0.00023530451,0.0001391533],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038059943,0.00029314458,0.0005737522,0.00081080926,0.00015688255,0.00006819662,0.0012586351,0.00029582562,0.00014601146],"category_scores_gemma":[0.000046074332,0.0002955477,0.00068246626,0.00095679774,0.0001440983,0.00031956995,0.0008773671,0.0002452379,0.000025927737],"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.000033798064,0.00011499828,0.00040809886,0.00014716988,0.0012322131,0.000033585016,0.0003033438,0.38680765,0.000020170879,0.61030734,0.0002559017,0.00033574557],"study_design_scores_gemma":[0.00048626965,0.000048282072,0.00062993873,0.00008949004,0.0008696021,9.825782e-7,0.00003194538,0.8056541,0.00017810876,0.19144353,0.00022359112,0.00034412643],"about_ca_topic_score_codex":0.000026795686,"about_ca_topic_score_gemma":0.000029312434,"teacher_disagreement_score":0.8537142,"about_ca_system_score_codex":0.00008298824,"about_ca_system_score_gemma":0.00011741524,"threshold_uncertainty_score":0.9999497},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8190324,0.000424941,0.1760829,0.0012756612,0.0014959036,0.0005385579,0.0000073560986,0.000085650936,0.0010566534],"genre_scores_gemma":[0.9918673,0.000014763098,0.007594631,0.00024392582,0.00014935898,0.00002082156,0.000001873142,0.000023809343,0.000083492676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977427,0.00033008924,0.0005353877,0.00060600106,0.00036700736,0.00041879044],"domain_scores_gemma":[0.99724734,0.0002941914,0.00040778454,0.0018943378,0.00010207285,0.000054274256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011511536,0.0003671323,0.00042794732,0.000115843846,0.00020351772,0.00011389801,0.003322195,0.00024095686,0.000031064785],"category_scores_gemma":[0.00020521476,0.00020286204,0.00028893596,0.0004921044,0.0004138077,0.0001725646,0.0028317797,0.0011421083,0.000013468994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007353993,0.0005383678,0.21009827,0.0005650361,0.0002992099,0.00008026197,0.014684201,0.10309593,0.0026351146,0.6491863,0.00011678107,0.018626984],"study_design_scores_gemma":[0.0007619279,0.00006594115,0.05548513,0.0013444844,0.000074640615,0.000072214156,0.0004952323,0.14450546,0.019369705,0.776776,0.0002118455,0.00083738496],"about_ca_topic_score_codex":0.00028704875,"about_ca_topic_score_gemma":0.00003266471,"teacher_disagreement_score":0.17283493,"about_ca_system_score_codex":0.00014838243,"about_ca_system_score_gemma":0.00032040203,"threshold_uncertainty_score":0.8272474},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63352835,0.0000042469214,0.3648005,0.000057140373,0.00027951732,0.00010537851,0.0000132260775,0.00005744988,0.0011542041],"genre_scores_gemma":[0.9986812,0.00006680964,0.0004936082,0.000023017412,0.000031302105,3.0736064e-7,0.000007645967,0.000007202252,0.00068890775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989229,0.00010842006,0.00017883012,0.00053385523,0.000056658886,0.00019936824],"domain_scores_gemma":[0.9990147,0.000041237938,0.00023684173,0.00060136407,0.0000472003,0.000058659385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023191333,0.00016466234,0.0002393674,0.00032438073,0.000031937296,0.000029789517,0.0011296193,0.00014536944,0.00003228606],"category_scores_gemma":[0.000008191435,0.00016468982,0.00012059462,0.00039783586,0.00006192571,0.00036222936,0.0007406036,0.0002286737,0.000022651018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018289062,0.000056646793,0.0025150704,0.0000610884,0.000017160468,0.000089681744,0.00022520388,0.0007112007,0.002762753,0.9927911,0.0000038110516,0.000747972],"study_design_scores_gemma":[0.00045592306,0.000033735032,0.012923091,0.00022248105,0.000013303335,0.0000031815262,0.000011608518,0.051623564,0.003630562,0.93065804,0.00007878767,0.0003457398],"about_ca_topic_score_codex":0.000026335323,"about_ca_topic_score_gemma":0.000004320231,"teacher_disagreement_score":0.36515287,"about_ca_system_score_codex":0.000057194415,"about_ca_system_score_gemma":0.000069342845,"threshold_uncertainty_score":0.67158556},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52727675,0.000098263714,0.4721767,0.00006300911,0.00008155456,0.00009591185,0.000010441255,0.00005834388,0.00013903646],"genre_scores_gemma":[0.9867163,0.00009122409,0.013070038,0.00007051395,0.000013748954,0.0000034349678,0.000027775377,0.0000033102338,0.000003684305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899215,0.000080547856,0.00048145917,0.00012136505,0.00016723732,0.0001572729],"domain_scores_gemma":[0.999234,0.00016230016,0.0002889834,0.00012502124,0.000103929495,0.00008572343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005495762,0.000115959265,0.00017127788,0.0002185844,0.00013353044,0.00010781514,0.00017792376,0.00004899105,0.0000071706518],"category_scores_gemma":[0.000029483634,0.00010831292,0.000024012603,0.00024426338,0.00006809425,0.0024908497,0.00012452589,0.00006775267,0.000015502877],"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.00006230687,0.000045886183,0.007543615,0.00041187115,0.00005112526,0.0000026721993,0.024585178,0.00074902805,0.00019340559,0.67561585,0.00019738331,0.29054165],"study_design_scores_gemma":[0.00051514455,0.0002465546,0.024736967,0.00007379466,0.000016507149,0.000018435578,0.0007446035,0.8570989,0.0019520572,0.11411346,0.00024415494,0.00023945114],"about_ca_topic_score_codex":0.0000636041,"about_ca_topic_score_gemma":5.845432e-7,"teacher_disagreement_score":0.8563498,"about_ca_system_score_codex":0.000009398024,"about_ca_system_score_gemma":0.000029951976,"threshold_uncertainty_score":0.44168726},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62647617,0.00036811098,0.3639409,0.0009844627,0.002128677,0.000360069,0.000005721596,0.0004599881,0.005275872],"genre_scores_gemma":[0.9702808,0.000097653545,0.0257581,0.0005323098,0.00063126447,0.000045929464,0.00006646059,0.000032115888,0.0025553133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977718,0.00020628604,0.0003725077,0.00089318346,0.00040868015,0.00034753344],"domain_scores_gemma":[0.99794215,0.00013578587,0.00025784652,0.0013833778,0.00015518202,0.00012564175],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007550629,0.0003263337,0.00032070416,0.00014226945,0.0001928004,0.00013085165,0.0011904279,0.00027930815,0.00016905014],"category_scores_gemma":[0.00008323644,0.00028177354,0.00018154066,0.0002362365,0.00007717353,0.00029779007,0.0019026196,0.0006073624,0.00053450937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012659612,0.0011274962,0.020341834,0.00051389635,0.0002631481,0.0004011925,0.002169538,0.012167032,0.006015413,0.74989015,0.0070707286,0.199913],"study_design_scores_gemma":[0.0008675066,0.00016182715,0.046647556,0.00056010915,0.0000626834,0.00012860417,0.00003798158,0.32762864,0.008709477,0.6044439,0.009101159,0.0016505452],"about_ca_topic_score_codex":0.000013629566,"about_ca_topic_score_gemma":8.1742576e-7,"teacher_disagreement_score":0.34380466,"about_ca_system_score_codex":0.000055561748,"about_ca_system_score_gemma":0.00010130358,"threshold_uncertainty_score":0.99996346},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9878039,0.000097028664,0.00048682932,0.0003499312,0.00019541993,0.0002985754,0.000017805518,0.00027260795,0.010477904],"genre_scores_gemma":[0.9878543,0.000025980033,0.011388835,0.00031851747,0.00006168865,0.000018765448,0.0000103164175,0.000015598143,0.00030596906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978791,0.00018963598,0.00046961085,0.0006863363,0.00028899367,0.00048632635],"domain_scores_gemma":[0.9991206,0.00009777355,0.000120995195,0.00044205107,0.00005808842,0.00016047579],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011136548,0.00025603222,0.00030291572,0.00022995539,0.00040913958,0.0000861836,0.00047783877,0.00014633473,0.00007707797],"category_scores_gemma":[0.00009816915,0.0002575606,0.000075608936,0.0005546172,0.000042274285,0.0017822238,0.000053416596,0.00047819965,0.00006694852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018181674,0.00014091785,0.000027524798,0.00003872104,0.000011423531,0.00001992557,0.000014678012,0.000063264684,0.012590447,0.894758,9.629414e-7,0.09231595],"study_design_scores_gemma":[0.000999904,0.0003979361,0.0048859846,0.00014034448,0.00002802043,0.00032778594,0.00003278067,0.00138548,0.09848168,0.88383377,0.008785074,0.00070121564],"about_ca_topic_score_codex":0.0000071497175,"about_ca_topic_score_gemma":0.000024756231,"teacher_disagreement_score":0.09161474,"about_ca_system_score_codex":0.00014392685,"about_ca_system_score_gemma":0.000015723817,"threshold_uncertainty_score":0.99998766},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014155272,0.00013132516,0.97494566,0.00003369674,0.008187696,0.0009986069,0.00005375766,0.000468239,0.0010257418],"genre_scores_gemma":[0.9660885,0.00010103613,0.028266368,0.00006488447,0.001754762,0.000018328947,0.000050761642,0.00006333639,0.0035920497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973982,0.00016488993,0.00035164336,0.0013149315,0.00014302674,0.00062730745],"domain_scores_gemma":[0.9973743,0.00032447098,0.00041380615,0.0012566188,0.00036103762,0.0002697556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006687899,0.00045989561,0.0005840364,0.00029077055,0.0003984307,0.00041627415,0.002435246,0.0004947116,0.00001605643],"category_scores_gemma":[0.000053290478,0.00052568346,0.0003569241,0.00040873102,0.000090560636,0.000587013,0.0018341821,0.0006737948,0.0001299256],"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.000018142719,0.000119240925,0.00003729144,0.00026465906,0.00016677951,0.00014497474,0.00027643418,0.05211317,0.000015477453,0.94317824,0.000452959,0.0032126177],"study_design_scores_gemma":[0.00082579226,0.000073095456,0.0000032003902,0.00016406848,0.000058842394,0.0000064540086,0.000088692286,0.8917903,0.00011373882,0.103829235,0.0024924693,0.0005541573],"about_ca_topic_score_codex":0.00018114093,"about_ca_topic_score_gemma":0.000003262928,"teacher_disagreement_score":0.9519332,"about_ca_system_score_codex":0.00020499142,"about_ca_system_score_gemma":0.00024192876,"threshold_uncertainty_score":0.9997195},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9075719,0.00009385437,0.07924397,0.005044359,0.0038457236,0.0010093348,0.000087028944,0.00032637175,0.0027774498],"genre_scores_gemma":[0.9870136,0.000008079558,0.0033813117,0.0019105163,0.000073509254,0.000022842894,0.0001720222,0.000015273969,0.007402861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983645,0.000086768996,0.0003391061,0.00040522488,0.00045047537,0.0003539146],"domain_scores_gemma":[0.9990842,0.00011608007,0.00015256154,0.00045548394,0.000090501475,0.00010117935],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036142563,0.00018212365,0.000159775,0.00010643382,0.00016893669,0.00011702418,0.00039788222,0.00007724217,0.00039542158],"category_scores_gemma":[0.000021529471,0.00016155666,0.00007460278,0.00019309425,0.000015176592,0.00088309165,0.00013910775,0.00012071259,0.004267348],"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.000072770315,0.00051651825,0.06991738,0.000029361725,0.00009388578,0.000006638725,0.0008936479,0.001823774,0.006594324,0.77687514,0.11897466,0.024201918],"study_design_scores_gemma":[0.0072969925,0.0016085991,0.048441116,0.00022454018,0.00003182331,0.000020599518,0.00020649047,0.42535722,0.079800665,0.033099387,0.40128782,0.0026247248],"about_ca_topic_score_codex":0.000019438445,"about_ca_topic_score_gemma":0.0000026792732,"teacher_disagreement_score":0.7437757,"about_ca_system_score_codex":0.000063427375,"about_ca_system_score_gemma":0.000045445544,"threshold_uncertainty_score":0.99650794},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82830244,0.0001930832,0.16928177,0.00043572858,0.00045414938,0.00087690726,0.000014874763,0.00015427743,0.00028677867],"genre_scores_gemma":[0.75644326,0.000043480188,0.2433704,0.000017254055,0.00001943051,0.000027764896,0.0000019106676,0.000011120425,0.00006540615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982484,0.000024475443,0.0006659811,0.0005199806,0.00027375342,0.0002674321],"domain_scores_gemma":[0.99804986,0.000057114623,0.0006111555,0.0009768079,0.00023511454,0.00006992704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038108884,0.00022572027,0.000576869,0.0009925447,0.00004901315,0.000019831265,0.0010030974,0.00030301115,0.000007772893],"category_scores_gemma":[0.00018780353,0.00021596714,0.000092781884,0.001359842,0.00029982615,0.00044728388,0.00053383963,0.00020957954,0.000034616824],"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.00013184763,0.00034839837,0.010030283,0.0007969071,0.00013874481,0.000009027249,0.000636408,0.0007168533,0.17962962,0.53967655,0.000024289948,0.26786107],"study_design_scores_gemma":[0.0020895086,0.0009374418,0.0034042618,0.00042348742,0.0000602464,0.00004619848,0.00013262645,0.035760377,0.92860043,0.022582963,0.0053320522,0.0006303916],"about_ca_topic_score_codex":0.000025436368,"about_ca_topic_score_gemma":0.0000025972063,"teacher_disagreement_score":0.7489708,"about_ca_system_score_codex":0.000029575272,"about_ca_system_score_gemma":0.000080051184,"threshold_uncertainty_score":0.8806885},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9292021,0.0012180782,0.05613999,0.0013984616,0.0065072495,0.00072711543,0.000046821377,0.00011510264,0.0046450985],"genre_scores_gemma":[0.9913865,0.0014060265,0.0034573097,0.0002233105,0.00023774809,0.000028936694,0.000002027002,0.000021099804,0.00323707],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981257,0.00037863452,0.000466443,0.00044769858,0.00031625104,0.00026529102],"domain_scores_gemma":[0.99686843,0.0004511625,0.00054926926,0.001919401,0.00015892417,0.000052799965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058762915,0.0002441433,0.00032380535,0.000031283613,0.00022419405,0.00003068892,0.0033076294,0.00014190098,0.00005344092],"category_scores_gemma":[0.00012328614,0.00013686893,0.0002655821,0.00026237755,0.00039220613,0.00007716552,0.0017155804,0.00051644736,0.00005030248],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022044455,0.0012965369,0.07184499,0.0010185677,0.0012349574,0.00011960653,0.00805297,0.0110991625,0.004917877,0.3092074,0.021978106,0.56900936],"study_design_scores_gemma":[0.0014860741,0.00066605385,0.15428269,0.0014249841,0.00012332607,0.000046113957,0.00042088566,0.12099739,0.5284638,0.14227666,0.04793708,0.001874944],"about_ca_topic_score_codex":0.00010564041,"about_ca_topic_score_gemma":0.0000074078935,"teacher_disagreement_score":0.56713444,"about_ca_system_score_codex":0.000021812442,"about_ca_system_score_gemma":0.00019612355,"threshold_uncertainty_score":0.61464536},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005490114,0.00022060536,0.99084985,0.0005831939,0.0019543655,0.000808464,0.000045826713,0.0000312032,0.000016355138],"genre_scores_gemma":[0.12737606,0.000011116971,0.87224007,0.000056420413,0.00015223223,0.000053638687,0.000027089172,0.000025561652,0.000057779544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978808,0.00019140718,0.0009961404,0.00028557092,0.00037597012,0.00027010942],"domain_scores_gemma":[0.9941738,0.0031709566,0.00058432913,0.00023427125,0.0017316946,0.00010490933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024942178,0.00018293786,0.00047285273,0.00029502896,0.00010369977,0.0001423748,0.0008063113,0.000084279396,0.00001861659],"category_scores_gemma":[0.0012079957,0.00014841814,0.00029968453,0.00024885216,0.000034545752,0.00056862383,0.000072161354,0.00013651136,0.0000012240658],"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.0006072679,0.00013975834,0.00003747012,0.00013840462,0.0003185524,0.0000012728335,0.0002779974,0.8901662,0.027510427,0.013857994,0.000031148586,0.066913456],"study_design_scores_gemma":[0.0014797908,0.0007032122,0.000022718998,0.0002660898,0.00004711223,0.00007431577,0.00004390737,0.9926729,0.0008539607,0.0031457671,0.0005210889,0.00016912543],"about_ca_topic_score_codex":0.000007294886,"about_ca_topic_score_gemma":0.0000010560599,"teacher_disagreement_score":0.121885955,"about_ca_system_score_codex":0.00017597883,"about_ca_system_score_gemma":0.00016779626,"threshold_uncertainty_score":0.60523164},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09854574,0.00021431234,0.89242744,0.00040176045,0.00062246894,0.00049453217,0.000008539943,0.0002078968,0.0070773126],"genre_scores_gemma":[0.9924753,0.0002683522,0.005635609,0.00006770707,0.000096252756,0.0000020301288,0.0000127018075,0.000011189567,0.0014309146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841166,0.0003806784,0.00018972096,0.0007074822,0.000077078716,0.00023335581],"domain_scores_gemma":[0.99857384,0.00016672414,0.00026898552,0.0008053454,0.00009054178,0.00009455218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077556534,0.00023379858,0.00026405771,0.00017228368,0.00032205388,0.00016216874,0.001125888,0.0001916446,0.00004039734],"category_scores_gemma":[0.000023227502,0.00019897132,0.00014538088,0.0002878206,0.00018061543,0.0003867214,0.0011883221,0.00042422116,0.000049289152],"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.000086240856,0.000026005619,0.000050086288,0.000067468034,0.00003808711,0.00005231588,0.0005784779,0.002304777,0.000018031578,0.9950038,0.000061421095,0.0017132561],"study_design_scores_gemma":[0.0012505017,0.000033655982,0.0006431293,0.0001307716,0.00011005974,0.000020407952,0.00009456133,0.50819886,0.0004890808,0.48853472,0.00011040719,0.00038385447],"about_ca_topic_score_codex":0.00009755635,"about_ca_topic_score_gemma":0.0000045705724,"teacher_disagreement_score":0.8939295,"about_ca_system_score_codex":0.000061088635,"about_ca_system_score_gemma":0.00005497547,"threshold_uncertainty_score":0.81138146},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5899362,0.00019687471,0.4043127,0.00009866916,0.0004978518,0.00020741712,0.000055925477,0.00014711203,0.004547274],"genre_scores_gemma":[0.9966093,0.00005482135,0.0014921273,0.000032407617,0.0000642879,3.238974e-7,0.0000055122277,0.00001116899,0.0017300685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864167,0.00012831917,0.00019957077,0.0007231373,0.000060575807,0.00024675083],"domain_scores_gemma":[0.99852234,0.00018922333,0.00026300916,0.0008777533,0.00006155002,0.0000861077],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028034602,0.00028465234,0.00039781665,0.00022379283,0.00019225499,0.00021090277,0.0010938568,0.00020264338,0.00002334217],"category_scores_gemma":[0.000018481443,0.00027476132,0.00016134416,0.0002671193,0.00035193327,0.0001912843,0.0010409501,0.00033401602,0.000014977155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038267466,0.0000694027,0.00020651071,0.00007682816,0.000051368876,0.000055577624,0.0002010836,0.007813615,0.00007192536,0.99041474,0.00033150267,0.00066917436],"study_design_scores_gemma":[0.00058155175,0.00015211738,0.00080600695,0.000120830024,0.0000399176,0.000009897252,0.000044597407,0.09787243,0.00326053,0.8955863,0.0009825206,0.0005432637],"about_ca_topic_score_codex":0.00018637725,"about_ca_topic_score_gemma":0.000014077058,"teacher_disagreement_score":0.4066731,"about_ca_system_score_codex":0.00005912529,"about_ca_system_score_gemma":0.00017312884,"threshold_uncertainty_score":0.99997044},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41782618,0.00046012542,0.57801014,0.00016103499,0.00068274915,0.00051392405,0.000052267584,0.00021318079,0.0020803865],"genre_scores_gemma":[0.9817077,0.00021598939,0.011510397,0.000034962304,0.00016498863,0.0000023601465,0.000009637101,0.000019279365,0.0063347174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984499,0.00008135122,0.00012508672,0.0009536853,0.0000660876,0.0003238747],"domain_scores_gemma":[0.99817,0.00013717591,0.00028112953,0.0011429201,0.00010029192,0.00016848977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000432207,0.0002657949,0.00031679234,0.00017484912,0.00045780733,0.00031394267,0.001566914,0.00020137335,0.000015387537],"category_scores_gemma":[0.00003472696,0.00028460706,0.00015715265,0.0001399973,0.0001372016,0.00020811401,0.0014762857,0.00021101483,0.00006915999],"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.00006747815,0.0001533852,0.00014437952,0.0002831416,0.00015713257,0.0001756816,0.00037913944,0.3826816,0.000086768574,0.61191326,0.0014018294,0.0025561962],"study_design_scores_gemma":[0.0003994696,0.00004764938,0.000032786804,0.000057324633,0.0000627764,0.000004341315,0.0000147598175,0.95161355,0.00059190684,0.04467275,0.002103355,0.00039935592],"about_ca_topic_score_codex":0.000036617228,"about_ca_topic_score_gemma":0.000003473513,"teacher_disagreement_score":0.56893194,"about_ca_system_score_codex":0.00006350691,"about_ca_system_score_gemma":0.00012724039,"threshold_uncertainty_score":0.9999606},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020249438,0.0001280632,0.975921,0.0003705014,0.0007790788,0.0015666885,0.00017599632,0.0004906663,0.0003185861],"genre_scores_gemma":[0.9555406,0.00007104727,0.04061434,0.00009375511,0.00041527423,0.000023119703,0.000035346176,0.00005504353,0.0031514866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973336,0.00012756756,0.00033529077,0.0013599695,0.00012651774,0.00071706827],"domain_scores_gemma":[0.99744415,0.0005589216,0.00053183467,0.0008463721,0.00042420076,0.0001945119],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006101395,0.0004816179,0.0005202709,0.00036671243,0.00064879586,0.00037841915,0.0019804742,0.00032726253,0.000007596249],"category_scores_gemma":[0.00008373266,0.00045109182,0.00042855737,0.00048096504,0.00014399727,0.0004919826,0.0011478453,0.00035201322,0.000018246119],"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.00022188372,0.000307757,0.0005730937,0.003038595,0.0007521661,0.00008498353,0.0036514564,0.3406484,0.00027215312,0.63333285,0.0013091329,0.015807537],"study_design_scores_gemma":[0.00091057585,0.000105699226,0.000013731963,0.00032556907,0.0001206518,0.0000069097437,0.0002556797,0.82908934,0.0013583698,0.1659732,0.0011591658,0.00068111985],"about_ca_topic_score_codex":0.00005210549,"about_ca_topic_score_gemma":0.000017516455,"teacher_disagreement_score":0.93530667,"about_ca_system_score_codex":0.00028978247,"about_ca_system_score_gemma":0.00037351428,"threshold_uncertainty_score":0.99979407},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89003617,0.0014411499,0.10129836,0.003999418,0.0009868599,0.00047704132,0.000009137594,0.0001103597,0.0016415191],"genre_scores_gemma":[0.9892101,0.00020663296,0.008590194,0.00011407055,0.00033660635,0.00004484168,0.0000059521244,0.000011580607,0.0014800165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986028,0.00021165377,0.00029044648,0.0005193092,0.00017305624,0.0002027214],"domain_scores_gemma":[0.9986243,0.00010220373,0.00021884784,0.00091816945,0.00008553266,0.000050950708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005137586,0.0002116349,0.00034363734,0.00006805483,0.00015633553,0.00008675702,0.0007974297,0.00007267587,0.00003893541],"category_scores_gemma":[0.00010168524,0.00014067147,0.0001391834,0.0001869101,0.00040702178,0.00015482781,0.00094029924,0.00037248636,0.000014061902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023756197,0.0003301814,0.032241635,0.000520172,0.0006779831,0.000021847945,0.008121324,0.0053632297,0.002716177,0.93713725,0.00089478365,0.011737858],"study_design_scores_gemma":[0.0067797424,0.0002829971,0.2904202,0.0004999727,0.0002682134,0.000084679945,0.00024411394,0.009312126,0.0550085,0.6271984,0.008230155,0.0016708764],"about_ca_topic_score_codex":0.00008750961,"about_ca_topic_score_gemma":0.000006254634,"teacher_disagreement_score":0.30993885,"about_ca_system_score_codex":0.000023653614,"about_ca_system_score_gemma":0.00015728835,"threshold_uncertainty_score":0.5736416},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7417164,0.002426708,0.25252354,0.00082894845,0.00092580443,0.00013742465,5.642543e-7,0.00004588076,0.0013947813],"genre_scores_gemma":[0.99264413,0.00024328282,0.0059571504,0.00016512179,0.000392827,4.9070843e-7,5.0670104e-7,0.000010895149,0.0005856042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985598,0.00007058329,0.00039533785,0.00016208692,0.0003461036,0.00046610736],"domain_scores_gemma":[0.99901986,0.00008572893,0.00036746566,0.00030563388,0.00012667292,0.00009461899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010281885,0.00013024341,0.0002682271,0.00016727745,0.0000627366,0.00007524982,0.0010383484,0.000053172625,0.0001155576],"category_scores_gemma":[0.000013811216,0.00010363595,0.00015363573,0.00036284197,0.000017242013,0.00061392586,0.00009964483,0.0005018474,0.00037228368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012700523,0.0003835914,0.0017617459,0.00007640048,0.00028864166,0.00009396647,0.0010502349,0.0014260687,0.009670822,0.9460844,0.002030914,0.03700622],"study_design_scores_gemma":[0.010111485,0.0079670325,0.003913139,0.000511144,0.00017494401,0.005061192,0.0004548204,0.2910047,0.09498968,0.3916585,0.19202794,0.0021254197],"about_ca_topic_score_codex":0.0000027599847,"about_ca_topic_score_gemma":6.635173e-7,"teacher_disagreement_score":0.5544259,"about_ca_system_score_codex":0.000073541654,"about_ca_system_score_gemma":0.00032621584,"threshold_uncertainty_score":0.4785078},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07866066,0.000276311,0.90458786,0.0015029509,0.00010869721,0.00035466495,0.000001858191,0.00012321763,0.014383779],"genre_scores_gemma":[0.69340557,0.000062404964,0.30637795,0.000049856204,0.0000026653256,0.000020515165,9.874017e-7,0.0000023824466,0.000077690696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989791,0.000110023866,0.00024850355,0.00024638948,0.0002170422,0.00019892753],"domain_scores_gemma":[0.9982611,0.00071618747,0.00007793303,0.0008519759,0.000035654644,0.000057168298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005691723,0.00009035245,0.00017308112,0.00009558001,0.00019657999,0.00012699413,0.0014650911,0.000032563523,0.000049133192],"category_scores_gemma":[0.00019960917,0.00007101167,0.000024135095,0.0006468865,0.00022031985,0.000635342,0.00067296566,0.0001352695,0.00005153844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028810211,0.00006575558,0.0006804146,0.00001501239,0.0000015424051,1.9493137e-7,0.00035492505,0.00011669391,0.00021220281,0.9610169,0.000004334875,0.037529156],"study_design_scores_gemma":[0.00027968438,0.00008982058,0.0012881266,0.00006824823,0.0000018018746,0.000007681821,0.00014753203,0.42296776,0.00031777343,0.5740672,0.0006274155,0.00013700426],"about_ca_topic_score_codex":0.0000013075502,"about_ca_topic_score_gemma":0.0000025946686,"teacher_disagreement_score":0.6147449,"about_ca_system_score_codex":0.00003093966,"about_ca_system_score_gemma":0.00003011312,"threshold_uncertainty_score":0.2895772},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6032807,0.0013774742,0.39145452,0.002623198,0.0006221617,0.00008080439,0.0000031595343,0.000028316967,0.00052962673],"genre_scores_gemma":[0.99357927,0.00017420475,0.005311658,0.000060789007,0.00036466285,5.025218e-7,3.8262573e-7,0.000010061651,0.0004984467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985679,0.000077253506,0.000507794,0.00013875976,0.0003144432,0.00039384293],"domain_scores_gemma":[0.9980337,0.00006369415,0.0009494783,0.0006806564,0.00018513385,0.00008734091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010889759,0.000123285,0.0003019726,0.00012066696,0.00016459076,0.00008964049,0.0019490795,0.00005729954,0.00005144277],"category_scores_gemma":[0.00015101115,0.000097137694,0.00018059225,0.00008452274,0.00004773503,0.00059495587,0.0001934771,0.00041769288,0.000016381548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001591726,0.0003388034,0.0036420885,0.00009373119,0.00037345593,0.00015979388,0.00066170515,0.0001447132,0.011991351,0.9124342,0.00070412166,0.069296874],"study_design_scores_gemma":[0.011302059,0.006819953,0.029828772,0.0008330311,0.00031145464,0.0033365951,0.00018160747,0.046880983,0.32019433,0.5252258,0.05321476,0.0018706404],"about_ca_topic_score_codex":0.000011488742,"about_ca_topic_score_gemma":0.000005956775,"teacher_disagreement_score":0.39029855,"about_ca_system_score_codex":0.00004365161,"about_ca_system_score_gemma":0.0003054351,"threshold_uncertainty_score":0.39611602},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.274127,0.00048774693,0.47598073,0.053180538,0.0012754377,0.002287419,0.00009839599,0.0003814303,0.19218129],"genre_scores_gemma":[0.97918767,4.7864734e-7,0.018150395,0.00051543664,0.0000915509,0.000025767777,0.0000016684163,0.000011329329,0.002015711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989016,0.00009392055,0.00025790773,0.00024037535,0.00020079948,0.00030541772],"domain_scores_gemma":[0.99849546,0.00018340925,0.000060872466,0.00040092392,0.00016417076,0.00069518684],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004679895,0.00012485846,0.00022716359,0.00010639845,0.000083207095,0.00009895676,0.0004340445,0.000034734097,0.0009535386],"category_scores_gemma":[0.00073042087,0.00010974991,0.000052651947,0.00020460598,0.00006972975,0.00010626687,0.0000488158,0.00013521675,0.003331166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003999482,0.00007078473,0.000012858248,0.0000354377,0.000027566513,0.00007910104,0.0024460254,0.000025269828,0.00022297761,0.99354213,0.0023702718,0.001163576],"study_design_scores_gemma":[0.0035854531,0.00085225725,0.00021163,0.0007729446,0.0001252159,0.001154268,0.0018020155,0.023861151,0.03916363,0.77424556,0.15231653,0.0019093566],"about_ca_topic_score_codex":0.0015889474,"about_ca_topic_score_gemma":0.00022906282,"teacher_disagreement_score":0.70506066,"about_ca_system_score_codex":0.0001102985,"about_ca_system_score_gemma":0.0005741979,"threshold_uncertainty_score":0.9999597},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029738536,0.00006471549,0.96762264,0.00038067048,0.0004635653,0.0015031169,0.000040611183,0.0001122676,0.000073909825],"genre_scores_gemma":[0.90553343,0.0000033406063,0.093605265,0.000044885313,0.000021329859,0.00010833255,0.00015669531,0.000021749733,0.0005049893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986928,0.000039615916,0.0004370776,0.00033182596,0.00019216152,0.00030650632],"domain_scores_gemma":[0.9982929,0.0004191083,0.00048779178,0.00038716526,0.0003693317,0.000043668653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059976167,0.00014033496,0.0002184798,0.00015608611,0.00017693787,0.00010494599,0.00031516966,0.00007886225,0.000012473945],"category_scores_gemma":[0.00010680426,0.00012699158,0.00007824522,0.00029729056,0.00001753914,0.0007139515,0.000058136004,0.00005803311,0.000013973546],"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.00008013219,0.000063652034,0.0006127322,0.00024673072,0.000056998844,2.1874484e-7,0.00039507652,0.7634628,0.004828712,0.22515187,0.00012815552,0.0049729384],"study_design_scores_gemma":[0.0008289095,0.00028664334,0.00017651149,0.00010948556,0.00001910798,0.0000022100553,0.00012864647,0.99622416,0.00033664776,0.0016573346,0.000060173792,0.00017017889],"about_ca_topic_score_codex":0.000020645117,"about_ca_topic_score_gemma":0.000018399773,"teacher_disagreement_score":0.8757949,"about_ca_system_score_codex":0.00007468384,"about_ca_system_score_gemma":0.000092293514,"threshold_uncertainty_score":0.5178566},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12754397,0.00347189,0.86398673,0.000701842,0.0002371988,0.0010618666,0.000092315095,0.00021014709,0.0026940568],"genre_scores_gemma":[0.9588217,0.00012636126,0.038065605,0.00021295571,0.00052369584,0.00035642914,0.000022547843,0.000012943122,0.00185773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939,0.000028257786,0.00013689786,0.00017439215,0.00006897045,0.00020146505],"domain_scores_gemma":[0.9993798,0.00020619362,0.00006435122,0.00018283151,0.00007137914,0.000095401985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001804777,0.00009644755,0.00010347321,0.00004343332,0.00020163036,0.000050728213,0.0002442286,0.00004731455,0.000026774977],"category_scores_gemma":[0.00003122337,0.000080249396,0.000031859774,0.00020005673,0.000029265304,0.00045706736,0.000102186794,0.000056315588,0.000062380794],"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.0000068452027,0.0000626879,0.00022423823,0.000041179006,0.000013362997,1.07954996e-7,0.001396904,6.341684e-7,0.0005150695,0.9784855,0.00019811079,0.019055353],"study_design_scores_gemma":[0.0013844487,0.0005064942,0.006180359,0.00006783185,0.00012951136,0.00005660525,0.0014761863,0.07277466,0.065417394,0.12002032,0.73044837,0.0015378295],"about_ca_topic_score_codex":0.0000016355378,"about_ca_topic_score_gemma":2.9927767e-7,"teacher_disagreement_score":0.8584652,"about_ca_system_score_codex":0.00000590918,"about_ca_system_score_gemma":0.000017982975,"threshold_uncertainty_score":0.32724753},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78217584,0.012342601,0.13328922,0.0013865412,0.0051143304,0.0017424148,0.000045124107,0.00033838276,0.063565575],"genre_scores_gemma":[0.98829347,0.0019593732,0.005346385,0.0006853768,0.00027668197,0.000025841835,0.000004449147,0.00004918251,0.00335924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672294,0.000328984,0.00078724214,0.0006766477,0.00086889055,0.00061528815],"domain_scores_gemma":[0.9968327,0.00044245436,0.0007719615,0.0013169211,0.00027085203,0.00036508736],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022674198,0.00037247248,0.00077797775,0.0006809582,0.0002630202,0.0026411982,0.008513358,0.0001347026,0.009117214],"category_scores_gemma":[0.0001472945,0.00031779392,0.00027366527,0.0013989976,0.00007847271,0.0061423653,0.0027024467,0.00047416025,0.0003561328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006395812,0.0015416614,0.2370542,0.0006197411,0.0009653903,0.0005863249,0.0022639462,0.0018345508,0.22625904,0.2564324,0.10919136,0.16261178],"study_design_scores_gemma":[0.0038523464,0.00014078648,0.2843026,0.0013203196,0.00014353715,0.000301114,0.00019609879,0.02420543,0.17958385,0.36868456,0.13415527,0.0031140908],"about_ca_topic_score_codex":0.00019514686,"about_ca_topic_score_gemma":0.000011125014,"teacher_disagreement_score":0.20611764,"about_ca_system_score_codex":0.00007830852,"about_ca_system_score_gemma":0.00020382299,"threshold_uncertainty_score":0.9999274},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058536153,0.012810342,0.92544085,0.0012797972,0.0013006266,0.00046218364,0.00008320616,0.000046470257,0.000040389736],"genre_scores_gemma":[0.43609178,0.0050460817,0.553245,0.00028576935,0.0034335467,0.000044106735,0.00013671341,0.00013468767,0.0015823115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605185,0.000394818,0.0017309688,0.000463065,0.00063843187,0.0007208501],"domain_scores_gemma":[0.99540824,0.0004256015,0.0020381426,0.0007936889,0.0011607532,0.00017356683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025999898,0.00039803248,0.0012980794,0.0004641132,0.00015342684,0.00023857964,0.0019431477,0.00034012226,0.00008922822],"category_scores_gemma":[0.0005239085,0.00036272997,0.0009817807,0.00048578953,0.00007884629,0.00033934004,0.0005839389,0.0011322185,0.0000022795814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007215146,0.00054585974,0.0000468877,0.0008037919,0.0023388183,0.000059303373,0.0018315904,0.0152073605,0.012750909,0.9465435,0.0019114605,0.017238962],"study_design_scores_gemma":[0.011157908,0.0038078297,0.000053648142,0.0013379793,0.0011869948,0.00097058644,0.00031300605,0.0985037,0.22603337,0.6163037,0.038163308,0.002167956],"about_ca_topic_score_codex":0.000009305331,"about_ca_topic_score_gemma":0.000007991282,"teacher_disagreement_score":0.37755564,"about_ca_system_score_codex":0.00022301967,"about_ca_system_score_gemma":0.0047972403,"threshold_uncertainty_score":0.99988246},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2674354,0.00032064595,0.6618831,0.0010781962,0.0036319979,0.0004107563,0.00003505536,0.00046255093,0.064742275],"genre_scores_gemma":[0.9554613,0.00014108108,0.038514048,0.00012378028,0.0051653436,0.000007285915,0.000012627549,0.000015543625,0.0005589825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989871,0.000094631905,0.00028743292,0.00022803564,0.00022967598,0.00017316299],"domain_scores_gemma":[0.9991482,0.00014997016,0.00021337204,0.0003477968,0.0000791171,0.0000615247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032066536,0.000108875734,0.00019729133,0.00018312101,0.00011125526,0.0001015945,0.00073073,0.000047065343,0.00017006286],"category_scores_gemma":[0.000050196275,0.00009494354,0.000069247326,0.0006819751,0.000045636185,0.00044051904,0.00015244143,0.00006914433,0.00016437721],"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.000009576928,0.00012760588,0.0012174301,0.00008345567,0.000014242808,0.000002190261,0.00046533754,0.00006693416,0.0024940872,0.92607117,0.0008997367,0.06854823],"study_design_scores_gemma":[0.0019991887,0.00072516483,0.052032948,0.00018432018,0.00009251752,0.000049352915,0.00020169737,0.13024235,0.03539608,0.1516918,0.6257953,0.0015892643],"about_ca_topic_score_codex":0.000013351175,"about_ca_topic_score_gemma":0.0000030014787,"teacher_disagreement_score":0.7743794,"about_ca_system_score_codex":0.0000090924605,"about_ca_system_score_gemma":0.000024791903,"threshold_uncertainty_score":0.38716853},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010200202,0.000010207037,0.9951737,0.0021223475,0.00025319896,0.0001291677,0.000007321411,0.0003820427,0.0009019897],"genre_scores_gemma":[0.11664713,0.000008552192,0.8803095,0.00029150728,0.000055437933,0.00004224182,6.1069545e-7,0.000017227128,0.002627755],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989256,0.000036970836,0.00019555342,0.000311462,0.00026498214,0.00026542114],"domain_scores_gemma":[0.9969164,0.00037490207,0.0000780975,0.0024424768,0.000040496314,0.00014763873],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024746766,0.00015376853,0.00018724271,0.000052942196,0.00092924206,0.00038424262,0.002371279,0.0000834179,0.00047625066],"category_scores_gemma":[0.0003751356,0.00012609114,0.00014053521,0.00007240269,0.000106258754,0.00052455405,0.00004802397,0.00022722867,0.0012738],"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.000008294524,0.0003505749,0.000016342035,0.00008309571,0.00004062636,0.000031484753,0.00030878812,0.00007767892,0.000025111183,0.086893916,0.00005515453,0.91210896],"study_design_scores_gemma":[0.00024450332,0.00006610672,0.00017488012,0.00006588456,0.000014002987,0.00003236444,0.000011796178,0.0013533655,0.0013940085,0.9952208,0.0012261495,0.00019617441],"about_ca_topic_score_codex":0.0000030238864,"about_ca_topic_score_gemma":0.0000010969533,"teacher_disagreement_score":0.91191274,"about_ca_system_score_codex":0.00002086588,"about_ca_system_score_gemma":0.000024124469,"threshold_uncertainty_score":0.99950385},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30051973,0.022766152,0.64953786,0.002465961,0.014636842,0.0029124874,0.00038393124,0.0012402161,0.0055368263],"genre_scores_gemma":[0.8039077,0.0017068702,0.18663,0.0005432796,0.0012332934,0.000040688166,0.00007252065,0.00008611666,0.005779533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759775,0.00017996904,0.000571403,0.00086772727,0.00040492072,0.00037823548],"domain_scores_gemma":[0.997944,0.0002939287,0.00033878296,0.001103408,0.0001494419,0.00017041224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046506725,0.00043341218,0.00078517036,0.000192035,0.00007659812,0.000121966026,0.0011784019,0.0003873829,0.000115847055],"category_scores_gemma":[0.000042470314,0.0003661751,0.00027175792,0.00024060138,0.00011968832,0.00019150165,0.0016360027,0.00065737055,0.000121717065],"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.001906875,0.0043082074,0.0073134336,0.017760536,0.00335521,0.0005628044,0.013550644,0.020219902,0.0050169122,0.26146394,0.0149815865,0.6495599],"study_design_scores_gemma":[0.0032051348,0.00030852074,0.0022201792,0.0004433169,0.00019480773,0.000038464037,0.000056898898,0.8872923,0.010384384,0.012336735,0.08192474,0.0015944993],"about_ca_topic_score_codex":0.000096562355,"about_ca_topic_score_gemma":9.5324646e-7,"teacher_disagreement_score":0.8670724,"about_ca_system_score_codex":0.000014386519,"about_ca_system_score_gemma":0.000105740946,"threshold_uncertainty_score":0.999879},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82236195,0.004666979,0.17079397,0.0011483148,0.00046472915,0.0002034734,0.0000042529973,0.000033506465,0.00032285132],"genre_scores_gemma":[0.98994887,0.00037088484,0.008764385,0.00007998075,0.00016995179,0.0000010768439,0.00000176255,0.000014439859,0.00064867403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980082,0.00018713195,0.00069848285,0.0002259711,0.000415931,0.00046430124],"domain_scores_gemma":[0.9983803,0.00028129938,0.00059290446,0.00037264734,0.0002529631,0.00011990177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014359282,0.00017339014,0.00039252118,0.00023537625,0.00009268405,0.00006136099,0.0006466789,0.00008095821,0.00011088211],"category_scores_gemma":[0.00010435039,0.00014584935,0.0001644926,0.00032326468,0.000067397865,0.0005800717,0.00012202456,0.0004732575,0.00005575704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010312693,0.00020046228,0.0007795915,0.00010363718,0.00022174334,0.000024945472,0.001222446,0.00020970439,0.008657823,0.9790584,0.00011455843,0.009303568],"study_design_scores_gemma":[0.010393902,0.010001948,0.003270319,0.00073869963,0.00039430035,0.0025498052,0.0011588618,0.2313596,0.051632695,0.6610736,0.025495123,0.001931114],"about_ca_topic_score_codex":0.000015588628,"about_ca_topic_score_gemma":0.0000057756647,"teacher_disagreement_score":0.31798476,"about_ca_system_score_codex":0.00007996901,"about_ca_system_score_gemma":0.00050930714,"threshold_uncertainty_score":0.59475636},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049629703,0.0005988242,0.8710518,0.005013595,0.0012443184,0.0006642751,0.000004065672,0.0001254575,0.071667954],"genre_scores_gemma":[0.99639165,0.00016630505,0.0007422891,0.0004354243,0.000095658484,0.000014220243,7.543816e-7,0.000005428807,0.0021482725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909425,0.00027289984,0.00012733472,0.0001898992,0.00013377189,0.00018185677],"domain_scores_gemma":[0.9937113,0.005835484,0.00004991124,0.00034305363,0.000024089344,0.00003613975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063596334,0.000090104055,0.00009637758,0.000025678974,0.00031180703,0.00020653522,0.0006114073,0.000017448527,0.000054743432],"category_scores_gemma":[0.00029755506,0.00004060313,0.00005695267,0.00009587889,0.00033820118,0.00012177051,0.00023900317,0.00020778463,0.00034199082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014184757,0.0000085846805,0.0000058616083,0.0000019117933,0.00002099195,8.6288804e-7,0.0063373214,0.000014032718,0.00012134828,0.91197455,0.0008833142,0.080489345],"study_design_scores_gemma":[0.0007736964,0.00010943496,0.00009659543,0.000012853942,0.0000063961897,0.000059340076,0.00054320256,0.19394684,0.0013508275,0.74808943,0.05489099,0.00012038721],"about_ca_topic_score_codex":0.000013464298,"about_ca_topic_score_gemma":0.0000053760864,"teacher_disagreement_score":0.94676197,"about_ca_system_score_codex":0.000006862457,"about_ca_system_score_gemma":0.000022168331,"threshold_uncertainty_score":0.4395714},"labels":[],"label_agreement":null},{"id":"W2979140977","doi":"10.1137/20m1358955","title":"Fast Interpolation-Based Globality Certificates for Computing Kreiss Constants and the Distance to Uncontrollability","year":2021,"lang":"en","type":"preprint","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; York University; Courant Institute of Mathematical Sciences, New York University; National Science Foundation","keywords":"Interpolation (computer graphics); Mathematics; Eigenvalues and eigenvectors; Variable (mathematics); Convergence (economics); Function (biology); State (computer science); Algorithm; Applied mathematics; Computer science; Mathematical analysis; Image (mathematics)","score_opus":0.01250953728077803,"score_gpt":0.29944874033121316,"score_spread":0.28693920305043513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979140977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064798538,0.0008655424,0.9838156,0.007639786,0.00009007284,0.0008269306,0.00014707039,0.000037326365,0.00009782213],"genre_scores_gemma":[0.9584227,0.000062520456,0.04078837,0.0003681363,0.00016314427,0.00011838072,0.000030526186,0.000007643065,0.000038529404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768126,0.00036316455,0.0007388863,0.00070071843,0.0002738127,0.0002421485],"domain_scores_gemma":[0.9966878,0.0012366553,0.0005950507,0.00082841294,0.00043367286,0.00021839782],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021640498,0.00026329313,0.00068825466,0.00018800233,0.00081366434,0.0014856494,0.0007572412,0.00009906422,0.000011136434],"category_scores_gemma":[0.00014875783,0.0001835631,0.00043275498,0.00089985784,0.00019529693,0.000084216124,0.0003495618,0.00041699552,0.0000014419317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004896226,0.0005481028,0.0080833575,0.0004245271,0.0030146255,0.0000060785032,0.0012015976,0.13498908,0.00016377654,0.70673585,0.00021795412,0.1441254],"study_design_scores_gemma":[0.0009992806,0.00003261928,0.002425079,0.00008797421,0.0007348514,0.00000828048,0.00027910856,0.9366169,0.00006648712,0.056562155,0.0018517831,0.0003355101],"about_ca_topic_score_codex":0.000024514591,"about_ca_topic_score_gemma":0.000036169567,"teacher_disagreement_score":0.9519429,"about_ca_system_score_codex":0.00006779501,"about_ca_system_score_gemma":0.0001417587,"threshold_uncertainty_score":0.9995509},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08465106,0.0000033367266,0.9125209,0.00003811367,0.00022803541,0.00029371696,0.0000100180805,0.00013305512,0.002121759],"genre_scores_gemma":[0.97272813,0.000003844229,0.025460338,0.000108936896,0.00006640294,7.235449e-7,0.000022003163,0.000008238175,0.0016013767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894094,0.00007904385,0.00014540226,0.00045372298,0.000054715736,0.00032616185],"domain_scores_gemma":[0.99918896,0.00012644926,0.00013654892,0.00037422206,0.00010032697,0.00007349868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053548097,0.000120672325,0.00013301149,0.00010755356,0.00020253284,0.00007555178,0.0004197524,0.00005325337,0.00017964774],"category_scores_gemma":[0.00002083576,0.00013190915,0.00010504511,0.00041591897,0.000024588178,0.000704024,0.00016567428,0.00007864122,0.00005257951],"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.00008243358,0.00007863479,0.0010980673,0.000053796808,0.00004541483,0.000007340785,0.000125562,0.26374108,0.00033338164,0.72948086,0.000038199698,0.0049152225],"study_design_scores_gemma":[0.00094378076,0.000113865295,0.00010621263,0.000010255912,0.000020561389,0.0000016128828,0.000118712705,0.9900632,0.00023922691,0.006051334,0.0021523165,0.00017895368],"about_ca_topic_score_codex":0.000014145846,"about_ca_topic_score_gemma":0.000004263524,"teacher_disagreement_score":0.8880771,"about_ca_system_score_codex":0.000045035908,"about_ca_system_score_gemma":0.00005815765,"threshold_uncertainty_score":0.5379099},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07478469,0.0002486851,0.91443175,0.003633133,0.0010168084,0.0008856565,0.000012686472,0.000027316028,0.004959253],"genre_scores_gemma":[0.46415913,0.00004694201,0.5329757,0.00009572617,0.0004202759,0.000018008177,7.424195e-7,0.000030452644,0.0022530665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728876,0.00024246374,0.0005828297,0.00018588759,0.001288814,0.0004112378],"domain_scores_gemma":[0.9946957,0.0034823227,0.00032995673,0.00053465547,0.00080259965,0.00015476359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009563194,0.00012781452,0.00035059676,0.0006218516,0.00012980727,0.00032964084,0.001640035,0.000076174016,0.00016127029],"category_scores_gemma":[0.000671011,0.000089258385,0.00021129164,0.00042468891,0.00004536775,0.0003393674,0.00014926032,0.0004121426,0.0001863079],"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.0006337585,0.0029496455,0.00013005201,0.0034858268,0.00016004464,0.00020224683,0.0027777732,0.002239464,0.029938983,0.91903377,0.024036482,0.014411941],"study_design_scores_gemma":[0.0022962296,0.002475307,0.00006345578,0.0007130429,0.000015176566,0.00014396397,0.00032700875,0.751636,0.015222604,0.21595463,0.010876794,0.00027573624],"about_ca_topic_score_codex":7.907051e-7,"about_ca_topic_score_gemma":2.434864e-7,"teacher_disagreement_score":0.74939656,"about_ca_system_score_codex":0.00006931202,"about_ca_system_score_gemma":0.0002863032,"threshold_uncertainty_score":0.36398515},"labels":[],"label_agreement":null},{"id":"W2988877209","doi":"10.1137/19m1298317","title":"On Fixed-Point, Krylov, and $2\\times 2$ Block Preconditioners for Nonsymmetric Problems","year":2020,"lang":"en","type":"preprint","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy","keywords":"Preconditioner; Schur complement; Mathematics; Generalized minimal residual method; Block (permutation group theory); Applied mathematics; Discretization; Block matrix; Krylov subspace; Convergence (economics); Linear system; Iterative method; Mathematical optimization; Mathematical analysis; Eigenvalues and eigenvectors; Combinatorics","score_opus":0.013297441913497467,"score_gpt":0.2782597135055652,"score_spread":0.26496227159206776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2988877209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001721204,0.0009420846,0.9899232,0.004989024,0.00010477895,0.0009856541,0.00022120625,0.00009401178,0.0010188532],"genre_scores_gemma":[0.87884444,0.0038278785,0.110253945,0.0013323189,0.0015514917,0.0014524937,0.00029193383,0.00008427453,0.0023612187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780375,0.00012074068,0.0006276633,0.0008403337,0.00032195658,0.00028557068],"domain_scores_gemma":[0.9976537,0.0005474659,0.00067299826,0.000606945,0.00016021858,0.00035863096],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000678935,0.00035457578,0.00063557987,0.0011024864,0.0006151549,0.0008564848,0.00073537236,0.00018427317,0.000041979813],"category_scores_gemma":[0.000063751606,0.00030093605,0.0004847805,0.0014808822,0.00006871016,0.00015555264,0.00032175254,0.00073951593,0.000024002438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053662112,0.0006270035,0.00024642024,0.00048207713,0.0038104027,0.000010958579,0.00040095331,0.040411286,0.00013174226,0.8758471,0.006981868,0.070996515],"study_design_scores_gemma":[0.001108718,0.00056829146,0.0010437742,0.00015825579,0.0024514368,0.0000912215,0.00007750016,0.18984859,0.0002656054,0.77924067,0.02407681,0.0010691439],"about_ca_topic_score_codex":0.0000040725718,"about_ca_topic_score_gemma":0.0000018890247,"teacher_disagreement_score":0.87966925,"about_ca_system_score_codex":0.000048493734,"about_ca_system_score_gemma":0.000090579015,"threshold_uncertainty_score":0.99994427},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5342491,0.00001045588,0.46532828,0.0000107837395,0.00006186065,0.0001133972,0.0000030247206,0.00001893734,0.0002041126],"genre_scores_gemma":[0.9961172,0.000005498356,0.0035388449,0.0000045422335,0.0000071835357,2.2712396e-7,0.0000013648317,0.000003234682,0.00032192626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999358,0.00007575808,0.00013314781,0.00024789173,0.00005386856,0.00013134771],"domain_scores_gemma":[0.99937826,0.00006368893,0.00009740185,0.0003243477,0.000071083945,0.00006521752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021248942,0.000072964205,0.00015686968,0.0001482577,0.000043600794,0.000012100895,0.00027419862,0.000047737303,0.0000046428345],"category_scores_gemma":[0.000009510732,0.00007599994,0.0000448572,0.00050732767,0.000057019955,0.00024102062,0.00015917029,0.000051375235,0.000010735912],"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.000024216462,0.000040297207,0.00065049424,0.000071526396,0.000014364586,0.0000024763478,0.00016476525,0.26724708,0.0025362817,0.7291735,0.0000041895264,0.00007081505],"study_design_scores_gemma":[0.00025410554,0.00011348665,0.001002038,0.000037276008,0.000011309739,0.0000025364657,0.00011185759,0.9949451,0.00042229288,0.0029954826,0.000022064092,0.00008245383],"about_ca_topic_score_codex":0.000030159388,"about_ca_topic_score_gemma":0.0000023368466,"teacher_disagreement_score":0.727698,"about_ca_system_score_codex":0.000018808674,"about_ca_system_score_gemma":0.00002287083,"threshold_uncertainty_score":0.30991876},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09545549,0.000049972936,0.899521,0.00011012961,0.0013580454,0.00026642624,0.000017839575,0.00008094373,0.003140158],"genre_scores_gemma":[0.990444,0.000092054564,0.007267274,0.00017239785,0.000043539432,4.5446993e-7,0.0000030829874,0.000011155979,0.0019660506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980539,0.0006061577,0.00021409805,0.0007711267,0.00010389882,0.00025078474],"domain_scores_gemma":[0.9967392,0.00081211445,0.00034557673,0.001891447,0.00012982641,0.000081828024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092022243,0.00024750046,0.00034789927,0.00021252174,0.00008901909,0.000036692047,0.003076793,0.00020017319,0.00017628359],"category_scores_gemma":[0.000115982984,0.00020694156,0.00027703212,0.00066269154,0.00013790706,0.00014843211,0.0018521772,0.0005807424,0.00017446534],"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.000026903026,0.00009159364,0.00028080496,0.00010020796,0.00009963732,0.000031894073,0.00017410047,0.044402704,0.00013422247,0.95367426,0.0002057556,0.0007779056],"study_design_scores_gemma":[0.00030525177,0.000096772324,0.00023374204,0.00013914725,0.00004212612,0.00000258398,0.00007305792,0.77986604,0.0046467884,0.21365003,0.0005830533,0.0003614329],"about_ca_topic_score_codex":0.000024079456,"about_ca_topic_score_gemma":5.922519e-7,"teacher_disagreement_score":0.8949885,"about_ca_system_score_codex":0.00005920854,"about_ca_system_score_gemma":0.0001259088,"threshold_uncertainty_score":0.8438832},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6925178,0.00011066528,0.30694345,0.0000777759,0.00013632685,0.00010201634,4.6331957e-7,0.000011054926,0.00010045288],"genre_scores_gemma":[0.84843606,0.000008652151,0.15145117,0.000012331509,0.0000721538,0.000003155141,1.5976283e-7,0.0000033020679,0.000013018127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991893,0.000005067086,0.00027307248,0.00014223918,0.00022681696,0.00016351318],"domain_scores_gemma":[0.999495,0.00008636774,0.00020865959,0.00009320246,0.00006595017,0.00005080943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010580592,0.0000936537,0.00018356525,0.00013221221,0.00010544505,0.00014360811,0.0003000668,0.000019901901,0.0000020515588],"category_scores_gemma":[0.00000822613,0.00006419386,0.000032796703,0.00022743706,0.000052144645,0.0005634196,0.000031228556,0.00009760865,6.1475004e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059636775,0.00006973861,0.0005330019,0.00048685464,0.000032910284,0.0000012618489,0.0014827562,0.6426505,0.27821618,0.06806951,0.000023715997,0.008373924],"study_design_scores_gemma":[0.00055037095,0.0007395188,0.00017446424,0.0001903282,0.000005741482,0.000052640728,0.00006976842,0.9785648,0.018945161,0.0004600992,0.00013196896,0.000115162264],"about_ca_topic_score_codex":5.6460914e-7,"about_ca_topic_score_gemma":1.19042795e-7,"teacher_disagreement_score":0.33591428,"about_ca_system_score_codex":0.000009585746,"about_ca_system_score_gemma":0.00006161019,"threshold_uncertainty_score":0.26177496},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5096476,0.00046996164,0.48308977,0.0013125737,0.00039257534,0.00035730412,0.0000037102159,0.000008040902,0.004718433],"genre_scores_gemma":[0.9687603,0.000034765813,0.030492457,0.0000052513938,0.000036606023,7.70318e-7,5.8635408e-8,0.000004882677,0.00066488155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976878,0.00029237417,0.0005632135,0.000070953036,0.0012014058,0.00018424573],"domain_scores_gemma":[0.997383,0.00080096046,0.0005008392,0.00051250105,0.00075751933,0.00004516628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006961472,0.000054366075,0.00022332888,0.00027831167,0.00007563397,0.0000368099,0.0012775514,0.000040322957,0.00006432367],"category_scores_gemma":[0.0005602528,0.000032826985,0.00015575881,0.0006430421,0.00011038904,0.00022685088,0.0003032649,0.00029686643,0.000025858359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000803671,0.00047807596,0.0002501017,0.0005369553,0.000089583584,0.0000031433458,0.0036412664,0.0012074637,0.016428323,0.97342587,0.0005624419,0.0033687605],"study_design_scores_gemma":[0.00045635886,0.00041058997,0.00071075564,0.0005845082,0.000024953031,0.00008693194,0.001186749,0.32674664,0.035235286,0.63424313,0.00021826144,0.00009585734],"about_ca_topic_score_codex":0.0000037672248,"about_ca_topic_score_gemma":5.327622e-7,"teacher_disagreement_score":0.4591127,"about_ca_system_score_codex":0.0000361462,"about_ca_system_score_gemma":0.00023573157,"threshold_uncertainty_score":0.2412721},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085402064,0.000030735384,0.9106329,0.0010342628,0.0009401804,0.00042048926,0.00001588761,0.00022370658,0.0012997538],"genre_scores_gemma":[0.49759194,0.0000015036397,0.5002624,0.0008285754,0.00042488583,0.0000069392627,0.000012622401,0.000028202643,0.00084293156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973175,0.00015310085,0.0005860708,0.0007894496,0.00054517505,0.0006086866],"domain_scores_gemma":[0.9982039,0.000109925095,0.000404069,0.00047596553,0.00028321496,0.0005229716],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020164426,0.00024702307,0.00028842955,0.00024988403,0.0012812231,0.0020744023,0.0015325997,0.00007261281,0.00001669076],"category_scores_gemma":[0.00005878586,0.0002199836,0.00016714078,0.00081168,0.00011145534,0.0012407604,0.0003749607,0.00042974725,0.00004536326],"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.000039383016,0.00017703036,0.000013715165,0.00013009584,0.00002314529,0.0000148937615,0.0024699494,0.93729615,0.004330857,0.035384208,0.0055959346,0.014524612],"study_design_scores_gemma":[0.0006701336,0.0002608969,0.0000038632993,0.00008725971,0.000009677266,0.00008009422,0.00005005227,0.95465964,0.0008995664,0.04155874,0.0014483865,0.0002716889],"about_ca_topic_score_codex":7.79358e-7,"about_ca_topic_score_gemma":0.0000011426669,"teacher_disagreement_score":0.41218987,"about_ca_system_score_codex":0.0000624879,"about_ca_system_score_gemma":0.0002196174,"threshold_uncertainty_score":0.99896157},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038659186,0.0003082723,0.91530806,0.0005695687,0.00007782901,0.00005635732,0.000001027154,0.0003155732,0.082976736],"genre_scores_gemma":[0.7140951,0.000114775736,0.25283983,0.0012603718,0.00014011485,0.000011893805,0.0000015270648,0.000011996259,0.03152438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939156,0.000032888387,0.00010606061,0.00020366344,0.000109121254,0.0001566905],"domain_scores_gemma":[0.99946094,0.0000337177,0.00003017703,0.00040228813,0.00002076019,0.000052112624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013767448,0.00006943685,0.00008037677,0.00002831134,0.00007542149,0.00011179838,0.0005026327,0.000019380124,0.00052247976],"category_scores_gemma":[0.0000146128195,0.000053606218,0.000031428397,0.0002707797,0.0000211477,0.00032530443,0.00009342922,0.00004891916,0.0004573117],"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":[5.223126e-7,0.000025344796,0.000026841317,0.00000917224,0.0000023944617,0.000009440378,0.00009076814,0.00000331195,0.0000589071,0.9411034,0.0027683019,0.05590158],"study_design_scores_gemma":[0.000280259,0.00003773332,0.000108632805,0.000026755613,0.0000030832946,0.00002937509,0.00001722058,0.7873548,0.0026894575,0.07286639,0.13624999,0.00033628146],"about_ca_topic_score_codex":0.0000010392051,"about_ca_topic_score_gemma":2.8769682e-7,"teacher_disagreement_score":0.868237,"about_ca_system_score_codex":0.0000064672217,"about_ca_system_score_gemma":0.0000016660566,"threshold_uncertainty_score":0.58779687},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056752437,0.000096189906,0.98910564,0.0038631083,0.00018860798,0.000098354416,0.000008252019,0.000028585668,0.00093603454],"genre_scores_gemma":[0.1836554,0.000025489051,0.8145273,0.0009902392,0.0005019179,0.000004625666,0.0000017074683,0.000015926369,0.000277413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919933,0.000018350433,0.00038051416,0.0000677276,0.00020372776,0.00013037026],"domain_scores_gemma":[0.9990185,0.00021702483,0.0003342588,0.00015056125,0.00014935278,0.0001303078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046746174,0.000076330325,0.00018850365,0.000052145737,0.000088843146,0.00008887045,0.0005865236,0.000030147725,0.00003247429],"category_scores_gemma":[0.00018049388,0.000059883765,0.00014009481,0.00014954359,0.000026685671,0.0002668374,0.00005860402,0.000112970716,0.000019966696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000118222815,0.00016900565,0.0000035748608,0.00021320011,0.00006817623,0.00003474663,0.004259462,0.00021570768,0.0010925195,0.9782281,0.013432364,0.0022713114],"study_design_scores_gemma":[0.0016766848,0.0012885765,0.000012492982,0.00025345388,0.000099546996,0.0005179813,0.0013097373,0.1873189,0.011014569,0.73854685,0.057624575,0.0003366303],"about_ca_topic_score_codex":1.0433181e-7,"about_ca_topic_score_gemma":8.701687e-8,"teacher_disagreement_score":0.23968126,"about_ca_system_score_codex":0.000016807533,"about_ca_system_score_gemma":0.00006717645,"threshold_uncertainty_score":0.2441989},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028590433,0.00007108114,0.9929201,0.0054855268,0.00007374963,0.000051021147,2.9668539e-7,0.000016981794,0.0010953484],"genre_scores_gemma":[0.15638748,0.00003206189,0.83973706,0.0021568325,0.0015384977,0.0000018372148,3.1360184e-7,0.000016068518,0.00012984326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895245,0.00017180841,0.00037354307,0.00007787484,0.00031423784,0.00011006225],"domain_scores_gemma":[0.9985896,0.0007211107,0.0002709287,0.00017827585,0.00013432495,0.000105784195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008660505,0.000075169446,0.00018584884,0.000010181875,0.0001020766,0.00020748797,0.00060231955,0.000021161317,0.000011304987],"category_scores_gemma":[0.00036091736,0.00004198145,0.00012890155,0.00023003481,0.000022413364,0.00036204865,0.0000797971,0.00019883724,0.000058450492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071144677,0.000035915094,7.219652e-7,0.000035770357,0.00002372813,0.000008744522,0.0006129066,0.00013588557,0.0005195193,0.95853573,0.0008692843,0.039214674],"study_design_scores_gemma":[0.00015049924,0.00010849814,0.000004822314,0.0000387452,0.000016404058,0.000043450338,0.000020678961,0.25604454,0.0019008926,0.7399178,0.0016952276,0.000058421818],"about_ca_topic_score_codex":1.768522e-8,"about_ca_topic_score_gemma":2.2914428e-9,"teacher_disagreement_score":0.25590864,"about_ca_system_score_codex":0.000010338949,"about_ca_system_score_gemma":0.0000292136,"threshold_uncertainty_score":0.20008112},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052428376,0.000098052056,0.92006564,0.015552121,0.000026549182,0.00033855508,0.000027139016,0.00008087795,0.011382717],"genre_scores_gemma":[0.8866337,0.0000130813205,0.11291989,0.00035680275,0.000020588981,0.000027956372,0.0000039742426,0.0000062809395,0.00001771468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990194,0.0002568041,0.0002581449,0.0001527473,0.00019266675,0.000120250654],"domain_scores_gemma":[0.9966794,0.0014105008,0.00009973182,0.0017279838,0.000033883975,0.00004849058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002978991,0.00009743161,0.0001897975,0.000016263317,0.00011113294,0.00006213788,0.0024815262,0.00003067914,0.00001840279],"category_scores_gemma":[0.0001501432,0.00007212156,0.00007090075,0.00042677877,0.00017793804,0.00015151843,0.0009225948,0.0002577223,0.00010177174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004242013,0.0003344054,0.0000110199935,0.000014369074,0.0000135911305,5.416003e-7,0.0019614496,0.00016143724,0.0002829505,0.995319,0.00009669089,0.0018003203],"study_design_scores_gemma":[0.00013977854,0.000038900085,0.00006619074,0.000057204765,0.0000065326617,3.587271e-7,0.00008421652,0.32165432,0.0010149092,0.67674404,0.00011501359,0.000078538724],"about_ca_topic_score_codex":0.000004368402,"about_ca_topic_score_gemma":2.7006803e-7,"teacher_disagreement_score":0.8342053,"about_ca_system_score_codex":0.000019522538,"about_ca_system_score_gemma":0.000027566095,"threshold_uncertainty_score":0.46113345},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039860852,0.00004769389,0.9581312,0.001578228,0.00017532488,0.000064619926,0.000015757634,0.000015022502,0.000111311885],"genre_scores_gemma":[0.8886364,0.00000734682,0.11017441,0.0008658382,0.0002842519,8.4524237e-7,0.000016859738,0.000007779982,0.000006241258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986161,0.00008172797,0.0004711861,0.00013451141,0.0005992683,0.00009721768],"domain_scores_gemma":[0.9983346,0.00041916425,0.0005276574,0.00008302756,0.0005177232,0.00011786001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019705782,0.00011506326,0.00021700455,0.00004884222,0.00008928354,0.00004878871,0.00034231352,0.000029936442,0.000018049692],"category_scores_gemma":[0.00005876206,0.00009978784,0.00010996894,0.00030917054,0.000036155496,0.0006511719,0.00005808427,0.0001367356,0.000009416082],"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.000027828595,0.00012306328,0.000043867163,0.000012886701,0.00003379968,0.0000029451808,0.00035377056,0.92643154,0.00019594854,0.067827426,0.001425147,0.0035217672],"study_design_scores_gemma":[0.00057777215,0.00028987962,0.00018357631,0.00003469677,0.0000096341855,0.0000075547396,0.00002112808,0.9713651,0.0041862368,0.022692345,0.0005127118,0.00011939921],"about_ca_topic_score_codex":6.7211147e-7,"about_ca_topic_score_gemma":2.1447386e-8,"teacher_disagreement_score":0.84877557,"about_ca_system_score_codex":0.000020443838,"about_ca_system_score_gemma":0.00013696664,"threshold_uncertainty_score":0.406923},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035352824,0.0020750903,0.8783401,0.0023193194,0.00017216284,0.0012648476,0.00006691837,0.0008555572,0.11455247],"genre_scores_gemma":[0.004224162,0.0007105779,0.8431084,0.0028010316,0.0008620902,0.00011050384,0.000076097334,0.00027456923,0.14783256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99687994,0.000110426496,0.00092176325,0.0010180142,0.0006353564,0.00043451416],"domain_scores_gemma":[0.99643934,0.001216768,0.00082512735,0.00088117976,0.000111310874,0.0005262903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076429005,0.0007753671,0.0015130423,0.00006964139,0.00025962133,0.00038921126,0.0007736889,0.00032306992,0.000057859605],"category_scores_gemma":[0.00021480914,0.0006595797,0.00039807995,0.00026923898,0.0011711824,0.0004317878,0.0009805107,0.00081850175,0.00015834527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022034868,0.00029298093,0.000007072076,0.004497247,0.00065194676,0.000049932987,0.008979738,0.0000015118861,0.00006186351,0.92837083,0.045114666,0.011950193],"study_design_scores_gemma":[0.0006472616,0.0005001584,0.0000044117833,0.00058161304,0.00017255201,0.00007440842,0.0009903023,0.25651604,0.000043616437,0.67675066,0.06259256,0.001126404],"about_ca_topic_score_codex":0.0000028223444,"about_ca_topic_score_gemma":1.6924126e-7,"teacher_disagreement_score":0.25651455,"about_ca_system_score_codex":0.000059723043,"about_ca_system_score_gemma":0.00031411534,"threshold_uncertainty_score":0.99958557},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023214838,0.00035392412,0.96133435,0.018983433,0.00017812448,0.0009197176,0.0000027372653,0.00026580517,0.015640428],"genre_scores_gemma":[0.06733555,0.000074256954,0.9219404,0.009871073,0.00031506864,0.00033031745,0.0000016565094,0.000027344473,0.0001043708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99332356,0.002293715,0.0010806432,0.0009883246,0.0013388372,0.00097488635],"domain_scores_gemma":[0.99179137,0.006474244,0.00033640946,0.001118172,0.000058624013,0.00022120735],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.016967868,0.00044257278,0.0005437282,0.000100273886,0.0013371678,0.0012827789,0.0062058596,0.00013423552,0.000045635956],"category_scores_gemma":[0.0010012508,0.00023514003,0.00021014396,0.00257691,0.0008698091,0.0005125347,0.0007536209,0.0005974185,0.00029889966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000246826,0.00007586513,0.0000066191187,0.000043644442,0.000011594418,0.0000060371926,0.005149701,0.0023454719,0.0026071689,0.9629016,0.0007444992,0.026083132],"study_design_scores_gemma":[0.00042979344,0.00010117993,0.0000040706013,0.000019139314,0.0000162219,0.00002770999,0.0009946256,0.3885039,0.005422977,0.5947526,0.00940147,0.00032630467],"about_ca_topic_score_codex":0.00000563098,"about_ca_topic_score_gemma":8.046586e-7,"teacher_disagreement_score":0.38615844,"about_ca_system_score_codex":0.000035377336,"about_ca_system_score_gemma":0.00011083609,"threshold_uncertainty_score":0.9999629},"labels":[],"label_agreement":null},{"id":"W3027395381","doi":"10.1137/20m1364485","title":"A Rational Even-IRA Algorithm for the Solution of $T$-Even Polynomial Eigenvalue Problems","year":2021,"lang":"en","type":"preprint","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University","keywords":"Krylov subspace; Matrix polynomial; Eigenvalues and eigenvectors; Arnoldi iteration; Mathematics; Polynomial; Linearization; Generalized minimal residual method; Block (permutation group theory); Divide-and-conquer eigenvalue algorithm; Applied mathematics; Skew; Algorithm; Iterative method; Computer science; Combinatorics; Mathematical analysis; Nonlinear system","score_opus":0.01656604732290797,"score_gpt":0.28514096886321605,"score_spread":0.2685749215403081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027395381","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000614286,0.002641843,0.99373126,0.0019025587,0.00017677444,0.0007066875,0.00014256807,0.000023980996,0.000060050043],"genre_scores_gemma":[0.38804612,0.0049752737,0.59801906,0.0003906318,0.003969251,0.0019167364,0.00050577224,0.000066159,0.0021110012],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780715,0.00018997522,0.0007684323,0.00052352704,0.0004616017,0.00024934692],"domain_scores_gemma":[0.99737334,0.00041834227,0.00090069673,0.00073665025,0.00043893312,0.0001320301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014291742,0.000256548,0.0005297162,0.00038952008,0.00072968437,0.0005431767,0.0009917113,0.00017287713,0.000045457873],"category_scores_gemma":[0.000024689401,0.00018908233,0.0007911691,0.0009099514,0.00009013318,0.00016211992,0.0003827902,0.00055579614,0.0000037389414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035811772,0.0009225326,0.00016118321,0.0002658272,0.0070339763,0.0000058728033,0.0009877683,0.15654694,0.0013113423,0.11136753,0.0018293797,0.71953183],"study_design_scores_gemma":[0.00055511564,0.00010329571,0.00082193146,0.00008047606,0.0019092085,0.000056892324,0.0001517175,0.95700276,0.0005295706,0.02695206,0.011412476,0.00042451313],"about_ca_topic_score_codex":0.000024803261,"about_ca_topic_score_gemma":0.00000909081,"teacher_disagreement_score":0.8004558,"about_ca_system_score_codex":0.00006486028,"about_ca_system_score_gemma":0.00034616713,"threshold_uncertainty_score":0.77105534},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003938756,0.00074896036,0.9848738,0.00439658,0.0035745504,0.0018771099,0.00010922674,0.00036000385,0.00012106026],"genre_scores_gemma":[0.99419224,0.0000013847282,0.0004777558,0.0030431119,0.0015903356,0.00043492086,0.000007101465,0.00003930538,0.00021384077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969202,0.00044264173,0.0006927186,0.00076719146,0.00045170885,0.0007255355],"domain_scores_gemma":[0.99787956,0.0006744982,0.00032836632,0.000609493,0.00014158661,0.0003664904],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083335256,0.0003826474,0.0006654235,0.00010315121,0.00021928937,0.000641586,0.0012544949,0.00012283675,0.000004286649],"category_scores_gemma":[0.0000758575,0.00034254763,0.00021362615,0.00031980098,0.000059070288,0.00046589813,0.00004587958,0.00021824134,0.00010024066],"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.00018664636,0.000043338838,0.000014649681,0.0006438382,0.0003112082,0.00015242348,0.0005572491,0.91514385,0.016179983,0.03821864,0.027002642,0.0015455559],"study_design_scores_gemma":[0.0023959903,0.0002318807,0.000004737802,0.000091716916,0.00004462567,0.000053930085,0.00010944034,0.9916776,0.000036691334,0.00008544708,0.0048083053,0.0004596798],"about_ca_topic_score_codex":0.00012314967,"about_ca_topic_score_gemma":0.0000021675291,"teacher_disagreement_score":0.9902535,"about_ca_system_score_codex":0.00010269606,"about_ca_system_score_gemma":0.00009675408,"threshold_uncertainty_score":0.99990267},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06602283,0.000048845202,0.9296907,0.001242098,0.0015851571,0.00049946504,0.00001597376,0.00025462382,0.0006402813],"genre_scores_gemma":[0.36456215,0.0000122101,0.6351069,0.00014605555,0.00010944585,0.00003100979,0.000005186663,0.000016289205,0.000010734604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613816,0.00014193985,0.0009357592,0.0012319535,0.00093011715,0.0006221014],"domain_scores_gemma":[0.9962113,0.0006489373,0.0004007828,0.0024069084,0.00010106848,0.00023099876],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001596659,0.00044627485,0.00072105066,0.0009109569,0.0002314187,0.0010369144,0.008086772,0.000205809,0.000016263511],"category_scores_gemma":[0.0001451574,0.0004351247,0.00015057591,0.0020209143,0.00030657355,0.00079397287,0.0086778905,0.0012466651,0.000056364006],"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.000008964436,0.0019757957,0.0039349715,0.0014157164,0.000040764033,0.00047562362,0.021039797,0.08633749,0.00064991997,0.8650745,0.00069493137,0.018351533],"study_design_scores_gemma":[0.0001603523,0.00002728109,0.0010509435,0.00025905072,0.0000029856053,0.000013488913,0.000021914246,0.58503854,0.0005513753,0.41254166,0.000025861138,0.00030650766],"about_ca_topic_score_codex":0.00006757839,"about_ca_topic_score_gemma":0.000044694134,"teacher_disagreement_score":0.49870107,"about_ca_system_score_codex":0.00036341997,"about_ca_system_score_gemma":0.00039862437,"threshold_uncertainty_score":0.99989897},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46960407,0.000008907051,0.52570516,0.0004239281,0.0002380558,0.00035232538,0.000016528824,0.00004572783,0.0036052754],"genre_scores_gemma":[0.9699344,2.0066568e-7,0.029446622,0.00007518087,0.000041620126,0.000008814149,2.6677046e-7,0.000006204284,0.00048670752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911267,0.00006880992,0.00031538622,0.00014563272,0.00026526037,0.00009221745],"domain_scores_gemma":[0.9989943,0.00022264429,0.00024280096,0.0004242855,0.000074803604,0.000041170995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022608864,0.00008775065,0.00017923425,0.000028113465,0.000080992795,0.000019702407,0.00060329254,0.00003133664,0.00019023784],"category_scores_gemma":[0.000113147784,0.000059731752,0.0000759035,0.00033729954,0.00003521807,0.00011644294,0.00025720807,0.00012540515,0.00002474627],"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.000077977274,0.011808616,0.0035256294,0.0018108708,0.0010608844,0.000031626452,0.22276951,0.0039986162,0.028263178,0.7077485,0.0047039078,0.014200723],"study_design_scores_gemma":[0.005526337,0.0017782142,0.02059283,0.00022728462,0.00027939441,0.00011158919,0.019328585,0.7280904,0.039194692,0.18013094,0.0037461384,0.0009935979],"about_ca_topic_score_codex":0.0000037175407,"about_ca_topic_score_gemma":0.0000044609556,"teacher_disagreement_score":0.72409177,"about_ca_system_score_codex":0.0000070004717,"about_ca_system_score_gemma":0.000038341233,"threshold_uncertainty_score":0.24357902},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19905241,0.000054084536,0.78530145,0.0040116287,0.00089059485,0.00072116504,0.00009407737,0.00017849766,0.009696127],"genre_scores_gemma":[0.9583315,0.000016347,0.03864439,0.0006407879,0.00013354028,0.000017262824,0.00015281755,0.00001914233,0.0020442072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972493,0.00012238747,0.0005174713,0.000580246,0.0012282637,0.00030233976],"domain_scores_gemma":[0.99804646,0.0004859925,0.00045454752,0.0004909086,0.00045330072,0.00006879694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008029594,0.00024834953,0.00034311376,0.00017221899,0.00014899037,0.00013058903,0.0010062006,0.00012529595,0.00018135956],"category_scores_gemma":[0.000017607443,0.00021588017,0.0004925621,0.0010506504,0.00008765542,0.00023871777,0.0004581905,0.00029304178,0.00021973343],"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.000023380604,0.00020181324,0.00026185863,0.00001415791,0.0009182129,5.907026e-7,0.0004650208,0.6446283,0.10561933,0.24675676,0.00057785475,0.00053276174],"study_design_scores_gemma":[0.00048632317,0.00009347026,0.0017347875,0.000010619745,0.00015320265,0.000008443787,0.000018262279,0.9785524,0.0074243504,0.01097939,0.0002921535,0.00024657743],"about_ca_topic_score_codex":0.000022093329,"about_ca_topic_score_gemma":0.0000023300245,"teacher_disagreement_score":0.75927913,"about_ca_system_score_codex":0.00017625267,"about_ca_system_score_gemma":0.00020154998,"threshold_uncertainty_score":0.8803338},"labels":[],"label_agreement":null},{"id":"W3036170074","doi":"10.1007/s11075-021-01108-7","title":"A simple extrapolation method for clustered eigenvalues","year":2021,"lang":"en","type":"preprint","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Directorate for Mathematical and Physical Sciences; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Extrapolation; Eigenvalues and eigenvectors; Simple (philosophy); Convergence (economics); Power iteration; Mathematics; Applied mathematics; Inverse iteration; Mathematical optimization; Mathematical analysis; Iterative method; Physics","score_opus":0.034278272300960505,"score_gpt":0.3303777501401693,"score_spread":0.29609947783920876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036170074","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011259146,0.00075757276,0.9946634,0.0007628098,0.001898855,0.00084560196,0.000083037594,0.0004678581,0.0004082793],"genre_scores_gemma":[0.009074679,0.00003939975,0.9882261,0.0005962812,0.00093811745,0.00035667454,0.0002744549,0.000052830244,0.00044142827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597013,0.0006290824,0.0007048662,0.0014890814,0.0005463997,0.00066042633],"domain_scores_gemma":[0.99685365,0.00080258714,0.00037826528,0.0013672217,0.00032267597,0.00027557078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013599474,0.0005280823,0.0008222667,0.00016493745,0.00026356525,0.0007155771,0.0016991398,0.00049161044,0.00011257792],"category_scores_gemma":[0.00025135794,0.00051075773,0.0006234777,0.00047630418,0.000046077188,0.00036097798,0.0016917372,0.0006901638,0.000023503891],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029934148,0.00031242057,0.00001855469,0.00030682102,0.00021543574,0.000045373796,0.0011902621,0.0046835584,0.00028748333,0.018192647,0.0010577556,0.97365975],"study_design_scores_gemma":[0.00040650906,0.00009732802,0.00008759735,0.000048231705,0.00004745004,0.00002617008,0.000052681135,0.8954176,0.0016426159,0.09185169,0.009722607,0.000599544],"about_ca_topic_score_codex":0.000107823995,"about_ca_topic_score_gemma":0.000002116615,"teacher_disagreement_score":0.9730602,"about_ca_system_score_codex":0.00011858774,"about_ca_system_score_gemma":0.00033402868,"threshold_uncertainty_score":0.9997344},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14748994,0.00035415794,0.010902399,0.00088431087,0.09155654,0.006964988,0.00059180404,0.0021574842,0.73909837],"genre_scores_gemma":[0.60258436,0.00027611977,0.0057394924,0.000047914047,0.027247852,0.0000032368512,0.0012694611,0.00023301262,0.36259854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99236786,0.0025595187,0.00035642876,0.0018565978,0.0018054463,0.0010541287],"domain_scores_gemma":[0.9954003,0.00089220534,0.00040446845,0.0012517866,0.0012533731,0.00079784665],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0007368658,0.0006801801,0.00094693917,0.0015801728,0.0022021895,0.00049451814,0.0048688697,0.0009827752,0.00012445662],"category_scores_gemma":[0.00032703273,0.0008088072,0.00049738126,0.0035058232,0.00044213512,0.001342959,0.001237483,0.0027025284,0.00012706144],"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.015386655,0.00050736073,0.00005490025,0.00097107724,0.0014405692,0.037224747,0.006916578,0.00012142338,0.052620288,0.84328526,0.025669634,0.015801484],"study_design_scores_gemma":[0.009653254,0.0022849566,0.00015946366,0.0005190078,0.00050510437,0.00012227184,0.006831011,0.002117297,0.08907109,0.0078055263,0.878182,0.0027490417],"about_ca_topic_score_codex":0.000459566,"about_ca_topic_score_gemma":0.00027916968,"teacher_disagreement_score":0.85251236,"about_ca_system_score_codex":0.0013295959,"about_ca_system_score_gemma":0.0021946938,"threshold_uncertainty_score":0.99959826},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030744916,0.000020023668,0.99471134,0.0013769527,0.00010170011,0.00011526391,0.00034549282,0.000013144461,0.0002415654],"genre_scores_gemma":[0.75840145,0.000028830265,0.24135001,0.00012060129,0.000016741731,0.000006638856,0.00003132392,0.0000034593152,0.000040974137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998967,0.00008620006,0.0003849834,0.00027944695,0.00016315874,0.000119199416],"domain_scores_gemma":[0.9987391,0.00062852213,0.00019434796,0.00013661076,0.00021607275,0.00008533469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002861764,0.000110757945,0.0002803839,0.00020072579,0.000042504096,0.00008187929,0.00034143782,0.00003552119,0.000089856796],"category_scores_gemma":[0.00026940968,0.000100731566,0.000057811798,0.0003184533,0.00014932646,0.00007708731,0.00006516626,0.00006773847,0.0000015038612],"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.00009701211,0.00006216561,0.000044904507,0.0000248288,0.00015325691,0.0000011642687,0.00047832148,0.00031084937,0.0028692312,0.91505015,0.000015878772,0.08089225],"study_design_scores_gemma":[0.00004449851,0.00023859327,0.00013044689,0.000014027336,0.00007343678,2.879266e-7,0.000106556974,0.7719403,0.027948296,0.19928688,0.00013465482,0.00008202227],"about_ca_topic_score_codex":0.000025510815,"about_ca_topic_score_gemma":0.000020412093,"teacher_disagreement_score":0.77162945,"about_ca_system_score_codex":0.0000073815313,"about_ca_system_score_gemma":0.000049248265,"threshold_uncertainty_score":0.4107714},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072134314,0.00006165741,0.98521596,0.0030851061,0.00018757001,0.000040205345,0.0000010769337,0.000029503584,0.0041655013],"genre_scores_gemma":[0.7953042,0.000010458472,0.2016795,0.0018183521,0.0009158598,0.0000013800186,3.217769e-7,0.00001645778,0.00025350042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990205,0.0000611652,0.0003419283,0.00009648873,0.00034329924,0.00013661644],"domain_scores_gemma":[0.99915564,0.0001855893,0.00016496086,0.00016844178,0.0001271191,0.00019822663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027139642,0.0000916038,0.0002487651,0.000041136373,0.000051425755,0.00008163711,0.0005224936,0.000029565756,0.00012859491],"category_scores_gemma":[0.00019880445,0.000066159846,0.0002001568,0.0005532428,0.000027893606,0.00040722053,0.000090353584,0.00020558767,0.00021458701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013483047,0.00022402777,0.000005700941,0.000037552836,0.000060080827,0.000036361227,0.0009250612,0.00018175977,0.0010291943,0.9822387,0.00655556,0.00869253],"study_design_scores_gemma":[0.0010762732,0.0005562956,0.00002650398,0.000040715597,0.000056711066,0.00015314888,0.00015640697,0.06467408,0.0033124075,0.92147464,0.008207752,0.0002650509],"about_ca_topic_score_codex":6.903237e-8,"about_ca_topic_score_gemma":2.9347147e-9,"teacher_disagreement_score":0.78809077,"about_ca_system_score_codex":0.000013313418,"about_ca_system_score_gemma":0.000043567867,"threshold_uncertainty_score":0.27581534},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005502127,0.00035897375,0.98485273,0.013565805,0.000003453821,0.000059415925,3.9475827e-7,0.000010417175,0.00059861614],"genre_scores_gemma":[0.9260106,0.0008032246,0.071257465,0.001207565,0.00043918137,0.000019351442,7.843262e-7,0.000007359927,0.0002544395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924713,0.00005190395,0.00036414416,0.00009408191,0.00016673704,0.000075980686],"domain_scores_gemma":[0.9989868,0.0003236243,0.00025256665,0.00020384429,0.000104400846,0.00012878592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004203265,0.000055667962,0.00020100886,0.00004673915,0.00017372532,0.00014700144,0.00044836613,0.000018668952,0.000011214934],"category_scores_gemma":[0.00008401412,0.000029776933,0.00016869768,0.0008852632,0.00004447324,0.000110157955,0.000066734945,0.000104117724,0.0000135484615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002597593,0.0000329243,0.000036401652,0.000015723233,0.00019018364,0.0000026392916,0.000130654,0.000019900688,0.000053145115,0.96062726,0.00038385423,0.038504746],"study_design_scores_gemma":[0.00025852505,0.00011080134,0.0004663407,0.000026447418,0.0009623994,0.00011388264,0.00018569718,0.18260346,0.00030437802,0.73702234,0.07776159,0.00018415583],"about_ca_topic_score_codex":1.0828875e-7,"about_ca_topic_score_gemma":7.2160745e-8,"teacher_disagreement_score":0.9254604,"about_ca_system_score_codex":0.000003938445,"about_ca_system_score_gemma":0.00001085708,"threshold_uncertainty_score":0.14175382},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0121567175,0.000091115966,0.9612873,0.0011276341,0.0051690815,0.0016365703,0.00007419637,0.00010262834,0.018354751],"genre_scores_gemma":[0.979073,0.00011239369,0.018138561,0.00008337169,0.00033735074,0.000047254263,0.0000758347,0.00002804267,0.0021042123],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9968259,0.00039866156,0.0011961426,0.00049255753,0.0009196384,0.00016715548],"domain_scores_gemma":[0.9969642,0.0004679129,0.0011914474,0.00085230137,0.0004730102,0.000051087103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010321203,0.00023481161,0.0005603157,0.00017010637,0.000040298582,0.00009416211,0.00066172465,0.00021637151,0.00004411711],"category_scores_gemma":[0.00078370044,0.0001558569,0.00025695335,0.0004933823,0.00007425791,0.0014437044,0.00027070922,0.00035118015,0.000003606632],"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.001973852,0.0046371683,0.0107880505,0.004079849,0.0019684522,0.006086385,0.08950857,0.010788735,0.009507234,0.14841956,0.23495008,0.47729206],"study_design_scores_gemma":[0.009342167,0.0046024555,0.03634313,0.009316534,0.0006506376,0.0019910908,0.002468096,0.23039062,0.3312934,0.09351571,0.27339467,0.006691459],"about_ca_topic_score_codex":0.00020323909,"about_ca_topic_score_gemma":0.00013516632,"teacher_disagreement_score":0.96691626,"about_ca_system_score_codex":0.00007111762,"about_ca_system_score_gemma":0.00077153917,"threshold_uncertainty_score":0.635566},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3693114,0.00056214794,0.60369855,0.0052362774,0.0017374692,0.0014023433,0.00005163567,0.00030487796,0.017695297],"genre_scores_gemma":[0.99797964,0.0006345281,0.0004935505,0.0001789231,0.000056398738,8.0763397e-7,0.000003306414,0.000007104358,0.00064573425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984722,0.00042386516,0.00020173579,0.0005311466,0.0001134659,0.0002575841],"domain_scores_gemma":[0.99815524,0.00040084438,0.00022504767,0.0011001872,0.000049198596,0.00006950664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006312825,0.00019646197,0.0002241842,0.00014447795,0.00015701758,0.000097585355,0.0033821028,0.00014347662,0.000011765339],"category_scores_gemma":[0.00004684367,0.00014022648,0.00018421325,0.00097515003,0.0001491374,0.00015805467,0.00168092,0.00065543293,0.000040065795],"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.000050944924,0.000103963146,0.0016304272,0.00009568434,0.000061619954,0.0005629273,0.0013210501,0.016934242,0.00003049429,0.9763876,0.0024416551,0.00037935813],"study_design_scores_gemma":[0.0007439675,0.00006136482,0.0013685541,0.00008278645,0.000055866785,0.000010628179,0.0007854954,0.5279043,0.00015841068,0.46326497,0.005184199,0.0003794673],"about_ca_topic_score_codex":0.00007862963,"about_ca_topic_score_gemma":0.000075205484,"teacher_disagreement_score":0.62866825,"about_ca_system_score_codex":0.000036382084,"about_ca_system_score_gemma":0.00012930628,"threshold_uncertainty_score":0.6284845},"labels":[],"label_agreement":null},{"id":"W3047080367","doi":"10.1137/19m1290991","title":"BiLQ: An Iterative Method for Nonsymmetric Linear Systems with a Quasi-Minimum Error Property","year":2020,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lanczos resampling; Mathematics; Residual; Applied mathematics; Tridiagonal matrix; Lanczos algorithm; Linear system; Monotonic function; Norm (philosophy); Eigenvalues and eigenvectors; Mathematical optimization; Mathematical analysis; Algorithm","score_opus":0.027447030609016324,"score_gpt":0.324059853564332,"score_spread":0.29661282295531566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047080367","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069049903,0.00025136975,0.99570847,0.0025431649,0.000018089566,0.0005512249,0.000034966906,0.00005742458,0.00014477239],"genre_scores_gemma":[0.39353436,0.00009924828,0.6030144,0.00082491926,0.00094565394,0.0004284604,0.0000282517,0.000031218347,0.0010934785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983449,0.00023866448,0.000417155,0.00048977684,0.0002792584,0.0002302684],"domain_scores_gemma":[0.9983839,0.0002501376,0.00033156725,0.00036742736,0.00028461532,0.00038235646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008067212,0.00019689169,0.0004354041,0.00044257,0.0005386605,0.0005244629,0.0005448784,0.000056000263,0.000010684769],"category_scores_gemma":[0.000033961307,0.0001110006,0.00019411164,0.003021003,0.000033521497,0.00036323504,0.000049283753,0.0002363708,0.000012930032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005918288,0.0023678248,0.0012120121,0.00041817903,0.0053747357,0.000059455,0.004777213,0.07624877,0.0022066233,0.6807339,0.001507637,0.2245018],"study_design_scores_gemma":[0.00049627904,0.0009052787,0.00005765232,0.000013229304,0.0004703382,0.00005172504,0.0003023289,0.9711969,0.00015078312,0.0010052626,0.025111029,0.00023921735],"about_ca_topic_score_codex":0.000008765438,"about_ca_topic_score_gemma":0.0000022303566,"teacher_disagreement_score":0.8949481,"about_ca_system_score_codex":0.000022276598,"about_ca_system_score_gemma":0.00007696867,"threshold_uncertainty_score":0.5057408},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30224118,0.002198511,0.6905019,0.002251055,0.00079625,0.000088095636,0.0000014317254,0.00007351726,0.0018480286],"genre_scores_gemma":[0.98140335,0.00015498984,0.016275484,0.00062586385,0.0010772181,7.8325735e-7,8.911325e-7,0.0000170274,0.00044440807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825674,0.00013413557,0.00043315376,0.00016945343,0.00044188325,0.0005646144],"domain_scores_gemma":[0.9989623,0.00005844898,0.00029126968,0.0003162215,0.00016128113,0.00021052216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014079368,0.0001492365,0.00025065898,0.00014818706,0.000051926803,0.000079447236,0.001111081,0.00005527043,0.000042512474],"category_scores_gemma":[0.00006229774,0.00012152396,0.00015734324,0.00026255744,0.00002519479,0.0006465676,0.0000939997,0.00065858616,0.00008170187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013139134,0.00036032897,0.0009233268,0.00001974201,0.00023213396,0.00063324766,0.0013079818,0.00029932207,0.00064993236,0.9714931,0.002943492,0.021005992],"study_design_scores_gemma":[0.004013466,0.004189026,0.0008599335,0.00012309305,0.000076374636,0.0059438255,0.00022462383,0.017695803,0.026995426,0.88578504,0.05322527,0.0008681373],"about_ca_topic_score_codex":0.0000040311324,"about_ca_topic_score_gemma":0.000003453373,"teacher_disagreement_score":0.67916214,"about_ca_system_score_codex":0.00011604865,"about_ca_system_score_gemma":0.0008608997,"threshold_uncertainty_score":0.49556032},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062967616,0.000032689455,0.93969136,0.048124187,0.00007515605,0.0003130173,0.000022427406,0.00010351021,0.011007996],"genre_scores_gemma":[0.3705171,0.0000026879895,0.6055447,0.01909065,0.00080797554,0.00021740927,0.000021052158,0.000048685735,0.0037497408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901026,0.00004214579,0.00021680024,0.00026948066,0.00014082891,0.0003204669],"domain_scores_gemma":[0.99874616,0.00035521458,0.000042078078,0.00021446327,0.000057258934,0.0005848515],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003125835,0.0001091595,0.00015201687,0.000047344707,0.0001605981,0.00013423059,0.0005721648,0.000052468396,0.0028831235],"category_scores_gemma":[0.00080119516,0.00010152199,0.00007347688,0.00014623627,0.000032419473,0.000048934136,0.00005373127,0.000077121615,0.003638758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017464092,0.000009260761,0.0000034676723,0.000055541823,0.000010113102,0.0000069021944,0.00029372607,0.000038603812,0.00001192227,0.99218607,0.0066437735,0.00073890033],"study_design_scores_gemma":[0.00025095264,0.00008038823,0.00003860229,0.0000198141,0.000010858238,0.000017614944,0.000023351016,0.17406107,0.00017452899,0.48050505,0.34458148,0.00023628322],"about_ca_topic_score_codex":0.000029799676,"about_ca_topic_score_gemma":0.000024110546,"teacher_disagreement_score":0.511681,"about_ca_system_score_codex":0.00004969955,"about_ca_system_score_gemma":0.00024527905,"threshold_uncertainty_score":0.9980284},"labels":[],"label_agreement":null},{"id":"W3083409701","doi":"10.1137/20m1365326","title":"A Multiprecision Derivative-Free Schur--Parlett Algorithm for Computing Matrix Functions","year":2021,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Engineering and Physical Sciences Research Council; Royal Society","keywords":"Schur decomposition; Mathematics; Algebra over a field; Matrix (chemical analysis); Matrix function; Schur product theorem; Schur's theorem; Decomposition; Algorithm; Schur complement; Pure mathematics; Symmetric matrix; Eigenvalues and eigenvectors","score_opus":0.012377535516921378,"score_gpt":0.294455632274379,"score_spread":0.2820780967574576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083409701","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012020943,0.00088838197,0.9954353,0.0016934844,0.000113563634,0.000262011,0.00009888017,0.00008260498,0.00022365357],"genre_scores_gemma":[0.044313036,0.00039486494,0.95163685,0.00038667716,0.0009464692,0.00010992606,0.00013654945,0.000027934406,0.002047706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979822,0.00016065591,0.00059018057,0.00056977605,0.0003570453,0.00034011368],"domain_scores_gemma":[0.99745727,0.0006427314,0.00035897802,0.0008057098,0.00047880018,0.0002564906],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008325085,0.00022665237,0.00042309827,0.00048663974,0.0013227607,0.00068611844,0.00071854034,0.00009034459,0.00007592186],"category_scores_gemma":[0.00010351437,0.00019941007,0.00047650703,0.0023475057,0.00005360443,0.00033235046,0.00026818548,0.0003339223,0.000028154413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001574105,0.0004808613,0.00025561755,0.000028891816,0.0011858899,0.000024877589,0.00019766281,0.007215196,0.001524116,0.18775181,0.0017144232,0.7996049],"study_design_scores_gemma":[0.0017257127,0.00015398802,0.00097654224,0.000048616686,0.0008499829,0.0002594492,0.0003921672,0.80920744,0.001363266,0.06104666,0.12338016,0.0005960328],"about_ca_topic_score_codex":0.000005331716,"about_ca_topic_score_gemma":0.0000052860337,"teacher_disagreement_score":0.80199224,"about_ca_system_score_codex":0.00005032127,"about_ca_system_score_gemma":0.000095969,"threshold_uncertainty_score":0.9999774},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55398387,0.00009839898,0.43806162,0.0028442864,0.00021987644,0.00031629213,0.000006027209,0.000019298684,0.004450311],"genre_scores_gemma":[0.93180335,0.000037741676,0.06781174,0.00003483814,0.00016650542,0.0000014770318,1.5035813e-7,0.000008356958,0.0001358615],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99779004,0.00022936953,0.00056723296,0.00012338847,0.0010811929,0.00020879958],"domain_scores_gemma":[0.998113,0.0008623946,0.00022839606,0.0002804488,0.00036340443,0.00015240755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002581644,0.000072181356,0.00029124995,0.00021133263,0.00006823819,0.00009001541,0.00091683504,0.000042641408,0.000032318858],"category_scores_gemma":[0.0008819462,0.000054743126,0.000111301575,0.0004887024,0.00006042883,0.00031406997,0.000209677,0.00034798105,0.000025546256],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082891167,0.0032578597,0.0007136834,0.002242931,0.0003333598,0.0015281915,0.04546688,0.0020165348,0.4182619,0.23025578,0.01683724,0.27825674],"study_design_scores_gemma":[0.0009769314,0.0024420756,0.00033312387,0.00045554558,0.000020239322,0.00029942923,0.0013400122,0.17045486,0.7679518,0.054444794,0.0010405913,0.00024063261],"about_ca_topic_score_codex":0.0000022493964,"about_ca_topic_score_gemma":2.390668e-7,"teacher_disagreement_score":0.37781945,"about_ca_system_score_codex":0.000033517324,"about_ca_system_score_gemma":0.000121213496,"threshold_uncertainty_score":0.223236},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27330944,0.000024633553,0.7237095,0.0012293136,0.0008428632,0.0005503063,0.000063279054,0.00011455293,0.00015606925],"genre_scores_gemma":[0.9957857,0.000009165724,0.003597961,0.0001989986,0.000060310922,0.0000012390063,0.000013144717,0.000008338994,0.00032514532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989376,0.00015087955,0.0001486291,0.0005502648,0.00006524405,0.0001473502],"domain_scores_gemma":[0.9985302,0.00018057808,0.00027107119,0.00081910245,0.000111831796,0.000087191416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015055177,0.00016988674,0.00022511678,0.00006459301,0.00014817917,0.00003368667,0.0014391893,0.00017081789,0.000008752392],"category_scores_gemma":[0.000058436737,0.00014468402,0.0001939465,0.00042327266,0.0001273706,0.00012017277,0.0012586697,0.00029410748,0.0000062733898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014147851,0.000010384326,0.0002326225,0.000097584336,0.000045761095,0.000008570785,0.00034527254,0.026614178,0.0004291254,0.9716895,0.000413961,0.00009885168],"study_design_scores_gemma":[0.00038715353,0.000050604594,0.00059731,0.00007845553,0.00007004026,0.0000011665512,0.000032410906,0.18927035,0.0069442354,0.8021171,0.00024287669,0.00020829302],"about_ca_topic_score_codex":0.000037675774,"about_ca_topic_score_gemma":0.000005752882,"teacher_disagreement_score":0.72247624,"about_ca_system_score_codex":0.00004248904,"about_ca_system_score_gemma":0.00018688133,"threshold_uncertainty_score":0.59000427},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13000391,0.0002833966,0.8550032,0.009626742,0.00050615764,0.00029239175,0.000008719494,0.00034217743,0.0039333045],"genre_scores_gemma":[0.96576697,0.000022718794,0.032255027,0.0012245273,0.00038594683,0.000008589977,0.0000014402532,0.000024253943,0.00031053164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811226,0.00018460902,0.00032283485,0.00044314534,0.00047742995,0.00045974608],"domain_scores_gemma":[0.99859804,0.00010808142,0.00025508765,0.00032033058,0.00014028081,0.00057816895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041823025,0.00025575477,0.0002773781,0.00008227447,0.00037315235,0.0005309714,0.0013367594,0.000059564587,0.00021301286],"category_scores_gemma":[0.00007657168,0.00019388084,0.00012309605,0.00041185538,0.00009324685,0.00072750857,0.00020326256,0.0005951705,0.0003037223],"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.0015737513,0.0015493361,0.044371516,0.00040989876,0.002377918,0.008784367,0.05903727,0.008747749,0.019147765,0.4545196,0.04895271,0.35052812],"study_design_scores_gemma":[0.03420668,0.010912937,0.054771584,0.00125428,0.0006026012,0.023785554,0.00853725,0.28271475,0.19909395,0.11264556,0.2605943,0.010880547],"about_ca_topic_score_codex":0.0000039105857,"about_ca_topic_score_gemma":0.0000014872925,"teacher_disagreement_score":0.83576304,"about_ca_system_score_codex":0.000050117033,"about_ca_system_score_gemma":0.00011633176,"threshold_uncertainty_score":0.7906231},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7686076,0.00012762492,0.21585074,0.013504501,0.00008616445,0.0002815638,0.0000149838925,0.000037186568,0.0014896168],"genre_scores_gemma":[0.9949959,0.000020609057,0.003543811,0.0009582822,0.0004391281,0.0000039159363,2.800922e-7,0.000022329217,0.000015772954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972393,0.00045377348,0.0007768523,0.00026881232,0.00088927965,0.00037200656],"domain_scores_gemma":[0.9966098,0.0020697587,0.0003427906,0.0005161271,0.00019184523,0.00026964847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012208695,0.00030191414,0.00061610056,0.000041565796,0.00023136218,0.00022358168,0.0013459105,0.00011337237,0.00008720021],"category_scores_gemma":[0.0008141914,0.00015195213,0.00045199436,0.00040818242,0.0011847398,0.00025522895,0.0005133028,0.00077166,0.000032863703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062728606,0.00024676172,0.0000035454436,0.0001335991,0.00008109632,0.000020026018,0.0029876328,0.0005989388,0.0006220373,0.9920578,0.00022340653,0.00296245],"study_design_scores_gemma":[0.0003444487,0.00031115705,0.0000034713141,0.00020278714,0.000065960565,0.00010448335,0.0003151628,0.21640193,0.015323475,0.76673347,0.000051296338,0.0001423294],"about_ca_topic_score_codex":1.7029346e-7,"about_ca_topic_score_gemma":7.847453e-9,"teacher_disagreement_score":0.22638825,"about_ca_system_score_codex":0.00001833311,"about_ca_system_score_gemma":0.00009420136,"threshold_uncertainty_score":0.6196428},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003489647,0.00018462531,0.9796136,0.012802073,0.0014574947,0.0004598759,0.00004488598,0.00024888993,0.0016988828],"genre_scores_gemma":[0.9355894,0.000028203387,0.061145566,0.00023421792,0.00025499976,0.00006799803,0.000023429022,0.000017308932,0.0026389104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798936,0.00039916122,0.00047407555,0.00051024253,0.00037689038,0.00025026055],"domain_scores_gemma":[0.9980404,0.00013192258,0.00032819735,0.0012750105,0.0001376321,0.00008687476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041409078,0.00022652741,0.00030123183,0.000101093545,0.00022769216,0.00015023706,0.0022716254,0.00016230515,0.00011272839],"category_scores_gemma":[0.00013349057,0.0001575748,0.0003344888,0.0003892985,0.00008605586,0.00013165423,0.0031299978,0.00039781714,0.0000637469],"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.0000052780883,0.000055731445,0.0000065439935,0.00008415731,0.000050086164,0.000001227368,0.00058915105,0.004308884,0.007232529,0.98361075,0.00123026,0.0028254183],"study_design_scores_gemma":[0.00035564892,0.000040477094,0.00017879931,0.00012627488,0.00005569634,0.0000058351025,0.000045566812,0.5786183,0.023676604,0.3953014,0.0011772965,0.00041813598],"about_ca_topic_score_codex":0.00021744806,"about_ca_topic_score_gemma":0.000013172846,"teacher_disagreement_score":0.9320997,"about_ca_system_score_codex":0.000039047158,"about_ca_system_score_gemma":0.0002977684,"threshold_uncertainty_score":0.6425714},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10268014,0.01689872,0.84113413,0.034426257,0.0017804039,0.0019310365,0.00007198353,0.000032241296,0.0010450556],"genre_scores_gemma":[0.986546,0.0008421547,0.012198509,0.00015759318,0.00014706772,0.000012059223,0.000001065225,0.000008198993,0.00008738314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988814,0.00033570518,0.0003469535,0.00009187387,0.00022313136,0.000120960816],"domain_scores_gemma":[0.9960496,0.0018846067,0.0005284855,0.0013539107,0.0001485445,0.000034855035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013212429,0.00010051528,0.00021689397,0.000033282686,0.00041270422,0.00012224684,0.0024922478,0.000033893455,0.0000023957207],"category_scores_gemma":[0.00004959451,0.00004829958,0.00018720378,0.0002374491,0.00044353498,0.0003312647,0.00093039806,0.0003320786,0.0000014009773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040715408,0.00009058195,0.0003178985,0.000023854755,0.00009192203,1.07049715e-7,0.0012570276,0.00002840221,0.000310967,0.98447686,0.00020892771,0.013152709],"study_design_scores_gemma":[0.0070507126,0.0002852732,0.008356814,0.00021379197,0.00038812566,0.00016523857,0.001593643,0.1329895,0.0008660872,0.83698946,0.010776843,0.00032449327],"about_ca_topic_score_codex":0.0000125227025,"about_ca_topic_score_gemma":0.000003964239,"teacher_disagreement_score":0.88386583,"about_ca_system_score_codex":0.000012042658,"about_ca_system_score_gemma":0.000033233922,"threshold_uncertainty_score":0.4631258},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01507022,0.0010914383,0.9825305,0.000854426,0.00004568302,0.0001863184,0.000005558944,0.000015218135,0.0002006815],"genre_scores_gemma":[0.96117324,0.00017405888,0.038284358,0.000026577938,0.00023023484,0.000016562297,0.0000017224057,0.000007007467,0.00008626514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854445,0.0000798245,0.0008319075,0.00019090886,0.0002550915,0.00009780707],"domain_scores_gemma":[0.9982775,0.00010066264,0.0007689161,0.000382292,0.0003328119,0.0001378392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004949371,0.00013792848,0.00074212125,0.00019813245,0.00005003074,0.0001114811,0.0006957919,0.00008902919,0.000009392136],"category_scores_gemma":[0.000053731535,0.000091463415,0.0003221449,0.0006247158,0.0000703542,0.000079470934,0.00033236173,0.0003100445,0.000008397987],"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.000016754293,0.000502764,0.000066872984,0.0023222095,0.0028584218,0.000007448078,0.00074825156,0.012856544,0.001880692,0.976028,0.00008729308,0.00262471],"study_design_scores_gemma":[0.00019714718,0.00014012214,0.000117496005,0.00044467158,0.003012103,0.00006445164,0.00015760785,0.7414082,0.0023732395,0.25107896,0.0006902178,0.00031571573],"about_ca_topic_score_codex":0.000002798848,"about_ca_topic_score_gemma":1.8617807e-7,"teacher_disagreement_score":0.946103,"about_ca_system_score_codex":0.000011008586,"about_ca_system_score_gemma":0.000081543134,"threshold_uncertainty_score":0.372977},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017553838,0.00013551589,0.9766332,0.0047010174,0.000089271634,0.00040838245,8.443287e-7,0.0000045571446,0.0004733679],"genre_scores_gemma":[0.04677603,0.000018540473,0.9524471,0.0001075722,0.00010053274,0.000055554,4.5299777e-7,0.000008615233,0.0004855707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794436,0.0005061648,0.00044119658,0.00014413413,0.00071194954,0.00025218705],"domain_scores_gemma":[0.9950408,0.0037385796,0.00018219197,0.0004166737,0.00056583673,0.000055968358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012853823,0.00007603377,0.00017354431,0.00021587714,0.00021760428,0.0004729999,0.0009783555,0.000042779222,0.000004052166],"category_scores_gemma":[0.0021750014,0.0000404795,0.00010320061,0.00078346685,0.000033348537,0.0003143438,0.000200839,0.00041922848,0.0000050334215],"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.00018417761,0.0018234294,0.00003402744,0.0005841085,0.00018218045,0.00007878694,0.03441427,0.10499834,0.009623655,0.7093948,0.0044853715,0.13419682],"study_design_scores_gemma":[0.0003939042,0.00015634396,0.000046121997,0.00007061161,0.000009458995,0.00029445844,0.0015543376,0.93737,0.0082492195,0.050579086,0.0012081388,0.00006832253],"about_ca_topic_score_codex":0.000002457598,"about_ca_topic_score_gemma":0.0000024607168,"teacher_disagreement_score":0.83237165,"about_ca_system_score_codex":0.00006395896,"about_ca_system_score_gemma":0.00017821453,"threshold_uncertainty_score":0.45611492},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02998901,0.00024005427,0.9685788,0.00020641231,0.00003241707,0.0007051766,0.00012833097,0.000013150559,0.000106656444],"genre_scores_gemma":[0.89876294,0.000019194436,0.10067624,0.000007928899,0.000106671585,0.0003375468,0.000032388234,0.000010322379,0.000046775134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997073,0.00018587742,0.001560252,0.00039675654,0.00061420386,0.0001699333],"domain_scores_gemma":[0.99493426,0.0008918609,0.0014481293,0.0010120578,0.001481934,0.00023177624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007309237,0.00023262626,0.0010735339,0.00048639538,0.00013634676,0.00018954517,0.00081499707,0.00013406028,0.00026131418],"category_scores_gemma":[0.00011632001,0.00017698595,0.00040940696,0.001667972,0.00013806511,0.00015702298,0.00043344064,0.00032813317,0.0000026308726],"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.000029561645,0.0028618223,0.00018637124,0.0018758366,0.004355691,0.0000026926386,0.0019447961,0.016642893,0.006703967,0.9621691,0.000020737161,0.003206494],"study_design_scores_gemma":[0.0020272194,0.00072947895,0.0028005696,0.0013216785,0.017992882,0.00011085641,0.0034569295,0.82374114,0.016700016,0.12829205,0.0008364628,0.0019907495],"about_ca_topic_score_codex":0.000014430443,"about_ca_topic_score_gemma":0.000026036461,"teacher_disagreement_score":0.86877394,"about_ca_system_score_codex":0.000038142807,"about_ca_system_score_gemma":0.00027467805,"threshold_uncertainty_score":0.7217278},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058916725,0.1084788,0.61402696,0.05271963,0.04623315,0.030375823,0.028284127,0.0029448478,0.058019925],"genre_scores_gemma":[0.17872202,0.026455037,0.21350124,0.0066889026,0.01983287,0.0028896683,0.013938394,0.0009333753,0.5370385],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959197,0.00018555671,0.00085456023,0.0018664907,0.0005648942,0.0006087734],"domain_scores_gemma":[0.99672514,0.0002199713,0.0004828817,0.0014682071,0.00061446376,0.00048930646],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075662753,0.00065577775,0.0009373906,0.0002730711,0.00047477792,0.00033099172,0.0008059321,0.00048715892,0.00001804581],"category_scores_gemma":[0.00024188582,0.0006440611,0.00011087079,0.00085483305,0.00025393025,0.00042884334,0.001124764,0.0008059612,0.000034170484],"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.00026045842,0.0009210963,0.000074002026,0.0023708963,0.0006072512,0.00009094154,0.003245363,0.000014806739,0.0033140422,0.22858335,0.7245925,0.03592531],"study_design_scores_gemma":[0.0012478684,0.00042531805,0.0011475943,0.00046840886,0.00020920363,0.0003318924,0.00023026524,0.0083228955,0.0023602308,0.0034021074,0.98037326,0.0014809755],"about_ca_topic_score_codex":0.00009501924,"about_ca_topic_score_gemma":0.000033694676,"teacher_disagreement_score":0.47901857,"about_ca_system_score_codex":0.00003996051,"about_ca_system_score_gemma":0.00042613386,"threshold_uncertainty_score":0.99960107},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95783347,0.00007727081,0.026784424,0.00042947408,0.0006398973,0.0016529441,0.000107818334,0.00006194564,0.012412758],"genre_scores_gemma":[0.92674875,0.0009310017,0.07047529,0.000035699402,0.000061276296,0.00011020803,0.00001720792,0.000034916528,0.0015856376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752486,0.00041730545,0.00070455746,0.0006455811,0.00029622042,0.00041146742],"domain_scores_gemma":[0.9964685,0.0007528075,0.00042527722,0.0019877164,0.00028803648,0.000077652134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00250982,0.00022060546,0.00047694953,0.00038327413,0.00008980924,0.00014065766,0.0019884212,0.00035599718,0.000028642848],"category_scores_gemma":[0.00029548394,0.00017897172,0.00014864391,0.0002083649,0.0004545344,0.0003846324,0.0017526578,0.0016114571,0.0000022159734],"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.00011389183,0.000354852,0.0003305365,0.00081846456,0.0001855251,0.000007187146,0.0041429964,0.38018474,0.0016335563,0.07075847,0.000022484903,0.5414473],"study_design_scores_gemma":[0.00019893434,0.0000333301,0.00030546813,0.00008608245,0.0000037102882,0.00000546257,0.00007299926,0.9612694,0.00043540657,0.03656668,0.0008485847,0.00017393836],"about_ca_topic_score_codex":0.0000444476,"about_ca_topic_score_gemma":0.00011668504,"teacher_disagreement_score":0.58108467,"about_ca_system_score_codex":0.00012647377,"about_ca_system_score_gemma":0.00045478626,"threshold_uncertainty_score":0.7298255},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7865238,0.0001248717,0.20817359,0.002294004,0.0023450782,0.000115015675,0.0000017565964,0.000032132655,0.00038972255],"genre_scores_gemma":[0.9899399,0.0000145922995,0.008673548,0.00046694954,0.00028750495,2.5298434e-7,0.0000025203055,0.000007982078,0.00060671516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997846,0.00032409327,0.0005015735,0.0004449405,0.00061169366,0.00027167524],"domain_scores_gemma":[0.9978744,0.0006421878,0.00034517157,0.0004827981,0.0005307322,0.0001247151],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022891522,0.00015926149,0.00020490104,0.00015567848,0.0010461417,0.0016741089,0.00071674155,0.000044119563,0.00008224005],"category_scores_gemma":[0.00039773269,0.00011309053,0.00008596868,0.00078921946,0.00015577741,0.0006502728,0.00022799116,0.0003446962,0.000023916353],"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.00014135535,0.001281891,0.003634546,0.00023273572,0.0002611607,0.00044495953,0.016637009,0.067627005,0.06451441,0.7177231,0.0080969,0.11940493],"study_design_scores_gemma":[0.000639535,0.00021011055,0.0016925054,0.0002669639,0.000012315454,0.00032625487,0.00040537468,0.93654925,0.050452422,0.0076507204,0.0015224514,0.0002721064],"about_ca_topic_score_codex":9.497607e-7,"about_ca_topic_score_gemma":0.0000013734423,"teacher_disagreement_score":0.86892223,"about_ca_system_score_codex":0.00002556061,"about_ca_system_score_gemma":0.00020083887,"threshold_uncertainty_score":0.99936223},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4651716,0.0028638036,0.14332186,0.0099932775,0.005737435,0.0060028806,0.0001867938,0.00077658764,0.36594576],"genre_scores_gemma":[0.93996114,0.0060641035,0.050218184,0.00061248033,0.0007581686,0.0002483277,0.00003597092,0.000092124465,0.0020095054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957684,0.0006339163,0.0007252333,0.0014323933,0.000383926,0.0010561175],"domain_scores_gemma":[0.99740154,0.00042898717,0.00017220229,0.001706935,0.00007385307,0.00021647994],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0029173987,0.0004103208,0.0006469499,0.00086834293,0.00013532398,0.00039453464,0.0023743962,0.00066517876,0.000019868407],"category_scores_gemma":[0.00009974072,0.00043168545,0.0002133367,0.00029122795,0.00020092951,0.000380269,0.0021643094,0.003235126,0.0000149407615],"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.000086155305,0.00014024202,0.000033661323,0.000052754363,0.000019201845,0.00008632385,0.0006081022,0.47029287,0.000038327966,0.03151846,0.000026824691,0.4970971],"study_design_scores_gemma":[0.0007614739,0.00006399507,0.00009728499,0.00027966427,0.0000019743668,0.000011530796,0.00003510973,0.94011086,0.00030139764,0.052825212,0.0050495462,0.0004619354],"about_ca_topic_score_codex":0.00011158276,"about_ca_topic_score_gemma":0.0002965784,"teacher_disagreement_score":0.49663517,"about_ca_system_score_codex":0.001289271,"about_ca_system_score_gemma":0.000669366,"threshold_uncertainty_score":0.9998135},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012163483,0.000055849952,0.9950739,0.00141515,0.0002200726,0.00024366117,0.000008096816,0.0007188292,0.0010480521],"genre_scores_gemma":[0.8855024,0.0000024616586,0.11262099,0.00083360577,0.0005141155,0.000029302575,0.000020871525,0.000013780501,0.00046249467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990685,0.000055903914,0.00019046334,0.00030551638,0.00011889769,0.00026071825],"domain_scores_gemma":[0.9989954,0.00049428333,0.000059535516,0.00022019444,0.00009900463,0.0001315344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013949229,0.00011613555,0.00013997065,0.000031510757,0.00018632034,0.00013472045,0.00045623162,0.000051117415,0.00018156302],"category_scores_gemma":[0.00024849005,0.000102803264,0.000077169825,0.00035969648,0.000022349988,0.00031971477,0.000134562,0.00010032832,0.000024433462],"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.000045889687,0.00008097751,0.00013101354,0.000034616998,0.0000661272,0.0000057964608,0.0009044826,0.049373623,0.0006960278,0.92111176,0.0058133765,0.021736331],"study_design_scores_gemma":[0.00039852093,0.000089456684,0.00013009262,0.0000075452813,0.0000067816027,6.084492e-7,0.000032231743,0.9949516,0.0003298842,0.0010440841,0.0028622148,0.0001469668],"about_ca_topic_score_codex":0.000010392616,"about_ca_topic_score_gemma":0.0000075140997,"teacher_disagreement_score":0.945578,"about_ca_system_score_codex":0.000010522217,"about_ca_system_score_gemma":0.000037823418,"threshold_uncertainty_score":0.41921952},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8082165,0.00015107734,0.18266638,0.00026905668,0.00071971735,0.00396343,0.000023279641,0.0002327428,0.0037578335],"genre_scores_gemma":[0.94217265,0.00019192992,0.056918003,0.000028738303,0.00014836916,0.00037110635,0.000010335647,0.000032464093,0.00012643701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99627626,0.0006069825,0.0006555671,0.0013814567,0.0003799764,0.0006997305],"domain_scores_gemma":[0.9970458,0.00042850414,0.00024848708,0.001905642,0.00015702995,0.0002145039],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0052960943,0.00033569967,0.0005048876,0.0005830739,0.00035442243,0.00058431015,0.0021052565,0.00026902932,0.0000022459196],"category_scores_gemma":[0.00019281617,0.000320366,0.00015475876,0.00016273417,0.000046645655,0.0003819967,0.0011339238,0.0011202128,0.000001965667],"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.000044982742,0.00035678182,0.000018620987,0.000041409898,0.000013189223,0.000011217133,0.0017166829,0.621585,0.000011550335,0.0024575698,0.0000026975379,0.3737403],"study_design_scores_gemma":[0.00058374665,0.00035434015,0.00014692615,0.0001984531,0.0000050775566,0.0000040818604,0.0004967906,0.9647084,0.00004430211,0.03308783,0.000055560406,0.0003144746],"about_ca_topic_score_codex":0.000059774153,"about_ca_topic_score_gemma":0.000048381567,"teacher_disagreement_score":0.3734258,"about_ca_system_score_codex":0.00058813306,"about_ca_system_score_gemma":0.0003886661,"threshold_uncertainty_score":0.99992484},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015906784,0.0004850695,0.9934152,0.0006187272,0.0010905495,0.00031720297,0.00004736634,0.000097762364,0.0023374965],"genre_scores_gemma":[0.12584615,0.000104621155,0.86585283,0.000095374926,0.00031227202,0.00007191459,0.000050066603,0.000011811248,0.0076549426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988499,0.00006576329,0.00037290712,0.0003956422,0.00015463351,0.00016109923],"domain_scores_gemma":[0.99857944,0.000265792,0.00021474787,0.00068374205,0.00020623105,0.000050050236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042512867,0.00013838221,0.00030985018,0.00009740358,0.000060335005,0.00019561288,0.0011566578,0.00014587164,0.000133225],"category_scores_gemma":[0.00011642361,0.00012354802,0.00020961654,0.0001688173,0.00003935532,0.00013470947,0.0012542746,0.00011683998,0.0000042534843],"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.000007528329,0.00017721171,0.00005808719,0.00093648286,0.00013030235,0.0000042137026,0.00090259005,0.0054883114,0.0019165694,0.9700803,0.0010441272,0.019254256],"study_design_scores_gemma":[0.0007074372,0.00017900606,0.0001222744,0.00050034694,0.00011004365,0.00001402431,0.0003017673,0.60407287,0.13435654,0.2520373,0.0065118093,0.0010865898],"about_ca_topic_score_codex":0.000026830836,"about_ca_topic_score_gemma":0.000002912517,"teacher_disagreement_score":0.718043,"about_ca_system_score_codex":0.000010064019,"about_ca_system_score_gemma":0.00030705053,"threshold_uncertainty_score":0.5038142},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7529531,0.005821152,0.16133067,0.0051211985,0.008547572,0.0031540107,0.0007120405,0.0006520393,0.061708193],"genre_scores_gemma":[0.7826008,0.00085881294,0.19721441,0.0006639696,0.015978862,0.00013929495,0.00019405584,0.000065911256,0.00228385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99853855,0.00009432674,0.00034898636,0.00042411432,0.00030911824,0.00028491774],"domain_scores_gemma":[0.99897987,0.00011741771,0.00020462798,0.00046549525,0.00013601553,0.00009654965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032159008,0.00016362833,0.00026941713,0.00011868621,0.00014852118,0.00014436095,0.00078115903,0.000072087365,0.0003044619],"category_scores_gemma":[0.000017087963,0.00014580955,0.00013013705,0.00046651272,0.000039880873,0.00048442755,0.00015155012,0.00009303874,0.000009640198],"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.00020977677,0.001044568,0.0013414968,0.00084424706,0.00017832403,0.00020627955,0.0037000575,0.00032241805,0.007806263,0.72164714,0.015080703,0.24761873],"study_design_scores_gemma":[0.0054996377,0.0026045523,0.0049522757,0.00018222422,0.0002796377,0.00022053742,0.0022343027,0.011945066,0.39095128,0.22103591,0.3580302,0.0020643596],"about_ca_topic_score_codex":0.00003445269,"about_ca_topic_score_gemma":0.00003934642,"teacher_disagreement_score":0.50061125,"about_ca_system_score_codex":0.000028989429,"about_ca_system_score_gemma":0.00013059952,"threshold_uncertainty_score":0.59459406},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48909092,0.00009159703,0.5068511,0.00014639484,0.0007337889,0.00036666525,0.000012310159,0.00028133718,0.002425889],"genre_scores_gemma":[0.99058133,0.00020781512,0.0070878025,0.0001051028,0.00006715133,0.000002067364,0.00008660731,0.000023921184,0.0018382265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707973,0.00035190297,0.00036054075,0.0015381566,0.00016518858,0.00050450646],"domain_scores_gemma":[0.9974138,0.00015486541,0.00032754883,0.0016631727,0.00021769917,0.0002229067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005140685,0.00043351855,0.00048570146,0.0005616502,0.00017530972,0.00016064431,0.0020770119,0.00042796147,0.00016063402],"category_scores_gemma":[0.000025770323,0.00051881495,0.00031224708,0.0015579492,0.0001257785,0.0006480418,0.001517571,0.0007571647,0.00026118296],"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.00041672026,0.0020554475,0.008190725,0.0005908138,0.00083155744,0.011194105,0.0052892086,0.14660078,0.004281542,0.80761623,0.0009255386,0.012007337],"study_design_scores_gemma":[0.00081089983,0.000049852155,0.0011321539,0.00014760831,0.00006989102,0.000022526216,0.00011578398,0.9235881,0.0021552169,0.07054506,0.00052155874,0.0008413625],"about_ca_topic_score_codex":0.0001972307,"about_ca_topic_score_gemma":0.00005981948,"teacher_disagreement_score":0.7769873,"about_ca_system_score_codex":0.00024406769,"about_ca_system_score_gemma":0.00027404315,"threshold_uncertainty_score":0.99972636},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08419799,0.0036868097,0.78400207,0.046300456,0.002217349,0.00077010255,0.00011806238,0.00048727365,0.078219876],"genre_scores_gemma":[0.8446654,0.00005417306,0.113363616,0.0026258745,0.0004996337,0.000018928376,0.000040216684,0.00004523966,0.038686935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990216,0.00009726769,0.00027318497,0.00019180104,0.00016371785,0.00025242128],"domain_scores_gemma":[0.99895823,0.00018813107,0.000056538847,0.00040630077,0.00014522162,0.0002455893],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00030752775,0.00009696372,0.00019718116,0.000090189365,0.000061858016,0.00006515399,0.00036188134,0.000070759204,0.0039615403],"category_scores_gemma":[0.00045861927,0.000093650066,0.000051184736,0.00029052247,0.000052734445,0.00007392664,0.000072789386,0.00008291662,0.002405049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.8739483e-7,0.000018685907,0.000005655445,0.00009164342,0.000007947101,0.00004532365,0.00021685676,0.000010574191,0.00014421808,0.9958055,0.0031283635,0.00052434765],"study_design_scores_gemma":[0.00022932983,0.0000536095,0.000033252938,0.00010606505,0.000012938174,0.000069049485,0.00016630316,0.0041877823,0.006410437,0.9135026,0.07495096,0.00027770686],"about_ca_topic_score_codex":0.0001213534,"about_ca_topic_score_gemma":0.0000462145,"teacher_disagreement_score":0.7604674,"about_ca_system_score_codex":0.000040788367,"about_ca_system_score_gemma":0.00033762836,"threshold_uncertainty_score":0.9983717},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.067798e-7,0.7879441,0.21022688,0.00021129861,0.00047672325,0.0009868331,0.000005633564,0.00005482546,0.000093402836],"genre_scores_gemma":[8.868081e-7,0.97735125,0.020629792,0.00022847207,0.0012008984,0.000060887178,0.0000145194745,0.0000709229,0.0004423757],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9943394,0.0013219446,0.0020971855,0.0005608078,0.00057962275,0.0011010456],"domain_scores_gemma":[0.9956451,0.0008013333,0.002079823,0.00087459903,0.00037327837,0.00022585403],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0070950408,0.0006380115,0.0031522873,0.00028123072,0.0001758356,0.0001612107,0.002270537,0.00024113756,0.000098364966],"category_scores_gemma":[0.00037348876,0.00046299025,0.0022855196,0.000877332,0.0000411876,0.0004001919,0.00020005122,0.0016974629,0.000051844192],"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.0000033583224,0.0001490228,1.4993018e-8,0.025410863,0.00078697864,0.000052502026,0.00008685427,0.0000034056784,3.5795722e-7,0.41582885,0.0006656746,0.55701214],"study_design_scores_gemma":[0.00029082177,0.00068192324,1.1981188e-8,0.037675053,0.0013668368,0.0020773814,0.0000051455095,0.00023010171,0.000010868318,0.063441016,0.8937484,0.0004724196],"about_ca_topic_score_codex":4.925809e-7,"about_ca_topic_score_gemma":8.824485e-7,"teacher_disagreement_score":0.89308274,"about_ca_system_score_codex":0.00045569678,"about_ca_system_score_gemma":0.00534274,"threshold_uncertainty_score":0.9997822},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000036327397,0.00007530137,0.49794704,0.000019094072,0.00035965096,0.00012490533,0.000035567224,0.00020469166,0.5012301],"genre_scores_gemma":[0.000048347956,0.000014027383,0.07690061,0.00011268685,0.000248818,3.1275061e-7,0.0000094617035,0.000033581207,0.92263216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847084,0.00008899793,0.00020566942,0.00073597097,0.0002236418,0.00027486382],"domain_scores_gemma":[0.99846363,0.000143761,0.00023537611,0.0007693441,0.00012914676,0.0002587264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002355553,0.0003659714,0.00040763486,0.00019888284,0.00039964137,0.00011279604,0.0012869651,0.00028261388,0.0000064620654],"category_scores_gemma":[0.000010859664,0.0004447203,0.0002947769,0.00002431799,0.00012757425,0.0002401821,0.0011761835,0.00057433516,0.00002897913],"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.00001377639,0.0000031709822,1.8947553e-7,0.000048964364,0.000102465325,0.00023209587,0.000044105804,0.000044451383,0.00009852665,0.98682934,0.001349195,0.011233709],"study_design_scores_gemma":[0.00028405446,0.00003875988,7.144914e-7,0.00009330853,0.00018903961,0.000051429568,0.000017887214,0.06074188,0.00042362654,0.00036350102,0.93720627,0.0005895372],"about_ca_topic_score_codex":0.00007711477,"about_ca_topic_score_gemma":5.222151e-7,"teacher_disagreement_score":0.9864659,"about_ca_system_score_codex":0.00016638066,"about_ca_system_score_gemma":0.00016053718,"threshold_uncertainty_score":0.99980044},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8111419,0.000034421817,0.18459228,0.0015804343,0.0008548448,0.00065549655,0.00002656292,0.00034087384,0.0007732029],"genre_scores_gemma":[0.9889733,0.0000028297918,0.010167672,0.00010294115,0.00011521211,0.00005146834,0.00004150944,0.000008597674,0.0005364205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874413,0.00012777653,0.00027385584,0.0003526948,0.00021275097,0.0002888059],"domain_scores_gemma":[0.9993076,0.00013444314,0.000050676746,0.00034607062,0.000079317986,0.00008192221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004957065,0.00011398553,0.00013732111,0.00010680482,0.00015085137,0.00008431268,0.00042556121,0.000074903175,0.00017263222],"category_scores_gemma":[0.0000904322,0.00010478316,0.00005283793,0.0009262697,0.00006455745,0.0002798808,0.00020510145,0.00015496716,0.00026531902],"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.00010103347,0.00073140435,0.05834808,0.00040916773,0.00017623728,0.00020565388,0.019347647,0.28721127,0.049209327,0.5217866,0.0053910124,0.057082582],"study_design_scores_gemma":[0.00041250346,0.000043071675,0.021465607,0.000009236399,0.0000031168258,0.0000064299675,0.00002816254,0.94651437,0.0023420905,0.02782784,0.0011474136,0.00020016295],"about_ca_topic_score_codex":0.000011212606,"about_ca_topic_score_gemma":0.000032440174,"teacher_disagreement_score":0.65930307,"about_ca_system_score_codex":0.00005444439,"about_ca_system_score_gemma":0.00012464581,"threshold_uncertainty_score":0.42729333},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024186773,0.0025776592,0.9445803,0.0018632627,0.00336961,0.0013168979,0.00008788691,0.00021334641,0.02180425],"genre_scores_gemma":[0.99440503,0.000023714709,0.0023580354,0.0005616541,0.0003142391,0.000045617635,0.0000025472211,0.000055375,0.0022338112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951418,0.000805157,0.00091888447,0.0009928021,0.0011191717,0.001022154],"domain_scores_gemma":[0.99439174,0.0024618376,0.00067667663,0.0019301863,0.0002414922,0.0002980385],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020645473,0.0006630989,0.000724572,0.0003400958,0.0005485371,0.00031026016,0.0022221871,0.00026316597,0.0006806545],"category_scores_gemma":[0.0010892008,0.0004856513,0.00038652265,0.0015389706,0.0004178177,0.00036756363,0.00036983125,0.0007542632,0.0010541241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009047995,0.00048594803,0.000006721943,0.00013161892,0.000105503124,0.00004060344,0.0032305112,0.010009906,0.00037268258,0.9727154,0.00091402093,0.011896617],"study_design_scores_gemma":[0.0055776276,0.0043057976,0.0011517328,0.0029819643,0.00082709553,0.0004776351,0.0028173446,0.4428531,0.0053173723,0.52145743,0.008002199,0.0042307316],"about_ca_topic_score_codex":0.00007448928,"about_ca_topic_score_gemma":0.000017649543,"teacher_disagreement_score":0.97021824,"about_ca_system_score_codex":0.00009524473,"about_ca_system_score_gemma":0.0003590885,"threshold_uncertainty_score":0.9997595},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21163535,0.000064003005,0.78730226,0.00011186191,0.0007279638,0.00005534623,0.0000035559037,0.000008153092,0.00009149724],"genre_scores_gemma":[0.84738934,0.0000069441703,0.1524426,0.000007544307,0.00013641902,6.597801e-7,0.0000030823223,0.00000284168,0.000010594124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990572,0.00011232959,0.00045566968,0.00007962959,0.00024340955,0.000051796284],"domain_scores_gemma":[0.9982177,0.0001692321,0.00084070524,0.00006401414,0.000689455,0.000018920424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042262016,0.000067739966,0.0001878594,0.00023730496,0.00002126729,0.000042226016,0.00018606512,0.000038298,0.0000020856141],"category_scores_gemma":[0.000020965364,0.000052629908,0.00004351965,0.00009742965,0.00006522358,0.0003726758,0.000036015066,0.00007282382,2.5508268e-7],"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.0004425022,0.0003694596,0.00928624,0.0001508262,0.000580611,0.000026432086,0.0008018431,0.22349167,0.050846446,0.6565178,0.000036292662,0.057449903],"study_design_scores_gemma":[0.002709653,0.0014146382,0.042926766,0.0007985408,0.00011557709,0.0016778044,0.0002898602,0.8975479,0.02189246,0.030264251,0.0001300282,0.00023252283],"about_ca_topic_score_codex":0.000018825995,"about_ca_topic_score_gemma":0.0000016264944,"teacher_disagreement_score":0.67405623,"about_ca_system_score_codex":0.00002464006,"about_ca_system_score_gemma":0.000034991386,"threshold_uncertainty_score":0.21461853},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019292658,0.00009888883,0.9773358,0.00025952785,0.00028660754,0.00040437363,0.0000015931868,0.00008784328,0.0022326708],"genre_scores_gemma":[0.9814131,0.000020486143,0.017328292,0.00024744534,0.000059176335,0.000048493872,0.0000037321156,0.0000053202552,0.0008739235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991889,0.000055152293,0.00021607461,0.00022486679,0.000110927576,0.00020408769],"domain_scores_gemma":[0.9995635,0.00007529232,0.000046191733,0.00021955809,0.00004608428,0.00004933296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028715195,0.000082824845,0.000100972036,0.00012341284,0.00006545206,0.000026879368,0.00037067453,0.000035803827,0.000018187797],"category_scores_gemma":[0.00003235703,0.000071387025,0.000035766272,0.00039287802,0.000018896128,0.00033307602,0.00008401782,0.00005929378,0.000046239173],"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.000069251124,0.0008477718,0.002413064,0.00024159039,0.00003262637,0.00012571336,0.0049292343,0.006682948,0.00034379718,0.75239205,0.002633514,0.22928843],"study_design_scores_gemma":[0.0013633482,0.00026482518,0.0027991524,0.00009348045,0.000003048525,0.00016167262,0.00003427974,0.9531024,0.0042430437,0.033354092,0.0042470247,0.00033365173],"about_ca_topic_score_codex":0.000029731229,"about_ca_topic_score_gemma":0.000008530441,"teacher_disagreement_score":0.9621205,"about_ca_system_score_codex":0.000037074286,"about_ca_system_score_gemma":0.00006235685,"threshold_uncertainty_score":0.29110783},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067942455,0.00019305709,0.38946888,0.114036456,0.0009532792,0.0008619849,0.00020615722,0.000197919,0.4261398],"genre_scores_gemma":[0.9627075,0.0000019827528,0.009524989,0.0031788608,0.00005498208,0.000036299243,0.0000024125086,0.000012326341,0.024480645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991456,0.00014124635,0.00019124597,0.00018142707,0.00014262616,0.00019784702],"domain_scores_gemma":[0.998169,0.00092763477,0.00005039233,0.00059845403,0.00008611624,0.00016839443],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00020933636,0.00008714458,0.00013574096,0.000047392692,0.00014134179,0.00004212967,0.0004750314,0.00004721502,0.0019094006],"category_scores_gemma":[0.0010037534,0.00006294696,0.00008641331,0.00026980383,0.00008917688,0.000021850048,0.00008916504,0.00013937973,0.0010560403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.2767657e-7,0.000030190247,0.0000031025781,0.000024227727,0.000009023791,0.0000075559115,0.0007901024,0.000052008254,0.00002232064,0.99406224,0.004618294,0.0003803314],"study_design_scores_gemma":[0.00026120275,0.00004266017,0.00014092725,0.00018819631,0.000011074638,0.000042766256,0.00039289787,0.007503439,0.009459956,0.8720294,0.109677546,0.000249913],"about_ca_topic_score_codex":0.00021409764,"about_ca_topic_score_gemma":0.00031709817,"teacher_disagreement_score":0.894765,"about_ca_system_score_codex":0.00004595472,"about_ca_system_score_gemma":0.00021119826,"threshold_uncertainty_score":0.99972177},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24357909,0.0064254035,0.74839544,0.0003365109,0.0003541064,0.0003879502,0.000015137911,0.00021063226,0.0002957433],"genre_scores_gemma":[0.52383345,0.00045493853,0.47441757,0.00017171171,0.00028689456,0.00009672575,0.000005106574,0.000031738324,0.0007018558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863565,0.000074442694,0.00018252617,0.0005642805,0.00016331661,0.00037979867],"domain_scores_gemma":[0.9990517,0.000521951,0.000059092363,0.00017280257,0.00005709,0.00013739539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017354137,0.00019675153,0.00024328449,0.000099154204,0.0005021805,0.00054669095,0.00022747401,0.00005452754,0.0000046550363],"category_scores_gemma":[0.00013375061,0.0001558616,0.000035981335,0.00041705303,0.00013966695,0.0007555875,0.00019411293,0.00011425872,3.1122624e-7],"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.00009254275,0.00007242623,0.00048499752,0.00065114506,0.00011905221,0.00008654456,0.0062322086,0.0015556201,0.0054944092,0.83903927,0.00005270319,0.14611906],"study_design_scores_gemma":[0.0017227806,0.0010664364,0.0010504249,0.00057438103,0.00007821967,0.0011143584,0.0028337068,0.918115,0.017497439,0.04840932,0.0062920996,0.0012458138],"about_ca_topic_score_codex":0.000013334942,"about_ca_topic_score_gemma":0.0000056560402,"teacher_disagreement_score":0.9165594,"about_ca_system_score_codex":0.000009712657,"about_ca_system_score_gemma":0.000048024795,"threshold_uncertainty_score":0.6355852},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44942352,0.00015812318,0.38496763,0.0014385891,0.0026966315,0.00020985129,0.000005583628,0.00042547673,0.16067462],"genre_scores_gemma":[0.9050957,0.0000023140894,0.09364737,0.00039891893,0.00010453131,0.000005776449,7.4469233e-7,0.0000037896032,0.00074088667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993364,0.000044923607,0.000082306724,0.00012369125,0.00013410577,0.0002785457],"domain_scores_gemma":[0.9995222,0.000049863884,0.000026765023,0.00027556255,0.000007385508,0.00011823025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002526475,0.0000690485,0.00006851034,0.000031432628,0.00007149276,0.00006078854,0.00038884714,0.000024865481,0.00026736467],"category_scores_gemma":[0.000010527358,0.00005981219,0.00004252925,0.00011430185,0.00003139493,0.00044857585,0.00013301722,0.00006822851,0.00051114394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006179753,0.00015961308,0.0020730188,0.000010677618,0.000020375031,0.000008383339,0.0013520474,0.0000060292746,0.008206821,0.83367527,0.0054294197,0.14905217],"study_design_scores_gemma":[0.0019231671,0.00043894092,0.011170253,0.00005575119,0.000036532136,0.00031907746,0.00042122023,0.03685732,0.124110736,0.50494593,0.3180008,0.0017202366],"about_ca_topic_score_codex":0.0000017202824,"about_ca_topic_score_gemma":1.0283269e-7,"teacher_disagreement_score":0.45567214,"about_ca_system_score_codex":0.000017508248,"about_ca_system_score_gemma":0.0000092018845,"threshold_uncertainty_score":0.65698916},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08620868,0.0008118522,0.8595856,0.014773993,0.00037448056,0.00031954603,0.000146498,0.00015455052,0.037624814],"genre_scores_gemma":[0.97680146,0.000013619684,0.021420136,0.00030907552,0.00007660835,0.000008288259,0.000030672378,0.000009969244,0.0013302049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887127,0.000086033266,0.0002795586,0.00023625024,0.00019689061,0.0003300131],"domain_scores_gemma":[0.99887127,0.00020719056,0.00006340434,0.00041414532,0.00009352405,0.0003504438],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00036552054,0.00010635271,0.00023295115,0.00007849078,0.00007310738,0.000080420876,0.00042991785,0.00006533544,0.0030625495],"category_scores_gemma":[0.00038967884,0.0000993253,0.00010293435,0.00047730468,0.000051808118,0.00004376298,0.000061918945,0.00010550731,0.00166164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013338405,0.00004259623,0.0000139327485,0.00008733918,0.000015760013,0.00018627688,0.00006722501,0.0000040399887,0.00019359966,0.99352765,0.003904429,0.001955843],"study_design_scores_gemma":[0.0012458618,0.000118773925,0.0011954837,0.00034458385,0.00007078482,0.0008231368,0.00020489976,0.018263824,0.02842323,0.77015334,0.17823957,0.00091651396],"about_ca_topic_score_codex":0.00018423183,"about_ca_topic_score_gemma":0.00004955531,"teacher_disagreement_score":0.89059275,"about_ca_system_score_codex":0.000078044155,"about_ca_system_score_gemma":0.00026119468,"threshold_uncertainty_score":0.9991157},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9081469,0.00007793747,0.086507924,0.002238776,0.00010156508,0.00025574153,0.000006016469,0.00006877812,0.0025963627],"genre_scores_gemma":[0.86551017,0.000022595521,0.13406636,0.00024359797,0.000073675845,0.000010606431,2.1631377e-7,0.000012590251,0.00006016126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984386,0.00003225715,0.00048084673,0.00030290757,0.00046051375,0.0002848794],"domain_scores_gemma":[0.9989114,0.0002146519,0.0003630365,0.00022686733,0.00020809918,0.00007593492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053648616,0.0001632233,0.0005347863,0.000030195031,0.000075056094,0.00003672366,0.0010336861,0.00005233641,0.00003464447],"category_scores_gemma":[0.00039392067,0.0001149812,0.00034374368,0.0013578247,0.00037567076,0.0001700998,0.0006343357,0.0002344645,0.0000071409913],"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.00009662614,0.0021304183,0.010832913,0.0017555099,0.00024100443,0.000009111479,0.015093792,0.000052631985,0.059001032,0.83654916,0.0015336935,0.07270408],"study_design_scores_gemma":[0.0019602184,0.0005155247,0.01939391,0.0005287012,0.0001380834,0.00011992562,0.0052125626,0.14718924,0.46411046,0.35931486,0.00042523132,0.0010912796],"about_ca_topic_score_codex":0.000033396766,"about_ca_topic_score_gemma":5.374578e-7,"teacher_disagreement_score":0.47723433,"about_ca_system_score_codex":0.00003433569,"about_ca_system_score_gemma":0.000086762615,"threshold_uncertainty_score":0.46887973},"labels":[],"label_agreement":null},{"id":"W3183856668","doi":"10.1002/nla.2399","title":"ODE‐based double‐preconditioning for solving linear systems Aαx=b and f(A)x=b","year":2021,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Carleton University; Statistics Canada","funders":"","keywords":"Ode; Mathematics; Linear system; Computation; Applied mathematics; Ordinary differential equation; Extension (predicate logic); Matrix (chemical analysis); Linear differential equation; System of linear equations; Coefficient matrix; Algebraic number; Algebra over a field; Algorithm; Differential equation; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.016190170580138406,"score_gpt":0.2607405617680234,"score_spread":0.244550391187885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183856668","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010682928,0.0003344435,0.99610585,0.0009586565,0.0000787434,0.00061597483,0.000032127224,0.00024421155,0.00056172797],"genre_scores_gemma":[0.34344038,0.000011988002,0.6530371,0.0006180779,0.00048342207,0.0016302448,0.0001415936,0.000038555267,0.0005986315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986359,0.000036624988,0.00027789988,0.0005661092,0.00018530941,0.00029816388],"domain_scores_gemma":[0.998534,0.00035422758,0.00012057666,0.00055954506,0.00024191606,0.00018971134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020964288,0.0001717693,0.0002371668,0.0000611527,0.00043657786,0.0002099624,0.00034162254,0.00007576134,0.000023663664],"category_scores_gemma":[0.000026143309,0.00015305344,0.00006290384,0.0006313941,0.000067914116,0.0002518118,0.000091454334,0.00016223197,0.0000397948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004484386,0.00026817212,0.00020840121,0.00020112748,0.00007389757,0.000008030979,0.00014844016,0.010868408,0.0006381813,0.97288835,0.00028610876,0.014366032],"study_design_scores_gemma":[0.0013417889,0.000117096,0.00011615649,0.00005343169,0.000041331892,0.00007556566,0.00006619158,0.9377169,0.0050017578,0.0050661736,0.05000401,0.0003995766],"about_ca_topic_score_codex":0.000009057616,"about_ca_topic_score_gemma":0.0000012454555,"teacher_disagreement_score":0.9678222,"about_ca_system_score_codex":0.000024099472,"about_ca_system_score_gemma":0.00015518727,"threshold_uncertainty_score":0.6241338},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16219577,0.0016730098,0.72340924,0.009712853,0.010603856,0.0027885297,0.0010611527,0.00057709427,0.087978505],"genre_scores_gemma":[0.6965514,0.0002796712,0.29416576,0.00005712801,0.00071725086,0.00023701329,0.00018487945,0.00006702754,0.007739873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995245,0.00042363637,0.0008077999,0.0005590236,0.002614569,0.00035001166],"domain_scores_gemma":[0.9959819,0.0014191157,0.00060437527,0.0009522972,0.00093875965,0.0001036018],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004314213,0.0002211953,0.0003766401,0.0009149485,0.00018729454,0.00046203614,0.0049095997,0.00015218685,0.0016717783],"category_scores_gemma":[0.001065225,0.00021420275,0.00017631569,0.00049775623,0.00015440922,0.00034715733,0.006234771,0.0009733512,0.00009848571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017338665,0.00052125624,0.00010755713,0.00071594433,0.00020943361,0.000032832308,0.0016759075,0.008746885,0.00057044247,0.98383325,0.0011607086,0.0024084356],"study_design_scores_gemma":[0.0003327716,0.00011245967,0.00018106092,0.0003624101,0.000019347726,0.000015087653,0.0003773235,0.40652564,0.0030896207,0.58113647,0.0074407416,0.00040705703],"about_ca_topic_score_codex":0.000042964515,"about_ca_topic_score_gemma":0.0000042366933,"teacher_disagreement_score":0.53435564,"about_ca_system_score_codex":0.00017762852,"about_ca_system_score_gemma":0.00045188243,"threshold_uncertainty_score":0.9992408},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006064943,0.00016714502,0.9878339,0.0095093995,0.00014346902,0.0012103233,0.000016935328,0.00010386004,0.0004084421],"genre_scores_gemma":[0.010207752,0.000042536874,0.9538716,0.000029569912,0.00014675874,0.00047492966,0.000011505209,0.000031349293,0.035183966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982113,0.00018764363,0.0003381007,0.00025220067,0.0006022607,0.00040846557],"domain_scores_gemma":[0.9956276,0.0027392537,0.000034727418,0.0008219689,0.00070148706,0.00007498593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005468759,0.0001062423,0.00017923242,0.00026633835,0.0006416845,0.00037833417,0.0013323252,0.000059538517,0.000045158176],"category_scores_gemma":[0.0008174623,0.00007306048,0.000072552175,0.001847484,0.000119380056,0.00025604817,0.0004260592,0.00023397205,0.0001611803],"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.00000702569,0.00010164703,2.2962377e-7,0.00020810396,0.000034181463,0.000002012794,0.0029665125,0.10789496,0.0017847155,0.87322944,0.009912135,0.0038590305],"study_design_scores_gemma":[0.00020038818,0.00008971636,0.0000016901428,0.000047508212,0.0000070288525,0.000010408753,0.00034496284,0.9087858,0.0010873085,0.08617021,0.0031751024,0.00007982846],"about_ca_topic_score_codex":0.00004516666,"about_ca_topic_score_gemma":0.000019314975,"teacher_disagreement_score":0.80089086,"about_ca_system_score_codex":0.00002507918,"about_ca_system_score_gemma":0.00026990563,"threshold_uncertainty_score":0.49353832},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1971331,0.0019360739,0.77707654,0.0020894432,0.0004704368,0.0001499155,0.0000089176665,0.000025101259,0.021110484],"genre_scores_gemma":[0.6747471,0.00031893438,0.3191876,0.000030401208,0.00035724574,0.0000038671856,8.1343774e-7,0.000018236491,0.0053358003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748456,0.00039252042,0.0005983579,0.00011871913,0.0011687744,0.0002370732],"domain_scores_gemma":[0.99636483,0.0011397032,0.0003092323,0.0004966,0.0015631997,0.00012641681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047126682,0.00006963439,0.0002520386,0.00025330222,0.00013202812,0.00014081893,0.0010084544,0.000049066366,0.00026721825],"category_scores_gemma":[0.0009805374,0.000055138134,0.00014799065,0.0008803104,0.000071803755,0.00042347246,0.00046407006,0.0004402535,0.000021150085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004809124,0.004020051,0.0015323716,0.0038461601,0.00055756763,0.0014456466,0.007849915,0.0007202436,0.028169507,0.8803005,0.01499547,0.056514475],"study_design_scores_gemma":[0.0012017796,0.00057836395,0.0017119895,0.0012261102,0.00005495906,0.0024544937,0.005945018,0.04296895,0.06251294,0.8630198,0.017947065,0.0003785005],"about_ca_topic_score_codex":0.000003396499,"about_ca_topic_score_gemma":0.0000032605406,"teacher_disagreement_score":0.47761402,"about_ca_system_score_codex":0.00003077048,"about_ca_system_score_gemma":0.00039529233,"threshold_uncertainty_score":0.29258525},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053798728,0.0057727136,0.92607,0.00012136465,0.009568342,0.00039251187,0.000014229019,0.00015225481,0.0041099074],"genre_scores_gemma":[0.37634394,0.00010796343,0.6083765,0.0005396009,0.0020569232,0.000018427916,0.000018954514,0.000090299414,0.012447371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937441,0.0017487766,0.001132393,0.00132784,0.00091953395,0.0011273832],"domain_scores_gemma":[0.98482925,0.011640605,0.0009409823,0.0008244314,0.0011806667,0.0005840941],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.012910986,0.00046469623,0.0007582527,0.0013616895,0.0024050316,0.006844007,0.00136652,0.00013581551,0.000003620339],"category_scores_gemma":[0.0040074144,0.00041001415,0.00035943996,0.0047329804,0.00019694795,0.0008462929,0.00073172577,0.00086298824,0.00004957088],"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.000007838729,0.0006801019,0.00033720417,0.00035124464,0.00032154465,0.00050299836,0.009003625,0.008611451,0.0048838095,0.5317054,0.010162956,0.43343183],"study_design_scores_gemma":[0.0019168949,0.00043091323,0.00020768699,0.00048774554,0.00006221121,0.0021503035,0.0015990185,0.846644,0.007638326,0.02287992,0.11576451,0.0002184636],"about_ca_topic_score_codex":0.0000035076255,"about_ca_topic_score_gemma":5.6553455e-7,"teacher_disagreement_score":0.83803254,"about_ca_system_score_codex":0.00015551755,"about_ca_system_score_gemma":0.0004246834,"threshold_uncertainty_score":0.9998352},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.767634,0.00008575365,0.22848506,0.003544009,0.00008442546,0.000068381305,4.4972808e-7,0.000007844708,0.000090121095],"genre_scores_gemma":[0.8979083,0.000020234429,0.102012746,0.000023256864,0.000004282204,6.4749976e-8,2.6536789e-8,7.7411073e-7,0.000030363819],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947447,0.0000482986,0.000101593294,0.00014562374,0.00013448422,0.00009554455],"domain_scores_gemma":[0.9993795,0.00010394813,0.00012667674,0.00011222969,0.00024245559,0.000035168934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014370125,0.000039565253,0.0001411331,0.00049040763,0.00011025471,0.000018300254,0.0004014275,0.000036276782,0.0000010249912],"category_scores_gemma":[0.00021888198,0.000037026562,0.000017192324,0.0010403079,0.00024182699,0.00036892426,0.00016415777,0.00009446176,1.1716864e-7],"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.0001431786,0.0009080666,0.009832634,0.000030478415,0.000040082545,0.0003152546,0.006079446,0.000038900816,0.02157788,0.35569015,0.0000617412,0.6052822],"study_design_scores_gemma":[0.015424353,0.018715575,0.117534585,0.00038143416,0.00016864685,0.0025308784,0.16847031,0.06493175,0.12841485,0.4713985,0.010946386,0.0010827142],"about_ca_topic_score_codex":0.0000036236975,"about_ca_topic_score_gemma":0.0000044795997,"teacher_disagreement_score":0.60419947,"about_ca_system_score_codex":0.000030671767,"about_ca_system_score_gemma":0.00014087641,"threshold_uncertainty_score":0.15098993},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007183972,0.0000713122,0.991314,0.00009571506,0.00028078703,0.00016089667,0.000027512226,0.000043223965,0.0008225971],"genre_scores_gemma":[0.55971146,0.0000089313535,0.43808332,0.00003158343,0.00010052392,0.000030933817,0.0000533935,0.0000069520347,0.0019728872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923694,0.000075496,0.00028247098,0.00017448529,0.00011583048,0.00011474689],"domain_scores_gemma":[0.9991355,0.00008986737,0.00012337479,0.00033720778,0.00027310714,0.00004097817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025415106,0.000060141407,0.0001329251,0.000060274077,0.00007474561,0.000028880038,0.0002677677,0.00003124514,0.000011637835],"category_scores_gemma":[0.000052455427,0.00005584133,0.000056228382,0.00023979126,0.000024077539,0.00027408265,0.000068443216,0.000022776127,0.0000016837671],"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.0000021750727,0.00009382711,0.000010933611,0.00006224084,0.000015621043,3.714377e-7,0.00020318195,0.01471977,0.012109432,0.97160506,0.000047123787,0.0011302762],"study_design_scores_gemma":[0.00021042112,0.00005516547,0.000007899598,0.000012034662,0.000008415882,0.0000044677936,0.000034308232,0.94661045,0.043359414,0.009545686,0.000090549554,0.000061203275],"about_ca_topic_score_codex":0.000040575727,"about_ca_topic_score_gemma":0.000007068882,"teacher_disagreement_score":0.9620594,"about_ca_system_score_codex":0.0000071092095,"about_ca_system_score_gemma":0.00007407891,"threshold_uncertainty_score":0.22771434},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8109276,0.0021796783,0.17817889,0.0020337459,0.00068599253,0.00016094655,0.000003573679,0.000007277031,0.0058222935],"genre_scores_gemma":[0.8525592,0.00016867633,0.14608891,0.000018138166,0.00011567673,7.6157204e-7,7.277976e-8,0.000010089912,0.0010384821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728364,0.0003658132,0.00062974554,0.000096012925,0.0014152133,0.00020959343],"domain_scores_gemma":[0.9967119,0.00090634014,0.00047109593,0.00060048996,0.001239975,0.000070189184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049615647,0.00007279365,0.00028316278,0.00018258375,0.00010304412,0.00009873634,0.0015747733,0.000052769625,0.00007279029],"category_scores_gemma":[0.00095159595,0.000045009838,0.00020577587,0.00085470115,0.00017078235,0.00014786447,0.0005469197,0.0003962077,0.000004835454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025956399,0.0016111563,0.00031183058,0.0012244614,0.00020523691,0.00026840917,0.0047524245,0.00036068627,0.051598996,0.93399554,0.0013508977,0.004294389],"study_design_scores_gemma":[0.00089786085,0.00056416227,0.00059956487,0.0015067325,0.000046444948,0.0010532243,0.001752242,0.040224817,0.23078795,0.71948326,0.0028740496,0.00020967824],"about_ca_topic_score_codex":0.0000030155697,"about_ca_topic_score_gemma":8.347226e-7,"teacher_disagreement_score":0.21451229,"about_ca_system_score_codex":0.00002992137,"about_ca_system_score_gemma":0.0004764644,"threshold_uncertainty_score":0.29263467},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009870558,0.00046461425,0.99768597,0.00021700114,0.00010677031,0.00046589188,0.000004996411,0.000026555319,0.0009294922],"genre_scores_gemma":[0.3490268,0.0003242057,0.65033734,0.00018909383,0.000014911534,0.000077519355,8.0178944e-7,0.000005688307,0.00002366389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991946,0.000012640564,0.00026809706,0.00020652796,0.00015582144,0.00016227682],"domain_scores_gemma":[0.9982537,0.001220216,0.00014960274,0.00031345506,0.00003074087,0.000032290485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066626794,0.00011724673,0.00019940788,0.000058225887,0.00009370623,0.000026923446,0.00040091472,0.000040476316,0.0000029224245],"category_scores_gemma":[0.000081880215,0.000082610684,0.000039722647,0.00022474598,0.000018112827,0.00009727913,0.000047883655,0.00008053145,0.0000012655612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011308886,0.000074726246,9.877999e-9,0.000048066806,0.000003635515,2.1993144e-7,0.00034827655,0.004224646,0.0012662325,0.8724045,0.0000021771755,0.12161617],"study_design_scores_gemma":[0.00016486735,0.00006743918,1.06212596e-7,0.000019284935,0.0000052553587,8.3877745e-7,0.00009569457,0.4770827,0.004410601,0.51798284,0.00011548602,0.000054909648],"about_ca_topic_score_codex":7.6735995e-7,"about_ca_topic_score_gemma":0.0000024626106,"teacher_disagreement_score":0.47285804,"about_ca_system_score_codex":0.00000826696,"about_ca_system_score_gemma":0.000023142684,"threshold_uncertainty_score":0.33687657},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033998021,0.0003594328,0.9936591,0.0018334104,0.00048549796,0.00011905332,0.000010255954,0.000006342061,0.000127108],"genre_scores_gemma":[0.63345104,0.00023670781,0.36534953,0.00009590652,0.0006336354,0.000007648892,0.0000018851126,0.0000097946995,0.00021383194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99903595,0.0001103612,0.00036488523,0.0001395929,0.00019473452,0.00015445425],"domain_scores_gemma":[0.99847275,0.00028613803,0.00043512546,0.00022079553,0.00053348875,0.00005170183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086899276,0.00011283353,0.00028418069,0.000028530301,0.00017399245,0.00018262707,0.00037803262,0.00002983093,0.0000067485503],"category_scores_gemma":[0.000059746202,0.00007800231,0.00012625301,0.00015464793,0.0001316862,0.0007737701,0.00015976283,0.00017430946,4.852463e-7],"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.00010876966,0.00013416326,0.000017451524,0.00018492498,0.0001581828,0.000009053948,0.0028345676,0.0010423048,0.15547259,0.546579,0.00031015225,0.29314888],"study_design_scores_gemma":[0.000922983,0.00042488976,0.00009518185,0.0001377154,0.00007180495,0.00018532912,0.00038676694,0.087936535,0.57133555,0.33703968,0.0013100817,0.00015347412],"about_ca_topic_score_codex":0.000008431949,"about_ca_topic_score_gemma":0.0000049777586,"teacher_disagreement_score":0.63005126,"about_ca_system_score_codex":0.000014190391,"about_ca_system_score_gemma":0.0004463153,"threshold_uncertainty_score":0.31808418},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7618983,0.018890984,0.2043597,0.013364896,0.0006939883,0.00014660113,0.000001400923,0.000045999193,0.00059814035],"genre_scores_gemma":[0.9794846,0.001620551,0.015817124,0.0019385775,0.0004270746,0.0000017004293,0.0000010219086,0.000014710059,0.0006946057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985466,0.00041969825,0.00033453904,0.00012759336,0.00024266049,0.00032891487],"domain_scores_gemma":[0.99901706,0.00021547383,0.00022362686,0.0003045104,0.00015007539,0.000089255576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015065209,0.00011016135,0.0002530743,0.000055818553,0.00017017455,0.00011712512,0.0005967534,0.000039040988,0.000041222447],"category_scores_gemma":[0.00012582882,0.00006989327,0.00013758204,0.0002970109,0.000121621146,0.00029672252,0.00017060833,0.0005104429,0.000010135196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006684508,0.000044819986,0.000056297744,0.0000063121347,0.00011790376,0.000099128956,0.0008198395,0.00008124602,0.0004662807,0.9916214,0.00046828826,0.0061516752],"study_design_scores_gemma":[0.011532981,0.00046105045,0.00017954632,0.000059112357,0.00012615343,0.00571174,0.0004009447,0.057814986,0.02664155,0.85506207,0.041560378,0.00044951474],"about_ca_topic_score_codex":0.0000046400637,"about_ca_topic_score_gemma":0.000007264468,"teacher_disagreement_score":0.21758634,"about_ca_system_score_codex":0.00003996669,"about_ca_system_score_gemma":0.00044870796,"threshold_uncertainty_score":0.28501648},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027936664,0.00039862568,0.9901621,0.0036474038,0.0015865186,0.00015533771,0.00012536772,0.000028757539,0.0011022568],"genre_scores_gemma":[0.3753713,0.0002237146,0.6218659,0.0012170897,0.0010343437,0.0000026772234,0.000020182437,0.000017414188,0.00024735113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731636,0.00039470373,0.000862331,0.00034779607,0.0006932275,0.0003856088],"domain_scores_gemma":[0.9968371,0.00019080144,0.00069714925,0.00034919052,0.0015096345,0.00041612796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008791566,0.00024823466,0.0004451269,0.000080483755,0.00021986249,0.0005778643,0.0004808308,0.00015772707,0.00014738707],"category_scores_gemma":[0.00061715953,0.00025182625,0.00023541831,0.0014878521,0.000037667385,0.0011031175,0.00023060729,0.00023886019,0.000044004548],"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.00005271334,0.0007924617,0.00009424725,0.00002616145,0.00006771241,0.00052057346,0.00016096962,0.9120289,0.00010726262,0.008859729,0.0017113738,0.07557791],"study_design_scores_gemma":[0.0009886392,0.0007332702,0.00047389837,0.00021510321,0.000100798825,0.0009841764,0.00006308103,0.98972267,0.001065362,0.0038628264,0.0014897288,0.00030042382],"about_ca_topic_score_codex":0.000010883227,"about_ca_topic_score_gemma":0.00000623282,"teacher_disagreement_score":0.37257764,"about_ca_system_score_codex":0.00039956832,"about_ca_system_score_gemma":0.0006257453,"threshold_uncertainty_score":0.9999934},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013560004,0.00016370276,0.9851671,0.00023076194,0.00032740517,0.00013451438,0.000009344227,0.00021449456,0.00019267744],"genre_scores_gemma":[0.18632114,0.0000036314516,0.81279814,0.00025819297,0.00039966693,0.000010491218,0.000112984446,0.000031780764,0.00006395231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739236,0.0003678977,0.000447902,0.0009958907,0.00041220244,0.00038372094],"domain_scores_gemma":[0.9978,0.00045802924,0.00036145814,0.00089211826,0.00031517746,0.00017319873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008476957,0.0003674464,0.00044947906,0.00012725481,0.00039454666,0.0006380198,0.0010163619,0.00023787952,0.000058135796],"category_scores_gemma":[0.000101071986,0.00034932944,0.000144643,0.00039312133,0.000059652906,0.0004925642,0.00093604624,0.000479565,0.0000020413104],"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.00006585597,0.00088837714,0.00011322967,0.00053627644,0.0008388569,0.00023819724,0.0068581933,0.4257823,0.38169974,0.11592436,0.00015000872,0.06690462],"study_design_scores_gemma":[0.00030850395,0.000027820872,0.000016063077,0.0001246014,0.00003191618,0.000035582936,0.00006250184,0.92276174,0.07371237,0.0023952592,0.0000814333,0.00044221],"about_ca_topic_score_codex":0.000073616764,"about_ca_topic_score_gemma":0.0000054939615,"teacher_disagreement_score":0.49697945,"about_ca_system_score_codex":0.000079678735,"about_ca_system_score_gemma":0.0006155199,"threshold_uncertainty_score":0.9998959},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04085514,0.03069023,0.57604104,0.33651096,0.000633103,0.0020259647,0.00005968206,0.0001755666,0.013008315],"genre_scores_gemma":[0.9921009,0.00080861035,0.0037494842,0.0009880812,0.00019708085,0.0001273646,0.0000015554222,0.000007898503,0.0020190035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933976,0.000096289616,0.00016292799,0.0001704194,0.000115082024,0.000115541094],"domain_scores_gemma":[0.9983698,0.0009495993,0.00004215125,0.00050071307,0.00009590331,0.0000418384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034002517,0.000065850036,0.000088359484,0.0000080738155,0.0005689801,0.00009899575,0.00043078527,0.000028977012,0.000008806205],"category_scores_gemma":[0.00016283854,0.000030163945,0.000048047998,0.00024658456,0.00028035243,0.000081875914,0.0003509529,0.00011785551,0.000008650737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020120128,0.000015392943,0.000009726981,0.000008272525,0.0000068791255,1.7630461e-7,0.00019041821,0.0000013365918,0.00013084407,0.9940785,0.00010475115,0.0054516955],"study_design_scores_gemma":[0.00077882776,0.000024760748,0.0010410714,0.000025341755,0.000058123147,0.00013107472,0.00029218732,0.07351951,0.013311606,0.75508803,0.15552779,0.00020168032],"about_ca_topic_score_codex":0.0000035983876,"about_ca_topic_score_gemma":0.000003006765,"teacher_disagreement_score":0.9512458,"about_ca_system_score_codex":0.000002684358,"about_ca_system_score_gemma":0.000039001166,"threshold_uncertainty_score":0.43761927},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042076532,0.00014650854,0.123057984,0.00015634178,0.00025473017,0.0002258221,0.00015947674,0.00031484876,0.8756422],"genre_scores_gemma":[0.00043809626,0.000028313523,0.00089701824,0.00022576196,0.00014900177,4.878202e-7,0.0000086949685,0.000024088557,0.99822855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99858856,0.0002479654,0.00014168792,0.000627424,0.00019535153,0.0001990176],"domain_scores_gemma":[0.99849063,0.00037525772,0.00013504399,0.00066201057,0.000085980755,0.00025110343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004063897,0.0003035448,0.0002963141,0.00016066954,0.00028818485,0.000067686844,0.0008349908,0.00023794037,0.0000055765595],"category_scores_gemma":[0.000028095577,0.00034203223,0.00014952102,0.000014419382,0.00023898021,0.0001704112,0.0010150204,0.00047812736,0.00004933404],"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.00048829877,0.000004112032,1.1537149e-7,0.000034142016,0.00007201132,0.00042105588,0.00009467072,0.0000010020966,0.000037493548,0.9905023,0.0038514214,0.004493376],"study_design_scores_gemma":[0.00039650887,0.00011601762,0.000005282984,0.00005701512,0.000090815854,0.000049614107,0.00002456433,0.0008224067,0.00009933224,0.0010812245,0.996849,0.00040820372],"about_ca_topic_score_codex":0.000014701947,"about_ca_topic_score_gemma":3.0480834e-7,"teacher_disagreement_score":0.9929976,"about_ca_system_score_codex":0.000060278406,"about_ca_system_score_gemma":0.00011515411,"threshold_uncertainty_score":0.99990314},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045952965,0.00012835507,0.9834243,0.010014973,0.0011291021,0.00042174762,0.0000452229,0.00017334697,0.00006767275],"genre_scores_gemma":[0.92582124,0.0000014268143,0.07020796,0.0008837184,0.0026156423,0.00020007667,0.000012805358,0.000024896819,0.0002322154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868506,0.00007437463,0.00014190961,0.0005077561,0.00028526754,0.00030563684],"domain_scores_gemma":[0.9990692,0.0001408181,0.00006305905,0.0005497354,0.00009707744,0.00008008819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032105428,0.00015474191,0.00016451316,0.00007168801,0.00053386175,0.000126452,0.00072268536,0.000025744612,0.000022143655],"category_scores_gemma":[0.00004271331,0.00015050314,0.00011057962,0.0006496517,0.000018100916,0.00035371818,0.0003878089,0.00018308169,0.000016634342],"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.000034390287,0.00005384771,0.0000013855431,0.000013871342,0.000018832237,0.0000012409828,0.0014795043,0.7836917,0.00402981,0.15891246,0.002033695,0.049729247],"study_design_scores_gemma":[0.00022218602,0.00027255344,0.0000025857712,0.000002781037,0.000012732954,0.000009747866,0.000016154643,0.47570133,0.020213444,0.48605314,0.017221592,0.00027177372],"about_ca_topic_score_codex":0.000017248665,"about_ca_topic_score_gemma":0.000002788262,"teacher_disagreement_score":0.92122597,"about_ca_system_score_codex":0.00007040648,"about_ca_system_score_gemma":0.00006006069,"threshold_uncertainty_score":0.613734},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047032274,0.00022711384,0.8195851,0.0026488006,0.00038019364,0.00021837415,0.000053405525,0.0018920416,0.17029177],"genre_scores_gemma":[0.84666014,0.0002060539,0.13327274,0.00277492,0.0011491752,8.4837254e-8,0.0018163224,0.0029720548,0.011148526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979821,0.0005286784,0.00020807827,0.00052701344,0.00038113658,0.00037300866],"domain_scores_gemma":[0.9982681,0.000031110336,0.000068964364,0.0008389476,0.000607195,0.00018566127],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00090277643,0.00012883235,0.00014340799,0.00012198682,0.0021653813,0.0018192129,0.0015575746,0.00006627754,0.0045895055],"category_scores_gemma":[0.0006597094,0.00014348517,0.00007049992,0.0008440629,0.00010281508,0.00048533795,0.0023506472,0.00029263337,0.0042735855],"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.000012402578,0.00026432105,0.0000024372289,0.000056664983,0.00004029409,0.00023420971,0.0010903581,0.000023912924,0.0049247257,0.6053828,0.030967709,0.35700014],"study_design_scores_gemma":[0.00030783474,0.00006633059,0.0001646476,0.000020527748,0.0000067228316,0.0004294919,0.000073571944,0.0025893156,0.0034958252,0.019104544,0.97353894,0.0002022583],"about_ca_topic_score_codex":0.000004874317,"about_ca_topic_score_gemma":1.4407871e-7,"teacher_disagreement_score":0.9425712,"about_ca_system_score_codex":0.000081745595,"about_ca_system_score_gemma":0.000009730477,"threshold_uncertainty_score":0.999217},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054961434,0.0008744362,0.9912897,0.0013542029,0.0006157688,0.00008852027,0.00001029414,0.000022177317,0.00024879805],"genre_scores_gemma":[0.9764398,0.000011550105,0.0223207,0.00026621946,0.00027153618,0.000022897568,0.0000029752541,0.000009535773,0.0006548042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804044,0.00021873847,0.0006425966,0.00022290443,0.0006039284,0.00027137567],"domain_scores_gemma":[0.99848837,0.00021406625,0.00056366756,0.0003441679,0.0002137503,0.00017599236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015715029,0.00012712929,0.0005324716,0.00043640353,0.00038619578,0.00022807073,0.0011649455,0.000024162113,0.00020378207],"category_scores_gemma":[0.00003593141,0.000102329795,0.0007983278,0.0019649595,0.000028998886,0.0003466626,0.00022984637,0.00024325741,0.0000068842005],"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.0008119546,0.0016389849,0.0018040895,0.000106867235,0.009945111,0.00046726342,0.0025552867,0.7091094,0.00096148916,0.21073358,0.014493555,0.04737237],"study_design_scores_gemma":[0.0015132857,0.00087529764,0.00018358421,0.000008097358,0.0010957752,0.00048779402,0.0006253989,0.92406243,0.00026323536,0.0105851935,0.059946597,0.00035329364],"about_ca_topic_score_codex":0.00005149046,"about_ca_topic_score_gemma":4.3745797e-7,"teacher_disagreement_score":0.9709436,"about_ca_system_score_codex":0.00012424873,"about_ca_system_score_gemma":0.00009371069,"threshold_uncertainty_score":0.41728878},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001769281,0.0031086644,0.98819315,0.001484314,0.0010991294,0.0023779797,0.0002832032,0.0014443764,0.00023989142],"genre_scores_gemma":[0.08178116,0.00017896555,0.9106873,0.0011993096,0.00079498533,0.003649287,0.00038927837,0.00010241546,0.0012172703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99443954,0.0012323271,0.0010255101,0.0016789284,0.0006052,0.0010184952],"domain_scores_gemma":[0.9945573,0.0006566817,0.0007180643,0.002791186,0.0007077371,0.00056900544],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0029716794,0.0007720043,0.0010865844,0.0010104054,0.00048262003,0.0019066307,0.0024730114,0.0008963991,0.000020342273],"category_scores_gemma":[0.00044426307,0.0007907875,0.0005524278,0.0013032528,0.00006396184,0.0009807015,0.0015998965,0.0011173594,0.000010327796],"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.00014206948,0.0012498493,0.0003268904,0.0011007419,0.00053094357,0.00029862995,0.0026071928,0.1462896,0.0024834871,0.7862732,0.0027332262,0.05596422],"study_design_scores_gemma":[0.0004719788,0.00024646474,0.00018421633,0.0002241324,0.0000745536,0.00012466875,0.00015274425,0.966041,0.009401932,0.019241491,0.002952132,0.00088468264],"about_ca_topic_score_codex":0.0029708075,"about_ca_topic_score_gemma":0.00028418718,"teacher_disagreement_score":0.8197514,"about_ca_system_score_codex":0.0005072091,"about_ca_system_score_gemma":0.0008070102,"threshold_uncertainty_score":0.9994543},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060725573,0.0022823925,0.9296955,0.0030162442,0.00013653048,0.0008716735,0.00025152313,0.00025639992,0.0027641656],"genre_scores_gemma":[0.9713113,0.00004047595,0.027373053,0.0003180644,0.00006897557,0.00028349564,0.000045931785,0.000008404246,0.0005502984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935097,0.00005697146,0.00016777654,0.00019699895,0.000117315496,0.00010997785],"domain_scores_gemma":[0.9994267,0.000104432314,0.00006609376,0.0002958516,0.00004563506,0.000061268816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001337993,0.000072040486,0.00010281012,0.00008373666,0.00039381505,0.000018023129,0.00040776553,0.000019707411,0.000119682954],"category_scores_gemma":[0.0000053619583,0.00007255221,0.000039099497,0.00046240038,0.000029573908,0.00009926783,0.0002783586,0.0001172322,0.000016092128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030324848,0.00009425924,0.000011622087,0.000013673766,0.000013991688,9.795608e-7,0.00026207606,0.00024864264,0.0024522922,0.9931987,0.00021293071,0.0034878221],"study_design_scores_gemma":[0.0014957098,0.00047227638,0.0008569426,0.000016570526,0.00009488315,0.00031107012,0.0005732076,0.32543412,0.01999187,0.3346443,0.31528562,0.00082342606],"about_ca_topic_score_codex":0.0000052170385,"about_ca_topic_score_gemma":5.291133e-7,"teacher_disagreement_score":0.9105857,"about_ca_system_score_codex":0.000008338246,"about_ca_system_score_gemma":0.00003791334,"threshold_uncertainty_score":0.30289468},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018865348,0.00016195326,0.83009666,0.000085291606,0.0016663171,0.00018852892,0.0008914854,0.0000812976,0.16680957],"genre_scores_gemma":[0.0006726663,0.00014694061,0.5605946,0.000016415623,0.00018054956,0.000013392694,0.00007584799,0.000036674886,0.43826288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986034,0.000022641665,0.00051120034,0.00038144022,0.00027998316,0.00020136069],"domain_scores_gemma":[0.99837565,0.00022549184,0.00028547083,0.0008946222,0.0001518145,0.00006692197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020643006,0.00022920739,0.00032609777,0.00023554622,0.000091582784,0.000062955776,0.0006207705,0.00021093724,0.0005961292],"category_scores_gemma":[0.00009154689,0.00024868266,0.00007014263,0.00008618072,0.00025965474,0.00023195232,0.00036157918,0.0005307236,0.000071444956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000831454,0.000016315818,0.000024830997,0.000057308855,0.000022980015,0.000052894036,0.00020474406,0.00002623334,0.000064060645,0.9937516,0.000501207,0.005269518],"study_design_scores_gemma":[0.00025374585,0.00010272729,0.00031788024,0.00010023836,0.000047058762,0.000049221282,0.000034937515,0.0008890926,0.00039621795,0.7777524,0.21953942,0.0005170559],"about_ca_topic_score_codex":0.000032724205,"about_ca_topic_score_gemma":0.00020234319,"teacher_disagreement_score":0.27145332,"about_ca_system_score_codex":0.000026742728,"about_ca_system_score_gemma":0.00012671553,"threshold_uncertainty_score":0.99999654},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16658586,0.0007718604,0.6952849,0.004564231,0.004797421,0.00071166496,0.000010757087,0.0022628657,0.12501045],"genre_scores_gemma":[0.972567,0.000034426062,0.011668841,0.00092750083,0.0006602077,0.0000043126743,0.0000038892613,0.00002181276,0.014111982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983185,0.00006572535,0.0003164023,0.00046138387,0.000359897,0.00047809302],"domain_scores_gemma":[0.99866635,0.00030355642,0.00012865274,0.00061294314,0.00007390007,0.00021462592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064798805,0.00022682028,0.00023048309,0.00077205757,0.0002268612,0.00019494946,0.0006042635,0.000109812725,0.00010790063],"category_scores_gemma":[0.00014275256,0.00020457973,0.00010054119,0.0024659422,0.000032923916,0.0006493182,0.000089964284,0.00020802794,0.0004992127],"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.0000948685,0.00013080203,0.00054324314,0.000028292625,0.000035736004,0.00014017141,0.00074195827,0.00005916863,0.00069172756,0.86988175,0.009278132,0.11837413],"study_design_scores_gemma":[0.004942589,0.007309254,0.10918476,0.0002198314,0.00010233467,0.0014914188,0.0027068607,0.008069189,0.13684255,0.19088075,0.5349095,0.0033409633],"about_ca_topic_score_codex":0.00007933826,"about_ca_topic_score_gemma":0.000024213698,"teacher_disagreement_score":0.80598116,"about_ca_system_score_codex":0.00006417768,"about_ca_system_score_gemma":0.00004218643,"threshold_uncertainty_score":0.83425194},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7561139,0.004273176,0.23750225,0.0013590284,0.00013952625,0.00013382525,0.0000025285271,0.00004001714,0.0004357486],"genre_scores_gemma":[0.9755762,0.00031871616,0.023651313,0.00012345634,0.0002072226,9.785853e-7,6.544805e-7,0.000010666529,0.00011078281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982882,0.00009718551,0.000540889,0.00015137716,0.000445488,0.00047684094],"domain_scores_gemma":[0.99878037,0.000077702905,0.00059159676,0.0002759375,0.00017257928,0.000101787424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008704321,0.00014166355,0.00029076575,0.00025713033,0.00008358979,0.00004351724,0.0009334696,0.00003410184,0.00007197149],"category_scores_gemma":[0.000017452563,0.00010265165,0.00012519339,0.0005766466,0.00005188939,0.0006228051,0.00007656763,0.00035781,0.000022383778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032465404,0.0007689309,0.0028853945,0.00007530437,0.00075814454,0.000054843258,0.0010987362,0.0015444958,0.0057290453,0.88000494,0.0008156343,0.10593985],"study_design_scores_gemma":[0.01819751,0.016485725,0.0060599684,0.00088579283,0.0005806246,0.0043952675,0.00048222806,0.07663071,0.29457727,0.35231805,0.22692235,0.002464488],"about_ca_topic_score_codex":0.0000050024055,"about_ca_topic_score_gemma":0.000011583661,"teacher_disagreement_score":0.5276869,"about_ca_system_score_codex":0.000048160982,"about_ca_system_score_gemma":0.00026143854,"threshold_uncertainty_score":0.41860127},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7749723,0.00056635373,0.22104001,0.0022939933,0.0005450424,0.000071496055,0.000001427877,0.00005110977,0.00045822558],"genre_scores_gemma":[0.9730105,0.00021389141,0.025157053,0.0006609035,0.0007003513,9.552131e-7,8.998883e-7,0.000018105697,0.00023737292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983249,0.00009277455,0.0004823843,0.0002272399,0.00031771968,0.0005550179],"domain_scores_gemma":[0.998985,0.00010276713,0.00030275006,0.00033934094,0.00011379376,0.00015634045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012656046,0.00018390223,0.00028175407,0.00016400336,0.000126869,0.000119186465,0.0008809999,0.0000944189,0.00006210815],"category_scores_gemma":[0.00008894605,0.00014835663,0.00012695996,0.00021290308,0.000047018395,0.000594506,0.00011917641,0.0015195041,0.000014941296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013325382,0.00023910777,0.0007034578,0.00003477289,0.00019697785,0.00027527937,0.0006764567,0.000018517616,0.056704696,0.87648493,0.00051018974,0.064022355],"study_design_scores_gemma":[0.005507668,0.0045922445,0.0077124774,0.00015702535,0.00013632415,0.009681186,0.00006190035,0.01424376,0.1028605,0.7948639,0.058714654,0.0014684038],"about_ca_topic_score_codex":0.0000052373243,"about_ca_topic_score_gemma":0.000018920853,"teacher_disagreement_score":0.19803813,"about_ca_system_score_codex":0.000029282783,"about_ca_system_score_gemma":0.00043683022,"threshold_uncertainty_score":0.6601574},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058936384,0.00018938314,0.9902184,0.00043402688,0.00028450094,0.00026039814,0.0000043818104,0.00013795467,0.0025772857],"genre_scores_gemma":[0.29325595,0.000005365251,0.70459193,0.00032955664,0.0003922409,0.000010901111,0.0000069056073,0.000013787093,0.0013933743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989188,0.00006525978,0.0002842076,0.00027104508,0.00020124945,0.00025944234],"domain_scores_gemma":[0.9989081,0.00041497953,0.00015183976,0.0004125713,0.00007908896,0.000033430922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058193086,0.00013048548,0.0001781642,0.0000672067,0.00021813101,0.0001232629,0.0008506525,0.000045570705,0.000008646706],"category_scores_gemma":[0.00001559816,0.000086668326,0.0001204891,0.000332567,0.000063952306,0.00024518042,0.00020095072,0.00006406157,0.0000047770554],"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.0000031873817,0.000065998844,0.000016617296,0.000025504114,0.000013983603,0.000002097809,0.00012474942,0.0010400862,0.00032683238,0.8355307,0.0015679473,0.1612823],"study_design_scores_gemma":[0.00036263975,0.000064121006,0.00008609111,0.00001234559,0.000010505988,0.00000744375,0.00007200261,0.9120925,0.0041744714,0.077084534,0.0058882986,0.00014506836],"about_ca_topic_score_codex":0.00023335188,"about_ca_topic_score_gemma":0.0000045484326,"teacher_disagreement_score":0.9110524,"about_ca_system_score_codex":0.000012981818,"about_ca_system_score_gemma":0.00002322372,"threshold_uncertainty_score":0.35342318},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06653594,0.0006333455,0.9310762,0.0010965411,0.00023093025,0.00020503174,8.922771e-7,0.00006668989,0.00015441618],"genre_scores_gemma":[0.9088916,0.00015801127,0.08906771,0.0006169593,0.0009380502,0.00001871618,0.0000014191492,0.000022258873,0.0002852403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858266,0.00006794773,0.00046897473,0.0001581928,0.00023442588,0.00048779446],"domain_scores_gemma":[0.9990203,0.00011502838,0.00031423336,0.00023524355,0.00022235591,0.00009286292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008571035,0.00013243337,0.00022954581,0.00016440485,0.00009807923,0.00014869698,0.00094313774,0.00006119386,0.00005928189],"category_scores_gemma":[0.000055590095,0.0001070105,0.00019175775,0.00016759324,0.000018235765,0.0009802275,0.00008561289,0.00040541275,0.00002081531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060442308,0.00029208514,0.00028850875,0.00012527223,0.0002976707,0.00004124935,0.00079164817,0.000021561975,0.029441366,0.66423064,0.0023143408,0.30209523],"study_design_scores_gemma":[0.0011660318,0.0018950655,0.00042497678,0.00019057114,0.00004677838,0.00074442406,0.00008168827,0.015940888,0.20510098,0.7603397,0.013527092,0.00054180465],"about_ca_topic_score_codex":0.00000766211,"about_ca_topic_score_gemma":0.0000018847368,"teacher_disagreement_score":0.84235567,"about_ca_system_score_codex":0.000060681516,"about_ca_system_score_gemma":0.00026377794,"threshold_uncertainty_score":0.43637615},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88499177,0.000090819245,0.06994611,0.0005530527,0.00012040044,0.0017275186,0.000055828667,0.00013057585,0.042383913],"genre_scores_gemma":[0.99155635,0.00016207322,0.0011933631,0.000034219043,0.000009442028,3.6142518e-7,0.000005932785,0.000004038977,0.0070342026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99854857,0.00041024917,0.00014468053,0.00022508539,0.000410908,0.00026053833],"domain_scores_gemma":[0.99852854,0.00019148726,0.00013220287,0.00038976493,0.0005514697,0.00020652854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036352768,0.00012484808,0.00013485116,0.0005514671,0.0009782033,0.00018040935,0.00077428186,0.00008440965,0.00002089805],"category_scores_gemma":[0.00006679527,0.00012166265,0.00003620277,0.0011287926,0.00028060545,0.002431653,0.00044338588,0.000299477,0.000019477457],"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.00004937101,0.000018010242,0.0005069481,0.000059500897,0.000031472144,0.00002635632,0.0015147887,0.000093095434,0.00086482556,0.9958597,0.00005701265,0.0009189252],"study_design_scores_gemma":[0.0064646387,0.0011808418,0.003223378,0.00016607302,0.0001225405,0.000761091,0.049505178,0.09927532,0.12612972,0.024979563,0.6865153,0.0016763671],"about_ca_topic_score_codex":0.00009040397,"about_ca_topic_score_gemma":0.00000948403,"teacher_disagreement_score":0.97088015,"about_ca_system_score_codex":0.00018307127,"about_ca_system_score_gemma":0.0002927502,"threshold_uncertainty_score":0.75236475},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06057825,0.00040049845,0.9334232,0.0052205184,0.0001371523,0.00013566138,0.000008997733,0.000012124594,0.00008360687],"genre_scores_gemma":[0.99677944,0.00006184496,0.0024638895,0.0003797914,0.0002160661,0.0000043979735,0.0000036160768,0.0000054631932,0.000085497704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909735,0.00014453076,0.00022315522,0.00010582605,0.0001735326,0.00025561365],"domain_scores_gemma":[0.99877506,0.000746663,0.00019361523,0.00013460797,0.00010052407,0.000049537255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017753363,0.000081401246,0.00012030518,0.000035501653,0.00015524929,0.000048785394,0.00029186357,0.000025774129,0.000012893094],"category_scores_gemma":[0.00024702091,0.000051556046,0.000060474365,0.00010549545,0.00004049266,0.00013298444,0.000029882141,0.00021655216,0.000002778566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056360757,0.00002559057,0.0000044019475,0.0000049834,0.000025038724,0.0000010553429,0.000067264955,0.00001692101,0.00017517609,0.9860992,0.00050255784,0.013021459],"study_design_scores_gemma":[0.0012728531,0.002229642,0.00018020048,0.00005507159,0.000022919286,0.00016782801,0.000049738726,0.113050014,0.002515668,0.85956895,0.020714136,0.00017295625],"about_ca_topic_score_codex":4.926613e-7,"about_ca_topic_score_gemma":6.8693174e-7,"teacher_disagreement_score":0.9362012,"about_ca_system_score_codex":0.000055220204,"about_ca_system_score_gemma":0.0001555712,"threshold_uncertainty_score":0.21023946},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8752076,0.011445314,0.03174267,0.0045684236,0.0037007516,0.0008688442,0.00010385109,0.00053615624,0.07182636],"genre_scores_gemma":[0.9556164,0.0033881743,0.03259326,0.0015426376,0.00456163,0.000031525615,0.0000429133,0.000064209,0.0021592642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811596,0.00016053277,0.00035278502,0.00048480672,0.00055001164,0.00033589365],"domain_scores_gemma":[0.9985917,0.00042564716,0.00019302378,0.0005310886,0.00013091294,0.00012762174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030163885,0.00022344594,0.00038283755,0.00013561564,0.00012530663,0.00012585071,0.0008727093,0.00007401164,0.00031467277],"category_scores_gemma":[0.000051016847,0.0001618888,0.00011210484,0.0007748438,0.00011013865,0.00051782915,0.00025408075,0.00020353304,0.00015540946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001744564,0.0005790317,0.00023333624,0.00039753536,0.000079082085,0.00022957657,0.00031638893,0.000055862456,0.0012829308,0.97353464,0.0033317548,0.019785386],"study_design_scores_gemma":[0.005921817,0.003687441,0.014152566,0.004097158,0.00025669267,0.00059765973,0.00071558735,0.009112679,0.21987617,0.62886655,0.109221384,0.0034943204],"about_ca_topic_score_codex":0.000009734566,"about_ca_topic_score_gemma":0.0000041219864,"teacher_disagreement_score":0.34466812,"about_ca_system_score_codex":0.00002470456,"about_ca_system_score_gemma":0.00009277252,"threshold_uncertainty_score":0.6601634},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074012466,0.0003164682,0.99010795,0.0009939789,0.000020403993,0.000314784,0.0000037060643,0.000075323296,0.00076613657],"genre_scores_gemma":[0.90363234,0.0000436651,0.095934056,0.00009878544,0.000069864254,0.00010425972,0.000004744921,0.0000054949123,0.00010677785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936974,0.0000204234,0.0001839327,0.00020180832,0.00010223261,0.00012184452],"domain_scores_gemma":[0.99954313,0.000034870023,0.00006763745,0.00023583694,0.000051342264,0.0000672102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011817299,0.000072953255,0.000102916114,0.00004262263,0.0001215688,0.000021269932,0.0002462386,0.00003852454,0.000009214333],"category_scores_gemma":[0.000009963179,0.00006481243,0.0000319828,0.00032067852,0.000032470205,0.00016547697,0.000059819475,0.00006632631,0.00005922762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011597317,0.00009231937,0.0000071663576,0.000028306493,0.0000063797643,2.5799213e-7,0.00023854683,0.00022684672,0.002211737,0.9888001,0.000011000105,0.00837619],"study_design_scores_gemma":[0.0009976145,0.0002800816,0.0005457553,0.000056118468,0.00003569482,0.00005734908,0.000047367022,0.16845867,0.05420853,0.76425904,0.0105922185,0.00046158573],"about_ca_topic_score_codex":0.000011972888,"about_ca_topic_score_gemma":6.236545e-7,"teacher_disagreement_score":0.8962311,"about_ca_system_score_codex":0.0000091218335,"about_ca_system_score_gemma":0.000048233705,"threshold_uncertainty_score":0.26429743},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.7633134e-7,0.00062779785,0.08711372,0.0005755805,0.0006541882,0.00004739926,0.0000026587,0.00016467946,0.9108135],"genre_scores_gemma":[0.000057465866,0.000065812754,0.020230833,0.00030153958,0.00026845653,0.00000130277,0.0000040401815,0.000011990932,0.97905856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999204,0.000010183652,0.00012062032,0.0003515691,0.00018425523,0.00012937885],"domain_scores_gemma":[0.9991869,0.00005842062,0.00005849577,0.00058298535,0.000046529356,0.00006666882],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0000965337,0.00016815169,0.00019321278,0.00005260535,0.00004711929,0.00018920434,0.00062047667,0.00012919621,0.0032913333],"category_scores_gemma":[0.0000060158527,0.00014196926,0.0001163434,0.000023560875,0.000025710964,0.00011086547,0.00031940706,0.00016798003,0.00083546474],"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":[2.7906114e-7,0.0000026878247,6.6151784e-8,0.000009420281,0.0000151682025,0.00007201861,0.000018112698,4.2587575e-7,0.0000068350128,0.9825943,0.0033599925,0.013920682],"study_design_scores_gemma":[0.0000437472,0.000018396659,7.32733e-7,0.000040682717,0.0000053617573,0.000023570252,0.0000017002087,0.00035322618,0.00024620688,0.167451,0.83158886,0.00022651324],"about_ca_topic_score_codex":0.0000019347417,"about_ca_topic_score_gemma":0.0000023934517,"teacher_disagreement_score":0.8282289,"about_ca_system_score_codex":0.000013742944,"about_ca_system_score_gemma":0.00006749681,"threshold_uncertainty_score":0.9999425},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094614625,0.00038927837,0.8993603,0.0014798224,0.000083108476,0.000351028,0.000023466117,0.00012367182,0.0035747075],"genre_scores_gemma":[0.979972,0.000044140103,0.019384764,0.00023217736,0.00015124313,0.000037438826,0.000004066995,0.000005663032,0.00016847941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994049,0.000013498154,0.0001578868,0.00019593444,0.000105969244,0.00012181511],"domain_scores_gemma":[0.99952656,0.000074217576,0.000063501306,0.00023040888,0.000031229345,0.00007408818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000077991404,0.00007708828,0.00010290676,0.00005669769,0.000107168264,0.00002639789,0.00031437253,0.0000394081,0.000020686131],"category_scores_gemma":[0.000009948097,0.00006687866,0.00003564849,0.0002802608,0.00002760819,0.00013991637,0.00008114915,0.00007696764,0.00010473527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005299118,0.000108933324,0.0000071866907,0.000011546471,0.00000679962,6.054338e-7,0.00011883717,0.00017550627,0.0007107133,0.98841447,0.000073330215,0.010366783],"study_design_scores_gemma":[0.005831702,0.0018653804,0.0036785682,0.00014131934,0.000119771,0.00017516228,0.00016498704,0.09583759,0.28445283,0.4764915,0.12923805,0.0020031412],"about_ca_topic_score_codex":0.000006061696,"about_ca_topic_score_gemma":2.2402652e-7,"teacher_disagreement_score":0.8853574,"about_ca_system_score_codex":0.0000062758377,"about_ca_system_score_gemma":0.00003052148,"threshold_uncertainty_score":0.27272326},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15142946,0.012788692,0.81499934,0.011459297,0.00015096704,0.0013839656,0.000039158567,0.00086671935,0.0068823937],"genre_scores_gemma":[0.96357197,0.00056690566,0.03349651,0.00096166425,0.00026340527,0.00006426368,0.000016796752,0.0000107486085,0.0010477178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989601,0.000033211116,0.00024593913,0.00040140966,0.00013601007,0.00022335882],"domain_scores_gemma":[0.99923575,0.000074741045,0.00008712126,0.0003797597,0.000050873034,0.0001717721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018218056,0.00015216292,0.00018521424,0.00008417903,0.00046674858,0.00012293855,0.00038753945,0.00007321972,0.000023812423],"category_scores_gemma":[0.000011857621,0.00013796987,0.000034472556,0.0003985909,0.000039682673,0.0003032392,0.00017041662,0.00014561313,0.00006597038],"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.0000032503106,0.00012858606,0.0000621679,0.00001683425,0.0000079378215,0.0000011586579,0.00033897208,0.0000061351057,0.00041926166,0.8587762,0.0007216222,0.13951784],"study_design_scores_gemma":[0.001308489,0.0005742416,0.0061887843,0.000048975984,0.000076855154,0.0001116898,0.00013764438,0.2637599,0.005717977,0.28158623,0.43942615,0.001063033],"about_ca_topic_score_codex":0.0000028464199,"about_ca_topic_score_gemma":7.6366445e-7,"teacher_disagreement_score":0.81214255,"about_ca_system_score_codex":0.000007249789,"about_ca_system_score_gemma":0.000020966529,"threshold_uncertainty_score":0.56262475},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044709593,0.00076535804,0.95202684,0.0015572795,0.000060758888,0.00033989153,0.0000075245366,0.00007001363,0.0004627413],"genre_scores_gemma":[0.92463815,0.00015921846,0.074609384,0.00012822363,0.00017415333,0.00007931407,0.0000025458523,0.0000075118587,0.00020151962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945635,0.00001626188,0.0001535108,0.00016953994,0.0000751756,0.00012918875],"domain_scores_gemma":[0.9994796,0.000099098186,0.0000492572,0.00027141825,0.000044045533,0.000056613535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015797296,0.0000674996,0.000077231096,0.000021349639,0.00029886246,0.000058823112,0.0003669647,0.000025946965,0.00000318546],"category_scores_gemma":[0.000019311652,0.000046560002,0.00002958925,0.00021492653,0.000042350526,0.00011524577,0.00008430826,0.00007550907,0.000020350923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014365353,0.000026222817,0.0000027134104,0.0000046220357,0.0000072615526,1.8000027e-7,0.000192942,0.00011843379,0.0033605718,0.98855066,0.0000025404177,0.0077324226],"study_design_scores_gemma":[0.0022221906,0.0002087844,0.0019795403,0.000055551336,0.00004266132,0.00006897002,0.00017357575,0.09981563,0.13893872,0.63892955,0.116898395,0.0006663995],"about_ca_topic_score_codex":0.0000072192097,"about_ca_topic_score_gemma":0.0000016011936,"teacher_disagreement_score":0.8799285,"about_ca_system_score_codex":0.0000067577403,"about_ca_system_score_gemma":0.000038580238,"threshold_uncertainty_score":0.22986387},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000037950433,0.000022695413,0.6136485,0.00019690748,0.00010290369,0.00018906486,0.000008020741,0.00020968817,0.38561845],"genre_scores_gemma":[0.0009028476,0.000007217474,0.855472,0.0025243112,0.00023825206,0.000037116697,0.00001578793,0.000085904496,0.14071651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972306,0.00018538543,0.000546533,0.00087591825,0.0007265701,0.00043502558],"domain_scores_gemma":[0.9964592,0.0013630376,0.0004597739,0.0013480085,0.00011813432,0.00025186132],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080545386,0.0005692529,0.0008900884,0.00005741843,0.00019563953,0.00022355642,0.0009398485,0.00021714914,0.0003512377],"category_scores_gemma":[0.000069735295,0.00050383015,0.000916986,0.00006356594,0.00045243703,0.00007320691,0.00031280876,0.0007183899,0.0001587761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026066523,0.00003189609,9.299679e-8,0.000063868734,0.000082312676,0.0000092040555,0.0005433828,0.000020875645,0.00006763898,0.8271451,0.00019790251,0.17183511],"study_design_scores_gemma":[0.00020829902,0.00012038232,4.1885895e-7,0.0001612977,0.00005668492,0.000007245309,0.000044078402,0.2241298,0.0005009431,0.76505196,0.009172776,0.0005461423],"about_ca_topic_score_codex":0.0000049991418,"about_ca_topic_score_gemma":3.0676765e-7,"teacher_disagreement_score":0.24490193,"about_ca_system_score_codex":0.00015873,"about_ca_system_score_gemma":0.00021035579,"threshold_uncertainty_score":0.9997413},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.2835665e-7,0.000065283624,0.49399588,0.000015920576,0.00004934758,0.0002134663,0.000029156608,0.00008588685,0.5055449],"genre_scores_gemma":[0.000086858134,0.00003368225,0.06721081,0.00004491751,0.00006947573,0.0000018967642,0.000010571761,0.000017245678,0.93252456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989608,0.000086225846,0.00020333794,0.00042569364,0.00017980418,0.0001441157],"domain_scores_gemma":[0.99845445,0.00019020366,0.0002896456,0.00080682716,0.00010729746,0.00015157946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000173139,0.00022548481,0.00038033925,0.00012842889,0.000098632874,0.000032793374,0.0014999171,0.00017262412,0.0000028926365],"category_scores_gemma":[0.00000918416,0.0002584533,0.0002123346,0.000021633221,0.00015527634,0.00009177855,0.0007545656,0.00028486238,0.000016678021],"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.0000050083936,0.000005266467,3.855432e-8,0.00012889481,0.00006227172,0.000026470081,0.000042941498,0.000001158387,0.00003494854,0.9488423,0.0013924075,0.049458303],"study_design_scores_gemma":[0.00017068109,0.000032416207,4.3921375e-7,0.000041109462,0.00009354699,0.0000067959068,0.000007745799,0.0016007244,0.0012618629,0.002577477,0.9939365,0.00027072537],"about_ca_topic_score_codex":0.000011283289,"about_ca_topic_score_gemma":7.781504e-8,"teacher_disagreement_score":0.99254405,"about_ca_system_score_codex":0.000042157277,"about_ca_system_score_gemma":0.0000857817,"threshold_uncertainty_score":0.99998677},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002502591,0.0007280417,0.3307659,0.004963135,0.003930517,0.0014307889,0.0002554914,0.0006409227,0.6547826],"genre_scores_gemma":[0.023380347,0.00019537425,0.01523582,0.0023481662,0.0006435208,0.000052206222,0.00030297175,0.000050734634,0.95779085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998431,0.00005790271,0.0005010908,0.00036774218,0.00038226784,0.00025994366],"domain_scores_gemma":[0.9988586,0.000033219374,0.00018692372,0.00060234114,0.00016648853,0.00015246202],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023983922,0.0002670171,0.00033814137,0.00031202802,0.00015157548,0.000044599885,0.0010103518,0.00019961096,0.00017829203],"category_scores_gemma":[0.000012459754,0.00024715904,0.0002198947,0.00035956805,0.000026738446,0.00045859485,0.00006599677,0.00027291934,0.0004104961],"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.000015810863,0.00015129303,0.00020208534,0.00008453164,0.000100582634,0.000015231183,0.0010517753,0.00003600475,0.00024022175,0.78655523,0.18421789,0.027329333],"study_design_scores_gemma":[0.00056545134,0.00047181261,0.0033460774,0.00022758097,0.000062741965,0.000022548173,0.000028525474,0.0012938284,0.0013365776,0.16539209,0.8263735,0.000879278],"about_ca_topic_score_codex":0.000003541089,"about_ca_topic_score_gemma":0.000008692214,"teacher_disagreement_score":0.64215565,"about_ca_system_score_codex":0.000045552704,"about_ca_system_score_gemma":0.00034483886,"threshold_uncertainty_score":0.9999981},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010121093,0.0005463365,0.13311578,0.002728259,0.0010781884,0.00019750933,0.000025481777,0.00029881293,0.8619995],"genre_scores_gemma":[0.00032910914,0.00041032484,0.0032457819,0.0003367846,0.00046876125,1.3834843e-7,0.0000086406235,0.000023851457,0.9951766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987989,0.00006704433,0.000118726624,0.00045698867,0.00026518555,0.0002931765],"domain_scores_gemma":[0.99847245,0.00019033876,0.00014706768,0.000940291,0.0001573035,0.00009256246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022049672,0.0003268737,0.00023681931,0.0001102021,0.0009877407,0.00023338498,0.0018555993,0.00029666742,0.0007158547],"category_scores_gemma":[0.000017221846,0.00024085451,0.00018823962,0.00009568481,0.00066284277,0.0003783572,0.00057018455,0.00043253182,0.00046900692],"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.000036620317,0.0000028684408,2.0509026e-7,0.000008480628,0.000060996565,0.00007402473,0.00060845545,0.0000027853341,0.000007633557,0.98030347,0.012828075,0.006066373],"study_design_scores_gemma":[0.00006247913,0.00006436329,7.3027996e-7,0.00002179964,0.000017856955,0.000029223262,0.000028459788,0.000032634005,0.00021258008,0.31839663,0.680914,0.00021928483],"about_ca_topic_score_codex":0.0000031481432,"about_ca_topic_score_gemma":0.000058637936,"teacher_disagreement_score":0.6680859,"about_ca_system_score_codex":0.00006631451,"about_ca_system_score_gemma":0.00013658962,"threshold_uncertainty_score":0.9821762},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013231714,0.00009918943,0.97691,0.001535573,0.00004976543,0.000463323,0.0000028789154,0.00003264285,0.007674945],"genre_scores_gemma":[0.63430035,0.0000037442182,0.36513907,0.00037022136,0.0000044383805,0.000119558674,2.5963212e-7,0.0000037513003,0.0000586444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971015,0.0013745734,0.00036421025,0.0003253425,0.00060142553,0.00023299089],"domain_scores_gemma":[0.9901966,0.009123155,0.00015395312,0.0004820953,0.000015274241,0.000028925155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012995796,0.00011334706,0.00025685318,0.00011205312,0.0007677837,0.00011762492,0.0019664075,0.000023926154,0.000054867276],"category_scores_gemma":[0.0005894311,0.00006065715,0.000046965655,0.0013017951,0.0012416055,0.00007076656,0.0004945265,0.00025083686,0.000016212605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019706065,0.00012986668,3.7483332e-7,0.000011973456,0.000004301256,6.2594825e-7,0.0025642735,0.0016915862,0.0010354017,0.9746313,0.0000037985856,0.019906782],"study_design_scores_gemma":[0.00019340088,0.00006851089,0.000006039418,0.000009975543,0.0000048281913,0.000008072103,0.00035244762,0.49443927,0.00022031412,0.50460505,0.000034127985,0.00005796854],"about_ca_topic_score_codex":0.0000012901509,"about_ca_topic_score_gemma":3.019652e-7,"teacher_disagreement_score":0.6210686,"about_ca_system_score_codex":0.000018757355,"about_ca_system_score_gemma":0.000031195537,"threshold_uncertainty_score":0.5905249},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048809048,0.00005675007,0.94693404,0.0024979645,0.00031315204,0.0011553075,0.000056683377,0.000007728955,0.0001693122],"genre_scores_gemma":[0.8914047,0.000002807384,0.106216885,0.00007351622,0.00012968441,0.00046860968,0.0000035861653,0.00002160059,0.0016786001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976154,0.000329373,0.000727802,0.00013466437,0.0009025655,0.00029019036],"domain_scores_gemma":[0.996508,0.0016761373,0.0004752152,0.0004964523,0.00076378824,0.000080375175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006387926,0.000094985335,0.0002780744,0.00024669687,0.0008118968,0.00012561755,0.0012008616,0.00003350169,0.00006794037],"category_scores_gemma":[0.0006271068,0.00006117214,0.00029766368,0.0004927312,0.00012585631,0.00038056413,0.00034644076,0.00038959013,0.0000014952021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029366557,0.0054189186,0.00008620348,0.0052654054,0.0004809392,0.0000143769485,0.01690979,0.007878142,0.022301935,0.9180817,0.01748183,0.0057871193],"study_design_scores_gemma":[0.0009205414,0.0015519212,0.000058917856,0.00014004415,0.00004387226,0.0002619525,0.0021286875,0.299066,0.0049877157,0.68900865,0.0017071184,0.00012457928],"about_ca_topic_score_codex":0.0000014734618,"about_ca_topic_score_gemma":0.000002104408,"teacher_disagreement_score":0.84259564,"about_ca_system_score_codex":0.00010624528,"about_ca_system_score_gemma":0.00031856573,"threshold_uncertainty_score":0.6244536},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20903917,0.18081783,0.5894568,0.0105119245,0.0017494957,0.0044015558,0.00005977491,0.0006949558,0.003268501],"genre_scores_gemma":[0.96248436,0.030400414,0.0010245512,0.0049471622,0.00065833284,0.00031843808,0.00005326757,0.000049780447,0.0000636851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950301,0.0013388639,0.0009762515,0.0009365107,0.0010662617,0.0006519801],"domain_scores_gemma":[0.9969339,0.0008089907,0.00041132612,0.0013653489,0.00019389432,0.00028655675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014769662,0.00045031647,0.0016044936,0.000063189495,0.0003454003,0.00004715285,0.0019525925,0.00003141461,0.00018628425],"category_scores_gemma":[0.000690148,0.00038944522,0.0008801304,0.002140386,0.00014962906,0.000583761,0.0011926758,0.0008649777,0.00009327913],"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.000006731653,0.00077161205,0.000031954052,0.002585299,0.000054520486,0.000013565903,0.00010835483,0.00026148386,0.002926065,0.9264105,0.0027206312,0.06410928],"study_design_scores_gemma":[0.00077628455,0.0008956121,0.00018209608,0.006669134,0.00062451843,0.00007828432,0.00003214911,0.7413203,0.0034699386,0.18732078,0.056952734,0.0016781563],"about_ca_topic_score_codex":0.000020217676,"about_ca_topic_score_gemma":9.776015e-7,"teacher_disagreement_score":0.7534452,"about_ca_system_score_codex":0.00009722722,"about_ca_system_score_gemma":0.00018720674,"threshold_uncertainty_score":0.99985576},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19999535,0.003489183,0.76698786,0.018777564,0.000149486,0.008566285,0.00010532025,0.00015698482,0.0017719609],"genre_scores_gemma":[0.98967856,0.00007254891,0.0064118737,0.00019774809,0.00005815027,0.003240937,0.000010038127,0.000006324977,0.00032380185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993901,0.00008330778,0.00016170485,0.00014532446,0.00011357388,0.00010595893],"domain_scores_gemma":[0.9994843,0.00013386257,0.00007314973,0.00025272692,0.000040197086,0.000015749352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056785217,0.000053891934,0.000057095396,0.000041430747,0.0005672177,0.000038899714,0.0005315552,0.00001258996,0.000002539139],"category_scores_gemma":[0.000009924818,0.000032307675,0.000029699831,0.00037116618,0.000043997283,0.00009883228,0.00011544766,0.00008294859,0.0000014285251],"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.000005501025,0.00006429202,0.000020936553,0.00002098585,0.0000058114715,4.9927216e-8,0.0016551504,0.00034902545,0.0004331971,0.983338,0.00012758702,0.013979454],"study_design_scores_gemma":[0.00081667205,0.00032104074,0.0005764252,0.000015703536,0.000030373496,0.000018326795,0.0038536277,0.41620192,0.0047050067,0.33513024,0.23803274,0.00029790428],"about_ca_topic_score_codex":0.000007966694,"about_ca_topic_score_gemma":0.000011829507,"teacher_disagreement_score":0.7896832,"about_ca_system_score_codex":0.0000066782486,"about_ca_system_score_gemma":0.000037432943,"threshold_uncertainty_score":0.4362637},"labels":[],"label_agreement":null},{"id":"W4226026780","doi":"10.1007/s11075-022-01304-z","title":"Approximating the diagonal of a Hessian: which sample set of points should be used","year":2022,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Hessian matrix; Mathematics; Diagonal; Diagonal matrix; Matrix (chemical analysis); Main diagonal; Simplex; Combinatorics; Sample (material); Band matrix; Set (abstract data type); Block matrix; Applied mathematics; Mathematical analysis; Symmetric matrix; Square matrix; Geometry; Eigenvalues and eigenvectors; Computer science","score_opus":0.04604667643643701,"score_gpt":0.2855975527531398,"score_spread":0.2395508763167028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226026780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067286496,0.00010615245,0.9854491,0.0061813765,0.00040341605,0.00029526808,0.00019586891,0.00009733509,0.0005428776],"genre_scores_gemma":[0.72828084,0.0000033478286,0.27063927,0.00068623456,0.00016072932,0.00011078606,0.000026558011,0.000023506467,0.00006873416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971985,0.00054436305,0.0005615368,0.00039399197,0.0009424715,0.00035910064],"domain_scores_gemma":[0.9974886,0.0012896371,0.00035487048,0.00067243556,0.00009843288,0.000096002754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016608031,0.00018248138,0.00039715908,0.0000819643,0.0003227069,0.0000405915,0.0016307082,0.00004567817,0.00035614587],"category_scores_gemma":[0.00031110435,0.00013429689,0.00015991477,0.0013656942,0.000114127266,0.00018808228,0.00095483597,0.00042535318,0.0000042695597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011367826,0.0014139521,0.0018782917,0.00025041902,0.00031714444,0.00004328491,0.018112868,0.0050713597,0.0019494223,0.47633633,0.0018626325,0.49265063],"study_design_scores_gemma":[0.0007144202,0.00042097532,0.0005676628,0.000019292533,0.000024022116,0.000058789807,0.00086820236,0.93535876,0.004394911,0.045969974,0.0112379985,0.00036497338],"about_ca_topic_score_codex":0.00012874881,"about_ca_topic_score_gemma":0.0000010725518,"teacher_disagreement_score":0.9302874,"about_ca_system_score_codex":0.00003661431,"about_ca_system_score_gemma":0.00011994835,"threshold_uncertainty_score":0.5476468},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008787218,0.0002824996,0.9938064,0.0007607204,0.0029554602,0.0010125793,0.000028842062,0.00021345115,0.0009312322],"genre_scores_gemma":[0.015325739,0.000069544054,0.98036104,0.002213239,0.00092144846,0.000112566806,0.00004256285,0.00006730819,0.00088657025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99615425,0.000051280298,0.0005423708,0.001634483,0.00091142213,0.0007061747],"domain_scores_gemma":[0.9973719,0.0005117309,0.0003649438,0.0013473766,0.00023970408,0.00016430437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014028619,0.0005224834,0.0005581963,0.0006843602,0.0005744328,0.00047680235,0.0034908555,0.0001744225,0.00013838266],"category_scores_gemma":[0.00014130813,0.0005147646,0.00023569171,0.0004126229,0.00027102977,0.00066075835,0.0013807532,0.000592671,0.000025382304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011991935,0.000026985897,2.5329442e-7,0.00003912183,0.0000129889995,0.00008130606,0.0002499187,0.031032331,0.000025436404,0.7288202,0.00003271161,0.23966676],"study_design_scores_gemma":[0.00033704328,0.00017083652,3.1377064e-7,0.00005132862,0.000008522568,0.000061948245,8.974389e-8,0.49008167,0.00046650472,0.5058496,0.0026032412,0.00036894303],"about_ca_topic_score_codex":0.000008977219,"about_ca_topic_score_gemma":0.000007181112,"teacher_disagreement_score":0.4590493,"about_ca_system_score_codex":0.00035989992,"about_ca_system_score_gemma":0.0006129973,"threshold_uncertainty_score":0.9997304},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014721755,0.0022022608,0.2595741,0.00009527133,0.00030546336,0.0009497157,0.000021492531,0.00016892275,0.7352106],"genre_scores_gemma":[0.003308964,0.00032306553,0.08722856,0.00028446136,0.00010784353,0.00009196576,0.000014214869,0.00008092736,0.90856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801147,0.0001488853,0.00066073047,0.0005779977,0.000262001,0.0003389435],"domain_scores_gemma":[0.99807185,0.00045564413,0.00028999208,0.0010258661,0.000047114027,0.00010951629],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014996576,0.00041181032,0.0009925087,0.000803129,0.00005428849,0.0001864843,0.0010946295,0.00033153346,0.00011709898],"category_scores_gemma":[0.0000673572,0.00036314243,0.00014826046,0.00033457496,0.00020620979,0.00021386596,0.00049590395,0.0004845905,0.00005618649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004965517,0.00007891094,0.00005524245,0.00022696485,0.00016846615,0.000078699035,0.0052218568,0.000008722718,0.000004979681,0.99143153,0.00028193145,0.0024377252],"study_design_scores_gemma":[0.00031223154,0.00003817323,0.000030796833,0.00033579962,0.00015185027,0.000018960558,0.00009593497,0.015201813,0.00017898179,0.9785282,0.0045687524,0.0005385209],"about_ca_topic_score_codex":0.000009634542,"about_ca_topic_score_gemma":0.000035900248,"teacher_disagreement_score":0.1733494,"about_ca_system_score_codex":0.00009067189,"about_ca_system_score_gemma":0.00016868248,"threshold_uncertainty_score":0.99988204},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025606435,0.000037740483,0.97033,0.00005747072,0.000029194094,0.00034184128,0.000012505916,0.000048426136,0.003536358],"genre_scores_gemma":[0.97457355,0.0000010678618,0.025258686,0.000056878347,0.0000042348966,0.00003153768,0.0000011225427,0.000002331892,0.000070561895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99893755,0.0002352025,0.00029796635,0.00022126791,0.00017975758,0.00012824438],"domain_scores_gemma":[0.9988117,0.000111509544,0.00012198307,0.0007660961,0.0001468024,0.00004186995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019877863,0.00007346287,0.00020566065,0.00011455393,0.000042235297,0.000020572998,0.00054834515,0.000035147303,0.0000694782],"category_scores_gemma":[0.000030753334,0.000047241167,0.000101030615,0.0011986922,0.000025608475,0.000064428765,0.00008019983,0.000042865133,0.000005481301],"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.000004718966,0.00016793663,0.0016456625,0.000021280024,0.00011054601,2.2879527e-7,0.0005440476,0.00086389045,0.00496516,0.9899692,0.000042632,0.0016647005],"study_design_scores_gemma":[0.00018790748,0.00027446865,0.0033557154,0.000017551882,0.00026051735,0.0000031413672,0.0007382984,0.34427947,0.6267168,0.007734669,0.01604886,0.0003826307],"about_ca_topic_score_codex":0.00009109066,"about_ca_topic_score_gemma":0.000026255453,"teacher_disagreement_score":0.98223454,"about_ca_system_score_codex":0.000014652686,"about_ca_system_score_gemma":0.000026900856,"threshold_uncertainty_score":0.1926439},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004217406,0.00036128637,0.68873614,0.000067825036,0.0020968416,0.00017359381,0.00022697775,0.00015635921,0.30817673],"genre_scores_gemma":[0.00011735864,0.00025225783,0.46139583,0.0000813339,0.00025995294,0.000008312364,0.00001824643,0.000052402054,0.5378143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983664,0.00004056,0.00043075744,0.0005099783,0.00031296132,0.00033930206],"domain_scores_gemma":[0.99826455,0.0003038811,0.00021319,0.001033569,0.000085023894,0.00009979382],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055672834,0.00037006667,0.0003932567,0.00019582134,0.0001022929,0.00016370136,0.0012061655,0.00035430669,0.0007972628],"category_scores_gemma":[0.00008980738,0.00037597556,0.000066993554,0.000052500145,0.0002739542,0.00024279131,0.0006182815,0.00095766614,0.0003812949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012982851,0.000008461615,0.0000028194024,0.000053789605,0.000019173325,0.00023770765,0.00020060441,0.00000288647,0.00001712736,0.97741264,0.0002772503,0.021754585],"study_design_scores_gemma":[0.00008992839,0.000036504924,0.000015042955,0.000043000167,0.0000102389295,0.000027130356,0.0000039260285,0.000116502764,0.00009740183,0.7151205,0.2841069,0.00033291942],"about_ca_topic_score_codex":0.0000041733056,"about_ca_topic_score_gemma":0.000040113093,"teacher_disagreement_score":0.28382966,"about_ca_system_score_codex":0.000044885495,"about_ca_system_score_gemma":0.0001240653,"threshold_uncertainty_score":0.9998692},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000957459,0.00013492844,0.17102732,0.000034925,0.00035850087,0.000094760864,0.0000059868125,0.00008243008,0.8282516],"genre_scores_gemma":[0.00032174625,0.000027729151,0.04429551,0.00005060745,0.00016488145,0.0000013070307,0.0000011446532,0.0000134598195,0.9551236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910754,0.00000887808,0.00026235395,0.00028933247,0.00019595075,0.00013594511],"domain_scores_gemma":[0.99891144,0.000051070532,0.000179704,0.0007239846,0.00007842277,0.000055353834],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001909618,0.00017443224,0.00026792026,0.000109525354,0.000029567833,0.000029733214,0.00093913986,0.00015135448,0.0021444538],"category_scores_gemma":[0.0000052949395,0.00013595275,0.00013948107,0.00002252172,0.00009007118,0.00009784995,0.00035168478,0.00009875705,0.0007518089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018862042,0.000004656163,1.399765e-7,0.000029349261,0.000011905072,0.00001867887,0.00005536128,9.440633e-8,0.000017087865,0.97762734,0.0020195276,0.020214003],"study_design_scores_gemma":[0.00012306019,0.00019659693,0.0000011601514,0.00012598175,0.000016012926,0.00005738003,0.0000017076417,0.0019398169,0.0018650764,0.6086438,0.38670275,0.00032665345],"about_ca_topic_score_codex":0.0000022860681,"about_ca_topic_score_gemma":0.0000014752136,"teacher_disagreement_score":0.38468322,"about_ca_system_score_codex":0.0000101431115,"about_ca_system_score_gemma":0.000052634558,"threshold_uncertainty_score":0.99876773},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.4750826e-7,0.00013851041,0.25295985,0.00009277262,0.0008970486,0.000089551955,0.0000017626269,0.0002484458,0.74557173],"genre_scores_gemma":[0.000046629102,0.000024398989,0.08141089,0.00075579353,0.00138806,0.0000020386474,0.0000021753442,0.000019154519,0.91635084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989251,0.000012451861,0.00020003384,0.0004275553,0.00019046107,0.00024439537],"domain_scores_gemma":[0.99880964,0.00006563887,0.000105413965,0.0008283853,0.00009659576,0.00009435678],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00022302182,0.00023102092,0.00022618263,0.00004679532,0.00009545895,0.000104763356,0.0010625658,0.00021206215,0.005008525],"category_scores_gemma":[0.0000060306756,0.0001922266,0.0001261737,0.000026386482,0.00006128328,0.00012209517,0.00042504605,0.00017842025,0.0044221813],"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.000001536031,0.000002476496,1.081913e-7,0.0000046094137,0.000018245635,0.0000155035,0.000027245705,0.00000780798,4.2082735e-7,0.9197441,0.056821257,0.023356723],"study_design_scores_gemma":[0.00005976559,0.0000314591,4.8502847e-7,0.00002960323,0.0000042810625,0.000009126696,3.0156377e-7,0.0063145086,0.000013533663,0.35970053,0.63362956,0.00020682617],"about_ca_topic_score_codex":0.0000013271845,"about_ca_topic_score_gemma":0.0000027118792,"teacher_disagreement_score":0.57680833,"about_ca_system_score_codex":0.00001550674,"about_ca_system_score_gemma":0.00003831869,"threshold_uncertainty_score":0.996353},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005970382,0.00036639912,0.3153157,0.00016683736,0.00022858853,0.00020376066,0.000010473069,0.00011866709,0.68352985],"genre_scores_gemma":[0.0030770216,0.00007688216,0.06770059,0.000048928247,0.0001828472,0.0000026586379,0.0000037991897,0.0000129509845,0.92889434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994391,0.0000063319458,0.00015298052,0.00023168528,0.000104049475,0.00006581892],"domain_scores_gemma":[0.9993213,0.000052121213,0.00011769277,0.00040712592,0.000063877415,0.000037916656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012258059,0.00010590399,0.00014458965,0.000062126805,0.000025352705,0.000023972587,0.00032072962,0.00010364988,0.00041171152],"category_scores_gemma":[0.000005873364,0.00008845649,0.00003886701,0.000015384761,0.0000680604,0.00008557748,0.00017101319,0.00005856498,0.0001389415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015188883,0.0000030708013,5.7346296e-7,0.000024718269,0.000008222361,5.923132e-7,0.00005935867,8.644482e-8,0.00008238294,0.98685056,0.00056943885,0.012399483],"study_design_scores_gemma":[0.00031339072,0.0002046075,0.00005530901,0.00012068514,0.000023713104,0.000026999214,0.0000038627886,0.0099095395,0.0033476274,0.69934857,0.2861812,0.0004644623],"about_ca_topic_score_codex":0.000002476553,"about_ca_topic_score_gemma":8.727739e-7,"teacher_disagreement_score":0.287502,"about_ca_system_score_codex":0.000006233208,"about_ca_system_score_gemma":0.000017112288,"threshold_uncertainty_score":0.45079523},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14473292,0.0008891476,0.8532016,0.0010176026,0.00009780622,0.000022031769,0.000011700777,0.000007368578,0.000019802297],"genre_scores_gemma":[0.16564162,0.00025021893,0.83323926,0.00031673702,0.00042187507,9.554949e-7,0.000009351324,0.0000052805312,0.00011470645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989533,0.00010851199,0.0003776704,0.00017709006,0.00028024122,0.00010321774],"domain_scores_gemma":[0.9989445,0.00021321954,0.000227279,0.00010514418,0.00039762515,0.00011221974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006971951,0.00009002392,0.00029304897,0.00018621185,0.00012782335,0.00018101046,0.00013884086,0.00004327909,0.000054360637],"category_scores_gemma":[0.0001351856,0.000070297385,0.00015067897,0.00067406334,0.000011782869,0.00040393323,0.000103203165,0.00012560368,0.0000017588006],"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.0002041656,0.0014382054,0.009881015,0.00016436244,0.011862582,0.0014056597,0.0031838645,0.0077835633,0.02732402,0.16495337,0.00010126222,0.77169794],"study_design_scores_gemma":[0.000476785,0.00005225395,0.0077664107,0.000014080373,0.00032018652,0.00018566864,0.000027662638,0.98571956,0.00068497105,0.0043474077,0.00030173012,0.00010325907],"about_ca_topic_score_codex":0.0000027649464,"about_ca_topic_score_gemma":0.0000014481976,"teacher_disagreement_score":0.977936,"about_ca_system_score_codex":0.000010191875,"about_ca_system_score_gemma":0.000106997526,"threshold_uncertainty_score":0.28666443},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.325844e-10,0.00021897629,0.5003919,0.00012197721,0.00024403272,0.000027231015,3.067342e-7,0.00036082708,0.49863473],"genre_scores_gemma":[2.460596e-7,0.0000101645655,0.48904684,0.00023933461,0.00028714488,0.0000021230333,3.6492892e-7,0.000039613686,0.5103741],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928147,0.00011519926,0.00008540548,0.00026872012,0.00009803701,0.00015116941],"domain_scores_gemma":[0.99932545,0.000048415735,0.00004966099,0.00050754286,0.0000049251335,0.000063995925],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00021045018,0.0001272763,0.00016694113,0.00009209989,0.000015670423,0.000048324568,0.0008131354,0.00012268557,0.018344143],"category_scores_gemma":[0.000009463168,0.00009683413,0.000064093874,0.00014527893,0.000015107814,0.000041263167,0.00012022083,0.00011010144,0.0015021622],"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":[9.4916714e-8,0.000008995841,7.623249e-8,0.0000035546302,0.000007002828,0.0000026279465,0.0000060398993,6.5035266e-7,8.709779e-7,0.22250307,0.37463614,0.4028309],"study_design_scores_gemma":[0.000039194212,0.000007763478,4.5758344e-7,0.000008062011,0.0000019020334,0.000007789582,4.5790537e-7,0.0053147827,0.00008833233,0.0023042627,0.99208426,0.0001427276],"about_ca_topic_score_codex":0.000019354009,"about_ca_topic_score_gemma":7.276735e-7,"teacher_disagreement_score":0.61744815,"about_ca_system_score_codex":0.000006960576,"about_ca_system_score_gemma":0.000020627002,"threshold_uncertainty_score":0.99927527},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08104477,0.00036775196,0.87931776,0.016340792,0.0048785433,0.0016463636,0.0003726966,0.0003336332,0.015697673],"genre_scores_gemma":[0.8558701,0.00023961764,0.1257575,0.0011436172,0.0005767445,0.00010181338,0.000084399806,0.000028098053,0.016198074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772644,0.00007164944,0.0006145607,0.00062151963,0.00047184704,0.0004939614],"domain_scores_gemma":[0.998351,0.00038901097,0.00023555645,0.00044262063,0.00045549317,0.0001263344],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00034331754,0.00031780792,0.00027038687,0.00037919445,0.000084107225,0.00038887974,0.0020221085,0.00013402109,0.0012993865],"category_scores_gemma":[0.00012149965,0.0003260557,0.00009934838,0.00031218628,0.00008090774,0.00069629797,0.0003144114,0.0003012833,0.00033455485],"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.00026428062,0.0011824974,0.0014347455,0.00021871933,0.00013240024,0.0001051716,0.0021664987,0.004055499,0.0039416417,0.2037314,0.00358421,0.7791829],"study_design_scores_gemma":[0.002612596,0.0011932437,0.00025671197,0.0002228772,0.000024925124,0.000018638491,0.00008499361,0.85755736,0.005146172,0.013048942,0.1191611,0.00067242933],"about_ca_topic_score_codex":0.000086426895,"about_ca_topic_score_gemma":0.00019559759,"teacher_disagreement_score":0.85350186,"about_ca_system_score_codex":0.000094913186,"about_ca_system_score_gemma":0.00013500507,"threshold_uncertainty_score":0.9999192},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015804189,0.00008333569,0.99544173,0.0000659023,0.0003780926,0.00023649079,0.000005421656,0.0002209133,0.0019876806],"genre_scores_gemma":[0.4497976,0.0000014147487,0.54315114,0.00013029987,0.00012713633,0.000065752756,0.000008723023,0.000009511219,0.0067084054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990691,0.000051041636,0.00018494496,0.00029986099,0.00017732893,0.00021770911],"domain_scores_gemma":[0.9991056,0.00005527532,0.00006481417,0.0005018304,0.00011937148,0.00015316402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092152035,0.00010275767,0.00020997699,0.00013559787,0.000068350106,0.00016120203,0.0005721346,0.00004074762,0.0000044399517],"category_scores_gemma":[0.000033211072,0.00007677868,0.00012980832,0.00058890186,0.000017381122,0.00023692657,0.00011740155,0.00003823676,0.000035172063],"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.000005182842,0.000060777278,0.00024900102,0.000024711006,0.00017189083,0.0000032738762,0.000686836,0.009074992,0.00002743212,0.98776793,0.00048596118,0.0014420177],"study_design_scores_gemma":[0.00038110928,0.00003425146,0.00002455781,0.0000028365039,0.00005061342,0.000003473157,0.00014511656,0.9923083,0.00025918407,0.005150657,0.001514902,0.00012499947],"about_ca_topic_score_codex":0.0000683809,"about_ca_topic_score_gemma":0.0000066402686,"teacher_disagreement_score":0.98323333,"about_ca_system_score_codex":0.000022945269,"about_ca_system_score_gemma":0.000031725052,"threshold_uncertainty_score":0.31309435},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29922962,0.00089847547,0.60608035,0.016450627,0.0025380712,0.00085949927,0.00003319508,0.0012910604,0.072619125],"genre_scores_gemma":[0.92418474,0.000010065206,0.07107049,0.00031569626,0.00010118534,0.000018361747,0.0000030100348,0.000019555018,0.004276879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787134,0.00013304211,0.0003670791,0.00049593614,0.00060902373,0.0005235942],"domain_scores_gemma":[0.99826974,0.00022531956,0.00015076676,0.00088700216,0.00011634878,0.0003508306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023175175,0.0002319158,0.00029653887,0.00019350098,0.00022325278,0.00069625216,0.0012089956,0.00007393114,0.000044487682],"category_scores_gemma":[0.00028356054,0.00018352894,0.00007464957,0.00049304735,0.0002564013,0.0010753336,0.000871516,0.0001398584,0.00017876782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040731366,0.00006166666,0.000051934443,0.00005584007,0.000014942084,0.000009289905,0.0033104594,0.0000026254374,0.0004702501,0.99157196,0.0029877191,0.0014592345],"study_design_scores_gemma":[0.00061420724,0.000111313355,0.000067990055,0.000066696586,0.000024282666,0.00017677271,0.0011242738,0.035112806,0.003921714,0.9482699,0.010033267,0.0004767597],"about_ca_topic_score_codex":0.000006285122,"about_ca_topic_score_gemma":0.0000017952631,"teacher_disagreement_score":0.6249551,"about_ca_system_score_codex":0.000033629654,"about_ca_system_score_gemma":0.00010214789,"threshold_uncertainty_score":0.74840933},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000084648964,0.0008111172,0.50118536,0.00019679766,0.00012657537,0.00089254533,0.00030174022,0.00048229017,0.49591896],"genre_scores_gemma":[0.022080107,0.0004094772,0.6600677,0.0006765487,0.0005062827,0.000111320645,0.0001798908,0.0013173218,0.3146514],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99659127,0.0003047024,0.0008776742,0.0007793251,0.0009523361,0.00049469277],"domain_scores_gemma":[0.9957517,0.0011056403,0.001060538,0.0015488192,0.00010977123,0.0004235714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018519239,0.00068566535,0.001720667,0.00014004318,0.00006363293,0.000112427915,0.001441774,0.0002792393,0.00031262625],"category_scores_gemma":[0.00031171268,0.00056118314,0.00036148145,0.00069579657,0.0012014904,0.00014262789,0.0005293671,0.0005181703,0.00014245592],"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.000017029086,0.00092973065,0.000018193814,0.0017175698,0.0004943276,0.00002715235,0.0027170791,0.0000024617827,0.000009711386,0.2061447,0.78674304,0.00117901],"study_design_scores_gemma":[0.0044932337,0.0037385782,0.00020380344,0.005814108,0.00033967142,0.00011922269,0.0053925454,0.1545431,0.00056819076,0.7059968,0.113228336,0.005562368],"about_ca_topic_score_codex":0.00014574983,"about_ca_topic_score_gemma":0.000009689525,"teacher_disagreement_score":0.67351466,"about_ca_system_score_codex":0.00007430552,"about_ca_system_score_gemma":0.00032680703,"threshold_uncertainty_score":0.999684},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013234572,0.00001287883,0.9914016,0.00047804604,0.00004594056,0.00026601335,0.0000034849588,0.00008216477,0.0063863974],"genre_scores_gemma":[0.33227322,0.000012190931,0.6671461,0.00031947944,0.00003143131,0.000032569642,0.000022775072,0.000004462603,0.00015780683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992196,0.000100741796,0.00019863341,0.0002172673,0.00013275346,0.00013100344],"domain_scores_gemma":[0.9994152,0.0000760142,0.00008619513,0.00029270866,0.000077395365,0.000052439496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043983952,0.00007544877,0.000100924684,0.00006258674,0.00008157265,0.000030994834,0.00036600552,0.000038574977,0.00012188937],"category_scores_gemma":[0.000023547984,0.000067783214,0.00002779613,0.00039728233,0.000026921814,0.00018123475,0.00013341963,0.00004783925,0.000023191968],"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.000019787267,0.00009551667,0.0012776307,0.000008268365,0.0000061221363,9.979257e-7,0.00023235049,0.19375953,0.0001782458,0.7544746,0.00006674357,0.04988022],"study_design_scores_gemma":[0.0004133075,0.00019428856,0.0017970919,0.000014689082,0.0000105563495,0.000014630203,0.000051913463,0.8872646,0.0011946564,0.10395923,0.0048538875,0.00023113324],"about_ca_topic_score_codex":0.000017509292,"about_ca_topic_score_gemma":0.0000038006458,"teacher_disagreement_score":0.6935051,"about_ca_system_score_codex":0.000021680455,"about_ca_system_score_gemma":0.000013208094,"threshold_uncertainty_score":0.27641192},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008798149,0.0005215244,0.019338371,0.00014442015,0.0024403748,0.00032212582,0.000031727744,0.00020994917,0.9769827],"genre_scores_gemma":[0.0010975418,9.788981e-7,0.007979225,0.00007979849,0.00022383589,0.00001495004,0.000024407325,0.000027174328,0.99055207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997337,0.000058492948,0.000556441,0.00087361794,0.00077466975,0.00039981984],"domain_scores_gemma":[0.99777615,0.0002261561,0.00028544158,0.0012891925,0.00021722089,0.00020582243],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019509478,0.00032952114,0.00036731915,0.0015464476,0.00026686085,0.00059539085,0.0016768744,0.00015153446,0.00023375005],"category_scores_gemma":[0.00003026781,0.00031979944,0.00014378205,0.00027856173,0.00029342566,0.00023500183,0.0005733483,0.00052319636,0.0015172848],"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.0000024455546,0.000010726928,0.0000010859659,0.000019024534,0.000008769741,0.00004373106,0.00042316277,0.000061533436,0.000012280576,0.97865254,0.008245497,0.0125191985],"study_design_scores_gemma":[0.00015102398,0.000012892845,6.40785e-7,0.0001313494,0.000008578162,0.0000035274008,0.000003297218,0.0065383688,0.00003455284,0.27977228,0.7130379,0.0003055712],"about_ca_topic_score_codex":0.00000508403,"about_ca_topic_score_gemma":0.0007136841,"teacher_disagreement_score":0.70479244,"about_ca_system_score_codex":0.000103075756,"about_ca_system_score_gemma":0.00038799434,"threshold_uncertainty_score":0.99992543},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008441804,0.00076542154,0.8228896,0.00025895736,0.0025683478,0.0001592183,0.0000023986124,0.00016503,0.17318256],"genre_scores_gemma":[0.00019624666,0.0000618446,0.89272046,0.0006966609,0.00036947036,0.000005978745,0.000001847704,0.000023223613,0.105924256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961687,0.000112489506,0.0005655401,0.0016766713,0.00082765095,0.0006489468],"domain_scores_gemma":[0.99692297,0.0003888457,0.00024041608,0.0019983507,0.00021385968,0.0002355641],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002969817,0.0004452882,0.00057391514,0.00069974456,0.00022873795,0.0006746965,0.005057376,0.00021579221,0.0001990424],"category_scores_gemma":[0.000046382647,0.00043350636,0.00016995512,0.0006597726,0.0006675838,0.00078750524,0.003164085,0.00062662316,0.00020243441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.132202e-7,0.000014037243,6.3835967e-7,0.000013574722,0.000003909443,0.00014374703,0.00015642487,0.000061695435,0.00002890402,0.529279,0.00018239769,0.47011507],"study_design_scores_gemma":[0.00037277376,0.00015241516,0.000061276245,0.00056112534,0.000010613713,0.00031610738,0.000002033909,0.25324544,0.0015317198,0.5773624,0.16501382,0.0013702634],"about_ca_topic_score_codex":0.000003846663,"about_ca_topic_score_gemma":0.0000029639762,"teacher_disagreement_score":0.4687448,"about_ca_system_score_codex":0.00016831022,"about_ca_system_score_gemma":0.0007315239,"threshold_uncertainty_score":0.99981165},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89040506,0.0002627295,0.08400028,0.0040777493,0.0010852818,0.001707772,0.00009409002,0.00033189822,0.018035144],"genre_scores_gemma":[0.98399603,0.0002810514,0.0092929965,0.0014715104,0.00015733938,0.0000717473,5.793482e-7,0.000032065596,0.004696702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692124,0.00011107773,0.0006024477,0.0009704592,0.0008010842,0.00059370854],"domain_scores_gemma":[0.9972218,0.0006082764,0.0004071349,0.00057317235,0.0008797657,0.00030980108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012909593,0.0005056313,0.0006565459,0.00019548573,0.00046495884,0.00053421414,0.0021812364,0.00022515278,0.00026156494],"category_scores_gemma":[0.0007851326,0.00034447518,0.00022983454,0.0005166123,0.00031651315,0.0008106929,0.00032606113,0.000361122,0.00021945921],"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.0017324089,0.0010914291,0.0010945359,0.00012749329,0.00028038197,0.0000080826285,0.004420247,0.00010384685,0.14478995,0.56638724,0.020874348,0.25909004],"study_design_scores_gemma":[0.0045365104,0.0006658836,0.00054791354,0.00033466824,0.00006689169,0.000025269675,0.0005372593,0.9283605,0.01742725,0.04459543,0.0021265848,0.0007758177],"about_ca_topic_score_codex":0.000012821773,"about_ca_topic_score_gemma":6.352036e-7,"teacher_disagreement_score":0.9282567,"about_ca_system_score_codex":0.00006268471,"about_ca_system_score_gemma":0.0000646044,"threshold_uncertainty_score":0.9999007},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000032588612,0.00058127823,0.5457144,0.00060347473,0.000060091304,0.0000824298,0.000015561562,0.00012414534,0.45281535],"genre_scores_gemma":[0.048862856,0.0011344069,0.023029232,0.0007533021,0.00041624164,0.00003474545,0.000025053836,0.000058428737,0.9256857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982595,0.000017080769,0.00033290754,0.0007589243,0.0003224859,0.00030911676],"domain_scores_gemma":[0.99868894,0.00011896219,0.00020370776,0.0007372671,0.000037819966,0.00021330142],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019703739,0.00037014324,0.0007300369,0.00025264005,0.00017124177,0.000118925724,0.0006150939,0.00022379438,0.0008264185],"category_scores_gemma":[0.000004380984,0.00026650916,0.00037190213,0.0002278943,0.00016241896,0.00014330777,0.00037097186,0.00024615708,0.00035118585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010126201,0.0000066444127,0.0000016541843,0.0000073951687,0.0008144293,0.000015285848,0.000029785844,0.0000011990817,0.000011534519,0.87945086,0.00022986741,0.11942122],"study_design_scores_gemma":[0.00024788873,0.00005554683,0.00002175962,0.000017726485,0.0012698431,0.000013218061,0.000004880538,0.0018159206,0.000113840426,0.6120231,0.38365272,0.0007635398],"about_ca_topic_score_codex":0.0000019179595,"about_ca_topic_score_gemma":4.0147407e-7,"teacher_disagreement_score":0.52268517,"about_ca_system_score_codex":0.000028359342,"about_ca_system_score_gemma":0.000037600566,"threshold_uncertainty_score":0.9999787},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014890833,0.005145375,0.23041789,0.0016408967,0.008965644,0.0032193721,0.00071492034,0.0022360114,0.7327691],"genre_scores_gemma":[0.026592309,0.0013429649,0.0152008,0.0014072283,0.0028870525,0.00003822289,0.00008730825,0.00018900879,0.95225513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976269,0.000056499164,0.0004733605,0.0010847664,0.00032922934,0.00042922542],"domain_scores_gemma":[0.9981716,0.00020464679,0.0002892927,0.0008861589,0.00010326337,0.00034500138],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040948926,0.00062184676,0.00067261147,0.00020655972,0.00024673747,0.00041026893,0.0006850547,0.00036144853,0.0016183469],"category_scores_gemma":[0.000046851874,0.00054892694,0.00010545955,0.000046148485,0.00032621218,0.00032878615,0.0006729549,0.00035663895,0.00061231956],"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.000017456026,0.000017635652,0.000009033651,0.00018000301,0.00009964397,0.000097977834,0.00035718177,3.342476e-8,0.00029739924,0.97923857,0.0005659278,0.019119168],"study_design_scores_gemma":[0.0013095911,0.001424337,0.0063090934,0.00091601175,0.000394119,0.001267596,0.000017451246,0.014449978,0.0007147537,0.42475882,0.5438879,0.004550308],"about_ca_topic_score_codex":0.000009460288,"about_ca_topic_score_gemma":0.0000020088664,"teacher_disagreement_score":0.5544797,"about_ca_system_score_codex":0.000043446275,"about_ca_system_score_gemma":0.00008944371,"threshold_uncertainty_score":0.9996962},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018251152,0.00008951489,0.40869302,0.000038519192,0.0002026632,0.000062727886,0.000002382999,0.000059178332,0.5908502],"genre_scores_gemma":[0.0011081552,0.000025817171,0.03409357,0.00007168617,0.000107019405,0.000001484882,0.000001231598,0.0000140755565,0.96457696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911404,0.0000121832045,0.00027182902,0.00027597233,0.00019487744,0.00013108196],"domain_scores_gemma":[0.99889773,0.00008065102,0.00019084859,0.00072237884,0.00005106428,0.000057306843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022895228,0.000176842,0.0003109981,0.000107427,0.000025676198,0.000027735796,0.00090502127,0.00014827166,0.00044927173],"category_scores_gemma":[0.0000061951714,0.00013832386,0.00015311986,0.000017917848,0.000049290753,0.000053410382,0.00028681243,0.00012074115,0.00035096818],"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.0000011224607,0.0000024870556,1.5968749e-7,0.00003640485,0.000008220347,0.0000105194795,0.000016422027,6.753101e-7,0.000012954268,0.9367758,0.00060019956,0.062535],"study_design_scores_gemma":[0.00014907694,0.0001405424,0.0000015547985,0.00012869756,0.00001726068,0.000052965068,6.416834e-7,0.0053520463,0.0009952614,0.44795942,0.54484016,0.00036235768],"about_ca_topic_score_codex":0.0000027671433,"about_ca_topic_score_gemma":0.0000010987791,"teacher_disagreement_score":0.54424,"about_ca_system_score_codex":0.0000085836,"about_ca_system_score_gemma":0.00003725936,"threshold_uncertainty_score":0.5640683},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000052874148,0.00031429587,0.12498625,0.0012745628,0.0009975629,0.00017129624,0.000007592739,0.00028892801,0.8719542],"genre_scores_gemma":[0.0013722912,0.000044610148,0.0056313947,0.00027640065,0.00061945524,0.0000079728925,0.000007541895,0.000037631624,0.9920027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985931,0.000018660181,0.00024890678,0.0005190531,0.0002718469,0.0003484687],"domain_scores_gemma":[0.9987792,0.00004125199,0.00012955684,0.00088670896,0.000027818884,0.00013550727],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00014013278,0.0003388543,0.00032025456,0.00014254487,0.0001080824,0.00019678196,0.001279041,0.0002574468,0.005916876],"category_scores_gemma":[0.0000069778926,0.00028845223,0.00020438242,0.000040905543,0.00007904499,0.0001709879,0.0004391754,0.0005561033,0.007111723],"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.0000012671208,0.0000057058733,3.6781336e-7,0.000010713447,0.00001961196,0.000060302857,0.000037791935,7.404832e-7,0.0000026717296,0.9476418,0.0075287214,0.04469032],"study_design_scores_gemma":[0.000085113315,0.00005829973,0.000004480787,0.000040316958,0.000008072059,0.00004257738,0.0000013982128,0.002036115,0.00012743815,0.49240163,0.5048734,0.000321159],"about_ca_topic_score_codex":0.000046035264,"about_ca_topic_score_gemma":0.00000981825,"teacher_disagreement_score":0.4973447,"about_ca_system_score_codex":0.00007361,"about_ca_system_score_gemma":0.000051946045,"threshold_uncertainty_score":0.9999568},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024403937,0.00004555771,0.8582841,0.0005451242,0.00007334011,0.00016204103,0.000015572443,0.00014016891,0.116330154],"genre_scores_gemma":[0.8790318,0.000015464506,0.12050132,0.00009856327,0.000050631857,0.000015927784,0.0000021069836,0.000009976138,0.0002742259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988042,0.000075443175,0.00033775874,0.00025076518,0.00028696805,0.00024484488],"domain_scores_gemma":[0.998593,0.0005556514,0.00021733703,0.00041634808,0.000091227295,0.00012649024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017889486,0.00014288952,0.0003075283,0.00009941295,0.00007206143,0.00005022136,0.000639642,0.000027147686,0.0001608072],"category_scores_gemma":[0.0001836243,0.00011623185,0.00009864082,0.0008657049,0.00025430662,0.00028953736,0.00014457072,0.00008983996,0.00012188727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063728103,0.00019827035,0.000112074915,0.000019149355,0.00002823623,0.000013914135,0.0007679004,0.0001406608,0.0002206462,0.9916407,0.0000853772,0.00676673],"study_design_scores_gemma":[0.00025726107,0.00036296016,0.001724792,0.000057761954,0.000023126024,0.000025064675,0.0003825183,0.077474505,0.0014760441,0.91675407,0.0011210432,0.0003408359],"about_ca_topic_score_codex":0.00002570245,"about_ca_topic_score_gemma":0.0000016264552,"teacher_disagreement_score":0.85462785,"about_ca_system_score_codex":0.000017360775,"about_ca_system_score_gemma":0.000043472202,"threshold_uncertainty_score":0.4739797},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000105847885,0.00020299609,0.5952006,0.00014725377,0.00010900605,0.00011249246,0.0000036217723,0.000070628084,0.40414283],"genre_scores_gemma":[0.010025763,0.000074743395,0.054872025,0.00006986148,0.00012759214,0.0000031070017,0.0000042289653,0.000014020099,0.9348087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994444,0.000008490896,0.00015809025,0.00022182862,0.00010353419,0.00006364887],"domain_scores_gemma":[0.99930745,0.00007958706,0.0001244255,0.00040630947,0.000043068223,0.000039168855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001452345,0.000107261396,0.00016589358,0.000061095874,0.000022232198,0.000022499325,0.00031012835,0.00010171232,0.0000983556],"category_scores_gemma":[0.000006799107,0.00008988182,0.00004237579,0.000012449086,0.00003897322,0.000049153165,0.00014174501,0.000070580565,0.0000693481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.633196e-7,0.0000017621722,6.677347e-7,0.00003073154,0.000005963549,3.573561e-7,0.000019863224,5.420297e-7,0.00006541575,0.9634927,0.00019053256,0.036190525],"study_design_scores_gemma":[0.00040050395,0.00016039265,0.0000780294,0.00013159674,0.00002720843,0.000026812464,0.0000016860448,0.027085984,0.0020214051,0.53047484,0.43904403,0.0005475084],"about_ca_topic_score_codex":0.0000029397436,"about_ca_topic_score_gemma":6.65486e-7,"teacher_disagreement_score":0.54032856,"about_ca_system_score_codex":0.000005328429,"about_ca_system_score_gemma":0.000012435727,"threshold_uncertainty_score":0.3665274},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004729699,0.000042173677,0.32942352,0.0005026852,0.0011098759,0.00025048593,0.000003991647,0.00049648475,0.66816604],"genre_scores_gemma":[0.009685267,0.0000014154621,0.008239456,0.0017908021,0.0010111419,0.000024957428,0.000049378068,0.000121358404,0.9790762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970118,0.00009289685,0.0006277901,0.0010435153,0.0007050561,0.00051896874],"domain_scores_gemma":[0.99724764,0.0001454898,0.00041370763,0.0016098565,0.00024080402,0.00034250086],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00065078307,0.0006429738,0.0006317793,0.00037038844,0.00022277987,0.0020516384,0.0023625945,0.0006379356,0.0005501556],"category_scores_gemma":[0.000086172215,0.0005913519,0.0003267669,0.00006404069,0.00016336328,0.000762263,0.00041939618,0.0010800704,0.00073462585],"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.000006481874,0.000007967517,8.868609e-7,0.000020855005,0.00004801577,0.000032156935,0.00019866128,0.0000039565894,0.000025196865,0.786304,0.05303817,0.16031365],"study_design_scores_gemma":[0.0003431161,0.00015381438,0.000006124016,0.00010329552,0.00004035214,0.000059889222,0.000010702978,0.0037144183,0.00042744828,0.21278176,0.7814451,0.0009139713],"about_ca_topic_score_codex":0.000018301142,"about_ca_topic_score_gemma":0.0000047031745,"teacher_disagreement_score":0.72840697,"about_ca_system_score_codex":0.00014883083,"about_ca_system_score_gemma":0.00024252407,"threshold_uncertainty_score":0.9996538},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.193112e-7,0.00027186773,0.37362146,0.00019084649,0.00037446248,0.00006377261,0.0000011280256,0.00024004182,0.6252359],"genre_scores_gemma":[0.00017411879,0.00006908004,0.04059732,0.0008976872,0.00031646786,0.0000015277225,0.0000036235358,0.000024117417,0.9579161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987762,0.000020180258,0.00024476525,0.00046110307,0.00027941455,0.00021835038],"domain_scores_gemma":[0.9987377,0.00009330916,0.00014164958,0.000855647,0.000060072893,0.00011164495],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030419545,0.00026557708,0.00029099584,0.00018472881,0.000099951525,0.00019806683,0.0011191542,0.00022501044,0.00090439926],"category_scores_gemma":[0.000009702649,0.00022311384,0.00014655798,0.000043698605,0.00005090898,0.0001429783,0.00039968253,0.00023486221,0.0025163786],"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":[7.938574e-7,0.000002447749,2.8745387e-7,0.000021968373,0.000014843972,0.00001501141,0.0000190353,0.000001678761,0.0000037778802,0.94861335,0.009302298,0.04200449],"study_design_scores_gemma":[0.00006129692,0.000029273624,3.417384e-7,0.00004384167,0.000008997423,0.000021204025,3.9127207e-7,0.0032785265,0.00011685146,0.38401586,0.61216563,0.00025776797],"about_ca_topic_score_codex":0.0000063232496,"about_ca_topic_score_gemma":0.0000023038915,"teacher_disagreement_score":0.6028633,"about_ca_system_score_codex":0.000021299162,"about_ca_system_score_gemma":0.00006682924,"threshold_uncertainty_score":0.99826026},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000026070365,0.00039378338,0.15610693,0.00016673048,0.0006344937,0.0000924788,0.0000027099477,0.0003212767,0.84227896],"genre_scores_gemma":[0.000051400486,0.00007425184,0.05235213,0.0006356672,0.00048662527,0.0000013487569,0.000003379545,0.000023111385,0.9463721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987583,0.000014765139,0.00023633355,0.00048324978,0.0002809585,0.00022638439],"domain_scores_gemma":[0.9987497,0.000059418428,0.00013346509,0.0008575526,0.000091983115,0.00010791387],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002545545,0.00026200715,0.00025102534,0.00018844925,0.000114850896,0.00021229537,0.0011613708,0.00022966169,0.004279739],"category_scores_gemma":[0.000008314036,0.00021933106,0.00013365653,0.0000547768,0.00009240464,0.00026115,0.0004892632,0.00019263504,0.0053686365],"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.0000012700489,0.0000043572195,2.4261027e-7,0.000016927066,0.000020452695,0.000025379488,0.00006081129,2.2836838e-7,0.000004760066,0.9579213,0.029147008,0.012797251],"study_design_scores_gemma":[0.000052394174,0.000042125026,2.6535653e-7,0.00004432079,0.000008633013,0.000023700788,0.0000010703625,0.0012433358,0.00022610743,0.46875498,0.52936256,0.00024048638],"about_ca_topic_score_codex":0.0000052161377,"about_ca_topic_score_gemma":0.0000030858182,"teacher_disagreement_score":0.5002156,"about_ca_system_score_codex":0.000025078798,"about_ca_system_score_gemma":0.000094059964,"threshold_uncertainty_score":0.9966305},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.7349595e-8,0.00002749962,0.4695635,0.00018578184,0.00020065339,0.000051102816,3.2823826e-7,0.00010496141,0.5298661],"genre_scores_gemma":[0.00030004643,0.000013783854,0.044540524,0.0003584998,0.00016800186,0.0000041732997,0.0000045510815,0.000009863944,0.9546006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932635,0.000008879714,0.00014822162,0.00026078738,0.00015328774,0.000102499],"domain_scores_gemma":[0.99937713,0.000039861512,0.00006440937,0.000409347,0.000047974012,0.00006124961],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007589799,0.00015145759,0.0001464457,0.000058152396,0.00003718204,0.00012156701,0.0005414631,0.00013638452,0.00438289],"category_scores_gemma":[0.000005302962,0.000112138034,0.00008083322,0.000017252794,0.00001985625,0.00021322009,0.000100086814,0.00018948155,0.0066438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.179386e-7,0.0000021883257,1.5472507e-8,0.0000019294137,0.000004143619,0.0000028024726,0.0000137177685,6.200235e-7,0.000002125858,0.8357664,0.00724628,0.15695958],"study_design_scores_gemma":[0.0000362299,0.00003346403,7.0281806e-7,0.00002124948,0.0000028336021,0.000011929119,6.303458e-7,0.01579749,0.00012341728,0.6175631,0.36621228,0.00019665762],"about_ca_topic_score_codex":0.0000059874806,"about_ca_topic_score_gemma":2.966411e-7,"teacher_disagreement_score":0.425023,"about_ca_system_score_codex":0.000017706903,"about_ca_system_score_gemma":0.00002436979,"threshold_uncertainty_score":0.99652725},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005347151,0.00022221738,0.09306479,0.000055611294,0.00029706917,0.000081864804,0.000015338737,0.00007797434,0.9061317],"genre_scores_gemma":[0.0029908072,0.0005187891,0.029269816,0.00007765547,0.0004623399,0.0000024078668,0.000018642428,0.000015256293,0.9666443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994896,0.000007022457,0.00013787745,0.00018794234,0.00011990335,0.00005763711],"domain_scores_gemma":[0.99949837,0.0000532708,0.00015293331,0.00020907685,0.000057572437,0.000028752169],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001251276,0.00009473312,0.00012174968,0.000096418575,0.00003168764,0.000033398723,0.00017622743,0.00010842224,0.0017330665],"category_scores_gemma":[0.0000032341857,0.000080676895,0.000036409656,0.0000177227,0.000051366667,0.00023147419,0.0000753032,0.00006845587,0.00010857805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024366059,0.0000038185353,2.1949346e-7,0.000031229723,0.000009811997,0.0000018347339,0.00003823593,7.5590776e-8,0.00002136832,0.9623657,0.0031391876,0.034386072],"study_design_scores_gemma":[0.0001120063,0.00016143292,0.00001950116,0.00010102711,0.000021274376,0.00004258999,0.000005685914,0.0011865877,0.0011971825,0.72713983,0.26977476,0.00023808924],"about_ca_topic_score_codex":0.0000031377406,"about_ca_topic_score_gemma":0.0000015263989,"teacher_disagreement_score":0.26663557,"about_ca_system_score_codex":0.0000064303954,"about_ca_system_score_gemma":0.000013952003,"threshold_uncertainty_score":0.9991795},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.981341,0.00015928574,0.016138196,0.0012186017,0.00008653545,0.00022013456,0.0000012335729,0.000008962243,0.000826039],"genre_scores_gemma":[0.990835,0.00013530703,0.008873702,0.000095031646,0.000031652187,0.0000033472254,5.6658095e-8,0.000003333588,0.000022548704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986547,0.00017401713,0.00050027546,0.00021388548,0.00027389827,0.00018319405],"domain_scores_gemma":[0.9985633,0.00065839075,0.00036369835,0.00026672755,0.0000702035,0.00007767415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003167734,0.00012336602,0.00027631456,0.000085617685,0.00008279406,0.000055811648,0.00045459822,0.000056320576,0.000016735125],"category_scores_gemma":[0.00013101817,0.00007799043,0.000048745813,0.00028060496,0.00013280846,0.00017777519,0.00009034785,0.00029180478,8.595022e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030398997,0.00026697837,0.010709733,0.00010553923,0.00002259997,0.00002618153,0.0020688304,0.00045781204,0.0013856757,0.9540253,0.000011994143,0.030615328],"study_design_scores_gemma":[0.0006807325,0.0004314601,0.01317008,0.000114046095,0.000010705666,0.00013262546,0.00031509838,0.020393934,0.0034884529,0.96092165,0.00014680729,0.00019443104],"about_ca_topic_score_codex":0.000013402671,"about_ca_topic_score_gemma":0.00000912169,"teacher_disagreement_score":0.030420898,"about_ca_system_score_codex":0.000039380804,"about_ca_system_score_gemma":0.000077003715,"threshold_uncertainty_score":0.31803575},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.3176634e-7,0.00002296158,0.45619228,0.000024235822,0.0001931762,0.00009411172,0.000022990487,0.00015596938,0.54329413],"genre_scores_gemma":[0.0000745796,0.000038203263,0.006584515,0.00006601082,0.0001515808,2.9765553e-7,0.000006639866,0.000021213702,0.99305695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988593,0.00004345827,0.00013447429,0.0005098504,0.00022607573,0.00022683751],"domain_scores_gemma":[0.9988017,0.000071393326,0.0001673126,0.00069664675,0.000106385516,0.00015653456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008970857,0.0002620949,0.00025680344,0.00013115822,0.00015888337,0.00006871638,0.0011540967,0.00024361124,0.000012616461],"category_scores_gemma":[0.0000056616163,0.0002559062,0.00015967966,0.000008760395,0.000103815364,0.00021541327,0.00047690966,0.00022003392,0.0000552326],"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.0000128280535,0.000004027581,5.503641e-8,0.000015380887,0.00003395681,0.00015037939,0.000010906456,0.00009745747,0.0000027025949,0.98841584,0.005203515,0.0060529783],"study_design_scores_gemma":[0.00034963677,0.00003966092,3.3656383e-7,0.00009527281,0.00003379725,0.000023788698,0.0000010589226,0.010289043,0.0001458753,0.00019736658,0.9883971,0.00042706644],"about_ca_topic_score_codex":0.000004788301,"about_ca_topic_score_gemma":1.9636461e-8,"teacher_disagreement_score":0.9882184,"about_ca_system_score_codex":0.00010483066,"about_ca_system_score_gemma":0.000079318525,"threshold_uncertainty_score":0.99998933},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013038448,0.000087793946,0.027072141,0.00037183857,0.00090598664,0.00012408043,0.0000035137475,0.000464503,0.97096884],"genre_scores_gemma":[0.000056917794,0.000014685225,0.009005627,0.00036370315,0.0002816267,0.0000026284333,9.1090266e-7,0.00007684555,0.99019706],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992907,0.00003668177,0.00005976595,0.00030791055,0.00015606268,0.00014886912],"domain_scores_gemma":[0.99921334,0.00004385168,0.000058844802,0.0006361475,0.0000062966124,0.00004150638],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00008133911,0.00014887791,0.00015973065,0.00012723022,0.000014863766,0.000082509556,0.0007125168,0.00011610026,0.0023899984],"category_scores_gemma":[0.000007306411,0.00010434047,0.000055104658,0.000096841584,0.000015258287,0.000033527474,0.00009646114,0.00010151791,0.010330863],"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":[5.662748e-7,0.000010845145,8.225375e-7,0.0000123045775,0.000009369826,0.0000048695883,0.00001366333,0.0000018024343,0.0000017631405,0.3999825,0.59671825,0.0032432545],"study_design_scores_gemma":[0.00007571612,0.0000489088,0.0000039584756,0.000048316604,0.0000018142397,0.0000018612903,0.0000030418091,0.00068303203,0.00007287529,0.0008008373,0.99808717,0.0001724938],"about_ca_topic_score_codex":0.000027711028,"about_ca_topic_score_gemma":0.0000028804332,"teacher_disagreement_score":0.40136892,"about_ca_system_score_codex":0.0000074168006,"about_ca_system_score_gemma":0.000020350928,"threshold_uncertainty_score":0.9985219},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026440036,0.000037204092,0.8785142,0.0011334586,0.00076304964,0.0002059259,0.0000018507102,0.00011211219,0.11658821],"genre_scores_gemma":[0.9853566,0.0000053322237,0.009306409,0.0008133083,0.00009142812,0.000012863541,0.000068370195,0.00001371908,0.0043319375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922687,0.00007949525,0.00017646239,0.00020072758,0.00023904238,0.00007741167],"domain_scores_gemma":[0.99934983,0.00023430264,0.00013718805,0.00019771462,0.00005027574,0.000030681196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011851057,0.00010621096,0.00014880164,0.000036039313,0.000051401614,0.00004197962,0.0005744295,0.00006209424,0.00008526937],"category_scores_gemma":[0.000052152936,0.000065367116,0.000079163474,0.00024000196,0.000009872726,0.000052602478,0.000029678475,0.0001628507,0.00012591742],"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.000010440558,0.000021135555,2.8660563e-7,0.0000262991,0.000011074145,0.000001762454,0.00055082806,0.00009225729,0.00003287647,0.9823122,0.0014207381,0.015520089],"study_design_scores_gemma":[0.00023663913,0.0003725518,0.00024722895,0.00013324068,0.000021579377,0.0000028017507,0.0003927506,0.5065038,0.012721572,0.47673234,0.0022504888,0.0003850062],"about_ca_topic_score_codex":0.000004724745,"about_ca_topic_score_gemma":5.7576085e-7,"teacher_disagreement_score":0.9827126,"about_ca_system_score_codex":0.0000065007057,"about_ca_system_score_gemma":0.000045126944,"threshold_uncertainty_score":0.26655936},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000020785992,0.00011858681,0.39037472,0.00011284765,0.00016791835,0.00027062846,0.00000846247,0.00027342307,0.60867137],"genre_scores_gemma":[0.001199144,0.000016962429,0.07042973,0.00047333885,0.00053429406,0.00005153135,0.000011735065,0.00008412666,0.9271991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978119,0.00004845217,0.0005159743,0.00055135216,0.00071710185,0.0003552064],"domain_scores_gemma":[0.9979513,0.00022221552,0.00044305256,0.0009320458,0.0001705402,0.00028081553],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006419581,0.00042145923,0.0007265375,0.000035344663,0.00014481391,0.0002756611,0.00092093856,0.00021044085,0.00008502495],"category_scores_gemma":[0.000025890153,0.00036017885,0.00042762913,0.000036439076,0.00045314038,0.00010478204,0.00032658855,0.00044156768,0.0009239135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001197968,0.000011638159,4.1157335e-8,0.00008238253,0.000083023246,0.0000071808763,0.0005903607,0.0000056971726,0.00000606206,0.9755765,0.008663208,0.0149726905],"study_design_scores_gemma":[0.0001386403,0.00012838232,7.780963e-8,0.00015376958,0.000049389677,0.000049497467,0.000099829165,0.028583739,0.0000114556,0.77247924,0.19776061,0.00054540584],"about_ca_topic_score_codex":0.0000074154605,"about_ca_topic_score_gemma":1.9711281e-7,"teacher_disagreement_score":0.31994498,"about_ca_system_score_codex":0.00014192892,"about_ca_system_score_gemma":0.00016520865,"threshold_uncertainty_score":0.999885},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010882504,0.00022405124,0.0653268,0.000102428006,0.001651798,0.00055718404,0.0004396713,0.00030266927,0.9312866],"genre_scores_gemma":[0.0025972952,0.00025104656,0.0010254532,0.00018918417,0.0005645373,8.0088193e-7,0.000008737601,0.000065319655,0.9952976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99658036,0.00020647817,0.00040272047,0.0014377885,0.0005732486,0.00079941883],"domain_scores_gemma":[0.99661493,0.00021707836,0.0003956662,0.001821357,0.00035775357,0.0005932217],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003706776,0.0008528902,0.0007630608,0.00034598366,0.0007667988,0.00029233933,0.0030912184,0.0006772741,0.00007291013],"category_scores_gemma":[0.000019043007,0.0008346041,0.00051409134,0.000027091684,0.00070111064,0.00046907822,0.0022108157,0.00071144185,0.00066992093],"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.00007349982,0.000018093986,0.0000015161573,0.00008943623,0.00018672328,0.0010111007,0.000088734734,0.0000012881196,0.00010484122,0.97610164,0.006821998,0.015501124],"study_design_scores_gemma":[0.0011244997,0.0001333708,0.000007737368,0.0005385291,0.00016580032,0.000052235515,0.000022121014,0.0005386862,0.0014273396,0.00013134131,0.99468565,0.0011726842],"about_ca_topic_score_codex":0.00006205721,"about_ca_topic_score_gemma":7.0219943e-7,"teacher_disagreement_score":0.98786366,"about_ca_system_score_codex":0.00026990933,"about_ca_system_score_gemma":0.00030537738,"threshold_uncertainty_score":0.99941045},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8892489,0.0039369985,0.081721105,0.00043826253,0.0005858259,0.0004186694,0.000023559793,0.00031653332,0.02331011],"genre_scores_gemma":[0.9724482,0.00010316327,0.026561502,0.0003224883,0.00034802256,0.000010044255,0.0000023708626,0.00002081581,0.00018334632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871033,0.000034319528,0.00022565627,0.00048394105,0.000239351,0.00030642297],"domain_scores_gemma":[0.9987906,0.00027975516,0.00010714392,0.00017565442,0.000323722,0.00032311215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009103077,0.00023967375,0.00029506066,0.000085636486,0.00018262811,0.0005294146,0.00035710566,0.000073672636,0.0000068514855],"category_scores_gemma":[0.0009173557,0.00018341781,0.000020411826,0.0001797244,0.0002101929,0.000208437,0.00019330539,0.00018237795,0.000013012154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065376094,0.000045622204,0.0018219376,0.000071841576,0.000044201744,0.000051689396,0.004287822,9.5232394e-7,0.00028823843,0.98859555,0.00008170539,0.0046450403],"study_design_scores_gemma":[0.0019379817,0.00064466416,0.001614007,0.00052078,0.00014800951,0.00019787991,0.0013002433,0.009271194,0.00565087,0.97318304,0.0046450454,0.0008862715],"about_ca_topic_score_codex":0.000018684323,"about_ca_topic_score_gemma":0.0000010521591,"teacher_disagreement_score":0.083199315,"about_ca_system_score_codex":0.000012274297,"about_ca_system_score_gemma":0.00008127279,"threshold_uncertainty_score":0.7479561},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036081176,0.000026829204,0.99194735,0.0036807284,0.00038895287,0.00018874618,0.000009586586,0.000020131725,0.00012957952],"genre_scores_gemma":[0.90542376,0.000007727545,0.092281476,0.0013217324,0.0006377942,0.000004993303,0.000010312707,0.000010040056,0.00030215422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988046,0.00007312638,0.00040860553,0.000121899655,0.00044229234,0.00014943942],"domain_scores_gemma":[0.99779314,0.0010768385,0.00042145155,0.00013498757,0.00047382645,0.00009975919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004942235,0.00011410358,0.00015816154,0.00016291002,0.00016255413,0.00016179049,0.00044975826,0.000041738287,0.00004812486],"category_scores_gemma":[0.00021366446,0.00007682992,0.00012297748,0.00035190381,0.000027602086,0.00028913637,0.000019171259,0.00014871107,0.0000098253095],"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.000023860595,0.00009032738,0.000035739435,0.000011082065,0.00002717963,0.000004438661,0.00011238181,0.96053225,0.00006117461,0.032341074,0.0034287092,0.003331763],"study_design_scores_gemma":[0.0004964578,0.00021903959,0.001033874,0.000039033606,0.000023145976,0.0000467117,0.000010083761,0.7657299,0.000042672218,0.23009339,0.0021855792,0.00008011973],"about_ca_topic_score_codex":5.982669e-7,"about_ca_topic_score_gemma":1.8991814e-7,"teacher_disagreement_score":0.90181565,"about_ca_system_score_codex":0.000048468224,"about_ca_system_score_gemma":0.00032184663,"threshold_uncertainty_score":0.31330332},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001258059,0.00004228915,0.11137816,0.00003777644,0.0005838326,0.0002487098,0.00007633845,0.00027803457,0.8873423],"genre_scores_gemma":[0.000116806026,0.000036468635,0.005096025,0.00009109223,0.0001895451,4.4449942e-7,0.000011260335,0.000029120076,0.99442923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99858713,0.000024273117,0.00016607333,0.0005935083,0.00030699823,0.00032202344],"domain_scores_gemma":[0.99842376,0.00005816043,0.00014232138,0.0010384029,0.000105069,0.00023227753],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016356632,0.00036732137,0.00034305072,0.00017251253,0.00026226635,0.000107262706,0.001795538,0.00050406466,0.0000132321065],"category_scores_gemma":[0.0000036611766,0.00038685347,0.00028954234,0.000009907048,0.00021806576,0.000251295,0.00042832023,0.0008725776,0.000055049164],"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.00001491899,0.000005680957,5.271336e-8,0.000030534913,0.000049956176,0.0003049594,0.000052601717,3.5221436e-7,0.000058258378,0.98406744,0.002582161,0.012833076],"study_design_scores_gemma":[0.00036971757,0.000039771596,8.5814287e-7,0.000048083864,0.000054372846,0.000040426774,0.000003140588,0.0003507127,0.0014199449,0.0007316432,0.9964553,0.00048603053],"about_ca_topic_score_codex":0.000019060903,"about_ca_topic_score_gemma":0.0000010619223,"teacher_disagreement_score":0.9938731,"about_ca_system_score_codex":0.000056414985,"about_ca_system_score_gemma":0.000117480515,"threshold_uncertainty_score":0.9998583},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.9680177e-8,0.000111708614,0.48811314,0.00012402164,0.00026084547,0.00007475351,0.0000010028546,0.00010081057,0.5112137],"genre_scores_gemma":[0.000001642696,0.000013081003,0.43005037,0.00032353093,0.00009717757,0.000004106058,0.0000013891656,0.000008384933,0.5695003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908555,0.000051728148,0.00018980245,0.00038534918,0.00013720333,0.00015040104],"domain_scores_gemma":[0.99894077,0.00017958728,0.00009646884,0.0006217695,0.00007757937,0.00008383804],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003043099,0.0002265275,0.00024833862,0.000090707195,0.00005995272,0.0001935224,0.00082329306,0.00016791424,0.007054204],"category_scores_gemma":[0.000008928233,0.00017072841,0.00012080912,0.000021835322,0.000041148225,0.00027598682,0.00033693647,0.0002350345,0.0034897863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.1114367e-7,0.0000017606078,6.7251373e-9,0.0000040916025,0.000015802567,0.0000052582614,0.000059486625,2.9598976e-7,0.0000064848014,0.79951304,0.0046871854,0.1957064],"study_design_scores_gemma":[0.000029942488,0.00002059871,1.4000578e-7,0.000014330667,0.000003330024,0.00000841453,6.7959826e-7,0.0025218953,0.0002455537,0.52498555,0.4720032,0.00016636941],"about_ca_topic_score_codex":0.0000022228392,"about_ca_topic_score_gemma":2.2410796e-7,"teacher_disagreement_score":0.467316,"about_ca_system_score_codex":0.000017158269,"about_ca_system_score_gemma":0.000033621174,"threshold_uncertainty_score":0.99728614},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000031643342,0.0000963145,0.83916473,0.00006923633,0.00078548264,0.00008374723,0.00013528061,0.00009134832,0.1595707],"genre_scores_gemma":[0.0010124422,0.00015196367,0.7225557,0.000109584995,0.00021508215,0.00000835893,0.00004587429,0.00004066231,0.2758603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843997,0.000023313516,0.00041088916,0.0005151542,0.0003265742,0.00028409288],"domain_scores_gemma":[0.99852,0.00016369188,0.00019423304,0.0009347426,0.00008177142,0.000105540326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023935514,0.00030400476,0.00051828916,0.00035337207,0.000078611556,0.0001432638,0.0009513773,0.0002721951,0.00072501274],"category_scores_gemma":[0.000054865013,0.00031158509,0.0001219463,0.00020146517,0.00016035135,0.00017021179,0.00034567455,0.00075072993,0.00016856448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005282565,0.000009762856,0.000033812823,0.000021275617,0.0001382172,0.00018910355,0.00012445221,0.000042511205,0.0000030781923,0.98819715,0.00012365209,0.011111728],"study_design_scores_gemma":[0.00012691322,0.00006411548,0.00030703747,0.000024828825,0.00018134448,0.000016197266,0.0000030474669,0.0051263813,0.00008138024,0.65200675,0.34138703,0.00067496113],"about_ca_topic_score_codex":0.00001842338,"about_ca_topic_score_gemma":0.00008895137,"teacher_disagreement_score":0.34126338,"about_ca_system_score_codex":0.000041140294,"about_ca_system_score_gemma":0.00007897284,"threshold_uncertainty_score":0.9999336},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.0522364e-7,0.00009053338,0.46806744,0.00005722005,0.00007845664,0.00005324858,0.0000013919001,0.000056344266,0.5315946],"genre_scores_gemma":[0.0019716085,0.00007193389,0.059048902,0.00008602913,0.00012252723,0.0000025409836,0.000004268181,0.000010697312,0.9386815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993664,0.000008207722,0.00019470477,0.00021685177,0.00014556495,0.00006826412],"domain_scores_gemma":[0.99907494,0.00008432123,0.00019761847,0.00055006926,0.00006154269,0.000031511907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017037989,0.000109727516,0.00016728617,0.00008951725,0.000021474129,0.0000215376,0.0006627279,0.00010781127,0.00021245256],"category_scores_gemma":[0.0000055766427,0.00009045703,0.00007619773,0.000020412921,0.00002679377,0.00006124883,0.00014138035,0.00007325552,0.00029156034],"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":[5.555443e-7,0.0000022457011,3.140504e-7,0.000023951148,0.0000060165958,3.3624676e-7,0.000013457653,0.0000019881738,0.000017270066,0.9220954,0.0005267678,0.07731168],"study_design_scores_gemma":[0.0001206681,0.000051694482,0.000006696244,0.00006180099,0.0000123724585,0.000006201043,7.151928e-7,0.011038361,0.0011268491,0.45674434,0.5305697,0.00026061814],"about_ca_topic_score_codex":0.0000030087476,"about_ca_topic_score_gemma":5.335169e-7,"teacher_disagreement_score":0.5300429,"about_ca_system_score_codex":0.00000656029,"about_ca_system_score_gemma":0.000015805428,"threshold_uncertainty_score":0.37475154},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.6178483e-7,0.000036384972,0.48584914,0.000047341713,0.0005062153,0.000053554744,0.0000027952701,0.00016701747,0.5133373],"genre_scores_gemma":[0.00016415959,0.000025903542,0.02080173,0.00010621175,0.00052205194,0.0000011292246,0.000010566325,0.000016191654,0.97835207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915564,0.0000121084395,0.00016824709,0.00032837552,0.00020642515,0.00012920142],"domain_scores_gemma":[0.99916387,0.00004369805,0.00010035275,0.00055206066,0.00007775589,0.00006229185],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015376815,0.00018006003,0.00015366536,0.0000938824,0.00008210706,0.00011879278,0.0006947645,0.00018589481,0.0052296813],"category_scores_gemma":[0.0000074869095,0.00015136391,0.00007970941,0.000026250402,0.00003475044,0.00020194489,0.00021056588,0.00014928178,0.0037803156],"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":[5.795369e-7,0.0000020759985,1.538285e-7,0.0000069183097,0.000008851404,0.000004187346,0.00004861498,3.6165852e-7,0.000004766661,0.98723483,0.0061990214,0.006489638],"study_design_scores_gemma":[0.00003949778,0.0000311262,4.703087e-7,0.000015119759,0.000004041694,0.0000057771267,6.0282696e-7,0.0008761711,0.00011714708,0.4702974,0.5284404,0.00017223043],"about_ca_topic_score_codex":0.0000010086317,"about_ca_topic_score_gemma":6.666098e-7,"teacher_disagreement_score":0.5222414,"about_ca_system_score_codex":0.000022581818,"about_ca_system_score_gemma":0.00003957777,"threshold_uncertainty_score":0.99699533},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011220047,0.0021925676,0.8449931,0.0010550573,0.0000575217,0.0006160649,0.0000097385,0.00015031535,0.15091442],"genre_scores_gemma":[0.008899917,0.041181814,0.41669285,0.0013196408,0.0005393397,0.0006563256,0.00015652526,0.00016907524,0.5303845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989501,0.000014622997,0.00026340844,0.0004784387,0.00014509114,0.00014830941],"domain_scores_gemma":[0.99924195,0.00006241146,0.00014996127,0.00037951066,0.00008259361,0.00008355407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009731458,0.00021117034,0.00020946359,0.00022645024,0.00016843207,0.000100486555,0.00037433582,0.00015656103,0.000108522465],"category_scores_gemma":[0.000010769869,0.00021696635,0.000042847678,0.00013333051,0.00006328087,0.00027580626,0.00018073546,0.00018209913,0.000058953065],"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.0000011656995,0.000023223265,0.0000060191683,0.000022645554,0.0000119741135,0.0000021005583,0.0002705838,0.006363999,0.000008570477,0.98718685,0.00018514253,0.005917703],"study_design_scores_gemma":[0.00045169002,0.000034112123,0.000094250834,0.00014052601,0.000018382787,0.000031822132,0.000015136279,0.23675077,0.00020310226,0.01656296,0.7448289,0.000868335],"about_ca_topic_score_codex":0.0000015960755,"about_ca_topic_score_gemma":0.0000014786357,"teacher_disagreement_score":0.9706239,"about_ca_system_score_codex":0.000026719528,"about_ca_system_score_gemma":0.000047714322,"threshold_uncertainty_score":0.88476306},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.7499146e-7,0.00021493096,0.16539128,0.00018700554,0.00048658604,0.00006931218,0.0000020898863,0.00024430975,0.8334037],"genre_scores_gemma":[0.00014548266,0.00017185225,0.012629147,0.0005037424,0.00042821234,0.0000023430985,0.000003611779,0.000016254487,0.98609936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990224,0.0000098213195,0.00018580792,0.0003718337,0.00023095327,0.00017913822],"domain_scores_gemma":[0.99913365,0.00004318133,0.000074591946,0.0006225484,0.00003133124,0.00009472041],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00008916476,0.00020381798,0.00020354625,0.000069417554,0.00008687989,0.000057149566,0.00081267604,0.00017036179,0.0016079546],"category_scores_gemma":[0.000003933585,0.00017262019,0.00013645037,0.000019208761,0.00005817564,0.00014411307,0.00026416275,0.00020117736,0.0026962515],"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":[8.2666725e-7,0.0000038562075,9.573488e-8,0.0000031271622,0.000012353171,0.00008055288,0.000033241966,8.532472e-7,8.66612e-7,0.95175964,0.02031354,0.027791044],"study_design_scores_gemma":[0.00007002753,0.000028340999,5.780562e-7,0.000012192099,0.0000038828207,0.0000688898,2.1259804e-7,0.0008231108,0.00015102616,0.14860639,0.8499958,0.00023954891],"about_ca_topic_score_codex":0.0000020244638,"about_ca_topic_score_gemma":6.267299e-7,"teacher_disagreement_score":0.8296823,"about_ca_system_score_codex":0.000013743073,"about_ca_system_score_gemma":0.00006289504,"threshold_uncertainty_score":0.9993047},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.4027965e-8,0.000095108175,0.44631907,0.00010882077,0.0005213115,0.00006139281,7.0767555e-7,0.00018545294,0.5527081],"genre_scores_gemma":[0.00017089237,0.000022675573,0.06284724,0.0010926923,0.0008829821,0.0000023346875,0.0000023512323,0.000020108617,0.9349587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989436,0.00001735044,0.00020761849,0.00040681628,0.00018935635,0.00023521183],"domain_scores_gemma":[0.998796,0.00010598394,0.000112286034,0.0008264393,0.000061501385,0.00009783277],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00026955927,0.00023436562,0.0002645505,0.000045828823,0.000082353894,0.00009734874,0.0010217819,0.00020751567,0.0009664437],"category_scores_gemma":[0.0000071068703,0.00019574653,0.00013914086,0.000020759417,0.000032552696,0.00006451037,0.0003430237,0.00022022905,0.0019825906],"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":[9.236255e-7,0.0000013295877,1.2842723e-7,0.0000060087787,0.0000128450265,0.0000087939825,0.000007873045,0.00006406839,3.2610262e-7,0.90413135,0.017070977,0.07869534],"study_design_scores_gemma":[0.00007089915,0.000021466447,6.380017e-7,0.000029381434,0.0000044925255,0.000008142946,1.0431355e-7,0.017559871,0.0000067596725,0.2696511,0.71242356,0.00022362688],"about_ca_topic_score_codex":0.0000016258167,"about_ca_topic_score_gemma":0.000001989456,"teacher_disagreement_score":0.69535255,"about_ca_system_score_codex":0.000013030544,"about_ca_system_score_gemma":0.000026662901,"threshold_uncertainty_score":0.99994683},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.1203025e-7,0.000110815665,0.23334843,0.00012305884,0.000514247,0.00008372781,0.0000017710361,0.00060265,0.7652147],"genre_scores_gemma":[0.00012264756,0.000017644634,0.027567694,0.00069432834,0.00025829527,0.000005314905,0.0000018019243,0.000102716716,0.97122955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914163,0.000024770308,0.00008969521,0.00036754058,0.00018356947,0.00019280655],"domain_scores_gemma":[0.9991737,0.000029570632,0.00006155764,0.0006592282,0.0000062001286,0.00006977011],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00008857744,0.00018428074,0.00015986596,0.00015581191,0.000026304533,0.00007316843,0.0009280623,0.00014328142,0.0049251015],"category_scores_gemma":[0.0000075812395,0.00014549443,0.000068165085,0.00012174364,0.00002189741,0.000041226867,0.0001439635,0.00014475833,0.004196325],"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":[3.9900738e-7,0.000023058368,1.6581694e-7,0.000011638168,0.000009768888,0.000021060532,0.00001088712,0.00000401201,5.884614e-7,0.8026892,0.19101013,0.0062190667],"study_design_scores_gemma":[0.00022750413,0.00006562015,0.000002342274,0.00013557298,0.0000035227413,0.000008794988,0.0000010527244,0.00019949062,0.0001524656,0.19805315,0.8008201,0.0003303539],"about_ca_topic_score_codex":0.00006711822,"about_ca_topic_score_gemma":0.000021358559,"teacher_disagreement_score":0.60981,"about_ca_system_score_codex":0.000022344291,"about_ca_system_score_gemma":0.000043794724,"threshold_uncertainty_score":0.99657905},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.8184455e-8,0.00040251762,0.08679748,0.00022886824,0.00052673667,0.000059266476,0.0000027629685,0.00017614175,0.91180617],"genre_scores_gemma":[0.000040857787,0.00014213886,0.015505806,0.00013108771,0.00026582755,0.0000011908536,0.000001523826,0.0000108510185,0.9839007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992622,0.0000045706806,0.0001227111,0.00030809568,0.00017466837,0.0001277533],"domain_scores_gemma":[0.99859613,0.000038168375,0.0001565497,0.0011134936,0.00003312493,0.000062535306],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000149461,0.00016758892,0.00017919819,0.0000755375,0.00014665199,0.0002919245,0.0018223986,0.00014416793,0.0009718694],"category_scores_gemma":[0.0000055392616,0.00013359444,0.000105749925,0.000003997949,0.000040575593,0.00024598453,0.00041316776,0.00015448661,0.002420711],"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":[3.360449e-7,0.0000014189113,8.1946716e-8,0.0000082560555,0.00000926233,0.000030137207,0.000009376016,1.270445e-7,4.2343382e-7,0.92006123,0.0051439437,0.0747354],"study_design_scores_gemma":[0.000028899307,0.00001051027,5.104328e-7,0.000020722326,0.0000036967745,0.000011308944,1.217991e-7,0.00023806085,0.00001650992,0.4191836,0.5803514,0.0001346553],"about_ca_topic_score_codex":0.0000032830517,"about_ca_topic_score_gemma":0.0000014683928,"teacher_disagreement_score":0.5752075,"about_ca_system_score_codex":0.000009474245,"about_ca_system_score_gemma":0.000039037302,"threshold_uncertainty_score":0.99994135},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046705867,0.0003129723,0.13705398,0.00024464494,0.00027475998,0.00045053946,0.000017841865,0.00011252466,0.861486],"genre_scores_gemma":[0.001545103,0.00015309147,0.16241334,0.00015474053,0.00016422204,0.000033295015,0.000007718556,0.000056036366,0.83547246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869686,0.000018512916,0.00044147862,0.00040540105,0.00021820361,0.00021951116],"domain_scores_gemma":[0.9980315,0.00017055158,0.0003506148,0.0013023536,0.00005389564,0.00009108257],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048595853,0.00031422035,0.00045578982,0.00015485854,0.00022071159,0.00041718155,0.00094492984,0.00023843243,0.00006159839],"category_scores_gemma":[0.00007418581,0.00029241483,0.000097514734,0.000010524435,0.0001497318,0.00026915554,0.00051983044,0.00040100896,0.00008635395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.1062844e-7,0.000018771118,9.0564544e-7,0.00012420308,0.000015372247,0.000036561407,0.001021115,0.0000032061198,0.000008556562,0.99445707,0.00029132413,0.004022016],"study_design_scores_gemma":[0.000194495,0.0000292979,0.0000039758966,0.0004390951,0.00001626809,0.00003759863,0.000007643774,0.023026045,0.000074293675,0.9561195,0.019714287,0.00033755045],"about_ca_topic_score_codex":0.000001925338,"about_ca_topic_score_gemma":0.000008828213,"teacher_disagreement_score":0.038337607,"about_ca_system_score_codex":0.000046640536,"about_ca_system_score_gemma":0.00006920769,"threshold_uncertainty_score":0.9999528},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007182692,0.00015447821,0.9845116,0.0050974702,0.00096084276,0.00046292003,0.0004364228,0.00004818017,0.001145376],"genre_scores_gemma":[0.9517696,0.000030911127,0.046092916,0.0006467389,0.000263579,0.00009333254,0.000037622292,0.000009556703,0.001055746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981015,0.0001868735,0.0005105288,0.00037944803,0.0005495508,0.00027213435],"domain_scores_gemma":[0.99804157,0.0006202143,0.0003619288,0.0005251564,0.0003757199,0.00007540921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007687003,0.00022102,0.00019304815,0.000057161033,0.0001755413,0.00027097456,0.002254551,0.000072759794,0.00023534946],"category_scores_gemma":[0.00007427353,0.0001499496,0.00013912447,0.00013581975,0.00022081265,0.000445532,0.00017728172,0.00016854698,0.000046279998],"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.0001421969,0.00027300153,0.00030008174,0.000019472856,0.00016995767,0.0000018531811,0.002065169,0.0038675652,0.001369535,0.77566296,0.003002198,0.21312602],"study_design_scores_gemma":[0.00052179437,0.00035021297,0.0008018083,0.00003162916,0.000037091304,0.0000104036635,0.00031347456,0.9544294,0.007116394,0.0116377855,0.02453439,0.00021564667],"about_ca_topic_score_codex":0.00009420512,"about_ca_topic_score_gemma":0.000094576775,"teacher_disagreement_score":0.9505618,"about_ca_system_score_codex":0.00008795244,"about_ca_system_score_gemma":0.00011685406,"threshold_uncertainty_score":0.6114767},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014034309,0.000047059362,0.21054211,0.00058133004,0.0028129537,0.0012246174,0.00011192244,0.00022910487,0.7844369],"genre_scores_gemma":[0.0019578363,2.4365218e-7,0.015353245,0.00020075838,0.00020799131,0.00009180583,0.00006759161,0.00003899162,0.98208153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971655,0.000020601452,0.00061842724,0.00084300706,0.0007772307,0.000575236],"domain_scores_gemma":[0.9975591,0.00014030401,0.00018211064,0.0012090539,0.00039060504,0.00051885436],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016778153,0.000393214,0.00043126004,0.00078925624,0.00063019095,0.0006330181,0.0015507778,0.00017721664,0.0000921084],"category_scores_gemma":[0.000017998364,0.00035790415,0.00029307147,0.00014438936,0.00018682834,0.00030746227,0.0002496098,0.00031021988,0.0004214188],"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.00001169581,0.000009983446,3.331186e-8,0.00003879536,0.000015970314,0.000003939439,0.0013221124,0.000026884463,0.000044290075,0.94626856,0.021825792,0.03043192],"study_design_scores_gemma":[0.0002646634,0.00007469347,1.8028388e-7,0.00013462188,0.000025324356,0.0000093044155,0.000012692887,0.0028788089,0.00028947293,0.21335848,0.78257215,0.0003796205],"about_ca_topic_score_codex":0.00000222943,"about_ca_topic_score_gemma":0.0009061421,"teacher_disagreement_score":0.76074636,"about_ca_system_score_codex":0.00023204752,"about_ca_system_score_gemma":0.0006769841,"threshold_uncertainty_score":0.9998873},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000041452204,0.00013399796,0.26779395,0.000050964944,0.00013621716,0.00007897446,0.000003431078,0.000077063654,0.7317213],"genre_scores_gemma":[0.00055673235,0.000074930365,0.074100025,0.00005891985,0.00018300719,0.0000021699195,0.000003848848,0.0000099228855,0.92501044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993616,0.000005984903,0.00018793198,0.00022734045,0.00014636875,0.00007079446],"domain_scores_gemma":[0.99908423,0.000053441036,0.00018609682,0.0005512902,0.000094470444,0.000030441059],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014217941,0.00010823533,0.00014414186,0.00009127428,0.000024720573,0.000023088103,0.00068772177,0.00011005095,0.0010138857],"category_scores_gemma":[0.0000047681915,0.000088908986,0.00006942249,0.000025646994,0.000048911163,0.00011215802,0.00017331948,0.000059942686,0.00062444125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.280306e-7,0.000004178625,2.7413927e-7,0.000019206625,0.000008661079,5.935399e-7,0.000045067532,2.772393e-7,0.000022657756,0.97293764,0.0017607233,0.02519981],"study_design_scores_gemma":[0.00009864932,0.000071544484,0.000004952259,0.00005988936,0.000011365425,0.000006649515,0.0000018827945,0.003972704,0.002090349,0.6261489,0.36730048,0.00023265585],"about_ca_topic_score_codex":0.0000024850913,"about_ca_topic_score_gemma":7.160307e-7,"teacher_disagreement_score":0.36553976,"about_ca_system_score_codex":0.000007747878,"about_ca_system_score_gemma":0.000022315058,"threshold_uncertainty_score":0.9998993},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007029291,0.06645124,0.85699517,0.036011405,0.00046132706,0.00033515197,0.0000015075061,0.00041623003,0.03925769],"genre_scores_gemma":[0.12604664,0.04251847,0.65198725,0.16416141,0.0045531327,0.00016562772,0.000008237707,0.00006968593,0.010489534],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995458,0.000054556505,0.0000943743,0.00014896656,0.00006852744,0.00008778692],"domain_scores_gemma":[0.9996614,0.000021935557,0.000025618441,0.00020149347,0.000009398624,0.00008019493],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014157136,0.000050640516,0.000104391525,0.000005292183,0.000026403828,0.000039420884,0.0005209263,0.000010936946,0.00052042195],"category_scores_gemma":[0.000033666878,0.000040060473,0.00004122117,0.00013843499,0.0000071447926,0.0001534071,0.00014490227,0.000048704595,0.0037713894],"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":[4.5008602e-7,0.0000095054875,0.000009040747,0.00025372402,0.0000046070236,0.0000074566888,0.00031393132,0.0000019649524,0.000029918721,0.15503316,0.010638081,0.83369815],"study_design_scores_gemma":[0.00003895941,0.000018891782,0.000010952092,0.000031001477,0.0000030441329,0.0000027387741,0.0000011827951,0.003851963,0.00024011133,0.0036551682,0.99208206,0.00006390075],"about_ca_topic_score_codex":3.9266712e-7,"about_ca_topic_score_gemma":2.523013e-8,"teacher_disagreement_score":0.981444,"about_ca_system_score_codex":0.0000020819934,"about_ca_system_score_gemma":0.000009880568,"threshold_uncertainty_score":0.9970043},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.303421e-8,0.00019604608,0.33081284,0.00025708575,0.00014717755,0.000071141905,0.0000017404417,0.00017890909,0.668335],"genre_scores_gemma":[0.00003233786,0.000009892582,0.058769185,0.0001092421,0.00013781109,0.0000030157894,0.0000023178845,0.000014781963,0.9409214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904627,0.000009320353,0.00019688632,0.00028997814,0.00030649308,0.00015106078],"domain_scores_gemma":[0.99897486,0.00008494613,0.00007075026,0.0006699766,0.00007958359,0.00011990939],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00027666203,0.0001998603,0.00024627298,0.000061312596,0.00004259693,0.000119856086,0.0008435424,0.00017943484,0.0016958324],"category_scores_gemma":[0.00002126519,0.00015232334,0.00008643781,0.00001490038,0.00007448348,0.00015436189,0.00042439313,0.00018186586,0.0035151155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001328645,0.0000059709546,1.0309922e-8,0.000020470925,0.000011134995,0.000023816187,0.000069533446,7.073295e-7,1.9650457e-7,0.9688988,0.019177249,0.011790815],"study_design_scores_gemma":[0.000038607985,0.000037654103,3.2167502e-8,0.00002758646,0.000006112294,0.000032693937,0.0000014348751,0.0013722858,0.000009903832,0.6544614,0.3438723,0.00013996984],"about_ca_topic_score_codex":3.246022e-7,"about_ca_topic_score_gemma":1.9873261e-7,"teacher_disagreement_score":0.32469505,"about_ca_system_score_codex":0.000020658186,"about_ca_system_score_gemma":0.000079225836,"threshold_uncertainty_score":0.99921674},"labels":[],"label_agreement":null},{"id":"W4253510993","doi":"10.1002/nla.258.abs","title":"On the growth factor in Gaussian elimination for generalized Higham matrices","year":2002,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Gaussian elimination; Positive-definite matrix; Hermitian matrix; Mathematics; Gaussian; Matrix (chemical analysis); Class (philosophy); Factor (programming language); Combinatorics; Pure mathematics; Computer science; Physics; Chemistry","score_opus":0.01661374818348609,"score_gpt":0.2450198333137332,"score_spread":0.2284060851302471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253510993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033053958,0.0000593501,0.98454875,0.009927425,0.00003338033,0.0009015914,0.00001836191,0.00013671366,0.0010690505],"genre_scores_gemma":[0.8873215,0.00002574186,0.10934124,0.0010923396,0.00017151104,0.0016088473,0.000013939015,0.000019857454,0.0004050274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989392,0.000063353946,0.00020916182,0.0003482011,0.00020633981,0.00023374862],"domain_scores_gemma":[0.99884874,0.00047020087,0.00009908132,0.0004350247,0.000068428104,0.000078556164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013044363,0.00014023844,0.00013881647,0.00009320819,0.00020817286,0.000082753184,0.0006317405,0.000051186,0.00010809554],"category_scores_gemma":[0.000043406177,0.00008679354,0.000052884458,0.0008296615,0.000043594988,0.00015880005,0.00004146391,0.00013826275,0.00014545543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009372258,0.00016129616,0.000029617204,0.000009124406,0.000007005121,5.728335e-7,0.00012359806,0.00009221931,0.00003405858,0.9865963,0.00041774375,0.012519131],"study_design_scores_gemma":[0.001472485,0.00047755693,0.0020222827,0.0000276199,0.00002684389,0.000012487646,0.000039267336,0.80545056,0.0025729123,0.14981095,0.03747532,0.00061173656],"about_ca_topic_score_codex":0.000008931739,"about_ca_topic_score_gemma":0.000001535676,"teacher_disagreement_score":0.8840161,"about_ca_system_score_codex":0.000030174038,"about_ca_system_score_gemma":0.000013450309,"threshold_uncertainty_score":0.35393375},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11000067,0.00012169552,0.88316435,0.003746176,0.0023895605,0.00010621164,0.0000036944018,0.000009655033,0.00045800948],"genre_scores_gemma":[0.9831792,0.000022620114,0.013224765,0.0007360629,0.0003399545,8.70107e-7,5.6455394e-7,0.0000042425986,0.0024917026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994308,0.000043280696,0.0001691299,0.000054719934,0.00021051566,0.00009157455],"domain_scores_gemma":[0.9994894,0.000089133966,0.00014531476,0.00012801636,0.00011534556,0.000032781696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040220117,0.00004608498,0.000079753234,0.000041113562,0.00016640822,0.00007946925,0.0006843217,0.000019117198,0.00004235471],"category_scores_gemma":[0.000049189402,0.000027332419,0.00010524444,0.00009719495,0.00002589713,0.00026923226,0.00007720829,0.00007150861,0.000023126559],"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.00038653048,0.00061241764,0.0039340234,0.00007449863,0.00018031787,0.000072874194,0.0020871838,0.011228545,0.0075878133,0.8332859,0.10067583,0.03987406],"study_design_scores_gemma":[0.0035188226,0.00065608625,0.0015133254,0.00021340109,0.000046813868,0.0017463546,0.00043578353,0.15476164,0.035755422,0.042973325,0.75800294,0.00037608953],"about_ca_topic_score_codex":9.973409e-7,"about_ca_topic_score_gemma":2.6084317e-7,"teacher_disagreement_score":0.87317854,"about_ca_system_score_codex":0.00001931041,"about_ca_system_score_gemma":0.00005629266,"threshold_uncertainty_score":0.12798943},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051648496,0.005674728,0.99088705,0.0004448738,0.00018081766,0.0017351978,0.00014980343,0.00013601998,0.0002750525],"genre_scores_gemma":[0.04366392,0.0021662978,0.94700116,0.00036559204,0.0010260104,0.0035055534,0.000065321066,0.00006736762,0.0021387963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977848,0.00006591238,0.0005056223,0.000835713,0.00025266877,0.0005552722],"domain_scores_gemma":[0.99839514,0.00036141687,0.00021545753,0.0005270392,0.00015823424,0.00034271728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000462683,0.0003395779,0.0004436751,0.00022706945,0.000678169,0.0004225121,0.0004671378,0.00012505094,0.0000097673565],"category_scores_gemma":[0.00001703935,0.00031318804,0.00010503122,0.0005704588,0.00016761283,0.00040439176,0.00021331324,0.00016971838,0.000022685303],"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.000007661918,0.00030896676,0.000044282096,0.00011864205,0.000117774114,0.000008213941,0.00033317195,0.0008749604,0.000099446544,0.42618594,0.0006239083,0.571277],"study_design_scores_gemma":[0.0013323053,0.00010957713,0.000098320495,0.000024736773,0.000047812886,0.00012729656,0.0000492417,0.94234556,0.000019218158,0.014352325,0.04107183,0.00042178578],"about_ca_topic_score_codex":0.00007598074,"about_ca_topic_score_gemma":0.0000010981942,"teacher_disagreement_score":0.94147056,"about_ca_system_score_codex":0.000043109612,"about_ca_system_score_gemma":0.000026124932,"threshold_uncertainty_score":0.999932},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058524784,0.00029727272,0.9331037,0.0006242551,0.0015020744,0.0008025851,0.00005790242,0.00049536105,0.0045921095],"genre_scores_gemma":[0.66112494,0.000050468556,0.33610395,0.000030232852,0.0002768667,0.000059736725,0.000031753883,0.000034201163,0.002287823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986409,0.00004304729,0.0004789295,0.0003287165,0.00021342657,0.00029500265],"domain_scores_gemma":[0.99877053,0.00055127527,0.00008978673,0.00042805562,0.00010734297,0.00005302054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013038552,0.00015213012,0.0001890154,0.00014791563,0.00008849577,0.00029080873,0.00047985517,0.0000785557,0.0000054394686],"category_scores_gemma":[0.0005369131,0.00013034756,0.000049092356,0.0008666618,0.0000294098,0.00035140157,0.000112621194,0.00014781441,0.00009389471],"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.000021454161,0.00010027787,0.000007275655,0.001207916,0.000024241306,0.000050481885,0.0050135297,0.00045799586,0.0011882345,0.9773943,0.001570061,0.012964244],"study_design_scores_gemma":[0.00028313653,0.000065244705,0.00001338868,0.00044728813,0.000008287972,0.000024914054,0.00014118254,0.69364655,0.004492676,0.29981717,0.0008884386,0.00017168492],"about_ca_topic_score_codex":0.0000031751913,"about_ca_topic_score_gemma":0.0000049355212,"teacher_disagreement_score":0.69318855,"about_ca_system_score_codex":0.000043724354,"about_ca_system_score_gemma":0.00007718928,"threshold_uncertainty_score":0.53154194},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014969632,0.0000139626245,0.98312426,0.00053381006,0.000038071637,0.0011391066,0.0000062861263,0.00010254919,0.000072297975],"genre_scores_gemma":[0.5077284,9.467812e-8,0.49195343,0.000038052833,0.000017744194,0.00023010821,0.00001159334,0.0000068429767,0.000013712601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883986,0.0001422233,0.0002735432,0.00021680156,0.00029629294,0.00023129552],"domain_scores_gemma":[0.99917215,0.00029084383,0.00016296872,0.0002604572,0.00006682936,0.000046746107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012939845,0.000102636484,0.0001660148,0.000034183013,0.0005323179,0.00008107464,0.00046916315,0.000016863109,0.000020735612],"category_scores_gemma":[0.000020661768,0.00006979131,0.000051457075,0.00024265854,0.00008598104,0.00020057356,0.00018944388,0.0001361127,0.000001056859],"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.0001436973,0.0012740549,0.00005237545,0.00067975133,0.00009534426,0.000005798532,0.005332202,0.009354282,0.00039812733,0.7685151,0.000052286752,0.214097],"study_design_scores_gemma":[0.00045529866,0.0006652475,0.000017394364,0.000022619977,0.000019149815,0.000022593702,0.00051309355,0.879827,0.00036866614,0.11698036,0.0009988553,0.00010970635],"about_ca_topic_score_codex":0.000018687102,"about_ca_topic_score_gemma":0.000007715661,"teacher_disagreement_score":0.8704727,"about_ca_system_score_codex":0.00004224263,"about_ca_system_score_gemma":0.00004381328,"threshold_uncertainty_score":0.40942127},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022027287,0.00010599735,0.9833271,0.0017241344,0.0016096034,0.00062830426,0.00008024358,0.00036068424,0.01214191],"genre_scores_gemma":[0.0007139543,0.000003091021,0.9879654,0.00077220553,0.00040812264,0.00005783149,0.00005711315,0.00002109585,0.010001208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978987,0.00024573517,0.00031861642,0.0008600604,0.00032466516,0.00035220286],"domain_scores_gemma":[0.99765223,0.00043672314,0.00018247549,0.0015146609,0.00005890892,0.0001550071],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007090891,0.000284056,0.0003991586,0.00013865059,0.00023324725,0.0003800864,0.0040915804,0.00013301625,0.005718198],"category_scores_gemma":[0.000069150316,0.00026038493,0.0002534959,0.0001998241,0.000010013073,0.00014651331,0.008209562,0.0005199567,0.0000061741125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012203492,0.000015438494,0.0000035369567,0.0001849919,0.000076860226,0.0000062145054,0.0005196767,0.0053492486,0.0003210011,0.7885016,0.039351884,0.1656573],"study_design_scores_gemma":[0.00019063393,0.000027829587,0.000030066112,0.000008609247,0.000011418607,0.000007761633,0.000021134909,0.3478918,0.00045606302,0.55072385,0.10036155,0.00026926192],"about_ca_topic_score_codex":0.0003035645,"about_ca_topic_score_gemma":0.000021112935,"teacher_disagreement_score":0.34254256,"about_ca_system_score_codex":0.000059639835,"about_ca_system_score_gemma":0.00026846674,"threshold_uncertainty_score":0.99998486},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009720106,0.00047211538,0.7838321,0.00037390017,0.007401342,0.00032229314,0.000014775628,0.0006136547,0.20687263],"genre_scores_gemma":[0.0025852087,0.0005837841,0.38951415,0.0004318764,0.0035205956,0.00020626046,0.0004448588,0.0001347685,0.6025785],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99482834,0.00027532168,0.0009463639,0.001241532,0.0022399146,0.0004684972],"domain_scores_gemma":[0.9966569,0.0003001646,0.0006065979,0.0019291259,0.00028938247,0.00021785963],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0029419907,0.00040491926,0.0006451229,0.00023902845,0.00029231154,0.00017784834,0.0020377517,0.00027157782,0.0048186025],"category_scores_gemma":[0.0005903631,0.00034074046,0.00040725,0.00066979794,0.000041529904,0.00026758295,0.0019724274,0.00095655536,0.0002483468],"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.000032732514,0.00046420723,0.000064451306,0.00017056901,0.0001786755,0.012913134,0.00014816696,0.00024030948,0.000016228558,0.06374721,0.41844177,0.50358254],"study_design_scores_gemma":[0.00014881697,0.00014760124,0.000072120616,0.00003074169,0.000023598908,0.005398143,0.000009261914,0.011415495,0.0001522819,0.0070075956,0.9750845,0.0005098493],"about_ca_topic_score_codex":0.0001144098,"about_ca_topic_score_gemma":0.0000019418446,"teacher_disagreement_score":0.5566427,"about_ca_system_score_codex":0.00024193956,"about_ca_system_score_gemma":0.0015910652,"threshold_uncertainty_score":0.99990445},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085553445,0.00007517274,0.98648447,0.0004675664,0.0014071596,0.0019289386,0.00011608244,0.00021992862,0.00844512],"genre_scores_gemma":[0.44420773,0.000013813382,0.54707015,0.00055263395,0.00035242486,0.000989611,0.00008732551,0.000067226596,0.006659082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977129,0.00033059265,0.00046628722,0.00067400065,0.00046167517,0.0003545436],"domain_scores_gemma":[0.9978845,0.00019589489,0.00041452443,0.0013199429,0.000117852265,0.00006727805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011516232,0.00028042085,0.00040682443,0.00011533344,0.0003807294,0.00007856566,0.002421027,0.000118418604,0.00028139428],"category_scores_gemma":[0.0000673101,0.00021033076,0.0004203384,0.00031066342,0.000118940785,0.00009323327,0.00313727,0.00039178372,0.0000068431755],"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.000047233232,0.00025841562,0.000011975934,0.0005594554,0.0001947064,0.0000019594747,0.0018635305,0.11324328,0.001933787,0.8728323,0.0049106795,0.0041426886],"study_design_scores_gemma":[0.00038475113,0.00011472696,0.00013089133,0.000057635614,0.000060809558,0.000006071042,0.000057064342,0.81107527,0.0020689312,0.1842845,0.0013841147,0.00037526156],"about_ca_topic_score_codex":0.00011892108,"about_ca_topic_score_gemma":0.000027314978,"teacher_disagreement_score":0.697832,"about_ca_system_score_codex":0.0001416272,"about_ca_system_score_gemma":0.00034544547,"threshold_uncertainty_score":0.857704},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17777708,0.00058904645,0.780804,0.03130965,0.008174832,0.00030187322,0.00006803812,0.000058303205,0.0009171947],"genre_scores_gemma":[0.9896022,0.0000031574366,0.008491209,0.0009388376,0.0003988076,0.00000971149,0.000009546371,0.0000042933357,0.00054221286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990789,0.000042812673,0.0003010354,0.00010337534,0.00038573812,0.00008812704],"domain_scores_gemma":[0.99917233,0.00009703128,0.00034368597,0.000068872156,0.0002683852,0.000049689927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072490686,0.00005718396,0.00008392745,0.00016117991,0.00013741956,0.00007624767,0.00048017068,0.000011708229,0.00012529099],"category_scores_gemma":[0.000036843816,0.000052128133,0.00006950329,0.0000627077,0.000014451917,0.0002762584,0.00015383854,0.00010783536,0.0000024464193],"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.00045074712,0.00052258454,0.0015069629,0.00003169775,0.00035764527,0.00012317332,0.0048356564,0.0069719567,0.010497732,0.70275384,0.014300797,0.25764722],"study_design_scores_gemma":[0.01034343,0.0014191318,0.0022883546,0.000090914094,0.000056995006,0.0046383613,0.0014190616,0.4525369,0.018469715,0.25298396,0.25497606,0.000777117],"about_ca_topic_score_codex":0.0000016502784,"about_ca_topic_score_gemma":3.3588248e-7,"teacher_disagreement_score":0.81182516,"about_ca_system_score_codex":0.000038936454,"about_ca_system_score_gemma":0.000073314055,"threshold_uncertainty_score":0.21257235},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3535893,0.02521469,0.6038325,0.013571673,0.0010598893,0.0020736707,0.000022374328,0.000059682367,0.0005762303],"genre_scores_gemma":[0.72062814,0.0031255966,0.2713039,0.00026418472,0.00070291647,0.0002764653,0.0000013326938,0.00005899258,0.0036385024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977416,0.0004258583,0.0004231531,0.00013445498,0.00097556395,0.00029936765],"domain_scores_gemma":[0.99722654,0.0017487672,0.00025857263,0.00031759843,0.00036372506,0.00008477326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010285771,0.00008984115,0.0002169019,0.00023418649,0.0012013913,0.00041067842,0.0013293079,0.00002216741,0.000065625],"category_scores_gemma":[0.00044342957,0.000054840588,0.00009167503,0.0003774641,0.00010725383,0.00026331504,0.00077813317,0.00047921768,0.0000022469005],"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.000115927345,0.0008847322,0.00007719935,0.0011386764,0.00041109746,0.00009553453,0.051553298,0.0077618156,0.008918827,0.89071536,0.015679039,0.022648498],"study_design_scores_gemma":[0.0012689458,0.0008740205,0.000056102876,0.00010054019,0.000027400734,0.00061446836,0.008611453,0.56644624,0.0011314382,0.3908203,0.029840546,0.00020853628],"about_ca_topic_score_codex":0.00000563395,"about_ca_topic_score_gemma":0.0000018426708,"teacher_disagreement_score":0.5586844,"about_ca_system_score_codex":0.000054467353,"about_ca_system_score_gemma":0.00018825867,"threshold_uncertainty_score":0.92402524},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040741594,0.000063777494,0.99583894,0.00042946066,0.00012648424,0.00014145613,9.670144e-7,0.000013462089,0.0029780173],"genre_scores_gemma":[0.040511012,0.00013221466,0.95644736,0.00042666687,0.0023723515,0.000035487636,0.0000018191442,0.00001105193,0.00006202151],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938226,0.000085514315,0.00020321898,0.00014824347,0.00010289503,0.000077879624],"domain_scores_gemma":[0.9995053,0.00013378539,0.00020145012,0.000069781636,0.00002866767,0.000061053164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061831955,0.00007423432,0.00014055095,0.00009740952,0.0002939333,0.00007985666,0.00009877234,0.000021602873,0.000024006747],"category_scores_gemma":[0.000012051803,0.000058343903,0.000019533678,0.00022752979,0.000025680572,0.00012795304,0.00010813126,0.00017228747,2.4256858e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000860804,0.00007732999,0.000005897716,0.00001170782,0.000015291736,0.000001118943,0.001155863,0.026524456,0.0003075173,0.0445301,0.0001378005,0.92714685],"study_design_scores_gemma":[0.0008271886,0.0006331795,0.000081152546,0.000009505706,0.000021470467,0.0002586819,0.00084803725,0.8725862,0.0009237266,0.02570625,0.097884536,0.00022006487],"about_ca_topic_score_codex":5.212458e-7,"about_ca_topic_score_gemma":8.5140455e-9,"teacher_disagreement_score":0.9269268,"about_ca_system_score_codex":0.000018001552,"about_ca_system_score_gemma":0.000016655855,"threshold_uncertainty_score":0.23791954},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023495972,0.00009018545,0.99616396,0.00028442618,0.00032720476,0.00015309072,0.000026581705,0.00020878663,0.00039618718],"genre_scores_gemma":[0.07611477,0.000002010732,0.9228522,0.00040656398,0.00030037525,0.0000071034788,0.00011685816,0.00002645677,0.00017362504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969874,0.00063191226,0.0005022709,0.0010204163,0.0004820449,0.00037594113],"domain_scores_gemma":[0.99770504,0.0006116002,0.000325271,0.000833152,0.00035619573,0.00016875764],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010187592,0.0003604683,0.00043909936,0.00016025381,0.00043248665,0.0008665868,0.0009898399,0.00021210326,0.00015278955],"category_scores_gemma":[0.00007803176,0.00031566247,0.00013318735,0.0003822369,0.00004464447,0.000624269,0.001150448,0.00043088794,0.0000022259878],"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.000026775819,0.0003722762,0.000025327337,0.000117016054,0.00036303067,0.00008591765,0.002621472,0.6779118,0.0373645,0.2208403,0.000047051504,0.06022453],"study_design_scores_gemma":[0.00029096313,0.000044091248,0.000009203021,0.00008851554,0.000027686958,0.000045656918,0.00010201377,0.9810821,0.014276643,0.0035196077,0.000061390485,0.0004521352],"about_ca_topic_score_codex":0.00024719385,"about_ca_topic_score_gemma":0.000026309794,"teacher_disagreement_score":0.3031703,"about_ca_system_score_codex":0.00007080307,"about_ca_system_score_gemma":0.0007402221,"threshold_uncertainty_score":0.99992955},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10587187,0.00016816679,0.88898236,0.0028050519,0.0001277227,0.00096267747,0.00007707691,0.00018902338,0.00081606343],"genre_scores_gemma":[0.36148924,0.00002789079,0.63696754,0.000052678977,0.000018253479,0.00010663461,0.0010545055,0.000023275672,0.0002599812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99309254,0.0046022255,0.00064220314,0.0008981559,0.00042553744,0.00033935037],"domain_scores_gemma":[0.9939587,0.00058160385,0.0008144896,0.0016704394,0.0028153087,0.00015946208],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005263798,0.0003285618,0.0004885345,0.00017055732,0.0003910063,0.00048016608,0.0014540862,0.0001940905,0.000022182476],"category_scores_gemma":[0.00016974253,0.00033194324,0.00018613042,0.00039749153,0.00019111983,0.00043206676,0.0011019576,0.0003828667,0.0000013797797],"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.00020279898,0.0041701416,0.0006024301,0.0027383694,0.0005298739,0.000018845822,0.030573165,0.013148049,0.012644439,0.8372622,0.00035892843,0.09775072],"study_design_scores_gemma":[0.0014160359,0.0000059264485,0.00037472055,0.0013124163,0.00007135915,0.000017838305,0.00011402274,0.9038852,0.060382225,0.031078843,0.00082430633,0.00051711255],"about_ca_topic_score_codex":0.0016946865,"about_ca_topic_score_gemma":0.0026715985,"teacher_disagreement_score":0.8907371,"about_ca_system_score_codex":0.000118011056,"about_ca_system_score_gemma":0.0005954923,"threshold_uncertainty_score":0.9999133},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025826804,0.0009667566,0.922393,0.015289503,0.00046652072,0.00041129504,0.000016387026,0.00017287319,0.03445681],"genre_scores_gemma":[0.87205917,0.00034250758,0.12172351,0.00065220986,0.000032541477,0.00012582465,0.00019466829,0.000026147534,0.004843399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98934054,0.008443698,0.00048724056,0.00081377255,0.00053059554,0.0003841358],"domain_scores_gemma":[0.99372566,0.0020519316,0.00030449347,0.0030237143,0.00079211104,0.00010210463],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008412823,0.00029115268,0.00030607363,0.00016244598,0.00028141798,0.0011116398,0.0041057817,0.00021383922,0.00007258787],"category_scores_gemma":[0.0011314371,0.0002530922,0.00017999137,0.0007290442,0.00011921264,0.00023880957,0.003036171,0.0008442413,0.000044903136],"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.000005737948,0.0010701111,0.0008461113,0.00020528893,0.00007978888,0.00014260015,0.057290625,0.0005561095,0.0002641792,0.79538506,0.000777104,0.14337727],"study_design_scores_gemma":[0.0026180244,0.0000015338243,0.014478425,0.006854869,0.00008734499,0.0001424373,0.0017408251,0.7394964,0.04807897,0.10405085,0.079574704,0.0028755786],"about_ca_topic_score_codex":0.00058578484,"about_ca_topic_score_gemma":0.00090671546,"teacher_disagreement_score":0.8462324,"about_ca_system_score_codex":0.0000817043,"about_ca_system_score_gemma":0.00037083938,"threshold_uncertainty_score":0.99999213},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0678429,0.0007031956,0.9259357,0.0028060935,0.00046505188,0.000664602,0.000027726193,0.00011623528,0.0014385033],"genre_scores_gemma":[0.9225016,0.000053431988,0.07637933,0.000039983388,0.000029470235,0.00006676866,0.0001550781,0.000019961524,0.0007543623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604475,0.0021109937,0.0005573355,0.00062267954,0.00040872922,0.0002555299],"domain_scores_gemma":[0.9900867,0.004610059,0.0004801261,0.002302871,0.0024416791,0.00007861105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005654734,0.00024439412,0.00031162254,0.00013451601,0.00037036918,0.0004163026,0.0017908586,0.0001992617,0.000040057075],"category_scores_gemma":[0.0014581231,0.00020783184,0.0003081639,0.00040978746,0.00009136041,0.0002070216,0.0013240473,0.0003160475,0.000003373144],"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.000011828659,0.00048608205,0.00013625929,0.00034697657,0.00012141796,0.0000011932336,0.019090632,0.1844888,0.003449275,0.7200146,0.00007485035,0.07177812],"study_design_scores_gemma":[0.0002800185,3.773502e-7,0.00044976827,0.00041896733,0.000033724897,0.0000018661387,0.000118239375,0.9435108,0.046867374,0.006727012,0.0013790712,0.00021282407],"about_ca_topic_score_codex":0.0001593305,"about_ca_topic_score_gemma":0.000076160344,"teacher_disagreement_score":0.8546587,"about_ca_system_score_codex":0.00006565642,"about_ca_system_score_gemma":0.00025292358,"threshold_uncertainty_score":0.8475136},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07037536,0.002472365,0.9162763,0.0037848877,0.00053815695,0.0018983053,0.00011716857,0.00019889587,0.004338568],"genre_scores_gemma":[0.64973235,0.00035138236,0.3417329,0.00042272022,0.00010769501,0.00060353667,0.000009009814,0.000036524987,0.007003899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994058,0.0000334434,0.0001746513,0.00012877592,0.00014393975,0.00011338727],"domain_scores_gemma":[0.9988989,0.00059840764,0.000119735014,0.00033041087,0.000025814206,0.00002672218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039650558,0.00008517269,0.00014845024,0.00004975652,0.00020336303,0.00003661597,0.0003922028,0.000010587591,0.000030337316],"category_scores_gemma":[0.00002368045,0.00005375809,0.000054370692,0.00020955662,0.000036912847,0.00006552073,0.00023887621,0.000035486224,0.0000034830387],"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.000025401056,0.0005178864,0.00003195544,0.00027581424,0.00013996735,0.0000068358563,0.0057897167,0.00059436134,0.0013403787,0.95350766,0.0018264774,0.035943564],"study_design_scores_gemma":[0.0020396297,0.00111546,0.000081440485,0.000029152647,0.0001771214,0.00010983986,0.0012432324,0.602992,0.004135371,0.31674373,0.07100139,0.00033165017],"about_ca_topic_score_codex":0.0000029152989,"about_ca_topic_score_gemma":0.0000014291073,"teacher_disagreement_score":0.63676393,"about_ca_system_score_codex":0.00001642127,"about_ca_system_score_gemma":0.000023416604,"threshold_uncertainty_score":0.21921912},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058459368,0.000052892537,0.93791956,0.0009990205,0.0005611766,0.0012102635,0.00012372312,0.0001214864,0.00055250106],"genre_scores_gemma":[0.99471617,0.0000036757585,0.0047670957,0.00026619757,0.000044067416,0.0000022166678,0.000009370062,0.000008263293,0.00018293055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979508,0.00033884804,0.00027997073,0.0010442473,0.000081133054,0.00030499743],"domain_scores_gemma":[0.9968292,0.0013548994,0.0002840478,0.0011646486,0.00023551934,0.0001316789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011649496,0.0002737828,0.00044516404,0.00007113677,0.00027313785,0.0002511491,0.0014205981,0.00013143434,0.0000069563166],"category_scores_gemma":[0.00019701454,0.00023019538,0.000189358,0.00033185835,0.00032135216,0.00014622282,0.0010094021,0.00026017547,0.0000122094225],"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.0006920722,0.00007085834,0.007003183,0.00021495529,0.000085015134,0.000006843101,0.0003782221,0.22931038,0.000012476773,0.7598674,0.00009628235,0.0022622687],"study_design_scores_gemma":[0.0013883342,0.00002839473,0.00071634044,0.000078733894,0.00003548208,5.6642324e-7,0.00008367516,0.90268105,0.000041297208,0.094428554,0.0002631317,0.00025443512],"about_ca_topic_score_codex":0.00008852849,"about_ca_topic_score_gemma":0.000039089497,"teacher_disagreement_score":0.9362568,"about_ca_system_score_codex":0.00013038772,"about_ca_system_score_gemma":0.00016850265,"threshold_uncertainty_score":0.9387095},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97836924,0.0002025232,0.0072136265,0.00046198146,0.00011919514,0.00024806612,0.00030144188,0.000346234,0.012737688],"genre_scores_gemma":[0.981182,0.00020530837,0.011029323,0.00005136203,0.00004945411,1.4621333e-8,0.00008754158,0.000018537345,0.007376493],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99804217,0.00007837197,0.00025024053,0.0006466027,0.0005082309,0.00047437186],"domain_scores_gemma":[0.99824685,0.00018432886,0.0004448883,0.0006896016,0.00011538069,0.00031894026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009240418,0.00032222102,0.00048725135,0.00050575513,0.00045852177,0.00010816195,0.0026479666,0.00011475794,0.00057234475],"category_scores_gemma":[0.000019574254,0.00042148112,0.00038075252,0.0013071093,0.0004434469,0.006538505,0.0015734979,0.00028624246,0.00030392935],"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.00008896767,0.0004022219,0.9345778,0.00014629825,0.00015039668,0.00055453286,0.00058646686,0.00024616244,3.736715e-7,0.0032716838,0.0033330042,0.056642056],"study_design_scores_gemma":[0.0016067021,0.0004781648,0.89548016,0.00012817504,0.00010480736,0.00006688828,0.00019498543,0.016869113,0.000045885023,0.0014516028,0.08258207,0.0009914406],"about_ca_topic_score_codex":0.00012543978,"about_ca_topic_score_gemma":0.00016765975,"teacher_disagreement_score":0.07924907,"about_ca_system_score_codex":0.000052582312,"about_ca_system_score_gemma":0.000098456054,"threshold_uncertainty_score":0.9998237},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005424081,0.010182786,0.52203,0.0049354243,0.0022399295,0.0057314304,0.00045997655,0.0014308924,0.45244718],"genre_scores_gemma":[0.1123234,0.019979008,0.08262783,0.00475324,0.0047852728,0.005690852,0.0016250024,0.0010390502,0.76717633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99658984,0.00012945136,0.0009122673,0.0012166728,0.0006181644,0.00053358544],"domain_scores_gemma":[0.99725705,0.00023831455,0.0006526786,0.0014518236,0.00013008423,0.00027005468],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008156631,0.0006930067,0.0007421969,0.00045632847,0.001052044,0.00053067016,0.0012295393,0.00032622094,0.0031810624],"category_scores_gemma":[0.000016108585,0.0007422498,0.0002283811,0.00027705106,0.00025171958,0.0005461089,0.0013589618,0.000713572,0.0006343888],"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.000014255757,0.000059314352,0.000015283043,0.0005180646,0.00009448321,0.000032205386,0.0002927665,0.000041689025,0.000055365563,0.93566287,0.00040597,0.06280771],"study_design_scores_gemma":[0.00045507267,0.0001722278,0.00008291265,0.00017567973,0.0001290871,0.00015922055,0.00005261728,0.00454788,0.00015854505,0.15140684,0.84165865,0.0010012435],"about_ca_topic_score_codex":0.00002462164,"about_ca_topic_score_gemma":0.0000032755975,"teacher_disagreement_score":0.8412527,"about_ca_system_score_codex":0.00008997878,"about_ca_system_score_gemma":0.00007500204,"threshold_uncertainty_score":0.99950284},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19935732,0.00043538582,0.79744446,0.00027642283,0.0001602654,0.00017870705,0.0000065381278,0.000015295927,0.002125589],"genre_scores_gemma":[0.77364457,0.000011492815,0.22611043,0.00011724966,0.000036249236,0.000004928491,1.6717904e-7,0.000008600857,0.000066311004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883974,0.00011896085,0.00040468943,0.00010707191,0.00040011178,0.00012942993],"domain_scores_gemma":[0.99900657,0.00017027541,0.00039228384,0.0002660655,0.000068513684,0.00009631863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011156242,0.00009872018,0.00028200314,0.000185958,0.000087536886,0.000043134005,0.0007527134,0.000022318742,0.000010298388],"category_scores_gemma":[0.00006487423,0.00007654341,0.000088727604,0.00028776578,0.00005133232,0.00008914307,0.00032488888,0.00021152191,6.262702e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015755902,0.00041476483,0.000032035616,0.00024551665,0.00005260073,0.000022832306,0.008807912,0.0011536133,0.00056702003,0.9851021,0.00022288035,0.0033629544],"study_design_scores_gemma":[0.0013285456,0.001490066,0.00009006802,0.00015717391,0.00010250539,0.0039764224,0.0047438857,0.04671081,0.0034306813,0.93578666,0.0018085141,0.0003746587],"about_ca_topic_score_codex":9.71258e-7,"about_ca_topic_score_gemma":9.1039624e-8,"teacher_disagreement_score":0.57428724,"about_ca_system_score_codex":0.000012774717,"about_ca_system_score_gemma":0.000037116326,"threshold_uncertainty_score":0.31213495},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003062081,0.00032116487,0.9387275,0.00037691699,0.0005625759,0.0009489934,0.000051085975,0.00011957095,0.05888915],"genre_scores_gemma":[0.0012585341,0.000097621276,0.9385557,0.0007124036,0.00041340358,0.00038219107,0.00010522817,0.00016688691,0.058308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837726,0.000030723695,0.00045711617,0.00049455144,0.00033175404,0.0003086037],"domain_scores_gemma":[0.99763376,0.0012318089,0.00031998864,0.0006964595,0.000064626765,0.00005333721],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005060705,0.00039545374,0.0005236205,0.00021310608,0.00014983417,0.00012587514,0.0010276077,0.00025004885,0.00036464946],"category_scores_gemma":[0.00016076262,0.00035263307,0.00021770393,0.0000946332,0.000057286383,0.00013859305,0.000331871,0.00056660216,0.000025520892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003787079,0.00004126753,1.9290582e-7,0.00044325445,0.00004744,0.000016276914,0.0036838017,0.0017337924,0.00002052189,0.98319936,0.0001974875,0.010612819],"study_design_scores_gemma":[0.00024323241,0.00011094187,5.759976e-8,0.00018690208,0.000020821084,0.000018730083,0.000004331519,0.044570867,0.00022802736,0.89140445,0.06283445,0.00037719493],"about_ca_topic_score_codex":0.0000010648184,"about_ca_topic_score_gemma":0.000010635153,"teacher_disagreement_score":0.091794915,"about_ca_system_score_codex":0.00011740005,"about_ca_system_score_gemma":0.00008516235,"threshold_uncertainty_score":0.9998926},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08090511,0.00008658275,0.91100526,0.00055663154,0.00013878748,0.0012287057,0.000024554662,0.00007116115,0.005983205],"genre_scores_gemma":[0.97911596,0.00006264485,0.020386998,0.0001641906,0.000033236433,0.000007845128,0.000015603357,0.000018281222,0.00019524341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997572,0.0006799131,0.0004991493,0.0007818075,0.0001682008,0.00029893446],"domain_scores_gemma":[0.9974929,0.000605862,0.0005751351,0.0010737444,0.00016655607,0.00008578806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013714788,0.0003915339,0.00065834785,0.00026065725,0.00020187895,0.000104816616,0.0019360064,0.00021154198,0.000006588794],"category_scores_gemma":[0.00002103799,0.00026552283,0.0004977686,0.0005181639,0.00065457256,0.00022721408,0.0009543089,0.0005738369,0.0000022948636],"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.00048261075,0.00017402013,0.00007668925,0.0005604009,0.00031866017,0.000008537648,0.0031299265,0.05409538,0.000033861543,0.93930274,0.000027011945,0.0017901318],"study_design_scores_gemma":[0.0014968324,0.0002468689,0.000091103786,0.00049171725,0.0001932736,0.000013856555,0.00007637584,0.5487514,0.0004816816,0.44767565,0.00015334302,0.0003279257],"about_ca_topic_score_codex":0.00019458625,"about_ca_topic_score_gemma":0.000012060401,"teacher_disagreement_score":0.8982108,"about_ca_system_score_codex":0.000042985135,"about_ca_system_score_gemma":0.000078407604,"threshold_uncertainty_score":0.9999797},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070205797,0.00025578667,0.9907153,0.0013324474,0.0011731149,0.0035055429,0.0003839,0.0003499032,0.0015819144],"genre_scores_gemma":[0.015823103,0.00004922026,0.9760663,0.00006823569,0.000121550045,0.0017877256,0.00034845792,0.00007931739,0.0056561152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931442,0.0035598536,0.0009406182,0.0014214043,0.00033299916,0.0006009335],"domain_scores_gemma":[0.9853235,0.0077493927,0.0013465727,0.0025385467,0.0028152994,0.000226689],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.013323844,0.000510402,0.00075488637,0.0003329481,0.00064135215,0.0006445376,0.0027705668,0.0005268212,0.000008213332],"category_scores_gemma":[0.0020323426,0.0005240351,0.0005943577,0.00030669203,0.000065437845,0.00036890456,0.0010371823,0.00041580677,0.0000050125223],"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.00008970128,0.0003320012,0.000019707997,0.0014975514,0.00020864348,9.3799775e-7,0.014532718,0.0020663769,0.0036633853,0.67469555,0.0005804548,0.302313],"study_design_scores_gemma":[0.0009716609,0.0000037120144,0.000034819303,0.00080191804,0.000070780414,0.0000060885495,0.0000580521,0.90440625,0.048412625,0.035797995,0.008901893,0.0005341788],"about_ca_topic_score_codex":0.0003434373,"about_ca_topic_score_gemma":0.00007591551,"teacher_disagreement_score":0.9023399,"about_ca_system_score_codex":0.00012416346,"about_ca_system_score_gemma":0.00035496062,"threshold_uncertainty_score":0.9997211},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0622761,0.00044160223,0.85692614,0.0008194574,0.00094409415,0.000172241,0.00008703472,0.00021500171,0.07811835],"genre_scores_gemma":[0.9252974,0.000026983183,0.07386726,0.0001671721,0.00001861068,0.0000070770457,0.0003330879,0.0000038514586,0.0002785895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99826586,0.00006028213,0.0006042004,0.00028510677,0.0005410709,0.00024345136],"domain_scores_gemma":[0.9983833,0.00013473434,0.0002843547,0.0006197227,0.00044498377,0.00013291671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007652573,0.00015096286,0.0002732378,0.00017935969,0.00025273272,0.00026422978,0.0005002525,0.00011085074,0.000053332886],"category_scores_gemma":[0.00020382059,0.00014252111,0.00010914538,0.00079315016,0.00040289067,0.0014127927,0.00048768407,0.000111154055,0.000011708444],"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.000013655549,0.00022848716,0.00016900495,0.0000682018,0.000022164077,0.0000065233776,0.000008057958,0.000034491306,0.0012246823,0.98561245,0.0007784535,0.011833816],"study_design_scores_gemma":[0.003064092,0.0007030569,0.06369468,0.0004752652,0.00017980493,0.0005826606,0.000041030547,0.00253663,0.2705909,0.17584111,0.48059326,0.0016975227],"about_ca_topic_score_codex":0.00001032814,"about_ca_topic_score_gemma":0.0000069362045,"teacher_disagreement_score":0.86302125,"about_ca_system_score_codex":0.000024346615,"about_ca_system_score_gemma":0.000186823,"threshold_uncertainty_score":0.58118427},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84581256,0.037800003,0.019363496,0.007637682,0.009670277,0.0019300389,0.0008485882,0.00044630465,0.07649104],"genre_scores_gemma":[0.99395,0.0005224364,0.0035971503,0.00013637541,0.0013712196,0.0000372974,0.000005998455,0.000012203294,0.00036733926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982159,0.0003037745,0.00030228947,0.00030851204,0.0005824706,0.00028701412],"domain_scores_gemma":[0.99821603,0.0011081559,0.00025453564,0.00029142777,0.000047654758,0.00008221196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010188634,0.00013841968,0.00021195596,0.00025174412,0.0009975522,0.0001974685,0.001113163,0.00002322272,0.00013792625],"category_scores_gemma":[0.000049064256,0.00010847148,0.00012245815,0.0013281864,0.00012777677,0.000297633,0.0009048917,0.00020835223,0.000014230246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066704015,0.00009304495,0.0009408525,0.00002519262,0.00004019018,0.00002146073,0.00026917408,0.00003352197,0.00013984674,0.91279465,0.002220155,0.08335523],"study_design_scores_gemma":[0.0027136824,0.0014735475,0.056840617,0.000025214038,0.00014200974,0.0007107488,0.0010759456,0.014076758,0.0009857556,0.48128727,0.43939522,0.0012732451],"about_ca_topic_score_codex":0.00006286659,"about_ca_topic_score_gemma":0.00000810524,"teacher_disagreement_score":0.43717507,"about_ca_system_score_codex":0.000041050134,"about_ca_system_score_gemma":0.000074007105,"threshold_uncertainty_score":0.76724654},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02312528,0.000024395993,0.9733028,0.00015313395,0.00008530551,0.00019312832,0.0000051865604,0.00006419901,0.0030465599],"genre_scores_gemma":[0.8043351,0.000011955966,0.1953019,0.00003156434,0.00002465422,0.000027547343,0.000004185199,0.000008246396,0.0002548026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891156,0.00005627747,0.00042840277,0.00019222438,0.00023310252,0.00017843289],"domain_scores_gemma":[0.99840754,0.00088765874,0.00022350051,0.0003547192,0.000064361455,0.000062191575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024439723,0.00011109238,0.00023786305,0.00013674279,0.000049609716,0.000050988096,0.0005093714,0.00005855871,0.00013482597],"category_scores_gemma":[0.00043462968,0.000094403455,0.00006372701,0.0007032973,0.00003677572,0.00036374887,0.00011299686,0.000108816166,0.000056375135],"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.000028951828,0.002532678,0.001709094,0.00041989383,0.00005063843,0.00005084525,0.013257081,0.004160499,0.0011693741,0.91202927,0.0003622317,0.06422942],"study_design_scores_gemma":[0.0004824467,0.00010724309,0.0008474367,0.00015340044,0.0000075563635,0.000016526299,0.00014493892,0.65185905,0.0022555757,0.3432856,0.000603865,0.00023634604],"about_ca_topic_score_codex":0.0000051743928,"about_ca_topic_score_gemma":4.776314e-7,"teacher_disagreement_score":0.7812099,"about_ca_system_score_codex":0.000022688502,"about_ca_system_score_gemma":0.00002749387,"threshold_uncertainty_score":0.3849661},"labels":[],"label_agreement":null},{"id":"W4311941380","doi":"10.1137/21m1449579","title":"Linear Asymptotic Convergence of Anderson Acceleration: Fixed-Point Analysis","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Fixed point; Lipschitz continuity; Differentiable function; Acceleration; Mathematical analysis; Convergence (economics); Applied mathematics; Function (biology); Weak convergence; Physics; Computer science","score_opus":0.011014498051144848,"score_gpt":0.2730494077438461,"score_spread":0.26203490969270127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311941380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01597344,0.00034679126,0.9820613,0.0010543767,0.000045906523,0.00013444496,0.000024479044,0.000029380451,0.00032983738],"genre_scores_gemma":[0.9898725,0.00018558506,0.009180836,0.0001570821,0.00009693984,0.000046131125,0.000019084448,0.000005290294,0.00043653414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833566,0.00019749394,0.00050994306,0.00033590826,0.0004449994,0.00017597513],"domain_scores_gemma":[0.9986357,0.00014091366,0.000446072,0.00049684994,0.000136087,0.00014435423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090175774,0.00013489326,0.00039039354,0.00089970086,0.00079464604,0.00013371273,0.0006304181,0.000029615725,0.0007071853],"category_scores_gemma":[0.000011589757,0.00012067967,0.0004410986,0.00508551,0.00004599364,0.00021296041,0.0001646296,0.00027602952,0.0000094201605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049941213,0.0008961497,0.014630306,0.00004424829,0.008248585,0.00002500867,0.00095859246,0.38946688,0.001292951,0.55881965,0.0006010412,0.024966633],"study_design_scores_gemma":[0.000725823,0.00040267696,0.009714008,0.0000068850068,0.0052352347,0.00008713783,0.00077653484,0.9489883,0.0014101389,0.019852253,0.012223948,0.00057704496],"about_ca_topic_score_codex":0.000008924472,"about_ca_topic_score_gemma":0.00000374601,"teacher_disagreement_score":0.97389907,"about_ca_system_score_codex":0.00004104925,"about_ca_system_score_gemma":0.000054364336,"threshold_uncertainty_score":0.77431834},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023769902,0.0001697843,0.97485095,0.00020402191,0.00015530865,0.00018968951,0.000004674128,0.000018201483,0.0006374586],"genre_scores_gemma":[0.49029002,0.0000017253765,0.50934297,0.00008698097,0.00011694637,0.000017492592,0.0000018741268,0.0000099185,0.00013209353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988839,0.00002103702,0.00040419743,0.00011738831,0.00043759772,0.00013586365],"domain_scores_gemma":[0.9988638,0.00039195348,0.0004537406,0.000093611576,0.00012655719,0.00007030202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089985697,0.00010845846,0.00026127556,0.00011133686,0.00036019625,0.00016796614,0.00030405697,0.000017572567,0.000008142571],"category_scores_gemma":[0.000009666837,0.00008387091,0.00005533455,0.0001345001,0.000035253368,0.00011917143,0.0000994359,0.0001447211,9.559021e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022905528,0.000103399856,0.0000015571704,0.00010317105,0.000052568153,0.000008552929,0.0010105114,0.22672984,0.00010127986,0.76972604,0.00025139895,0.0018887938],"study_design_scores_gemma":[0.0009074609,0.00036709273,0.000005462102,0.00004797412,0.000036911253,0.001372101,0.000893905,0.49621382,0.00016103254,0.4966295,0.0031928604,0.00017188698],"about_ca_topic_score_codex":1.7603925e-7,"about_ca_topic_score_gemma":2.9842102e-8,"teacher_disagreement_score":0.4665201,"about_ca_system_score_codex":0.000037510035,"about_ca_system_score_gemma":0.000097176046,"threshold_uncertainty_score":0.34201565},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.829843e-7,0.0003519819,0.28264576,0.0007580347,0.0008134604,0.00019322256,0.0001531772,0.00038873332,0.71469516],"genre_scores_gemma":[0.0003184857,0.00017101773,0.01806974,0.0002504164,0.00026894995,0.00002248238,0.00012285076,0.000043651395,0.9807324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980872,0.00003624046,0.00038155724,0.00071116193,0.0004477272,0.0003360575],"domain_scores_gemma":[0.9982953,0.00009217351,0.000183769,0.0012111376,0.000066225104,0.00015140792],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00041995072,0.000379666,0.00036269712,0.00017312496,0.00039889428,0.00016044469,0.0014511524,0.00018466875,0.025699385],"category_scores_gemma":[0.000013154737,0.00035905538,0.00030663738,0.0000737211,0.00006459492,0.0002824658,0.0011091641,0.0005541353,0.0012377257],"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.000003048969,0.000011007558,1.556892e-7,0.00000894367,0.000045662648,0.00010444042,0.000028382952,0.000004564517,0.000007690324,0.9919151,0.001291639,0.0065793474],"study_design_scores_gemma":[0.00009032405,0.000043940323,9.2800633e-7,0.000012462926,0.000020101596,0.000056808498,0.0000011416352,0.0007966821,0.000028537195,0.3486889,0.64992964,0.00033052368],"about_ca_topic_score_codex":0.00001707649,"about_ca_topic_score_gemma":0.0000024661022,"teacher_disagreement_score":0.648638,"about_ca_system_score_codex":0.00010102648,"about_ca_system_score_gemma":0.00006952959,"threshold_uncertainty_score":0.99988616},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003943381,0.00032477535,0.97844577,0.014491098,0.0004026928,0.00010097078,0.000108509696,0.000015495565,0.0021673164],"genre_scores_gemma":[0.42106816,0.0011987874,0.5260391,0.0051473994,0.042447895,0.00010463754,0.00025159316,0.000050844494,0.0036915692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990772,0.00012678035,0.00030246025,0.00015399123,0.00025181976,0.000087757646],"domain_scores_gemma":[0.999434,0.00014137241,0.0001865073,0.0001000933,0.00006722514,0.000070791386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061044074,0.000076041,0.00021683334,0.00061795727,0.00015358978,0.00005386082,0.00021433253,0.000018924537,0.00050268497],"category_scores_gemma":[0.000013640665,0.00005892498,0.00010066449,0.0015902909,0.000013513058,0.000120921206,0.000099733246,0.00020250797,0.0000013107054],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008905003,0.0007760646,0.001217003,0.0000034400523,0.0005923224,0.00002482662,0.0013193744,0.015891185,0.000017337996,0.036481798,0.0008412926,0.9427463],"study_design_scores_gemma":[0.0006739139,0.00027669704,0.016829422,0.0000024034227,0.00012016317,0.00009104644,0.00014158251,0.70930237,0.000011880938,0.00889383,0.26350096,0.00015572412],"about_ca_topic_score_codex":0.000007357364,"about_ca_topic_score_gemma":0.0000025909376,"teacher_disagreement_score":0.9425906,"about_ca_system_score_codex":0.000044566186,"about_ca_system_score_gemma":0.00003789231,"threshold_uncertainty_score":0.5504048},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13952386,0.0015854582,0.838262,0.005032775,0.0024324476,0.0005244282,0.00017124033,0.0006602057,0.011807578],"genre_scores_gemma":[0.9867141,0.000019394209,0.010595728,0.00041167994,0.00011859536,0.000040902578,0.000014394944,0.000011471263,0.0020737078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985627,0.00023104271,0.00020228574,0.00038008878,0.00030740883,0.00031646466],"domain_scores_gemma":[0.99917877,0.00015488394,0.00009555119,0.00043767318,0.000034061148,0.00009904229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006393463,0.00012783497,0.0001465873,0.00019559592,0.0008549395,0.000112056325,0.0005332453,0.000036128353,0.0002300169],"category_scores_gemma":[0.000036603753,0.00012943908,0.00006581542,0.00057587685,0.00006012884,0.0003572431,0.0009229397,0.00024280566,0.00007534212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005070263,0.00006892141,0.00043784073,0.000009407866,0.000025150206,0.000017544537,0.000619869,0.00020618792,0.0004113027,0.9912092,0.0015008149,0.005488684],"study_design_scores_gemma":[0.0022920172,0.0005873909,0.014059927,0.000040234634,0.00008215475,0.00033331843,0.0016551272,0.23717286,0.0016214711,0.6497235,0.090890676,0.0015413503],"about_ca_topic_score_codex":0.00005587285,"about_ca_topic_score_gemma":0.0000024168555,"teacher_disagreement_score":0.84719026,"about_ca_system_score_codex":0.00008068418,"about_ca_system_score_gemma":0.00006437385,"threshold_uncertainty_score":0.65755904},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013050284,0.000055196466,0.03841697,0.0001018939,0.015428051,0.00035004428,0.00004847217,0.0010711469,0.94451517],"genre_scores_gemma":[0.00019110697,2.893668e-7,0.000865345,0.00007567583,0.0006898944,0.000030393041,0.0000586778,0.000056803066,0.9980318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963819,0.0001012847,0.0004758542,0.001359271,0.0009928988,0.00068882795],"domain_scores_gemma":[0.99725676,0.00017312205,0.000239691,0.0019413304,0.00011986874,0.00026920674],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007083434,0.0004404261,0.00047457602,0.0009586067,0.00069330726,0.00149414,0.0028745844,0.00018463455,0.0003371435],"category_scores_gemma":[0.000012688826,0.00040637318,0.00035728558,0.00036064952,0.00046186397,0.00012643838,0.0012409857,0.0006104131,0.004216211],"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.0000021916057,0.000012367879,1.7842528e-7,0.0000478916,0.00003056763,0.00010546793,0.0002473084,0.0000019900967,0.000099084435,0.6066873,0.37655634,0.016209334],"study_design_scores_gemma":[0.00016497142,0.000014421479,0.0000020691623,0.00014576685,0.000023093604,0.000007704987,0.000001932444,0.002994103,0.0005076543,0.1310649,0.86458284,0.0004905733],"about_ca_topic_score_codex":0.000001401569,"about_ca_topic_score_gemma":0.00024231117,"teacher_disagreement_score":0.48802647,"about_ca_system_score_codex":0.0001445979,"about_ca_system_score_gemma":0.0005723638,"threshold_uncertainty_score":0.9998388},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015140073,0.000024869778,0.06627923,0.0005064,0.0010860187,0.00011238183,0.000007508316,0.0006613218,0.9313207],"genre_scores_gemma":[0.000026010246,0.000050098526,0.0077033704,0.00082863093,0.0005110215,0.0000031858042,0.000010032833,0.00004041624,0.99082726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986973,0.000013781121,0.00021373827,0.0005261221,0.00033032417,0.00021877015],"domain_scores_gemma":[0.99873227,0.00018639535,0.00008212695,0.0008599831,0.00003973084,0.00009950586],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00024646055,0.000269368,0.0002441414,0.00015697791,0.0000837389,0.00011394043,0.0010285063,0.0002199998,0.0010792045],"category_scores_gemma":[0.0000066029497,0.00022371631,0.00015859722,0.000052592095,0.000039888248,0.00011958999,0.00036937397,0.00033563844,0.021442058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017766739,0.000005093101,2.2192612e-8,0.00001033642,0.000020024701,0.000066336994,0.000015530497,0.0000047952935,8.2488833e-7,0.9745107,0.0071122698,0.01825226],"study_design_scores_gemma":[0.00009168351,0.00009513706,9.373038e-7,0.00006292938,0.000005759251,0.000008266739,0.0000017910431,0.0027184244,0.00005114567,0.5572687,0.43937847,0.0003167488],"about_ca_topic_score_codex":0.0000026531666,"about_ca_topic_score_gemma":0.000001815248,"teacher_disagreement_score":0.4322662,"about_ca_system_score_codex":0.000024533796,"about_ca_system_score_gemma":0.000047160473,"threshold_uncertainty_score":0.99983394},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9023917,0.0015306448,0.08213255,0.012150623,0.00089451816,0.0002938188,0.000010540884,0.000057647118,0.00053799624],"genre_scores_gemma":[0.99905753,0.0000930452,0.00035558164,0.00010931829,0.00016508214,0.0000011705664,6.372505e-7,0.0000080922155,0.0002095374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840933,0.00024423652,0.0004863834,0.00009873982,0.00046401855,0.00029729592],"domain_scores_gemma":[0.9986585,0.0003228082,0.0005051966,0.0003667244,0.00010555595,0.000041256444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014470213,0.000096178235,0.00022995115,0.00010573378,0.00015529705,0.000023319333,0.001042761,0.000038149945,0.000047146117],"category_scores_gemma":[0.000096037744,0.0000511996,0.0002192343,0.00081446907,0.000078405734,0.00012693873,0.00012588056,0.0005062823,0.000024401601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000805455,0.0001532883,0.00032917733,0.00002587953,0.00016719144,0.000013083195,0.00083993113,0.0008774279,0.0030135438,0.9874783,0.0032671744,0.003754443],"study_design_scores_gemma":[0.004219519,0.0047451183,0.019707117,0.00059683213,0.00028372413,0.0014101868,0.0007808492,0.18084356,0.071562394,0.6487847,0.06621536,0.00085065933],"about_ca_topic_score_codex":0.0000045527236,"about_ca_topic_score_gemma":0.0000012881176,"teacher_disagreement_score":0.33869365,"about_ca_system_score_codex":0.000042467294,"about_ca_system_score_gemma":0.0003534051,"threshold_uncertainty_score":0.21995729},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052074675,0.00093139615,0.94599646,0.00025627896,0.00015215903,0.000174469,0.000002046526,0.00033600215,0.000076485216],"genre_scores_gemma":[0.74929494,0.000056018318,0.24957004,0.000092233975,0.00018804976,0.000047358495,8.499722e-7,0.00004583155,0.0007046905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883497,0.000026195088,0.00025059885,0.00030228944,0.00028182412,0.00030411844],"domain_scores_gemma":[0.99946475,0.00007665526,0.00004649854,0.0002763443,0.000011848789,0.00012389077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037420902,0.00017790638,0.00021178175,0.000111639885,0.00023324219,0.00016861386,0.00038403188,0.000034010664,0.000010430759],"category_scores_gemma":[0.000011422158,0.00015118394,0.000046647845,0.0001933738,0.000014339965,0.00020144867,0.00025988856,0.00024645284,0.000011841638],"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.0000024961253,0.0000359228,2.1759298e-7,0.00018268218,0.000009828643,0.00000381319,0.0005845368,0.8156111,0.00037831278,0.18287545,0.000013753305,0.0003018421],"study_design_scores_gemma":[0.00012994179,0.00006432025,1.0203692e-7,0.00011296855,0.000008089056,0.000061819854,0.000016073162,0.91660535,0.0003689197,0.081890345,0.0005466115,0.00019545834],"about_ca_topic_score_codex":0.000008204676,"about_ca_topic_score_gemma":2.0868764e-8,"teacher_disagreement_score":0.69722027,"about_ca_system_score_codex":0.000033850436,"about_ca_system_score_gemma":0.000023195389,"threshold_uncertainty_score":0.6165102},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17052758,0.0003096805,0.82827014,0.00044422795,0.000059539765,0.00011489631,0.0000022024394,0.00021979591,0.000051918938],"genre_scores_gemma":[0.971362,0.00010532348,0.028190766,0.000031300886,0.000108156266,0.000004510291,0.000010585412,0.000018367135,0.00016902514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975404,0.00017033196,0.00032120734,0.0003158975,0.0003592113,0.0012929337],"domain_scores_gemma":[0.99930835,0.000090508256,0.0001462967,0.00022278097,0.00012150479,0.00011057299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019597944,0.00018942759,0.00021558914,0.0002327425,0.00038524726,0.00015781794,0.00038478922,0.00006692131,0.0000030990457],"category_scores_gemma":[0.000033470602,0.00014989583,0.000059607515,0.00048203068,0.000019928377,0.0007485222,0.00007875812,0.00094389176,0.000035678382],"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.000044861365,0.000018667168,0.000006392427,0.00001453226,0.000056991455,0.000019297338,0.00019429083,0.8172538,0.00010951137,0.17426309,0.0000015566948,0.008016961],"study_design_scores_gemma":[0.0007090261,0.00022511417,7.426984e-7,0.000117109455,0.000027528185,0.0002962077,0.00032973304,0.90554106,0.00002148568,0.09255907,0.0000024719832,0.00017047023],"about_ca_topic_score_codex":0.000014828456,"about_ca_topic_score_gemma":0.00001645642,"teacher_disagreement_score":0.8008344,"about_ca_system_score_codex":0.000425258,"about_ca_system_score_gemma":0.0008647539,"threshold_uncertainty_score":0.6112575},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13847548,0.00068363216,0.8354825,0.017772349,0.00031579606,0.0010627923,0.0000276407,0.0004908738,0.005688939],"genre_scores_gemma":[0.950052,0.00023311083,0.028720247,0.0012627852,0.00076940714,0.00018892481,0.000019554504,0.000036385827,0.018717587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999329,0.000030390076,0.00015079568,0.0002097933,0.00014055165,0.00013949342],"domain_scores_gemma":[0.9991798,0.00022918633,0.000055600696,0.00043341718,0.000034797664,0.000067213645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022473371,0.00008236202,0.00009267003,0.00006143943,0.00018070186,0.00005481849,0.0004488435,0.00003873219,0.00003378935],"category_scores_gemma":[0.00002706843,0.000058107467,0.000046100384,0.0006509315,0.000031955624,0.00007717491,0.00012760675,0.00007126319,0.00021559706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020622058,0.000023158293,0.000002948376,0.000008204771,0.00000848744,6.2773086e-7,0.00017624673,0.000027976428,0.0010005592,0.99030817,0.0017802601,0.006661292],"study_design_scores_gemma":[0.00044180377,0.0001999829,0.0004193522,0.000042373216,0.000030580664,0.00001243597,0.00008992214,0.24490502,0.015305321,0.409548,0.3286616,0.0003436257],"about_ca_topic_score_codex":0.000003556727,"about_ca_topic_score_gemma":2.712452e-7,"teacher_disagreement_score":0.81157655,"about_ca_system_score_codex":0.000003849794,"about_ca_system_score_gemma":0.00004310172,"threshold_uncertainty_score":0.2771136},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6049539,0.0035140405,0.38711178,0.0018984535,0.0012508389,0.00024781746,0.00001557844,0.00005999672,0.0009476215],"genre_scores_gemma":[0.8695784,0.00007424494,0.12957248,0.00047147903,0.00014353202,0.000005890197,7.6911135e-7,0.000013228717,0.0001399392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988373,0.00010280256,0.00040299588,0.00009424414,0.00040678427,0.00015587424],"domain_scores_gemma":[0.99903935,0.00022817215,0.00036328612,0.00021239405,0.00006971005,0.00008706393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010159151,0.00009243908,0.0002029579,0.000100123245,0.00019061998,0.00010965642,0.00066466,0.000013655526,0.00014653544],"category_scores_gemma":[0.000049303453,0.00007565436,0.00006686294,0.00015152726,0.00003354332,0.0003169774,0.0003549612,0.00020644884,0.0000063645193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008694767,0.0030093596,0.0023267793,0.00077054976,0.0008132246,0.0008568659,0.059199907,0.00085202925,0.005384817,0.861607,0.02446509,0.04062743],"study_design_scores_gemma":[0.003292639,0.002510789,0.00047476107,0.0002687752,0.00017747501,0.0031699329,0.0080229975,0.12362886,0.0038678925,0.7243108,0.12945846,0.0008166276],"about_ca_topic_score_codex":0.0000011901112,"about_ca_topic_score_gemma":4.843597e-7,"teacher_disagreement_score":0.26462457,"about_ca_system_score_codex":0.000025682668,"about_ca_system_score_gemma":0.000044850105,"threshold_uncertainty_score":0.30850953},"labels":[],"label_agreement":null},{"id":"W4323825473","doi":"10.1137/21m1459265","title":"GPMR: An Iterative Method for Unsymmetric Partitioned Linear Systems","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Generalized minimal residual method; Mathematics; Linear system; Block (permutation group theory); Residual; Iterative method; Applied mathematics; Matrix (chemical analysis); Iterative and incremental development; Algorithm; Computer science; Combinatorics; Mathematical analysis","score_opus":0.022835013793807476,"score_gpt":0.35252663118409694,"score_spread":0.32969161739028946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323825473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009263974,0.00019764631,0.99750507,0.00070682913,0.000053442083,0.00029401566,0.000044638342,0.000105867504,0.00016608619],"genre_scores_gemma":[0.563834,0.0009813933,0.42468652,0.0005115402,0.0022759084,0.0011350531,0.0002409213,0.000049769154,0.006284914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859166,0.00021305226,0.0003886911,0.00034657496,0.00023028541,0.00022975136],"domain_scores_gemma":[0.998529,0.00042774188,0.0002401889,0.00038078986,0.00021005233,0.00021220553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014946081,0.00013467499,0.0002966057,0.000994644,0.00069780176,0.00048543463,0.00040156825,0.000054413755,0.000013810204],"category_scores_gemma":[0.00003165966,0.000107285916,0.00022210082,0.0043853675,0.000020493268,0.00031709214,0.00004453015,0.00015116644,0.000050375325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000144601445,0.00016263907,0.00013137764,0.000031569038,0.0006263854,0.0000059955505,0.00025043587,0.04961716,0.00032332022,0.91267824,0.00079108233,0.035367336],"study_design_scores_gemma":[0.00030240728,0.00014872372,0.0003564448,0.000008381664,0.00030567092,0.00002467715,0.00016102601,0.9355074,0.00020725682,0.028442929,0.034348153,0.00018694266],"about_ca_topic_score_codex":0.000004933996,"about_ca_topic_score_gemma":0.0000014631482,"teacher_disagreement_score":0.88589025,"about_ca_system_score_codex":0.000023127479,"about_ca_system_score_gemma":0.00003158789,"threshold_uncertainty_score":0.5366998},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8093587,0.0009403347,0.10803504,0.07650389,0.00017934846,0.0017075369,0.000036123645,0.0005469113,0.002692074],"genre_scores_gemma":[0.9960147,0.0003390209,0.00051248656,0.002067333,0.0001079308,0.00020836372,0.000009221923,0.000010309578,0.0007306227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991144,0.00008502123,0.00016318928,0.00026555426,0.00019605049,0.00017578842],"domain_scores_gemma":[0.99873847,0.00060785393,0.000057402907,0.00048792223,0.000041058167,0.00006728608],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007489787,0.00010892634,0.000088752146,0.00006124302,0.00150675,0.00010577991,0.00051788776,0.000046075304,0.000018628665],"category_scores_gemma":[0.00005326967,0.00005780566,0.00003665468,0.0007164248,0.00007018939,0.00014226242,0.0014883496,0.00015234294,0.00011684342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000201252,0.000020501277,0.00003742464,0.00000781349,0.0000070034516,3.2379558e-7,0.0006556099,0.00001100818,0.00039403664,0.9864269,0.0008690964,0.011568287],"study_design_scores_gemma":[0.00020218703,0.000051178376,0.0024232112,0.000018017812,0.000012284303,0.0000063007487,0.00007572331,0.13811359,0.0014536278,0.7768634,0.08059718,0.00018330179],"about_ca_topic_score_codex":0.0000065751756,"about_ca_topic_score_gemma":0.0000036262077,"teacher_disagreement_score":0.20956348,"about_ca_system_score_codex":0.000003952551,"about_ca_system_score_gemma":0.000015137703,"threshold_uncertainty_score":0.9997932},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012343187,0.050008062,0.89222217,0.035449173,0.0014255914,0.0043127188,0.000088001805,0.00037695427,0.0037741528],"genre_scores_gemma":[0.15368801,0.11824969,0.71308345,0.012281358,0.00096196955,0.0006760169,0.000073030424,0.000049369653,0.0009371283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985542,0.00008671002,0.00024993878,0.00026378618,0.0006735421,0.00017182146],"domain_scores_gemma":[0.99883085,0.0004574195,0.00015047671,0.00016583457,0.0003407973,0.000054612956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005332058,0.00007608536,0.00017370499,0.00012825332,0.00033428974,0.00011100618,0.0007259956,0.00001894646,0.0000060951234],"category_scores_gemma":[0.00044048883,0.00004928412,0.00007465783,0.0019073942,0.00041472126,0.0006114311,0.00015772005,0.00004883567,0.000019952675],"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.0000051064917,0.000022175127,0.000006510077,0.00059872854,0.000008204898,9.588886e-7,0.00019043793,0.00019316992,0.00047815853,0.85772485,0.0006786336,0.14009309],"study_design_scores_gemma":[0.00083705987,0.00006579963,0.0005391268,0.001218616,0.00003375533,0.000031806972,0.000016967819,0.7938892,0.0009223523,0.19480364,0.007426275,0.00021537772],"about_ca_topic_score_codex":0.000006662264,"about_ca_topic_score_gemma":4.8336364e-7,"teacher_disagreement_score":0.79369605,"about_ca_system_score_codex":0.000029332363,"about_ca_system_score_gemma":0.00019528095,"threshold_uncertainty_score":0.25711203},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118963785,0.0003150273,0.85556513,0.009117559,0.0019727536,0.0029026074,0.00020442814,0.0020910765,0.008867608],"genre_scores_gemma":[0.83277756,0.0000816477,0.1620644,0.00017616317,0.0001770946,0.00017524188,0.00003422998,0.000050433446,0.0044632345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966079,0.00013660548,0.0008192417,0.00078281783,0.0007856712,0.00086779334],"domain_scores_gemma":[0.996568,0.0015470572,0.0004687508,0.001018793,0.00016144448,0.00023590417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027089654,0.00031933334,0.00055788324,0.00052058074,0.00045001582,0.000201231,0.0028937147,0.00022902667,0.00010733748],"category_scores_gemma":[0.00075139373,0.0002711302,0.0003133015,0.0020974565,0.00027447133,0.00075978757,0.0009412494,0.00031204405,0.00024955458],"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.00007354614,0.0007741085,0.00078482745,0.002172862,0.000380218,0.000016985203,0.01002714,0.0002625817,0.11003521,0.73305374,0.11627927,0.026139513],"study_design_scores_gemma":[0.0016294804,0.00023333626,0.0031277093,0.00021209248,0.00012170076,0.000029231749,0.0006829878,0.64337355,0.039257642,0.25940815,0.050806846,0.001117297],"about_ca_topic_score_codex":0.0000054128345,"about_ca_topic_score_gemma":0.0000012648192,"teacher_disagreement_score":0.7138138,"about_ca_system_score_codex":0.000034711542,"about_ca_system_score_gemma":0.00007978622,"threshold_uncertainty_score":0.9999741},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021054052,0.000028359293,0.9746935,0.0038623908,0.000048009268,0.000086267064,0.0000088508295,0.000032313008,0.00018629945],"genre_scores_gemma":[0.93970865,0.00018818185,0.059341,0.00015373764,0.00013786773,0.00003743807,0.000028562492,0.0000062925988,0.00039825324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893683,0.000054967124,0.00035763148,0.00017712988,0.00037085972,0.000102607584],"domain_scores_gemma":[0.9987196,0.0001464148,0.0003742192,0.00020953994,0.00046013072,0.000090117115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065474433,0.0000859594,0.00018997598,0.00059697306,0.00010193026,0.0001689772,0.00061524333,0.0000253538,0.000010548944],"category_scores_gemma":[0.000013817649,0.000064308864,0.00013430468,0.0011974764,0.000032551412,0.0003039616,0.0000704831,0.00009152509,0.000011228683],"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.000054981927,0.00025901286,0.0019265931,0.000007016712,0.0018672604,0.00001906912,0.0005560959,0.006606322,0.0012369235,0.8966012,0.0002636134,0.090601936],"study_design_scores_gemma":[0.0016508758,0.00038171076,0.020410253,0.00003705412,0.0007796665,0.00014513709,0.00032403806,0.82143444,0.0037358804,0.12624955,0.024477247,0.00037411842],"about_ca_topic_score_codex":0.000014174961,"about_ca_topic_score_gemma":0.00000562968,"teacher_disagreement_score":0.9186546,"about_ca_system_score_codex":0.00002686953,"about_ca_system_score_gemma":0.00003494374,"threshold_uncertainty_score":0.26224393},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026313266,0.0017729759,0.9582258,0.0075506233,0.004297448,0.0007626025,0.000012915224,0.00024528857,0.00081908505],"genre_scores_gemma":[0.9807958,0.0016888004,0.008052274,0.00007170262,0.001013506,0.000017820852,0.000005894378,0.000049468246,0.008304719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966217,0.00031294438,0.0004737534,0.00035368523,0.0005204925,0.0017173743],"domain_scores_gemma":[0.99839616,0.000055956425,0.0006253639,0.0007237847,0.00013376305,0.00006498082],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0026680953,0.00021507689,0.0002603864,0.00012501316,0.00021696133,0.00015013631,0.0023821716,0.0002075679,0.0000042087954],"category_scores_gemma":[0.00004319374,0.00015306183,0.00031660014,0.00031353644,0.00006723097,0.0001434452,0.0008624674,0.00378956,0.000011332511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008706472,0.000058542155,0.00016577839,0.000050146107,0.00020041298,0.0000039029974,0.00059115095,0.004014398,0.00008809314,0.96357226,0.0001750173,0.031071616],"study_design_scores_gemma":[0.00021003565,0.0000819607,0.00046677887,0.00010562241,0.000031180793,0.00024344884,0.00010742837,0.007844225,0.00042596066,0.98996514,0.00034847905,0.0001697531],"about_ca_topic_score_codex":0.00005805183,"about_ca_topic_score_gemma":0.00012152147,"teacher_disagreement_score":0.95448256,"about_ca_system_score_codex":0.0005846866,"about_ca_system_score_gemma":0.0039687147,"threshold_uncertainty_score":0.99850875},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004958451,0.000007840222,0.99155927,0.0004024715,0.00017404003,0.00015099833,0.000004110781,0.00022145676,0.0025213703],"genre_scores_gemma":[0.9233499,8.498614e-8,0.07439355,0.0009619309,0.00004450942,0.000052617885,0.000001589089,0.0000047996064,0.001191011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918646,0.00012372558,0.00009899564,0.00022717014,0.00018458418,0.0001790784],"domain_scores_gemma":[0.9994946,0.000041315885,0.000031234093,0.00032951942,0.000017181728,0.00008614443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038781346,0.00006804612,0.00007845247,0.000051118994,0.00024051328,0.00006911718,0.00075985555,0.000010653418,0.00069751276],"category_scores_gemma":[0.0000044144494,0.00006174118,0.000031189076,0.00018394846,0.00001896144,0.00030898876,0.0001909175,0.000113070855,0.000053678883],"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.000019559513,0.00016293259,0.000011279986,0.000003480149,0.000011960642,0.000030248979,0.00075714855,0.24099082,0.0005181108,0.74617606,0.0012278135,0.010090561],"study_design_scores_gemma":[0.000496964,0.00026620334,0.0000105185345,5.993886e-7,0.0000028890247,0.000032535572,0.000118965625,0.9860589,0.000054321805,0.01105773,0.0017837967,0.000116559204],"about_ca_topic_score_codex":0.000011254095,"about_ca_topic_score_gemma":0.0000011051923,"teacher_disagreement_score":0.91839147,"about_ca_system_score_codex":0.00002111141,"about_ca_system_score_gemma":0.000047055164,"threshold_uncertainty_score":0.76372755},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033603546,0.00047220857,0.990917,0.001950519,0.00012594755,0.00039312584,0.000009112191,0.0005458723,0.002225823],"genre_scores_gemma":[0.004814194,0.00031638658,0.9906232,0.00029921054,0.00030919746,0.00019888389,0.000035606303,0.000021236452,0.0033821072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863344,0.0002464451,0.00024672673,0.0004670936,0.00014006611,0.00026620712],"domain_scores_gemma":[0.99857616,0.00055513135,0.000088473615,0.00052944827,0.00009399562,0.00015676458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011396282,0.00015399167,0.00017249389,0.0001694742,0.00033442362,0.000111776164,0.0004847477,0.00009900891,0.000049591385],"category_scores_gemma":[0.00010539065,0.0001438081,0.00006449147,0.0013704201,0.00004148821,0.00032444144,0.00022226399,0.00017016889,0.0005392231],"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.0000021854808,0.000037179438,0.000012956018,0.000018589351,0.000016748738,0.0000010596061,0.0003728393,0.000028523627,0.009519767,0.68257767,0.0001514724,0.30726102],"study_design_scores_gemma":[0.00025029894,0.000054591903,0.0005145569,0.000008531196,0.000023484577,0.000023963483,0.00007573175,0.57577,0.027328063,0.12166812,0.27395737,0.0003252385],"about_ca_topic_score_codex":0.0000054570583,"about_ca_topic_score_gemma":6.3285734e-7,"teacher_disagreement_score":0.5757415,"about_ca_system_score_codex":0.000009415943,"about_ca_system_score_gemma":0.000044233213,"threshold_uncertainty_score":0.6930801},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014835419,0.0012536793,0.9961274,0.000087456145,0.000999282,0.00072130415,0.000027806958,0.00056278333,0.00007192065],"genre_scores_gemma":[0.0007669631,0.00014905503,0.9981841,0.00006745084,0.000080752114,0.00015459965,0.000033432178,0.00003889493,0.00052477285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699944,0.0012239383,0.0006067002,0.00053818914,0.00021906586,0.00041266065],"domain_scores_gemma":[0.9966099,0.0017695827,0.00037427078,0.0005353213,0.00059360516,0.000117313306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004907103,0.0002463439,0.0004714418,0.0005860605,0.0003010341,0.00014760558,0.00064959686,0.00012972235,0.000006101759],"category_scores_gemma":[0.0027036085,0.00021405975,0.00017796808,0.0021940472,0.00007058319,0.00047067547,0.0002796085,0.00013373385,0.000007971228],"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.000031421656,0.00005086456,0.000038712245,0.00041151553,0.000089732945,0.0000025786132,0.001668563,0.8217518,0.0017839713,0.012724222,0.00006455518,0.1613821],"study_design_scores_gemma":[0.0003344243,0.00011253931,0.000018048755,0.00015976762,0.000034925066,0.00000917886,0.000116240495,0.9661632,0.030147377,0.0021233256,0.00051549694,0.00026546954],"about_ca_topic_score_codex":0.00002420484,"about_ca_topic_score_gemma":1.8557006e-7,"teacher_disagreement_score":0.16111663,"about_ca_system_score_codex":0.000050613067,"about_ca_system_score_gemma":0.00009642467,"threshold_uncertainty_score":0.8729103},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007519613,0.00025361037,0.3446593,0.0021933254,0.00407207,0.001458895,0.0008225609,0.0032525947,0.64321244],"genre_scores_gemma":[0.000024192013,0.00053954043,0.050937235,0.00007049581,0.00050952885,0.00004394804,0.00008046331,0.00011208653,0.9476825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977214,0.000021857135,0.0007081077,0.0006127801,0.00056855375,0.00036735466],"domain_scores_gemma":[0.9975945,0.00055498525,0.0004488052,0.0010967276,0.00015720526,0.00014781348],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032821816,0.0004972354,0.0005688374,0.0008001539,0.00079596206,0.00044215802,0.001141492,0.00036902053,0.00043667102],"category_scores_gemma":[0.00008961083,0.0004752781,0.00034259146,0.0006569505,0.000070304,0.00023135303,0.00053758547,0.0005190973,0.0012344152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025225936,0.00018338878,6.2344054e-7,0.00030327964,0.000144438,0.0000409941,0.0004265527,0.00008769483,0.0000027871488,0.9700892,0.027921585,0.00079692894],"study_design_scores_gemma":[0.0002639653,0.00009887586,0.0000034189798,0.00046758508,0.000094402814,0.00007190587,0.00001924535,0.06293209,0.000015091329,0.76345277,0.17196561,0.00061504747],"about_ca_topic_score_codex":0.000020612692,"about_ca_topic_score_gemma":0.00023210444,"teacher_disagreement_score":0.30447006,"about_ca_system_score_codex":0.00012303054,"about_ca_system_score_gemma":0.00014782092,"threshold_uncertainty_score":0.99976987},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033707478,0.0012987725,0.22041139,0.00021524842,0.006495269,0.00072405743,0.00019630295,0.0025251422,0.7681001],"genre_scores_gemma":[0.00016103408,0.00029876473,0.0081539145,0.000059352973,0.00028820024,0.000013599173,0.000034112352,0.0000891494,0.9909019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99768996,0.000019071489,0.00043878157,0.00067001145,0.0007582679,0.00042389918],"domain_scores_gemma":[0.9980357,0.0001971654,0.00024197811,0.0011758882,0.00014211432,0.0002071048],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00048118905,0.00040553306,0.00042555877,0.001210301,0.00014689642,0.00022878131,0.0016942591,0.000498265,0.00021879906],"category_scores_gemma":[0.00006228758,0.00040122,0.00030853183,0.00069853506,0.000059612816,0.00021132002,0.0007521752,0.0005833655,0.005037218],"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.0000010869426,0.00001734123,0.000005506876,0.000021626074,0.00001245758,0.00034798327,0.00002711504,0.0000028405266,0.0000033833899,0.90286857,0.0044360654,0.092255995],"study_design_scores_gemma":[0.00050838914,0.00024245371,0.00015199483,0.00013992304,0.00020260071,0.00014788652,0.0000060133834,0.0016516973,0.0001410479,0.1303883,0.86463827,0.0017813978],"about_ca_topic_score_codex":0.000009228448,"about_ca_topic_score_gemma":0.0000018865129,"teacher_disagreement_score":0.86020225,"about_ca_system_score_codex":0.00011189672,"about_ca_system_score_gemma":0.0001314317,"threshold_uncertainty_score":0.99984396},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33778444,0.000163207,0.64355946,0.011515986,0.002689109,0.0006286076,0.0000984735,0.0010747964,0.0024859044],"genre_scores_gemma":[0.99146193,0.0000096107,0.0046776053,0.00005746206,0.00008886498,0.000031351807,0.000011817763,0.000008647872,0.0036527088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989919,0.00016592772,0.00021117642,0.00018389957,0.00022460798,0.00022250589],"domain_scores_gemma":[0.99909556,0.00013090484,0.00009801603,0.00058316154,0.00005288764,0.0000394613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036340774,0.000085157706,0.000107500164,0.00010631894,0.00027081044,0.000052202708,0.000740947,0.000040490762,0.00008205611],"category_scores_gemma":[0.000091182046,0.00006051326,0.000108244676,0.00085523614,0.000050022856,0.00018226876,0.0003471242,0.00006697646,0.00032133958],"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.000005817204,0.000054504282,0.00006409266,0.000035508067,0.000025791327,0.0000035274948,0.0010753167,0.0018909742,0.04153074,0.9412378,0.0073881624,0.006687771],"study_design_scores_gemma":[0.0010172442,0.00010305306,0.0075588133,0.00011519387,0.000034711524,0.000026316402,0.00016370758,0.689853,0.07490007,0.21706606,0.008672579,0.0004892505],"about_ca_topic_score_codex":0.000036414833,"about_ca_topic_score_gemma":0.0000047230706,"teacher_disagreement_score":0.72417176,"about_ca_system_score_codex":0.000015407479,"about_ca_system_score_gemma":0.000049884227,"threshold_uncertainty_score":0.41302776},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12366331,0.00014567134,0.8746988,0.0006056676,0.00054085633,0.000010935798,0.0000020745877,0.000056801167,0.00027583548],"genre_scores_gemma":[0.9955233,0.00009714624,0.0033406387,0.00010182575,0.00060838566,4.4168908e-7,7.730137e-7,0.0000074669933,0.0003200325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915576,0.00006875362,0.00020847456,0.00012381996,0.0002548902,0.00018827408],"domain_scores_gemma":[0.99935246,0.00010303092,0.00020151684,0.00016982037,0.000077774326,0.00009537503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035396722,0.00009896398,0.00019184676,0.000087170185,0.00012551402,0.00015662612,0.00033488014,0.000030614214,0.0000018986165],"category_scores_gemma":[0.000010618901,0.00008492395,0.00008582216,0.00040389632,0.00004002168,0.00064134796,0.00013639695,0.00013223354,0.0000046131972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069621387,0.000031419764,0.00003746151,0.000008348777,0.000033195454,0.00013198603,0.00010764974,0.0009193976,0.00076046557,0.92028564,0.0006204949,0.07705697],"study_design_scores_gemma":[0.0005716675,0.00019637994,0.002226821,0.000056867695,0.00002306241,0.00030392924,0.000015573216,0.033821177,0.015569208,0.9445341,0.00244446,0.00023676013],"about_ca_topic_score_codex":0.000016284515,"about_ca_topic_score_gemma":6.771944e-7,"teacher_disagreement_score":0.87185997,"about_ca_system_score_codex":0.000016979004,"about_ca_system_score_gemma":0.00005203959,"threshold_uncertainty_score":0.34630984},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030832612,0.000024649005,0.99227756,0.00029453236,0.0013887761,0.0006859956,0.00006272267,0.0006340144,0.0015485063],"genre_scores_gemma":[0.59750324,0.0003061371,0.322717,0.00042076968,0.0008030568,0.0000329021,0.00031205948,0.00015229757,0.07775253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739003,0.00025886373,0.0002904184,0.0014697918,0.00011235553,0.0004785256],"domain_scores_gemma":[0.9973048,0.0005746862,0.0003353998,0.0013745625,0.0002168263,0.00019370411],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006782477,0.00038615923,0.00045185565,0.0003988525,0.00023745287,0.00017749966,0.0022344952,0.0004400178,0.000020570229],"category_scores_gemma":[0.00012211935,0.00045004164,0.00036340347,0.00078897714,0.000065984816,0.00034972336,0.0018088545,0.00041913314,0.0001046046],"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.000060607013,0.00008550982,0.00006701271,0.00015432552,0.00011569907,0.0000766851,0.0003403665,0.3790482,0.000036084784,0.61430717,0.0033556982,0.0023526615],"study_design_scores_gemma":[0.000506803,0.000046349807,0.000058502883,0.000052825868,0.0000651773,0.000002692999,0.00004067102,0.76471144,0.00021979888,0.23234433,0.0015506268,0.0004007612],"about_ca_topic_score_codex":0.00007233197,"about_ca_topic_score_gemma":0.000013317035,"teacher_disagreement_score":0.66956055,"about_ca_system_score_codex":0.0001402243,"about_ca_system_score_gemma":0.00021395154,"threshold_uncertainty_score":0.99979514},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15211506,0.00013198606,0.83791864,0.008660343,0.00039058676,0.000052232732,0.000020703745,0.000062799045,0.00064763246],"genre_scores_gemma":[0.8626246,0.00012611513,0.13430049,0.00028974836,0.001100897,0.0000011369042,0.000010918914,0.000008466647,0.0015376223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990649,0.000068505404,0.00027987288,0.0001223942,0.00035193164,0.00011240221],"domain_scores_gemma":[0.9990372,0.00035847773,0.0002754586,0.00010855187,0.000144055,0.00007627728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008756435,0.00007513508,0.00020593169,0.00059577223,0.00012774486,0.00015190075,0.00024212194,0.000033056505,0.00003767951],"category_scores_gemma":[0.00012141924,0.00005610835,0.00019986971,0.0014779554,0.000010168161,0.00028189065,0.00006209797,0.00012647116,0.000024117426],"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.00033028453,0.0008600629,0.02147514,0.0001024312,0.010478098,0.00052137766,0.0044867145,0.22946188,0.0020185495,0.6367408,0.0031660548,0.09035862],"study_design_scores_gemma":[0.0003305736,0.000116530115,0.012982673,0.000014339302,0.00026779037,0.000024491063,0.00008034676,0.97097117,0.000106839674,0.012172674,0.0028202732,0.000112281516],"about_ca_topic_score_codex":0.0000055070213,"about_ca_topic_score_gemma":0.0000016230592,"teacher_disagreement_score":0.7415093,"about_ca_system_score_codex":0.000012994863,"about_ca_system_score_gemma":0.00004776898,"threshold_uncertainty_score":0.2288032},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034568775,0.048504345,0.8422695,0.056591395,0.008653804,0.0032338023,0.00008990701,0.00063962355,0.0054488513],"genre_scores_gemma":[0.96047735,0.03575289,0.0006541571,0.0004501642,0.0013347904,0.00014928682,0.0000132805135,0.00003278665,0.0011352752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973617,0.0003874624,0.00032007124,0.0003384933,0.0002528323,0.0013394342],"domain_scores_gemma":[0.9991003,0.00019752569,0.00024390369,0.00035654788,0.00004638417,0.000055328983],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.005368903,0.0001958223,0.00027297687,0.00019956811,0.00018629122,0.0002628056,0.00096586824,0.00012771937,0.00001547155],"category_scores_gemma":[0.00006053204,0.00013458515,0.00010524724,0.00022143891,0.00012566474,0.00021068499,0.00077389873,0.0035628018,0.000024106495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024416117,0.00001399105,0.000027236423,0.000012898323,0.00004568066,0.000017437564,0.0005894361,0.000013628071,0.0000016462641,0.9459359,0.00006225997,0.05325548],"study_design_scores_gemma":[0.000929613,0.00005391456,0.0001558923,0.000111134,0.0000130439985,0.0003023475,0.00019256881,0.010822814,0.0000059862336,0.98650634,0.0007379183,0.00016841356],"about_ca_topic_score_codex":0.00010820747,"about_ca_topic_score_gemma":0.0004487977,"teacher_disagreement_score":0.92590857,"about_ca_system_score_codex":0.00037721713,"about_ca_system_score_gemma":0.0010889526,"threshold_uncertainty_score":0.998736},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.826484e-7,0.000111008994,0.93571424,0.00011895706,0.0481918,0.00041274866,0.0071790754,0.00035820866,0.007912978],"genre_scores_gemma":[0.000077638564,0.0005282767,0.7200413,0.00034351478,0.0011706158,0.000044597517,0.0029124713,0.00014043319,0.27474117],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962833,0.00023338787,0.0008605515,0.0009567215,0.0008768897,0.0007891427],"domain_scores_gemma":[0.9967627,0.000899272,0.0004115554,0.0013223126,0.00035426038,0.0002499003],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00056131516,0.0006209383,0.0007139787,0.00058151537,0.00026742794,0.00028822865,0.0016151953,0.0005175338,0.00010248661],"category_scores_gemma":[0.00088831305,0.00065453764,0.0000972285,0.0011695193,0.00013992064,0.00023199714,0.00048328482,0.0017593873,0.0015596232],"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.00000899776,0.000075018856,7.6205833e-7,0.00014240298,0.000026897642,0.0005295289,0.00041261347,0.0063848495,5.8148976e-7,0.39583308,0.5888176,0.007767689],"study_design_scores_gemma":[0.00022816886,0.00018165253,0.000028567554,0.00020210902,0.000036595793,0.000008101358,0.000008635049,0.6955477,0.000002454373,0.25200355,0.051236313,0.00051612343],"about_ca_topic_score_codex":0.00021659887,"about_ca_topic_score_gemma":0.00036240285,"teacher_disagreement_score":0.68916285,"about_ca_system_score_codex":0.00020939075,"about_ca_system_score_gemma":0.00094548217,"threshold_uncertainty_score":0.9995906},"labels":[],"label_agreement":null},{"id":"W4385552099","doi":"10.1007/s11075-023-01612-y","title":"Incomplete double-cone factorizations of centrosymmetric matrices arising in spectral methods","year":2023,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Biharmonic equation; Cone (formal languages); Theory of computation; Type (biology); Helmholtz equation; Helmholtz free energy; Partial differential equation; Mathematical analysis; Numerical analysis; Applied mathematics; Pure mathematics; Algorithm; Boundary value problem; Physics","score_opus":0.03775475680054412,"score_gpt":0.3341415677504152,"score_spread":0.29638681094987107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385552099","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056674876,0.00021005087,0.9914749,0.00041277707,0.0007454669,0.0002103962,0.000014148583,0.00033513294,0.0009296093],"genre_scores_gemma":[0.30340642,0.00011399752,0.6958686,0.00007309997,0.00023231651,0.000036862428,0.000019947967,0.000028283219,0.00022045278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756646,0.0003304223,0.0005984353,0.0005089747,0.00041839544,0.0005772881],"domain_scores_gemma":[0.99833196,0.00075972243,0.00020503413,0.00046894845,0.00007636966,0.00015798425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011247433,0.00021786813,0.0004611366,0.00087280606,0.00011861463,0.00010828344,0.00095017237,0.00009883637,0.000067803245],"category_scores_gemma":[0.00014626913,0.00020026402,0.00014064567,0.008209005,0.00006585711,0.00045582067,0.00035288278,0.00028402757,0.00009434869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005393984,0.000569114,0.0065089804,0.00012321216,0.00009832003,0.00013648986,0.0020956397,0.0037799317,0.0041141007,0.1919053,0.0003003176,0.7903147],"study_design_scores_gemma":[0.0018304348,0.00021184774,0.022146728,0.000047822883,0.000020744315,0.000027067208,0.00015563707,0.9181881,0.012983242,0.038323507,0.0054268027,0.00063804793],"about_ca_topic_score_codex":0.00017721472,"about_ca_topic_score_gemma":0.000001263175,"teacher_disagreement_score":0.9144082,"about_ca_system_score_codex":0.000072059556,"about_ca_system_score_gemma":0.00007008552,"threshold_uncertainty_score":0.81665295},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001083082,0.000032280455,0.9860234,0.011356764,0.000041643096,0.0011043574,0.000015494503,0.00012620738,0.00021677071],"genre_scores_gemma":[0.7827,0.000010870699,0.21600991,0.00013840263,0.000036307443,0.00080375734,0.00026784293,0.000011047238,0.000021818732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988639,0.0001580777,0.00028661196,0.000271021,0.00023672645,0.00018370016],"domain_scores_gemma":[0.99665546,0.001967677,0.00013160775,0.0010542374,0.00015472274,0.00003630587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008164868,0.00012034922,0.00012698639,0.00019239608,0.00028270695,0.00010813765,0.0013746322,0.00003438945,7.2330573e-7],"category_scores_gemma":[0.00008371133,0.00010259834,0.000038273818,0.0024406537,0.000070377435,0.00037580918,0.00025956487,0.00014654959,0.000027347814],"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.000007953397,0.00006537586,0.0001354276,0.0000073680517,0.0000056953045,8.2974914e-8,0.00078787154,0.4216249,0.000024138732,0.5452195,0.000034831963,0.03208688],"study_design_scores_gemma":[0.00029608523,0.000020440946,0.0066451207,0.000018250614,0.0000026668517,2.8100303e-7,0.000094644245,0.64677936,0.00002908896,0.34579974,0.00022698754,0.00008729264],"about_ca_topic_score_codex":0.000030205118,"about_ca_topic_score_gemma":0.0000748681,"teacher_disagreement_score":0.7816169,"about_ca_system_score_codex":0.000070047136,"about_ca_system_score_gemma":0.00008415698,"threshold_uncertainty_score":0.41838387},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.777351,0.0004754522,0.054562762,0.04566929,0.00073907676,0.0015680845,0.00004809356,0.00080652937,0.11877966],"genre_scores_gemma":[0.9940244,0.000011899561,0.003096724,0.00025735848,0.000039641738,0.000023555278,0.0000027038654,0.000012981224,0.0025307524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988204,0.00009347636,0.00029823967,0.00023052788,0.00018811393,0.00036923625],"domain_scores_gemma":[0.99888915,0.0004422134,0.00006056745,0.00034972822,0.000040575633,0.00021775522],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007293307,0.000112783724,0.00020258919,0.00038776087,0.000060124934,0.00005535921,0.00056387833,0.00007235811,0.0009969714],"category_scores_gemma":[0.00037836024,0.00010059954,0.000055901517,0.0009030913,0.00005437841,0.000059046895,0.00006264637,0.00011152127,0.0037981754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016454812,0.000020825146,0.000046291672,0.000104791834,0.0000059227305,0.000048821228,0.0007486194,0.00006159718,0.000039022314,0.9934473,0.0032840706,0.0021910593],"study_design_scores_gemma":[0.00026172487,0.000054514003,0.0004859577,0.00015888271,0.000006991568,0.00003469495,0.00015037092,0.04555647,0.0004055598,0.9415114,0.011121447,0.00025200128],"about_ca_topic_score_codex":0.0001963983,"about_ca_topic_score_gemma":0.00021360659,"teacher_disagreement_score":0.21667333,"about_ca_system_score_codex":0.00007641176,"about_ca_system_score_gemma":0.00012727475,"threshold_uncertainty_score":0.99991626},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000036792003,0.000085794876,0.021280713,0.000027500411,0.0006278409,0.00019688884,0.0000899326,0.0007758255,0.97691184],"genre_scores_gemma":[0.00003335336,0.00013704566,0.0009957444,0.000047632206,0.00016101175,3.7289846e-7,0.000011669187,0.000032983407,0.99858016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986339,0.0000362592,0.00015231066,0.0005926646,0.00029686952,0.00028796546],"domain_scores_gemma":[0.99858147,0.00012116887,0.00018384925,0.0008618322,0.00009180934,0.00015987532],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015968659,0.00030786538,0.00030904193,0.0002649307,0.00020620668,0.00012062195,0.0018292277,0.0002713029,0.0000036109839],"category_scores_gemma":[0.0000057519596,0.0003536832,0.0002179363,0.000020555923,0.000112005895,0.00018700027,0.0011743258,0.00037339982,0.0002576939],"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.000007616931,0.0000028551708,8.0644185e-8,0.0000477761,0.000054911106,0.00063226034,0.000023839322,0.0000020699501,0.000004157694,0.96658885,0.028169995,0.0044655725],"study_design_scores_gemma":[0.00021661447,0.00003086005,0.0000016533905,0.00009402447,0.00005206988,0.000019008497,0.000005982048,0.00071197754,0.00011362106,0.0006172628,0.99770796,0.00042898205],"about_ca_topic_score_codex":0.000027326183,"about_ca_topic_score_gemma":3.5878423e-7,"teacher_disagreement_score":0.969538,"about_ca_system_score_codex":0.00007294439,"about_ca_system_score_gemma":0.00008419241,"threshold_uncertainty_score":0.9998915},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13036306,0.0023271232,0.8539543,0.0069776555,0.00016952974,0.0008432432,0.00004652866,0.0009788547,0.0043396573],"genre_scores_gemma":[0.99218476,0.00041071334,0.0066616843,0.0001069288,0.00013395865,0.000097569115,0.0000097088805,0.000007769784,0.00038690236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993921,0.000023195507,0.00014893222,0.0002021927,0.0001044051,0.00012916638],"domain_scores_gemma":[0.99945664,0.00014908696,0.000054918128,0.0002495494,0.00002584615,0.00006397047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013881274,0.000068936875,0.00010863233,0.000085280066,0.000105354025,0.000027567603,0.0003486683,0.00003565763,0.00001805166],"category_scores_gemma":[0.000013457663,0.000059674443,0.000033556742,0.0007684768,0.000026461132,0.00012964958,0.000104942716,0.00005790791,0.00023306438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020536954,0.000047436824,0.00009536185,0.000051594172,0.00001292979,0.0000010859794,0.0003646398,0.000037817146,0.0007914153,0.9633595,0.00027950018,0.034956716],"study_design_scores_gemma":[0.0010773365,0.00020938246,0.017488996,0.000053443608,0.000060617018,0.000029901488,0.0001673637,0.32850942,0.04596413,0.3593281,0.24622475,0.00088656857],"about_ca_topic_score_codex":0.0000041685125,"about_ca_topic_score_gemma":2.3991527e-7,"teacher_disagreement_score":0.8618217,"about_ca_system_score_codex":0.0000020688533,"about_ca_system_score_gemma":0.000013107257,"threshold_uncertainty_score":0.29956487},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03244655,0.000053165775,0.95627034,0.003053765,0.0066190185,0.0005360546,0.0000042253305,0.00019688522,0.0008200284],"genre_scores_gemma":[0.8248098,0.000014718343,0.15996253,0.0015713312,0.0021972037,0.00004982064,0.000029607696,0.00007462423,0.011290354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970528,0.00039633847,0.0005500111,0.0006141529,0.00079532515,0.0005913683],"domain_scores_gemma":[0.9966632,0.001686927,0.00060057855,0.00060451205,0.00029347243,0.00015129916],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009631109,0.00021104976,0.00023869344,0.00041707867,0.0022806039,0.0021975439,0.0014697509,0.000059567414,0.000025542096],"category_scores_gemma":[0.0003175218,0.00013690349,0.00025212357,0.0016504677,0.00007739763,0.0004152217,0.0002913128,0.00043801818,0.00016316261],"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.000085051346,0.00009845541,0.0000072365174,0.000033634155,0.00005115604,0.000024955441,0.0032713828,0.3352917,0.0016102724,0.552285,0.014395721,0.09284542],"study_design_scores_gemma":[0.0012176667,0.00015685557,0.000043057207,0.00013797084,0.000008648272,0.000058890884,0.000092443755,0.8823887,0.0028110119,0.10226291,0.01062428,0.0001975303],"about_ca_topic_score_codex":0.000004206076,"about_ca_topic_score_gemma":0.0000019504148,"teacher_disagreement_score":0.79630774,"about_ca_system_score_codex":0.00009321795,"about_ca_system_score_gemma":0.00013191119,"threshold_uncertainty_score":0.9990183},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3591399,0.0008415995,0.6372722,0.0011185072,0.000032894764,0.0012919571,0.00008832127,0.000053357602,0.00016131005],"genre_scores_gemma":[0.9926822,0.00021250777,0.0066792406,0.000027420483,0.000048266953,0.00029130647,0.000007639488,0.000006092831,0.000045301666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938476,0.000023240005,0.00022016023,0.0001770002,0.00010272636,0.00009210883],"domain_scores_gemma":[0.9989165,0.00047845117,0.00012856841,0.00034675456,0.000093322866,0.00003641104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003855302,0.00006576772,0.00011407421,0.00008355075,0.00015212908,0.000018530487,0.00038868195,0.000024570238,0.0000017047494],"category_scores_gemma":[0.000036958547,0.000041415293,0.000032680106,0.0011904865,0.000052533724,0.000079166064,0.00012089228,0.000032781547,0.0000032863968],"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.000005736767,0.000044590208,0.000438286,0.00011407327,0.000019711702,1.867751e-8,0.00061220856,0.00006681881,0.0019143373,0.922914,0.00005393169,0.07381627],"study_design_scores_gemma":[0.00056244317,0.00024722208,0.0359408,0.000042410495,0.00014006392,0.000007279256,0.00085249956,0.6990509,0.030611163,0.21141556,0.020777663,0.00035200673],"about_ca_topic_score_codex":0.000017740049,"about_ca_topic_score_gemma":0.0000035841242,"teacher_disagreement_score":0.71149844,"about_ca_system_score_codex":0.0000014663993,"about_ca_system_score_gemma":0.00001193778,"threshold_uncertainty_score":0.16888666},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09935871,0.0002554725,0.89730966,0.0016631958,0.00057954807,0.00024455282,0.0000076254614,0.00008357934,0.0004976896],"genre_scores_gemma":[0.6125493,0.00024423504,0.3682605,0.0013673945,0.0007741771,0.000010962039,0.0000038558624,0.00010182532,0.016687734],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99759734,0.0007731321,0.0006250985,0.00016597341,0.00052412756,0.0003143069],"domain_scores_gemma":[0.9969643,0.0011921232,0.00070322416,0.0007267735,0.0002720119,0.00014161035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058919946,0.00017062474,0.0004465587,0.00019255576,0.00028971065,0.00028989048,0.0048126457,0.000069508686,0.00012387318],"category_scores_gemma":[0.00059761055,0.00010816543,0.00018632575,0.001057449,0.000172485,0.00067115045,0.0013975649,0.00038947226,0.000080324884],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009875046,0.0005389285,0.0048424816,0.00029702033,0.0007817867,0.00035231444,0.054168306,0.009746977,0.008233831,0.013292275,0.08424553,0.82251304],"study_design_scores_gemma":[0.013406586,0.004475227,0.039702076,0.0022845718,0.0007526516,0.004184739,0.00760511,0.0341962,0.088371344,0.32911795,0.47302848,0.0028750345],"about_ca_topic_score_codex":0.00003395547,"about_ca_topic_score_gemma":0.0000020114974,"teacher_disagreement_score":0.819638,"about_ca_system_score_codex":0.000022984219,"about_ca_system_score_gemma":0.00017177314,"threshold_uncertainty_score":0.8943173},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0118169505,0.000010863063,0.9655779,0.0010886459,0.0004668536,0.00012720432,0.0000041917547,0.00048527055,0.020422123],"genre_scores_gemma":[0.95846194,0.0000046336463,0.036038347,0.0002192321,0.000060925333,0.0000068711984,0.000003995871,0.0000066391026,0.005197401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992344,0.00006211876,0.0001379317,0.00018624595,0.00020877951,0.00017055757],"domain_scores_gemma":[0.9993754,0.00011255657,0.000043488017,0.00039638623,0.000027388478,0.000044755463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049184303,0.00006928116,0.00009117591,0.00014302344,0.00005491369,0.000022567183,0.00038867016,0.000033153698,0.00013573584],"category_scores_gemma":[0.000028057111,0.000057686193,0.000058586887,0.00055435824,0.000022556258,0.0001113691,0.00008542537,0.000049093633,0.00068530673],"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.00001985348,0.00011499841,0.00011280558,0.000043070424,0.000008904533,0.000027185182,0.00014605418,0.012154507,0.0032491349,0.9480634,0.0073178615,0.028742274],"study_design_scores_gemma":[0.00021847333,0.00009727306,0.0004956467,0.000013458483,0.0000021392532,0.0000013503726,0.000008832173,0.9668508,0.018377054,0.0117461365,0.0020946865,0.00009412945],"about_ca_topic_score_codex":0.000010915262,"about_ca_topic_score_gemma":0.0000010208811,"teacher_disagreement_score":0.9546963,"about_ca_system_score_codex":0.000010329601,"about_ca_system_score_gemma":0.00003651641,"threshold_uncertainty_score":0.880846},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24512063,0.0026322817,0.49091128,0.0095625855,0.022898385,0.0019190669,0.00024237903,0.007952224,0.21876119],"genre_scores_gemma":[0.9525737,0.000423151,0.007262409,0.00121388,0.015636126,0.00010891589,0.000046718455,0.00010186533,0.022633234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983751,0.000069163514,0.00022757583,0.00044334613,0.00045840073,0.00042641567],"domain_scores_gemma":[0.9989048,0.00040307295,0.00011393314,0.0004209498,0.000034957407,0.00012225955],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036659147,0.00018803285,0.00019373307,0.0003245844,0.00024068306,0.00031090458,0.0011444461,0.00007228472,0.00031642968],"category_scores_gemma":[0.00007941452,0.00016472647,0.00008995206,0.001683297,0.00003928351,0.0004138132,0.00024543225,0.00015258956,0.0049995473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035061257,0.00010092582,0.000022158394,0.000044653338,0.000026972437,0.00009304155,0.00051360746,0.0010301437,0.00018997092,0.68584627,0.22794452,0.08415267],"study_design_scores_gemma":[0.0017266723,0.0008493429,0.0012080631,0.00013846642,0.00005127552,0.000043049833,0.00029627027,0.04979269,0.0020438137,0.7393237,0.20269014,0.0018365212],"about_ca_topic_score_codex":0.000013446796,"about_ca_topic_score_gemma":0.000002491597,"teacher_disagreement_score":0.7074531,"about_ca_system_score_codex":0.000030371177,"about_ca_system_score_gemma":0.000034051456,"threshold_uncertainty_score":0.99577516},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030273467,0.002597747,0.9840474,0.0014957649,0.0021363557,0.0030160414,0.0005169444,0.0030070308,0.00015533084],"genre_scores_gemma":[0.14468998,0.0007212825,0.8304477,0.0014715195,0.0024322018,0.009247195,0.0005817197,0.00038587934,0.010022543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99494725,0.00048552963,0.0009816192,0.0016953585,0.0006683999,0.0012218542],"domain_scores_gemma":[0.9946429,0.0006835617,0.00066764804,0.0029649767,0.00048137258,0.0005594983],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0023601642,0.00084131514,0.0009874959,0.0015931181,0.00048160047,0.001403988,0.003677117,0.000964446,0.000007399025],"category_scores_gemma":[0.00045860794,0.00083604746,0.0005206063,0.0013145923,0.00009770845,0.00079825567,0.0022946664,0.0011229542,0.000057394096],"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.00019437243,0.0008867777,0.00065971597,0.0016292619,0.0004899855,0.00041614805,0.0028341056,0.07896977,0.0007128349,0.85622466,0.013497431,0.043484956],"study_design_scores_gemma":[0.00042581055,0.00036902726,0.0002488265,0.0004441964,0.000055303448,0.000059168655,0.00011242513,0.95374566,0.0015695845,0.03782645,0.004177028,0.00096652616],"about_ca_topic_score_codex":0.0034663929,"about_ca_topic_score_gemma":0.00028821282,"teacher_disagreement_score":0.8747759,"about_ca_system_score_codex":0.00054814894,"about_ca_system_score_gemma":0.0006118899,"threshold_uncertainty_score":0.99963266},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011833886,0.0000710305,0.99366933,0.004745141,0.00008399713,0.00014697651,0.000025120122,0.000011535233,0.00006346845],"genre_scores_gemma":[0.97716594,0.000053597243,0.0218683,0.00033295568,0.0003487109,0.00008952821,0.00002799472,0.0000054798484,0.000107482665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991682,0.000026177166,0.00030167843,0.00012213559,0.0003125314,0.00006923445],"domain_scores_gemma":[0.9986532,0.0003362209,0.0003494966,0.0001560973,0.00047418004,0.00003083426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006494189,0.00006343986,0.00012413497,0.0003681076,0.00015190168,0.0000972545,0.00042941511,0.000023547462,0.000008481682],"category_scores_gemma":[0.000018588245,0.000042758486,0.00020109324,0.00073762063,0.000050189563,0.00016730475,0.000043616783,0.00007530639,0.0000023774298],"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.00018865544,0.00039913142,0.00182883,0.000038088725,0.0035343438,0.0000026343976,0.00039436025,0.049412485,0.0035843726,0.6060506,0.0014134205,0.33315304],"study_design_scores_gemma":[0.00028552176,0.000105411236,0.003690945,0.000016813943,0.00016695143,0.0000026719918,0.000021527723,0.95586175,0.0002351492,0.030580644,0.008983326,0.00004931346],"about_ca_topic_score_codex":0.000027406037,"about_ca_topic_score_gemma":0.000018164385,"teacher_disagreement_score":0.97598255,"about_ca_system_score_codex":0.00002055256,"about_ca_system_score_gemma":0.000047630692,"threshold_uncertainty_score":0.17436405},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025435598,0.000027433987,0.9928218,0.00039396944,0.00012804565,0.0002566848,3.2131214e-7,0.0009854685,0.005131933],"genre_scores_gemma":[0.010326152,0.0000016759352,0.98650557,0.000046043344,0.000059873273,0.000069178044,0.0000030836268,0.000015226748,0.0029731716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985912,0.0001952731,0.00025672952,0.0003172241,0.000249374,0.00039021755],"domain_scores_gemma":[0.9989377,0.00038715504,0.00006644406,0.00043586874,0.00006329065,0.00010949639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001770722,0.00012804185,0.0001930834,0.000118756674,0.00017968901,0.00022173191,0.00052524754,0.00006903754,0.00004988119],"category_scores_gemma":[0.00032961322,0.00010742132,0.000068884525,0.0013870704,0.000061016304,0.0003375054,0.00030112627,0.00012540047,0.00076305104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011609584,0.000033281653,0.0000012295918,0.000037841684,0.000008222812,0.000008383409,0.0003027903,0.000025963443,0.00017290626,0.66709596,0.00008600454,0.33222628],"study_design_scores_gemma":[0.000087222674,0.00004042126,0.0000053047115,0.000034330707,0.000006270008,0.00001122792,0.00006741483,0.41615352,0.0026546407,0.5772025,0.0036152524,0.00012188389],"about_ca_topic_score_codex":7.792358e-7,"about_ca_topic_score_gemma":7.070913e-8,"teacher_disagreement_score":0.41612756,"about_ca_system_score_codex":0.00002135277,"about_ca_system_score_gemma":0.000023997603,"threshold_uncertainty_score":0.98077315},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019674495,0.000007296272,0.97766656,0.00041636734,0.00011163316,0.001414574,0.000052892512,0.0004354182,0.00022078911],"genre_scores_gemma":[0.4865549,0.0000010308588,0.51067847,0.00053888786,0.0001357548,0.0018561246,0.000115676725,0.00007219106,0.000046945897],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861723,0.000020848887,0.0004325706,0.0003354875,0.0002651522,0.00032868487],"domain_scores_gemma":[0.99852425,0.00039988186,0.0002729746,0.00067284185,0.000052252766,0.00007778074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007243821,0.00019568631,0.00031103875,0.00018717145,0.00013266609,0.000081437094,0.00076075015,0.000091881484,0.000004417509],"category_scores_gemma":[0.000017720253,0.00018598278,0.0000934193,0.00047503292,0.0000622328,0.00012206098,0.000059423506,0.00011022914,0.000026364618],"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.000016782049,0.00023353314,0.0000066387715,0.0013555583,0.0000835684,0.0000043292634,0.00039201323,0.012842858,0.7675879,0.21193407,0.00481361,0.00072909775],"study_design_scores_gemma":[0.0008290289,0.00011121589,0.000007974861,0.00018328059,0.000037352438,0.0000065066047,0.000069918446,0.78993666,0.18372537,0.024361182,0.00035916176,0.00037233921],"about_ca_topic_score_codex":0.0000048882275,"about_ca_topic_score_gemma":0.0000020500133,"teacher_disagreement_score":0.7770938,"about_ca_system_score_codex":0.000028813158,"about_ca_system_score_gemma":0.000028552517,"threshold_uncertainty_score":0.75841576},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013152302,0.0006214923,0.31567287,0.00022425778,0.00041758933,0.0001285002,0.0000059439167,0.00019940715,0.6827168],"genre_scores_gemma":[0.0009527355,0.0003298513,0.03877943,0.0001569632,0.000314441,0.0000034620282,0.000009406812,0.000020973845,0.9594327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990258,0.000014475506,0.00020080665,0.0004065361,0.00019365676,0.0001586771],"domain_scores_gemma":[0.9993537,0.000044225613,0.0000908709,0.0003865699,0.000030252493,0.000094371746],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011056133,0.00022039624,0.00020636854,0.000094575786,0.000105654064,0.00018535719,0.00038827557,0.00018153552,0.0013621891],"category_scores_gemma":[0.0000015746522,0.00020236273,0.00008572655,0.000018103749,0.000046293837,0.0002366759,0.00026428388,0.00017044302,0.0005320196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020705115,0.000007083755,1.9535933e-7,0.000015080248,0.00001498877,0.000031448773,0.000026113876,8.9341205e-7,0.00003281168,0.9771638,0.0018762682,0.020829251],"study_design_scores_gemma":[0.0005810735,0.00017415023,0.000008640989,0.00013559131,0.000048521884,0.00030898032,0.0000021069634,0.025330357,0.00051572995,0.6364282,0.3355036,0.0009630505],"about_ca_topic_score_codex":0.0000023428427,"about_ca_topic_score_gemma":5.9132924e-7,"teacher_disagreement_score":0.3407356,"about_ca_system_score_codex":0.000016246544,"about_ca_system_score_gemma":0.000009863424,"threshold_uncertainty_score":0.9995507},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002885681,0.00043536501,0.020110235,0.0003031053,0.00044030297,0.00016389946,0.000008893365,0.00003745058,0.9784719],"genre_scores_gemma":[0.009275093,0.00011742757,0.0036055802,0.0002054699,0.00008658852,7.560207e-7,5.443115e-7,0.00001065871,0.98669785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919367,0.000015841433,0.00024368033,0.00016617609,0.00030325117,0.00007738842],"domain_scores_gemma":[0.998933,0.000055885208,0.00022935844,0.0007109286,0.000048112706,0.00002269508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016760899,0.0001170433,0.00020590167,0.000053958298,0.000075372016,0.000006866554,0.0012811689,0.00011470876,0.00047269466],"category_scores_gemma":[0.000006109729,0.00006946663,0.00015406562,0.000030324765,0.00008459737,0.00008817715,0.0025626991,0.0001278022,0.000028987888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.651341e-7,0.000008779588,3.473751e-7,0.000030041769,0.000007659035,8.32036e-7,0.000114789545,0.000003120681,0.00014432656,0.98906237,0.0004592089,0.010167877],"study_design_scores_gemma":[0.00013064002,0.000055290737,0.000005827549,0.00019177102,0.000011444203,0.0000055385613,9.531307e-7,0.0023275372,0.011520527,0.9254832,0.06010374,0.00016350088],"about_ca_topic_score_codex":0.0000034045154,"about_ca_topic_score_gemma":2.6094338e-7,"teacher_disagreement_score":0.06357912,"about_ca_system_score_codex":0.0000089555815,"about_ca_system_score_gemma":0.00002252295,"threshold_uncertainty_score":0.5175675},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000016286479,0.00020124282,0.1103239,0.00016748224,0.00020979067,0.00008386496,0.0000035980922,0.00008632532,0.88892215],"genre_scores_gemma":[0.0008418267,0.00012716306,0.017273152,0.00033231275,0.00008583503,8.243645e-7,0.0000028259765,0.000012428113,0.98132366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911344,0.000010031911,0.00022869001,0.00026024634,0.00027380348,0.00011378338],"domain_scores_gemma":[0.99913925,0.00005026793,0.00013820581,0.00057259365,0.000045644094,0.000054056312],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001627163,0.00015893439,0.00022252131,0.000093487375,0.00006228167,0.000018413033,0.0009267062,0.00016028144,0.0017047636],"category_scores_gemma":[0.000003869189,0.00012941142,0.000113581664,0.00001979076,0.000037549617,0.00010152173,0.001984852,0.0001443133,0.0003032757],"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":[7.5030806e-7,0.000008631349,6.7492316e-8,0.000016132191,0.000011273801,0.000010904893,0.00011585819,0.0000015559525,0.000042614978,0.9662886,0.0023037088,0.031199861],"study_design_scores_gemma":[0.00010207491,0.00006248962,3.8984166e-7,0.00005679167,0.000007905234,0.000010750763,3.3684321e-7,0.0035535444,0.0009844204,0.48242393,0.5125917,0.00020566076],"about_ca_topic_score_codex":0.0000034160441,"about_ca_topic_score_gemma":3.2318056e-7,"teacher_disagreement_score":0.510288,"about_ca_system_score_codex":0.000013785936,"about_ca_system_score_gemma":0.000014377557,"threshold_uncertainty_score":0.9992078},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.7822174e-7,0.0006805186,0.32604992,0.000060905724,0.00019406412,0.00007783225,0.000005406629,0.000086140506,0.67284507],"genre_scores_gemma":[0.000018660432,0.00013324842,0.40015525,0.000073909716,0.00004736867,0.0000011231925,0.0000015736221,0.000010837371,0.59955806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998843,0.00005391052,0.00039827367,0.00035700365,0.00019537155,0.00015241103],"domain_scores_gemma":[0.998624,0.00022124454,0.00017815466,0.0008431841,0.00006122263,0.000072144656],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00047472242,0.00022266456,0.0004232099,0.0001489154,0.00004062313,0.000032985594,0.0009230369,0.000206625,0.0048332456],"category_scores_gemma":[0.000008985053,0.00018694953,0.00022890918,0.000040740728,0.00010139771,0.00010535216,0.00018996574,0.00018966164,0.00032907075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017868873,0.0000052212235,5.9292876e-8,0.000019740675,0.000023130699,0.0000090425765,0.000023075077,0.0000013458891,0.000012467569,0.8239589,0.0004303558,0.17551492],"study_design_scores_gemma":[0.00007247739,0.000039503135,4.4356912e-7,0.000041884417,0.000016154434,0.000027400143,9.3083906e-7,0.0006170298,0.00049119187,0.6670961,0.3314019,0.00019500809],"about_ca_topic_score_codex":0.0000054291254,"about_ca_topic_score_gemma":4.7339748e-7,"teacher_disagreement_score":0.33097157,"about_ca_system_score_codex":0.000011325291,"about_ca_system_score_gemma":0.00009167757,"threshold_uncertainty_score":0.99607646},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.0226728e-7,0.0004477928,0.45488113,0.0002371067,0.00033836032,0.000105524305,0.000004572699,0.0002918189,0.5436936],"genre_scores_gemma":[0.000008266237,0.00012803636,0.24957585,0.00054122927,0.00034799226,0.0000055157,0.0000044649746,0.000035147805,0.74935347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978429,0.0002436402,0.000417184,0.0007952692,0.0003377265,0.00036325454],"domain_scores_gemma":[0.99757564,0.00074444665,0.00013686359,0.0013041705,0.000043099273,0.00019576546],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013010371,0.00045182885,0.00051361124,0.00020700217,0.00012419863,0.00019126799,0.0017436835,0.00043845066,0.012014653],"category_scores_gemma":[0.00002060357,0.00036007035,0.0003657303,0.00006151483,0.00014881467,0.00024266052,0.00039406755,0.0006224937,0.003701136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070907945,0.000008356453,1.3841972e-8,0.000008108504,0.000028213068,0.000034039636,0.00002494091,0.0000014621679,0.0000037007183,0.6672734,0.0019291282,0.33068153],"study_design_scores_gemma":[0.000077934885,0.0000305648,1.9399776e-7,0.00002582304,0.000016051987,0.000035371755,0.0000010254187,0.00094866985,0.00007103391,0.5402536,0.45826942,0.00027037438],"about_ca_topic_score_codex":0.0000010251536,"about_ca_topic_score_gemma":4.7113787e-7,"teacher_disagreement_score":0.45634028,"about_ca_system_score_codex":0.000042469168,"about_ca_system_score_gemma":0.00011354927,"threshold_uncertainty_score":0.99988514},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.4629832e-7,0.00015927803,0.063701876,0.00023677971,0.00038912293,0.00010066376,0.0000050653866,0.0002978406,0.935109],"genre_scores_gemma":[0.00015155812,0.00010766993,0.009065418,0.0005891572,0.0002998309,0.000002410811,0.0000055802875,0.000023001736,0.9897554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998959,0.000014505224,0.00019691492,0.00042228427,0.0002080351,0.00019924308],"domain_scores_gemma":[0.99891174,0.000049802562,0.00006665458,0.0008509358,0.000022119602,0.000098721706],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00017028744,0.00025053613,0.00022885906,0.00009313288,0.00007518086,0.00013799891,0.0011417362,0.00019882701,0.011635417],"category_scores_gemma":[0.0000020977568,0.0002010835,0.00014549197,0.00002477856,0.00006521395,0.00015717135,0.0001692532,0.00022167125,0.003916734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013901479,0.000003342462,1.9846448e-8,0.0000030133397,0.000012052936,0.000027197857,0.00002651109,0.0000012228381,0.0000011656167,0.867362,0.0018872962,0.13067476],"study_design_scores_gemma":[0.000039373215,0.000015967695,1.5372058e-7,0.000013953612,0.0000029385326,0.000018298182,2.8856377e-7,0.00027383407,0.00002744427,0.5210559,0.47838867,0.00016318566],"about_ca_topic_score_codex":0.00000298971,"about_ca_topic_score_gemma":0.0000013755864,"teacher_disagreement_score":0.47650138,"about_ca_system_score_codex":0.000015489948,"about_ca_system_score_gemma":0.000045789835,"threshold_uncertainty_score":0.99685884},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055968645,0.00061466004,0.058088623,0.0007349495,0.0015907489,0.006142459,0.00056733005,0.0012525832,0.93044895],"genre_scores_gemma":[0.0012870837,0.0004984338,0.11674909,0.0005056749,0.0030997824,0.00037129477,0.000047709225,0.00030370848,0.87713724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808574,0.000004160128,0.0005794298,0.0006465474,0.00030312463,0.00038098934],"domain_scores_gemma":[0.9984175,0.00048640827,0.0004350522,0.00044023662,0.000044210603,0.0001765979],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076261954,0.0005121066,0.0007275366,0.000081601465,0.00038076306,0.00033066084,0.0004921947,0.00076025416,0.000017717834],"category_scores_gemma":[0.000012393232,0.00044570456,0.0003891438,0.0000249543,0.00022676644,0.00006447082,0.0005508182,0.00045146505,0.000026217456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010882973,0.0000076292963,3.3771396e-8,0.00025008296,0.00016703753,0.0000014140263,0.00072601455,4.4601074e-7,0.000070193426,0.9524653,0.0017810903,0.04451988],"study_design_scores_gemma":[0.0013598283,0.00010037198,7.6779095e-8,0.0002361298,0.0001942749,0.000016786065,0.00015244528,0.0008358748,0.00049740396,0.9279061,0.06799252,0.0007082006],"about_ca_topic_score_codex":0.0000015254914,"about_ca_topic_score_gemma":7.499094e-7,"teacher_disagreement_score":0.06621143,"about_ca_system_score_codex":0.000021630356,"about_ca_system_score_gemma":0.000057635774,"threshold_uncertainty_score":0.9997995},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047141623,0.0009159078,0.9507502,0.0007510861,0.00013913191,0.00017469766,0.00001647295,0.00010091944,0.000010004377],"genre_scores_gemma":[0.98342323,0.00013329009,0.0154377315,0.00005901104,0.00049319735,0.000016836999,0.000041014988,0.00001922368,0.00037648776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874824,0.00006499675,0.0002975456,0.00014847319,0.00031165316,0.00042910647],"domain_scores_gemma":[0.999005,0.00027345808,0.00027002694,0.00015175002,0.0002285643,0.00007115613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092561665,0.0001091137,0.00017160561,0.00013042145,0.00014669607,0.000062199586,0.0004774334,0.000033659686,0.000007595467],"category_scores_gemma":[0.00009072934,0.00008137419,0.0000888856,0.00056379114,0.000027241047,0.0004650842,0.00004217528,0.00020346754,0.000016640457],"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.0007341574,0.00023275988,0.000051915573,0.00011230994,0.00045054124,0.00006638211,0.0015083076,0.023410596,0.000640669,0.9359145,0.005362585,0.03151525],"study_design_scores_gemma":[0.0030510288,0.0045992946,0.0005686519,0.0001441528,0.00013271248,0.00053774944,0.00025075677,0.53959805,0.0029127733,0.43790126,0.009798911,0.0005046794],"about_ca_topic_score_codex":0.0000012491694,"about_ca_topic_score_gemma":0.0000010625608,"teacher_disagreement_score":0.93628156,"about_ca_system_score_codex":0.00007633571,"about_ca_system_score_gemma":0.00044307875,"threshold_uncertainty_score":0.33183432},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91596687,0.012978095,0.06928753,0.00081343646,0.00038012437,0.00009503093,0.0000025115028,0.00006984619,0.00040652844],"genre_scores_gemma":[0.9957037,0.00243537,0.0015770893,0.0000412138,0.00012876207,5.6151885e-7,4.4452258e-7,0.0000084864005,0.00010439464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987919,0.00009474772,0.0003852406,0.0001317266,0.00022146945,0.00037495396],"domain_scores_gemma":[0.9989972,0.00027717906,0.00034293593,0.00019221871,0.000110855115,0.00007959063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014364608,0.000112600545,0.00026293573,0.00062893296,0.00006669155,0.0000374563,0.00063133525,0.00004734754,0.000010751387],"category_scores_gemma":[0.00007595959,0.0000801739,0.00012580382,0.0017991931,0.000042453063,0.00030587602,0.00011523438,0.0003263393,0.000010244855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033191114,0.00007034403,0.00033774757,0.00005116111,0.00017526493,0.000030668492,0.0006009506,0.00008867729,0.0015917475,0.9223669,0.00039117222,0.07426217],"study_design_scores_gemma":[0.0013286003,0.0017000341,0.0018124491,0.00009966132,0.00004666331,0.0008021188,0.00026092102,0.03267924,0.027089033,0.9271798,0.0066455305,0.00035595233],"about_ca_topic_score_codex":0.0000029335433,"about_ca_topic_score_gemma":7.9350787e-7,"teacher_disagreement_score":0.079736784,"about_ca_system_score_codex":0.000019671279,"about_ca_system_score_gemma":0.00016417916,"threshold_uncertainty_score":0.32693967},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017219186,0.00007607659,0.9758498,0.0039057268,0.0009831849,0.0007311548,0.00014500036,0.0003695849,0.0007202794],"genre_scores_gemma":[0.6732531,0.0010298927,0.30576465,0.0007473259,0.0003323209,0.00022071053,0.000005558092,0.00020015055,0.018446287],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954821,0.00037580373,0.0012124751,0.00096110546,0.0011934951,0.00077502016],"domain_scores_gemma":[0.99389833,0.0016988391,0.001322081,0.002591456,0.00022965361,0.00025963783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015782514,0.00062420475,0.0013904744,0.00017832225,0.0006227466,0.0002062634,0.004205422,0.00024695075,0.00038568582],"category_scores_gemma":[0.00019259956,0.0004622724,0.0030655803,0.004910583,0.0020867568,0.00020979444,0.0006753932,0.0015757504,0.0005635349],"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.00027965367,0.0125400005,0.0003944085,0.022818787,0.013997011,0.00003451762,0.102809936,0.07216865,0.005020751,0.36951482,0.022534514,0.37788695],"study_design_scores_gemma":[0.000637776,0.00038709067,0.0013787514,0.0011946002,0.0010747211,0.00006074187,0.0038831532,0.4877457,0.003214188,0.4979033,0.0010379845,0.0014820171],"about_ca_topic_score_codex":0.00018091888,"about_ca_topic_score_gemma":0.0000016223421,"teacher_disagreement_score":0.67008513,"about_ca_system_score_codex":0.00018210182,"about_ca_system_score_gemma":0.00026622904,"threshold_uncertainty_score":0.9997829},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5257968,0.00043375263,0.47125542,0.0007725123,0.000895001,0.00005902131,0.0000025685229,0.00023506398,0.00054990355],"genre_scores_gemma":[0.9946564,0.00077381154,0.0003954193,0.00003191767,0.00023649933,0.0000053468184,0.0000034011605,0.000009479301,0.0038877367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761283,0.0000585875,0.00020578672,0.00023403752,0.00028634828,0.0016023979],"domain_scores_gemma":[0.99956703,0.00003551622,0.000076209806,0.000181486,0.000039114955,0.00010066177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014954936,0.00012082949,0.00011778983,0.00014357184,0.00048128975,0.00007921023,0.0007454218,0.000048097274,0.000035446297],"category_scores_gemma":[0.000013278215,0.00010633467,0.000104488645,0.00074725965,0.000021360822,0.0005727458,0.00005887054,0.001007015,0.0001913398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004299097,0.00015764561,0.002337113,0.000013418855,0.00036143576,0.000059596943,0.0013223296,0.0029281555,0.010235117,0.78427315,0.0015236363,0.19674541],"study_design_scores_gemma":[0.0029811007,0.0025932724,0.005272584,0.00010957105,0.0001372439,0.0019038474,0.0071821064,0.04461575,0.0073055495,0.9011381,0.024595948,0.002164876],"about_ca_topic_score_codex":0.000021829772,"about_ca_topic_score_gemma":0.000025612471,"teacher_disagreement_score":0.47086,"about_ca_system_score_codex":0.00013940896,"about_ca_system_score_gemma":0.0006741632,"threshold_uncertainty_score":0.43750352},"labels":[],"label_agreement":null},{"id":"W4389941500","doi":"10.1002/nla.2543","title":"Generalizing reduction‐based algebraic multigrid","year":2023,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Diagonally dominant matrix; Multigrid method; Applied mathematics; Robustness (evolution); Discretization; Condition number; Mathematical optimization; Bounded function; Algorithm; Mathematical analysis; Pure mathematics; Partial differential equation","score_opus":0.01617655189294508,"score_gpt":0.2601246523332715,"score_spread":0.2439481004403264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389941500","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00258726,0.000036922844,0.9926158,0.0025618412,0.000105621584,0.000433019,0.0000094253755,0.0011455702,0.000504523],"genre_scores_gemma":[0.25951847,0.00001703384,0.73563606,0.00092611776,0.00085686153,0.0013410196,0.00014020626,0.000058286467,0.0015059592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998438,0.000068193665,0.00024324514,0.00056689023,0.00031096724,0.00037272353],"domain_scores_gemma":[0.99864775,0.00009842219,0.00009378208,0.000854372,0.00009877303,0.00020687422],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022211969,0.00018232343,0.00017078794,0.00017668455,0.0003708526,0.000091652764,0.00075464457,0.00006361598,0.00004863426],"category_scores_gemma":[0.00002094545,0.00015415552,0.000078293575,0.0025052165,0.00008805054,0.00017426646,0.00012412618,0.00018406089,0.0011637058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004183141,0.00050116703,0.0003323967,0.00006935837,0.000100521494,0.000024569432,0.00035714195,0.034499623,0.006619319,0.80193347,0.007828075,0.14769253],"study_design_scores_gemma":[0.00079487683,0.00016336273,0.0010406992,0.000020940139,0.000026210895,0.000056468583,0.000040321447,0.8211432,0.010349191,0.018346809,0.14735733,0.0006605668],"about_ca_topic_score_codex":0.00001111231,"about_ca_topic_score_gemma":4.47677e-7,"teacher_disagreement_score":0.7866436,"about_ca_system_score_codex":0.000024320849,"about_ca_system_score_gemma":0.00009465099,"threshold_uncertainty_score":0.999614},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09178789,0.0060288613,0.8828322,0.012463064,0.004341245,0.0011759675,0.00005114226,0.00009784028,0.001221775],"genre_scores_gemma":[0.969308,0.00017322855,0.028684847,0.00032077494,0.0004902103,0.000012932442,9.0935646e-7,0.000028020868,0.0009810465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990065,0.000051593295,0.00033406614,0.00013644867,0.00017786822,0.0002935041],"domain_scores_gemma":[0.99782544,0.0010772678,0.00019672007,0.00033163457,0.00032555652,0.00024337076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020174754,0.00011763228,0.00020383648,0.0006725625,0.00036029675,0.00029251797,0.0006935598,0.000042668165,0.0000099508325],"category_scores_gemma":[0.0018135863,0.000073149946,0.00007002479,0.002024293,0.00011304404,0.00020275133,0.000034710803,0.00014558417,0.000025520281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026557655,0.000014412454,0.00007858622,0.00013950575,0.000060349354,0.000037879272,0.0007868646,0.0000373639,0.000030095494,0.9761575,0.0056368397,0.017017934],"study_design_scores_gemma":[0.0018438968,0.0010233008,0.0031860976,0.00030594462,0.00035885087,0.0019464134,0.0031191942,0.12300342,0.0016722487,0.7902365,0.07247903,0.00082511856],"about_ca_topic_score_codex":0.00002089886,"about_ca_topic_score_gemma":0.0000339173,"teacher_disagreement_score":0.87752014,"about_ca_system_score_codex":0.000031871004,"about_ca_system_score_gemma":0.00041907481,"threshold_uncertainty_score":0.2982968},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002949266,0.005373491,0.09432818,0.0007072047,0.0037746811,0.0002229338,0.000013694712,0.00058335235,0.89499354],"genre_scores_gemma":[0.00017318534,0.00018359606,0.026837198,0.00023341272,0.0013202293,0.000009131059,0.0000024869464,0.00019360396,0.97104716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980721,0.00008636204,0.00028129268,0.000837063,0.00032806423,0.00039511052],"domain_scores_gemma":[0.9987405,0.00004912976,0.00009539718,0.00094877224,0.000027799932,0.00013842204],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00033430077,0.00040354716,0.00035830855,0.0002782206,0.00004437648,0.000633408,0.0012314137,0.00030754897,0.037818618],"category_scores_gemma":[0.000011587358,0.0003081572,0.00023267856,0.0004227598,0.00008437609,0.00011820149,0.00061755633,0.00036802178,0.17797779],"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.0000012191174,0.000027189808,0.0000015607568,0.00021681655,0.00007603185,0.000076739365,0.00007725782,7.1081837e-7,0.000016134129,0.6468888,0.33246303,0.020154554],"study_design_scores_gemma":[0.00008232703,0.00004065559,0.0000031822167,0.0002920784,0.00004468613,0.000035492172,0.000008904428,0.0027489015,0.00021143472,0.030913126,0.96518606,0.00043317655],"about_ca_topic_score_codex":0.000044097287,"about_ca_topic_score_gemma":0.0000018696544,"teacher_disagreement_score":0.63272303,"about_ca_system_score_codex":0.000024666004,"about_ca_system_score_gemma":0.000097699616,"threshold_uncertainty_score":0.99993706},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.5928704e-8,0.0022390285,0.05955773,0.00013459867,0.0011554627,0.00005793785,0.0000031709842,0.0011501821,0.93570185],"genre_scores_gemma":[0.0000065432805,0.000039290757,0.022972304,0.00014263653,0.00036647127,0.000002824055,0.0000011191513,0.0001333324,0.97633547],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936855,0.000016654947,0.00006751055,0.0003106466,0.00010491503,0.00013174368],"domain_scores_gemma":[0.999469,0.000012860389,0.00002244349,0.00044429523,0.0000031717682,0.00004826445],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00006230581,0.00012880449,0.000111849775,0.00008953851,0.000007938649,0.000116867006,0.0006232729,0.00011027914,0.014777588],"category_scores_gemma":[0.0000020559028,0.00009649168,0.000056415705,0.00006815589,0.000015297019,0.000006083051,0.00013718201,0.00010949162,0.026243584],"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":[7.139557e-8,0.0000041509234,1.5060671e-8,0.00003617805,0.0000100303305,0.00013205675,0.000009840228,6.235254e-8,0.000001200693,0.21079807,0.78040385,0.0086044725],"study_design_scores_gemma":[0.000019128498,0.000008785675,1.701253e-8,0.00004660068,0.0000039772026,0.000052044696,0.0000011446833,0.00040866045,0.000021596852,0.022168728,0.97713023,0.00013907596],"about_ca_topic_score_codex":0.00004200986,"about_ca_topic_score_gemma":0.000014019022,"teacher_disagreement_score":0.1967264,"about_ca_system_score_codex":0.000004876521,"about_ca_system_score_gemma":0.000015594509,"threshold_uncertainty_score":0.986123},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028125467,0.00032868405,0.98969007,0.0011890514,0.00074890954,0.00022871976,0.000011781248,0.00052922266,0.0044610226],"genre_scores_gemma":[0.38683382,0.000039964776,0.5985873,0.0003195579,0.00040854828,0.00010411055,0.000010054814,0.00005028898,0.013646377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998741,0.000044708868,0.00029501074,0.00028717032,0.00032063122,0.0003114852],"domain_scores_gemma":[0.99891603,0.00034567463,0.000041312378,0.0005317111,0.00004379187,0.00012150135],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00065905135,0.00014354239,0.00014977707,0.00038517066,0.00016099213,0.0004136853,0.0005713658,0.00005752729,0.00012534742],"category_scores_gemma":[0.00013787627,0.00012409032,0.00009714909,0.001330199,0.000017484786,0.00030447077,0.00027801367,0.00012408182,0.0025350186],"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":[3.5742735e-7,0.00006273379,0.0000018088967,0.00010806768,0.000015436735,0.000010422535,0.0011181742,0.00014777956,0.00019973477,0.9866953,0.003249716,0.008390463],"study_design_scores_gemma":[0.00007093425,0.000045732322,0.000027986334,0.00011117418,0.000018915913,0.000027675538,0.000035931946,0.6567141,0.00035056152,0.3284568,0.013935651,0.00020459789],"about_ca_topic_score_codex":0.000009253026,"about_ca_topic_score_gemma":0.0000019934566,"teacher_disagreement_score":0.65823853,"about_ca_system_score_codex":0.00006640793,"about_ca_system_score_gemma":0.00005254548,"threshold_uncertainty_score":0.9982416},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035981466,0.00045951857,0.9970707,0.0005488369,0.0002503373,0.00030504086,0.00001660336,0.00008329653,0.0012296557],"genre_scores_gemma":[0.045850158,0.000013786198,0.9525671,0.00028709514,0.00017397494,0.000039400104,0.000013481615,0.00003257754,0.0010224315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847907,0.0000061223445,0.0002763108,0.0005538959,0.00040693607,0.00027765118],"domain_scores_gemma":[0.9988258,0.0008469992,0.000041162577,0.00013241843,0.00007951744,0.000074105934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001278972,0.00022855648,0.00031193226,0.0005550492,0.00006026494,0.00014324232,0.0005398979,0.00013141034,0.000010613873],"category_scores_gemma":[0.000086421904,0.00021251326,0.00006464993,0.00030366413,0.000071224,0.00023837839,0.000064876695,0.00031545776,0.000006828189],"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.00000633307,0.000003630602,0.0000015417544,0.000049724134,0.000007186743,0.00001721173,0.000106859006,0.8018493,0.00006730027,0.1878707,0.000001378156,0.010018865],"study_design_scores_gemma":[0.00032116994,0.000020978032,0.000029689036,0.00014962246,0.0000061656765,0.000018131985,1.3058042e-7,0.772276,0.000031543663,0.22621888,0.00073182344,0.00019591402],"about_ca_topic_score_codex":0.0000040266,"about_ca_topic_score_gemma":0.000001385648,"teacher_disagreement_score":0.045814175,"about_ca_system_score_codex":0.000096556694,"about_ca_system_score_gemma":0.00016379058,"threshold_uncertainty_score":0.8666039},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010085495,0.00068584835,0.9963411,0.0001497577,0.00046428823,0.00012169767,0.000020646743,0.000068065514,0.002047735],"genre_scores_gemma":[0.43833128,0.00003325243,0.56091374,0.00010072741,0.00020539002,0.000010835656,0.000016794516,0.000029286484,0.00035871554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854046,0.0000036114143,0.0002831855,0.00045695022,0.0005160015,0.00019978949],"domain_scores_gemma":[0.99920326,0.00035432386,0.000074154545,0.00015851641,0.00014218807,0.00006756768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004362477,0.00021440382,0.00022975382,0.0005014543,0.00005424623,0.00012951162,0.0004740108,0.000108330845,0.0000066277466],"category_scores_gemma":[0.00008017328,0.0001969279,0.00005137182,0.00031451212,0.00015159204,0.00029572865,0.000221588,0.0002730034,0.0000055341716],"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.0000019374675,0.0000051462384,0.0000033295805,0.00008811907,0.00001317459,0.000017648095,0.00037555603,0.41388506,0.00006541673,0.26159954,0.000002334252,0.32394275],"study_design_scores_gemma":[0.000058285623,0.000022050595,0.0001047471,0.00024643546,0.0000046852074,0.000024008095,4.353213e-7,0.7458125,0.000086741566,0.25332934,0.00015468597,0.00015611619],"about_ca_topic_score_codex":0.0000097754255,"about_ca_topic_score_gemma":0.00000811512,"teacher_disagreement_score":0.43823043,"about_ca_system_score_codex":0.00008006954,"about_ca_system_score_gemma":0.00015339072,"threshold_uncertainty_score":0.8030487},"labels":[],"label_agreement":null},{"id":"W4391141447","doi":"10.1137/22m1540624","title":"Constraint-Satisfying Krylov Solvers for Structure-Preserving Discretizations","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; European Research Consortium for Informatics and Mathematics","keywords":"Constraint (computer-aided design); Computer science; Generalized minimal residual method; Parallel computing; Computational science; Mathematics; Mathematical optimization; Algorithm; Iterative method; Geometry","score_opus":0.009056516811855151,"score_gpt":0.28915557816443505,"score_spread":0.2800990613525799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391141447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015519194,0.00068014796,0.9951617,0.0016654875,0.000089008194,0.00021263528,0.00008459464,0.000084826184,0.00046966976],"genre_scores_gemma":[0.9148282,0.00025062653,0.083712384,0.00012411884,0.00041854486,0.000060169183,0.00003321573,0.00001473814,0.0005579904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988778,0.000049518432,0.00032552355,0.00034008583,0.00019440304,0.00021262544],"domain_scores_gemma":[0.9989938,0.0003251577,0.000109729175,0.0003216686,0.00009361521,0.00015603862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038226857,0.00014011581,0.00020768367,0.00048496047,0.00067102653,0.0010294983,0.00044762553,0.00005159444,0.000110880916],"category_scores_gemma":[0.000026444517,0.00011246558,0.00025253778,0.0013767589,0.000057053676,0.0003405088,0.00007252721,0.00021681027,0.0000082330325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021822414,0.000020481042,0.00020623597,0.00003519339,0.00047327587,0.0000034681552,0.00015382709,0.0040349765,0.0005382143,0.94671446,0.00030397376,0.047513686],"study_design_scores_gemma":[0.00033516446,0.00008008267,0.00075556454,0.00006944732,0.0010100038,0.000104563725,0.00025804163,0.6294876,0.0003574957,0.31334093,0.053757794,0.00044332517],"about_ca_topic_score_codex":0.00000285519,"about_ca_topic_score_gemma":0.0000060850803,"teacher_disagreement_score":0.9132763,"about_ca_system_score_codex":0.000029497123,"about_ca_system_score_gemma":0.00006216169,"threshold_uncertainty_score":0.9927476},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3021041,0.022172892,0.6406473,0.007081387,0.0009806872,0.0017430643,0.00021698662,0.0001205825,0.024933007],"genre_scores_gemma":[0.9218153,0.0005134574,0.076280884,0.000011506784,0.00019140172,0.000009808293,8.378408e-7,0.000032368473,0.0011444446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9961164,0.00040150646,0.0009964347,0.00020724256,0.001962661,0.00031575086],"domain_scores_gemma":[0.99543947,0.002501884,0.00054539833,0.00042875335,0.00095649314,0.00012801295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069027925,0.00014839724,0.00046411046,0.0008907474,0.000076562224,0.00017353451,0.0015256002,0.00008903484,0.000063501866],"category_scores_gemma":[0.0008505364,0.0001004133,0.0002073367,0.0015385256,0.00016217619,0.00045106382,0.00018216841,0.0006816562,0.00001790045],"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.0005540166,0.0069065765,0.000050067098,0.023568593,0.0014352793,0.0009530091,0.117238656,0.0014800811,0.061336994,0.6209787,0.05757506,0.10792298],"study_design_scores_gemma":[0.0012577298,0.004772064,0.000013154292,0.007525075,0.00008181029,0.00033056503,0.007397066,0.20370716,0.43664443,0.33457118,0.0032872662,0.0004125085],"about_ca_topic_score_codex":0.000008233132,"about_ca_topic_score_gemma":0.0000012702403,"teacher_disagreement_score":0.6197112,"about_ca_system_score_codex":0.00006820083,"about_ca_system_score_gemma":0.0003001669,"threshold_uncertainty_score":0.40947357},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006609301,0.0006431299,0.9964924,0.00046794084,0.00047202932,0.00068005593,0.000007867021,0.00055396865,0.000021703743],"genre_scores_gemma":[0.15148868,0.000036912905,0.84783435,0.000035798992,0.000102644095,0.00031643154,0.0000027109384,0.00003543168,0.00014703856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827427,0.000021277026,0.0004826581,0.0005829402,0.00020065912,0.0004382068],"domain_scores_gemma":[0.9987678,0.0006687951,0.000055147797,0.00031041293,0.00006718154,0.00013069253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013593952,0.00027554145,0.0003619581,0.00013118816,0.00012228636,0.0004537109,0.00022953567,0.00010064298,0.000008806089],"category_scores_gemma":[0.000095385876,0.00023343104,0.000109562025,0.00022213331,0.000029326673,0.0005596839,0.000084818654,0.00021412033,0.000008466068],"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.00000431742,0.00003126194,1.8143592e-7,0.0029813831,0.00005995628,0.0000016061896,0.0017997546,0.61942637,0.0029538441,0.37058046,0.000012922772,0.0021479372],"study_design_scores_gemma":[0.00024566293,0.000065140695,1.3746114e-7,0.00056630804,0.00003503089,0.00007656455,0.000014893509,0.88762254,0.0007793967,0.109543756,0.0007792938,0.00027127206],"about_ca_topic_score_codex":0.0000034811678,"about_ca_topic_score_gemma":1.1284009e-7,"teacher_disagreement_score":0.26819617,"about_ca_system_score_codex":0.00003207336,"about_ca_system_score_gemma":0.000026128844,"threshold_uncertainty_score":0.9519041},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028075187,0.000008697548,0.9925451,0.00031433158,0.00035479304,0.00030179272,0.0000074790305,0.00017288227,0.0034873583],"genre_scores_gemma":[0.41115505,6.5967924e-7,0.58711946,0.00014248956,0.000095029114,0.000051621326,0.0000020890027,0.000009402777,0.0014242254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864453,0.00004118823,0.00018758619,0.0003499161,0.00042500213,0.00035179855],"domain_scores_gemma":[0.9990112,0.00015979105,0.000075858334,0.0005760518,0.00011324843,0.000063843676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014833922,0.000095685056,0.00012494961,0.00015124834,0.0003623622,0.00011605614,0.0016881012,0.00002949139,0.000008743778],"category_scores_gemma":[0.00006655606,0.00006041324,0.00011475146,0.0017994707,0.00025111937,0.00025116283,0.0003369473,0.00007498459,0.000009141549],"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.000004837364,0.00013188651,0.00007107554,0.00008193031,0.000014360584,0.0000013791514,0.0006081901,0.008528184,0.002362287,0.60743034,0.00057685265,0.38018867],"study_design_scores_gemma":[0.00025922194,0.0000254438,0.0001281682,0.000010418023,0.000003396555,0.0000017780304,0.00013817876,0.9709632,0.02296464,0.005050817,0.00036629217,0.00008845672],"about_ca_topic_score_codex":0.000007498568,"about_ca_topic_score_gemma":2.9867772e-7,"teacher_disagreement_score":0.962435,"about_ca_system_score_codex":0.0000198355,"about_ca_system_score_gemma":0.00018747087,"threshold_uncertainty_score":0.313694},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000158864,0.0005135368,0.99636316,0.0004761344,0.00008603754,0.001770635,0.000025543835,0.00033241598,0.00027369394],"genre_scores_gemma":[0.02866026,0.000007936479,0.9698539,0.000058131616,0.000086229,0.0011557402,0.000020493517,0.000024120098,0.00013322673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863607,0.000076995646,0.00047499494,0.00040686433,0.00015340949,0.00025164406],"domain_scores_gemma":[0.99785215,0.0010398146,0.00018961269,0.0006679286,0.00015506895,0.00009540604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069613266,0.00020487799,0.00036616897,0.00015958349,0.0001560014,0.0002722427,0.0007567621,0.00004599301,0.000007783085],"category_scores_gemma":[0.000009198551,0.00016730216,0.00011729822,0.0005666467,0.000089669156,0.00026110208,0.000086443535,0.000121911326,0.00004441767],"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.000004706735,0.00022575156,0.0000018719578,0.00046856116,0.00013405451,5.3704093e-7,0.001087961,0.010787954,0.0021230618,0.9262407,0.00072297937,0.05820189],"study_design_scores_gemma":[0.00049281464,0.00009580229,0.000002832148,0.00012203144,0.000071346905,0.000028665121,0.000010466014,0.92866534,0.0016955319,0.05802951,0.010602637,0.00018302641],"about_ca_topic_score_codex":0.0000011766492,"about_ca_topic_score_gemma":2.5950953e-7,"teacher_disagreement_score":0.9178774,"about_ca_system_score_codex":0.000028007995,"about_ca_system_score_gemma":0.00010165749,"threshold_uncertainty_score":0.6822384},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000739804,0.00011413022,0.98695296,0.011739882,0.00010545078,0.00015351306,0.00007864518,0.000013069395,0.000102528196],"genre_scores_gemma":[0.69089216,0.000038945098,0.3078765,0.00038542808,0.00066966104,0.000039232877,0.00002173998,0.0000050332674,0.00007131248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991204,0.000025491923,0.00029021155,0.00020584818,0.00027694058,0.00008108358],"domain_scores_gemma":[0.9988697,0.00034846785,0.000108446024,0.0003209193,0.00028174807,0.00007069111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062459614,0.00006631164,0.000114674665,0.0002786606,0.0001583982,0.00069848425,0.0009492807,0.00002034956,0.0000063124435],"category_scores_gemma":[0.00006944474,0.000045191984,0.000116536256,0.0005204276,0.000021353382,0.0006077906,0.0002445791,0.00010867096,0.0000032888947],"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.000009208015,0.00007468815,0.000014618865,0.000005791881,0.0014190121,0.0000067707406,0.00039055574,0.062127966,0.00086314266,0.86068404,0.0015723625,0.072831824],"study_design_scores_gemma":[0.000052032483,0.000010952264,0.000015242306,0.000009717157,0.0002974174,0.000062755076,0.00005701174,0.94350415,0.00010329809,0.020149274,0.035684854,0.00005331498],"about_ca_topic_score_codex":0.0000033677177,"about_ca_topic_score_gemma":0.00000862007,"teacher_disagreement_score":0.88137615,"about_ca_system_score_codex":0.000027731907,"about_ca_system_score_gemma":0.00012434753,"threshold_uncertainty_score":0.67354995},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8579838,0.0027822028,0.11940068,0.0069267536,0.0012596361,0.0005892577,0.000088967645,0.00009510068,0.010873586],"genre_scores_gemma":[0.99888384,0.00005109354,0.00034481686,0.00027043925,0.0000280728,0.000013232519,6.668411e-7,0.000005964842,0.00040188356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914736,0.00025159196,0.00018227455,0.0001882977,0.00012796921,0.000102495535],"domain_scores_gemma":[0.9988787,0.0006493946,0.000033044704,0.0003436521,0.000058557504,0.00003664924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007889195,0.000102810736,0.00011309005,0.000052571097,0.00015984556,0.0001262569,0.00037522923,0.000031048476,0.000057188678],"category_scores_gemma":[0.00011858507,0.000048370697,0.000054677632,0.00023235161,0.00031024622,0.00020591056,0.00015466905,0.00015177167,0.000004424953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008445021,0.00001880763,0.000019181643,0.000013207095,0.000018538403,0.0000018015663,0.0015510864,0.000014660571,0.0012102986,0.985547,0.00015607635,0.01144087],"study_design_scores_gemma":[0.0003762222,0.0004796734,0.0005945683,0.00057831506,0.00005668162,0.000031814314,0.0020411483,0.13714753,0.023352917,0.8327945,0.0021945052,0.0003521423],"about_ca_topic_score_codex":0.00002348742,"about_ca_topic_score_gemma":0.0000026849264,"teacher_disagreement_score":0.15275253,"about_ca_system_score_codex":0.000008898044,"about_ca_system_score_gemma":0.00007663654,"threshold_uncertainty_score":0.19724998},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91300064,0.017128833,0.059958223,0.0051134164,0.0016666766,0.0005074245,0.000071148075,0.00036807437,0.0021855629],"genre_scores_gemma":[0.98493665,0.000507617,0.004285879,0.0011518804,0.0006119797,0.000017757537,0.000007889103,0.000041482537,0.00843887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99825233,0.000115372975,0.0003347626,0.00055338413,0.00038537654,0.00035874275],"domain_scores_gemma":[0.998277,0.00077808194,0.00008362756,0.00070625165,0.000036783757,0.00011822348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060542265,0.00026539408,0.00027407234,0.000115206785,0.00022921643,0.0005158776,0.00073189085,0.000081790895,0.00024112349],"category_scores_gemma":[0.00003925915,0.00017192039,0.0001526252,0.00025228548,0.00017616224,0.0003464921,0.0003983343,0.00014686852,0.00007310455],"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.000027124568,0.00004214429,0.00004060446,0.000084689294,0.00006857494,0.000028992998,0.001288627,0.000011765803,0.001488306,0.9805435,0.008653976,0.0077217086],"study_design_scores_gemma":[0.0004895415,0.00054041145,0.00049913896,0.00057510944,0.0000562403,0.000121954254,0.0002347216,0.02001926,0.0030027293,0.31984583,0.65405977,0.00055531954],"about_ca_topic_score_codex":0.0001686487,"about_ca_topic_score_gemma":0.000021000606,"teacher_disagreement_score":0.6606977,"about_ca_system_score_codex":0.00004128897,"about_ca_system_score_gemma":0.00012422462,"threshold_uncertainty_score":0.70107096},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10990276,0.00008806743,0.88828206,0.00064130547,0.0007754754,0.000084090476,4.942262e-7,0.00004742932,0.00017830644],"genre_scores_gemma":[0.80075127,8.3617743e-7,0.19887222,0.000056956287,0.00012631656,7.039558e-7,7.6396833e-7,0.000003674003,0.00018728252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847335,0.00009874352,0.0003632706,0.00036490074,0.0005201957,0.00017954758],"domain_scores_gemma":[0.9989034,0.00017476705,0.00020308723,0.00027189337,0.00031131302,0.00013553117],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0029567464,0.00009688401,0.00018933322,0.00074880064,0.0002556046,0.0013232174,0.0006309673,0.000025923004,0.00002445952],"category_scores_gemma":[0.000036882757,0.0000725563,0.000118360564,0.0040740035,0.000031329328,0.0006318395,0.00010927701,0.00016122585,0.000039042905],"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.000036646416,0.00011580295,0.00070107577,0.00007682395,0.0005397912,0.00012123505,0.0089356,0.10876579,0.026094444,0.067848586,0.0010644813,0.7856997],"study_design_scores_gemma":[0.00008818176,0.0001082014,0.00073650584,0.00006160755,0.000092498245,0.00011455838,0.000118757576,0.9905154,0.0036073998,0.002140459,0.0022993449,0.00011705466],"about_ca_topic_score_codex":0.000006270653,"about_ca_topic_score_gemma":0.0000035780051,"teacher_disagreement_score":0.88174963,"about_ca_system_score_codex":0.000053370517,"about_ca_system_score_gemma":0.00014280378,"threshold_uncertainty_score":0.9997135},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114245005,0.00078396057,0.847768,0.0017739253,0.0013166643,0.0014798918,0.00045203464,0.00019370127,0.031986814],"genre_scores_gemma":[0.7389783,0.0002799133,0.2599301,0.00011034042,0.00030187567,0.000061357394,0.00015648176,0.000046916637,0.00013466315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600154,0.00077036413,0.00089632656,0.0010583081,0.0006728676,0.00060060027],"domain_scores_gemma":[0.99698555,0.00044994912,0.00068732834,0.0012619164,0.0002605636,0.00035470873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023510584,0.0006008912,0.000806644,0.000283683,0.00040648272,0.00025282128,0.0011649684,0.00017925084,0.00013891872],"category_scores_gemma":[0.00010071168,0.00060267275,0.00021699599,0.0003075405,0.000477307,0.00040018436,0.0016205048,0.00067882746,0.00008101775],"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.00009444652,0.00054558215,0.00007752425,0.0002886595,0.00018561305,0.000040260453,0.0050860737,0.21258,0.00011201535,0.773648,0.00014307027,0.007198729],"study_design_scores_gemma":[0.0020097552,0.0004955982,0.000121521116,0.0014282335,0.00019873302,0.00014839228,0.0024298918,0.8677118,0.0055813636,0.10591349,0.012883255,0.0010779811],"about_ca_topic_score_codex":0.00035780936,"about_ca_topic_score_gemma":0.000012047375,"teacher_disagreement_score":0.6677345,"about_ca_system_score_codex":0.00019508881,"about_ca_system_score_gemma":0.00023865663,"threshold_uncertainty_score":0.9996425},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05387931,0.12539266,0.7980448,0.018870013,0.0027631798,0.00027151225,0.000002372292,0.00013085722,0.00064532633],"genre_scores_gemma":[0.9918154,0.00087837584,0.005246753,0.000045797835,0.0008801937,0.0000013065608,2.0490508e-7,0.000013942556,0.0011180657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99857944,0.0001331727,0.00042225767,0.0001395958,0.00035034548,0.0003751668],"domain_scores_gemma":[0.99908185,0.00026849296,0.00017260805,0.00027412636,0.00014908939,0.00005381259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017699429,0.00009985851,0.00018621933,0.00008982659,0.00009239851,0.000096501826,0.0009105615,0.000034148576,0.000015021611],"category_scores_gemma":[0.0001261229,0.000058592945,0.00014827584,0.0005783781,0.00005042577,0.00030212116,0.000079179976,0.0005271555,0.000032493626],"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.000041578474,0.00005024332,0.000011139529,0.000044238594,0.00013524338,0.000049910814,0.00035334617,0.000055553683,0.00089845184,0.95256144,0.0014308253,0.044368036],"study_design_scores_gemma":[0.001097406,0.0024769967,0.00013776119,0.0002580615,0.00012842503,0.0032045804,0.0001096702,0.075057395,0.038590323,0.4251477,0.4532936,0.00049809617],"about_ca_topic_score_codex":0.0000014792146,"about_ca_topic_score_gemma":3.2904754e-7,"teacher_disagreement_score":0.93793607,"about_ca_system_score_codex":0.00005148005,"about_ca_system_score_gemma":0.000558715,"threshold_uncertainty_score":0.23893508},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010967334,0.00015813031,0.996406,0.0003600019,0.00016757248,0.00047900755,0.0000081024145,0.00030391774,0.0010205273],"genre_scores_gemma":[0.16283946,0.0000036931363,0.8368575,0.00009012176,0.000054003835,0.00007055465,0.00003922963,0.000013551625,0.00003191959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989982,0.000018603892,0.00029957428,0.00032938423,0.00020199407,0.00015218907],"domain_scores_gemma":[0.998898,0.00076087326,0.000080443126,0.000121455814,0.00007910579,0.000060076734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000638328,0.00013995396,0.00017458509,0.00012285035,0.00017062822,0.00038586915,0.00015985417,0.000046543748,0.000003818064],"category_scores_gemma":[0.0000124260005,0.00012706211,0.000053872456,0.00029019208,0.000024306568,0.00009760146,0.00007397686,0.00006326977,0.000017025692],"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.000002298287,0.000055898934,3.0229515e-7,0.00024127391,0.000019437364,8.9376715e-7,0.0008648434,0.051367357,0.00019783346,0.8658904,0.0004160324,0.080943435],"study_design_scores_gemma":[0.00015863664,0.000022503677,0.000015875466,0.000031876316,0.00001672857,0.000011540277,0.000052971627,0.73177737,0.00014886411,0.26652816,0.0011214202,0.000114060356],"about_ca_topic_score_codex":6.933069e-7,"about_ca_topic_score_gemma":3.149642e-7,"teacher_disagreement_score":0.68041,"about_ca_system_score_codex":0.00001875963,"about_ca_system_score_gemma":0.000047467598,"threshold_uncertainty_score":0.51814425},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041540865,0.00018471185,0.99708384,0.00019837271,0.000035487414,0.0005002608,0.000029315644,0.00027273525,0.0016537186],"genre_scores_gemma":[0.025225824,0.000031100797,0.9740308,0.00014630334,0.000065783956,0.00016324688,0.00008210726,0.000012054972,0.00024278082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840766,0.00016192633,0.00032858888,0.0006830297,0.00019592975,0.00022289266],"domain_scores_gemma":[0.99916285,0.00025511562,0.000103559614,0.00028498116,0.00010792022,0.0000855606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013071406,0.0001954906,0.00034042905,0.00031250177,0.0002272605,0.00055295276,0.00023164134,0.00008611727,0.000023707627],"category_scores_gemma":[0.000010282384,0.00016313435,0.00016955899,0.0017921504,0.000022878308,0.00034747613,0.00010325258,0.0000986455,0.000004630193],"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.000018374387,0.00003434821,0.0000016580052,0.00007223704,0.00077974336,0.0000011310838,0.0027144605,0.14633092,0.00003614976,0.83284223,0.000048758815,0.017119994],"study_design_scores_gemma":[0.00021406502,0.000048133516,0.0000052019514,0.00000989003,0.0005872172,0.0000014666988,0.00010387303,0.96450514,0.00034598936,0.033315238,0.00065707834,0.00020668696],"about_ca_topic_score_codex":0.000012571245,"about_ca_topic_score_gemma":0.0000035242317,"teacher_disagreement_score":0.81817424,"about_ca_system_score_codex":0.00004103109,"about_ca_system_score_gemma":0.000049365273,"threshold_uncertainty_score":0.66524255},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19062068,0.0006331307,0.8029751,0.0003627584,0.0012097134,0.0010651493,0.00012697543,0.00014069703,0.0028657778],"genre_scores_gemma":[0.9964493,0.000014428889,0.0027018953,0.000020475793,0.000042346644,0.0000011324248,0.000001989063,0.000009766667,0.00075865973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989639,0.00012628634,0.00021055005,0.0004507161,0.00007332583,0.00017522005],"domain_scores_gemma":[0.99829274,0.00026450094,0.0003727253,0.00091712526,0.00011507319,0.000037859325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043168437,0.00017684964,0.00029584515,0.00012985704,0.000087782384,0.000035909452,0.0020654534,0.00016338573,0.000007725885],"category_scores_gemma":[0.000039378727,0.00013972087,0.00034506654,0.00052528165,0.00013414194,0.000070909664,0.0027968807,0.00038415543,0.0000017622688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027638504,0.00007618569,0.00030751285,0.0019166786,0.00016874455,0.000019075376,0.00090725103,0.053627834,0.000086888205,0.9408355,0.00029176043,0.0017349605],"study_design_scores_gemma":[0.00031609603,0.0000766357,0.000052487532,0.000557283,0.00015582876,0.000004370395,0.00016616414,0.38287547,0.010927256,0.604074,0.0005391431,0.00025525884],"about_ca_topic_score_codex":0.000037462356,"about_ca_topic_score_gemma":0.0000080121645,"teacher_disagreement_score":0.80582863,"about_ca_system_score_codex":0.000036814254,"about_ca_system_score_gemma":0.0001765442,"threshold_uncertainty_score":0.56976515},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.347422e-7,0.0019887195,0.16462936,0.00004909901,0.00061246764,0.00010269168,0.0000017989304,0.00017555365,0.8324395],"genre_scores_gemma":[0.0002712533,0.000011209882,0.029656012,0.000026470669,0.00011834796,0.0000054725506,0.000001498986,0.00006291031,0.96984684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990757,0.00010189063,0.00010366433,0.00019510531,0.00045878845,0.000064829954],"domain_scores_gemma":[0.99947846,0.000011163851,0.000060281065,0.00036969295,0.00006287344,0.000017558297],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012663942,0.000085499065,0.00012304453,0.00016603102,0.0000039213974,0.000034051653,0.0003780193,0.00008132707,0.0034566633],"category_scores_gemma":[0.000034142315,0.000062535,0.000056023477,0.00015787633,0.000017947625,0.00003057652,0.00009201469,0.000062837484,0.0007005665],"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":[1.0497549e-7,0.0000100390325,5.4259303e-8,0.000048935784,0.00003888024,0.0000014027418,0.000049287482,0.0000012128236,0.000013364686,0.48756883,0.37795687,0.13431102],"study_design_scores_gemma":[0.00009395846,0.000023724866,2.680582e-7,0.00032300228,0.000096618554,0.0000036114657,0.000009183484,0.043425806,0.0009862533,0.36837795,0.58649856,0.00016106904],"about_ca_topic_score_codex":0.00002876156,"about_ca_topic_score_gemma":0.000004767539,"teacher_disagreement_score":0.20854166,"about_ca_system_score_codex":0.000013654357,"about_ca_system_score_gemma":0.00006897632,"threshold_uncertainty_score":0.9974543},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003574032,0.00042625424,0.1561858,0.0003143931,0.00007393656,0.00008764866,0.000040746065,0.00017626202,0.84269136],"genre_scores_gemma":[0.0006106822,0.00035079723,0.17348292,0.00013465346,0.000059938724,0.000017912962,0.0000037048503,0.00007767769,0.8252617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995023,0.000020624444,0.00008641554,0.00021959953,0.00009102686,0.000080052356],"domain_scores_gemma":[0.99959105,0.000026288628,0.000022245698,0.00030364856,0.000018907507,0.000037834914],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00005850762,0.000107583466,0.00013593095,0.00011088932,0.000027177437,0.000073433555,0.00021349629,0.00006145749,0.0014816509],"category_scores_gemma":[0.0000043768664,0.00006958508,0.000026139573,0.0001752233,0.000067907866,0.0000505945,0.00008220498,0.00007719761,0.00026381138],"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":[3.3572513e-7,0.000015071319,0.0000021435205,0.000044604203,0.000036370526,0.000005647371,0.00006883663,0.0000013656926,0.0000031780778,0.9326987,0.06576393,0.0013598027],"study_design_scores_gemma":[0.000718948,0.0003088725,0.000031889052,0.0015493169,0.00024910507,0.00034857268,0.0002646831,0.011727896,0.0007128427,0.18834315,0.79454017,0.0012045362],"about_ca_topic_score_codex":0.0000571696,"about_ca_topic_score_gemma":0.000066118315,"teacher_disagreement_score":0.74435556,"about_ca_system_score_codex":0.0000029596688,"about_ca_system_score_gemma":0.0000351549,"threshold_uncertainty_score":0.99943113},"labels":[],"label_agreement":null},{"id":"W4394761142","doi":"10.1137/22m1519523","title":"Analyzing Vector Orthogonalization Algorithms","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orthogonalization; Lanczos resampling; Rounding; Algorithm; Hermitian matrix; Orthogonality; Mathematics; Conjugate gradient method; Lanczos algorithm; Krylov subspace; Matrix (chemical analysis); Round-off error; Sequence (biology); Stiefel manifold; Machine epsilon; Iterative method; Eigenvalues and eigenvectors; Computer science","score_opus":0.008949164999574367,"score_gpt":0.2848159887379113,"score_spread":0.27586682373833693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394761142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00096454244,0.002474272,0.9944291,0.0012025307,0.00009425513,0.000096320175,0.000009973546,0.00012736332,0.0006016256],"genre_scores_gemma":[0.9406193,0.0021739497,0.052779697,0.00023361878,0.0013311284,0.00007652581,0.000038377133,0.000028958204,0.0027184777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874204,0.00008660628,0.00035137823,0.00037197143,0.00025199555,0.00019601265],"domain_scores_gemma":[0.99915516,0.00014710834,0.00011102993,0.00032117055,0.00009154498,0.00017397733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065675314,0.00014643863,0.000220461,0.0007315191,0.0004283472,0.000982504,0.0003771935,0.00005161805,0.000102536884],"category_scores_gemma":[0.000011323372,0.00011606232,0.00026850385,0.0030734583,0.0000317743,0.0003753404,0.000060773764,0.00025202884,0.00007998763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020147725,0.000051257954,0.00025846384,0.000021771386,0.0005703077,0.00002085817,0.000083559884,0.002149596,0.00020163026,0.84857124,0.00021743694,0.14785185],"study_design_scores_gemma":[0.00024224969,0.00010643673,0.0026274193,0.00006672487,0.0011766554,0.00021788562,0.000059100348,0.7482098,0.00039600703,0.08692167,0.15943308,0.0005429904],"about_ca_topic_score_codex":0.0000026635896,"about_ca_topic_score_gemma":0.0000015591228,"teacher_disagreement_score":0.94164944,"about_ca_system_score_codex":0.0000353499,"about_ca_system_score_gemma":0.00005184674,"threshold_uncertainty_score":0.9474309},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012502239,0.026276287,0.9545415,0.0009432878,0.005042146,0.00019646979,0.0000015038237,0.000070740025,0.00042581864],"genre_scores_gemma":[0.9961845,0.0002672753,0.00008089072,0.000043368746,0.00041812568,0.000007755482,2.7117244e-7,0.000016108059,0.0029816926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985823,0.00009259382,0.00039047957,0.00014718082,0.00028038607,0.0005070794],"domain_scores_gemma":[0.9988054,0.00038295364,0.00017840989,0.00032512544,0.00024176812,0.00006635682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026777575,0.0001321906,0.00020574842,0.00009706358,0.00019025698,0.0007808785,0.0013676772,0.000059375718,0.0000029656776],"category_scores_gemma":[0.000059938986,0.00008019397,0.00019948473,0.0004133368,0.000049866023,0.00048631857,0.000080199294,0.000521834,0.000007059727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016962864,0.000028899547,0.0000031438803,0.000040858267,0.00007849882,0.0000071171803,0.00017770095,0.000083372994,0.00026162987,0.9969463,0.0006338145,0.0017217413],"study_design_scores_gemma":[0.0004706767,0.0006381042,0.000005398443,0.000038569124,0.000030069084,0.00047383647,0.000023813189,0.10158283,0.00096009596,0.8120641,0.08358661,0.00012588325],"about_ca_topic_score_codex":0.0000022841634,"about_ca_topic_score_gemma":2.3756948e-7,"teacher_disagreement_score":0.9836823,"about_ca_system_score_codex":0.00024340098,"about_ca_system_score_gemma":0.0005996994,"threshold_uncertainty_score":0.75300294},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.1822684e-7,0.014158446,0.21927449,0.000052774853,0.0012127555,0.000097984994,0.000009806407,0.00075076113,0.76444274],"genre_scores_gemma":[0.000015956957,0.0003034528,0.030994272,0.000034584937,0.000493964,0.000006053493,0.0000013357047,0.000106388965,0.968044],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932736,0.00002278464,0.00010207209,0.0003186013,0.000102532365,0.00012664792],"domain_scores_gemma":[0.99956,0.000016543088,0.000041293933,0.00032433824,0.000005056125,0.00005274651],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012812448,0.00013937037,0.00015910798,0.00016187859,0.000014168441,0.00023036508,0.00035998112,0.0001044535,0.0003217434],"category_scores_gemma":[0.000002659939,0.00010627971,0.000025532987,0.00012650895,0.000013699238,0.000050578292,0.00030271924,0.00010388975,0.0012643334],"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":[2.222422e-7,0.0000038910366,2.7679002e-7,0.0007003421,0.0000279342,0.000063209714,0.000027943232,0.0000013187391,0.0000036763456,0.24513802,0.7495692,0.004464005],"study_design_scores_gemma":[0.000032188676,0.000009761371,9.0193915e-8,0.00025954802,0.000006740218,0.00004693028,0.0000048409297,0.014888645,0.0000068303616,0.00092983164,0.98366284,0.00015175111],"about_ca_topic_score_codex":0.00008511997,"about_ca_topic_score_gemma":0.0000020676525,"teacher_disagreement_score":0.24420819,"about_ca_system_score_codex":0.000005616431,"about_ca_system_score_gemma":0.0000117507,"threshold_uncertainty_score":0.99951327},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000571121,0.0003789841,0.9968113,0.0012350829,0.00016274367,0.0002936049,0.00002576204,0.0003822116,0.00013919071],"genre_scores_gemma":[0.98882055,0.000009844203,0.009494684,0.000115686096,0.000051851188,0.00026944402,0.000039081166,0.00002019145,0.0011786547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982035,0.00010665913,0.00030349524,0.00061231595,0.0003022565,0.0004717692],"domain_scores_gemma":[0.99901044,0.00038726634,0.000069252645,0.00036220974,0.000055928856,0.00011488732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032367941,0.00021853796,0.0003246468,0.00057630823,0.00035946842,0.00035949136,0.0003076613,0.00006408033,0.00022521421],"category_scores_gemma":[0.0000043746136,0.0001800348,0.00040771955,0.0022955404,0.00004280176,0.0003292147,0.0000020880618,0.00024958214,0.000031932454],"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.00006852993,0.00022007005,0.0000038070584,0.000078270525,0.0031152652,0.000010469854,0.00026356135,0.93465644,0.00019205872,0.03737768,0.000120267614,0.023893602],"study_design_scores_gemma":[0.0003399755,0.0004594613,0.0000031403956,0.00003655408,0.0011393031,0.0000101108335,0.000054848857,0.9907169,0.0021963147,0.0015269682,0.0032464738,0.00026998617],"about_ca_topic_score_codex":0.000037740316,"about_ca_topic_score_gemma":0.00001946947,"teacher_disagreement_score":0.9882494,"about_ca_system_score_codex":0.00032194436,"about_ca_system_score_gemma":0.00022527597,"threshold_uncertainty_score":0.7341606},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87381583,0.00044910095,0.093105644,0.0034443655,0.0007531325,0.00019455166,0.000004542125,0.001917776,0.026315037],"genre_scores_gemma":[0.9864195,0.0001265093,0.0057290494,0.0003419635,0.00008285249,0.0000060734556,7.158875e-7,0.0000053395183,0.0072880103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943864,0.000030034784,0.00009510246,0.00018945319,0.00008961878,0.00015716378],"domain_scores_gemma":[0.99960697,0.00008600629,0.00002074327,0.00021462639,0.000013549248,0.000058126607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026926564,0.000063137595,0.00008132887,0.00009697485,0.000062273655,0.00013220537,0.00036645614,0.000012680333,0.000034397126],"category_scores_gemma":[0.000014564286,0.00004944646,0.000024783893,0.00026609804,0.000018770594,0.0002068251,0.00032616899,0.000040852967,0.00047820632],"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.000003381782,0.000035611774,0.0003846169,0.000068689835,0.000031169504,0.00013790636,0.00074375456,0.000031746495,0.0007217728,0.78896224,0.02758698,0.18129212],"study_design_scores_gemma":[0.0009768079,0.00027110602,0.006665557,0.00008763888,0.000020608968,0.00051848445,0.0002389782,0.484933,0.037245102,0.37359926,0.09442065,0.001022819],"about_ca_topic_score_codex":0.000007207932,"about_ca_topic_score_gemma":3.601908e-7,"teacher_disagreement_score":0.48490125,"about_ca_system_score_codex":0.0000027938333,"about_ca_system_score_gemma":0.000007296171,"threshold_uncertainty_score":0.6146534},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012305569,0.002034138,0.040194903,0.00023754028,0.0008570807,0.0004396474,0.000024767329,0.0005644437,0.9556352],"genre_scores_gemma":[0.0011860015,0.00009074653,0.02537001,0.00009183109,0.0002808507,0.000007466188,0.000008138092,0.00012253686,0.9728424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974865,0.000021881111,0.00083653716,0.0006508738,0.0005443292,0.00045988837],"domain_scores_gemma":[0.9975368,0.00039707235,0.00028336645,0.001562192,0.00005553749,0.00016504122],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00065447704,0.0006365133,0.0008420926,0.00055549346,0.00008288432,0.00041566053,0.0019848438,0.00038659511,0.00053602416],"category_scores_gemma":[0.000029409777,0.0005691819,0.0003331694,0.00010228367,0.00012644392,0.00018887049,0.0005431493,0.000979025,0.005044493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013185894,0.00003364532,3.267001e-7,0.00052886613,0.00005190777,0.00023926966,0.00073875656,0.000020424352,0.0000071619097,0.9924513,0.0034546508,0.0024723718],"study_design_scores_gemma":[0.00013199936,0.00004020436,6.4779624e-7,0.0011486752,0.0000350494,0.00011563551,0.000013131054,0.0196773,0.0000463231,0.8858853,0.0923544,0.00055132905],"about_ca_topic_score_codex":0.0000018262174,"about_ca_topic_score_gemma":0.0000027769433,"teacher_disagreement_score":0.106566,"about_ca_system_score_codex":0.00015811746,"about_ca_system_score_gemma":0.00012899571,"threshold_uncertainty_score":0.999676},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007400028,0.0012046772,0.06506528,0.00013706366,0.0007372955,0.00031401284,0.0000144467285,0.00037579166,0.93214405],"genre_scores_gemma":[0.0024800205,0.00006965612,0.013668044,0.000077085446,0.00021678179,0.0000055528753,0.000007921777,0.00007393618,0.983401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824756,0.000016134747,0.0005905185,0.0004599751,0.00037639643,0.00030940693],"domain_scores_gemma":[0.9983573,0.0002543665,0.0002103323,0.0010264703,0.000048762544,0.00010274779],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005116964,0.0004228581,0.00056660024,0.00037796667,0.00006334726,0.00023047464,0.0011511315,0.00028865045,0.00026032704],"category_scores_gemma":[0.000022634633,0.00038392193,0.00020797587,0.000064453976,0.00010822635,0.00014642223,0.00030191318,0.00068300974,0.0029627427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.1661605e-7,0.000023042168,2.9072703e-7,0.00034590985,0.000030202931,0.00009175003,0.00055916904,0.000018423436,0.000007482698,0.9944579,0.0021778964,0.0022869934],"study_design_scores_gemma":[0.00010460663,0.00003185507,9.877476e-7,0.0009863033,0.000019933974,0.00006405008,0.000009646534,0.036882505,0.000036637502,0.8873639,0.07412558,0.0003739993],"about_ca_topic_score_codex":0.0000015845692,"about_ca_topic_score_gemma":0.00000268461,"teacher_disagreement_score":0.10709403,"about_ca_system_score_codex":0.00016160535,"about_ca_system_score_gemma":0.00009685299,"threshold_uncertainty_score":0.99986124},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061503287,0.0024317196,0.9171978,0.015362478,0.0005615601,0.00011355268,0.00009154026,0.000037478796,0.0027005763],"genre_scores_gemma":[0.99493676,0.0004105483,0.003815083,0.00010322701,0.00037024939,0.0000033258211,0.000004040921,0.0000025236216,0.00035424344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991585,0.00002528806,0.00034824785,0.00013098381,0.0002863282,0.00005066569],"domain_scores_gemma":[0.9992871,0.00015732081,0.00016209537,0.00013684291,0.00020693395,0.00004967683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036286996,0.000058124933,0.0001361776,0.00048963685,0.000032939086,0.00018569174,0.00050096534,0.000020676716,0.000011438094],"category_scores_gemma":[0.000019469946,0.000042691565,0.00016181527,0.0005127207,0.000032450327,0.0002861936,0.000054730066,0.00008567442,0.0000066909497],"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.000018681914,0.00010466133,0.00012382386,0.0000059067756,0.0012665326,0.000014184819,0.00025576403,0.0016222352,0.0008455228,0.9368718,0.00054333406,0.058327515],"study_design_scores_gemma":[0.0018783348,0.0006712913,0.006486135,0.0003963678,0.0015445371,0.00025269683,0.00040259116,0.22982083,0.042249326,0.28466928,0.4308934,0.0007351976],"about_ca_topic_score_codex":0.000011217494,"about_ca_topic_score_gemma":0.0000020049529,"teacher_disagreement_score":0.9334335,"about_ca_system_score_codex":0.000016018237,"about_ca_system_score_gemma":0.000036529244,"threshold_uncertainty_score":0.17906296},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.826193e-8,8.847302e-7,0.02067684,0.000024246516,0.0013790206,0.00016800659,0.97714573,0.00018691852,0.00041828322],"genre_scores_gemma":[5.052147e-7,0.00016599728,0.0067425105,0.0015430639,0.0005200444,0.000014562888,0.9905409,0.000013195611,0.0004592137],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979275,0.00013730676,0.00031035236,0.00079728104,0.00042768478,0.00039986402],"domain_scores_gemma":[0.9970791,0.00009756796,0.00019368697,0.0023153475,0.00004408347,0.00027026382],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00030438756,0.00035106606,0.00038927118,0.00012761065,0.00014624847,0.00038652416,0.003803952,0.00021745809,0.015768984],"category_scores_gemma":[0.0001588298,0.00033770181,0.00013176735,0.0003875341,0.00006320241,0.00072685204,0.0020572825,0.00054375327,0.61560905],"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.000006901133,0.000036455975,7.7639285e-8,0.00008727162,0.00003453901,0.0003635943,0.00001561906,0.0000034388465,0.0000042016068,0.0033232868,0.9949992,0.0011254353],"study_design_scores_gemma":[0.00022674871,0.000047357047,6.409486e-7,0.00003782335,0.000034673067,0.000033729426,0.0000065204395,0.0007146824,0.00003364329,0.00065330154,0.99781346,0.0003973889],"about_ca_topic_score_codex":0.00005794788,"about_ca_topic_score_gemma":0.0000064057094,"teacher_disagreement_score":0.59984004,"about_ca_system_score_codex":0.00003771087,"about_ca_system_score_gemma":0.00017348006,"threshold_uncertainty_score":0.9999075},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000713982,0.000004178376,0.017365748,0.00001920002,0.007513304,0.0006800459,0.97191495,0.00013707351,0.0023583693],"genre_scores_gemma":[0.000017882227,0.0006630938,0.004533335,0.0013019363,0.0011612027,0.000024633031,0.97347337,0.00005477843,0.01876977],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99437606,0.00049071177,0.00085953955,0.0019722043,0.0010563959,0.0012450833],"domain_scores_gemma":[0.9915685,0.00038464103,0.00062181184,0.0067645176,0.00017579504,0.00048470745],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001382983,0.00095817173,0.0010357655,0.0003968491,0.00040362196,0.0011471108,0.0065933857,0.00066236197,0.17746146],"category_scores_gemma":[0.00027621406,0.0009599771,0.00037036705,0.00078121107,0.00023485153,0.0018464073,0.004484318,0.0012792471,0.9249262],"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.00005138424,0.00022277822,0.000002985999,0.00044100577,0.00014761364,0.000467792,0.00008187744,0.00007166364,0.00001957173,0.0068158247,0.98933613,0.0023413866],"study_design_scores_gemma":[0.0008943118,0.00018754674,0.000008029062,0.00031538404,0.00017767504,0.00012246234,0.00005771734,0.007081827,0.00006335244,0.00042132568,0.9895266,0.0011437493],"about_ca_topic_score_codex":0.0001697399,"about_ca_topic_score_gemma":0.000010637149,"teacher_disagreement_score":0.7474648,"about_ca_system_score_codex":0.00014706134,"about_ca_system_score_gemma":0.00057065795,"threshold_uncertainty_score":0.9998898},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007740215,0.000004152127,0.017661568,0.000017793784,0.0074653295,0.00069062435,0.9715054,0.0001351535,0.0025122499],"genre_scores_gemma":[0.000019745738,0.00067198783,0.0045185057,0.0012943846,0.0011960829,0.00002441573,0.9732994,0.000055290464,0.018920183],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99431574,0.0004935923,0.0008715871,0.001979608,0.0010673426,0.0012721233],"domain_scores_gemma":[0.9914051,0.00038464714,0.0006435973,0.006889626,0.000180887,0.00049613544],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014003543,0.00097493397,0.0010474568,0.00040504592,0.0004102012,0.0011494606,0.006693102,0.00068319234,0.17633773],"category_scores_gemma":[0.00026529547,0.0009743036,0.00037236026,0.0007716349,0.00024362511,0.001913976,0.0043525514,0.0012817186,0.928599],"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.000051282503,0.00023211543,0.0000030864464,0.00042686277,0.0001450861,0.00045796632,0.00008927865,0.00007091623,0.000019843388,0.0066927467,0.98955595,0.0022548528],"study_design_scores_gemma":[0.00091534003,0.00018737765,0.000007638132,0.00031258826,0.00017727792,0.00012946855,0.00006163976,0.006550785,0.00006356271,0.0004059244,0.9900205,0.0011679055],"about_ca_topic_score_codex":0.00017052668,"about_ca_topic_score_gemma":0.000010549006,"teacher_disagreement_score":0.7522613,"about_ca_system_score_codex":0.00014791726,"about_ca_system_score_gemma":0.0005735301,"threshold_uncertainty_score":0.99988747},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016323903,0.00077508244,0.9923805,0.001279181,0.0020541458,0.00020003975,0.000037081954,0.00039712325,0.0012444756],"genre_scores_gemma":[0.85332954,0.00005327697,0.13618721,0.0018106608,0.0011255967,0.00018706183,0.000018043203,0.00004626132,0.0072423294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917024,0.000042996293,0.00015063137,0.0003103765,0.000099946636,0.00022578755],"domain_scores_gemma":[0.9992506,0.0003359971,0.0000175043,0.0002907246,0.000041982476,0.00006321417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004716291,0.000102941405,0.00013518587,0.000057197656,0.0001072741,0.00041247316,0.00044436418,0.00004005638,0.00008017867],"category_scores_gemma":[0.00006828245,0.00008135307,0.00006890536,0.00020554094,0.000023314202,0.00030733697,0.000082278406,0.00006579402,0.00013367413],"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.0000040995283,0.000022977865,0.0000017538771,0.000049894003,0.00001613446,0.000040472223,0.00011642632,0.000013025028,0.0007581413,0.9787406,0.011239484,0.008997037],"study_design_scores_gemma":[0.00018218372,0.00012246375,0.000004747799,0.00006225781,0.000010279613,0.00003410958,0.000025113733,0.5060954,0.0030287006,0.11852383,0.37174216,0.00016875844],"about_ca_topic_score_codex":0.000010568898,"about_ca_topic_score_gemma":4.747954e-7,"teacher_disagreement_score":0.86021674,"about_ca_system_score_codex":0.000012551815,"about_ca_system_score_gemma":0.000099875295,"threshold_uncertainty_score":0.39774883},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003364511,0.0066322074,0.98617023,0.0014907648,0.00012169565,0.00023075653,0.000012106769,0.00039183313,0.0015858732],"genre_scores_gemma":[0.8863549,0.0012728154,0.10033207,0.0008792815,0.0012566076,0.0005569869,0.00003821526,0.000040242452,0.009268887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993917,0.000017505334,0.00011996783,0.0002666513,0.00008203884,0.00012214997],"domain_scores_gemma":[0.9995683,0.00009318828,0.000017913988,0.00022095886,0.000025315372,0.000074354655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010656699,0.00008158204,0.000075261734,0.00007373322,0.00014890614,0.00017463302,0.00028571818,0.00003402417,0.000036572066],"category_scores_gemma":[0.0000061498126,0.00006856488,0.000031018775,0.00042266364,0.000021511629,0.00020166571,0.000095311494,0.00007754217,0.00031603052],"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":[4.353357e-7,0.000010446756,5.04787e-7,0.000029422545,0.000007527186,0.0000016853401,0.000083718434,0.000012484924,0.0004814459,0.97832316,0.00022352514,0.020825634],"study_design_scores_gemma":[0.000121471356,0.00002775476,0.000018785684,0.000020735042,0.000021297661,0.000041678297,0.000011364555,0.5078424,0.0012832341,0.16796315,0.32244182,0.00020631503],"about_ca_topic_score_codex":0.000002080932,"about_ca_topic_score_gemma":2.872948e-7,"teacher_disagreement_score":0.8858382,"about_ca_system_score_codex":0.000005795577,"about_ca_system_score_gemma":0.00002779345,"threshold_uncertainty_score":0.40620387},"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":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000033629385,0.00016683916,0.08531226,0.00030423253,0.004048523,0.00022108067,0.90846586,0.00029063257,0.001187235],"genre_scores_gemma":[0.000004305737,0.00014760437,0.028138973,0.00053137756,0.0010713541,0.000033453358,0.9642496,0.000017750303,0.005805541],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978454,0.000110967565,0.00038123433,0.0007539225,0.00044135976,0.00046708502],"domain_scores_gemma":[0.9971228,0.00012396237,0.00019935763,0.0022940184,0.000060026883,0.00019978112],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00049496244,0.0003894508,0.00039213613,0.00023843431,0.00016699893,0.0004480447,0.003737299,0.0005363139,0.0056175194],"category_scores_gemma":[0.000044713946,0.00032459275,0.00018938242,0.00027207113,0.00008124356,0.0003918469,0.0011405683,0.00087304146,0.0050642597],"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.000002361935,0.00006353558,7.494757e-8,0.00004084434,0.000016406078,0.00007445736,0.000008304743,6.8574855e-7,0.000040683884,0.0091363955,0.98877347,0.0018428088],"study_design_scores_gemma":[0.00016612081,0.000041747597,5.961087e-7,0.000016672293,0.000016499707,0.00006312629,0.000004268616,0.00027094432,0.0003604238,0.004271888,0.99434644,0.00044128916],"about_ca_topic_score_codex":0.00019291553,"about_ca_topic_score_gemma":0.00006078629,"teacher_disagreement_score":0.057173286,"about_ca_system_score_codex":0.000012937652,"about_ca_system_score_gemma":0.0001224002,"threshold_uncertainty_score":0.9999206},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043589773,0.00033613376,0.03739598,0.0241978,0.005249828,0.006849919,0.00025900264,0.00030950282,0.9249659],"genre_scores_gemma":[0.046166074,0.00515177,0.06512369,0.00021421912,0.0005138038,0.0041794754,0.00037830594,0.000111031746,0.8781616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98341817,0.000265208,0.001703783,0.003495529,0.008898631,0.0022186697],"domain_scores_gemma":[0.9938131,0.0003081394,0.000109707245,0.0019901257,0.0033527992,0.00042614897],"candidate_categories":["metaepi_narrow","bibliometrics","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["sts","insufficient_payload"],"category_scores_codex":[0.021827614,0.00073503266,0.0005498653,0.013920016,0.0038929125,0.01056744,0.012908481,0.00023912141,0.001022008],"category_scores_gemma":[0.0005442224,0.0007525871,0.00023292814,0.0061195055,0.0055350857,0.012170589,0.0068985308,0.0016788995,0.00085396547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000989611,0.00033627576,0.000012104117,0.00018527168,0.00011838921,0.00018372791,0.00071173464,0.0848132,0.00040981974,0.907612,0.0018125135,0.003705963],"study_design_scores_gemma":[0.0009138871,0.00035532532,0.00013485693,0.0012300983,0.000017435426,0.000054460223,0.0012217128,0.3500588,0.00049167656,0.2998671,0.34469494,0.0009596877],"about_ca_topic_score_codex":0.00043745743,"about_ca_topic_score_gemma":0.0028131576,"teacher_disagreement_score":0.60774493,"about_ca_system_score_codex":0.004648728,"about_ca_system_score_gemma":0.00091422966,"threshold_uncertainty_score":0.999924},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22855814,0.00010268044,0.76460356,0.0003734837,0.0013560739,0.0006137572,0.0001799546,0.00029645924,0.003915887],"genre_scores_gemma":[0.93848914,0.00005973559,0.055547018,0.0000082613205,0.00007570051,0.0000012796827,0.000057765763,0.00002514459,0.0057359384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977371,0.0001747592,0.000357377,0.0008950777,0.0005390703,0.00029659987],"domain_scores_gemma":[0.99759483,0.00012164661,0.000630706,0.0012237171,0.0002867511,0.00014235437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060103735,0.00035240207,0.00067293027,0.0004676057,0.00013884103,0.00007381871,0.00213871,0.00043006256,0.0005126695],"category_scores_gemma":[0.000048704376,0.00040257128,0.00044895537,0.0005361534,0.00027571985,0.00027678252,0.004842055,0.0007538627,0.00027054545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045075352,0.0008634289,0.002886572,0.005768195,0.0019790872,0.00034430524,0.11760073,0.0035149965,0.010151172,0.81084466,0.0008321756,0.044763934],"study_design_scores_gemma":[0.002318717,0.00020941373,0.0049060974,0.0019101693,0.00034563866,0.00001764767,0.005836651,0.087578855,0.023193026,0.8691219,0.0026614284,0.0019004211],"about_ca_topic_score_codex":0.00045208592,"about_ca_topic_score_gemma":0.000018481644,"teacher_disagreement_score":0.709931,"about_ca_system_score_codex":0.0001142986,"about_ca_system_score_gemma":0.00029611844,"threshold_uncertainty_score":0.99984264},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006478755,0.00024198068,0.98433244,0.00065374735,0.0000864523,0.0007853716,0.000013712336,0.00026878662,0.0071387556],"genre_scores_gemma":[0.792523,0.000015147624,0.20575899,0.0003740686,0.000263166,0.0007374671,0.0000049158166,0.000034760076,0.00028844952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894136,0.000015396128,0.0002317829,0.0003819152,0.00020149522,0.00022805584],"domain_scores_gemma":[0.99871045,0.00033364273,0.000041176565,0.00079150853,0.00002266393,0.000100566234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000634141,0.00015054809,0.00014689805,0.000043566735,0.00024069594,0.0005937216,0.00061796955,0.00004156257,0.000014167295],"category_scores_gemma":[0.000021694394,0.000098170865,0.00004471046,0.00036152493,0.0000851422,0.00013317664,0.0004151449,0.00015472269,0.00008941886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.052632e-7,0.0000150060105,6.680721e-7,0.0002276903,0.000011548659,9.880631e-7,0.0029297273,0.0000068865093,0.0034097654,0.9578424,0.00007420062,0.03548028],"study_design_scores_gemma":[0.00013181292,0.000036011425,0.000023799501,0.00005186226,0.000055149405,0.000029873161,0.0016494795,0.112693705,0.011615349,0.8557446,0.017504266,0.00046406817],"about_ca_topic_score_codex":0.000005106697,"about_ca_topic_score_gemma":0.0000028264726,"teacher_disagreement_score":0.7860443,"about_ca_system_score_codex":0.00002582898,"about_ca_system_score_gemma":0.000041158975,"threshold_uncertainty_score":0.57252705},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5123935,0.0028211195,0.47079748,0.0083657475,0.000119330696,0.001457754,0.00009347192,0.00035321884,0.0035984078],"genre_scores_gemma":[0.9966497,0.000029833596,0.0028673476,0.00017119656,0.000055585937,0.0000456576,0.0000030159624,0.0000050790586,0.00017259455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994292,0.000020813002,0.00011622617,0.00023667044,0.00010992059,0.00008711503],"domain_scores_gemma":[0.9993416,0.00018874045,0.000031917858,0.00036174525,0.000037642683,0.000038371916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013981487,0.00007754225,0.00007723734,0.000038565155,0.00011008728,0.00007612218,0.0003050697,0.000029095527,0.000048445516],"category_scores_gemma":[0.000005886253,0.000041559775,0.000023558543,0.0004246702,0.00004815768,0.00013296335,0.00007190098,0.00011159261,0.00002197848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060644766,0.00001803738,0.0000064559526,0.000047806803,0.000012409454,3.843307e-7,0.00025100264,0.000021691405,0.0003884877,0.9948144,0.000111456764,0.004321796],"study_design_scores_gemma":[0.00043375578,0.0002571877,0.0003208711,0.00011938316,0.00005045199,0.00003859805,0.00011854527,0.2125622,0.054029956,0.7072211,0.024507092,0.00034084264],"about_ca_topic_score_codex":0.0000050873978,"about_ca_topic_score_gemma":0.0000028514098,"teacher_disagreement_score":0.48425624,"about_ca_system_score_codex":0.000004979801,"about_ca_system_score_gemma":0.000032318596,"threshold_uncertainty_score":0.16947584},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8757243,0.0013981522,0.10309561,0.012429492,0.0048952997,0.0007314656,0.000011261711,0.00026298052,0.0014513916],"genre_scores_gemma":[0.9956056,0.0000063874586,0.0019980953,0.00018581952,0.00041656522,0.000002582245,0.0000021421067,0.00001631256,0.0017665019],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970975,0.0003368187,0.00040810328,0.00077074283,0.0009074171,0.00047945292],"domain_scores_gemma":[0.9986643,0.0003375385,0.00014620172,0.00051048846,0.0001596713,0.00018176401],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0045408397,0.00025360106,0.00021274746,0.00026830105,0.0015337232,0.0043863175,0.000792707,0.00002707133,0.000029933146],"category_scores_gemma":[0.000078251665,0.00011592962,0.00008134552,0.0010150528,0.0002150283,0.00020947542,0.00015280691,0.00053839094,0.00007119299],"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.00017173818,0.0007617361,0.00027749504,0.00021051259,0.00030588222,0.00059768016,0.014007468,0.16781335,0.0067380155,0.11593573,0.07269919,0.6204812],"study_design_scores_gemma":[0.00075530785,0.00060994236,0.00031850237,0.00067160797,0.000025859837,0.0004910601,0.00045591182,0.8961175,0.0072260215,0.00064208754,0.092166826,0.00051935896],"about_ca_topic_score_codex":0.0000024089659,"about_ca_topic_score_gemma":0.0000015012799,"teacher_disagreement_score":0.72830415,"about_ca_system_score_codex":0.00009096771,"about_ca_system_score_gemma":0.00016119414,"threshold_uncertainty_score":0.9997662},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002002903,0.00041427388,0.9923757,0.0021339164,0.00072885293,0.00007370738,0.00001256195,0.0001410573,0.003919668],"genre_scores_gemma":[0.9857301,0.00010198593,0.007146854,0.00005635177,0.00005842945,0.00003556802,8.617543e-7,0.000007773781,0.0068620504],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995358,0.000032031832,0.00010433663,0.0001146822,0.00010006421,0.00011306766],"domain_scores_gemma":[0.99948573,0.00019424265,0.00001124256,0.00026065417,0.000017485543,0.00003062227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018428049,0.00004854554,0.000050279876,0.000035339803,0.00018797924,0.00012005413,0.0003443514,0.000018936216,0.00011085627],"category_scores_gemma":[0.0000028861339,0.000033047138,0.000072637275,0.00028347527,0.000056223234,0.00015708589,0.0000068618133,0.00010160072,0.0000923371],"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.0000028825418,0.00003602795,0.0000014040936,0.000028794231,0.000042225263,0.000006788355,0.0006134722,0.0005799651,0.00066093955,0.3865729,0.0008463519,0.6106083],"study_design_scores_gemma":[0.00014749911,0.000051321644,0.00011465844,0.00004015162,0.000027184895,0.00003941987,0.00014520712,0.20321566,0.015960887,0.078944616,0.7011403,0.00017309506],"about_ca_topic_score_codex":0.000015767704,"about_ca_topic_score_gemma":0.000008991172,"teacher_disagreement_score":0.98552984,"about_ca_system_score_codex":0.000008754703,"about_ca_system_score_gemma":0.000035094963,"threshold_uncertainty_score":0.14458033},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018139752,0.00025949962,0.9792422,0.0008417608,0.00029589894,0.00029753233,0.00020739314,0.000114387134,0.00060156087],"genre_scores_gemma":[0.73333865,0.0000051759253,0.26622662,0.000017161236,0.00007849224,0.000020598765,0.00015456775,0.000013619488,0.00014510143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980258,0.00008374563,0.00084002374,0.00029878813,0.0005972503,0.00015440429],"domain_scores_gemma":[0.99711543,0.0016890577,0.0002779494,0.00029247382,0.0005343847,0.00009068029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048517674,0.00018928063,0.0002912617,0.00047067567,0.00022507255,0.0001591719,0.00036575497,0.000084822546,0.00012319782],"category_scores_gemma":[0.00020127407,0.00018371273,0.00012838401,0.00071267283,0.00020535043,0.0006359878,0.00012833938,0.00012890995,0.000030417832],"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.0000069453286,0.00023213247,0.000036527348,0.00023078134,0.00012978104,0.0000011011755,0.00089163386,0.0537846,0.0022703183,0.93969136,0.0005401388,0.002184687],"study_design_scores_gemma":[0.00031206603,0.00006327631,0.0006140198,0.000118384065,0.00005016527,0.00005135937,0.00003181293,0.76126575,0.0007837609,0.23590459,0.0005995215,0.00020527543],"about_ca_topic_score_codex":0.0000052862492,"about_ca_topic_score_gemma":0.0000021218173,"teacher_disagreement_score":0.71519893,"about_ca_system_score_codex":0.000035377554,"about_ca_system_score_gemma":0.0005522037,"threshold_uncertainty_score":0.7491588},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38017902,0.0138981715,0.31445205,0.17295144,0.013449999,0.0008416178,0.000112769296,0.0001235501,0.103991374],"genre_scores_gemma":[0.974776,0.00004926379,0.012664953,0.0036735618,0.0018267209,0.000001986433,4.5200818e-7,0.00003217119,0.006974881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859667,0.000080156555,0.00073252484,0.00017889882,0.00006460423,0.00034715972],"domain_scores_gemma":[0.99847925,0.0005329843,0.0002600098,0.00046978611,0.00004868511,0.00020929218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000735796,0.00014204049,0.00029031237,0.00010548737,0.00008745889,0.00023607926,0.0014374945,0.000071630224,0.00020943953],"category_scores_gemma":[0.00003769945,0.000083012535,0.00043278615,0.00011851022,0.00016685344,0.000419447,0.0004455411,0.00035260385,0.00014422678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069464936,0.000013474748,0.00006238319,0.000031497315,0.00007541367,0.000007763962,0.00009166169,0.000031584008,0.00014548196,0.9894796,0.006309936,0.003744267],"study_design_scores_gemma":[0.00048980175,0.00011927777,0.00022594813,0.00010956811,0.00008074937,0.0017914532,0.00014268736,0.0064591994,0.023844847,0.6405308,0.32596102,0.00024462427],"about_ca_topic_score_codex":0.0000143486195,"about_ca_topic_score_gemma":0.000003604248,"teacher_disagreement_score":0.594597,"about_ca_system_score_codex":0.00028005146,"about_ca_system_score_gemma":0.0006191248,"threshold_uncertainty_score":0.33851528},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08561779,0.00006388408,0.9111883,0.00014610364,0.00029079785,0.00025682073,0.000017994598,0.000094443596,0.0023238545],"genre_scores_gemma":[0.9893769,0.000008921962,0.009014854,0.000025797855,0.000014569789,0.000012068813,0.000015562064,0.000007272251,0.0015240593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989052,0.00009791232,0.0003317547,0.00029295468,0.00023483203,0.0001373709],"domain_scores_gemma":[0.999275,0.00025932438,0.000096274955,0.00021728757,0.00011314256,0.000038920203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002184561,0.00012579991,0.00019634404,0.00020532735,0.000025197194,0.000049906543,0.00026762483,0.00005462586,0.00032012365],"category_scores_gemma":[0.000029992374,0.00009166524,0.000042502004,0.0008038544,0.00007761273,0.00051114615,0.000051859086,0.00011188785,0.000026437416],"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.00011419284,0.00014397217,0.00028843302,0.00020995455,0.000038554146,0.000021140448,0.0018587906,0.005909876,0.0025024365,0.98647624,0.0002916715,0.0021447085],"study_design_scores_gemma":[0.00074974564,0.000870704,0.00086651917,0.0007757937,0.000015815933,0.000014868287,0.00017962001,0.8650533,0.101698294,0.029403402,0.00007147987,0.00030047927],"about_ca_topic_score_codex":0.000025668875,"about_ca_topic_score_gemma":0.00002276156,"teacher_disagreement_score":0.95707285,"about_ca_system_score_codex":0.000025061745,"about_ca_system_score_gemma":0.00010708647,"threshold_uncertainty_score":0.3738},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003127985,0.00019262401,0.9947956,0.00020223498,0.000312402,0.00015562974,0.0000026681619,0.000103346065,0.0011074939],"genre_scores_gemma":[0.28289458,0.000008377488,0.7169126,0.000033122746,0.00007925048,0.000024324989,5.018401e-7,0.0000036317497,0.000043573047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986335,0.000018533998,0.0003276317,0.0003484367,0.00048234983,0.00018956879],"domain_scores_gemma":[0.999055,0.0003121233,0.00006235429,0.00043512016,0.00008330919,0.000052080915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013148539,0.000089690235,0.00012556283,0.00042020122,0.000085813546,0.00029804456,0.0014625873,0.000024153422,0.000017505605],"category_scores_gemma":[0.000016062977,0.000076035845,0.000042457377,0.0022389535,0.00021999297,0.0006551265,0.0004021625,0.00009808288,0.000051514737],"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":[1.7261183e-7,0.00006144976,0.000016679509,0.000106331485,0.0000020813386,0.000004595986,0.0006554561,0.0005507092,0.0001896141,0.914088,0.000028353174,0.084296525],"study_design_scores_gemma":[0.000032992844,0.000014626027,0.000053426582,0.00006602638,0.0000011741741,0.00002723719,0.0000051669813,0.72422445,0.0009078809,0.27414632,0.00044769206,0.00007301005],"about_ca_topic_score_codex":0.0000010120029,"about_ca_topic_score_gemma":7.005884e-7,"teacher_disagreement_score":0.72367376,"about_ca_system_score_codex":0.00003042678,"about_ca_system_score_gemma":0.00022394204,"threshold_uncertainty_score":0.31006518},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013893522,0.00013566104,0.9792098,0.00007581227,0.00047469436,0.00023966038,0.00003929365,0.00045831426,0.0054732338],"genre_scores_gemma":[0.9324547,0.000002956461,0.065410785,0.00005491452,0.000081976505,0.000027666765,0.00003174447,0.0000122577185,0.0019229843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798214,0.00023582308,0.00043098204,0.0007082815,0.00035132514,0.0002914217],"domain_scores_gemma":[0.99864376,0.00016367601,0.000056243607,0.000810805,0.000111699555,0.00021383986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091816246,0.00019487481,0.00043293773,0.0005979123,0.00005413897,0.0003501608,0.0010357315,0.00006914202,0.00016071912],"category_scores_gemma":[0.000027941995,0.0001499721,0.00017949314,0.0032891473,0.00004952314,0.00067027507,0.00023815827,0.00011134749,0.00012387121],"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.000019978583,0.0003187014,0.000089147106,0.00022316199,0.0017779099,0.00004022419,0.005038584,0.020456385,0.010087254,0.9446271,0.0007202157,0.016601335],"study_design_scores_gemma":[0.000056185145,0.0001220297,0.00012345305,0.000024631794,0.00015180086,0.000011838033,0.00018928145,0.9963905,0.0020091464,0.00030558833,0.00039002972,0.00022551199],"about_ca_topic_score_codex":0.00011595787,"about_ca_topic_score_gemma":0.0000016867643,"teacher_disagreement_score":0.97593415,"about_ca_system_score_codex":0.00003409067,"about_ca_system_score_gemma":0.000055561737,"threshold_uncertainty_score":0.61156845},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004456103,0.0016806182,0.98924637,0.0019243679,0.00007496236,0.00038729276,0.000035074812,0.00018046114,0.0020147527],"genre_scores_gemma":[0.9922909,0.00009560751,0.0064280694,0.00043875835,0.00011321416,0.00013865308,0.000009874969,0.000008385752,0.00047651204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993909,0.000015089047,0.00011564752,0.00027464115,0.00008670651,0.000116990006],"domain_scores_gemma":[0.9995329,0.00017395095,0.000016197686,0.00017889768,0.000019254065,0.00007883373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117987525,0.00008277355,0.00007483197,0.00005526,0.00015399986,0.0001286366,0.00014275317,0.000020649002,0.000037552036],"category_scores_gemma":[0.0000062496606,0.00006863839,0.000015813905,0.00016910837,0.000036357073,0.00009217815,0.00009843043,0.00007955265,0.00009609795],"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":[8.7585596e-7,0.00001723202,4.4161024e-7,0.000019583294,0.000008625559,0.0000011315569,0.00010739275,0.000017012344,0.00013908668,0.9737675,0.00016237827,0.025758723],"study_design_scores_gemma":[0.00026073863,0.0001337165,0.000042370215,0.000068948924,0.00002099292,0.00003562978,0.000046934852,0.5200778,0.00051660114,0.42673028,0.051816534,0.00024939902],"about_ca_topic_score_codex":0.0000011022918,"about_ca_topic_score_gemma":5.030821e-7,"teacher_disagreement_score":0.9878348,"about_ca_system_score_codex":0.0000064799465,"about_ca_system_score_gemma":0.000020014182,"threshold_uncertainty_score":0.2798992},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1021724,0.0016557124,0.8842907,0.00068222266,0.00021770564,0.00022801939,0.00010810196,0.00019395078,0.010451206],"genre_scores_gemma":[0.72152406,0.00026869532,0.2759251,0.000024252517,0.000014746277,0.00001660764,0.00014575111,0.000036073874,0.0020447099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952717,0.0026779938,0.0006209928,0.0007628353,0.00038717143,0.00027930102],"domain_scores_gemma":[0.9942834,0.0018581939,0.0005406036,0.0022914642,0.0008904014,0.00013598547],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00794936,0.00031836022,0.00062067976,0.000627184,0.00018263764,0.0004927352,0.0016676309,0.00023963228,0.000031808184],"category_scores_gemma":[0.00043582727,0.00031290253,0.000318767,0.0011746886,0.00028894338,0.000120044155,0.0037426255,0.0005749336,0.000006242496],"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.0000024857525,0.00019620081,0.00011624713,0.00038554656,0.0005274617,0.0000081708,0.007986391,0.00044984475,0.00016851233,0.9591916,0.00001137713,0.030956138],"study_design_scores_gemma":[0.000085110725,2.2108377e-7,0.0001486168,0.00050638715,0.00047048603,0.000011671474,0.00011632876,0.7688497,0.0017276818,0.2277952,0.00004252655,0.00024609704],"about_ca_topic_score_codex":0.0006656333,"about_ca_topic_score_gemma":0.00056287064,"teacher_disagreement_score":0.76839983,"about_ca_system_score_codex":0.00010776769,"about_ca_system_score_gemma":0.00025786605,"threshold_uncertainty_score":0.9999323},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6077315,0.0025040095,0.38243422,0.0012919387,0.005726444,0.00015893258,0.000019854899,0.000058574875,0.00007448653],"genre_scores_gemma":[0.9341537,0.000004786995,0.06494499,0.000074456024,0.00037761396,7.1894806e-7,0.0000039321985,0.0000084939875,0.00043130585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986849,0.00007122575,0.00039420748,0.0002935777,0.00036249045,0.00019360446],"domain_scores_gemma":[0.9987074,0.0007050375,0.00014803515,0.0001449591,0.00019086368,0.000103710314],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002232871,0.000117956995,0.00017672755,0.00027746163,0.00042936738,0.0010454135,0.0003176274,0.000045975117,0.0000058605538],"category_scores_gemma":[0.00014328923,0.00008645816,0.000109170025,0.0003537697,0.00008035665,0.00050442916,0.00008337564,0.00019965686,0.0000074158274],"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.00006892273,0.0002509166,0.00007701308,0.00024253735,0.00013734821,0.00012452333,0.005088865,0.003559496,0.037421737,0.4212104,0.07568914,0.4561291],"study_design_scores_gemma":[0.0008343905,0.00028039364,0.0001460223,0.0008008862,0.0000227158,0.00024862034,0.00019358583,0.87630004,0.015087916,0.009528463,0.09625294,0.0003040297],"about_ca_topic_score_codex":4.5757656e-7,"about_ca_topic_score_gemma":2.664888e-7,"teacher_disagreement_score":0.87274057,"about_ca_system_score_codex":0.000028354618,"about_ca_system_score_gemma":0.00011215543,"threshold_uncertainty_score":0.9999916},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43455768,0.00022326208,0.5589209,0.0024900709,0.0016877392,0.0012719141,0.000077552824,0.0004975736,0.00027328104],"genre_scores_gemma":[0.9943345,0.0000039770157,0.00381078,0.0006984083,0.00033558704,0.0004860089,0.000071985785,0.00005341304,0.00020529503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965354,0.000607787,0.00060196075,0.00083279837,0.0007299314,0.0006920762],"domain_scores_gemma":[0.997452,0.000656808,0.00038778913,0.0012022085,0.00013355291,0.00016761968],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0018284589,0.00036794547,0.00033506268,0.0002630684,0.0013683065,0.0002859697,0.0015031693,0.0001251974,0.000025909689],"category_scores_gemma":[0.000021829026,0.0003297837,0.00035478946,0.0008882977,0.00007199622,0.0005738769,0.0001611653,0.0004958795,0.00018269093],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005372675,0.00052780047,0.000061056,0.00012555478,0.00007791656,0.000057243713,0.0043779584,0.0024553973,0.20246781,0.1005624,0.009697565,0.67905205],"study_design_scores_gemma":[0.0057306397,0.0064221392,0.0015572612,0.00010781166,0.00015319271,0.00021475389,0.0010640037,0.6370395,0.12202801,0.17990041,0.04374118,0.0020411157],"about_ca_topic_score_codex":0.000008526393,"about_ca_topic_score_gemma":0.000016768185,"teacher_disagreement_score":0.6770109,"about_ca_system_score_codex":0.00018993902,"about_ca_system_score_gemma":0.00020115501,"threshold_uncertainty_score":0.99993175},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005295635,0.0007576014,0.99310434,0.00016248492,0.0002266961,0.00021106905,0.000014007316,0.00019121305,0.000036934387],"genre_scores_gemma":[0.52859384,0.000025033409,0.4710611,0.000005240993,0.00012221845,0.000043580894,0.000006144167,0.000016004298,0.00012681658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904907,0.000009436125,0.00035439216,0.0002486193,0.00014029376,0.00019817382],"domain_scores_gemma":[0.9991822,0.00050584355,0.000031669882,0.00015770886,0.000058898775,0.00006364186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003445614,0.00014415098,0.0002156725,0.00012947102,0.00007917059,0.00019820266,0.0002140592,0.000068136535,0.000019050009],"category_scores_gemma":[0.00005522389,0.00011850134,0.00006419417,0.0001725688,0.000020595677,0.00023248907,0.00007443027,0.00011943616,0.0000070634264],"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":[8.0145395e-7,0.000019869138,7.207725e-8,0.00061338994,0.000025401376,3.7502005e-7,0.00047325072,0.4381307,0.0017783757,0.5582522,0.0000073532747,0.0006982139],"study_design_scores_gemma":[0.000099610195,0.00003481149,2.4914704e-7,0.0002651059,0.000019641724,0.000004893262,0.000005737364,0.91374916,0.0012298648,0.084337175,0.00012587347,0.00012785077],"about_ca_topic_score_codex":0.000006863561,"about_ca_topic_score_gemma":1.0755594e-7,"teacher_disagreement_score":0.5232982,"about_ca_system_score_codex":0.000011128014,"about_ca_system_score_gemma":0.00003132933,"threshold_uncertainty_score":0.48323444},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11020022,0.022425095,0.8595614,0.00241353,0.00016080234,0.00055574387,0.000079055215,0.0003488523,0.004255309],"genre_scores_gemma":[0.9896044,0.0010341528,0.008832891,0.00008865856,0.00012831035,0.0000267929,0.000006592928,0.000009255335,0.00026893953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942154,0.000019145984,0.00014929645,0.00024243648,0.00006234901,0.00010522589],"domain_scores_gemma":[0.9995002,0.00016231588,0.000035871744,0.00020954534,0.000030357647,0.0000617105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015930652,0.00008560069,0.00010386274,0.00007895548,0.00009605781,0.00010195647,0.00020011883,0.000034723224,0.0000081271855],"category_scores_gemma":[0.000008348531,0.000065925145,0.00002639483,0.00035490384,0.00004668531,0.00021220677,0.00010299704,0.00007388796,0.000013819146],"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.0000010947233,0.000020419331,0.000016452765,0.00010819547,0.000016013293,0.0000010164146,0.0006843256,0.000005818821,0.0018212986,0.921797,0.00009656031,0.07543182],"study_design_scores_gemma":[0.0003825371,0.00017676393,0.00077962264,0.00027595105,0.00006945836,0.0001718045,0.0005621669,0.40785298,0.033660013,0.27460393,0.28076255,0.0007022162],"about_ca_topic_score_codex":0.0000062153827,"about_ca_topic_score_gemma":7.713794e-7,"teacher_disagreement_score":0.8794042,"about_ca_system_score_codex":0.000003306498,"about_ca_system_score_gemma":0.000022044562,"threshold_uncertainty_score":0.26883495},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072830506,0.00006795567,0.9886585,0.00046220253,0.00031208433,0.00032932445,0.00005165884,0.0004100867,0.0024251218],"genre_scores_gemma":[0.90714973,0.0000071401637,0.08820946,0.00005018862,0.000078154575,0.000049799946,0.00018862849,0.000017444907,0.004249454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998411,0.00020754899,0.000396034,0.00045068745,0.0002834448,0.00025130945],"domain_scores_gemma":[0.9988564,0.0002524333,0.00011909675,0.00039339994,0.00026746152,0.00011118734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031195482,0.00021368393,0.00021853573,0.0002311513,0.00015011584,0.00042369787,0.0004697981,0.00007910278,0.00023718069],"category_scores_gemma":[0.000048776485,0.00014801449,0.00006612564,0.0009660092,0.00011803586,0.0022236751,0.00009269541,0.00020662945,0.00006665941],"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.000038352213,0.000091330214,0.000036909074,0.00005351319,0.000051441668,0.000011492082,0.0026071512,0.008306889,0.00034562196,0.98133147,0.0001761278,0.006949708],"study_design_scores_gemma":[0.00036505942,0.0005297193,0.00012182002,0.00017728489,0.000026752788,0.000028071605,0.00047769878,0.9723032,0.0022864037,0.023144558,0.00024668683,0.00029271274],"about_ca_topic_score_codex":0.00004312538,"about_ca_topic_score_gemma":0.00008303203,"teacher_disagreement_score":0.96399635,"about_ca_system_score_codex":0.000042187345,"about_ca_system_score_gemma":0.00019279277,"threshold_uncertainty_score":0.60358554},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014820645,0.002534411,0.9753257,0.00092474406,0.0024204347,0.00027131586,0.0006357368,0.00025592613,0.0028111085],"genre_scores_gemma":[0.96381724,0.000061901235,0.033672284,0.00015047369,0.00045830142,0.0000108660115,0.0003491693,0.000036109675,0.0014436363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99672323,0.00030085468,0.0008107953,0.000777295,0.00093230867,0.00045548694],"domain_scores_gemma":[0.9975041,0.0011779001,0.00025422557,0.00046274182,0.00038618591,0.00021484586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009239767,0.0003491002,0.00043494362,0.000631807,0.00029870914,0.0004059075,0.0008565136,0.00020172473,0.00039167554],"category_scores_gemma":[0.00016405413,0.00035062458,0.0003785255,0.0029164224,0.00026818994,0.00074197113,0.00040782997,0.00040062782,0.00038955588],"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.000017827157,0.0002620106,0.0005709856,0.0006789076,0.0004262293,0.00008678396,0.0021323022,0.094175376,0.000097691605,0.84748363,0.0025568176,0.05151146],"study_design_scores_gemma":[0.00026287016,0.00010110191,0.0052102534,0.00026647697,0.000073649084,0.00003352128,0.000064758344,0.8508519,0.00013863276,0.13727224,0.005340226,0.00038437854],"about_ca_topic_score_codex":0.000101220015,"about_ca_topic_score_gemma":0.000002586371,"teacher_disagreement_score":0.9489966,"about_ca_system_score_codex":0.00011396302,"about_ca_system_score_gemma":0.00038470913,"threshold_uncertainty_score":0.99989456},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000109307475,0.005333108,0.9029225,0.00042699222,0.0010486313,0.00041648393,0.000022192551,0.00025663004,0.08946414],"genre_scores_gemma":[0.1516304,0.006677958,0.53810424,0.0013419662,0.0024943093,0.0001595158,0.000108045904,0.00066458306,0.29881898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836755,0.00001911743,0.00045547055,0.00054095656,0.0003428746,0.00027404653],"domain_scores_gemma":[0.9983215,0.0006884232,0.00016532835,0.0006757619,0.00006183188,0.00008716118],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004094714,0.00042975388,0.0005325926,0.00033729535,0.00009409105,0.000202388,0.00049622264,0.0004044039,0.00010747661],"category_scores_gemma":[0.000112443435,0.00034354415,0.00014091005,0.00014937115,0.00008609561,0.00011407333,0.00026804605,0.0007135882,0.00017554303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000330343,0.000023886607,0.0000035711446,0.0006119727,0.000053052638,0.000091384536,0.00073327,0.000058521353,0.00008395117,0.9841673,0.00010004362,0.014069743],"study_design_scores_gemma":[0.00014624723,0.00004248975,0.0000026137714,0.0008572299,0.00006190421,0.0001308746,0.000005010348,0.05478137,0.00012737709,0.9384984,0.004967246,0.00037923706],"about_ca_topic_score_codex":9.107695e-7,"about_ca_topic_score_gemma":0.000016055834,"teacher_disagreement_score":0.36481827,"about_ca_system_score_codex":0.00005935316,"about_ca_system_score_gemma":0.000066305496,"threshold_uncertainty_score":0.99990165},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036789826,0.00080090546,0.9912326,0.002479608,0.0010711502,0.0005944637,0.000015442367,0.000028877272,0.000098000186],"genre_scores_gemma":[0.7313958,0.000052075928,0.2673678,0.00019074413,0.00045120408,0.000022134944,0.000017787412,0.000023997238,0.00047848956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842554,0.00033127028,0.0005402692,0.00023904872,0.0002683422,0.00019552243],"domain_scores_gemma":[0.9983145,0.00060876,0.00034883892,0.00019367454,0.00046112703,0.00007308434],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0037520747,0.00015944261,0.00024340629,0.00019470819,0.00046819117,0.0021640891,0.000659006,0.000069647394,0.000022780385],"category_scores_gemma":[0.00014789833,0.00010022213,0.00013288246,0.00049852073,0.000056263176,0.001780061,0.00007006615,0.0002512505,0.0000024482683],"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.0011905376,0.00039489186,0.00006370544,0.00081754866,0.0007225623,0.0001278754,0.006753253,0.042066988,0.212393,0.19392887,0.0030260943,0.5385147],"study_design_scores_gemma":[0.00048796876,0.00023947388,0.000011208928,0.000271053,0.0000797401,0.00008206592,0.00011482044,0.9593856,0.018652804,0.017585367,0.00294042,0.00014948333],"about_ca_topic_score_codex":0.000027809667,"about_ca_topic_score_gemma":0.0000031679929,"teacher_disagreement_score":0.9173186,"about_ca_system_score_codex":0.00006671615,"about_ca_system_score_gemma":0.000493011,"threshold_uncertainty_score":0.99887174},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040300068,0.0003169938,0.94085777,0.0041583,0.00036446817,0.00015682264,0.0000033830308,0.00035392185,0.05338534],"genre_scores_gemma":[0.32191676,0.000017984981,0.6606721,0.0023732374,0.00037381647,0.00017833455,0.0000012752303,0.000059179234,0.014407302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885195,0.00019119978,0.00016831559,0.00032499974,0.00025997384,0.0002035376],"domain_scores_gemma":[0.99803513,0.0012256555,0.0000395489,0.00062977703,0.000021033326,0.000048875525],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011667192,0.00015081445,0.00014515058,0.00006170845,0.00013341445,0.0003136573,0.0008873002,0.000044844026,0.0004566969],"category_scores_gemma":[0.00008702621,0.00008363241,0.00011607119,0.00039545572,0.000031752545,0.0002320364,0.00016652257,0.00025384125,0.00201728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019090737,0.000020290965,5.020126e-8,0.000019079802,0.000025218706,0.000016040205,0.0017676612,0.000018792054,0.00018697898,0.96505296,0.006213574,0.026677446],"study_design_scores_gemma":[0.00004855008,0.00007168519,0.0000021050719,0.000110545734,0.000009224791,0.000050427614,0.00012959991,0.26713958,0.0075203213,0.6903776,0.034372453,0.00016789966],"about_ca_topic_score_codex":0.0000026136274,"about_ca_topic_score_gemma":1.2931382e-7,"teacher_disagreement_score":0.32151374,"about_ca_system_score_codex":0.000016088277,"about_ca_system_score_gemma":0.00003558837,"threshold_uncertainty_score":0.99875975},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053324644,0.00025644244,0.94345856,0.00029709507,0.00040205414,0.00057976856,0.000017628896,0.00016257628,0.0015012156],"genre_scores_gemma":[0.9788194,0.00004555735,0.020821176,0.00007307608,0.00008354688,0.0000025367103,0.000012585395,0.0000134315715,0.00012873775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974993,0.00055746455,0.00033834038,0.0009575527,0.00016825958,0.00047912291],"domain_scores_gemma":[0.99833965,0.00019147647,0.0002630762,0.0010441206,0.00008181965,0.00007984038],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013264522,0.00031824628,0.00036781334,0.00033475697,0.00009535474,0.00014923554,0.0024321978,0.0002987178,0.000008150262],"category_scores_gemma":[0.000046306668,0.0002868187,0.00023214002,0.00241594,0.000091334325,0.00020620367,0.0018064423,0.0007910098,0.000020130772],"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.00002965988,0.0001636056,0.00040253915,0.00023133459,0.00010187064,0.0002695526,0.00078123616,0.07671462,0.000005352132,0.9154916,0.000023302791,0.0057853526],"study_design_scores_gemma":[0.0002855484,0.00008088665,0.00042251727,0.00012959135,0.00010176603,0.00002203049,0.00010406442,0.65430135,0.00009096424,0.34353298,0.00061335013,0.00031492894],"about_ca_topic_score_codex":0.0003634691,"about_ca_topic_score_gemma":0.00020889106,"teacher_disagreement_score":0.92549473,"about_ca_system_score_codex":0.00025586513,"about_ca_system_score_gemma":0.0004170041,"threshold_uncertainty_score":0.9999584},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03961478,0.00013941861,0.95762295,0.00035893524,0.0018212949,0.00017195998,0.0000022753186,0.00006467208,0.00020374147],"genre_scores_gemma":[0.581443,0.0000044136173,0.41827095,0.000106060994,0.00014708753,0.0000019622064,8.289528e-7,0.000007657245,0.00001803986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868435,0.0000889238,0.0006328237,0.00015989786,0.00018797272,0.00024602268],"domain_scores_gemma":[0.99863786,0.00071181374,0.00030074912,0.0001440165,0.00012998219,0.00007557414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026112916,0.00012487666,0.00018964788,0.0002594801,0.00017688751,0.00028922048,0.0003959067,0.000033490196,0.000020738013],"category_scores_gemma":[0.00008568855,0.000089393434,0.00019471697,0.00028416063,0.000025078221,0.00033004864,0.00014495988,0.00027157864,0.000010405041],"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.000013485214,0.0000072531707,0.0000053072513,0.000040661125,0.00004759084,0.0000058338524,0.0032280937,0.0030606042,0.00077221607,0.48963472,0.000055320354,0.50312895],"study_design_scores_gemma":[0.00035563667,0.00048269826,0.000042180323,0.00025256176,0.000010067093,0.0001305869,0.00041275285,0.9421441,0.010708333,0.042405512,0.0029375846,0.00011796022],"about_ca_topic_score_codex":0.0000020810996,"about_ca_topic_score_gemma":8.519266e-8,"teacher_disagreement_score":0.9390835,"about_ca_system_score_codex":0.00009602804,"about_ca_system_score_gemma":0.00010107994,"threshold_uncertainty_score":0.36453587},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088090217,0.0002706779,0.9911294,0.00491548,0.0014534306,0.00018021313,0.000011846284,0.0003069923,0.0008510869],"genre_scores_gemma":[0.8213812,0.000008432535,0.16146064,0.0032166985,0.0018759128,0.0001003509,0.000013376882,0.0000415665,0.011901836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927396,0.00007655163,0.000110804955,0.0002436907,0.00010926546,0.00018572246],"domain_scores_gemma":[0.9981816,0.0014285865,0.000021231677,0.00031693044,0.000018458271,0.00003320671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007862856,0.00008433148,0.0000804478,0.00006157931,0.00023226866,0.00023809758,0.00043009303,0.000030379519,0.000032858257],"category_scores_gemma":[0.000047261114,0.00005261411,0.00009581913,0.00027298208,0.000017371258,0.00015454291,0.00009374852,0.00012029803,0.00026908246],"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.0000018335733,0.000009196196,1.08940114e-7,0.000014867197,0.000015547668,0.0000035718338,0.00023303443,0.00018260482,0.00008990634,0.94631624,0.0036251543,0.04950794],"study_design_scores_gemma":[0.00007039032,0.00006014255,0.00000675865,0.000027755037,0.0000072672096,0.000014360948,0.00003736774,0.74845225,0.00065189996,0.22160695,0.028978132,0.00008675445],"about_ca_topic_score_codex":0.000007769507,"about_ca_topic_score_gemma":5.13961e-7,"teacher_disagreement_score":0.82966876,"about_ca_system_score_codex":0.000014710752,"about_ca_system_score_gemma":0.000025429654,"threshold_uncertainty_score":0.34586006},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038524275,0.00027027747,0.26300174,0.00019337541,0.00090871716,0.001816159,0.00015782741,0.00045979128,0.7331536],"genre_scores_gemma":[0.0003525345,0.000046160505,0.36859384,0.00038842898,0.0029804038,0.00020071847,0.00020740267,0.00022406463,0.6270065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982808,0.0000034252303,0.0004999844,0.0005989226,0.00030323185,0.00031359534],"domain_scores_gemma":[0.9989062,0.0002298933,0.00026073176,0.00043648973,0.000037327954,0.00012934023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058966095,0.00045274876,0.0005588714,0.00005895451,0.00030472834,0.00038550148,0.00048528847,0.0007484488,0.000021530546],"category_scores_gemma":[0.00000481108,0.00040601334,0.0006056455,0.00002407529,0.00014558423,0.000047926897,0.00036240908,0.00058656436,0.000094350515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055789433,0.000013160605,1.8486184e-9,0.0003135046,0.00020389432,0.0000020476339,0.0007280629,0.0000026573819,0.00015607072,0.9749621,0.003453101,0.02015983],"study_design_scores_gemma":[0.00048801515,0.00005829473,1.4581101e-9,0.00030216828,0.00020287554,0.000017105202,0.000040258,0.0035733983,0.0010280908,0.86590666,0.12796305,0.00042011353],"about_ca_topic_score_codex":6.1084353e-7,"about_ca_topic_score_gemma":1.233209e-7,"teacher_disagreement_score":0.124509946,"about_ca_system_score_codex":0.00005791422,"about_ca_system_score_gemma":0.00009332648,"threshold_uncertainty_score":0.9998392},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03605775,0.00012392763,0.9582417,0.00013371419,0.00034622545,0.00006312503,8.9735323e-7,0.00039941698,0.004633268],"genre_scores_gemma":[0.63043845,9.1067375e-7,0.36914223,0.00010416074,0.000045410492,0.0000014273106,5.46918e-7,0.000005968172,0.0002608748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999273,0.000022115724,0.00011745349,0.00026594743,0.00013974396,0.00018173373],"domain_scores_gemma":[0.9996847,0.000029900008,0.00001352943,0.00020741914,0.000018202712,0.000046273864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026645334,0.00008366202,0.00006814322,0.000088396606,0.00011550756,0.00035119796,0.00023439938,0.00002832672,0.000023340519],"category_scores_gemma":[0.0000019459192,0.00006833818,0.00005421593,0.0002310874,0.000015851221,0.00019671457,0.0001387136,0.000070275084,0.000055473316],"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.0000011782413,0.000021282622,3.5063522e-7,0.000027735103,0.000005994536,0.00001409374,0.0003047817,0.45451227,0.008415778,0.5268578,0.000054487657,0.009784247],"study_design_scores_gemma":[0.00004100911,0.0000059668005,4.747271e-7,0.000037642305,0.0000042961233,0.0000300432,0.0000066719977,0.9660842,0.0058326605,0.02780988,0.000046999383,0.00010015971],"about_ca_topic_score_codex":0.0000034270888,"about_ca_topic_score_gemma":1.078063e-7,"teacher_disagreement_score":0.59438074,"about_ca_system_score_codex":0.000037531518,"about_ca_system_score_gemma":0.00003597727,"threshold_uncertainty_score":0.33866102},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009274351,0.0019430422,0.004899046,0.0016846178,0.02325936,0.00054112455,0.000042240736,0.00056854816,0.9577877],"genre_scores_gemma":[0.022528885,0.00008298927,0.0021283233,0.00009506293,0.0003907563,0.000008561778,0.000006265622,0.000040960593,0.9747182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989093,0.000011680066,0.00027014327,0.00044646676,0.00019098293,0.00017142622],"domain_scores_gemma":[0.9991979,0.000055017794,0.000095078176,0.0004436112,0.00010514699,0.000103275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001680545,0.00024252798,0.00027029068,0.00023088043,0.00012009266,0.00015297144,0.0002757907,0.00012632593,0.00016656927],"category_scores_gemma":[0.000031796488,0.00023208134,0.00008162382,0.00012311492,0.00010185074,0.00025241124,0.0003634747,0.00032598656,0.0002949471],"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.00002835843,0.0000106064945,0.000022364173,0.00010327417,0.00008261968,0.00001686015,0.0012705083,0.000005621535,0.00019381163,0.9688926,0.0041105594,0.025262823],"study_design_scores_gemma":[0.00007747399,0.00042916564,0.00017091693,0.00044927126,0.000058578473,0.00010182594,0.000071277624,0.00022530698,0.0016678561,0.11466658,0.8815992,0.0004825841],"about_ca_topic_score_codex":0.000016518987,"about_ca_topic_score_gemma":0.00004165609,"teacher_disagreement_score":0.8774886,"about_ca_system_score_codex":0.000027917344,"about_ca_system_score_gemma":0.00008000205,"threshold_uncertainty_score":0.9464002},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4713874,0.06791716,0.42402622,0.019571345,0.013537588,0.00065377157,0.000009384778,0.00039080612,0.0025063145],"genre_scores_gemma":[0.9986645,0.0005364568,0.00002012191,0.00029369278,0.00030799126,0.0000041895855,8.429546e-7,0.000022937305,0.00014929465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748045,0.00048982963,0.000502731,0.00019724025,0.00069023337,0.0006395221],"domain_scores_gemma":[0.9962035,0.002645402,0.000305794,0.0005770184,0.00018474815,0.00008352636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035167532,0.00023846458,0.00027234186,0.000120208686,0.0005234634,0.0005731791,0.002529539,0.00008084307,0.000025310284],"category_scores_gemma":[0.00021305592,0.00012498067,0.00017014028,0.0011773744,0.00008932603,0.00035506755,0.0001991735,0.0015083334,0.000035740482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023243443,0.00008831197,0.0000028983045,0.000010356792,0.00011613579,0.000062736195,0.00018273182,0.000046089055,0.00017774665,0.98778987,0.009770151,0.0017297446],"study_design_scores_gemma":[0.00040998796,0.0009130079,0.0000021493013,0.00006986056,0.000048512433,0.000598306,0.000040309256,0.011587345,0.0025373215,0.9707656,0.012859634,0.00016798291],"about_ca_topic_score_codex":0.000010086005,"about_ca_topic_score_gemma":0.0000013797454,"teacher_disagreement_score":0.52727705,"about_ca_system_score_codex":0.0002728129,"about_ca_system_score_gemma":0.0005020463,"threshold_uncertainty_score":0.6553042},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009814055,0.000036539685,0.98312026,0.0007581511,0.00025094795,0.0048707174,0.0004953007,0.0004964815,0.00015756155],"genre_scores_gemma":[0.8149263,0.000010503944,0.1822844,0.000092327056,0.00028832795,0.00036096657,0.00024377277,0.000047209975,0.0017461849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781555,0.00005522331,0.0003011101,0.0013623288,0.00008767834,0.00037811825],"domain_scores_gemma":[0.99813527,0.00021785471,0.00019316848,0.00092407677,0.0003188235,0.00021078378],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003669429,0.0003654367,0.00038876958,0.00034309961,0.0002617105,0.00026425044,0.0014288442,0.00023075742,0.0000051658135],"category_scores_gemma":[0.000007805645,0.00036130106,0.000277729,0.0007382039,0.00006232837,0.00018721927,0.0005503514,0.00025193865,0.000039855953],"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.00040717018,0.00033303455,0.00001891792,0.0011846301,0.00036379942,0.000015628517,0.00042086927,0.08155751,0.0005415492,0.85939145,0.00048553565,0.055279925],"study_design_scores_gemma":[0.0012427976,0.00035561976,0.00007905954,0.00020135898,0.00027297199,0.000011841001,0.000034248165,0.8369484,0.002740205,0.14586926,0.011441525,0.00080274686],"about_ca_topic_score_codex":0.000015887297,"about_ca_topic_score_gemma":0.000025456593,"teacher_disagreement_score":0.80511224,"about_ca_system_score_codex":0.0001625943,"about_ca_system_score_gemma":0.0002955077,"threshold_uncertainty_score":0.9998839},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.1993937e-8,0.511922,0.48711094,0.00049182476,0.000060200535,0.0001418729,0.000012305428,0.000010386161,0.00025047723],"genre_scores_gemma":[2.2744867e-7,0.84034365,0.15860586,0.0004635876,0.00026761548,0.00008388608,0.000007519044,0.000009367019,0.00021826975],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99799144,0.0002047363,0.0009895304,0.00031584245,0.00039060018,0.00010787427],"domain_scores_gemma":[0.99825555,0.00034363414,0.00057481695,0.00039754566,0.0002762788,0.00015217418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016340408,0.00022522535,0.0012070882,0.00096717686,0.000045834775,0.0002881626,0.0015165107,0.0000638176,0.000042840864],"category_scores_gemma":[0.00007740155,0.00014139703,0.0010109405,0.0014036996,0.000027258184,0.000106959385,0.00027541444,0.00029615083,0.00010934333],"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":[4.784252e-7,0.000047619735,1.9702561e-8,0.0020799194,0.001747269,0.0000068705026,0.000018334207,0.0000032936075,1.548676e-7,0.10526956,0.0008711746,0.8899553],"study_design_scores_gemma":[0.000021482372,0.000024812347,7.9679914e-8,0.0108619975,0.0046427,0.00014986402,0.0000027273602,0.00056974794,0.0000014354682,0.037337076,0.94625294,0.0001351523],"about_ca_topic_score_codex":4.898559e-7,"about_ca_topic_score_gemma":1.0478189e-7,"teacher_disagreement_score":0.94538176,"about_ca_system_score_codex":0.000054536904,"about_ca_system_score_gemma":0.000082748316,"threshold_uncertainty_score":0.5766004},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010755858,0.00039340745,0.09101943,0.00009160112,0.00034159975,0.0000834105,0.000010545194,0.00011646389,0.9079425],"genre_scores_gemma":[0.0001581447,0.000038827107,0.045510884,0.000049147493,0.000058319747,0.0000012583674,0.0000016125933,0.000015047889,0.95416677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992465,0.0000022742447,0.00025533017,0.00020849297,0.00020047039,0.00008696544],"domain_scores_gemma":[0.99930656,0.000060000126,0.000093807845,0.0004783338,0.0000245169,0.000036791607],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015397226,0.00014850423,0.00023155738,0.00009581208,0.000014690809,0.00005546673,0.0005823575,0.0000977172,0.0012112975],"category_scores_gemma":[0.000001957465,0.000114922084,0.0001345068,0.000023580176,0.000041566385,0.00006475361,0.00033462528,0.000120213794,0.0011866856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.2999331e-7,0.0000077558525,1.8202117e-8,0.00016880558,0.00003162459,0.000012420962,0.00008743078,4.061971e-7,0.000015014324,0.9941907,0.0010687913,0.004416889],"study_design_scores_gemma":[0.00002409049,0.000026417609,2.3163112e-8,0.0001607711,0.000013802104,0.00001554898,0.000006257266,0.0015237909,0.00052767724,0.8675147,0.13006571,0.000121166144],"about_ca_topic_score_codex":8.965462e-7,"about_ca_topic_score_gemma":3.8337055e-7,"teacher_disagreement_score":0.12899691,"about_ca_system_score_codex":0.000013399148,"about_ca_system_score_gemma":0.00002526986,"threshold_uncertainty_score":0.99970174},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021522438,0.001403412,0.95490026,0.0013586353,0.0030749037,0.0004213868,0.000032727137,0.0008448748,0.016441343],"genre_scores_gemma":[0.98177373,0.00017604823,0.0010927992,0.000105529405,0.0006995104,0.0000023397304,0.000012115674,0.000029839368,0.016108064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755543,0.00030406506,0.00028528733,0.0012442912,0.00015056522,0.00046037373],"domain_scores_gemma":[0.9973575,0.00037323858,0.00024415486,0.001731723,0.00013159576,0.00016180288],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006940847,0.00038736,0.00033487251,0.00054982456,0.0004766935,0.00042798123,0.0026050957,0.00025725586,0.00013119924],"category_scores_gemma":[0.000061851286,0.0003345345,0.0004447406,0.0026344298,0.00011181826,0.0002719376,0.004845345,0.0013166077,0.0014871416],"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.0000070471974,0.000024333192,0.00007467062,0.00017974147,0.00014768868,0.0004535763,0.000131142,0.01571047,0.000011444639,0.97381186,0.00065914844,0.008788896],"study_design_scores_gemma":[0.00015447383,0.00002108615,0.000088693625,0.00015613949,0.00019505629,0.000045046112,0.00007700348,0.5720389,0.0000359064,0.42074162,0.0059656356,0.0004804209],"about_ca_topic_score_codex":0.000076588934,"about_ca_topic_score_gemma":0.0000035921562,"teacher_disagreement_score":0.96025133,"about_ca_system_score_codex":0.00017901295,"about_ca_system_score_gemma":0.0001697333,"threshold_uncertainty_score":0.99991065},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009818371,0.00047031912,0.9949143,0.0032160121,0.0002120107,0.00025198597,0.000026847205,0.00048323232,0.00032710514],"genre_scores_gemma":[0.83847773,0.00017874177,0.15229751,0.00041050615,0.00015357397,0.0003274244,0.000054619817,0.00004567421,0.00805422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752635,0.00021678815,0.0004143243,0.0008641595,0.0003289503,0.0006494572],"domain_scores_gemma":[0.99851197,0.0006099933,0.00007053143,0.00057839626,0.00007256382,0.00015654978],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047288273,0.00027964206,0.0004412092,0.0006764791,0.00031412984,0.00026467934,0.00059692323,0.0001417955,0.00026682828],"category_scores_gemma":[0.000018781635,0.00024765954,0.00083860476,0.0043796734,0.00003172283,0.00037499168,0.0000087588705,0.0003760261,0.00005009206],"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.00011287788,0.0005206278,0.0000020110153,0.000055507797,0.004107014,0.000008144476,0.0006840922,0.32448113,0.0004247535,0.18990101,0.0008735156,0.47882932],"study_design_scores_gemma":[0.0002508366,0.00026818804,0.0000071932022,0.000008681557,0.0010982843,0.000009012376,0.00001738478,0.9660892,0.001405919,0.014802777,0.01575101,0.0002915493],"about_ca_topic_score_codex":0.00004382505,"about_ca_topic_score_gemma":0.000020799793,"teacher_disagreement_score":0.8426168,"about_ca_system_score_codex":0.00021470616,"about_ca_system_score_gemma":0.0001912566,"threshold_uncertainty_score":0.99999756},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013912581,0.00024049022,0.9296463,0.0003035333,0.0005407699,0.000024737918,4.252543e-7,0.0006749546,0.06717752],"genre_scores_gemma":[0.96125805,0.00000678745,0.02753091,0.00020152701,0.000110101006,0.000008420977,8.615702e-7,0.000008237048,0.010875105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993094,0.000027128544,0.000099210265,0.00025227488,0.00013047556,0.00018151132],"domain_scores_gemma":[0.9995823,0.000056325658,0.000008767734,0.0002832352,0.000013453016,0.000055921464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024765678,0.00007713945,0.000060790928,0.0000882977,0.00006767602,0.00031146256,0.00043565553,0.000023472969,0.00010614665],"category_scores_gemma":[0.0000030184726,0.000058514503,0.000043702574,0.00039340253,0.00001596158,0.00014584768,0.00020599677,0.000063262276,0.00017867668],"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":[3.2041063e-7,0.000011758103,0.0000010844494,0.000013223639,0.0000042898537,0.000023855688,0.00010879243,0.00064019026,0.00012354835,0.926038,0.00017084407,0.07286405],"study_design_scores_gemma":[0.000032069827,0.000011619933,0.0000033273361,0.000016419517,0.0000016048026,0.000018003855,0.000012889196,0.93362194,0.004409517,0.033361938,0.028417924,0.000092713904],"about_ca_topic_score_codex":0.000012538803,"about_ca_topic_score_gemma":6.3475727e-7,"teacher_disagreement_score":0.95986676,"about_ca_system_score_codex":0.000010053693,"about_ca_system_score_gemma":0.000024729025,"threshold_uncertainty_score":0.30034408},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.425246e-7,0.0013990423,0.2088962,0.0011987018,0.0012874098,0.00010539054,0.000002643589,0.00026699333,0.7868432],"genre_scores_gemma":[0.00011241795,0.00012663806,0.0099840425,0.0003152538,0.0003750404,0.0000032719427,0.000005757378,0.000023506698,0.9890541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896884,0.00001656436,0.0002096142,0.00037542163,0.00025450278,0.00017503097],"domain_scores_gemma":[0.9990208,0.00016387123,0.0000622529,0.0006566554,0.000039155802,0.000057225418],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036443496,0.00020565446,0.00014583742,0.00006374268,0.00024571645,0.00052689516,0.00090747565,0.00013606924,0.00012951261],"category_scores_gemma":[0.0000038866874,0.00012846937,0.00016954573,0.000033337255,0.00006368575,0.000111758454,0.0003522741,0.00029090914,0.0017492383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.586325e-7,0.00000201008,6.2593544e-9,0.000009311681,0.000028257751,0.000036918973,0.00002654421,0.000005298086,0.000006953782,0.9652361,0.002356217,0.03229142],"study_design_scores_gemma":[0.000018462304,0.000017640568,8.394992e-8,0.000045531753,0.000010811672,0.000024609184,6.4524625e-7,0.007541503,0.00008583294,0.57944417,0.41269484,0.000115851246],"about_ca_topic_score_codex":0.0000026381024,"about_ca_topic_score_gemma":0.0000013348977,"teacher_disagreement_score":0.41033864,"about_ca_system_score_codex":0.000036378166,"about_ca_system_score_gemma":0.000042724252,"threshold_uncertainty_score":0.999028},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.7837295e-7,0.45089614,0.30142772,0.22237691,0.0016772636,0.0015206925,0.00044957627,0.00008568143,0.021565536],"genre_scores_gemma":[0.00021702395,0.7139047,0.027714461,0.079698056,0.0010410817,0.0004856584,0.008021651,0.00005061531,0.16886675],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99670625,0.0007721791,0.00088546664,0.00054985913,0.0007582941,0.00032796338],"domain_scores_gemma":[0.99737465,0.0005620818,0.00043997256,0.0012440229,0.00032184352,0.00005742281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030753426,0.0003580338,0.00092367915,0.00015036551,0.00010077675,0.000074786454,0.0025845375,0.00016542702,0.00079181686],"category_scores_gemma":[0.00030657978,0.00024006692,0.0003759101,0.0014997395,0.00008295957,0.0001628978,0.00044157027,0.00059002143,0.00009807375],"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.0000013832042,0.000053636835,0.0000019087884,0.026766302,0.000015829839,0.000008376666,0.0000068733198,0.000002325992,0.0000010276804,0.22340594,0.74532413,0.00441223],"study_design_scores_gemma":[0.0001242999,0.000034020384,0.000023584184,0.044419903,0.00006230685,0.000026947644,0.0000032606977,0.0012914297,0.000008831897,0.0045514368,0.9492067,0.00024726108],"about_ca_topic_score_codex":0.0001758923,"about_ca_topic_score_gemma":0.000032273194,"teacher_disagreement_score":0.27371326,"about_ca_system_score_codex":0.00009967339,"about_ca_system_score_gemma":0.00039413382,"threshold_uncertainty_score":0.9789645},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09213387,0.0005469064,0.90092,0.0030451815,0.0000349829,0.0004792256,0.00009389014,0.000084219915,0.0026617716],"genre_scores_gemma":[0.98849076,0.00008787619,0.009842855,0.0004415299,0.000050080096,0.00011714475,0.000021530488,0.0000052398723,0.00094298495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993613,0.00003069909,0.00016300712,0.00023734062,0.00009333972,0.000114326605],"domain_scores_gemma":[0.99933463,0.00017623931,0.00007317829,0.00023434566,0.0001365152,0.000045071632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008034634,0.00009626463,0.00013383546,0.00007870214,0.00012340401,0.00003022809,0.00026174847,0.00003489351,0.00001411931],"category_scores_gemma":[0.000015176221,0.00007532624,0.000025055739,0.00039753126,0.00006070996,0.00015590129,0.00011933079,0.000079111924,0.000008280106],"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.000015144205,0.00007837287,0.00027539328,0.000030042795,0.000041783944,8.86168e-7,0.0004047278,0.000011549196,0.00045795052,0.98017263,0.000047232512,0.018464271],"study_design_scores_gemma":[0.0053659673,0.0012185915,0.0703342,0.0007336184,0.0003174114,0.00006649198,0.001172169,0.13701685,0.5141776,0.20511612,0.06274393,0.0017370214],"about_ca_topic_score_codex":0.000007402619,"about_ca_topic_score_gemma":0.000005201313,"teacher_disagreement_score":0.8963569,"about_ca_system_score_codex":0.000006720123,"about_ca_system_score_gemma":0.00005633804,"threshold_uncertainty_score":0.3071715},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011141725,0.00027556153,0.98478013,0.000506427,0.00056569226,0.00041343717,0.000013988609,0.0000858578,0.0022172006],"genre_scores_gemma":[0.9536353,0.0000067089204,0.04284338,0.0011289432,0.000088506145,0.00012752922,0.000015077201,0.00001159182,0.002142972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875045,0.00016834683,0.0003233608,0.0003545312,0.00013012464,0.00027319943],"domain_scores_gemma":[0.9981635,0.0011375613,0.00006135435,0.00035814868,0.00019986236,0.00007954766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001286883,0.00016961347,0.00017681796,0.00020184735,0.00064106705,0.00044211306,0.00047831543,0.00008020623,0.000019634526],"category_scores_gemma":[0.0005266142,0.00014019266,0.00008734246,0.00042254498,0.00009765981,0.00048862636,0.00017007436,0.0001385212,0.000017815546],"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.000012656926,0.00005412304,0.000018069733,0.000017922492,0.000025034165,9.904531e-7,0.000594789,0.00045590053,0.00053510687,0.9391806,0.00004100163,0.059063803],"study_design_scores_gemma":[0.0009922327,0.00014047066,0.000057487825,0.00022311074,0.000049233477,0.0000037331192,0.00055459136,0.7603643,0.007717867,0.22462769,0.0049112258,0.00035808215],"about_ca_topic_score_codex":0.000008666717,"about_ca_topic_score_gemma":0.000002503018,"teacher_disagreement_score":0.94249356,"about_ca_system_score_codex":0.000036041678,"about_ca_system_score_gemma":0.00015645719,"threshold_uncertainty_score":0.57168907},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025423218,0.00022192647,0.9805841,0.006923801,0.00028707154,0.0008637982,0.00024977163,0.00042635464,0.007900865],"genre_scores_gemma":[0.1475647,0.000046795074,0.8477574,0.00028952587,0.000024899518,0.00024171536,0.00015646308,0.000034398865,0.003884089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99555963,0.0016481179,0.0005280121,0.0012116389,0.0005397585,0.0005128578],"domain_scores_gemma":[0.9914227,0.0023602992,0.0005316216,0.0034340608,0.0020549304,0.00019637997],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0049237106,0.00047108854,0.0005687665,0.00028484227,0.00055394764,0.00086521567,0.0033306177,0.00041515383,0.000030071245],"category_scores_gemma":[0.00066975266,0.00045490914,0.00029151025,0.000526411,0.00017297026,0.00021534148,0.0016273906,0.00082788384,0.00000895327],"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.00005540736,0.0002541971,0.00008111294,0.00041417097,0.00009651278,0.000007216721,0.0026735412,0.024572762,0.000091376125,0.9532057,0.00040001117,0.018147966],"study_design_scores_gemma":[0.00057088,0.0000013285954,0.000016594047,0.0026268065,0.00005084076,0.0000030888343,0.000021228365,0.83924294,0.022931749,0.13235986,0.0017162731,0.00045840748],"about_ca_topic_score_codex":0.000059099406,"about_ca_topic_score_gemma":0.000056579764,"teacher_disagreement_score":0.82084584,"about_ca_system_score_codex":0.00014483939,"about_ca_system_score_gemma":0.0010045193,"threshold_uncertainty_score":0.99979025},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03165635,0.00020267631,0.959177,0.004229557,0.0040770425,0.00018218182,0.000006647173,0.00012691585,0.0003416219],"genre_scores_gemma":[0.99434674,0.00016218943,0.004417405,0.00010719037,0.00020074335,0.000006094049,0.000035458113,0.000010336364,0.00071385317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984249,0.00019063635,0.0005887808,0.00030555783,0.0003625642,0.0001275937],"domain_scores_gemma":[0.99863887,0.00020965938,0.00042915673,0.00029585144,0.0003307685,0.00009569181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011511537,0.00014318999,0.0001670208,0.0004107306,0.00017318607,0.0004632495,0.00028190252,0.000091240254,0.000057691097],"category_scores_gemma":[0.00023886484,0.00012182795,0.00010216409,0.0005385426,0.000054001535,0.0008952876,0.00001729884,0.00024037294,0.00006357435],"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.0002069606,0.00018964945,0.00008104834,0.00012880065,0.00010838512,0.000009850585,0.0033939295,0.047560886,0.036478933,0.4585139,0.010400077,0.4429276],"study_design_scores_gemma":[0.00038843323,0.00030375665,0.0020333384,0.00017475733,0.00004472197,0.00010799986,0.00031388272,0.90665954,0.025858445,0.0075612953,0.056298353,0.00025546452],"about_ca_topic_score_codex":0.000005341173,"about_ca_topic_score_gemma":6.6739995e-7,"teacher_disagreement_score":0.96269035,"about_ca_system_score_codex":0.00010339205,"about_ca_system_score_gemma":0.00012368537,"threshold_uncertainty_score":0.49679998},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008569731,0.000038289654,0.001114609,0.00031982266,0.000004164024,0.00012098778,0.000004487739,0.0003024398,0.9980095],"genre_scores_gemma":[0.000068191956,2.438305e-7,0.003405548,0.000096410186,0.00013187733,0.000007484462,0.0000023023297,0.00001107841,0.99627686],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896014,0.00008763315,0.00015894102,0.0002778264,0.00020259985,0.000312849],"domain_scores_gemma":[0.99910617,0.000075559576,0.000026001233,0.000591793,0.000026581523,0.00017388523],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00032306995,0.00013825417,0.00014012291,0.00007026698,0.00011435382,0.00009104057,0.00093463314,0.000047833244,0.99190784],"category_scores_gemma":[0.000016146481,0.00012968706,0.00005117408,0.00029295945,0.000025758614,0.00027681515,0.00014105448,0.00010146184,0.9950297],"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.000018463019,0.000036912843,1.3747291e-8,0.00000308248,0.000006178202,0.000008892125,0.000043640717,0.00010715368,0.000028898814,0.0001043721,0.08721753,0.91242486],"study_design_scores_gemma":[0.00014803506,0.00011647759,0.000005038298,0.000008712158,0.0000044363574,0.000020037734,3.5946863e-7,0.0059889597,0.00030741724,0.00032222527,0.99289036,0.00018792534],"about_ca_topic_score_codex":0.000008602347,"about_ca_topic_score_gemma":6.825824e-8,"teacher_disagreement_score":0.9122369,"about_ca_system_score_codex":0.00001872616,"about_ca_system_score_gemma":0.000026304468,"threshold_uncertainty_score":0.52884847},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.2703815e-8,0.00026018347,0.00048761623,0.00022025238,0.00001631947,0.00031047637,0.000046962163,0.0004494649,0.9982087],"genre_scores_gemma":[2.6755603e-7,8.552887e-7,0.0020035922,0.00011004094,0.0005343423,0.000013950363,0.000027409722,0.00006674099,0.9972428],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977816,0.00004254044,0.00041262835,0.0008177549,0.0004689156,0.0004765916],"domain_scores_gemma":[0.9979831,0.000115935756,0.00014927842,0.0013545608,0.000081050894,0.00031605366],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00031562115,0.0005213772,0.00052398856,0.00029547562,0.00015096233,0.00022274874,0.0019331896,0.00032802895,0.99313337],"category_scores_gemma":[0.00001424197,0.0005168399,0.00025894845,0.00011131104,0.00007150417,0.0002488424,0.00048784533,0.00044420233,0.99707705],"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.000020679716,0.000019317253,3.8561876e-10,0.0000134371885,0.00004522033,0.00006883858,0.00001731228,0.00002019701,0.0000017335279,0.013058494,0.09981989,0.88691485],"study_design_scores_gemma":[0.00015404842,0.00015622326,9.6814546e-8,0.00009710431,0.000028028508,0.000046573023,7.237957e-8,0.00060223887,0.00001896613,0.012130619,0.98612905,0.00063696416],"about_ca_topic_score_codex":0.0000043981427,"about_ca_topic_score_gemma":7.206371e-8,"teacher_disagreement_score":0.88630915,"about_ca_system_score_codex":0.00006445235,"about_ca_system_score_gemma":0.00010032703,"threshold_uncertainty_score":0.9997283},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.139803e-8,0.00024355685,0.00048990076,0.00024550033,0.000017137798,0.00031845894,0.00004573215,0.00045254096,0.9981871],"genre_scores_gemma":[2.3985308e-7,7.982564e-7,0.0021611883,0.00012144242,0.0005220181,0.000014085222,0.000025302059,0.000066674635,0.99708825],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99780643,0.000041369665,0.00040392435,0.000813663,0.00046758557,0.0004670555],"domain_scores_gemma":[0.998009,0.00012245904,0.00014213889,0.0013351636,0.0000819524,0.00030924837],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003085334,0.000516715,0.00051329564,0.0002849149,0.00015109018,0.00022222933,0.0019405034,0.00033159516,0.9926707],"category_scores_gemma":[0.00001603196,0.000513405,0.00024652746,0.00011003214,0.000070305236,0.00024017831,0.00047078246,0.00044734552,0.99698967],"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.000019425792,0.00001777964,3.5098183e-10,0.000013377302,0.000039835468,0.000067552566,0.000018128736,0.000018041077,0.0000017090342,0.01655405,0.09714394,0.88610613],"study_design_scores_gemma":[0.00014996628,0.00014894102,7.930515e-8,0.000098382974,0.000025017622,0.000045382283,7.0260086e-8,0.0005512296,0.000024587307,0.015395958,0.98292845,0.0006319365],"about_ca_topic_score_codex":0.0000043633295,"about_ca_topic_score_gemma":6.709546e-8,"teacher_disagreement_score":0.8857845,"about_ca_system_score_codex":0.00006370765,"about_ca_system_score_gemma":0.0001039641,"threshold_uncertainty_score":0.9997318},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.7771683e-8,0.0002386681,0.00042169835,0.00022509824,0.000016430962,0.00030952643,0.000046649453,0.00045135114,0.99829054],"genre_scores_gemma":[2.7212812e-7,8.356729e-7,0.0021112668,0.00011367287,0.00053726695,0.000009541666,0.000027161966,0.000066596054,0.9971334],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99777406,0.000042385698,0.000412553,0.00082599366,0.00047291047,0.0004721007],"domain_scores_gemma":[0.99797773,0.00011635532,0.00014917082,0.001361499,0.00008074265,0.00031450798],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00031567193,0.0005209828,0.00052263826,0.00029090984,0.00015180245,0.0002253462,0.0019559276,0.00032765424,0.9927265],"category_scores_gemma":[0.0000146560415,0.0005165347,0.00025897374,0.000112404996,0.000073050476,0.00024156374,0.0004920243,0.00043860055,0.99703044],"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.000021305548,0.000019662451,3.8072065e-10,0.000013679498,0.000046624882,0.00007011836,0.000017708915,0.00001976724,0.0000021097608,0.014399371,0.097095095,0.8882946],"study_design_scores_gemma":[0.00015318999,0.00016205103,8.192824e-8,0.00009760553,0.000027615353,0.000045363,7.045991e-8,0.000527666,0.000025967267,0.013088457,0.9852369,0.00063505815],"about_ca_topic_score_codex":0.000004439884,"about_ca_topic_score_gemma":7.449505e-8,"teacher_disagreement_score":0.88814175,"about_ca_system_score_codex":0.00006478957,"about_ca_system_score_gemma":0.00010115272,"threshold_uncertainty_score":0.9997286},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050332528,0.000564062,0.9821941,0.009677441,0.00003719667,0.00069831306,0.000013426571,0.00009131549,0.0016908909],"genre_scores_gemma":[0.8204335,0.00015703627,0.17005375,0.001213637,0.0002469446,0.0005544333,0.0000110770125,0.000020022528,0.0073096077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991598,0.00005600323,0.00019228112,0.00029066493,0.000140459,0.00016079584],"domain_scores_gemma":[0.99903303,0.000189559,0.00005652429,0.0005630368,0.00007762965,0.000080203965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021944311,0.00010474,0.0001426012,0.00007229938,0.0001972327,0.000040467366,0.0006908808,0.000037754773,0.00001347202],"category_scores_gemma":[0.000031466105,0.00006756221,0.00003971043,0.0008308069,0.00003962272,0.00010297319,0.00020716942,0.00011470304,0.000035803365],"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.000029298155,0.00006950292,0.000074077085,0.000030517245,0.000036024936,9.0868025e-7,0.0002610753,0.0010969214,0.00011417802,0.99085957,0.0012868323,0.006141078],"study_design_scores_gemma":[0.0012515987,0.00042588427,0.0025293017,0.00008091313,0.0000882732,0.000023432101,0.00022028519,0.33891028,0.0064107594,0.03623504,0.6133036,0.0005206443],"about_ca_topic_score_codex":0.000012808474,"about_ca_topic_score_gemma":0.0000031898237,"teacher_disagreement_score":0.95462453,"about_ca_system_score_codex":0.0000075166913,"about_ca_system_score_gemma":0.000061026552,"threshold_uncertainty_score":0.2755107},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01132414,0.000330576,0.97966534,0.0019287004,0.0022763778,0.0022346433,0.0010191532,0.00017623666,0.0010448372],"genre_scores_gemma":[0.22580592,0.0005001641,0.7120342,0.0014351031,0.002984155,0.0021700321,0.0013101229,0.00013147453,0.053628772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971717,0.00012676996,0.00064554083,0.0012199845,0.00030777248,0.0005282238],"domain_scores_gemma":[0.99781924,0.0004082928,0.00033156687,0.0010012696,0.00027695423,0.000162665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060903595,0.00050795043,0.0005598096,0.0002291105,0.000327309,0.00025636482,0.0013474689,0.0002789478,0.00014464419],"category_scores_gemma":[0.00011342405,0.0004937267,0.00018700183,0.0003357087,0.00009218954,0.00033918323,0.002181552,0.00046805295,0.000011695307],"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.0006646118,0.0025614214,0.19082409,0.016091043,0.006023376,0.00042059147,0.052384574,0.0049538068,0.002970099,0.11188233,0.16151582,0.44970822],"study_design_scores_gemma":[0.0077366517,0.0013060189,0.017194744,0.0020349622,0.0006751177,0.000057558467,0.0009023491,0.47945094,0.083180085,0.1711038,0.23114887,0.005208899],"about_ca_topic_score_codex":0.00015669361,"about_ca_topic_score_gemma":0.000020569334,"teacher_disagreement_score":0.47449714,"about_ca_system_score_codex":0.00017247032,"about_ca_system_score_gemma":0.0005816998,"threshold_uncertainty_score":0.99975145},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8040345,0.00084677496,0.19278108,0.00029817157,0.00017979943,0.0006661444,0.000025009245,0.000017638515,0.0011509125],"genre_scores_gemma":[0.99935937,0.00009005656,0.00029196657,0.00004812389,0.00001953224,0.000026353122,0.0000011325606,0.0000027066264,0.00016075677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989496,0.00034297397,0.00033199484,0.00015597648,0.00013524058,0.00008420224],"domain_scores_gemma":[0.9983356,0.00068309007,0.0004583673,0.00044138118,0.000066940716,0.000014604671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008595517,0.00009114444,0.00020548221,0.00007187971,0.00012115433,0.000013453825,0.0007879926,0.000041953524,0.000004453834],"category_scores_gemma":[0.00006498983,0.000052191943,0.00007943843,0.0006994278,0.00019414791,0.00012875636,0.00026464422,0.000070483475,5.8351526e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054111343,0.00013096738,0.0013783356,0.00036598826,0.00007744108,8.0365446e-8,0.0010008654,0.000046017554,0.028880745,0.9344829,0.00004180856,0.033053774],"study_design_scores_gemma":[0.005315232,0.00009937085,0.05332125,0.0003515013,0.00028735478,0.0000066840926,0.0006134173,0.008226424,0.36389014,0.5657451,0.0018264189,0.00031711775],"about_ca_topic_score_codex":0.000014570302,"about_ca_topic_score_gemma":4.157203e-7,"teacher_disagreement_score":0.36873776,"about_ca_system_score_codex":0.000007786566,"about_ca_system_score_gemma":0.000038442526,"threshold_uncertainty_score":0.21283257},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038146672,0.00015817142,0.99479216,0.0002799171,0.00027373794,0.00028542712,0.0000061869546,0.00020900655,0.00018070941],"genre_scores_gemma":[0.78869045,0.000010933388,0.21008913,0.000015520935,0.00009843501,0.00011791349,0.000009112655,0.000013850972,0.00095467514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897915,0.000010663744,0.00030602326,0.00029264067,0.00013571468,0.00027582466],"domain_scores_gemma":[0.9993089,0.00032660508,0.000030033929,0.00021206678,0.00004835284,0.000074057716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018049148,0.00017136303,0.00021603929,0.00011692482,0.00021019384,0.00030045933,0.00027033492,0.00007798771,0.000013071314],"category_scores_gemma":[0.00004280639,0.00015225129,0.000078797166,0.00012924065,0.000019535473,0.00018823131,0.0001201313,0.00012968677,0.0000054713596],"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.0000017286784,0.000036327077,3.9276495e-7,0.00029641856,0.00002187878,2.3333907e-7,0.0001798592,0.28200728,0.0007354282,0.7162494,0.00001604955,0.0004550085],"study_design_scores_gemma":[0.00024287257,0.000017260398,0.0000011889341,0.00013369891,0.000017752878,0.0000025966685,0.000004581804,0.839994,0.00036229228,0.15895699,0.00012701648,0.00013973004],"about_ca_topic_score_codex":0.0000015483889,"about_ca_topic_score_gemma":1.1840231e-7,"teacher_disagreement_score":0.78487575,"about_ca_system_score_codex":0.000016729744,"about_ca_system_score_gemma":0.000023150458,"threshold_uncertainty_score":0.6208628},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001176605,0.00019577594,0.97751766,0.003975048,0.0001415607,0.00018384818,0.000004652379,0.00004472638,0.016760103],"genre_scores_gemma":[0.97417223,0.00003439892,0.024013951,0.00073196826,0.00004928696,0.000059616286,0.000009749968,0.0000028698753,0.00092593726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991844,0.0001361425,0.00017788482,0.00021242397,0.00011116016,0.00017793923],"domain_scores_gemma":[0.9989451,0.0006662275,0.00003334229,0.00029183325,0.00003733253,0.000026128964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005241881,0.00008824926,0.00010235261,0.00012675062,0.00038515552,0.0002399903,0.00040856088,0.000033748183,0.000032590968],"category_scores_gemma":[0.0000622027,0.00006325674,0.00002714034,0.0008394123,0.000091832844,0.00017133556,0.000116055155,0.0001215776,0.0000119768165],"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.0000012081706,0.00005614435,0.00017072268,0.000011748463,0.000008137486,0.0000014709332,0.0003944768,0.0012878051,0.000025734567,0.9910157,0.00058184424,0.0064450298],"study_design_scores_gemma":[0.00023384014,0.000028307515,0.0027090942,0.000030789495,0.000015450818,0.000010367974,0.0005295879,0.6457356,0.0000064985957,0.310564,0.04002166,0.00011474505],"about_ca_topic_score_codex":0.00006293406,"about_ca_topic_score_gemma":0.000060457744,"teacher_disagreement_score":0.97299564,"about_ca_system_score_codex":0.00001547998,"about_ca_system_score_gemma":0.00008925982,"threshold_uncertainty_score":0.2962344},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8279518,0.00008531825,0.024367869,0.004563939,0.0017771492,0.00023248873,0.000008488674,0.000089437744,0.14092353],"genre_scores_gemma":[0.9973514,0.0000043733758,0.00014584252,0.00023666477,0.00067679473,5.7959176e-7,9.515987e-8,0.000007693172,0.0015765523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983115,0.0008659817,0.00019062641,0.0001309869,0.00031912545,0.00018178068],"domain_scores_gemma":[0.9989768,0.0002879869,0.00015140603,0.00049644674,0.000048439044,0.000038918857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058873865,0.00011489994,0.00014907352,0.00003369171,0.0002961295,0.00012211563,0.0018344516,0.000006799712,0.0000033045665],"category_scores_gemma":[0.000060144783,0.000054216245,0.00021829524,0.00030936563,0.00012501409,0.00012237662,0.0004228914,0.00037806694,0.00008703128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023388393,0.00025071146,0.000007326153,0.000010659281,0.000050452058,0.000009108022,0.0007609217,0.00024123653,0.0033214432,0.96668977,0.0037622296,0.02487274],"study_design_scores_gemma":[0.00081319094,0.00033083482,0.005868674,0.0002731833,0.000060412913,0.00002854917,0.00010945607,0.015772192,0.01640959,0.9549387,0.005152684,0.00024251555],"about_ca_topic_score_codex":8.251639e-7,"about_ca_topic_score_gemma":6.147298e-8,"teacher_disagreement_score":0.16939963,"about_ca_system_score_codex":0.000015873497,"about_ca_system_score_gemma":0.0000317536,"threshold_uncertainty_score":0.34088978},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4721887,0.0005286739,0.5181896,0.0006753728,0.00081924413,0.0004270584,0.000048033755,0.00017521912,0.0069480687],"genre_scores_gemma":[0.9777041,0.00015014147,0.020743808,0.00011091856,0.00009946052,0.000041865485,0.000030665946,0.000012782319,0.0011062742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981786,0.00024029473,0.00044240823,0.00067579205,0.00023077943,0.00023214225],"domain_scores_gemma":[0.9984566,0.00012381274,0.00027881103,0.00090964476,0.00014205535,0.00008910385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054616976,0.0002750756,0.00041657395,0.00019588083,0.00011769229,0.000100915466,0.0009976302,0.00020433495,0.000016621845],"category_scores_gemma":[0.00006997173,0.00025548055,0.00011464809,0.00032033757,0.00017639788,0.00023006716,0.0018457908,0.0003329623,0.000005769231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040758732,0.00018389615,0.051036783,0.0014734087,0.000103280065,0.000034240642,0.0032032176,0.00096443563,0.00068183104,0.92055076,0.00012073722,0.021606673],"study_design_scores_gemma":[0.0023044073,0.00045981188,0.15273315,0.00668839,0.0002205633,0.000046805188,0.0015072087,0.08163228,0.02720792,0.7156306,0.008504159,0.0030647174],"about_ca_topic_score_codex":0.00007817531,"about_ca_topic_score_gemma":0.000010695999,"teacher_disagreement_score":0.5055154,"about_ca_system_score_codex":0.00003476184,"about_ca_system_score_gemma":0.00021652361,"threshold_uncertainty_score":0.99998975},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.1758875e-8,0.000577485,0.054547135,0.0010065857,0.0011270647,0.00006163591,0.0000054790685,0.00041580145,0.9422588],"genre_scores_gemma":[0.000007786626,0.00005726451,0.022488821,0.00022928856,0.00033147176,0.000002425786,0.0000022720626,0.000019772942,0.9768609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999193,0.0000034734949,0.00013948977,0.00035049228,0.00018170768,0.00013184632],"domain_scores_gemma":[0.9993016,0.000025288005,0.000032293687,0.0005546857,0.00002675618,0.000059353762],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00011640027,0.00019048118,0.00016165338,0.00008621533,0.00004380739,0.0002118305,0.0006211412,0.00013885688,0.0017417525],"category_scores_gemma":[0.000002172184,0.00014807144,0.00012128308,0.00002383845,0.000042855972,0.00021452802,0.00039798432,0.00022203782,0.0048653064],"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":[5.969546e-7,0.0000010130593,1.0781463e-8,0.000023193215,0.00002141159,0.00008958014,0.00003177306,3.381299e-7,5.9523353e-7,0.9726014,0.0100151375,0.017214956],"study_design_scores_gemma":[0.000009994151,0.000013659022,2.274313e-8,0.000024669795,0.000004746282,0.000029974226,5.4043954e-7,0.00031797242,0.00002514104,0.49648935,0.50297415,0.0001097752],"about_ca_topic_score_codex":8.007297e-7,"about_ca_topic_score_gemma":0.0000014571559,"teacher_disagreement_score":0.49295902,"about_ca_system_score_codex":0.0000133539215,"about_ca_system_score_gemma":0.000039459326,"threshold_uncertainty_score":0.9991708},"labels":[],"label_agreement":null},{"id":"W4407923948","doi":"10.1137/23m1605454","title":"M<scp>in</scp>A<scp>res</scp>: An Iterative Solver for Symmetric Linear Systems","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Solver; Mathematics; Linear system; Iterative method; Applied mathematics; Combinatorics; Mathematical optimization; Algebra over a field; Mathematical analysis; Pure mathematics","score_opus":0.011169576101567925,"score_gpt":0.2962808699257752,"score_spread":0.28511129382420725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407923948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013693043,0.0020403801,0.98072594,0.00026895117,0.00013696564,0.0005369951,0.000042624524,0.000059413927,0.00249566],"genre_scores_gemma":[0.93150455,0.001433274,0.04474098,0.00066578604,0.001226919,0.0007273019,0.00007379672,0.000042791013,0.019584574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790347,0.0002043569,0.00065407174,0.00055299245,0.0002949599,0.0003901644],"domain_scores_gemma":[0.99697,0.00157555,0.0003552037,0.0005788683,0.00028512045,0.00023525882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001243426,0.00024412175,0.0005128321,0.001768257,0.0006170097,0.00076954917,0.000779409,0.000118695934,0.0000029163864],"category_scores_gemma":[0.00019996322,0.000203363,0.00032198,0.0046791746,0.000048788173,0.00044622607,0.000097721786,0.00035588266,0.000018808043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044936583,0.0004986431,0.0011715977,0.00008586474,0.0007950345,0.000010971859,0.0005405093,0.018743532,0.00025080232,0.9619828,0.0019694942,0.013946261],"study_design_scores_gemma":[0.0012140552,0.0002765767,0.0022869136,0.00008701239,0.00078825647,0.00003746421,0.0015006813,0.7343164,0.0006142805,0.03948359,0.21922879,0.00016593987],"about_ca_topic_score_codex":0.000013556679,"about_ca_topic_score_gemma":0.000008202394,"teacher_disagreement_score":0.93598497,"about_ca_system_score_codex":0.00006400248,"about_ca_system_score_gemma":0.00009350084,"threshold_uncertainty_score":0.8292903},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082418206,0.0010348342,0.9875796,0.0029678892,0.0007308683,0.00011100986,0.0000136732215,0.00030225833,0.006435687],"genre_scores_gemma":[0.30439112,0.00004673139,0.63048375,0.001461731,0.0019191772,0.00014166848,0.000044969533,0.00001978772,0.0614911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994591,0.000014810879,0.00011453721,0.00018899626,0.000116088646,0.00010650698],"domain_scores_gemma":[0.9995745,0.00023104202,0.000012280848,0.00011777008,0.000029767967,0.000034669563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022564815,0.000055004195,0.0000471216,0.00008174187,0.000113590446,0.00022567941,0.00023011897,0.000026685886,0.00008548834],"category_scores_gemma":[0.00001299513,0.000043666896,0.000061697785,0.00020972315,0.000013013368,0.0007467926,0.000047444464,0.000048131995,0.00027751643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.7391334e-7,0.0000075462226,0.0000051240127,0.000009034809,0.000007429179,0.0000019469137,0.000044626475,0.00009293397,0.00011754707,0.9833937,0.009084403,0.0072347806],"study_design_scores_gemma":[0.000065722634,0.000021268846,0.00016195791,0.0000072416583,0.0000039114143,0.000006643797,0.000009234762,0.34655055,0.000116801326,0.58619714,0.066779606,0.000079916725],"about_ca_topic_score_codex":9.4935916e-7,"about_ca_topic_score_gemma":5.77638e-7,"teacher_disagreement_score":0.3971966,"about_ca_system_score_codex":0.000011170486,"about_ca_system_score_gemma":0.00009567322,"threshold_uncertainty_score":0.3567005},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016374463,0.00010923445,0.98155916,0.00053157064,0.00042016956,0.0005211274,0.00004807748,0.00012433206,0.00031187842],"genre_scores_gemma":[0.14041287,0.00004705677,0.85869473,0.00039035702,0.00015273869,0.00010823807,0.00001923531,0.000011747873,0.00016300818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837714,0.00022656776,0.00049594976,0.00039269734,0.00022576127,0.00028188404],"domain_scores_gemma":[0.9984114,0.00095724507,0.00020576292,0.00014411118,0.00018289861,0.00009859281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009073484,0.00023602886,0.00032694422,0.00035894432,0.00037672088,0.00032674198,0.00034082565,0.00006442185,0.0000028196098],"category_scores_gemma":[0.000043049353,0.00021831424,0.0001542202,0.00022349546,0.000101246216,0.0006301152,0.00007638354,0.0003509291,0.0000013758462],"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.0002479798,0.00078595785,0.000100196296,0.00010739703,0.00021082064,0.00005037561,0.001175687,0.076478004,0.0053517995,0.11965528,0.0031902345,0.7926463],"study_design_scores_gemma":[0.001315683,0.00032637647,0.00023806887,0.00022943407,0.00001718907,0.000037682796,0.00004704499,0.7881735,0.058410913,0.14392415,0.0069500315,0.00032993103],"about_ca_topic_score_codex":0.000004259134,"about_ca_topic_score_gemma":8.8812914e-7,"teacher_disagreement_score":0.7923163,"about_ca_system_score_codex":0.00013594178,"about_ca_system_score_gemma":0.00013991642,"threshold_uncertainty_score":0.89025956},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048359812,0.000119077435,0.9912602,0.0040582623,0.00005489405,0.0009118418,0.000022892486,0.00015533288,0.0029339383],"genre_scores_gemma":[0.29508576,0.00016750547,0.69588536,0.0031780233,0.00020676466,0.0035568457,0.00048486236,0.000022239125,0.0014126186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988981,0.00007579776,0.00032857154,0.0003952526,0.0001374167,0.00016486138],"domain_scores_gemma":[0.9988868,0.00041343065,0.00011916247,0.00026415437,0.000209712,0.00010673018],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00027384836,0.00013372686,0.000118068594,0.00011769196,0.0016950939,0.0005272777,0.0003086649,0.000048733018,0.00001964911],"category_scores_gemma":[0.000026919643,0.00012485603,0.0000315407,0.00077656977,0.00010322952,0.00032016943,0.00014960648,0.000092236325,0.000026331849],"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.00000199172,0.000022015685,0.000049951013,0.000011992255,0.000012965205,5.162778e-8,0.000052046766,0.28524646,0.000013630818,0.6875561,0.00035961738,0.026673224],"study_design_scores_gemma":[0.00048823885,0.000009360228,0.00088891585,0.000025809975,0.000016128179,0.000012349976,0.00007357212,0.8353905,0.000068681744,0.14317366,0.019658854,0.00019394427],"about_ca_topic_score_codex":0.0000028609836,"about_ca_topic_score_gemma":0.0000019809254,"teacher_disagreement_score":0.550144,"about_ca_system_score_codex":0.000031026568,"about_ca_system_score_gemma":0.000073164956,"threshold_uncertainty_score":0.9996046},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9343932,0.00050295633,0.05575891,0.0016206871,0.001334848,0.00039883374,0.00037550274,0.00092895376,0.0046861],"genre_scores_gemma":[0.94848126,0.00055195624,0.042310696,0.0045840265,0.0010168221,0.0014303437,0.00080810784,0.00054286927,0.00027388806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99019676,0.00026751656,0.0023811064,0.0022921371,0.0025828532,0.002279623],"domain_scores_gemma":[0.9894589,0.003959732,0.0026626335,0.002969515,0.00019887967,0.0007503277],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0028768538,0.0015235578,0.0010197011,0.0007183399,0.0021572986,0.0019931763,0.0031532357,0.001338414,0.000064100765],"category_scores_gemma":[0.00091012835,0.0017150447,0.00094740314,0.0017961654,0.0010421114,0.0015445001,0.0020468992,0.0017847178,0.0018408841],"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.00028061034,0.00078282424,0.0000030979415,0.0015201987,0.0012326047,0.00048365328,0.0028286718,0.0045579555,0.0019229691,0.98285985,0.002159633,0.001367951],"study_design_scores_gemma":[0.00200258,0.00061246066,0.000025987365,0.0014544647,0.0012076689,0.0003244886,0.0009898872,0.976086,0.0043575456,0.009705553,0.001662936,0.0015704093],"about_ca_topic_score_codex":0.00028714864,"about_ca_topic_score_gemma":0.00014223176,"teacher_disagreement_score":0.9731543,"about_ca_system_score_codex":0.00009520097,"about_ca_system_score_gemma":0.0007509486,"threshold_uncertainty_score":0.99995804},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021701714,0.00013354146,0.9382648,0.027708689,0.0002502979,0.00062370836,0.0000030246251,0.00010263869,0.0112116095],"genre_scores_gemma":[0.35767385,0.000040409283,0.6141002,0.0045948713,0.00014379199,0.0001295338,0.0000018927315,0.00002165554,0.023293778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990288,0.00010674277,0.00025534077,0.00024159084,0.00022158057,0.00014591555],"domain_scores_gemma":[0.9990328,0.00026851063,0.00008555553,0.0005087885,0.00005729051,0.000047085327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055613817,0.00009997188,0.00017784744,0.000018256504,0.0001307253,0.00006770829,0.00055916904,0.00006183109,0.000063987965],"category_scores_gemma":[0.00021184132,0.000069445436,0.00014824582,0.0003040188,0.00008244273,0.00003868879,0.0004888478,0.00009974902,0.000036228168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008507035,0.00010179879,0.00004276742,0.00025894472,0.000039746843,4.6328162e-7,0.0014771142,0.00006461546,0.0012168987,0.92105466,0.06731274,0.00842173],"study_design_scores_gemma":[0.0011550179,0.000091243455,0.0011804026,0.0004600258,0.000075017706,0.000016985676,0.000729528,0.057506733,0.04389595,0.8391355,0.055329893,0.00042367144],"about_ca_topic_score_codex":0.000008337412,"about_ca_topic_score_gemma":2.1976483e-7,"teacher_disagreement_score":0.33597213,"about_ca_system_score_codex":0.000020926465,"about_ca_system_score_gemma":0.00001871636,"threshold_uncertainty_score":0.28319028},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008464238,0.002773323,0.98081696,0.0037069716,0.00009940914,0.00048571877,0.000018945258,0.00009627055,0.0035381413],"genre_scores_gemma":[0.972742,0.00069467456,0.017637227,0.0003167568,0.000115001174,0.00019305691,0.0000040069426,0.0000074550007,0.0082897805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99951375,0.000023855797,0.00015012242,0.0001472644,0.00006716736,0.00009786491],"domain_scores_gemma":[0.99932134,0.00021852701,0.00004782733,0.0003275057,0.00005363559,0.00003115343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011667009,0.000058899514,0.000077748904,0.000035052195,0.00023367956,0.000045495977,0.00042892422,0.000028359907,0.0000075160083],"category_scores_gemma":[0.000020308054,0.000039838786,0.0000318443,0.00033620175,0.00004269991,0.000078866855,0.00012145661,0.00006136791,0.000020176227],"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.0000016079016,0.000016292617,0.000015875914,0.0000129404925,0.000009568849,5.7588792e-8,0.00005821925,0.0000020684017,0.0005310548,0.95429033,0.00012164213,0.04494035],"study_design_scores_gemma":[0.0005737129,0.000048781632,0.0015566046,0.00002902122,0.00002679174,0.0000051559587,0.00006120492,0.07227538,0.022872323,0.37903747,0.5232817,0.000231872],"about_ca_topic_score_codex":0.0000018170755,"about_ca_topic_score_gemma":7.384229e-7,"teacher_disagreement_score":0.9642778,"about_ca_system_score_codex":0.000003207039,"about_ca_system_score_gemma":0.000033361,"threshold_uncertainty_score":0.17972979},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010467609,0.00012250025,0.99790955,0.00018994819,0.00010351362,0.00036002495,0.0000028945383,0.00022329594,0.000041512227],"genre_scores_gemma":[0.41707474,0.0000010297769,0.5827095,0.0000109763,0.00003262082,0.00011627648,0.0000011777717,0.000012877259,0.000040811046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987939,0.000024213756,0.00027097965,0.00034868935,0.00015095672,0.00041128602],"domain_scores_gemma":[0.99881166,0.0007277856,0.00004491946,0.00024731763,0.00006980655,0.00009851632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033618358,0.000198475,0.0002823849,0.00014075832,0.0002819488,0.00016225343,0.00019893171,0.000094246614,0.000002780764],"category_scores_gemma":[0.00009585071,0.00015856877,0.00005671255,0.0003975073,0.00002879712,0.0001755829,0.000084857,0.00020912837,0.0000012451226],"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.0000034550144,0.0000461383,9.033223e-8,0.00029626655,0.000023931636,4.381607e-7,0.0003239648,0.594793,0.000038158312,0.40418142,8.3593466e-7,0.00029228066],"study_design_scores_gemma":[0.00013697123,0.00003597875,2.0901805e-7,0.00042673244,0.000036850284,0.000012242576,0.00001004925,0.6804771,0.000030005203,0.31868944,0.0000052864534,0.00013914285],"about_ca_topic_score_codex":0.0000029438963,"about_ca_topic_score_gemma":5.6876722e-8,"teacher_disagreement_score":0.41602796,"about_ca_system_score_codex":0.000024012419,"about_ca_system_score_gemma":0.000044134667,"threshold_uncertainty_score":0.6466247},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27586693,0.0017539095,0.7213877,0.0001948649,0.00011829957,0.00012330241,0.000011074267,0.00013264753,0.00041131565],"genre_scores_gemma":[0.96559775,0.00009684608,0.03413524,0.000037348305,0.00003592383,0.000003526189,0.0000014207269,0.0000054554102,0.00008649231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993373,0.000048879676,0.00017650893,0.00023984295,0.00008485205,0.0001126163],"domain_scores_gemma":[0.9994235,0.00022855883,0.000035673787,0.00023611731,0.000028223227,0.000047909594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002484777,0.00009503237,0.00012786254,0.00009311571,0.00004468214,0.000099198995,0.00027187052,0.00003332446,0.000027885699],"category_scores_gemma":[0.000005214889,0.00006810142,0.000044922093,0.00026846246,0.00004612221,0.00037424758,0.000058062444,0.000053266125,0.0000072720477],"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.000027048041,0.00020959164,0.00030008415,0.0006187347,0.00009116805,0.000024132032,0.0058987914,0.00193186,0.21774454,0.5412992,0.0001404433,0.23171435],"study_design_scores_gemma":[0.00014168143,0.000022839302,0.00029368768,0.000070963084,0.0000094958905,0.000016705138,0.000050907536,0.9020759,0.08330028,0.01260747,0.0012894712,0.000120608966],"about_ca_topic_score_codex":0.000027093445,"about_ca_topic_score_gemma":0.0000020441648,"teacher_disagreement_score":0.90014404,"about_ca_system_score_codex":0.000005541382,"about_ca_system_score_gemma":0.000021202626,"threshold_uncertainty_score":0.27770954},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65811807,0.00013534098,0.2677768,0.022312708,0.0036198688,0.0016368871,0.000007793937,0.0003631891,0.046029326],"genre_scores_gemma":[0.99588907,0.00004859374,0.0023259148,0.0007640457,0.000027451235,0.000028435485,2.0428755e-7,0.000006152784,0.00091012823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981039,0.000041958763,0.0006119759,0.0005454079,0.0003284294,0.00036829544],"domain_scores_gemma":[0.99875015,0.0001831262,0.00025372265,0.0003939537,0.00035616764,0.000062864274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075167,0.00022837108,0.0003079337,0.00029133985,0.00011744146,0.00023048713,0.0023603837,0.000113701244,0.00008234639],"category_scores_gemma":[0.00033196702,0.00017903015,0.00013011994,0.0015381257,0.00019252754,0.00041436317,0.00045678334,0.0003769515,0.000043863303],"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.00008097223,0.00009505473,0.0002678612,0.00004476306,0.000009778366,0.0000011404923,0.0009989933,0.000022171762,0.025147716,0.9364222,0.00011275469,0.036796574],"study_design_scores_gemma":[0.000044411507,0.00008312723,0.0001520053,0.0003039173,0.000005013889,0.0000012613501,0.00019753232,0.047084942,0.49604446,0.4557955,0.00014015328,0.00014769463],"about_ca_topic_score_codex":0.0000636909,"about_ca_topic_score_gemma":0.00003933767,"teacher_disagreement_score":0.48062673,"about_ca_system_score_codex":0.00003255655,"about_ca_system_score_gemma":0.00010437838,"threshold_uncertainty_score":0.73006374},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003877371,0.00036355486,0.7980885,0.0027657917,0.00019690354,0.0012733574,0.000015919839,0.00014108731,0.19327751],"genre_scores_gemma":[0.9337056,0.00012005635,0.06393696,0.0013555305,0.000062112464,0.00047786036,0.0000074950103,0.000010256816,0.00032411644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933857,0.000025716863,0.00020527541,0.00017184242,0.00010447281,0.00015411383],"domain_scores_gemma":[0.999274,0.00028023997,0.000064697255,0.00034550397,0.00001206616,0.000023496104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005344654,0.00010261221,0.00017492408,0.000068637724,0.00008813005,0.000091282716,0.00034526768,0.00003699538,0.000019481557],"category_scores_gemma":[0.000022229717,0.000066276625,0.00002603029,0.00026590348,0.00013993923,0.000098489676,0.00022376195,0.00009933673,0.000013164185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065506038,0.000018667004,0.0000018652863,0.000062815794,0.000006650346,0.0000014548148,0.001822252,7.531515e-7,0.000045337576,0.987263,0.000114283364,0.010656368],"study_design_scores_gemma":[0.0011741255,0.000007348324,0.00004991139,0.00008605001,0.000012006342,0.0000036695612,0.0004195302,0.05381698,0.00050763966,0.9422214,0.0015785208,0.00012281314],"about_ca_topic_score_codex":0.000003855264,"about_ca_topic_score_gemma":0.0000037409916,"teacher_disagreement_score":0.9298282,"about_ca_system_score_codex":0.000013488684,"about_ca_system_score_gemma":0.000016480864,"threshold_uncertainty_score":0.27026823},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016516855,0.00018391288,0.9811804,0.001782279,0.00007428578,0.00004525445,0.000008945182,0.000008117352,0.00019994282],"genre_scores_gemma":[0.8756815,0.000020215168,0.12326428,0.000707836,0.00018868064,0.0000023223856,0.00002048772,0.0000030957776,0.00011155623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983158,0.00021717741,0.000699911,0.00022209373,0.00039146666,0.00015353567],"domain_scores_gemma":[0.99857026,0.00057871966,0.00035297783,0.00014226115,0.00028801232,0.00006774619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011744573,0.00013711085,0.00058873504,0.0019042476,0.00014799181,0.00009139687,0.00033024186,0.00009527617,0.00003206524],"category_scores_gemma":[0.00010014068,0.0001106572,0.0005731221,0.0044365735,0.000029460109,0.0003091536,0.000069764246,0.0002642454,0.0000011079173],"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.0005060555,0.0015824139,0.08622651,0.00006965729,0.027567295,0.00007453276,0.0012464226,0.7234961,0.00025819812,0.14630702,0.00019904737,0.012466761],"study_design_scores_gemma":[0.0007483617,0.000055925662,0.035927773,0.000005537285,0.0018542832,0.0000038846074,0.00001480594,0.95469624,0.000015494536,0.0064562894,0.000115800874,0.00010557816],"about_ca_topic_score_codex":0.00004444341,"about_ca_topic_score_gemma":0.000019373065,"teacher_disagreement_score":0.85916466,"about_ca_system_score_codex":0.000025240712,"about_ca_system_score_gemma":0.00011182178,"threshold_uncertainty_score":0.45124698},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31220764,0.0003861616,0.6842877,0.0003279338,0.0018534284,0.00009820803,4.8520195e-7,0.000028607656,0.0008097788],"genre_scores_gemma":[0.89576066,0.0000017802887,0.10394332,0.00010499296,0.00006910342,4.054585e-7,8.884404e-8,0.0000035100309,0.000116122836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975,0.00076285924,0.00058347604,0.00045742124,0.00036095476,0.0003353053],"domain_scores_gemma":[0.9973851,0.0013388508,0.00032785494,0.00059436494,0.0002669169,0.00008693469],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.017133439,0.00013579917,0.00022294531,0.00022043019,0.0014795322,0.0011484949,0.0012318048,0.00003614858,0.000009890575],"category_scores_gemma":[0.0008351491,0.00008801141,0.00010147574,0.0012294233,0.0002934071,0.00026092172,0.0007256959,0.00044506523,0.0000019719264],"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.000009245346,0.00009777701,0.00044323172,0.00008118029,0.000022490914,0.0000064491633,0.0029378035,0.00079413946,0.03658149,0.12525403,0.00006956241,0.8337026],"study_design_scores_gemma":[0.00042244166,0.0000950141,0.00077047176,0.00024723326,0.000014355015,0.00007712438,0.00083935616,0.898568,0.08553792,0.011842112,0.0013832538,0.00020273686],"about_ca_topic_score_codex":0.0000029685812,"about_ca_topic_score_gemma":2.9806736e-7,"teacher_disagreement_score":0.89777386,"about_ca_system_score_codex":0.000042506905,"about_ca_system_score_gemma":0.00021363434,"threshold_uncertainty_score":0.9998884},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07645365,0.012235076,0.9037918,0.005079206,0.0010027576,0.00040961173,0.000007978316,0.00002019305,0.000999745],"genre_scores_gemma":[0.993829,0.00044486794,0.005039686,0.00016586392,0.00020233865,0.00000409782,1.6190361e-7,0.0000066961734,0.00030726488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986378,0.0001901051,0.0004598809,0.00012249396,0.00033883352,0.00025090828],"domain_scores_gemma":[0.99690664,0.0019411677,0.0005747334,0.00029431292,0.00026154553,0.000021601943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016207956,0.00011363642,0.00024102362,0.00024202703,0.00017911164,0.000026984575,0.0012516819,0.000043659806,0.000008614959],"category_scores_gemma":[0.0004608112,0.000058176163,0.0003037244,0.0011536776,0.00011090808,0.00014325282,0.00010447585,0.00032637618,7.6980433e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009166695,0.000102535625,0.00006563183,0.000029358487,0.00019132275,3.4388412e-7,0.0002750545,0.0005107146,0.0011349311,0.97281337,0.00012682144,0.024658259],"study_design_scores_gemma":[0.0010807392,0.0011534907,0.0017998085,0.0002293052,0.00013772756,0.00004640911,0.00013170949,0.01719514,0.28606576,0.68346786,0.0085326275,0.000159465],"about_ca_topic_score_codex":0.0000035511343,"about_ca_topic_score_gemma":0.0000015248326,"teacher_disagreement_score":0.9173754,"about_ca_system_score_codex":0.00005779352,"about_ca_system_score_gemma":0.0005615006,"threshold_uncertainty_score":0.2372355},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010597633,0.0018338755,0.97900933,0.0013394777,0.000057019242,0.00024026245,0.00000922313,0.000092224785,0.0068209562],"genre_scores_gemma":[0.9235748,0.00043135113,0.07349251,0.00036686583,0.00010483135,0.0001186594,0.0000075905577,0.000006316636,0.0018970818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994749,0.000020535957,0.00015560705,0.0001759801,0.000066532644,0.000106460575],"domain_scores_gemma":[0.9995164,0.00011854846,0.00004780764,0.00022560464,0.000049801336,0.000041823372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010490833,0.000065067325,0.00011058659,0.00007090985,0.00011403277,0.000029922523,0.00034796546,0.000034082004,0.000021393074],"category_scores_gemma":[0.00000921776,0.00005751929,0.0000300613,0.00046000653,0.000025236073,0.00014484175,0.00013534953,0.000057796646,0.00002876042],"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.0000027983335,0.00005964723,0.000100663994,0.00004239073,0.000012359605,2.1808067e-7,0.00005780858,0.000021673313,0.0006384012,0.9709412,0.00022520244,0.027897624],"study_design_scores_gemma":[0.0011160993,0.0001283281,0.0026789655,0.00006577366,0.00007468893,0.000020889613,0.00009682125,0.34023276,0.10457082,0.1602027,0.39028257,0.0005295689],"about_ca_topic_score_codex":0.000004693572,"about_ca_topic_score_gemma":3.3630707e-7,"teacher_disagreement_score":0.91297716,"about_ca_system_score_codex":0.0000031363334,"about_ca_system_score_gemma":0.000027021531,"threshold_uncertainty_score":0.23455685},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010336001,0.000019922898,0.9834035,0.00058719824,0.0012272418,0.00028638003,0.0000017314754,0.00019352557,0.0039445027],"genre_scores_gemma":[0.8533673,0.0000033440842,0.13378178,0.0010622318,0.00027730392,0.00009246862,0.0000035911155,0.000008692729,0.011403259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992897,0.000025405836,0.0001527181,0.00027776376,0.000070066504,0.0001843732],"domain_scores_gemma":[0.9995827,0.00004036507,0.00001859222,0.00023486532,0.00009486431,0.000028631686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002612176,0.00008665354,0.00009913628,0.000101138896,0.00018971892,0.00016525976,0.00036775047,0.000050099734,0.000026760737],"category_scores_gemma":[0.0000293606,0.00007348535,0.000044015203,0.00038681075,0.00001035382,0.0002755914,0.00009633507,0.00006029561,0.000014181277],"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.000010500767,0.0000415936,0.000015663742,0.00002582736,0.000021251662,8.530533e-7,0.00014514475,0.002748091,0.0009085239,0.92518276,0.0018389705,0.06906084],"study_design_scores_gemma":[0.000498019,0.00004231096,0.0000058263777,0.000011867875,0.0000062633617,0.0000024094334,0.000038101625,0.9604846,0.008108337,0.024572324,0.0060856333,0.0001442972],"about_ca_topic_score_codex":0.00007994507,"about_ca_topic_score_gemma":0.0000069564667,"teacher_disagreement_score":0.9577365,"about_ca_system_score_codex":0.000029464709,"about_ca_system_score_gemma":0.000118628064,"threshold_uncertainty_score":0.2996646},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01243241,0.08677817,0.8357293,0.016902957,0.00089950697,0.006263524,0.000038593196,0.00038737874,0.040568158],"genre_scores_gemma":[0.9873089,0.0056163482,0.0018752693,0.0011040642,0.0003775203,0.0009829241,0.000013778773,0.000026135556,0.0026950259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653137,0.0012798794,0.0002959728,0.00046490127,0.0008147074,0.00061315007],"domain_scores_gemma":[0.9977153,0.0011515516,0.00006129332,0.00076099776,0.00021763021,0.00009322776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043327846,0.0001506888,0.00037039054,0.000119134114,0.00031287433,0.00022527804,0.0011378066,0.000029918223,0.00001723083],"category_scores_gemma":[0.00029331542,0.000089564695,0.000084750536,0.0021852641,0.00014065005,0.00035265496,0.0002946434,0.00071129535,0.00019210634],"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.000013177223,0.00040847922,0.00005188537,0.002591102,0.000047445057,0.000073022784,0.0004199654,0.000023346047,0.00086363254,0.92289895,0.0048786215,0.06773035],"study_design_scores_gemma":[0.0033354699,0.00080640684,0.0014489326,0.046103742,0.000088545756,0.00007876921,0.0010611914,0.37509686,0.021460079,0.18716086,0.36177725,0.0015818988],"about_ca_topic_score_codex":0.000091857655,"about_ca_topic_score_gemma":0.000022970808,"teacher_disagreement_score":0.9748765,"about_ca_system_score_codex":0.00011028229,"about_ca_system_score_gemma":0.00023220139,"threshold_uncertainty_score":0.36523423},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012887493,0.00048203472,0.045217488,0.0049961875,0.0012513809,0.003122234,0.000084042455,0.0007970865,0.93116206],"genre_scores_gemma":[0.65359145,0.000098231954,0.021697214,0.0023446304,0.0004423292,0.000050638693,0.000054213895,0.0001232982,0.32159802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99476725,0.00050866423,0.00074141065,0.0015294364,0.00084575376,0.0016074771],"domain_scores_gemma":[0.9962489,0.0003484574,0.000533977,0.0015783125,0.0004957566,0.00079458917],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00075934816,0.00090568623,0.0007665094,0.00060065486,0.00088139385,0.0010980401,0.002608632,0.0005970288,0.0014198505],"category_scores_gemma":[0.000024930658,0.00091348833,0.00044590383,0.0005283973,0.000481151,0.001997943,0.0014684628,0.0011317724,0.0022306016],"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.00012823728,0.00050807995,0.00029567655,0.00054239226,0.00051943463,0.0005830436,0.014644792,0.00018743731,0.001465324,0.7300772,0.061562873,0.18948554],"study_design_scores_gemma":[0.008047555,0.0017018974,0.00047766315,0.0013952864,0.00051648886,0.0006365195,0.0037375921,0.02023493,0.0060061635,0.21517234,0.737384,0.0046895356],"about_ca_topic_score_codex":0.0018448251,"about_ca_topic_score_gemma":0.00022994491,"teacher_disagreement_score":0.6758212,"about_ca_system_score_codex":0.0004307877,"about_ca_system_score_gemma":0.00059414847,"threshold_uncertainty_score":0.9999389},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107079156,0.000018800367,0.8917305,0.00069523294,0.00013787518,0.00014635819,0.00002400894,0.00007437977,0.00009372762],"genre_scores_gemma":[0.9839661,0.00008784827,0.015741864,0.000100933896,0.0000026016933,0.000015676134,0.0000024989329,0.000006442148,0.00007600047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991015,0.000074554824,0.00020382258,0.00029201122,0.00015633268,0.00017176392],"domain_scores_gemma":[0.9985906,0.00018394132,0.00006177228,0.0010577785,0.000067331304,0.000038579416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015037306,0.00012987801,0.00016021286,0.0005212429,0.00014392573,0.000031545474,0.0009633046,0.00007061024,0.0000080411],"category_scores_gemma":[0.000023739396,0.00012356143,0.00006289161,0.0015900771,0.000066534354,0.00030984075,0.000028712617,0.0002929704,0.0000014545411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039999106,0.0033198923,0.024124809,0.00044962074,0.00070360035,0.00008470364,0.009184371,0.056937113,0.0015029429,0.7376957,0.000030142142,0.1655671],"study_design_scores_gemma":[0.0057339855,0.0015305106,0.22174887,0.0020375832,0.0002300452,0.000032861186,0.0014126232,0.20513113,0.025173571,0.534373,0.0007670551,0.0018287683],"about_ca_topic_score_codex":0.000074142015,"about_ca_topic_score_gemma":0.00056756847,"teacher_disagreement_score":0.87688696,"about_ca_system_score_codex":0.00003321462,"about_ca_system_score_gemma":0.000068196736,"threshold_uncertainty_score":0.5038689},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001926918,0.0001453183,0.99614316,0.0008431022,0.0002636745,0.00022077201,7.613026e-7,0.000026634529,0.00042965738],"genre_scores_gemma":[0.3703229,0.000066964865,0.6289135,0.00040201252,0.00023018094,0.0000121540015,0.0000016951938,0.000008304168,0.00004224613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990053,0.000021558471,0.00045647324,0.00018028151,0.00017250246,0.00016387399],"domain_scores_gemma":[0.99923956,0.0001453644,0.00027218682,0.0001044716,0.00015878558,0.000079639336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006291207,0.000114895134,0.00024466304,0.0001421576,0.0003663855,0.00013391972,0.00027827948,0.000068814195,0.0000044246935],"category_scores_gemma":[0.00006133217,0.00009122672,0.00006233256,0.00030618414,0.000022710143,0.0003216347,0.00033058383,0.00014037664,3.5891105e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002303342,0.00018120589,0.000023645991,0.00011576318,0.00006955347,0.0000055329924,0.0014104254,0.6672672,0.00994109,0.070636176,0.0002167136,0.24990235],"study_design_scores_gemma":[0.0008938387,0.00012717217,0.000013642584,0.000054671204,0.000015616275,0.000011141563,0.000028623563,0.98199266,0.0032517116,0.012216338,0.0012851794,0.000109402135],"about_ca_topic_score_codex":0.0000011208508,"about_ca_topic_score_gemma":2.9079102e-8,"teacher_disagreement_score":0.36839598,"about_ca_system_score_codex":0.000033326967,"about_ca_system_score_gemma":0.00006688036,"threshold_uncertainty_score":0.37201178},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022641952,0.0010212134,0.13903873,0.0002208482,0.00045601255,0.00045581802,0.00001728194,0.00022130153,0.85854614],"genre_scores_gemma":[0.00008891085,0.00027662472,0.16271168,0.0003174077,0.00016364444,0.00001818801,0.000006125168,0.000048111964,0.83636934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980502,0.00002745927,0.0006582214,0.0005962091,0.00033615806,0.0003317188],"domain_scores_gemma":[0.9979734,0.0004353514,0.00026551558,0.0011435272,0.000069664726,0.000112535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006181454,0.00046956894,0.00067510025,0.0003408506,0.00010158574,0.00016564272,0.0011293315,0.00039480638,0.0000900377],"category_scores_gemma":[0.00007872751,0.000443472,0.00013798705,0.000067943925,0.00016079396,0.00016562278,0.0008149866,0.0006139677,0.00013758776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017013692,0.000025217518,8.0053525e-7,0.00044364572,0.000030378058,0.00006808109,0.0005630202,0.000002737415,0.0000044643602,0.985418,0.0015061068,0.011935835],"study_design_scores_gemma":[0.00023818374,0.000038135575,8.440994e-7,0.0009125289,0.000028756202,0.000037131686,0.000013555813,0.01796451,0.00008336018,0.909813,0.07043084,0.00043916],"about_ca_topic_score_codex":0.0000017145029,"about_ca_topic_score_gemma":0.000003433832,"teacher_disagreement_score":0.07560502,"about_ca_system_score_codex":0.000055677447,"about_ca_system_score_gemma":0.00012934004,"threshold_uncertainty_score":0.9998017},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32253197,0.00008825854,0.67647165,0.00026239466,0.0001455455,0.00016198048,0.00012735545,0.00005369653,0.00015717071],"genre_scores_gemma":[0.9506529,0.0000070296196,0.049068317,0.00007549176,0.0000593284,0.000022683622,0.000020795042,0.000008009391,0.00008544205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987276,0.00007810677,0.00038875823,0.00020868,0.00020266732,0.00039416604],"domain_scores_gemma":[0.9986769,0.00028216254,0.00015766243,0.00050913746,0.00013143042,0.00024268722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000611996,0.00016186628,0.00042445757,0.00032492683,0.00017830907,0.00009272658,0.00038873142,0.00005722481,0.000047101326],"category_scores_gemma":[0.000272522,0.0001402388,0.00014994005,0.0010180469,0.000041127783,0.00037262653,0.00026120766,0.00008058138,0.000015946158],"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.000008896684,0.0003470227,0.013157851,0.000133113,0.000907953,0.0000037373334,0.0067213974,0.0011708474,0.0035371098,0.97123176,0.00023179076,0.002548526],"study_design_scores_gemma":[0.00094200246,0.00016136395,0.017070144,0.00014720397,0.001839182,0.000051151834,0.0008863168,0.9548039,0.011246902,0.0115370955,0.00047354624,0.0008411782],"about_ca_topic_score_codex":0.000010237024,"about_ca_topic_score_gemma":0.0000076289116,"teacher_disagreement_score":0.9596947,"about_ca_system_score_codex":0.00004999589,"about_ca_system_score_gemma":0.000019583144,"threshold_uncertainty_score":0.57187724},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079130076,0.0008659618,0.91190666,0.0051660324,0.00008890004,0.00076221477,0.000042477703,0.00003669454,0.0020009596],"genre_scores_gemma":[0.9989624,0.00004255322,0.00041450158,0.00022633851,0.000013331685,0.00006859776,0.0000014795012,0.000002019866,0.00026879093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994434,0.000048285925,0.00014676547,0.0001898118,0.000081307066,0.000090432164],"domain_scores_gemma":[0.9994701,0.00014669615,0.000054185955,0.0002819501,0.000025337567,0.00002173222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014704945,0.0000696329,0.000077067176,0.000021261343,0.0001380358,0.00003438956,0.00029657784,0.000032083775,0.0000033115994],"category_scores_gemma":[0.000015961421,0.00004144895,0.000021457216,0.00046871067,0.00009158503,0.00006119848,0.000114225804,0.00008284285,0.0000022665415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005813026,0.000034068176,0.0003661365,0.000025170757,0.0000048622574,5.1141157e-8,0.00006314653,0.0001923631,0.000026790185,0.9888305,0.000063485444,0.010387616],"study_design_scores_gemma":[0.00091315905,0.00009130723,0.023972034,0.00023154062,0.00003785989,0.000002896462,0.00037470786,0.23423177,0.0017176308,0.71774465,0.020423107,0.00025935165],"about_ca_topic_score_codex":0.0000104212595,"about_ca_topic_score_gemma":0.000021482094,"teacher_disagreement_score":0.9198323,"about_ca_system_score_codex":0.000010810599,"about_ca_system_score_gemma":0.00002454644,"threshold_uncertainty_score":0.16902392},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007486596,0.000012703629,0.9842409,0.00027779004,0.000052660293,0.00022988995,0.00000915424,0.00006998395,0.0076203467],"genre_scores_gemma":[0.20775373,0.0000022018353,0.79189,0.00020294778,0.00002102534,0.000024356224,0.000012042991,0.000007829326,0.0000858481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989374,0.000032363576,0.00038311645,0.00022104899,0.0002889577,0.0001371101],"domain_scores_gemma":[0.99844116,0.0009371429,0.00018390261,0.00026201806,0.000119499164,0.000056260866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030787283,0.00015345313,0.0002662254,0.00012414933,0.0000978608,0.000078770725,0.00028139874,0.000049903796,0.000017447417],"category_scores_gemma":[0.00009291748,0.00013335691,0.00007949024,0.00035324067,0.000108179054,0.0002040525,0.00009554661,0.00009077291,0.000021440772],"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.000003890275,0.0003577615,0.0000020916611,0.00065772404,0.000020351677,6.0440425e-7,0.00024372587,0.05219089,0.000031475323,0.94365436,0.00015550862,0.0026816244],"study_design_scores_gemma":[0.0001816248,0.000027942166,0.000010910378,0.00011573572,0.000011015204,0.0000010190628,0.000024127772,0.51024556,0.00034002695,0.48896822,0.000010987284,0.00006284577],"about_ca_topic_score_codex":2.286078e-7,"about_ca_topic_score_gemma":2.8224722e-8,"teacher_disagreement_score":0.45805466,"about_ca_system_score_codex":0.000013968468,"about_ca_system_score_gemma":0.000066181594,"threshold_uncertainty_score":0.5438137},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006661865,0.000036436697,0.9939856,0.00066030363,0.0002782057,0.0013350149,0.00032108146,0.00012586275,0.0025913431],"genre_scores_gemma":[0.07566749,0.000004097652,0.921638,0.00008688157,0.000034951496,0.00016633024,0.00011856762,0.0000086585405,0.0022750173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979201,0.00029622013,0.0006308634,0.00059891737,0.00027840864,0.00027552043],"domain_scores_gemma":[0.99787366,0.0003819029,0.000451302,0.00072432664,0.000502575,0.00006624454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010407504,0.00028740088,0.0006555346,0.00032933144,0.00009905821,0.00005666839,0.0010806079,0.00020167018,0.000053658972],"category_scores_gemma":[0.00007199444,0.00023092247,0.00022383772,0.00043123256,0.00015478757,0.00016041334,0.00060206605,0.00036992438,0.0000011504077],"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.00016767668,0.0005588458,0.000021639655,0.0011759783,0.00038460217,0.000002319915,0.0014529241,0.007383859,0.0015515763,0.9438107,0.00032244026,0.043167464],"study_design_scores_gemma":[0.0006362523,0.00025872502,0.0002159991,0.00023571949,0.0000646591,0.0000034330021,0.00009685258,0.8490504,0.012855013,0.13624649,0.000082805185,0.00025366398],"about_ca_topic_score_codex":0.0003670033,"about_ca_topic_score_gemma":0.00007107939,"teacher_disagreement_score":0.8416665,"about_ca_system_score_codex":0.0000815032,"about_ca_system_score_gemma":0.00056102796,"threshold_uncertainty_score":0.94167453},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006639605,0.0007133339,0.9841375,0.0019774006,0.00024049569,0.00008409877,2.4102195e-7,0.000022599172,0.0061847456],"genre_scores_gemma":[0.9938506,0.00021377859,0.0009827171,0.00009508919,0.000074693,0.0000028381965,1.1988746e-7,0.0000033858094,0.004776771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864316,0.00012483756,0.00019694344,0.0001201038,0.000140686,0.0007742825],"domain_scores_gemma":[0.99950093,0.00007856502,0.000092224436,0.00023982194,0.00006660752,0.00002186284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017685944,0.00007234309,0.000098229866,0.00009058427,0.0002811314,0.000078611665,0.00091324834,0.000029451456,0.000009396701],"category_scores_gemma":[0.000025876405,0.000047048732,0.00008303392,0.0004959363,0.000093997194,0.00021214155,0.00013213979,0.00094935356,0.000009611095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005893537,0.000021101656,0.00003054368,0.0000029666728,0.00004963514,0.0000010272897,0.00014663718,0.0002957976,0.00007443098,0.94560575,0.000116081355,0.05365016],"study_design_scores_gemma":[0.00035763351,0.00015812139,0.00009672086,0.000035357352,0.000020325611,0.00037307348,0.0020009498,0.017289583,0.0021416873,0.97327477,0.004155058,0.00009673936],"about_ca_topic_score_codex":0.00002071916,"about_ca_topic_score_gemma":0.000036590944,"teacher_disagreement_score":0.987211,"about_ca_system_score_codex":0.00016078647,"about_ca_system_score_gemma":0.0016843629,"threshold_uncertainty_score":0.41245216},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006878769,0.00016014965,0.989072,0.005665007,0.00077609747,0.00012174156,0.0000030976535,0.0000483112,0.003465686],"genre_scores_gemma":[0.34525222,0.0014197876,0.6384022,0.004852085,0.0008737598,0.00003697862,0.000017791484,0.000041057658,0.009104078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989001,0.00018572719,0.00026845295,0.00021766486,0.00024624128,0.00018181227],"domain_scores_gemma":[0.99899924,0.0003626449,0.00015365276,0.00026591925,0.00014347078,0.000075090575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063835416,0.00013354674,0.00011713571,0.00015950647,0.00062199146,0.00021831211,0.0004125149,0.00006377519,0.00014689555],"category_scores_gemma":[0.00017601025,0.000093690775,0.000054060627,0.0004533866,0.00006363403,0.00038967907,0.00008577302,0.0003780852,0.000022224263],"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.000013430955,0.00004686344,0.000033764238,0.000003978653,0.00003277165,0.00000782826,0.00023352675,0.5219141,0.0000074544228,0.46066958,0.0017005806,0.0153360935],"study_design_scores_gemma":[0.00028587892,0.00010954199,0.00010469888,0.00007897468,0.000011680188,0.000024431638,0.000058705955,0.97611207,0.00022130682,0.021866405,0.0010230009,0.00010328911],"about_ca_topic_score_codex":0.0000011927544,"about_ca_topic_score_gemma":2.2613435e-7,"teacher_disagreement_score":0.45419797,"about_ca_system_score_codex":0.000053243857,"about_ca_system_score_gemma":0.00009521725,"threshold_uncertainty_score":0.47839186},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011483459,0.000024643436,0.99028176,0.002302328,0.00031350125,0.00067778036,0.0000017824301,0.0001126472,0.0061707315],"genre_scores_gemma":[0.09706075,0.0000011916015,0.90008354,0.00227068,0.00005934703,0.0002738361,0.0000032548726,0.000010359913,0.00023705544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890465,0.00007790326,0.00034712636,0.00025968527,0.00017325158,0.0002373843],"domain_scores_gemma":[0.9958238,0.003369037,0.00013032716,0.00058884127,0.00004619353,0.000041812586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012644422,0.00014835793,0.00020140636,0.00006494804,0.00042322348,0.00020541933,0.00070384826,0.000040528623,0.000008058828],"category_scores_gemma":[0.00021335242,0.00010175515,0.00008542781,0.0004355919,0.000038933573,0.00004634897,0.0001973791,0.00013003321,0.000039799314],"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.000004344354,0.00014667706,8.572536e-8,0.00003382281,0.00002116951,1.2623825e-7,0.00063850504,0.004761437,0.00033469082,0.93618625,0.0003079462,0.05756494],"study_design_scores_gemma":[0.00023015797,0.000020070038,0.0000017700617,0.000020058951,0.000014582293,5.7156507e-7,0.00003919815,0.67264074,0.0019856598,0.3228784,0.002089168,0.000079634505],"about_ca_topic_score_codex":9.557979e-7,"about_ca_topic_score_gemma":4.3663505e-8,"teacher_disagreement_score":0.6678793,"about_ca_system_score_codex":0.000045233654,"about_ca_system_score_gemma":0.000029432764,"threshold_uncertainty_score":0.41494545},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026885485,0.000015778762,0.9836237,0.0024153793,0.000050902097,0.00036219935,0.0000013991548,0.000121734316,0.0107204],"genre_scores_gemma":[0.519275,2.4346116e-7,0.4800315,0.00029289266,0.00001445401,0.000044322147,7.341306e-7,0.000005863749,0.00033498672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874395,0.000217742,0.00031396578,0.00023499804,0.00022870398,0.0002606368],"domain_scores_gemma":[0.99750805,0.0017484423,0.00009322607,0.0005485646,0.000056844387,0.00004484575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015113042,0.00012579319,0.00025031494,0.000058689344,0.00016220071,0.00010990118,0.00068325194,0.00004300058,0.00007463481],"category_scores_gemma":[0.0006259457,0.00007716772,0.00010779335,0.00047408414,0.0002455192,0.00008076162,0.00034109148,0.00017499753,0.000028591141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005285141,0.00014532632,0.0000022857441,0.000103705504,0.000020266842,0.0000026282428,0.00022629093,0.000007656269,0.00006494248,0.91845137,0.0001256393,0.08084459],"study_design_scores_gemma":[0.00013646814,0.00006149831,0.000012697626,0.000063232095,0.000010466846,0.000004805788,0.0000615974,0.07702319,0.0040055295,0.9168632,0.0016795547,0.00007775676],"about_ca_topic_score_codex":0.0000036048311,"about_ca_topic_score_gemma":3.4743775e-7,"teacher_disagreement_score":0.5165865,"about_ca_system_score_codex":0.00001673087,"about_ca_system_score_gemma":0.000029522449,"threshold_uncertainty_score":0.31468084},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9043577,0.0006558037,0.07691326,0.004315931,0.0002248865,0.00027788893,0.0000053809613,0.00018119362,0.013067997],"genre_scores_gemma":[0.98767805,0.000060487077,0.008042451,0.00026815908,0.000024665731,0.000025783012,0.0000040750315,0.000004399837,0.003891912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9992323,0.000065509754,0.00017722049,0.00027735796,0.000065894834,0.0001817187],"domain_scores_gemma":[0.9994104,0.00011745047,0.000032528773,0.00036291577,0.000030364828,0.000046340476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002580325,0.000091117465,0.00010691277,0.0001565004,0.00010798537,0.000051458916,0.00042389354,0.000046479003,0.000016062717],"category_scores_gemma":[0.000026357744,0.00008569794,0.000019394773,0.0006405219,0.00004235281,0.00025875602,0.00017522089,0.00013450552,0.0000618047],"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.000006762681,0.00010178007,0.23349428,0.000065854685,0.000016116777,0.000016495263,0.0005521512,0.000056937923,0.00073883776,0.75143635,0.00096547266,0.012548943],"study_design_scores_gemma":[0.0013548394,0.000119380406,0.7218597,0.00024816862,0.000023886496,0.000029465638,0.00025735685,0.010634817,0.002921916,0.21672252,0.045190312,0.00063763827],"about_ca_topic_score_codex":0.000045194265,"about_ca_topic_score_gemma":0.000027629867,"teacher_disagreement_score":0.53471386,"about_ca_system_score_codex":0.00001660728,"about_ca_system_score_gemma":0.000055637734,"threshold_uncertainty_score":0.34946606},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97807866,0.000599782,0.005424083,0.0024845947,0.0043050656,0.00052904256,0.000011057619,0.00038191362,0.008185817],"genre_scores_gemma":[0.997668,0.000035562283,0.0002778922,0.0006845308,0.0000063259536,0.000068002366,0.000008221159,0.000008620694,0.0012428432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853104,0.00017437409,0.00027794993,0.00047020515,0.00020611752,0.0003402919],"domain_scores_gemma":[0.99895704,0.00021099704,0.00003449764,0.00066650566,0.00005107198,0.000079906145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003892992,0.0001982647,0.00023035695,0.00031492044,0.00021608466,0.00020780478,0.0009661307,0.0000936024,0.000012108472],"category_scores_gemma":[0.00007082116,0.0001895188,0.00008523563,0.0012760385,0.00006091869,0.000518809,0.00017220576,0.0002467446,0.000041152598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008463493,0.00027632667,0.000726971,0.000010785315,0.000015458201,0.000010916051,0.00018486807,0.00010513049,0.00044058522,0.9940728,0.00196783,0.0021798455],"study_design_scores_gemma":[0.0014050225,0.00012830207,0.0017547616,0.000072179326,0.000006226308,0.00000152209,0.0000349949,0.011014292,0.0073224306,0.9756238,0.0023393973,0.0002970627],"about_ca_topic_score_codex":0.000057317357,"about_ca_topic_score_gemma":0.0000075099965,"teacher_disagreement_score":0.019589357,"about_ca_system_score_codex":0.00005297189,"about_ca_system_score_gemma":0.00008079491,"threshold_uncertainty_score":0.77283525},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01575006,0.00027023067,0.97697836,0.001603503,0.0029988864,0.0020576357,0.000034428846,0.00010076407,0.00020613697],"genre_scores_gemma":[0.45194727,0.000044607805,0.5418842,0.0005190346,0.00043990664,0.0010437139,0.00005819455,0.000050154165,0.004012923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970561,0.0010187535,0.0006970721,0.00061802217,0.0003284452,0.00028159094],"domain_scores_gemma":[0.9964141,0.0012576364,0.00053108187,0.0013815403,0.00036043944,0.000055161305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004913912,0.00024456315,0.00036924123,0.00014197218,0.00029941098,0.000096377225,0.001842271,0.000208054,0.0000067352103],"category_scores_gemma":[0.00084947015,0.00015546185,0.0002622335,0.0007253001,0.000028662002,0.00014419392,0.0015261481,0.00040377368,0.0000068054583],"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.00003773396,0.000111146954,0.0017586659,0.0010413278,0.00025064062,7.043788e-7,0.010783877,0.5610643,0.0011118136,0.39572042,0.00027766585,0.027841719],"study_design_scores_gemma":[0.00020382354,0.000065329914,0.0009152139,0.0003445655,0.0000753563,0.0000025655809,0.0001364866,0.9770825,0.0063895322,0.012825267,0.0017577016,0.00020168479],"about_ca_topic_score_codex":0.00011455398,"about_ca_topic_score_gemma":0.000012771347,"teacher_disagreement_score":0.43619722,"about_ca_system_score_codex":0.000092176204,"about_ca_system_score_gemma":0.000232344,"threshold_uncertainty_score":0.633955},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11703851,0.0007208432,0.8720541,0.0055060564,0.0019892715,0.0008115507,0.00008744915,0.00022322239,0.0015690161],"genre_scores_gemma":[0.37261885,0.000585141,0.5550281,0.038715802,0.003429453,0.00074369815,0.00006275916,0.00015195501,0.028664233],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978365,0.00024686358,0.00036551766,0.00091365795,0.00027066766,0.00036684945],"domain_scores_gemma":[0.9978616,0.00014464729,0.00014429461,0.0015291206,0.00012715219,0.00019315645],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007790432,0.00036106305,0.0004031407,0.00011988704,0.00023911738,0.00030535596,0.0017853687,0.00016844453,0.0000646767],"category_scores_gemma":[0.000016685506,0.00026430035,0.00009163365,0.00022900657,0.00012454741,0.00013736456,0.0023399408,0.00045702647,0.000117753305],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041144558,0.00053337315,0.014933278,0.00027313878,0.0006266733,0.00007420422,0.009116708,0.0030042217,0.00033170654,0.15298079,0.0063105836,0.8117742],"study_design_scores_gemma":[0.0016813478,0.0006254466,0.03978068,0.00085000135,0.0001640909,0.00004938676,0.00033073578,0.3672638,0.005077593,0.032414928,0.54930896,0.0024530326],"about_ca_topic_score_codex":0.000103944825,"about_ca_topic_score_gemma":0.00000912263,"teacher_disagreement_score":0.80932117,"about_ca_system_score_codex":0.00003780552,"about_ca_system_score_gemma":0.00011031652,"threshold_uncertainty_score":0.9999809},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001557817,0.00088645064,0.9878245,0.003166779,0.0010131062,0.0010823183,0.00008620998,0.00015259742,0.0042302227],"genre_scores_gemma":[0.17666581,0.000206762,0.8100444,0.00011725053,0.000058977665,0.00033490753,0.0001394823,0.000035387784,0.01239702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933864,0.0046440824,0.0006343029,0.0006962953,0.0003675327,0.00027142817],"domain_scores_gemma":[0.9913648,0.0028747432,0.00073069683,0.0028179868,0.0021345988,0.000077220604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009190791,0.00025129653,0.0003837927,0.00016439284,0.00036324764,0.0002792702,0.003067313,0.00020553764,0.000008316369],"category_scores_gemma":[0.0018382787,0.00021252602,0.00030526586,0.0005690248,0.000110431094,0.00013670974,0.0024783732,0.00035839507,0.0000019062298],"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.0000036446827,0.00017513071,0.00008295158,0.0006721208,0.00005296595,2.0868033e-7,0.005081733,0.0032014835,0.000648813,0.96762323,0.00023898498,0.022218723],"study_design_scores_gemma":[0.00028836844,4.5772907e-7,0.00011227664,0.0021191605,0.000039573475,0.0000029321163,0.00007354543,0.90347934,0.051095653,0.035997517,0.0065398584,0.0002513303],"about_ca_topic_score_codex":0.00034431278,"about_ca_topic_score_gemma":0.000119591095,"teacher_disagreement_score":0.9316257,"about_ca_system_score_codex":0.00008997658,"about_ca_system_score_gemma":0.00040209622,"threshold_uncertainty_score":0.86665595},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7779286,0.00076914154,0.1562614,0.0017142686,0.0044665956,0.0012074932,0.00008785419,0.0009959688,0.056568705],"genre_scores_gemma":[0.96285856,0.00009641367,0.016942045,0.00089475943,0.000545919,0.00010347512,0.000038381346,0.000037090216,0.018483335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761647,0.00027228403,0.0004935228,0.0009330151,0.0002327591,0.00045195647],"domain_scores_gemma":[0.9977496,0.000371028,0.00019111377,0.0015118377,0.00007073043,0.00010564135],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008057689,0.00037640074,0.0004903484,0.00025259083,0.00010199768,0.000113812326,0.0023977307,0.00030192418,0.00015188551],"category_scores_gemma":[0.00019628952,0.00036166032,0.00017858135,0.00037811248,0.00009464945,0.00015201073,0.0027946022,0.00082012074,0.0008133177],"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.00029309324,0.0021647566,0.094970904,0.003110589,0.0006891912,0.0031238014,0.011712043,0.010256683,0.0020787686,0.43406957,0.0044405637,0.43309003],"study_design_scores_gemma":[0.0018418238,0.000338473,0.030930126,0.0023817162,0.00012473582,0.00006014806,0.000070518865,0.67740774,0.008194793,0.24860804,0.02689416,0.0031477346],"about_ca_topic_score_codex":0.000026074697,"about_ca_topic_score_gemma":0.0000041270614,"teacher_disagreement_score":0.66715103,"about_ca_system_score_codex":0.0000748384,"about_ca_system_score_gemma":0.0002828265,"threshold_uncertainty_score":0.99996465},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061520975,0.00036557944,0.9363698,0.00052259833,0.000015281088,0.0005139994,0.00009995697,0.000035809546,0.0005560367],"genre_scores_gemma":[0.9086837,0.00008220248,0.09067794,0.00009072986,0.000014796503,0.00011907838,0.000026943437,0.000004164659,0.0003004522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992242,0.000021084348,0.00028032082,0.0002614129,0.00009275782,0.00012025077],"domain_scores_gemma":[0.99906135,0.0002353678,0.00016376044,0.00031998818,0.00017703607,0.000042486292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012139748,0.00009270152,0.0002792895,0.00021383549,0.00009969597,0.000021751446,0.00035146312,0.000034990397,0.000022898594],"category_scores_gemma":[0.000013111809,0.00007750468,0.00008257182,0.00146822,0.000091966955,0.00008676394,0.00006775221,0.000040931394,0.0000015602824],"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.000023981256,0.00013408475,0.00031810085,0.0001246978,0.00044506122,1.67437e-7,0.00013967715,0.00045318998,0.0033759302,0.99282885,0.000057280213,0.0020989666],"study_design_scores_gemma":[0.00092854194,0.00018976972,0.0047765,0.000031303247,0.0009848371,0.0000030062092,0.0002005533,0.95431316,0.020041818,0.009006881,0.009267299,0.00025633705],"about_ca_topic_score_codex":0.000008152441,"about_ca_topic_score_gemma":0.0000071472605,"teacher_disagreement_score":0.983822,"about_ca_system_score_codex":0.0000046549017,"about_ca_system_score_gemma":0.000056387416,"threshold_uncertainty_score":0.3160549},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015517422,0.0015917064,0.96620166,0.0053088046,0.000549606,0.000994344,0.000015620877,0.00023603915,0.009584823],"genre_scores_gemma":[0.9073528,0.001734673,0.0782054,0.0032998694,0.00027924107,0.00013373508,0.000075801574,0.00003827505,0.008880203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778754,0.000624628,0.00044944722,0.0005727137,0.00026699578,0.00029867236],"domain_scores_gemma":[0.99858284,0.0002431226,0.00015882844,0.00077709847,0.00015075038,0.000087331166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015164018,0.00024221237,0.00035424496,0.000102293154,0.00053257705,0.0005780404,0.0006067396,0.00013653965,0.000055405573],"category_scores_gemma":[0.00017203024,0.000180779,0.000091741924,0.00072607695,0.00014878904,0.0005287441,0.0006211335,0.00021149062,0.000019178688],"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.00016855559,0.00022333275,0.00037915286,0.00020348992,0.00013501849,0.000016245336,0.0016533,0.18045992,0.0001390293,0.80328345,0.0030377433,0.010300756],"study_design_scores_gemma":[0.0020084577,0.00004876101,0.00033853317,0.000087052154,0.00004309327,0.00002753197,0.00007191176,0.98435694,0.0013514906,0.007803128,0.00352931,0.0003338138],"about_ca_topic_score_codex":0.00005505584,"about_ca_topic_score_gemma":0.000002997562,"teacher_disagreement_score":0.8918354,"about_ca_system_score_codex":0.00005308599,"about_ca_system_score_gemma":0.00009533903,"threshold_uncertainty_score":0.7371954},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021175165,0.00034919605,0.4754289,0.0065315748,0.0109531125,0.0010134348,0.000038475777,0.00038470147,0.48412544],"genre_scores_gemma":[0.87005,0.00008690467,0.0030748546,0.00499944,0.00018572985,0.00003823492,0.000009106494,0.000012884227,0.121542856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970767,0.00026962312,0.00061244314,0.0010164077,0.00033828468,0.00068658084],"domain_scores_gemma":[0.99799335,0.00032637818,0.00016225674,0.0011669429,0.00013020867,0.00022088953],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006984362,0.00040205763,0.00041340615,0.000332976,0.0005526371,0.0005135751,0.0011776091,0.00017338684,0.0027658318],"category_scores_gemma":[0.000056822366,0.00036972648,0.0002506691,0.0007873102,0.00020087558,0.0004655294,0.00040875308,0.0003575351,0.0018229327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088603454,0.0003869443,0.000016804946,0.000057392095,0.00011477369,0.000032158205,0.0003563073,0.00027953953,0.00016780455,0.9410318,0.012637483,0.044830352],"study_design_scores_gemma":[0.0044526067,0.0012004712,0.0014757855,0.0006875587,0.00014656995,0.000026687569,0.00017921477,0.274326,0.107244276,0.52428687,0.08452992,0.0014440237],"about_ca_topic_score_codex":0.000023014902,"about_ca_topic_score_gemma":0.000008092085,"teacher_disagreement_score":0.8488748,"about_ca_system_score_codex":0.000103131075,"about_ca_system_score_gemma":0.00021129032,"threshold_uncertainty_score":0.9998755},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088343315,0.01722133,0.88209146,0.005023738,0.0056186067,0.00090445316,0.000053531512,0.000017171005,0.00072638417],"genre_scores_gemma":[0.99354184,0.0005118177,0.0047396123,0.00006858056,0.00068671146,0.000005892533,8.176881e-7,0.000015016798,0.00042972737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965607,0.00040087977,0.0016996248,0.00023728822,0.000501478,0.00060005905],"domain_scores_gemma":[0.9932148,0.0034926175,0.001530767,0.00052905816,0.0011538351,0.00007890653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034251781,0.0002592981,0.0007584525,0.00017260686,0.00038466984,0.000091619535,0.0010854971,0.00013838583,0.00020119025],"category_scores_gemma":[0.0012160663,0.00018972662,0.00065338984,0.00064580014,0.0003459463,0.00029613887,0.00018242889,0.0007180751,0.0000045423108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027995263,0.00034123508,0.00016097371,0.00013816102,0.0007328706,0.0000037296736,0.0005479184,0.00022602623,0.00033231484,0.9933494,0.0004984528,0.0033889995],"study_design_scores_gemma":[0.0028808934,0.0009617744,0.00013431151,0.0002517358,0.0005613741,0.00017859448,0.00015470003,0.029873643,0.018518819,0.9431879,0.0031026714,0.00019360473],"about_ca_topic_score_codex":0.000015385607,"about_ca_topic_score_gemma":0.0000049780638,"teacher_disagreement_score":0.9051985,"about_ca_system_score_codex":0.000111372065,"about_ca_system_score_gemma":0.0035020348,"threshold_uncertainty_score":0.7736827},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10562143,0.003964484,0.8312025,0.04598226,0.00020175379,0.0017547744,0.00004963672,0.00018061152,0.011042522],"genre_scores_gemma":[0.9940173,0.00011357204,0.0030554102,0.0016727311,0.00007730972,0.00016514894,0.0000022457696,0.0000049791006,0.0008912947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994683,0.00004511549,0.00011223092,0.00015769032,0.00011927474,0.00009736073],"domain_scores_gemma":[0.9992235,0.00034668567,0.000057113662,0.0003127399,0.00003693098,0.000023088412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013742519,0.00007078814,0.00007882216,0.000028028568,0.0002587425,0.00006496553,0.0004887026,0.0000227314,0.0000103806515],"category_scores_gemma":[0.000017464867,0.000034919645,0.000031451083,0.00041189458,0.000086216336,0.00007578041,0.00013691085,0.00009993199,0.00000967016],"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.0000058293062,0.00003884475,0.00016041998,0.0000148227045,0.000018805276,1.5325367e-7,0.00018558788,0.000012231699,0.00005888607,0.99166805,0.00026892842,0.0075674723],"study_design_scores_gemma":[0.00094758125,0.00017218296,0.009166513,0.00016541424,0.00012726992,0.0000227198,0.00026814677,0.060575973,0.014616949,0.23308256,0.6803925,0.000462154],"about_ca_topic_score_codex":0.0000033417257,"about_ca_topic_score_gemma":6.508309e-7,"teacher_disagreement_score":0.8883959,"about_ca_system_score_codex":0.0000046019204,"about_ca_system_score_gemma":0.00004199482,"threshold_uncertainty_score":0.19900644},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043616837,0.0246657,0.1542278,0.00003150691,0.0050923373,0.0013975631,0.00019544763,0.00078381825,0.81316966],"genre_scores_gemma":[0.9558351,0.000028634196,0.0009784689,0.000017688315,0.0003513739,0.000034824785,0.000022715647,0.000099818804,0.04263136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99745476,0.00009285472,0.00076659175,0.0005644717,0.0006781793,0.00044316766],"domain_scores_gemma":[0.9970934,0.00012070961,0.0012985287,0.000812659,0.00048532957,0.00018942206],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076429767,0.0005059067,0.0007835326,0.00048086603,0.00021776826,0.00031986882,0.0010500695,0.0003777311,0.000039341554],"category_scores_gemma":[0.000008341105,0.00041312084,0.00012260626,0.00027034417,0.00012396678,0.00075563625,0.00018904638,0.000398288,0.0000690363],"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.000037916445,0.000035121193,0.00005693093,0.002854325,0.00027804927,0.00004923949,0.001903895,0.00006584521,0.000016693426,0.99193054,0.0015642366,0.0012071943],"study_design_scores_gemma":[0.0046742484,0.0027530056,0.00035248822,0.059502482,0.001356563,0.006877039,0.0029319555,0.0127465185,0.00093548995,0.0021677134,0.89593774,0.009764731],"about_ca_topic_score_codex":0.000029590467,"about_ca_topic_score_gemma":0.0000018560183,"teacher_disagreement_score":0.98976284,"about_ca_system_score_codex":0.00008835351,"about_ca_system_score_gemma":0.00025924752,"threshold_uncertainty_score":0.99983203},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000012298194,0.00010818615,0.59559757,0.00006533647,0.0003678141,0.00030639966,0.000036422454,0.00007697373,0.40344006],"genre_scores_gemma":[0.0005462015,0.00002280288,0.22119915,0.00012710749,0.0001671331,0.000034271954,0.000060305185,0.000031837222,0.77781117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986362,0.000013071257,0.0004760747,0.00044880158,0.00019688281,0.00022900899],"domain_scores_gemma":[0.9986737,0.0001334813,0.00033602514,0.0006472995,0.00010970947,0.00009978244],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019041676,0.00028383816,0.00053471787,0.00013794156,0.00007371348,0.000039539424,0.00089914846,0.0002617713,0.0019808495],"category_scores_gemma":[0.000007487602,0.00025050805,0.0003037583,0.000024423565,0.00009182581,0.00022043438,0.0001702874,0.00017430281,0.00015326116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017007116,0.000042218384,0.0000027505944,0.00006560815,0.000076611555,0.0000010802357,0.00026250575,0.000059600825,0.000004652878,0.9569497,0.02488651,0.017631771],"study_design_scores_gemma":[0.0005555641,0.0003126682,0.000007677456,0.00009129989,0.000053558182,0.0000057808074,0.000006957565,0.03434821,0.0004972478,0.6886151,0.27497643,0.00052953477],"about_ca_topic_score_codex":0.0000058642886,"about_ca_topic_score_gemma":0.0000059212794,"teacher_disagreement_score":0.37439844,"about_ca_system_score_codex":0.000019149971,"about_ca_system_score_gemma":0.00007945287,"threshold_uncertainty_score":0.9999947},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6099636,0.0009822847,0.37710544,0.0038349128,0.003661962,0.00011067492,0.000004117772,0.000059506958,0.004277538],"genre_scores_gemma":[0.97427446,0.000022190325,0.024636991,0.00025459766,0.00042274184,8.8594317e-7,8.5881e-8,0.000005763003,0.000382312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992808,0.00013761513,0.0002157736,0.00009707915,0.0001537713,0.0001149316],"domain_scores_gemma":[0.99924195,0.0002250786,0.00010813876,0.00018896173,0.00010181418,0.0001340485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010155725,0.000079720725,0.00015073094,0.00007428668,0.00012012472,0.00014134521,0.0004255044,0.00004761322,0.00018473326],"category_scores_gemma":[0.00006775089,0.000055662982,0.000057734986,0.00012678755,0.000064339874,0.0004927726,0.00007202366,0.00032485928,0.000013851981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028265493,0.000057376445,0.00021639364,0.000004675631,0.00002679327,0.000044779776,0.00042579285,0.000011700216,0.010912063,0.9500775,0.00033197398,0.037862737],"study_design_scores_gemma":[0.0043703816,0.00092173537,0.02186904,0.00010594236,0.00011937519,0.0043571647,0.0002769928,0.0068101548,0.038408417,0.71913695,0.20254777,0.0010760513],"about_ca_topic_score_codex":4.0138164e-7,"about_ca_topic_score_gemma":1.539803e-7,"teacher_disagreement_score":0.36431086,"about_ca_system_score_codex":0.0000051681536,"about_ca_system_score_gemma":0.00004736328,"threshold_uncertainty_score":0.22698706},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09424587,0.005159126,0.8962415,0.00047212784,0.0010619494,0.00008564066,0.0000059174563,0.000064371845,0.0026635097],"genre_scores_gemma":[0.51693213,0.0003572738,0.4817725,0.00004692555,0.00036352343,0.0000010263137,2.8790936e-7,0.000020540936,0.00050575816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984889,0.000046641107,0.0007315047,0.00010990669,0.00044815053,0.0001748952],"domain_scores_gemma":[0.99874514,0.0003615798,0.0003932379,0.00027805803,0.0001400013,0.00008198075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013111621,0.0001266081,0.00032537183,0.00024903912,0.00003552936,0.00013801527,0.00090798835,0.000056899295,0.000060192975],"category_scores_gemma":[0.00007759747,0.00009067172,0.00022341275,0.0004291741,0.000047165497,0.000520524,0.00012308886,0.00022768829,0.00003817715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014933715,0.0003700155,0.000055635297,0.0018432831,0.00023119702,0.0004445077,0.005566777,0.0001352418,0.0025896197,0.9312668,0.0035657785,0.053916216],"study_design_scores_gemma":[0.00053870777,0.0006394222,0.0000665332,0.0018110956,0.00014344936,0.0038896205,0.00083796284,0.09494603,0.017442552,0.867692,0.011592105,0.00040052523],"about_ca_topic_score_codex":6.34386e-7,"about_ca_topic_score_gemma":1.57148e-7,"teacher_disagreement_score":0.42268628,"about_ca_system_score_codex":0.00002209271,"about_ca_system_score_gemma":0.000096360214,"threshold_uncertainty_score":0.36974853},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.861114,0.00077863445,0.13083273,0.0012846778,0.0007743858,0.0014403175,0.000096213495,0.00039937,0.0032796764],"genre_scores_gemma":[0.042778365,0.00053347903,0.037461318,0.000055917637,0.00022340413,0.000007301523,0.001049144,0.00003212075,0.91785896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9991607,0.00006422943,0.00010785619,0.00034951087,0.00016815544,0.0001495348],"domain_scores_gemma":[0.99908113,0.000037710503,0.00020709295,0.00041726767,0.00016898997,0.00008780096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013922554,0.00015111618,0.0002314043,0.00015306068,0.00020917521,0.000053949032,0.0005902975,0.0001755973,0.00008425181],"category_scores_gemma":[0.000005806133,0.00016934166,0.0000580715,0.00024458926,0.000053530675,0.00042808245,0.00011161541,0.00013236952,0.000055479682],"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.00008530711,0.00038246508,0.0018201378,0.002032169,0.00031456156,0.000032810676,0.18163636,0.00004424773,0.0032587096,0.6488224,0.007928959,0.15364186],"study_design_scores_gemma":[0.009031303,0.0012877613,0.09808911,0.0015873088,0.0012394754,0.00007742768,0.35272852,0.033785272,0.0151845645,0.33398688,0.14479998,0.008202407],"about_ca_topic_score_codex":0.005021186,"about_ca_topic_score_gemma":0.0017154055,"teacher_disagreement_score":0.9145793,"about_ca_system_score_codex":0.000018772584,"about_ca_system_score_gemma":0.000048119502,"threshold_uncertainty_score":0.75905645},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31244305,0.002452894,0.66530603,0.0018557986,0.0003084996,0.0011663339,0.0001715359,0.00041567552,0.015880194],"genre_scores_gemma":[0.9527541,0.00012993382,0.045174904,0.0002890271,0.00024192341,0.00009601492,0.000025705935,0.000012144542,0.0012762938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992018,0.00003134185,0.00022697698,0.00021411764,0.00016514308,0.00016061644],"domain_scores_gemma":[0.999266,0.00008576233,0.0000982477,0.00025955238,0.00012729672,0.00016313075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024023114,0.00009750811,0.00013320813,0.00006294227,0.00010156542,0.000042585554,0.00039832122,0.000050491017,0.000040107552],"category_scores_gemma":[0.00002036044,0.000076426506,0.000030624255,0.00035412415,0.000047889975,0.00034271783,0.00017666515,0.000082021754,0.00008992893],"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.000027532844,0.00011787005,0.00021897521,0.000049210445,0.000021344442,0.0000033756703,0.0004519666,0.00005347773,0.00031021598,0.9733841,0.00045641416,0.024905553],"study_design_scores_gemma":[0.004585534,0.0012122091,0.0036735171,0.00008455273,0.00014856273,0.00052585936,0.0006285939,0.3602904,0.039095774,0.09697863,0.49102747,0.0017488851],"about_ca_topic_score_codex":0.000004655719,"about_ca_topic_score_gemma":0.0000022362128,"teacher_disagreement_score":0.8764054,"about_ca_system_score_codex":0.0000045733277,"about_ca_system_score_gemma":0.000095674186,"threshold_uncertainty_score":0.31165823},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016444063,0.0012039448,0.10479812,0.000080176236,0.0022389789,0.0007558092,0.000044803888,0.00055869436,0.890155],"genre_scores_gemma":[0.00389152,0.00019269776,0.009838604,0.0006089793,0.00097220746,0.00011187233,0.000038114933,0.0001276988,0.9842183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971647,0.00013386765,0.0005874861,0.0009908193,0.00052000483,0.000603067],"domain_scores_gemma":[0.99829257,0.00011298331,0.00021184406,0.0011064138,0.00007101671,0.00020520392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032351105,0.0006074716,0.00062971516,0.0004628896,0.00013829155,0.00025390493,0.0019229332,0.00041914024,0.00017178463],"category_scores_gemma":[0.000019223144,0.0005626579,0.00023407512,0.00010493411,0.00014628023,0.0004163234,0.00050245173,0.0007116296,0.00024318827],"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.000031944775,0.000100573256,0.000008817872,0.00028416398,0.000033620006,0.0004628652,0.00089124485,0.00012585199,0.000057347992,0.8964512,0.0015926369,0.09995977],"study_design_scores_gemma":[0.002019552,0.0002074342,0.000021170526,0.0010602393,0.000038399743,0.00006476305,0.000012949494,0.0023968369,0.0016741042,0.30553955,0.6851671,0.0017979277],"about_ca_topic_score_codex":0.000013069769,"about_ca_topic_score_gemma":0.000052848878,"teacher_disagreement_score":0.68357444,"about_ca_system_score_codex":0.0004158206,"about_ca_system_score_gemma":0.0018527674,"threshold_uncertainty_score":0.9996825},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015069749,0.000078367666,0.99378395,0.0010516039,0.0010378767,0.002213517,0.000025643836,0.00012693706,0.00017512581],"genre_scores_gemma":[0.6697897,0.000020893774,0.32227045,0.004758063,0.002202502,0.00022716666,0.0001351594,0.000090503265,0.00050558033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622077,0.00008521315,0.00053669093,0.0015984914,0.00085785496,0.0007009974],"domain_scores_gemma":[0.997091,0.00090386154,0.00034401665,0.0012706226,0.0002122388,0.00017827698],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001799257,0.0005881726,0.00054117717,0.00034124253,0.00091741985,0.0012145777,0.0029173945,0.00034075155,0.000006313874],"category_scores_gemma":[0.00010200206,0.0004157331,0.00014050305,0.0007388901,0.00028360586,0.00028810615,0.00096384017,0.0006787484,0.000018306577],"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.000103267645,0.000090081165,0.0000057583634,0.000115263094,0.000021964179,0.0000066255757,0.0018798917,0.27627188,0.004285857,0.2827718,0.00015226507,0.43429536],"study_design_scores_gemma":[0.0008707712,0.00045142425,0.000060291946,0.00079727924,0.000022715396,0.0000323551,0.0000013422482,0.72857374,0.0020778293,0.25314027,0.012905267,0.0010666891],"about_ca_topic_score_codex":0.000037754493,"about_ca_topic_score_gemma":0.000049510123,"teacher_disagreement_score":0.6715135,"about_ca_system_score_codex":0.00035264745,"about_ca_system_score_gemma":0.00026481017,"threshold_uncertainty_score":0.9998295},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009223721,0.0015640786,0.03129703,0.0027191984,0.0014587588,0.0022618417,0.0007613057,0.00050978555,0.95850563],"genre_scores_gemma":[0.104105145,0.00012366795,0.006954774,0.0018665073,0.000774515,0.00006568441,0.000008685223,0.00018371576,0.8859173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979493,0.00010562432,0.00045565332,0.00063633133,0.0005034495,0.00034961922],"domain_scores_gemma":[0.99800324,0.0005389204,0.00031682212,0.00089779304,0.000081253485,0.00016193934],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004661805,0.0004822482,0.0005393977,0.00019845867,0.00016996775,0.00009805844,0.0010580057,0.0003182641,0.0002563137],"category_scores_gemma":[0.000039877676,0.000343766,0.0002439456,0.00003601877,0.00013638397,0.000080105376,0.00042086924,0.0005311327,0.0002572648],"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.00008314996,0.000039093553,0.0000010642341,0.000096425036,0.00008381251,0.0000917814,0.00073001796,0.0000028264644,0.0001297365,0.9622045,0.0038702893,0.03266728],"study_design_scores_gemma":[0.004734621,0.001331543,0.00013939658,0.0016981518,0.0003968631,0.00050902297,0.000020811149,0.068001054,0.0066034775,0.10579443,0.806735,0.0040356256],"about_ca_topic_score_codex":0.000012469197,"about_ca_topic_score_gemma":0.0000019298036,"teacher_disagreement_score":0.8564101,"about_ca_system_score_codex":0.000035175493,"about_ca_system_score_gemma":0.0000846578,"threshold_uncertainty_score":0.9999014},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20273623,0.00009680478,0.79314923,0.00014297309,0.00060160767,0.00059559237,0.00010958472,0.00024801592,0.0023199753],"genre_scores_gemma":[0.9919947,0.00006646055,0.005988603,0.00012119911,0.000043809312,0.0000015603192,0.000022664984,0.000012595812,0.0017484224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983461,0.00011432102,0.00024539462,0.0008312003,0.0001024179,0.0003605759],"domain_scores_gemma":[0.9981861,0.00018518644,0.00034956675,0.00086308183,0.00024855652,0.00016752662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005496302,0.00026712293,0.0004256486,0.0004287943,0.00013550249,0.000109348155,0.002236291,0.000261454,0.000017394084],"category_scores_gemma":[0.00007094451,0.0003056307,0.00034578075,0.00097323064,0.00005201091,0.0002504189,0.00093332015,0.00025043893,0.000019368197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007020515,0.00024979032,0.0005316174,0.00014941605,0.00017093793,0.00006259468,0.00031341365,0.034685425,0.00007734175,0.9597487,0.0013404697,0.0026001015],"study_design_scores_gemma":[0.00078615383,0.00031662942,0.0015307479,0.00020378659,0.00012694087,0.0000017234536,0.000042690353,0.18291037,0.00072574214,0.8110978,0.001544052,0.00071334786],"about_ca_topic_score_codex":0.0000616285,"about_ca_topic_score_gemma":0.000017708764,"teacher_disagreement_score":0.7892585,"about_ca_system_score_codex":0.00010289819,"about_ca_system_score_gemma":0.00013443654,"threshold_uncertainty_score":0.99993956},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011730869,0.00004851178,0.00058312854,0.00028293475,0.0017567138,0.00019924025,0.9966149,0.00028574,0.0002171525],"genre_scores_gemma":[0.0000024834417,0.00004432782,0.000019792651,0.00046427615,0.0000026219334,0.000002762364,0.99946344,7.693654e-9,2.6134632e-7],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99846643,0.00007091214,0.00034680578,0.00032487596,0.0004929878,0.0002979692],"domain_scores_gemma":[0.9986642,0.000023861538,0.00017262087,0.00082663825,0.0001505237,0.00016215935],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040405287,0.00028270856,0.00023642152,0.00011869922,0.00022490072,0.0006210543,0.001671139,0.0002772438,0.0006315645],"category_scores_gemma":[0.00006497134,0.00026910834,0.00017639952,0.0005711189,0.000107949476,0.0019110888,0.0011231041,0.00036314948,0.68602425],"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.0000065547893,0.000017513023,0.00001171748,0.00020841947,0.000022032738,0.000008454607,0.000045551493,0.000004761215,8.59315e-9,0.000011058757,0.99502236,0.004641571],"study_design_scores_gemma":[0.00011974668,0.000026688991,0.0000028277534,0.000004469397,0.000025045023,0.000013298367,0.000024619403,0.0000055644755,0.0000026292691,0.000053913867,0.99943495,0.00028625794],"about_ca_topic_score_codex":0.000071917,"about_ca_topic_score_gemma":0.0000021476076,"teacher_disagreement_score":0.6853927,"about_ca_system_score_codex":0.0001922772,"about_ca_system_score_gemma":0.00017414086,"threshold_uncertainty_score":0.9999761},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041368243,0.00028129385,0.008910749,0.0005729323,0.00025462348,0.00059255946,0.00030817822,0.00054240914,0.9881236],"genre_scores_gemma":[0.08383125,0.0006701952,0.020899758,0.002852311,0.0014016648,0.000002031767,0.0031260478,0.035549622,0.8516671],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974508,0.00082620466,0.00027925335,0.00052560953,0.0005618273,0.0003562827],"domain_scores_gemma":[0.99840593,0.000024868717,0.00025893754,0.0011251488,0.000100580335,0.00008454692],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006873191,0.0002100265,0.0002363061,0.00032344423,0.0004733033,0.00026426517,0.003689816,0.00010030637,0.0281911],"category_scores_gemma":[0.00023781399,0.00018401728,0.000105374136,0.0010395026,0.00015523599,0.00010285875,0.0032138517,0.0005207462,0.0012647168],"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.000035308087,0.00023496892,0.0000046827304,0.00013063129,0.00006764571,0.0000602813,0.0009097767,0.000086952095,0.0014628206,0.07051371,0.8776275,0.04886572],"study_design_scores_gemma":[0.0003702138,0.00012421171,0.0001504118,0.000071026414,0.000007049112,0.000029890592,0.00012247199,0.00045494363,0.0000737731,0.00025894403,0.99815655,0.00018052953],"about_ca_topic_score_codex":0.000045793604,"about_ca_topic_score_gemma":5.338289e-7,"teacher_disagreement_score":0.13645646,"about_ca_system_score_codex":0.00006167237,"about_ca_system_score_gemma":0.000013942446,"threshold_uncertainty_score":0.9995129},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95640635,0.0000016524051,0.041592643,0.00058293005,0.00051175785,0.0005646824,0.000075258744,0.00003146567,0.00023327253],"genre_scores_gemma":[0.99958134,2.2383382e-7,0.00032420098,0.00004515081,0.000010540977,0.00001898759,0.000004451859,0.0000023465198,0.000012781949],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9956279,0.0017094983,0.0021112224,0.00015057578,0.00021662441,0.00018421246],"domain_scores_gemma":[0.9954091,0.0007453123,0.0030445356,0.0006245202,0.00015538817,0.00002119067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004333915,0.000120279336,0.0006374141,0.00018189466,0.000057712226,0.000005513343,0.00067592785,0.00006170237,0.0000016339521],"category_scores_gemma":[0.0012380832,0.000073810326,0.00011244366,0.0012155769,0.00019662216,0.0003353976,0.00025191458,0.0001030889,0.00001049719],"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.00009243219,0.000009792489,0.94527626,0.00015905453,0.000027013484,3.9493212e-8,0.03634188,0.011810781,9.657815e-7,0.0051690307,0.000031317002,0.0010814548],"study_design_scores_gemma":[0.00068232475,0.00017171509,0.8747348,0.00013162194,0.000008200706,0.0000014789827,0.016887428,0.107037865,0.000058723854,0.00019349977,0.00003266866,0.000059643065],"about_ca_topic_score_codex":0.00036292974,"about_ca_topic_score_gemma":0.00003138017,"teacher_disagreement_score":0.09522708,"about_ca_system_score_codex":0.00007688728,"about_ca_system_score_gemma":0.00005164411,"threshold_uncertainty_score":0.30098978},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.075247e-7,0.00007670803,0.000008180729,0.000014456437,0.000043134132,0.0001566297,0.99890906,0.000032251286,0.0007591856],"genre_scores_gemma":[0.000042579763,9.990938e-7,0.0015929708,0.000027893242,0.00017759907,0.00006295438,0.99788564,0.000011953841,0.00019739039],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985649,0.00018045903,0.00035279157,0.00038627032,0.00038510727,0.0001304702],"domain_scores_gemma":[0.9979151,0.0011187746,0.0004141173,0.00033327975,0.00014136899,0.00007738493],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009642799,0.00020109066,0.00029855117,0.00018716391,0.000052337375,0.000088494606,0.0004767893,0.00012636196,0.7944606],"category_scores_gemma":[0.0007596475,0.00019158685,0.00010374214,0.0002067047,0.000030808384,0.00011558729,0.00037901194,0.00028421782,0.00072271214],"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.0000020686268,0.000018140823,1.730641e-7,0.0005058643,0.00008495275,0.00007406421,0.00004235956,0.0000028342765,6.4193654e-7,0.000020934238,0.99798054,0.0012674181],"study_design_scores_gemma":[0.00008302009,0.00008298106,0.0011663769,0.0028159576,0.00005634183,0.000009966251,0.0000076912165,0.000043098677,0.000015948057,0.00037813382,0.99514914,0.00019136506],"about_ca_topic_score_codex":6.20583e-7,"about_ca_topic_score_gemma":0.000002112181,"teacher_disagreement_score":0.7937378,"about_ca_system_score_codex":0.000007695438,"about_ca_system_score_gemma":0.00012509948,"threshold_uncertainty_score":0.9289244},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83095783,0.000024003817,0.011655826,0.06992559,0.0006442047,0.00142233,0.000026590109,0.001095165,0.08424843],"genre_scores_gemma":[0.9940448,0.00005519691,0.0003740025,0.00017990707,0.000107218664,0.0000022139766,0.000009907852,0.000008073475,0.005218717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997173,0.00059364893,0.00013419673,0.0004147522,0.0009332074,0.0007511773],"domain_scores_gemma":[0.99874574,0.00034614734,0.00004183195,0.00058251084,0.00017224965,0.00011152018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032151253,0.00011662809,0.00013190658,0.00066979136,0.0005952882,0.00020936878,0.002238041,0.000076361925,0.00007211772],"category_scores_gemma":[0.00012875428,0.00009780994,0.0000826352,0.0041634985,0.00015181329,0.0009318887,0.0010215165,0.00076348515,0.00047025518],"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.0000130063545,0.00020013841,0.007827786,0.000049730024,0.000024497094,0.005420509,0.0021065215,0.00012337982,0.000052938616,0.926991,0.050178315,0.0070122094],"study_design_scores_gemma":[0.00323384,0.00063349266,0.15794827,0.00034208517,0.000024461879,0.000113887865,0.042870555,0.07003431,0.0006038192,0.07395427,0.6485222,0.0017188006],"about_ca_topic_score_codex":0.0008477727,"about_ca_topic_score_gemma":0.00002680179,"teacher_disagreement_score":0.8530367,"about_ca_system_score_codex":0.00005960857,"about_ca_system_score_gemma":0.00017163201,"threshold_uncertainty_score":0.6044336},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039061766,0.0018874382,0.3599118,0.51403564,0.0026029465,0.0008766234,0.000060510432,0.0005924737,0.08097081],"genre_scores_gemma":[0.00095289433,0.00085222954,0.029818721,0.000019513589,0.00007970926,3.4667272e-7,0.00009133881,0.000019108742,0.9681661],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99882203,0.00009033017,0.000016748143,0.0004423051,0.0003694208,0.000259169],"domain_scores_gemma":[0.9986106,0.000074576914,0.00044568317,0.0005412984,0.00021602029,0.00011180478],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020878596,0.00022044133,0.00035018133,0.00031986646,0.00020842082,0.000038794886,0.0014861526,0.00023481314,0.000028475732],"category_scores_gemma":[0.000018036577,0.00028092836,0.00020369959,0.0006571713,0.000060570397,0.00051818957,0.0001220944,0.0002759452,0.00016368086],"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.00015928861,0.00011997908,0.00003912697,0.00046188867,0.00027384702,0.000665724,0.007669796,0.00008790341,0.00016432993,0.23799556,0.67056066,0.081801906],"study_design_scores_gemma":[0.00051959144,0.00013230147,0.00014797614,0.00025293438,0.00007691736,0.000016038082,0.008663494,0.0014777752,0.000138654,0.0010310455,0.98711616,0.00042710677],"about_ca_topic_score_codex":0.000013287161,"about_ca_topic_score_gemma":0.0001602985,"teacher_disagreement_score":0.88719535,"about_ca_system_score_codex":0.00006986591,"about_ca_system_score_gemma":0.00019434746,"threshold_uncertainty_score":0.9999643},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48868164,0.0005267466,0.47721538,0.0026600424,0.0006356791,0.0006257029,0.000022510714,0.00028081425,0.029351471],"genre_scores_gemma":[0.94213784,0.00014226552,0.055720054,0.00006605787,0.000040829942,7.6022076e-7,0.00000867274,0.000018705716,0.0018647985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976976,0.00033042373,0.000373215,0.0005681972,0.0005539682,0.00047659205],"domain_scores_gemma":[0.9982435,0.0001910834,0.00041874597,0.0008098823,0.0001723072,0.00016446062],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011882411,0.00025997325,0.0004728728,0.0006002278,0.00019921972,0.0000653197,0.0017606999,0.00026828522,0.00023029435],"category_scores_gemma":[0.000084350424,0.00032051685,0.00022669102,0.0014351777,0.0002416049,0.0021984526,0.00040239262,0.0005327601,0.000042400054],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012147115,0.0028057783,0.14463452,0.0005207265,0.0003361919,0.0016559551,0.019682558,0.0023132914,0.0069257785,0.16394718,0.002346139,0.65361714],"study_design_scores_gemma":[0.03419436,0.0037241483,0.33210832,0.0029538397,0.00054815627,0.00041169845,0.02751171,0.35355675,0.007324621,0.13445815,0.09604923,0.0071590035],"about_ca_topic_score_codex":0.00012635776,"about_ca_topic_score_gemma":0.00016157729,"teacher_disagreement_score":0.64645815,"about_ca_system_score_codex":0.00015339334,"about_ca_system_score_gemma":0.00010228239,"threshold_uncertainty_score":0.9999247},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28073728,0.000008356464,0.7150616,0.00031245739,0.00008732488,0.00024027318,0.000057367077,0.000089087385,0.003406282],"genre_scores_gemma":[0.6716082,6.7204087e-7,0.32790503,0.00034172673,0.00004529673,0.000004975387,0.000061464874,0.000007894267,0.000024754241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983867,0.00008928169,0.00038538768,0.00035085235,0.00045168548,0.0003361091],"domain_scores_gemma":[0.99847364,0.00071732176,0.00016524954,0.00028291767,0.00018378923,0.00017707594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005270489,0.00017463208,0.00024028166,0.00017568447,0.00022947579,0.00008036997,0.00043070727,0.00004893368,0.00042072494],"category_scores_gemma":[0.000049787308,0.00016599431,0.000053476586,0.00033007696,0.00018200072,0.00018958778,0.00011783229,0.000102814054,0.00003260236],"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.00019858427,0.00047968555,0.00043203146,0.00005648573,0.000095121715,0.00042777046,0.0006132597,0.005826485,0.3645868,0.6029071,0.00046560823,0.023911074],"study_design_scores_gemma":[0.009611304,0.0044157836,0.017016562,0.0015023274,0.00019719049,0.0020205982,0.00056989415,0.19482137,0.59415925,0.16514607,0.007665676,0.002873998],"about_ca_topic_score_codex":0.000016042539,"about_ca_topic_score_gemma":0.0000053875533,"teacher_disagreement_score":0.43776104,"about_ca_system_score_codex":0.000057712215,"about_ca_system_score_gemma":0.000048691436,"threshold_uncertainty_score":0.6769051},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5340996,0.00015109256,0.44449708,0.00008933847,0.000103029095,0.0002167689,0.000010302262,0.0007579046,0.020074897],"genre_scores_gemma":[0.9217999,0.00012426934,0.077564955,0.00011019673,0.00025653528,0.000032141328,0.000008960112,0.000030180667,0.00007285963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973012,0.0010955994,0.00032118693,0.00043494732,0.00032209654,0.00052493176],"domain_scores_gemma":[0.99767,0.0012186569,0.00017704231,0.0005572581,0.00020522585,0.0001718086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016430831,0.0002969776,0.00028323842,0.00014963382,0.0005064792,0.0003593646,0.0009309372,0.00020152492,0.0001377888],"category_scores_gemma":[0.00037001146,0.00025773933,0.000110738845,0.00031334304,0.0007366025,0.0008561097,0.00024823553,0.00023771515,0.000046900466],"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.00016185462,0.000799236,0.044147164,0.00035634203,0.00010224528,0.000051710613,0.03724327,0.00016806535,0.103779934,0.4307285,0.0007894881,0.38167217],"study_design_scores_gemma":[0.000714348,0.00021176446,0.0740338,0.0007054432,0.00004119298,0.00011213555,0.0010204817,0.0703213,0.4307308,0.41073987,0.010588911,0.0007799808],"about_ca_topic_score_codex":0.00085177453,"about_ca_topic_score_gemma":0.000040442243,"teacher_disagreement_score":0.38770032,"about_ca_system_score_codex":0.00015912489,"about_ca_system_score_gemma":0.00012931094,"threshold_uncertainty_score":0.9999875},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015676221,0.000021195548,0.5265335,0.47141242,0.00008089928,0.00016176749,0.000003814487,0.00002880074,0.00019001342],"genre_scores_gemma":[0.62312865,0.00028776302,0.13559392,0.0016226663,0.00051279174,0.000010747344,0.00001470226,0.00003376869,0.23879498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994153,0.00006613894,0.000012253206,0.00017569469,0.00018438075,0.00014625255],"domain_scores_gemma":[0.9985192,0.00073585904,0.0001152525,0.000496705,0.00010248357,0.000030497567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036589248,0.00008127831,0.00009295616,0.00006619083,0.00088486617,0.000035125577,0.0007581274,0.000039219787,0.000005993879],"category_scores_gemma":[0.00007841455,0.00005972235,0.00011246226,0.00027746294,0.00013666645,0.00034239402,0.00010431393,0.0001020103,0.00004537752],"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.000022661208,0.000019272433,0.0000062411827,0.0000077668,0.000016096463,0.0000074367367,0.0016473738,0.0009142117,0.00013037177,0.7953625,0.19906947,0.0027966322],"study_design_scores_gemma":[0.00040077235,0.00012915877,0.000088576315,0.000022243046,0.000020897352,0.000013911411,0.0009284132,0.2383211,0.00023929945,0.0013843615,0.75832963,0.00012166887],"about_ca_topic_score_codex":0.0000048827474,"about_ca_topic_score_gemma":0.000022042865,"teacher_disagreement_score":0.7939781,"about_ca_system_score_codex":0.000030453006,"about_ca_system_score_gemma":0.00006138466,"threshold_uncertainty_score":0.68057644},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004089358,0.0003091933,0.0808691,0.013151505,0.010257992,0.0029282977,0.00027064336,0.0035262215,0.88459766],"genre_scores_gemma":[0.0009591804,0.000014125176,0.007093393,0.0039982665,0.00036862007,0.00003762976,0.0000035290388,0.00029570612,0.9872295],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99812055,0.000053400632,0.00024325897,0.00070581073,0.00037383026,0.0005031808],"domain_scores_gemma":[0.99876034,0.00009474302,0.00006216761,0.0007364245,0.000022149548,0.00032416533],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00025504082,0.00030763054,0.0003471273,0.00036803406,0.00003167456,0.00013405649,0.0014612301,0.00011251677,0.0013561901],"category_scores_gemma":[0.000026073247,0.00024954055,0.00004495899,0.000871441,0.000010211915,0.000079847414,0.0005129048,0.00019026407,0.0023773874],"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.000002484045,0.000019122179,0.00053161016,0.000025173498,0.0000168934,0.00026541902,0.0001700712,0.00014367595,0.0000088291445,0.0032250616,0.98638207,0.009209568],"study_design_scores_gemma":[0.00019801469,0.000028477833,0.00018760894,0.00018478635,0.0000028069003,0.0000027070198,0.00001893233,0.00021191564,0.00021579281,0.00023167119,0.99824256,0.00047472038],"about_ca_topic_score_codex":0.76173323,"about_ca_topic_score_gemma":0.9781578,"teacher_disagreement_score":0.21642458,"about_ca_system_score_codex":0.00013775799,"about_ca_system_score_gemma":0.00024728748,"threshold_uncertainty_score":0.9999957},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31479612,0.00045039202,0.052548166,0.6163095,0.003193746,0.0005556003,0.00007910436,0.0006126087,0.011454724],"genre_scores_gemma":[0.0035556236,0.00038046864,0.0125296265,0.000005487873,0.000039168845,2.2211118e-7,0.000087265704,0.000013900668,0.98338825],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99920785,0.00006108894,0.000015028674,0.00022663914,0.0003398011,0.00014960377],"domain_scores_gemma":[0.9987322,0.000117028656,0.0005341492,0.0003375539,0.00023148657,0.00004755492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028467324,0.000107614345,0.00026387678,0.00025250934,0.00012334244,0.000012509735,0.00072691287,0.00021022234,0.00000733357],"category_scores_gemma":[0.000068233814,0.00014132101,0.00015817335,0.0005464264,0.00002366228,0.00021778603,0.000101701626,0.0001634019,0.000051610394],"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.00004943258,0.000069398586,0.00038587273,0.00060197344,0.00028929985,0.000053778662,0.0050454624,0.000044183384,0.0019374875,0.22059134,0.74339294,0.027538829],"study_design_scores_gemma":[0.00057688635,0.0001197868,0.0024370241,0.00045671515,0.00013583593,0.0000013512301,0.012748046,0.0025015369,0.0015988081,0.00094626873,0.9780791,0.00039867812],"about_ca_topic_score_codex":0.000013535966,"about_ca_topic_score_gemma":0.00015653668,"teacher_disagreement_score":0.9719335,"about_ca_system_score_codex":0.00006612406,"about_ca_system_score_gemma":0.00013776448,"threshold_uncertainty_score":0.57629037},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.598687e-7,0.00056307175,0.000018565026,0.00009581808,0.000606986,0.00026334697,0.00006258013,0.00035627393,0.9980324],"genre_scores_gemma":[0.000027323944,0.00014627624,0.005828366,0.0003677805,0.00015354887,0.000021137053,0.00005694979,0.0000701168,0.9933285],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847794,0.000104730985,0.0004351712,0.00023847609,0.00047343405,0.00027024385],"domain_scores_gemma":[0.99865794,0.000075873446,0.0004286553,0.0006823125,0.000052650485,0.000102575155],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002825844,0.00026804765,0.00032113589,0.000038820774,0.00008681113,0.00007762232,0.001085517,0.00019675134,0.8652367],"category_scores_gemma":[0.000038088576,0.00027322763,0.00015641715,0.000007263264,0.000056443092,3.535284e-7,0.0004181598,0.00021239306,0.009712239],"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.000009179653,0.000029486855,2.867147e-7,0.00013665567,0.000033473174,0.000018255641,0.00014805867,0.000050493116,3.038501e-8,0.0021222217,0.9929309,0.004520997],"study_design_scores_gemma":[0.00025564132,0.0000827763,9.2640477e-7,0.00003923583,0.000013653888,0.00006578298,0.000058363443,0.000089517,0.0000017398266,0.00007315681,0.9990168,0.00030241453],"about_ca_topic_score_codex":0.005732884,"about_ca_topic_score_gemma":0.0012338914,"teacher_disagreement_score":0.8555245,"about_ca_system_score_codex":0.0000879489,"about_ca_system_score_gemma":0.000033225188,"threshold_uncertainty_score":0.999972},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6427005,0.003982933,0.35155645,0.0008536145,0.00023331588,0.00042902294,0.000011785167,0.000055412693,0.00017695212],"genre_scores_gemma":[0.9915533,0.0001352093,0.00777399,0.00025408095,0.00006239767,0.0000066198654,0.0000021527355,0.000015345524,0.00019688705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982049,0.00041680064,0.00040067028,0.00047153895,0.00029642717,0.00020966576],"domain_scores_gemma":[0.9988754,0.0003567625,0.000107401574,0.00050366577,0.00007457004,0.000082192644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009063515,0.00021550572,0.000243892,0.000058848804,0.00043636275,0.00031395658,0.00043960084,0.00011017028,0.000032003707],"category_scores_gemma":[0.0000676771,0.00011314429,0.000077556106,0.0001993393,0.00015948805,0.0006367391,0.0006497328,0.0003013105,8.236116e-7],"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.00026650305,0.0005556626,0.007276719,0.0014090635,0.0009413723,0.00003684511,0.09030341,0.006700828,0.20170273,0.51196116,0.00058652175,0.1782592],"study_design_scores_gemma":[0.00028575936,0.00005279835,0.0007668911,0.00037725866,0.0000588962,0.00002481629,0.00037419147,0.8754382,0.028574083,0.0934248,0.0004262151,0.00019606188],"about_ca_topic_score_codex":0.000076553595,"about_ca_topic_score_gemma":0.0000116903375,"teacher_disagreement_score":0.8687374,"about_ca_system_score_codex":0.00001331704,"about_ca_system_score_gemma":0.00008671678,"threshold_uncertainty_score":0.46138903},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016728889,0.0002945455,0.11053223,0.0032416638,0.0013395933,0.0024180852,0.00045658095,0.0009606869,0.88073987],"genre_scores_gemma":[0.0028844136,0.0007576486,0.00360222,0.0016145955,0.0022535818,0.0000018755809,0.0028437653,0.0023720043,0.9836699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980924,0.000418912,0.0002911973,0.00056665076,0.00033753287,0.00029329374],"domain_scores_gemma":[0.9979495,0.0005991132,0.00019749031,0.00075406197,0.0004024969,0.000097368975],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016660319,0.00021584584,0.00027613225,0.00021324598,0.0023894375,0.0013355537,0.0019637665,0.00014286744,0.0012325593],"category_scores_gemma":[0.0012819103,0.00017556187,0.000113331116,0.00022609727,0.00026890213,0.00016990381,0.0015071351,0.00037162882,0.0007241308],"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.0007901747,0.000034329827,2.0417363e-9,0.000058075882,0.00003475307,0.000002031545,0.00022086424,0.000009843646,0.0000010630511,0.6616631,0.30370188,0.03348387],"study_design_scores_gemma":[0.007530284,0.00040744265,8.672987e-7,0.00008157503,0.000025995098,0.000017014207,0.000012084602,0.0013980959,0.000012827647,0.054631587,0.9357047,0.00017749757],"about_ca_topic_score_codex":0.0000019133852,"about_ca_topic_score_gemma":6.317711e-8,"teacher_disagreement_score":0.63200283,"about_ca_system_score_codex":0.00013498274,"about_ca_system_score_gemma":0.000025428446,"threshold_uncertainty_score":0.99970114},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96098846,0.000048464302,0.0056068227,0.015690982,0.00031289234,0.000172415,0.000019083109,0.000015211538,0.017145684],"genre_scores_gemma":[0.9987732,0.000005514205,0.0008043834,0.00024855213,0.0000075555768,0.0000023728594,2.1733159e-7,9.199494e-7,0.00015724504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99939793,0.000042679945,0.000109749395,0.00016271103,0.00017672274,0.00011022509],"domain_scores_gemma":[0.9992516,0.00010617968,0.000051256215,0.00032460244,0.00018893916,0.0000774458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009923755,0.000039728027,0.00005151137,0.00009456634,0.00007918526,0.000065597975,0.0005287894,0.000013356375,0.00015046755],"category_scores_gemma":[0.00019532714,0.000018721159,0.000010558917,0.00032303194,0.0003222204,0.00055278704,0.00006636762,0.000019678162,0.00000305656],"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.000008033466,0.00016037078,0.0045216847,0.000035098874,0.000003541688,1.14579045e-7,0.0008490098,7.5810426e-8,0.03299365,0.7812585,0.009516501,0.17065337],"study_design_scores_gemma":[0.0008207961,0.0004951502,0.03371879,0.00024916028,0.000008625103,0.000013808039,0.00089581386,0.0036211845,0.8057264,0.11875885,0.03516234,0.00052907376],"about_ca_topic_score_codex":0.00331504,"about_ca_topic_score_gemma":0.0005042475,"teacher_disagreement_score":0.77273273,"about_ca_system_score_codex":0.000034590157,"about_ca_system_score_gemma":0.00034424197,"threshold_uncertainty_score":0.5011371},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03800569,0.00026376682,0.95789295,0.00020899938,0.00010683314,0.000030266083,1.4712782e-7,0.00024053137,0.0032507884],"genre_scores_gemma":[0.7992193,0.000048354697,0.19740732,0.00023909275,0.000059830287,0.000002580078,1.13341784e-7,0.0000050479175,0.0030183338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996372,0.000004145968,0.000057130408,0.00013668934,0.000057715526,0.00010711898],"domain_scores_gemma":[0.99974,0.00004642208,0.000011732528,0.00014966774,0.000010519478,0.00004165776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008395357,0.000046362788,0.00004786175,0.000022871205,0.000077388635,0.00008307064,0.00017626012,0.000016160595,0.0001594173],"category_scores_gemma":[0.000016211685,0.000039027032,0.00001088303,0.00008821006,0.000013008514,0.00020364096,0.00011739888,0.000040331048,0.00006080216],"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.000001842448,0.00008301057,0.0025200031,0.00006608292,0.000021500977,0.00007086675,0.0016632754,0.002596815,0.00052714633,0.4501059,0.001703408,0.5406401],"study_design_scores_gemma":[0.00009962252,0.000013469058,0.00006748902,0.0000057142875,8.001581e-7,0.000019340201,0.000011641285,0.99171406,0.00047113767,0.0041880556,0.0033212123,0.000087432294],"about_ca_topic_score_codex":0.0000041769376,"about_ca_topic_score_gemma":7.5226404e-7,"teacher_disagreement_score":0.98911726,"about_ca_system_score_codex":0.0000027774838,"about_ca_system_score_gemma":0.0000015101414,"threshold_uncertainty_score":0.17455076},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020553801,0.000028325861,0.4689961,0.0030099999,0.00016653595,0.0000756357,0.0000020849413,0.00045009554,0.5067174],"genre_scores_gemma":[0.83208257,0.00002742995,0.091898136,0.0049894536,0.00014001572,0.000010445283,0.000004310216,0.0000056806084,0.07084198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958897,0.000024957422,0.000070684255,0.00012620045,0.000083492654,0.00010569043],"domain_scores_gemma":[0.9996411,0.000031362146,0.000008367822,0.00025129007,0.000017064645,0.000050771618],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00009404875,0.000043402997,0.000043712753,0.000026278976,0.00016794576,0.00004440481,0.0003601125,0.000018637638,0.008315897],"category_scores_gemma":[0.000005385649,0.000034422686,0.000026596876,0.00016403121,0.00001624157,0.000255888,0.000084396146,0.0000376186,0.001730234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010825986,0.00003500763,0.0000045139045,9.569115e-7,0.000003086049,0.000009224939,0.00015479968,0.00003584491,0.00015317605,0.7827688,0.0043786764,0.21245484],"study_design_scores_gemma":[0.0006413189,0.00008928556,0.001108664,0.000010836727,0.0000046654804,0.00008580762,0.00003169235,0.08222532,0.006879917,0.4859666,0.4225233,0.00043263705],"about_ca_topic_score_codex":0.0000061742207,"about_ca_topic_score_gemma":7.932755e-7,"teacher_disagreement_score":0.81152874,"about_ca_system_score_codex":0.0000054505526,"about_ca_system_score_gemma":0.000012242549,"threshold_uncertainty_score":0.99904704},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000323694,0.000008547191,0.92312205,0.00019078136,0.00012603104,0.00011879041,0.0000047712842,0.000046723235,0.076349914],"genre_scores_gemma":[0.038912855,0.0000022264248,0.8052712,0.000214312,0.000036561913,0.000047264428,0.000008416618,0.000007014564,0.15550013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996289,0.000035571586,0.00009461423,0.00008956546,0.00006444509,0.000086874315],"domain_scores_gemma":[0.9993526,0.0003201262,0.000044944,0.00016133368,0.000098260796,0.000022778695],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00029631154,0.00003727931,0.00007583446,0.000020801077,0.000033952037,0.000022022814,0.00023880153,0.000026789116,0.0076236906],"category_scores_gemma":[0.00012528156,0.000029700197,0.000028564233,0.00017934448,0.00000713873,0.00012280486,0.00004162495,0.000022570306,0.0008397117],"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":[3.8356836e-7,0.000036183563,0.000010062257,0.0000073298684,0.000016786375,3.917407e-8,0.00008247619,0.00003633005,0.0018794517,0.9518565,0.038992215,0.007082277],"study_design_scores_gemma":[0.000087108994,0.000020840474,0.00005073081,0.0000032945804,0.000004352324,3.6036064e-7,0.000005354434,0.89358306,0.0022657632,0.10033051,0.0035905202,0.000058123136],"about_ca_topic_score_codex":0.00003686524,"about_ca_topic_score_gemma":8.3273636e-7,"teacher_disagreement_score":0.8935467,"about_ca_system_score_codex":0.000005428512,"about_ca_system_score_gemma":0.00003365441,"threshold_uncertainty_score":0.99993825},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006420358,0.00016509695,0.9562576,0.032958653,0.0030777839,0.000066760054,0.0000014837048,0.0000072711773,0.0010450394],"genre_scores_gemma":[0.9892554,0.0000033288147,0.0043306593,0.0021080489,0.0035749113,0.0000015240237,3.3275467e-7,0.0000046535497,0.0007211127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995105,0.000053110827,0.0001261778,0.000082612496,0.00007777604,0.00014979838],"domain_scores_gemma":[0.99940705,0.00003562189,0.00005780934,0.0002336514,0.00010228144,0.00016360961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003270044,0.000052266372,0.000078653786,0.00009289043,0.00016945532,0.00013083786,0.00061604293,0.0000143418865,0.000013947718],"category_scores_gemma":[0.000058986105,0.000038196147,0.000051535426,0.00058761117,0.000022595941,0.00020672509,0.000020555857,0.00014431374,0.00002424245],"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.0000016031053,0.0000056464464,0.000048223024,0.0000044111985,0.000019039675,0.000011428214,0.00041545075,0.0007590178,0.00009554231,0.8486427,0.040162843,0.10983411],"study_design_scores_gemma":[0.00023074329,0.00016611772,0.0015558576,0.00005302699,0.000028750479,0.000101689744,0.000120221346,0.003054644,0.0022711724,0.36609864,0.6261514,0.0001677473],"about_ca_topic_score_codex":0.00020032834,"about_ca_topic_score_gemma":0.0010644601,"teacher_disagreement_score":0.98283505,"about_ca_system_score_codex":0.00008223377,"about_ca_system_score_gemma":0.00043912645,"threshold_uncertainty_score":0.15575936},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87971574,0.0027448777,0.09783782,0.009078987,0.0013137256,0.0007120168,0.00001469814,0.00001156202,0.008570552],"genre_scores_gemma":[0.9831012,0.00030681115,0.01591915,0.000035517838,0.0003226297,0.000002975645,1.1606627e-7,0.000017683044,0.00029392017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99146515,0.0022516495,0.0015557382,0.00022565297,0.003966284,0.0005355117],"domain_scores_gemma":[0.9871733,0.0065662526,0.0011248997,0.0011345356,0.0036211857,0.00037983415],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.048424687,0.00020415445,0.00059899985,0.0005393061,0.00024193141,0.00042087337,0.0032103115,0.00013125643,0.00047704743],"category_scores_gemma":[0.0075799013,0.00011671014,0.00029368783,0.0012836951,0.0006098778,0.0004696405,0.000736485,0.0014364634,0.00017499765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043188437,0.004833819,0.000058859492,0.0019801504,0.000233344,0.00018338309,0.044969212,0.00035819493,0.002053633,0.91220653,0.015632704,0.017058283],"study_design_scores_gemma":[0.00083142257,0.0032992153,0.000026104066,0.0013159015,0.000035397214,0.0002804964,0.0081320945,0.12116146,0.01649184,0.84694433,0.001278491,0.00020326818],"about_ca_topic_score_codex":0.0000069342645,"about_ca_topic_score_gemma":7.947961e-7,"teacher_disagreement_score":0.12080327,"about_ca_system_score_codex":0.00017270738,"about_ca_system_score_gemma":0.000929683,"threshold_uncertainty_score":0.979847},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084620416,0.018541398,0.8772132,0.009298522,0.0029261357,0.0018131068,0.000044916196,0.000014788577,0.0055275317],"genre_scores_gemma":[0.85780936,0.00080863596,0.13502349,0.000020518884,0.0015401728,0.000027453498,4.5283747e-7,0.000052900636,0.0047170124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933988,0.00076777133,0.0016223642,0.00028327975,0.0031657452,0.00076206593],"domain_scores_gemma":[0.98427916,0.0072894967,0.0015254114,0.00095166825,0.0055330903,0.00042118103],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.034022875,0.0002555097,0.000750832,0.00070102245,0.0005027023,0.00067090406,0.0037922435,0.00015669242,0.00008855954],"category_scores_gemma":[0.0044742604,0.00015617952,0.00043699745,0.0014474997,0.0007306241,0.0008301644,0.0007302217,0.0010985809,0.000040982406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013357283,0.0071555823,0.00011192565,0.0061506024,0.0019038608,0.0001572727,0.20410764,0.005672627,0.0024079813,0.61066294,0.06943723,0.09089665],"study_design_scores_gemma":[0.002476595,0.0046451995,0.000038268852,0.0012572969,0.00017326466,0.00052096567,0.029186735,0.44317654,0.012126859,0.4955238,0.010540025,0.00033442077],"about_ca_topic_score_codex":0.000020447,"about_ca_topic_score_gemma":0.000006212566,"teacher_disagreement_score":0.77318895,"about_ca_system_score_codex":0.0002041942,"about_ca_system_score_gemma":0.0019965637,"threshold_uncertainty_score":0.9946767},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03705679,0.00022558622,0.89019454,0.002083841,0.0012194522,0.00022020713,0.000006922647,0.00025408907,0.06873856],"genre_scores_gemma":[0.97188175,0.000014749927,0.019988412,0.0031839702,0.0004315476,0.000052413136,0.000011801145,0.0000066436983,0.0044286866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898803,0.000054235003,0.00020972808,0.00035076536,0.000085222964,0.0003119986],"domain_scores_gemma":[0.99924934,0.00018150522,0.00005860318,0.00043738354,0.000020265079,0.00005292724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018447688,0.00012491,0.00017191366,0.00015180555,0.00022178059,0.00006540868,0.00068391475,0.00010056584,0.00020400612],"category_scores_gemma":[0.000018240155,0.00011812214,0.000057154124,0.000413828,0.000086761924,0.00009897325,0.00031573963,0.00011666434,0.00011659946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006819322,0.000026393327,0.000050802188,0.000004037137,0.00001723163,0.0000023224081,0.00005756143,0.00022034436,0.0024968875,0.9682521,0.008071058,0.020794444],"study_design_scores_gemma":[0.0012617335,0.00007233956,0.0011141634,0.0000032936582,0.000030025634,0.0000068019913,0.000042470452,0.04448805,0.015742019,0.7044647,0.2323097,0.000464742],"about_ca_topic_score_codex":0.00007847927,"about_ca_topic_score_gemma":0.000018672368,"teacher_disagreement_score":0.934825,"about_ca_system_score_codex":0.000026242302,"about_ca_system_score_gemma":0.00007840541,"threshold_uncertainty_score":0.4816881},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016977364,0.000054900902,0.9819349,0.000088837296,0.00006523401,0.00023873981,0.000013728497,0.000056266388,0.000570003],"genre_scores_gemma":[0.11905869,0.0000043776217,0.8807629,0.000064650005,0.000027006936,0.000026869164,0.000018877216,0.0000039157912,0.00003273418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934137,0.000010124208,0.0002521234,0.00018382302,0.000116391835,0.00009614938],"domain_scores_gemma":[0.9993587,0.00028374593,0.00011250926,0.00013579163,0.000074592834,0.000034653873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024103254,0.00009320909,0.00016036657,0.00009605237,0.0001039521,0.00007116855,0.00024156518,0.00003694492,0.0000026798523],"category_scores_gemma":[0.000003698718,0.00008392734,0.000032612432,0.00015504805,0.000035387562,0.00012204807,0.000060903603,0.000033573582,0.0000025140325],"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.0000032442329,0.000116246636,0.0000015259616,0.0001699747,0.000012640876,1.4882242e-7,0.00020038261,0.0019793198,0.0002424199,0.8444028,0.000034503893,0.15283678],"study_design_scores_gemma":[0.0001993665,0.000024952322,0.000047240534,0.000021961956,0.000007536255,0.0000022648692,0.000031366824,0.5410422,0.0011254643,0.45738652,0.00005767696,0.000053426815],"about_ca_topic_score_codex":5.894297e-7,"about_ca_topic_score_gemma":8.681131e-8,"teacher_disagreement_score":0.5390629,"about_ca_system_score_codex":0.000008052809,"about_ca_system_score_gemma":0.000025748666,"threshold_uncertainty_score":0.34224576},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7213286,0.0006186494,0.2746228,0.0008721263,0.00062550296,0.00009150841,0.000003918411,0.000020427735,0.0018164193],"genre_scores_gemma":[0.99427545,0.00009051135,0.00035728206,0.00017677993,0.00009168146,0.0000037642023,0.0000015543955,0.0000046909604,0.0049982984],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9982932,0.0002488859,0.00042673855,0.000528534,0.0001993807,0.0003032136],"domain_scores_gemma":[0.9986577,0.00030291957,0.0001896611,0.00070294546,0.00006958086,0.00007718102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006538561,0.00019414445,0.0003807308,0.0003089075,0.0003168648,0.00008073918,0.0005970818,0.00009159158,0.00054895744],"category_scores_gemma":[0.000089933026,0.0001448703,0.00029647682,0.0038539905,0.00032259896,0.00021502496,0.0007238948,0.00026655418,0.000041594772],"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.00007473783,0.0001778725,0.9180746,0.000075859716,0.001462654,0.000007234142,0.001249693,0.00027465576,0.001151607,0.020935087,0.0002444348,0.056271546],"study_design_scores_gemma":[0.00038881606,0.00021502776,0.8834705,0.000046276986,0.0008344517,0.000009137382,0.00024397777,0.09433009,0.016651422,0.0025633583,0.0010125609,0.00023438183],"about_ca_topic_score_codex":0.00012500043,"about_ca_topic_score_gemma":0.00003396395,"teacher_disagreement_score":0.27426553,"about_ca_system_score_codex":0.00008611433,"about_ca_system_score_gemma":0.000055173587,"threshold_uncertainty_score":0.60106987},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6800563,0.00064925756,0.31805915,0.000012790724,0.0004193306,0.00024064933,0.000092716866,0.000013661716,0.0004561732],"genre_scores_gemma":[0.99551976,0.00017217293,0.0030566507,0.0000048241113,0.000041396357,0.000007796036,0.00018232838,0.000018041783,0.0009970149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974277,0.00023439906,0.00085485575,0.0004967367,0.0006768818,0.00030942372],"domain_scores_gemma":[0.9973292,0.00030214235,0.001456743,0.0005061251,0.00031419162,0.000091641195],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046778194,0.00034112117,0.0007720252,0.00013719223,0.00015050647,0.00003718885,0.00056416076,0.00030760872,0.0011158945],"category_scores_gemma":[0.0000662792,0.00036353548,0.00021780093,0.0008691427,0.00018954928,0.00031709395,0.00024522963,0.0003340296,0.0000012951375],"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.0061742747,0.003402074,0.016973903,0.028853204,0.0023516626,0.0001872016,0.21304716,0.035299756,0.09802823,0.4802895,0.00060909404,0.11478394],"study_design_scores_gemma":[0.0034839672,0.0011391982,0.008414013,0.0017053538,0.0008273889,0.00009506764,0.032038163,0.57890224,0.35529116,0.015677387,0.00066062226,0.0017654547],"about_ca_topic_score_codex":0.000972505,"about_ca_topic_score_gemma":0.000010797074,"teacher_disagreement_score":0.54360247,"about_ca_system_score_codex":0.00007384575,"about_ca_system_score_gemma":0.0002155591,"threshold_uncertainty_score":0.9998817},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9703555,0.00021741545,0.017800387,0.001404091,0.0038916832,0.0003578219,0.0000070341157,0.00065255206,0.0053135264],"genre_scores_gemma":[0.98949456,0.000025256395,0.008913043,0.00020442558,0.000014522224,0.000016102802,0.000004046015,0.000009847417,0.0013181693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986639,0.00013017349,0.00024315115,0.0003496227,0.00031763324,0.000295516],"domain_scores_gemma":[0.99889755,0.00021271715,0.000106821186,0.00047973281,0.00014276344,0.00016040711],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00042849535,0.00013909467,0.00017246895,0.00014746474,0.0003417122,0.00005376898,0.00087155175,0.000074884796,0.000030316793],"category_scores_gemma":[0.00031363085,0.00013859205,0.000059981707,0.0014350456,0.000035182515,0.0004341973,0.00022101903,0.00019123191,0.0008255965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010197199,0.00027657775,0.0074527855,0.0000064331234,0.000031384083,0.00007686962,0.0013191848,0.00012848052,0.00008501921,0.97097814,0.014611207,0.005023699],"study_design_scores_gemma":[0.0022126776,0.000605824,0.05176018,0.00010683046,0.000024543779,0.00008069463,0.000036110494,0.053240865,0.0037367495,0.8628228,0.024072234,0.0013005087],"about_ca_topic_score_codex":0.000016484959,"about_ca_topic_score_gemma":0.000001419951,"teacher_disagreement_score":0.10815538,"about_ca_system_score_codex":0.000060044295,"about_ca_system_score_gemma":0.000087413406,"threshold_uncertainty_score":0.9999524},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15922835,0.00070906675,0.829045,0.001294289,0.0007417392,0.0009568662,0.00005699281,0.0004037419,0.007563943],"genre_scores_gemma":[0.43842122,0.00057462417,0.55233693,0.0008661223,0.0004277437,0.00027554616,0.0013513332,0.00010464031,0.005641876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99368495,0.0011623808,0.0013304134,0.0014272423,0.0010450173,0.001349976],"domain_scores_gemma":[0.9952226,0.00078044576,0.00076407386,0.0011614782,0.0011964476,0.00087493606],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0037291485,0.0010616519,0.0009357038,0.0005118605,0.001535924,0.0012858973,0.0019318413,0.00048830546,0.0002531908],"category_scores_gemma":[0.00033540913,0.0010666169,0.00046291336,0.0011263082,0.0004864925,0.0013930504,0.0003411592,0.00090179977,0.00013166704],"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.0013786082,0.0062718135,0.0010209581,0.0029573056,0.0014529631,0.00041611167,0.10989118,0.23238792,0.030718584,0.48653173,0.016665582,0.11030723],"study_design_scores_gemma":[0.0022204302,0.0007737994,0.0037160933,0.0011849597,0.00039103907,0.00030840363,0.006870028,0.6558511,0.029621933,0.29527402,0.0017562051,0.002031979],"about_ca_topic_score_codex":0.0012202236,"about_ca_topic_score_gemma":0.00024815308,"teacher_disagreement_score":0.4234632,"about_ca_system_score_codex":0.0005874942,"about_ca_system_score_gemma":0.0020199786,"threshold_uncertainty_score":0.99976397},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035979144,0.000012015284,0.9527517,0.0014685441,0.001550481,0.003544122,0.00017310987,0.00018475589,0.0043361294],"genre_scores_gemma":[0.90358955,0.00004228825,0.09290618,0.0010657148,0.00022916471,0.000115993964,0.00016340743,0.0000596755,0.0018280332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951757,0.0010421076,0.0011402115,0.0009661664,0.0012084887,0.00046728324],"domain_scores_gemma":[0.99349016,0.0022017786,0.0010867163,0.0021653576,0.00090703036,0.00014896112],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016286237,0.00068222836,0.0007938723,0.00040496056,0.00051318144,0.00020529376,0.002186319,0.00033788104,0.00047307234],"category_scores_gemma":[0.0009709025,0.00040070075,0.0004230197,0.0013675527,0.0007985306,0.00028360827,0.00015596456,0.00051440805,0.0000441826],"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.006350817,0.0046786014,0.00006506851,0.001451799,0.00055612007,0.0000125649685,0.01441599,0.04902537,0.015224212,0.8475564,0.0072385822,0.053424474],"study_design_scores_gemma":[0.00043842412,0.0023285593,0.0005401249,0.0015901661,0.000114142815,0.0000010257709,0.0002760839,0.57101095,0.41182205,0.0094721345,0.0016529065,0.0007534236],"about_ca_topic_score_codex":0.00033260803,"about_ca_topic_score_gemma":0.000056650908,"teacher_disagreement_score":0.8676104,"about_ca_system_score_codex":0.00007862763,"about_ca_system_score_gemma":0.0003185815,"threshold_uncertainty_score":0.9998445},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32041776,0.000696954,0.6659696,0.007829423,0.00043854464,0.0024094386,0.00027864,0.0012448201,0.00071482494],"genre_scores_gemma":[0.7796698,0.0001711915,0.2069063,0.0049809446,0.00039994746,0.0012872565,0.00009163176,0.00015593765,0.0063369707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99324423,0.0008457599,0.0011182604,0.0017400002,0.0009640971,0.002087666],"domain_scores_gemma":[0.9934497,0.00035268645,0.00072962267,0.003324065,0.00058667845,0.0015572773],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00111033,0.0011235097,0.00087724434,0.000993744,0.0010033353,0.0038707939,0.0025449176,0.0006968343,0.000876677],"category_scores_gemma":[0.00019174868,0.0010249579,0.00029222463,0.0016551862,0.00053988997,0.0062045446,0.0007275267,0.0012294253,0.00025204188],"study_design_candidate":"simulation_or_modeling","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.00054226915,0.0036264341,0.05011043,0.0003115228,0.0006846827,0.0007597101,0.007066255,0.008511915,0.004340795,0.591564,0.008495986,0.323986],"study_design_scores_gemma":[0.002416505,0.003214074,0.10377417,0.00045934273,0.00021333114,0.0012865715,0.00056845206,0.8093533,0.012254909,0.057898242,0.005039526,0.003521559],"about_ca_topic_score_codex":0.03336352,"about_ca_topic_score_gemma":0.0059219506,"teacher_disagreement_score":0.8008414,"about_ca_system_score_codex":0.00046099746,"about_ca_system_score_gemma":0.0008448281,"threshold_uncertainty_score":0.9992201},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017756746,0.00055307406,0.994296,0.0020497672,0.00042619044,0.00008756474,0.0000052872406,0.000019734667,0.00078671385],"genre_scores_gemma":[0.9598319,0.000020485777,0.037494108,0.0004089957,0.00021706759,0.000017671207,0.0000029535865,0.0000055593378,0.00200129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987145,0.000092735456,0.00058573403,0.00018488946,0.00022914416,0.00019299885],"domain_scores_gemma":[0.9986573,0.00025693196,0.00037117564,0.00027283776,0.00033067938,0.000111071095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007038502,0.00011004878,0.00048083212,0.0005129655,0.00011768472,0.00021767578,0.00066444196,0.000044150296,0.00006781048],"category_scores_gemma":[0.000054389635,0.00008081477,0.0006170134,0.0016835887,0.000028555876,0.00042672706,0.00006716101,0.00013224433,0.000010051245],"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.00071861513,0.001696327,0.0025506243,0.00038121326,0.020423463,0.00016174857,0.0011794015,0.13093425,0.0011711961,0.70922714,0.042139083,0.08941694],"study_design_scores_gemma":[0.0028439988,0.00041229854,0.00094073225,0.00011376733,0.0025604356,0.00013356774,0.00028018985,0.90473247,0.0016967672,0.0511418,0.034710653,0.00043331477],"about_ca_topic_score_codex":0.000019780902,"about_ca_topic_score_gemma":6.3256175e-7,"teacher_disagreement_score":0.9580562,"about_ca_system_score_codex":0.000052708536,"about_ca_system_score_gemma":0.00007246979,"threshold_uncertainty_score":0.32955304},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9826032,0.0009991524,0.0036697441,0.00057965424,0.00083246623,0.0004893936,0.0000060001353,0.00008897713,0.010731396],"genre_scores_gemma":[0.99778485,0.00003499853,0.0020125885,0.00006497701,0.000016508884,0.000020513555,0.000002967684,0.000009212081,0.00005335402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820715,0.00021519039,0.0003324969,0.00032300342,0.00050448114,0.0004176888],"domain_scores_gemma":[0.998801,0.00034656224,0.00021915356,0.00050944474,0.00007566755,0.000048174523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005619761,0.00017903192,0.00023552212,0.00028899874,0.000085322026,0.00010720334,0.0012051011,0.000063134925,0.000007274992],"category_scores_gemma":[0.000019588142,0.00011926244,0.00006692764,0.0020956732,0.00007601471,0.00036672372,0.00013654861,0.00019537461,0.000013212056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018813711,0.0003260474,0.0036555748,0.000029089915,0.000010523387,0.000060207334,0.0004024433,0.000067952045,0.000040113955,0.99313295,0.0003255592,0.0019307466],"study_design_scores_gemma":[0.0025259254,0.0005028247,0.09448718,0.00009281114,0.00003553419,0.00006215702,0.0003981552,0.004108791,0.004292106,0.89098746,0.0020125543,0.0004944896],"about_ca_topic_score_codex":0.00022587107,"about_ca_topic_score_gemma":0.000008492835,"teacher_disagreement_score":0.10214546,"about_ca_system_score_codex":0.00006191097,"about_ca_system_score_gemma":0.00006835366,"threshold_uncertainty_score":0.4863381},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91856843,0.0006502147,0.071227364,0.0010383028,0.00046575948,0.0002258818,0.00037507372,0.00038476693,0.0070642084],"genre_scores_gemma":[0.9835234,0.00024506135,0.013231016,0.00092746207,0.0005184057,0.00064672757,0.00040407787,0.00012239415,0.0003814352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963682,0.00018514108,0.0009370924,0.0010253392,0.00070395827,0.0007802455],"domain_scores_gemma":[0.9967375,0.0008037562,0.00066217873,0.0011200608,0.00022204015,0.00045448833],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010563325,0.00042204207,0.00032436254,0.00021835508,0.0010429667,0.00043460657,0.0010833164,0.0004987266,0.00020624798],"category_scores_gemma":[0.00031564673,0.0005419339,0.00037471103,0.0009795139,0.0003026213,0.0007482658,0.0007821543,0.0005646032,0.0011572818],"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.00007305549,0.00017747449,0.0000062773156,0.00016730934,0.00018177868,0.000022716673,0.0010464453,0.0009355827,0.002603337,0.9904025,0.001251746,0.0031317829],"study_design_scores_gemma":[0.0009304057,0.0005392268,0.00010898764,0.00038832557,0.0002941409,0.00027641427,0.0003139949,0.83826387,0.13193268,0.012239304,0.013900316,0.00081232947],"about_ca_topic_score_codex":0.00011352637,"about_ca_topic_score_gemma":0.000026145948,"teacher_disagreement_score":0.9781632,"about_ca_system_score_codex":0.000014815685,"about_ca_system_score_gemma":0.00024222858,"threshold_uncertainty_score":0.9997032},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038588387,0.00046563827,0.011968244,0.000049149083,0.00012354895,0.000097284305,0.000038889437,0.00007420609,0.9871445],"genre_scores_gemma":[0.0028519656,0.0005705002,0.007287575,0.000075821605,0.00010157016,2.1705365e-7,0.0000112635735,0.0000179218,0.9890832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991493,0.000018537196,0.00015584556,0.00031909597,0.00021493311,0.00014228224],"domain_scores_gemma":[0.99911344,0.00011089432,0.00018469957,0.00045974282,0.00006445488,0.00006674235],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007892841,0.000200259,0.00028186393,0.00028018153,0.000071036055,0.000024304241,0.0009910177,0.0001713039,0.0022165803],"category_scores_gemma":[0.000001983276,0.000205658,0.00016381255,0.00008504339,0.00009417865,0.00028355076,0.00022227375,0.00018741497,0.00053041865],"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.000009513921,0.000008873781,5.6066284e-7,0.00002137533,0.000048850008,0.000070444206,0.0005504794,0.000019193294,0.0000068258723,0.9608215,0.00140635,0.037036054],"study_design_scores_gemma":[0.0003054781,0.00011766638,0.000002784287,0.00020335871,0.000054000633,0.00001578196,0.00004950162,0.0008214505,0.00024291231,0.1983664,0.79938745,0.00043319838],"about_ca_topic_score_codex":0.0000096149815,"about_ca_topic_score_gemma":0.0000016851199,"teacher_disagreement_score":0.79798114,"about_ca_system_score_codex":0.00004229349,"about_ca_system_score_gemma":0.000055158824,"threshold_uncertainty_score":0.99869555},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97102916,0.0018972891,0.0021966952,0.0023538577,0.005605828,0.00044125717,0.0000033977506,0.00018676843,0.016285727],"genre_scores_gemma":[0.9962364,0.00023376195,0.0015697998,0.000103339196,0.000011068388,0.000011240375,3.7838493e-7,0.0000071756835,0.001826855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892205,0.00009151911,0.0002563915,0.0001918823,0.0002983718,0.00023978233],"domain_scores_gemma":[0.9989995,0.00017099731,0.00009340308,0.000611483,0.000051025178,0.00007360649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048019568,0.000107885695,0.00012974394,0.00003067395,0.00019488465,0.000089672816,0.0010196625,0.00003641157,0.00013323728],"category_scores_gemma":[0.000015636917,0.00007345145,0.00008366989,0.000258811,0.00005564698,0.00018509058,0.00011880506,0.00011128457,0.00009741808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019923855,0.00018136865,0.000077562225,0.0000064811215,0.000024141813,0.00001366754,0.00031348868,0.000053989,0.00008289975,0.904747,0.0020734442,0.09240604],"study_design_scores_gemma":[0.0018234397,0.00040076498,0.0010900844,0.000059753627,0.000019096076,0.000022977005,0.000055223172,0.023821797,0.0056046783,0.8259912,0.14070264,0.0004083413],"about_ca_topic_score_codex":0.000016602373,"about_ca_topic_score_gemma":5.0766374e-7,"teacher_disagreement_score":0.1386292,"about_ca_system_score_codex":0.000029552135,"about_ca_system_score_gemma":0.00003242857,"threshold_uncertainty_score":0.2995263},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023541486,0.938802,0.031533945,0.00072597014,0.000086009684,0.00051826274,0.000028726776,0.000023256121,0.0047403337],"genre_scores_gemma":[0.021948915,0.9599827,0.017701406,0.00028416686,0.000017828992,0.00002371278,5.6704e-7,0.000002420355,0.000038308746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996325,0.000008638504,0.00015300173,0.00013931877,0.0000070222795,0.000059515183],"domain_scores_gemma":[0.9996265,0.00002104403,0.00011604232,0.00020940499,0.000011579322,0.00001542945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017229529,0.000052264517,0.00015305993,0.00001528564,0.00003437966,0.000011037232,0.00018860257,0.000014085368,0.0000030760998],"category_scores_gemma":[0.0000026479122,0.00004352414,0.000022041244,0.00004422775,0.00003427036,0.0001815611,0.000076632736,0.000022754582,0.0000032980413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.8321745e-7,0.000007216611,0.000009672943,0.0003299258,0.0000021840679,6.762699e-8,0.000030379362,1.4352088e-7,6.8907633e-7,0.7831304,0.000015288007,0.21647373],"study_design_scores_gemma":[0.00019097526,0.000066442335,0.0010492814,0.0008522688,0.000012909633,0.000022395734,0.000008333396,0.0066748224,0.0003345621,0.504056,0.4864704,0.0002616234],"about_ca_topic_score_codex":0.00000280073,"about_ca_topic_score_gemma":3.4522114e-7,"teacher_disagreement_score":0.4864551,"about_ca_system_score_codex":0.0000018777583,"about_ca_system_score_gemma":0.000011637427,"threshold_uncertainty_score":0.1774863},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.183637e-7,0.00038496498,0.09934566,0.0003936133,0.0009214205,0.00008984777,0.0000042432093,0.00025580844,0.89860374],"genre_scores_gemma":[0.00041606833,0.00019962028,0.009551746,0.00026670133,0.00022521756,0.0000022240424,0.0000014709839,0.000015241573,0.9893217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998957,0.000010647309,0.00017387004,0.00042318652,0.00024623724,0.0001890595],"domain_scores_gemma":[0.9990385,0.000064988555,0.000099163706,0.00065251393,0.000045167857,0.00009963336],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00010737772,0.00023414615,0.00022234232,0.00007787355,0.00006600851,0.00012319953,0.0010032697,0.00015988728,0.010053101],"category_scores_gemma":[0.000005962661,0.00019761424,0.00011670452,0.000030089384,0.00005778573,0.00018390336,0.00024742697,0.00019817932,0.0047845156],"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":[4.531848e-7,0.0000038553653,3.5763563e-7,0.000010738346,0.000013191324,0.000033653425,0.000033942095,8.0581395e-7,0.0000028670815,0.9844462,0.00881286,0.006641034],"study_design_scores_gemma":[0.000066381566,0.000042892647,0.0000017663949,0.000036769306,0.000006983789,0.000022836477,8.841504e-7,0.00368537,0.0001597265,0.16635625,0.8292541,0.00036602723],"about_ca_topic_score_codex":0.000003211056,"about_ca_topic_score_gemma":9.0369656e-7,"teacher_disagreement_score":0.82044125,"about_ca_system_score_codex":0.00001804558,"about_ca_system_score_gemma":0.000024413666,"threshold_uncertainty_score":0.9959904},"labels":[],"label_agreement":null}]}