{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":635,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":635,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"92ea8d48ac1b","filters":{"venue":"Linear Algebra and its Applications"}},"results":[{"id":"W2062331061","doi":"10.1016/j.laa.2014.06.010","title":"Distance spectra of graphs: A survey","year":2014,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":299,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Distance matrix; Mathematics; Distance matrices in phylogeny; Eigenvalues and eigenvectors; Combinatorics; Resistance distance; Characteristic polynomial; Matrix (chemical analysis); Graph; Degree matrix; Adjacency matrix; Discrete mathematics; Polynomial; Line graph; Graph power; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02885101857384469,"gpt":0.2921779012327856,"spread":0.2633268826589409,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003841528,0.0001007628,0.0001711559,0.00005095984,0.0001349283,0.00001031464,0.0001629148,0.00004981128,0.0000369183],"category_scores_gemma":[0.0001364054,0.00009172514,0.00004765281,0.0003602851,0.00008836026,0.00004511872,0.00002877468,0.00008353324,0.00002467798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000295289,"about_ca_system_score_gemma":0.000009220508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007131432,"about_ca_topic_score_gemma":0.00003735801,"domain_scores_codex":[0.9992632,0.00006169387,0.0002533556,0.0002063171,0.00009018352,0.0001252181],"domain_scores_gemma":[0.9987512,0.0005940143,0.0001178075,0.0003753769,0.00009063976,0.00007095233],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004104022,0.00009804831,0.0008190008,0.00004106826,0.00001252392,1.632601e-8,0.0000676643,4.851343e-7,0.0009585248,0.9970366,0.0002174532,0.0007444798],"study_design_scores_gemma":[0.0001617689,0.00002304424,0.007059162,0.00001119762,0.00002804588,0.000001758787,0.00002871032,0.0005022453,0.003108838,0.9776142,0.01133818,0.0001228225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7419645,0.0003624521,0.2472942,0.0004718244,0.00002764454,0.00101565,0.0002012141,0.0001674729,0.008495035],"genre_scores_gemma":[0.9940476,0.00005959478,0.005240505,0.00005426716,0.00004073432,0.0001876021,0.00003260179,0.00001603653,0.0003210095],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2520832,"threshold_uncertainty_score":0.3740443,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974200742","doi":"10.1016/j.laa.2005.08.025","title":"Riemannian geometry and matrix geometric means","year":2005,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Mathematical Inequalities and Applications","field":"Mathematics","cited_by":259,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Mathematics; Positive-definite matrix; Geometric mean; Geodesic; Weighted geometric mean; Metric (unit); Matrix (chemical analysis); Geometric analysis; Pure mathematics; Combinatorics; Geometry; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.04168788145956998,"gpt":0.3341769787668663,"spread":0.2924890973072963,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002566022,0.0001788877,0.0002524959,0.0001750245,0.000288745,0.00006335763,0.0001590662,0.0001039886,0.0003184182],"category_scores_gemma":[0.0001626137,0.0001570256,0.00005134513,0.0006151324,0.00007253623,0.0001243911,0.0001055133,0.0001562528,0.0001824591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001595431,"about_ca_system_score_gemma":0.00001430788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004889946,"about_ca_topic_score_gemma":0.000005711534,"domain_scores_codex":[0.9987966,0.0000197135,0.0004089389,0.000337952,0.0001781232,0.0002586811],"domain_scores_gemma":[0.9986475,0.0005579299,0.0001098529,0.00039038,0.00008586375,0.0002084887],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001458669,0.0001366035,0.00003281629,0.000147589,0.00002179745,1.434237e-7,0.0001837638,0.000001625501,0.0001462579,0.9901561,0.001451452,0.007720449],"study_design_scores_gemma":[0.0006609765,0.00006066896,0.0004374775,0.00004177129,0.0001864133,0.00004980211,0.0005661512,0.01368169,0.001560994,0.4580235,0.524105,0.0006255635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5671196,0.005659149,0.38417,0.01529539,0.00004494703,0.003365731,0.0003741757,0.0007806747,0.02319037],"genre_scores_gemma":[0.8808134,0.0008738322,0.1047932,0.0006107896,0.0007339122,0.0009348078,0.0000450316,0.00007567633,0.01111946],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5321326,"threshold_uncertainty_score":0.6403317,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2031324894","doi":"10.1016/j.laa.2013.02.030","title":"Two Laplacians for the distance matrix of a graph","year":2013,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":252,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Algebraic connectivity; Resistance distance; Mathematics; Laplacian matrix; Distance matrix; Combinatorics; Laplace operator; Eigenvalues and eigenvectors; Connectivity; Graph; Discrete mathematics; Line graph; Mathematical analysis; Graph power; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02218523395327058,"gpt":0.3144036897424108,"spread":0.2922184557891402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001336656,0.00009131915,0.0001243136,0.00003154511,0.0002684576,0.00001938846,0.000195993,0.00003538986,0.00006596531],"category_scores_gemma":[0.00004537535,0.00006362156,0.00007203234,0.0002376201,0.00009551367,0.0000611049,0.0000263914,0.00006334291,0.00002901574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002817625,"about_ca_system_score_gemma":0.00001030461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008692384,"about_ca_topic_score_gemma":0.00001259352,"domain_scores_codex":[0.9994077,0.00001382904,0.0002265236,0.0001548899,0.00006841641,0.000128642],"domain_scores_gemma":[0.9985947,0.000786988,0.0001093971,0.0003429429,0.000119361,0.00004661024],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002934447,0.00006286507,0.000025806,0.00004637682,0.0000223453,6.964153e-9,0.0001231399,0.000002505869,0.001577721,0.9958151,0.0009941204,0.001327056],"study_design_scores_gemma":[0.0002491448,0.00001568077,0.0001463683,0.000008519872,0.00006901226,0.00000184747,0.0002674107,0.001644916,0.001988377,0.9542289,0.04128619,0.00009360564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.160078,0.002077475,0.8191006,0.007514049,0.00005021087,0.007311083,0.0005563132,0.0001961941,0.003116088],"genre_scores_gemma":[0.9797865,0.0001538001,0.01402035,0.0001130223,0.00009647847,0.004342872,0.00002165751,0.00002198147,0.001443343],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8197085,"threshold_uncertainty_score":0.2594412,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056415888","doi":"10.1016/j.laa.2007.05.036","title":"The minimum rank of symmetric matrices described by a graph: A survey","year":2007,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":244,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Rank (graph theory); Graph; Simple graph; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03118969790938455,"gpt":0.3016897495124434,"spread":0.2705000516030588,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001376799,0.000133746,0.0001811741,0.0001326657,0.0004228226,0.00002856046,0.0002960294,0.00008182303,0.00001259019],"category_scores_gemma":[0.0002724455,0.00009799538,0.00007160094,0.001414864,0.0001371782,0.00005491868,0.00005003939,0.0001232033,0.00001812476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000600762,"about_ca_system_score_gemma":0.0000171562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001926712,"about_ca_topic_score_gemma":0.00005119175,"domain_scores_codex":[0.9988688,0.00007066882,0.0004420001,0.0002219835,0.0001627669,0.0002337506],"domain_scores_gemma":[0.996069,0.003046157,0.0002117483,0.0003993314,0.0001729154,0.0001008856],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002250741,0.0001718831,0.000505042,0.00003644202,0.00004362601,7.930494e-8,0.0001063313,1.208546e-7,0.00264457,0.9907371,0.002430929,0.003301352],"study_design_scores_gemma":[0.0007686998,0.00008046339,0.007371467,0.0000227381,0.0001745529,0.00001013058,0.0005104856,0.0003004421,0.01645203,0.930431,0.04348927,0.0003886925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9469641,0.005055892,0.04298107,0.0005403548,0.00003780701,0.001559977,0.0003073518,0.0001250783,0.002428318],"genre_scores_gemma":[0.9965568,0.0006254836,0.001905183,0.00005835285,0.00004443751,0.0002184515,0.00004536687,0.00002241556,0.0005234763],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06030608,"threshold_uncertainty_score":0.3996135,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099618798","doi":"10.1016/j.laa.2010.03.008","title":"Zero forcing parameters and minimum rank problems","year":2010,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":198,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Positive-definite matrix; Vertex (graph theory); Rank (graph theory); Hermitian matrix; Zero (linguistics); Semidefinite programming; Graph; Discrete mathematics; Eigenvalues and eigenvectors; Pure mathematics; Physics; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.02579778177367733,"gpt":0.2811280914133138,"spread":0.2553303096396365,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002055113,0.0001341396,0.0001511988,0.00005925448,0.0003253171,0.00004515516,0.00012594,0.00009706741,0.0000277493],"category_scores_gemma":[0.00007006133,0.0001204918,0.00003905524,0.0001849693,0.0001078685,0.0000935749,0.00005249938,0.0002153313,0.00002922108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002358994,"about_ca_system_score_gemma":0.00001143676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003151167,"about_ca_topic_score_gemma":0.00001105462,"domain_scores_codex":[0.9992177,0.00001616106,0.00022956,0.0002795598,0.00007817691,0.0001787714],"domain_scores_gemma":[0.9990528,0.0003606412,0.00008508138,0.0003215939,0.00005244665,0.0001274189],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002663531,0.00006452276,0.0001011415,0.00005832087,0.00001667855,9.086612e-8,0.0002683006,8.297654e-7,0.02103812,0.9750798,0.0002543584,0.003115169],"study_design_scores_gemma":[0.0003286431,0.00002219378,0.0002120962,0.00001350733,0.00006683332,0.00001936328,0.00008829444,0.001515254,0.005085784,0.9685696,0.02387368,0.0002047571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9760076,0.0001471815,0.01970846,0.001006078,0.00003269396,0.001117002,0.00003198973,0.0001454377,0.001803538],"genre_scores_gemma":[0.9789301,0.00007316236,0.0195266,0.0001394291,0.00006554009,0.0007049121,0.00001617419,0.00002489122,0.0005191599],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02361932,"threshold_uncertainty_score":0.4913513,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966104103","doi":"10.1016/j.laa.2006.01.007","title":"Algorithms for model reduction of large dynamical systems","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":191,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Agence Nationale pour la Gestion des Déchets Radioactifs; Deutscher Akademischer Austauschdienst; University of Calgary","keywords":"Observability; Controllability; Mathematics; Reduction (mathematics); Model order reduction; Dynamical systems theory; Heuristic; Linear system; Algorithm; Matrix (chemical analysis); Gramian matrix; LTI system theory; Rank (graph theory); Low-rank approximation; Linear dynamical system; Mathematical optimization; Applied mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01533384924865086,"gpt":0.2759695880064222,"spread":0.2606357387577714,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004727767,0.00007575304,0.0001129404,0.00002831699,0.000112336,0.00001269845,0.00004804033,0.00003743202,0.00001291492],"category_scores_gemma":[5.184826e-7,0.00007042194,0.00004989238,0.000085201,0.00001937356,0.00005742296,0.00001373578,0.00005723842,0.000003644127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004636314,"about_ca_system_score_gemma":0.00001314942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000200968,"about_ca_topic_score_gemma":3.181563e-7,"domain_scores_codex":[0.999454,0.000007095677,0.00019343,0.000166947,0.00005685017,0.0001216892],"domain_scores_gemma":[0.9996904,0.0000155163,0.00007320048,0.0001066798,0.00007500668,0.00003918556],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006621571,0.0001490206,0.00003443975,0.00002402172,0.00001474946,7.179558e-9,0.00001802124,0.01577219,0.003585055,0.9765481,0.0009939477,0.002853882],"study_design_scores_gemma":[0.0002499729,0.00001183827,0.0000203844,0.000005173644,0.00002179869,9.520643e-7,0.0000488566,0.9807169,0.001376502,0.01103486,0.006433888,0.00007881796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07046708,0.0002094509,0.9269754,0.0001694456,0.00006625325,0.0006353284,0.0002211196,0.00003092493,0.001224974],"genre_scores_gemma":[0.9947715,0.000009724909,0.00217631,0.000006450259,0.0006309596,0.0003377619,0.0002226403,0.00001191531,0.001832672],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9655132,"threshold_uncertainty_score":0.2871723,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2060910570","doi":"10.1016/j.laa.2004.09.022","title":"A pathway to matrix-variate gamma and normal densities","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Statistical Mechanics and Entropy","field":"Physics and Astronomy","cited_by":175,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Random variate; Mathematics; Multivariate normal distribution; Cauchy distribution; Matrix (chemical analysis); Random matrix; Gaussian; Applied mathematics; Mathematical analysis; Random variable; Statistics; Multivariate statistics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.007306171058247457,"gpt":0.246914233950507,"spread":0.2396080628922596,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003288889,0.0000871992,0.00009608991,0.00002635468,0.000143779,0.00004470845,0.00004623286,0.00002122145,0.00008378457],"category_scores_gemma":[0.00000366057,0.00008020775,0.00001822701,0.00008468035,0.00001415657,0.00004277122,0.00005144094,0.00006082732,0.0001027226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004893371,"about_ca_system_score_gemma":0.00002173678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005169316,"about_ca_topic_score_gemma":0.000001506211,"domain_scores_codex":[0.999503,0.000005290814,0.0001135504,0.0001705293,0.00005689954,0.0001507661],"domain_scores_gemma":[0.9996732,0.00002863462,0.00002283968,0.00009823545,0.00003661764,0.0001404457],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003712191,0.00002652129,0.00005926234,0.000006047678,0.00001171738,3.173032e-7,0.0001205483,0.00001761447,0.000740268,0.9879105,0.00002732311,0.01107614],"study_design_scores_gemma":[0.002745893,0.0003554367,0.006732364,0.00006596898,0.0001616664,0.00001767043,0.001099389,0.02293886,0.01733009,0.7900735,0.1573587,0.001120534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2940753,0.0001780043,0.7019865,0.00120485,0.00004130599,0.000451347,0.0002416526,0.00004194118,0.001779085],"genre_scores_gemma":[0.9917782,0.00001278105,0.007263641,0.0001615178,0.0002398052,0.0001251317,0.00002897978,0.00001172349,0.0003782054],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6977029,"threshold_uncertainty_score":0.3270777,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034647728","doi":"10.1016/s0024-3795(01)00313-5","title":"Discrete nodal domain theorems","year":2001,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":152,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; NODAL; Domain (mathematical analysis); Modified nodal analysis; Pure mathematics; Discrete mathematics; Algebra over a field; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03323453719590688,"gpt":0.3172663566254125,"spread":0.2840318194295056,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001925406,0.0001140699,0.0001468284,0.00007988928,0.0001923467,0.00003840013,0.0001312287,0.0000593384,0.0001915712],"category_scores_gemma":[0.00009575141,0.00009090119,0.00004174333,0.0004075901,0.00004523963,0.000103873,0.00005548215,0.00009510734,0.00009234621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007731328,"about_ca_system_score_gemma":0.00001617902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005831475,"about_ca_topic_score_gemma":0.000004506803,"domain_scores_codex":[0.9992437,0.00001713888,0.0002190426,0.0001925897,0.0001294586,0.0001980703],"domain_scores_gemma":[0.9993106,0.0002508179,0.00006792568,0.0002184038,0.00006974641,0.00008248405],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004845113,0.00005350478,0.00006171883,0.00004661797,0.00001419239,7.56283e-7,0.0002862875,4.06296e-7,0.000110672,0.997038,0.0003438818,0.002039105],"study_design_scores_gemma":[0.0002243841,0.00002823997,0.0001068221,0.00001073995,0.00002170429,0.00002529402,0.0004302159,0.0003290153,0.000384689,0.83857,0.1597081,0.0001608416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5837735,0.002072812,0.3344673,0.004136006,0.00008183446,0.001090097,0.0001252834,0.0003793971,0.07387377],"genre_scores_gemma":[0.9823006,0.0005824987,0.008878994,0.0003291043,0.0004799917,0.0002518315,0.00003518547,0.00003149713,0.007110333],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3985271,"threshold_uncertainty_score":0.3706843,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050482406","doi":"10.1016/s0024-3795(03)00420-8","title":"The spectral theorem in quaternions","year":2003,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Algebraic and Geometric Analysis","field":"Mathematics","cited_by":139,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Quaternion; Mathematics; Exposition (narrative); Pure mathematics; Algebra over a field; Spectral theorem; Geometry; Operator theory","retraction":null,"screen_n_in":null,"score":{"opus":0.02278660166197068,"gpt":0.2924544386110342,"spread":0.2696678369490635,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000377896,0.0001010105,0.0001337896,0.00008789178,0.0002898136,0.00003304625,0.0001401911,0.00005264776,0.00009723839],"category_scores_gemma":[0.0002755226,0.00006717211,0.00005422169,0.0007155752,0.00006404863,0.00004635023,0.00002367516,0.0001366089,0.00009340754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001499626,"about_ca_system_score_gemma":0.00002437884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007514502,"about_ca_topic_score_gemma":0.00005151688,"domain_scores_codex":[0.9991891,0.00005527743,0.0002433557,0.0001860143,0.0001182624,0.0002079962],"domain_scores_gemma":[0.9989464,0.0006153972,0.00006346625,0.0002701181,0.00003920582,0.0000653587],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001320646,0.00004618429,0.0005300826,0.000004871395,0.00001977183,3.003575e-7,0.0001203849,0.000001491946,0.00001355279,0.9969873,0.0002414042,0.002033319],"study_design_scores_gemma":[0.0002431384,0.00001630457,0.001245614,0.000005117712,0.00005097563,0.000008099903,0.000559448,0.0009488098,0.0003686265,0.9234087,0.07298879,0.0001564187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7491024,0.0062108,0.1605346,0.005713314,0.0001146831,0.002054678,0.00003396038,0.0002628,0.07597285],"genre_scores_gemma":[0.9938481,0.0004874502,0.00173584,0.00008370195,0.00006360969,0.0001513463,0.000004698041,0.00001450818,0.003610684],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2447458,"threshold_uncertainty_score":0.2739199,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081729430","doi":"10.1016/s0024-3795(02)00352-x","title":"Ranks of tensors, secant varieties of Segre varieties and fat points","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":127,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Pure mathematics; Projective variety; Variety (cybernetics); Product (mathematics); Algebraic variety; Algebraic geometry; Lemma (botany); Projective space; Projective test; Algebraic number; Algebra over a field; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03566932599326967,"gpt":0.2769585882640512,"spread":0.2412892622707816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008552296,0.0001314303,0.000262849,0.0000743926,0.0001365199,0.00001535067,0.000114249,0.00009096471,0.0002363641],"category_scores_gemma":[0.0000424242,0.000117666,0.00004959244,0.0001946268,0.0001641501,0.00006756634,0.00005776523,0.0001078994,0.00001537401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004898102,"about_ca_system_score_gemma":0.000006523363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006967811,"about_ca_topic_score_gemma":0.000002734996,"domain_scores_codex":[0.9991221,0.00002640475,0.0003805104,0.0002069479,0.0001408008,0.0001232285],"domain_scores_gemma":[0.999019,0.0002560937,0.0001776027,0.0002966977,0.0001719372,0.00007864944],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006745687,0.0002447215,0.0001155866,0.0001866793,0.00004919002,1.29446e-7,0.001264504,0.000003737714,0.004622958,0.9897556,0.00196234,0.00178778],"study_design_scores_gemma":[0.002191577,0.0002194408,0.004278285,0.0001213111,0.0004972098,0.00007980771,0.001913205,0.020467,0.03511982,0.8917924,0.04246183,0.0008581748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9176963,0.003746407,0.05988477,0.005511843,0.00004779971,0.002334503,0.000659975,0.0002934982,0.009824933],"genre_scores_gemma":[0.9880295,0.0004325193,0.01007106,0.00009110881,0.000053235,0.0001249709,0.0000177702,0.00002015006,0.001159713],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0979633,"threshold_uncertainty_score":0.4798279,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2137496495","doi":"10.1016/j.laa.2010.02.002","title":"On the normalized Laplacian energy and general Randić index <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mrow><mml:msub><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math> of graphs","year":2010,"lang":"lv","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":120,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Adjacency matrix; Combinatorics; Energy (signal processing); Laplacian matrix; Upper and lower bounds; Laplace operator; Mathematics; Edit distance; Algorithm; Eigenvalues and eigenvectors; Discrete mathematics; Graph; Physics; Statistics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01442548016866956,"gpt":0.2381827723223012,"spread":0.2237572921536317,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002036999,0.0009249045,0.0004134406,0.0006063473,0.00244957,0.001114988,0.002143396,0.002346403,0.3665301],"category_scores_gemma":[0.001109839,0.001601034,0.001563133,0.001598678,0.002146285,0.001020353,0.001458025,0.00180669,0.001027837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008336499,"about_ca_system_score_gemma":0.0009621494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009994215,"about_ca_topic_score_gemma":0.001719849,"domain_scores_codex":[0.9918491,0.0004621437,0.002013977,0.001784572,0.001890662,0.001999584],"domain_scores_gemma":[0.991246,0.002488149,0.002138589,0.002729347,0.0002571532,0.001140798],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0009246072,0.0004692604,0.00001334123,0.0007558052,0.001258208,0.0001060896,0.001635015,0.0002850262,0.007047366,0.7994109,0.1864462,0.001648161],"study_design_scores_gemma":[0.002522831,0.0009718343,0.0001174354,0.0005870775,0.001754611,0.0007164342,0.001397136,0.03531241,0.9397447,0.003932878,0.0113935,0.001549226],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5783156,0.001108966,0.001590359,0.001025043,0.0008758712,0.00009133579,0.0006073209,0.0002048867,0.4161806],"genre_scores_gemma":[0.9857825,0.002141213,0.002492472,0.002047777,0.001649758,0.003237366,0.001275846,0.0006836473,0.0006894149],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9326972,"threshold_uncertainty_score":0.999922,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136122855","doi":"10.1016/j.laa.2004.05.011","title":"On distance matrices and Laplacians","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":114,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Distance matrix; Combinatorics; Distance matrices in phylogeny; Matrix (chemical analysis); Resistance distance; Laplacian matrix; Inverse; Grid; Tree (set theory); Graph; Geometry; Line graph; Graph power","retraction":null,"screen_n_in":null,"score":{"opus":0.01686434030436172,"gpt":0.283984919567014,"spread":0.2671205792626523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007993645,0.0001040881,0.0001066314,0.00004464474,0.0002799759,0.00002749995,0.0000906985,0.00005064483,0.00002072099],"category_scores_gemma":[0.000032048,0.00009194142,0.00002406516,0.0002001213,0.00006217216,0.00006024895,0.00002480664,0.00009042629,0.00006150745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000754273,"about_ca_system_score_gemma":0.00001010745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001686182,"about_ca_topic_score_gemma":0.000007783775,"domain_scores_codex":[0.9994262,0.00001023019,0.0001462864,0.0002213528,0.00007424034,0.000121648],"domain_scores_gemma":[0.9994127,0.000202977,0.00005687877,0.0002176859,0.00002935707,0.00008036644],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004102642,0.00008883845,0.00001407374,0.00002991294,0.000007868731,2.082638e-7,0.0001448634,0.000003400005,0.0003007004,0.9983715,0.0001116689,0.0009228612],"study_design_scores_gemma":[0.0002504392,0.00002637778,0.0001786097,0.00001831689,0.0000266021,0.00000642742,0.00008135945,0.00006031289,0.001079383,0.9787042,0.01944907,0.0001188802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9131601,0.001106459,0.0699707,0.004331592,0.00002471909,0.001242118,0.0001504762,0.0002960339,0.00971776],"genre_scores_gemma":[0.9940565,0.0003268196,0.004534596,0.0002329348,0.00006380727,0.0003174489,0.00001208782,0.00001689411,0.0004389321],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08089633,"threshold_uncertainty_score":0.3749262,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02723798894730929,"gpt":0.2822941735064546,"spread":0.2550561845591453,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009092621,0.00008641165,0.0001275413,0.00005785376,0.0002266428,0.000046364,0.0001826072,0.00005164442,0.00005156912],"category_scores_gemma":[0.00001653136,0.00007474665,0.00004068676,0.0001647637,0.00005417553,0.0001909848,0.0001277864,0.00004682569,0.000005100267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003490683,"about_ca_system_score_gemma":0.000009498359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002865581,"about_ca_topic_score_gemma":2.485413e-7,"domain_scores_codex":[0.9993935,0.00002037886,0.0001696081,0.0002202018,0.00007002775,0.0001262944],"domain_scores_gemma":[0.9994627,0.0001016072,0.000066439,0.0002361375,0.00005794355,0.00007515058],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009256351,0.0001457042,0.00004428039,0.00008653832,0.00002881222,4.333791e-7,0.0006418558,0.00005982526,0.02839127,0.9564577,0.0006055411,0.01352883],"study_design_scores_gemma":[0.001120517,0.00007139938,0.00004645615,0.00003332231,0.00004836682,0.00002109244,0.00005109892,0.8587249,0.01360488,0.04464542,0.08133519,0.0002973814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1687235,0.00284958,0.8264238,0.0005970213,0.00009675032,0.0006738748,0.00005605055,0.00008054292,0.0004988597],"genre_scores_gemma":[0.7064714,0.0006492627,0.2898962,0.0003292602,0.0002724247,0.0002131104,0.000009669924,0.00002148705,0.002137115],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9118122,"threshold_uncertainty_score":0.304808,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01592799521258953,"gpt":0.2277478120045485,"spread":0.211819816791959,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001109295,0.0001173569,0.000110498,0.00004223533,0.000348416,0.00009657164,0.0003017111,0.00005138413,0.00006261586],"category_scores_gemma":[0.000002506355,0.00009533903,0.00002611555,0.000249219,0.00007233529,0.0002988153,0.00004774353,0.00009954729,0.0001094837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005147251,"about_ca_system_score_gemma":0.00002455001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003479943,"about_ca_topic_score_gemma":0.00000145914,"domain_scores_codex":[0.9991983,0.0000181907,0.0001791106,0.0003321326,0.00009717062,0.0001751089],"domain_scores_gemma":[0.9994782,0.00003174063,0.00002650799,0.0003047199,0.00003578374,0.000123112],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000003544656,0.00007174402,0.00001098007,0.00003952593,0.00001047014,2.692068e-7,0.0004050601,0.00001303425,0.000670981,0.6834564,0.00002162358,0.3152963],"study_design_scores_gemma":[0.0005979176,0.00009281321,0.0005435706,0.00002325287,0.00003288425,0.00007548217,0.00009378063,0.05502445,0.006381342,0.05334755,0.8832697,0.000517322],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07965682,0.004859668,0.8898246,0.003544805,0.00003314915,0.002644765,0.00004530028,0.0006477658,0.0187431],"genre_scores_gemma":[0.975705,0.001699493,0.01452765,0.0006432307,0.0003769737,0.001837143,0.0000162589,0.00002174642,0.005172469],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8960482,"threshold_uncertainty_score":0.3887812,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081492879","doi":"10.1016/j.laa.2006.03.019","title":"Higher-rank numerical ranges and compression problems","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph; Perimeter Institute; University of Waterloo; University of Toronto","funders":"","keywords":"Mathematics; Rank (graph theory); Numerical range; Hermitian matrix; Projection (relational algebra); Compression (physics); Range (aeronautics); Numerical analysis; Applied mathematics; Algorithm; Pure mathematics; Mathematical analysis; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01009308424078874,"gpt":0.2281358348457588,"spread":0.21804275060497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005531354,0.00008584451,0.00008997051,0.00006333276,0.0002041922,0.00009927816,0.0001704172,0.0000449123,0.0000160632],"category_scores_gemma":[0.000001547469,0.00007085071,0.00002289692,0.0002832034,0.00003509282,0.000279102,0.00007694197,0.0000712527,0.00004217608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002587045,"about_ca_system_score_gemma":0.000007252517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001203774,"about_ca_topic_score_gemma":9.078658e-7,"domain_scores_codex":[0.9994016,0.00001386636,0.0001679245,0.0001820541,0.0001107795,0.0001237251],"domain_scores_gemma":[0.9996097,0.00003768862,0.00005588956,0.0001810324,0.00004433633,0.00007132702],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001415407,0.00005476852,0.0003044314,0.00002655596,0.000004540933,1.518284e-7,0.000109425,0.00002201575,0.000966016,0.9820194,0.001381152,0.01511017],"study_design_scores_gemma":[0.0007237026,0.00006006478,0.02581237,0.0000214985,0.00001304108,0.00001688182,0.00001979159,0.1463134,0.002139247,0.04326361,0.7812815,0.0003348106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03058432,0.002317194,0.952863,0.004819126,0.00007135248,0.0006228555,0.00001135942,0.0003829077,0.008327836],"genre_scores_gemma":[0.988291,0.0001857475,0.01061542,0.0004459954,0.00009485953,0.0001327334,0.00002003015,0.000005876805,0.0002083397],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9577067,"threshold_uncertainty_score":0.2889208,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988353915","doi":"10.1016/j.laa.2004.06.019","title":"Computation of minimal rank and path cover number for certain graphs","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":92,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Rank (graph theory); Cover (algebra); Disjoint sets; Vertex (graph theory); Path (computing); Vertex cover; Discrete mathematics; Graph; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02397068020351504,"gpt":0.3067599322323091,"spread":0.282789252028794,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001332555,0.0001017327,0.0001566517,0.00004035481,0.0001695672,0.00001325798,0.00006436109,0.0000640462,0.00001268679],"category_scores_gemma":[0.0000380294,0.00009567421,0.00005057985,0.0001763733,0.00008061339,0.00006333958,0.000021625,0.00005397146,0.00001006286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000489575,"about_ca_system_score_gemma":0.00001844725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003309506,"about_ca_topic_score_gemma":0.000001762985,"domain_scores_codex":[0.999364,0.00001377078,0.0002447803,0.0001950034,0.00006995309,0.000112453],"domain_scores_gemma":[0.9993324,0.0002595461,0.0001111653,0.0001362038,0.00009845686,0.00006221018],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001407917,0.0001311132,0.00009763869,0.0001104114,0.00002163195,4.438648e-8,0.0002815726,0.00001215256,0.001865567,0.996446,0.0001433416,0.0008764362],"study_design_scores_gemma":[0.0008377607,0.00003793665,0.0005332395,0.00002087275,0.00007062,0.000006455542,0.0001282015,0.0007691705,0.002914108,0.9920221,0.002539766,0.0001197631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8452337,0.0001645511,0.1517942,0.000584557,0.00001205713,0.001284637,0.0001538794,0.00005782416,0.0007145879],"genre_scores_gemma":[0.9736887,0.00005621766,0.02555738,0.00007169908,0.00003477511,0.0004411854,0.00004393825,0.00001650908,0.00008954286],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.128455,"threshold_uncertainty_score":0.3901481,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2600111037","doi":"10.1016/j.laa.2017.03.014","title":"Two finite-time convergent Zhang neural network models for time-varying complex matrix Drazin inverse","year":2017,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Science and Technology Commission of Shanghai Municipality; Fudan University","keywords":"Drazin inverse; Mathematics; Inverse; Matrix (chemical analysis); Convergence (economics); Zhàng; Moore–Penrose pseudoinverse; Function (biology); Artificial neural network; Applied mathematics; Pure mathematics; Geometry; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03959575472427649,"gpt":0.2991370148100499,"spread":0.2595412600857734,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0001581712,0.0002061369,0.000240356,0.00004211827,0.001638551,0.0003630286,0.001020324,0.00006773965,0.0000417928],"category_scores_gemma":[0.00001503181,0.000200647,0.0001005752,0.0001829602,0.0000822546,0.0005643474,0.0004364294,0.000132392,0.0002474389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001407923,"about_ca_system_score_gemma":0.00003131388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001384179,"about_ca_topic_score_gemma":0.000005307297,"domain_scores_codex":[0.998578,0.00002444485,0.0003092653,0.0005442259,0.0001395339,0.0004045223],"domain_scores_gemma":[0.9982544,0.0002268327,0.0002312308,0.0009573858,0.0001218385,0.0002083647],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002056432,0.0001686146,0.00008193994,0.00005277639,0.0000754816,0.000001992316,0.0001860273,0.1391508,0.006599546,0.8082632,0.02401113,0.02138794],"study_design_scores_gemma":[0.0004282015,0.00002495451,0.0000815417,0.0000100026,0.00002363617,0.000004562794,0.00000215203,0.9485909,0.0001690464,0.02392937,0.02650911,0.0002265537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01334879,0.0005139805,0.970823,0.009140193,0.000174084,0.002822169,0.0001353794,0.0004409855,0.002601401],"genre_scores_gemma":[0.8530057,0.0002320915,0.1361304,0.002212365,0.001767164,0.001807932,0.0002704324,0.00006992981,0.004503977],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8396569,"threshold_uncertainty_score":0.9996612,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03626934322608164,"gpt":0.3461622929148682,"spread":0.3098929496887866,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003830029,0.0001041214,0.0001421221,0.00003706822,0.0002623716,0.00007633236,0.0003623796,0.00004070465,0.0000833922],"category_scores_gemma":[0.0000468894,0.00009399047,0.00005955986,0.0002856175,0.00002877114,0.0002081815,0.0001205374,0.00009081882,0.00004766495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000948505,"about_ca_system_score_gemma":0.000009051505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001409238,"about_ca_topic_score_gemma":9.80347e-8,"domain_scores_codex":[0.9991127,0.0000721779,0.0001981112,0.0003554873,0.00006499444,0.0001964948],"domain_scores_gemma":[0.9989894,0.0003914929,0.00005602966,0.0003812993,0.00006695175,0.0001148346],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001905819,0.00008640184,0.000004893953,0.00002362889,0.000009812998,1.319602e-7,0.0002274665,0.00003899218,0.001128792,0.8512519,0.00008090478,0.1471452],"study_design_scores_gemma":[0.0002758345,0.00003615862,0.000008420038,0.000002627566,0.00001205782,0.00000859075,0.00002161529,0.8935222,0.006145175,0.03715441,0.06265279,0.0001601315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000406878,0.0009867639,0.9958251,0.001144616,0.00004975395,0.0005036628,0.00001068598,0.0001510495,0.0009214825],"genre_scores_gemma":[0.03240717,0.00006096622,0.9664787,0.0001813429,0.0001608738,0.0003275431,0.000004172113,0.000009302315,0.00036991],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8934832,"threshold_uncertainty_score":0.383282,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076585714","doi":"10.1016/j.laa.2011.04.022","title":"Perfect state transfer in cubelike graphs","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Transfer (computing); Discrete mathematics; State (computer science); Trivially perfect graph; Graph; Code (set theory); Set (abstract data type); Algorithm; Chordal graph; Computer science; 1-planar graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01454557259863487,"gpt":0.2229674530085283,"spread":0.2084218804098935,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001173261,0.0001091052,0.0001101097,0.0001101972,0.000116508,0.00003223163,0.0003358139,0.00003597107,0.00001051807],"category_scores_gemma":[0.000002948721,0.00009420688,0.00003653424,0.0004321177,0.00002920341,0.0001092463,0.00007100105,0.0001578764,0.00003284179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004022846,"about_ca_system_score_gemma":0.0000210342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000281702,"about_ca_topic_score_gemma":0.0000135731,"domain_scores_codex":[0.9991946,0.00002764828,0.0001655333,0.0003217529,0.00008644566,0.0002040744],"domain_scores_gemma":[0.9995643,0.00003960913,0.00001697844,0.0002655518,0.000029156,0.00008443768],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009464884,0.0003707807,0.001430384,0.00005667469,0.00003016947,0.00001178092,0.009918209,0.0001905161,0.001992248,0.6094906,0.00007178646,0.3764274],"study_design_scores_gemma":[0.0008929117,0.000226381,0.0277948,0.000043141,0.00001411095,0.00005477289,0.00004427374,0.8463457,0.008576096,0.1007635,0.01457153,0.0006728835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5308571,0.0005071905,0.4668107,0.0003337108,0.00004965327,0.0003350288,0.000007197463,0.0001603931,0.0009389867],"genre_scores_gemma":[0.9840864,0.0001076999,0.01539716,0.000223257,0.00003157757,0.00006526492,0.000002576999,0.000009379188,0.00007671009],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8461551,"threshold_uncertainty_score":0.3841645,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108587835","doi":"10.1016/j.laa.2006.01.029","title":"On the diameters of commuting graphs","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":87,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; School of Mathematics, Institute for Research in Fundamental Sciences","keywords":"Mathematics; Combinatorics; Graph; Invertible matrix; Idempotence; Conjecture; Algebraically closed field; Nilpotent; Discrete mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03077650466669636,"gpt":0.297366897332938,"spread":0.2665903926662416,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001213708,0.00008291209,0.0001097118,0.00003593077,0.000155454,0.000008913369,0.0001528492,0.00003721409,0.00002791845],"category_scores_gemma":[0.0001162953,0.00005893961,0.00003973407,0.0001726256,0.00007774524,0.00002847793,0.00004415649,0.0001185991,0.00001254138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006097709,"about_ca_system_score_gemma":0.000006040426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004509342,"about_ca_topic_score_gemma":0.000004516466,"domain_scores_codex":[0.9994321,0.00002378211,0.0002088467,0.0001241959,0.0001032412,0.000107762],"domain_scores_gemma":[0.9984061,0.001088381,0.0001111077,0.0003297482,0.00004331363,0.0000213082],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000012262,0.00005221415,0.00005088391,0.00001806794,0.000007625545,6.910505e-8,0.00004864703,0.000004611037,0.0007380802,0.9980571,0.0003521657,0.0006692975],"study_design_scores_gemma":[0.00009379329,0.00001536202,0.0001962477,0.00001339384,0.00001541245,0.000001224876,0.00004935457,0.0003361824,0.006169752,0.9905023,0.002539582,0.00006741789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9502,0.0002610597,0.03262236,0.001535536,0.00003273019,0.0007902864,0.00003055476,0.00009899324,0.01442852],"genre_scores_gemma":[0.9897752,0.00002126036,0.009552197,0.0001657868,0.00005709581,0.0001078918,0.000006209279,0.00001656787,0.0002977525],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03957528,"threshold_uncertainty_score":0.2403487,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081655555","doi":"10.1016/j.laa.2008.08.020","title":"Graphs with integral spectrum","year":2008,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of Waterloo","funders":"University of Waterloo; Tel Aviv University; Israel Science Foundation","keywords":"Mathematics; Spectrum (functional analysis); Indifference graph; Combinatorics; Quantum graph; Upper and lower bounds; Chordal graph; Metric dimension; Discrete mathematics; 1-planar graph; Graph; Quantum mechanics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01069681153796435,"gpt":0.2131324528181155,"spread":0.2024356412801511,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003817033,0.00008647021,0.00007729236,0.0001093936,0.0002591832,0.00003979421,0.0002626633,0.00002932905,0.00001838152],"category_scores_gemma":[0.000002195021,0.00006523723,0.0000309645,0.000586731,0.00006232256,0.0003508731,0.00004448784,0.00009113063,0.0001127943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003219774,"about_ca_system_score_gemma":0.00002658388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004152038,"about_ca_topic_score_gemma":0.000003113707,"domain_scores_codex":[0.999441,0.000007558832,0.0001285001,0.0001651188,0.0001201321,0.0001377356],"domain_scores_gemma":[0.9995396,0.00001936981,0.00004548262,0.0002561518,0.00004485295,0.0000945058],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001615047,0.00002638564,0.000393711,0.000004024523,0.000007244386,7.066926e-7,0.0003084572,0.0000027219,0.00003515368,0.9967285,0.0003263588,0.002165153],"study_design_scores_gemma":[0.002466262,0.0007343907,0.05266388,0.00004408156,0.0000430988,0.001019169,0.0004288516,0.153814,0.01346578,0.1880737,0.5856431,0.001603769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1250575,0.0002665888,0.861385,0.002250127,0.00003434379,0.0003668895,0.00000582424,0.0003366516,0.01029706],"genre_scores_gemma":[0.9843398,0.0001956104,0.01449249,0.0006788396,0.00003472468,0.00009134803,0.000008945068,0.000005414911,0.0001528599],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8592822,"threshold_uncertainty_score":0.2660297,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126210866","doi":"10.1016/j.laa.2012.06.038","title":"On the geometric interpretation of the nonnegative rank","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Rank (graph theory); Combinatorics; Euclidean geometry; Polytope; Dimension (graph theory); Interpretation (philosophy); Matrix (chemical analysis); Euclidean distance; Nonnegative matrix; Discrete mathematics; Eigenvalues and eigenvectors; Symmetric matrix; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01457578188609575,"gpt":0.2460309477375614,"spread":0.2314551658514656,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002113077,0.000059002,0.00007990895,0.0001053592,0.0001643382,0.00002269939,0.0005107932,0.00002723569,0.00004123282],"category_scores_gemma":[0.0002430387,0.00002746639,0.00005113442,0.00224092,0.00005458633,0.000147551,0.0001728899,0.00008551903,0.00006481879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005561787,"about_ca_system_score_gemma":0.000006739287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006762085,"about_ca_topic_score_gemma":7.562855e-7,"domain_scores_codex":[0.9994435,0.00004781609,0.000132062,0.0001265321,0.0001408151,0.0001092769],"domain_scores_gemma":[0.998854,0.0006059851,0.00008859998,0.0003552147,0.00005543825,0.00004073454],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001375891,0.00007742415,0.0002720467,0.000002942527,0.00002064652,1.210101e-8,0.00023514,0.00002240813,0.00007001574,0.9696887,0.0003116336,0.02929765],"study_design_scores_gemma":[0.001241889,0.0004810466,0.2715227,0.00006913783,0.000411003,0.00002005539,0.0008325415,0.2973645,0.04241094,0.2686242,0.1159072,0.001114758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1111662,0.0009044818,0.8773002,0.006709672,0.00008333407,0.0004698735,0.0000326147,0.00003966619,0.003293984],"genre_scores_gemma":[0.9983974,0.00004305117,0.0007353746,0.0005188806,0.00004087108,0.00005680875,0.000003062857,0.000001795282,0.0002027632],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8872312,"threshold_uncertainty_score":0.1263973,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024123880","doi":"10.1016/s0024-3795(02)00356-7","title":"Graded polynomial identities of matrices","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":81,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Tensor product; Graded ring; Diagonal; Exterior algebra; Algebra over a field; Differential graded algebra; Combinatorics; Pure mathematics; Filtered algebra; Division algebra; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.04806700094760862,"gpt":0.3087262959551968,"spread":0.2606592950075882,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005241178,0.00009707821,0.0001619336,0.00007038581,0.0001019183,0.00001451529,0.0001509227,0.00005901319,0.0002276743],"category_scores_gemma":[0.00007181648,0.00009310379,0.0000422626,0.0001808043,0.00006713574,0.0001139506,0.00005873974,0.00008902324,0.00005794408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008286486,"about_ca_system_score_gemma":0.000004960038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001574701,"about_ca_topic_score_gemma":0.000001607485,"domain_scores_codex":[0.9993064,0.0000130436,0.0002676583,0.0001620165,0.0001242293,0.0001266647],"domain_scores_gemma":[0.9993221,0.0001973094,0.0001283198,0.0002443072,0.00005705925,0.00005095285],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000175924,0.00009819277,0.00007248443,0.0001084661,0.00002318627,3.817403e-7,0.0003273696,5.696692e-7,0.001363755,0.9940716,0.001667904,0.002264332],"study_design_scores_gemma":[0.0005107021,0.00004684851,0.0001945788,0.0000264798,0.00008713668,0.00001852872,0.0002104494,0.0008854038,0.0170163,0.9485629,0.03216485,0.0002758567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9553385,0.005110259,0.02045539,0.0009124058,0.0001400965,0.001156419,0.00008632208,0.0002861811,0.01651437],"genre_scores_gemma":[0.9726778,0.0008428861,0.01920422,0.00006821453,0.0003167721,0.0001317114,0.000006628488,0.00002884808,0.006722934],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04550874,"threshold_uncertainty_score":0.3796662,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2026427480","doi":"10.1016/s0024-3795(02)00324-5","title":"Some results on graph spectra","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":80,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Eigenvalues and eigenvectors; Mathematics; Graph; Combinatorics; Spectrum of a matrix; Matrix differential equation; Complement (music); Discrete mathematics; Mathematical analysis; Chemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.042263211883094,"gpt":0.2846238917333784,"spread":0.2423606798502844,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001388636,0.0001467187,0.0001444627,0.00009451094,0.0003235009,0.00002745007,0.0001757856,0.00007738604,0.0001102187],"category_scores_gemma":[0.00006747112,0.0001318805,0.00006642593,0.0003275588,0.00006390671,0.0000835756,0.00002799185,0.0001688606,0.0005534385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007109162,"about_ca_system_score_gemma":0.000003843544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.306248e-7,"about_ca_topic_score_gemma":0.000001347179,"domain_scores_codex":[0.9990484,0.00002633127,0.000277867,0.0003271637,0.0001243745,0.0001959349],"domain_scores_gemma":[0.998932,0.0003406759,0.00009064739,0.0004774694,0.00004105799,0.0001181641],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005824187,0.0002638476,0.000003068239,0.00001405761,0.00001496236,3.356238e-7,0.0001462893,0.000001354,0.0005453041,0.9933666,0.004412244,0.001226116],"study_design_scores_gemma":[0.0003704042,0.00004895133,0.0001112063,0.00001185221,0.00003314917,0.00000628219,0.00004737221,0.0005322424,0.002900498,0.9349124,0.06084622,0.0001794331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7842824,0.004569405,0.009567995,0.02881277,0.0002372278,0.0064215,0.001136014,0.002137837,0.1628349],"genre_scores_gemma":[0.9883781,0.0008513484,0.004047922,0.0006087041,0.0005376592,0.0006054566,0.0000382798,0.00003995285,0.004892595],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2040957,"threshold_uncertainty_score":0.7113517,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007600462144641165,"gpt":0.2275437875955632,"spread":0.219943325450922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007281041,0.00008614961,0.0000793535,0.00003113431,0.0001503979,0.00006621575,0.0003594754,0.00003550465,0.0004142133],"category_scores_gemma":[0.0000019152,0.00007816133,0.00003125465,0.0001824119,0.00001683836,0.0002178826,0.00004336654,0.00009461886,0.0004448032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003528685,"about_ca_system_score_gemma":0.00001566284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002740205,"about_ca_topic_score_gemma":7.554143e-7,"domain_scores_codex":[0.9993608,0.00001803136,0.0001274509,0.0002577985,0.00008265379,0.0001532937],"domain_scores_gemma":[0.9995407,0.00003767529,0.00002214242,0.0003050102,0.00001664749,0.00007775283],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001698177,0.00006577856,0.00005570446,0.00001274895,0.000008775448,0.000002570959,0.000144123,0.000006751534,0.0002411835,0.8653987,0.0001574003,0.1339045],"study_design_scores_gemma":[0.0008118056,0.0001569893,0.007685127,0.00003346649,0.00003067354,0.0001507537,0.00003342671,0.1039578,0.01233478,0.2690857,0.6048189,0.0009006622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2172361,0.001069864,0.7323734,0.004644252,0.00008572285,0.0007875498,0.00005003859,0.0006689521,0.04308422],"genre_scores_gemma":[0.9438719,0.0009205285,0.04206654,0.002968967,0.0007172464,0.0002172469,0.00003045033,0.000023821,0.009183285],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7266359,"threshold_uncertainty_score":0.5717194,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W301566927","doi":"10.1016/j.laa.2015.04.015","title":"Optimization on the Hierarchical Tucker manifold – Applications to tensor completion","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":77,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tensor (intrinsic definition); Subspace topology; Mathematics; Conjugate gradient method; Overfitting; Mathematical optimization; Manifold (fluid mechanics); Algorithm; Scalability; Optimization problem; Gradient descent; Computer science; Theoretical computer science; Artificial intelligence; Artificial neural network","retraction":null,"screen_n_in":null,"score":{"opus":0.08230579605464176,"gpt":0.3296400954964969,"spread":0.2473342994418551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002568478,0.0001938832,0.0001882468,0.0001110904,0.0004727075,0.00008149949,0.0002890962,0.00009111609,0.0001272984],"category_scores_gemma":[0.0001021102,0.0001485888,0.00005915839,0.0005397072,0.00005337156,0.00007090494,0.0000825075,0.0002133684,0.0007603188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004334562,"about_ca_system_score_gemma":0.00003400916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003144615,"about_ca_topic_score_gemma":0.000003550567,"domain_scores_codex":[0.9986493,0.00006715085,0.0003587937,0.0004078109,0.0002910697,0.0002258969],"domain_scores_gemma":[0.9982995,0.0004106598,0.0001067471,0.0005893959,0.0002795103,0.0003142224],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001174236,0.0002237614,0.00001857442,0.00001049581,0.00001557523,1.464513e-7,0.0001536344,0.0005149886,0.0003436936,0.9885709,0.00935933,0.000777122],"study_design_scores_gemma":[0.0009497041,0.0001895615,0.0008871443,0.00003970317,0.0001422094,0.00004625348,0.0005392682,0.05575865,0.001200814,0.2536813,0.6858504,0.0007150266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0189696,0.0000747321,0.9240396,0.0389928,0.00004053655,0.004703166,0.0001938226,0.0004839335,0.01250178],"genre_scores_gemma":[0.854355,0.00007300531,0.1212565,0.007960528,0.0009627057,0.01168747,0.0003824073,0.0001244813,0.003197837],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8353854,"threshold_uncertainty_score":0.9772614,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042309759","doi":"10.1016/s0024-3795(01)00312-3","title":"On graphs with equal algebraic and vertex connectivity","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":76,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Algebraic connectivity; Vertex (graph theory); Upper and lower bounds; Algebraic number; Connectivity; Inverse; Graph; Laplacian matrix; Laplace operator; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03212277417922123,"gpt":0.2675024210694715,"spread":0.2353796468902502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001194206,0.0001679484,0.0001772099,0.00008002886,0.0003738172,0.00003373818,0.0001053659,0.00007391673,0.0001361723],"category_scores_gemma":[0.00005652431,0.000136467,0.00003289852,0.0003037939,0.0001264705,0.00008858028,0.0000334412,0.000162318,0.00007879148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005754022,"about_ca_system_score_gemma":0.000005521015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001870738,"about_ca_topic_score_gemma":0.000007571666,"domain_scores_codex":[0.9991479,0.0000364298,0.0001673619,0.0003449645,0.0001182478,0.0001851228],"domain_scores_gemma":[0.9987269,0.000684555,0.00007355521,0.0003318715,0.00005037928,0.000132751],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000842142,0.0002020222,0.00005793136,0.00002758026,0.0000277383,4.031517e-7,0.0001805799,9.010644e-7,0.0003491025,0.9958363,0.00054165,0.002767398],"study_design_scores_gemma":[0.0005001741,0.000133685,0.0004166909,0.00002003072,0.00006476876,0.0000221413,0.00007864824,0.001449899,0.0008941105,0.9910335,0.005156578,0.000229789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9813362,0.0003671634,0.009981953,0.001044413,0.0000129027,0.0009287113,0.00005474328,0.0001946169,0.006079277],"genre_scores_gemma":[0.9974553,0.000121164,0.001232831,0.0002760439,0.0000307735,0.0004220071,0.000009315188,0.00002505047,0.0004275172],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01611908,"threshold_uncertainty_score":0.5564964,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058586197","doi":"10.1016/j.laa.2015.03.024","title":"Perfect state transfer on distance-regular graphs and association schemes","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Wetenschappelijk Onderzoek; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Transfer (computing); Association scheme; Representation (politics); Discrete mathematics; State (computer science); Simple (philosophy); Graph; Combinatorics; Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0104980829201604,"gpt":0.2296571553207347,"spread":0.2191590724005743,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002022909,0.0001134692,0.0001159473,0.00005666161,0.0001806128,0.0001014502,0.0001698297,0.00004574712,0.000001053678],"category_scores_gemma":[0.00001658057,0.00009602598,0.00002854347,0.0002530482,0.00002289189,0.0001095977,0.00004975884,0.0001364475,0.00001358102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001659668,"about_ca_system_score_gemma":0.00002624577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003888998,"about_ca_topic_score_gemma":0.000002347046,"domain_scores_codex":[0.9991625,0.00003401357,0.0001292303,0.0003143296,0.000187286,0.0001726385],"domain_scores_gemma":[0.9994658,0.00008356037,0.00003382338,0.0002048888,0.00007431221,0.0001376654],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001415027,0.0001871016,0.00131333,0.00004870171,0.00007258126,0.000002544785,0.002866712,0.0006030255,0.001187585,0.7661684,0.0007747611,0.2267611],"study_design_scores_gemma":[0.001149112,0.0003155959,0.003612281,0.00004098065,0.00002773204,0.0000139852,0.00004362605,0.76336,0.004893435,0.09055872,0.1354512,0.0005333073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5612741,0.0008570669,0.4346761,0.002370602,0.00006209066,0.0003051169,0.00001892808,0.0001908048,0.0002452468],"genre_scores_gemma":[0.9927588,0.0001091416,0.006372793,0.0002934232,0.00007154122,0.00004760906,0.000008685765,0.00001056489,0.0003274959],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.762757,"threshold_uncertainty_score":0.3915826,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01530175664444624,"gpt":0.2593083641973076,"spread":0.2440066075528613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001990825,0.0001799727,0.0001784242,0.0001032119,0.0003725432,0.00009718349,0.0004881645,0.00009230428,0.0001565859],"category_scores_gemma":[0.00003316544,0.0001692958,0.00009418314,0.000393448,0.00007502366,0.000149214,0.0001168075,0.0001244463,0.000529501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001736276,"about_ca_system_score_gemma":0.00001904594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001136061,"about_ca_topic_score_gemma":4.421206e-7,"domain_scores_codex":[0.9987096,0.00003161483,0.0002980198,0.0004975208,0.0001547822,0.0003085095],"domain_scores_gemma":[0.9989372,0.0001889166,0.0001071208,0.0004803792,0.000108278,0.0001780798],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003989669,0.0002207031,0.000003682964,0.00007647119,0.00002986082,7.886853e-7,0.0005292682,0.001332918,0.0005476301,0.9820994,0.002472028,0.01268324],"study_design_scores_gemma":[0.0004825804,0.00007180192,0.00002454574,0.0000116458,0.0000240127,0.00001316165,0.00003502513,0.8923299,0.002659435,0.01667349,0.08739807,0.0002763028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01668694,0.0009499303,0.9753602,0.002991538,0.0001359743,0.001387656,0.0001167217,0.000346069,0.002025024],"genre_scores_gemma":[0.7799645,0.0004546975,0.1993519,0.001598969,0.001636865,0.001720206,0.0001419529,0.00008535376,0.01504557],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9654259,"threshold_uncertainty_score":0.6903682,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147535338","doi":"10.1016/j.laa.2012.01.019","title":"Skew-adjacency matrices of graphs","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":72,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University; University of Regina; University of Calgary","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Consejo Nacional de Ciencia y Tecnología, Paraguay; National Science Foundation","keywords":"Adjacency list; Skew; Adjacency matrix; Mathematics; Combinatorics; Graph energy; Discrete mathematics; Graph; Line graph; Voltage graph; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03238476641123778,"gpt":0.3083849609204666,"spread":0.2760001945092288,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001996523,0.0001067199,0.0001523812,0.0000822853,0.0001613876,0.000007862726,0.0001479994,0.0000664922,0.000107803],"category_scores_gemma":[0.00003825863,0.00009384001,0.0000614376,0.0003916797,0.00006323009,0.0001265612,0.00004316019,0.0000862386,0.00006456939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003272488,"about_ca_system_score_gemma":0.000009060683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002394579,"about_ca_topic_score_gemma":9.042323e-7,"domain_scores_codex":[0.99929,0.00002445529,0.0002624186,0.00013981,0.00009888726,0.0001844412],"domain_scores_gemma":[0.9991449,0.000246255,0.0001326993,0.0002954828,0.00006820355,0.0001124663],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001886265,0.0001979863,0.0006713214,0.00006463702,0.00001754773,1.591201e-8,0.0002483011,9.641992e-8,0.0028746,0.9942673,0.0003993585,0.001256911],"study_design_scores_gemma":[0.0001581642,0.00001715933,0.001520374,0.00001342439,0.00009269781,0.000005950872,0.0001746754,0.00003955805,0.01101639,0.9524117,0.03439006,0.0001598766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9706006,0.003761697,0.01293881,0.0004520373,0.00004584422,0.001048745,0.0001040964,0.000174795,0.01087338],"genre_scores_gemma":[0.9887189,0.0003209318,0.0101329,0.00004550293,0.0001006331,0.0003040077,0.00001506804,0.00001703066,0.0003450047],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04185567,"threshold_uncertainty_score":0.3826685,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126719431","doi":"10.1016/j.laa.2006.10.020","title":"Large matchings from eigenvalues","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":69,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Combinatorics; Spectral radius; Eigenvalues and eigenvectors; Upper and lower bounds; Vertex (graph theory); Graph; Degree (music); Order (exchange); Discrete mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01713236139613076,"gpt":0.2810271631251643,"spread":0.2638948017290335,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001292118,0.0001292604,0.0001433829,0.00004372087,0.0003461955,0.00003462121,0.0001558599,0.00007547386,0.0001857825],"category_scores_gemma":[0.00001927645,0.0001199058,0.00005452862,0.000188885,0.00003775223,0.0000830766,0.00005367092,0.0001110897,0.0002238702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006300736,"about_ca_system_score_gemma":0.00001032641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002709574,"about_ca_topic_score_gemma":0.00002142823,"domain_scores_codex":[0.999181,0.00002376919,0.0002426583,0.0002664143,0.0001022583,0.0001839054],"domain_scores_gemma":[0.9992309,0.0002548301,0.00008365182,0.0003182298,0.00004824819,0.00006412634],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000018503,0.0001465727,0.000143859,0.00001175547,0.00001413211,1.647028e-7,0.0001328464,5.824809e-7,0.00261083,0.9950621,0.001587235,0.000288111],"study_design_scores_gemma":[0.0001754946,0.00000553657,0.0009127049,0.000006559818,0.0000507065,0.000001827342,0.0001004284,0.0003616928,0.003239638,0.9162763,0.07873209,0.0001370686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9334357,0.0008535172,0.05440338,0.001018515,0.00002436191,0.0007551499,0.0003890688,0.000343107,0.008777146],"genre_scores_gemma":[0.9875298,0.00004570034,0.009753379,0.0001935624,0.0003244294,0.0004153361,0.0001662552,0.00002855334,0.00154297],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07878581,"threshold_uncertainty_score":0.4889616,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123196525","doi":"10.1016/s0024-3795(00)00086-0","title":"The spread of the spectrum of a graph","year":2001,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":66,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina; Queen's University","funders":"","keywords":"Mathematics; Adjacency matrix; Graph energy; Combinatorics; Eigenvalues and eigenvectors; Graph; Spectrum (functional analysis); Adjacency list; Upper and lower bounds; Discrete mathematics; Line graph; Voltage graph; Mathematical analysis; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02039042805831651,"gpt":0.2779599707815474,"spread":0.2575695427232309,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001843505,0.00007397333,0.0001079904,0.00002546829,0.0002877682,0.000007464312,0.0002862469,0.00003777677,0.00002070716],"category_scores_gemma":[0.00005350546,0.00004223536,0.00008005495,0.0004374198,0.0001832264,0.00002572544,0.00005795109,0.0000856906,0.000006609165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002348106,"about_ca_system_score_gemma":0.00001478077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000504354,"about_ca_topic_score_gemma":0.00002017497,"domain_scores_codex":[0.9993963,0.00003116189,0.0002517338,0.0001128624,0.0001006428,0.000107286],"domain_scores_gemma":[0.9988464,0.0004146401,0.0001610642,0.0004905151,0.00005614743,0.00003128461],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004074879,0.0000726766,0.0002645576,0.00001610626,0.00001853714,1.721935e-8,0.0001074262,9.798492e-7,0.002115481,0.9963734,0.0002013747,0.0008253242],"study_design_scores_gemma":[0.0001086841,0.00001306638,0.001537586,0.00001178249,0.000045789,0.000005655425,0.0001425029,0.0001073015,0.01365403,0.9592873,0.0250316,0.00005465017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9759313,0.0008426873,0.007323488,0.005017943,0.00003648983,0.001343367,0.00006171909,0.00005371882,0.009389323],"genre_scores_gemma":[0.9981571,0.0003437191,0.0004788233,0.00003782496,0.00004227326,0.0001722539,0.000001986188,0.000009859108,0.0007561759],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03708609,"threshold_uncertainty_score":0.2213309,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02096573759637562,"gpt":0.2691860662872015,"spread":0.2482203286908259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000191681,0.00008623548,0.0001031884,0.00005252024,0.0002443535,0.0000766902,0.0002111395,0.00003905766,0.000008247281],"category_scores_gemma":[0.00001465887,0.00007553452,0.00002689315,0.0001701142,0.00003336009,0.0002424131,0.00009960661,0.00004792212,0.00001453247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003696932,"about_ca_system_score_gemma":0.00001389992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005620478,"about_ca_topic_score_gemma":0.000001245142,"domain_scores_codex":[0.9993678,0.00002059847,0.0001537072,0.0002417507,0.00006942845,0.0001467058],"domain_scores_gemma":[0.9994424,0.0001948713,0.00004632311,0.0001904312,0.00004434707,0.00008163813],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004737621,0.00002770247,0.00004539666,0.00004347551,0.00001058121,4.794671e-7,0.0002990579,0.000005683812,0.0001938809,0.9561238,0.0001863674,0.04305887],"study_design_scores_gemma":[0.0007096517,0.0001060206,0.0004862385,0.00001920877,0.0000324074,0.00005955107,0.0002115183,0.1389925,0.0009851892,0.4620647,0.3959575,0.0003754711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02560627,0.004732298,0.965649,0.002772596,0.00004663665,0.0005398032,0.00002471968,0.0001317366,0.00049693],"genre_scores_gemma":[0.7749577,0.007104928,0.2065709,0.002861894,0.001247907,0.001367904,0.00006029242,0.00004161333,0.005786909],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7590781,"threshold_uncertainty_score":0.3080208,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011612721","doi":"10.1016/j.laa.2009.06.015","title":"A survey of automated conjectures in spectral graph theory","year":2009,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":63,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Graph; Eigenvalues and eigenvectors; Spectral graph theory; Graph theory; Voltage graph; Combinatorics; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02818967378203269,"gpt":0.3161277883203332,"spread":0.2879381145383005,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000487533,0.0001161027,0.0002042435,0.0001268604,0.00008221789,0.00001023267,0.0001531452,0.00007607941,0.00004673336],"category_scores_gemma":[0.0001349499,0.0001033384,0.00004138316,0.000606771,0.0000700646,0.00004618839,0.00001579682,0.0001168366,0.00001179268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004992746,"about_ca_system_score_gemma":0.00002231758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001318342,"about_ca_topic_score_gemma":0.00004562532,"domain_scores_codex":[0.9991492,0.0001075767,0.0003112031,0.0002000769,0.00007974259,0.000152188],"domain_scores_gemma":[0.9989436,0.0005506361,0.000103457,0.0002712409,0.00007431691,0.00005679756],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001497574,0.000211743,0.000398121,0.00001868338,0.00001270655,1.993075e-7,0.0002204235,0.000007521359,0.002267827,0.9956827,0.0002134037,0.0009516909],"study_design_scores_gemma":[0.0002867221,0.00004129495,0.08743746,0.00001419762,0.00002216679,0.000003590304,0.00006552223,0.001282328,0.003744311,0.9067329,0.0002371745,0.0001323073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9927539,0.000509971,0.00375747,0.0002316394,0.000008755704,0.000710357,0.0001262827,0.0002254386,0.001676135],"genre_scores_gemma":[0.9982798,0.00005928352,0.00128216,0.00009838,0.00001886631,0.000129066,0.0000453882,0.00001025614,0.00007682415],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08894978,"threshold_uncertainty_score":0.4214019,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01754409141837518,"gpt":0.2878598051876947,"spread":0.2703157137693195,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004551767,0.0001876773,0.0002135017,0.0002299278,0.0003784385,0.0001520441,0.0005381018,0.0001106457,0.00001284219],"category_scores_gemma":[0.00009161385,0.0001617762,0.0000626234,0.001152595,0.00008067231,0.000481283,0.0002238984,0.0001534625,0.0000335776],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003474506,"about_ca_system_score_gemma":0.00009176372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001794831,"about_ca_topic_score_gemma":0.000007550271,"domain_scores_codex":[0.9985005,0.00003797941,0.0003291135,0.0005582119,0.0002008064,0.000373424],"domain_scores_gemma":[0.9983565,0.0007460863,0.0001160103,0.0004141816,0.000124674,0.0002425036],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006042415,0.00005860012,0.00006319908,0.00003332819,0.00001314718,3.895591e-7,0.00005085825,0.00002093791,0.0001548203,0.9467188,0.0001097548,0.05277013],"study_design_scores_gemma":[0.003070658,0.0006709002,0.006637843,0.00005677406,0.0001493435,0.0001495711,0.0002084545,0.6044908,0.00615538,0.2584917,0.1183712,0.001547377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04608469,0.002875953,0.9441533,0.002914358,0.00007876801,0.001256672,0.00009146672,0.0002532169,0.002291577],"genre_scores_gemma":[0.9278139,0.00147761,0.06862281,0.0004055771,0.0003140343,0.0003411225,0.00001775026,0.00001910628,0.0009880511],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8817292,"threshold_uncertainty_score":0.6597041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143176167","doi":"10.1016/j.laa.2015.10.018","title":"Hermitian adjacency spectrum and switching equivalence of mixed graphs","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Hermitian matrix; Combinatorics; Mixed graph; Adjacency matrix; Two-graph; Rank (graph theory); Spectrum (functional analysis); Discrete mathematics; Graph; Pure mathematics; Line graph; Physics; Voltage graph","retraction":null,"screen_n_in":null,"score":{"opus":0.05578229098441052,"gpt":0.3101216922915193,"spread":0.2543394013071087,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002600411,0.0001229251,0.0001789926,0.00007669113,0.0001471042,0.00001709916,0.0001461627,0.00006194752,0.0000162988],"category_scores_gemma":[0.00007388186,0.0001140825,0.00003866048,0.0002909985,0.00008041417,0.0001007811,0.00007195125,0.0001132089,0.00001328465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005102127,"about_ca_system_score_gemma":0.00002522273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006220367,"about_ca_topic_score_gemma":0.00000922248,"domain_scores_codex":[0.9991822,0.00003363514,0.0002703285,0.0002388772,0.0001172773,0.0001576292],"domain_scores_gemma":[0.9991475,0.0001885772,0.0001247118,0.0003038752,0.00007068246,0.0001646182],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004331411,0.00008324997,0.0003261447,0.0000621396,0.00001468689,1.846175e-7,0.0003345168,5.382194e-7,0.003204028,0.9939449,0.0001242457,0.001901016],"study_design_scores_gemma":[0.0002708323,0.00003878901,0.0008386109,0.00002574971,0.00005172402,0.00001415393,0.0003713749,0.0003161053,0.006243427,0.9893798,0.0023058,0.0001436153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9827585,0.0009084007,0.01183453,0.0009948994,0.00002504916,0.0006354881,0.00003958859,0.00009862583,0.002704954],"genre_scores_gemma":[0.9945524,0.0001651244,0.004829893,0.00003952501,0.00004875865,0.0001452975,0.000008360296,0.0000172999,0.0001933079],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01179397,"threshold_uncertainty_score":0.465215,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152162758","doi":"10.1016/s0024-3795(02)00323-3","title":"The complement of the path is determined by its spectrum","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Adjacency matrix; Complement (music); Spectrum (functional analysis); Combinatorics; Path (computing); Graph; Adjacency list; Discrete mathematics; Computer science; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03118045448873361,"gpt":0.275558406971572,"spread":0.2443779524828384,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001436086,0.0001072062,0.000113789,0.00001517271,0.0005835613,0.00002242693,0.0003294493,0.0000374823,0.0001832977],"category_scores_gemma":[0.00003141662,0.00006414943,0.00006865149,0.0002390737,0.0000921535,0.00003205509,0.00008011999,0.0001002505,0.00005027241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006149658,"about_ca_system_score_gemma":0.00000585039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001523946,"about_ca_topic_score_gemma":0.000004894728,"domain_scores_codex":[0.9992188,0.0000366736,0.0002806599,0.0001692943,0.000134337,0.0001602789],"domain_scores_gemma":[0.9989381,0.0003229936,0.0001489454,0.000490221,0.00004868564,0.00005106019],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001432369,0.0001175256,0.00003982481,0.00002038369,0.00002164706,2.117209e-8,0.0002802984,1.695479e-7,0.002849883,0.9819611,0.01341343,0.001294303],"study_design_scores_gemma":[0.0003749168,0.00003870407,0.0003056306,0.00001983334,0.00009636681,0.000006281015,0.0002191974,0.004433302,0.04313388,0.5390035,0.412165,0.0002033627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9047511,0.005558937,0.009859469,0.05351044,0.0001370499,0.007019178,0.001404301,0.0002736054,0.01748597],"genre_scores_gemma":[0.9953751,0.0003428937,0.0003726689,0.0002900654,0.00005589638,0.00040597,0.000006466164,0.00001593546,0.003134998],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4429576,"threshold_uncertainty_score":0.4488341,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064891073","doi":"10.1016/j.laa.2003.08.012","title":"The simplest proof of Burnside's theorem on matrix algebras","year":2003,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Algebraically closed field; Invariant subspace; Pure mathematics; Invariant (physics); Simple (philosophy); Elementary proof; Algebra over a field; Matrix (chemical analysis); Subspace topology; Discrete mathematics; Linear subspace; Mathematical analysis; Mathematical physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02937311205438796,"gpt":0.3314041468443836,"spread":0.3020310347899957,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003312057,0.000175401,0.0002110919,0.00004782833,0.0003410148,0.00002591056,0.0002425779,0.00008776702,0.0000537393],"category_scores_gemma":[0.0006109056,0.0001219633,0.00006568192,0.0002583323,0.0001493463,0.00006040914,0.00005241026,0.0002050892,0.00003324905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001750585,"about_ca_system_score_gemma":0.00004187758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.392483e-7,"about_ca_topic_score_gemma":0.00000508977,"domain_scores_codex":[0.9987943,0.00006859356,0.0004040468,0.0002734151,0.000216454,0.0002431516],"domain_scores_gemma":[0.997667,0.001285254,0.0002069953,0.0006253998,0.000131125,0.0000842387],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005934824,0.00008945433,0.00002451738,0.00003855093,0.00002400246,3.190191e-7,0.00009790664,0.000004899647,0.0003583621,0.9965479,0.0002660887,0.002542],"study_design_scores_gemma":[0.0002137938,0.00005089703,0.00003303659,0.00001536666,0.00002936163,0.00000904122,0.0001243203,0.0001127734,0.02927459,0.8960693,0.0739359,0.0001315847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6854784,0.006435525,0.1962376,0.005940087,0.0004197745,0.008697654,0.0001993657,0.0006181537,0.09597342],"genre_scores_gemma":[0.9806229,0.0002292868,0.01587696,0.0001490861,0.0001590353,0.0003604751,0.000008063334,0.00005672199,0.002537479],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2951445,"threshold_uncertainty_score":0.4973521,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015740796","doi":"10.1016/s0024-3795(02)00307-5","title":"Symmetry property and construction of wavelets with a general dilation matrix","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Dilation (metric space); Pure mathematics; Lattice (music); Wavelet; Symmetry (geometry); Matrix (chemical analysis); Mathematical analysis; Combinatorics; Geometry; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01578237352030831,"gpt":0.2490227104282769,"spread":0.2332403369079686,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001029508,0.00006751964,0.0000930698,0.00005835704,0.000104999,0.00004107387,0.00008793289,0.00003468344,0.000007356817],"category_scores_gemma":[0.00001110925,0.00004463535,0.00001186065,0.0002496182,0.00005291882,0.0002087079,0.00003913778,0.00005545369,0.000005266596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004055426,"about_ca_system_score_gemma":0.000008260264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006375427,"about_ca_topic_score_gemma":4.600423e-7,"domain_scores_codex":[0.9994734,0.00003585895,0.0001256447,0.0001903324,0.000091341,0.00008340463],"domain_scores_gemma":[0.9996174,0.00004320491,0.00005787352,0.0001590659,0.0000774197,0.00004502883],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000164652,0.0000951778,0.0008139928,0.00008866369,0.00003057463,0.000001774633,0.000552184,0.00001400496,0.02563981,0.5925511,0.0001336031,0.3800627],"study_design_scores_gemma":[0.001972683,0.0003755924,0.009019827,0.00006517908,0.00008139416,0.0003945715,0.00004651105,0.8823236,0.0606784,0.02157082,0.02289411,0.0005773655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1155378,0.0007775167,0.881402,0.0005782861,0.00001844393,0.0002936701,0.000003756598,0.00005166228,0.001336858],"genre_scores_gemma":[0.528081,0.0001708349,0.4706017,0.00009309061,0.00007708582,0.00003708421,0.000003432705,0.000007259505,0.0009284597],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8823096,"threshold_uncertainty_score":0.1820177,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994621692","doi":"10.1016/s0024-3795(03)00476-2","title":"Max-algebra and pairwise comparison matrices","year":2003,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"University of Victoria","keywords":"Mathematics; Eigenvalues and eigenvectors; Transitive relation; Reciprocal; Ranking (information retrieval); Matrix (chemical analysis); Pairwise comparison; Linear algebra; Measure (data warehouse); Combinatorics; Generalized eigenvector; Symmetric matrix; Statistics; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.1147421302884672,"gpt":0.4074115333315407,"spread":0.2926694030430735,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001266979,0.0002112552,0.0003705091,0.0002888999,0.0004518944,0.0004631063,0.0004384476,0.0001211511,0.0006346368],"category_scores_gemma":[0.001048923,0.0001665107,0.00006541806,0.0009138294,0.0001079582,0.0003297974,0.0001687417,0.0001794244,0.0007305442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001241522,"about_ca_system_score_gemma":0.00003856041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006299903,"about_ca_topic_score_gemma":0.000009486846,"domain_scores_codex":[0.99731,0.0001672768,0.0007876105,0.0007402795,0.0007054791,0.0002893455],"domain_scores_gemma":[0.9971849,0.001365313,0.0002613822,0.0006591824,0.0002636661,0.0002655492],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004812331,0.0004996647,0.02948142,0.00005543676,0.00005884625,0.000007352962,0.001856395,0.00007585649,0.005859104,0.6216754,0.02019976,0.3201826],"study_design_scores_gemma":[0.0007988047,0.00006120253,0.01439473,0.00002232427,0.00004535737,0.00004697343,0.001078103,0.02532906,0.001833273,0.07447384,0.8814306,0.0004857485],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8809639,0.009839976,0.09596217,0.001795497,0.0002673403,0.001395474,0.00009202709,0.0002169047,0.009466776],"genre_scores_gemma":[0.9827075,0.0002450757,0.01495137,0.0003857906,0.0001192759,0.0001098078,0.000007890372,0.00002299957,0.001450306],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8612309,"threshold_uncertainty_score":0.9389911,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075893026","doi":"10.1016/j.laa.2005.03.021","title":"Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming","year":2005,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Euclidean distance matrix; Euclidean distance; Semidefinite programming; Distance matrix; Matrix norm; Matrix (chemical analysis); Euclidean geometry; Matrix completion; Large margin nearest neighbor; Diagonal; Mathematical optimization; Combinatorics; Applied mathematics; k-nearest neighbors algorithm; Computer science; Eigenvalues and eigenvectors; Geometry; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.07301771218730009,"gpt":0.3652212376610858,"spread":0.2922035254737858,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002312758,0.0001400171,0.0001814285,0.00008420064,0.0003673739,0.00008721185,0.00009337895,0.00005938067,0.00001203534],"category_scores_gemma":[0.0001012785,0.000133369,0.00002846291,0.0002701054,0.00006248055,0.0002344832,0.00005934989,0.0001037312,0.000004575791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003148125,"about_ca_system_score_gemma":0.00001759791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001790092,"about_ca_topic_score_gemma":0.000006259411,"domain_scores_codex":[0.9989609,0.000021009,0.000304289,0.0003118579,0.0001515945,0.0002504252],"domain_scores_gemma":[0.9991054,0.000290167,0.000148939,0.0001793564,0.0001737293,0.0001023908],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005445025,0.0006043729,0.0005708682,0.002383465,0.0001055112,6.042231e-7,0.001410026,0.005644402,0.003918587,0.7837479,0.0002266023,0.2013332],"study_design_scores_gemma":[0.0005991286,0.00003754332,0.00003210973,0.00006031579,0.00004490849,0.000014362,0.0001290804,0.898268,0.0004528241,0.02415434,0.07594686,0.0002604956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0118476,0.0009352426,0.9844614,0.0003945955,0.000007410668,0.0020298,0.00006742324,0.0001337224,0.0001228083],"genre_scores_gemma":[0.0499477,0.0005115562,0.9479952,0.00004952112,0.0001910424,0.0008187499,0.00008486923,0.0000534156,0.0003479001],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8926236,"threshold_uncertainty_score":0.5438632,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038304857","doi":"10.1016/j.laa.2012.04.033","title":"Sparse nonnegative matrix underapproximation and its application to hyperspectral image analysis","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Remote-Sensing Image Classification","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Hyperspectral imaging; Non-negative matrix factorization; Interpretability; Principal component analysis; Dimensionality reduction; Pattern recognition (psychology); Matrix decomposition; Constraint (computer-aided design); Artificial intelligence; Matrix (chemical analysis); Mathematics; Sparse matrix; Image (mathematics); Curse of dimensionality; Sparse PCA; Computer science; Feature extraction; Nonnegative matrix; Symmetric matrix; Eigenvalues and eigenvectors","retraction":null,"screen_n_in":null,"score":{"opus":0.01359840595848155,"gpt":0.2617552126817133,"spread":0.2481568067232318,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001469246,0.0001796353,0.0001963675,0.0002474996,0.0001571921,0.00006155692,0.00008549828,0.00008993509,0.0000137278],"category_scores_gemma":[0.00003181686,0.0001903377,0.00004561475,0.0009224757,0.00002875964,0.0003789181,0.00002913982,0.0001232992,0.0001971929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006216647,"about_ca_system_score_gemma":0.000008334026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000486618,"about_ca_topic_score_gemma":0.000005336276,"domain_scores_codex":[0.9990472,0.00002324612,0.00025467,0.0002834611,0.0001319414,0.0002594652],"domain_scores_gemma":[0.9992704,0.00006688821,0.00005944071,0.0002739955,0.0001169987,0.0002123192],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001858801,0.0002078524,0.0006982918,0.0002223884,0.0005224706,3.800624e-7,0.003402996,0.004697083,0.8693795,0.09790371,0.0003598643,0.02258694],"study_design_scores_gemma":[0.0002928251,0.00002259139,0.02088247,0.00001029479,0.0004937437,0.00001167096,0.0003681477,0.9062333,0.06543916,0.0008287875,0.004919787,0.0004972272],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4008681,0.001038476,0.5946023,0.0007681891,0.00003409496,0.001156202,0.00004153505,0.0003398737,0.001151315],"genre_scores_gemma":[0.9760533,0.0001861645,0.02303148,0.00005339216,0.0002014252,0.000185458,0.0001137229,0.00003583235,0.00013922],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9015362,"threshold_uncertainty_score":0.7761745,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02759485612494702,"gpt":0.3009326329486045,"spread":0.2733377768236575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001804777,0.00009644755,0.0001034732,0.00004343332,0.0002016304,0.00005072821,0.0002442286,0.00004731455,0.00002677498],"category_scores_gemma":[0.00003122337,0.0000802494,0.00003185977,0.0002000567,0.0000292653,0.0004570674,0.0001021868,0.00005631559,0.00006238079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000590918,"about_ca_system_score_gemma":0.00001798297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001635538,"about_ca_topic_score_gemma":2.992777e-7,"domain_scores_codex":[0.99939,0.00002825779,0.0001368979,0.0001743921,0.00006897045,0.0002014651],"domain_scores_gemma":[0.9993798,0.0002061936,0.00006435122,0.0001828315,0.00007137914,0.00009540199],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000006845203,0.0000626879,0.0002242382,0.00004117901,0.000013363,1.07955e-7,0.001396904,6.341684e-7,0.0005150695,0.9784855,0.0001981108,0.01905535],"study_design_scores_gemma":[0.001384449,0.0005064942,0.006180359,0.00006783185,0.0001295114,0.00005660525,0.001476186,0.07277466,0.06541739,0.1200203,0.7304484,0.00153783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.127544,0.00347189,0.8639867,0.000701842,0.0002371988,0.001061867,0.00009231509,0.0002101471,0.002694057],"genre_scores_gemma":[0.9588217,0.0001263613,0.0380656,0.0002129557,0.0005236958,0.0003564291,0.00002254784,0.00001294312,0.00185773],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8584652,"threshold_uncertainty_score":0.3272475,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147881902","doi":"10.1016/j.laa.2008.10.007","title":"Coefficients of ergodicity and the scrambling index","year":2008,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Digraph; Scrambling; Mathematics; Combinatorics; Upper and lower bounds; Eigenvalues and eigenvectors; Vertex (graph theory); Majorization; Integer (computer science); Multipartite; Discrete mathematics; Ergodicity; Mathematical analysis; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.03481283323268161,"gpt":0.295501362935932,"spread":0.2606885297032504,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001868153,0.00008293916,0.0001785343,0.00003993998,0.0003520384,0.00001172049,0.0001180373,0.0000459194,0.00001279738],"category_scores_gemma":[0.00007240393,0.00005536408,0.0000373218,0.0002559011,0.0002241647,0.00003948695,0.00005981089,0.00009173921,0.000007081817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003230802,"about_ca_system_score_gemma":0.00001675145,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001732584,"about_ca_topic_score_gemma":0.000002759305,"domain_scores_codex":[0.9993505,0.00002265343,0.0002483979,0.0001544389,0.0001228424,0.0001011071],"domain_scores_gemma":[0.9990634,0.0004582635,0.0001190226,0.0002240329,0.00008304365,0.0000522608],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004084253,0.0001591069,0.000806732,0.00007530449,0.00003318412,1.760579e-7,0.0007327552,0.00001380283,0.0003168842,0.9955021,0.0003652666,0.001953834],"study_design_scores_gemma":[0.02307427,0.0001514018,0.02090544,0.0001367086,0.0007253672,0.0002545037,0.001509578,0.1819044,0.008061826,0.6483076,0.1136952,0.001273777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8749519,0.001184095,0.1192549,0.001000211,0.00001323617,0.001209546,0.00003021367,0.00006044879,0.002295503],"genre_scores_gemma":[0.9966062,0.0006636019,0.002111801,0.00007957983,0.00006157046,0.0001832617,0.000004345222,0.00001031081,0.0002793329],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3471946,"threshold_uncertainty_score":0.270763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098334461","doi":"10.1016/j.laa.2004.06.003","title":"Spectrally and inertially arbitrary sign patterns","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Mathematics and Applications","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Redeemer University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sign (mathematics); Mathematics; Class (philosophy); Order (exchange); Inertia; Spectrum (functional analysis); Mathematical analysis; Physics; Computer science; Classical mechanics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02739573953427547,"gpt":0.2888283380878651,"spread":0.2614325985535896,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001036535,0.0001546932,0.0001784571,0.00005318374,0.0001949576,0.00005077937,0.0001333769,0.00007281026,0.00005394219],"category_scores_gemma":[0.00003191909,0.0001384865,0.00003736008,0.000141313,0.00004269626,0.00007882684,0.0000627221,0.0001332857,0.00004306683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001107261,"about_ca_system_score_gemma":0.00003498475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008807016,"about_ca_topic_score_gemma":0.00001712999,"domain_scores_codex":[0.9991235,0.000009353533,0.0002875334,0.0002778489,0.0001208399,0.0001809638],"domain_scores_gemma":[0.9993214,0.0001260911,0.00008918999,0.000296877,0.00005044596,0.0001159659],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001877974,0.0001828383,0.00005112892,0.000123627,0.00002281352,8.334592e-7,0.00030917,0.000001994622,0.002664891,0.9949303,0.000382289,0.001328251],"study_design_scores_gemma":[0.0007824554,0.00007060903,0.001127729,0.00006713632,0.0001046327,0.00005261231,0.0001483445,0.0008766961,0.006355152,0.9672254,0.02275006,0.0004391236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7447246,0.0005741119,0.2378343,0.00575649,0.00002481426,0.001975483,0.0001276849,0.0003444944,0.008638006],"genre_scores_gemma":[0.9405949,0.0004019158,0.05717377,0.0004902121,0.000231236,0.0004962137,0.00002962524,0.00004497834,0.0005371587],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1958703,"threshold_uncertainty_score":0.5647315,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087638833","doi":"10.1016/j.laa.2011.11.015","title":"Bipartiteness and the least eigenvalue of signless Laplacian of graphs","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Algebraic connectivity; Social connectedness; Vertex (graph theory); Eigenvalues and eigenvectors; Simple graph; Graph; Discrete mathematics; Laplace operator; Laplacian matrix; Algebraic number; Mathematical analysis; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03119739482223361,"gpt":0.2938382310710607,"spread":0.2626408362488271,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004065551,0.00009276081,0.0001989864,0.0000512262,0.0001570509,0.000006533367,0.0001281318,0.00005226722,0.00002066803],"category_scores_gemma":[0.00004558295,0.00006415848,0.00005279169,0.0002806295,0.0003148163,0.00007049191,0.0000492002,0.00007181273,0.00000546056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001557439,"about_ca_system_score_gemma":0.000009433559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000509096,"about_ca_topic_score_gemma":0.000002374108,"domain_scores_codex":[0.9993338,0.00005736382,0.000274191,0.0001133938,0.0000898076,0.0001314613],"domain_scores_gemma":[0.9989713,0.0004414144,0.0001579836,0.0002842049,0.00007583499,0.00006923317],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001317051,0.0001190184,0.0008431302,0.00008423513,0.00002605467,8.344308e-9,0.0006759047,7.435715e-7,0.003088253,0.9943444,0.0000339032,0.0007711484],"study_design_scores_gemma":[0.0007681824,0.00002062158,0.003266198,0.00002799276,0.0002057923,0.000008381716,0.0008314188,0.0003368092,0.02862522,0.9608735,0.004873994,0.0001619201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9881597,0.001655099,0.007127074,0.0003954919,0.00001661097,0.0008405059,0.00007312879,0.00003034842,0.001702063],"genre_scores_gemma":[0.9982165,0.0001464306,0.001164714,0.000036061,0.00004314972,0.0002678471,0.000007110528,0.00001182165,0.0001063559],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03347096,"threshold_uncertainty_score":0.2616307,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044994579","doi":"10.1016/j.laa.2010.01.027","title":"Bounds and conjectures for the signless Laplacian index of graphs","year":2010,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Combinatorics; Independence number; Vertex (graph theory); Algebraic number; Clique number; Upper and lower bounds; Spectral radius; Graph; Laplace operator; Domination analysis; Discrete mathematics; Eigenvalues and eigenvectors","retraction":null,"screen_n_in":null,"score":{"opus":0.01986102366113922,"gpt":0.3019934772289365,"spread":0.2821324535677973,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001984255,0.00009365407,0.0001250275,0.00004318619,0.0003491532,0.00002494881,0.0001483337,0.00007949014,0.00001963435],"category_scores_gemma":[0.00006823691,0.00006550728,0.00004464577,0.0001577301,0.0002013543,0.00003694899,0.00003222776,0.0001354268,0.000001693411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":9.579975e-7,"about_ca_system_score_gemma":0.00001501779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003796123,"about_ca_topic_score_gemma":0.00004202417,"domain_scores_codex":[0.9994801,0.00001140296,0.000179315,0.0001595776,0.00006183026,0.0001077804],"domain_scores_gemma":[0.9986023,0.0008875849,0.00009288014,0.0002789891,0.00008532096,0.00005290223],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006564256,0.00004618728,0.000155026,0.00004442285,0.00002492748,1.224358e-8,0.0002082075,3.684342e-7,0.006641278,0.9899953,0.0002140036,0.002663697],"study_design_scores_gemma":[0.0002475064,0.00002024197,0.00114525,0.00000475337,0.00007293716,0.000005065193,0.0001933334,0.00083808,0.005507178,0.9595096,0.03236006,0.00009603221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9489784,0.0005815632,0.04487905,0.001891911,0.00005001983,0.002180222,0.0002136498,0.00008182232,0.001143333],"genre_scores_gemma":[0.9964525,0.00006353772,0.002405996,0.0001100582,0.00006780555,0.0007120042,0.00001072606,0.00001413739,0.0001632474],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04747406,"threshold_uncertainty_score":0.268544,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091452762","doi":"10.1016/j.laa.2009.05.027","title":"Eigenvalues and colorings of digraphs","year":2009,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Algebra over a field; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01563529270880379,"gpt":0.2878938864303953,"spread":0.2722585937215916,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001029387,0.00006162508,0.00008961018,0.00008059211,0.0001090768,0.00002373188,0.0002374674,0.00002752616,0.00000254875],"category_scores_gemma":[0.00001589143,0.0000559351,0.00001806783,0.00036266,0.00006656185,0.0001879106,0.00007629134,0.00006496363,0.000005453152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000243704,"about_ca_system_score_gemma":0.00001158755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001145373,"about_ca_topic_score_gemma":4.135636e-7,"domain_scores_codex":[0.9994394,0.00001459477,0.0001141229,0.0002084935,0.0001003458,0.0001230768],"domain_scores_gemma":[0.9995113,0.00007663672,0.00003771404,0.000236743,0.00006025824,0.00007736588],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002169151,0.00002694736,0.0001356784,0.000006782992,0.000003662495,1.80211e-7,0.0001076552,0.000002174509,0.006854734,0.9689726,0.000009986931,0.02387743],"study_design_scores_gemma":[0.0004022941,0.0003018126,0.01993427,0.00001707817,0.00001095637,0.00001558585,0.00005758777,0.008694501,0.04926356,0.9038986,0.01715317,0.0002505811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6041752,0.004415145,0.3820895,0.002646355,0.00001669,0.0009015144,0.00001441572,0.0002005898,0.005540664],"genre_scores_gemma":[0.9854071,0.0004645267,0.01382958,0.0001141091,0.00001497356,0.00003469023,0.000001503927,0.0000032397,0.000130315],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3812319,"threshold_uncertainty_score":0.2280967,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007704871102420895,"gpt":0.2784824719703337,"spread":0.2707776008679127,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008274179,0.00006802635,0.00008815702,0.00005510136,0.00009938936,0.0000308194,0.0001452843,0.00003420158,0.000007018554],"category_scores_gemma":[0.000005725513,0.00006102241,0.00001937607,0.0001613328,0.00001891151,0.0001247311,0.00003287949,0.00005606312,0.00001768599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003222837,"about_ca_system_score_gemma":0.000008710952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.525215e-7,"about_ca_topic_score_gemma":1.299206e-7,"domain_scores_codex":[0.9995109,0.00001564744,0.0001281849,0.0001868704,0.00007251971,0.0000858144],"domain_scores_gemma":[0.9996129,0.00005200242,0.0000501639,0.0001921606,0.000032438,0.0000603849],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003413368,0.00005516385,0.000005494424,0.000008488209,0.000002907812,2.820553e-7,0.00006763147,0.00001025303,0.002337328,0.9685463,0.00004851004,0.02891425],"study_design_scores_gemma":[0.001055994,0.0007852129,0.006784166,0.00006753231,0.0000332317,0.00006228313,0.00002744897,0.1463647,0.03816465,0.7930622,0.01311883,0.000473739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2433823,0.0008022728,0.750293,0.002836872,0.00003395371,0.0004789887,0.00001200241,0.0001195707,0.00204112],"genre_scores_gemma":[0.9819725,0.00008470217,0.01737478,0.00032261,0.00005392633,0.00001749533,0.000004071899,0.000003006186,0.0001669773],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7385901,"threshold_uncertainty_score":0.2488421,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104089751","doi":"10.1016/j.laa.2012.12.026","title":"Stability of linear gyroscopic systems: A review","year":2013,"lang":"en","type":"review","venue":"Linear Algebra and its Applications","topic":"Elasticity and Wave Propagation","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Alexander von Humboldt-Stiftung","keywords":"Controllability; Mathematical proof; Mathematics; Algebraic number; Perturbation (astronomy); Section (typography); Gyroscope; Linear system; Invariant (physics); Applied mathematics; Calculus (dental); Mathematical analysis; Computer science; Geometry; Physics; Mathematical physics","retraction":null,"screen_n_in":null,"score":{"opus":0.04272817626277543,"gpt":0.2930933825567797,"spread":0.2503652062940043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001638916,0.0002686492,0.00103409,0.00006651496,0.00006351349,0.00001560771,0.0001779754,0.0002065446,0.0000652511],"category_scores_gemma":[0.00005252477,0.0002241141,0.0001319852,0.0003310394,0.00003774143,0.00008111184,0.00004438513,0.000277387,0.0002441182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003224061,"about_ca_system_score_gemma":0.00005039493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005000182,"about_ca_topic_score_gemma":6.821592e-7,"domain_scores_codex":[0.9986544,0.00005894033,0.0007490398,0.0002537824,0.0001257554,0.0001581166],"domain_scores_gemma":[0.9990472,0.0001674195,0.0001783406,0.000391669,0.0001241517,0.00009125132],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"systematic_review","study_design_gemma":"not_applicable","study_design_scores_codex":[2.798803e-7,0.00005950397,0.000001088739,0.5990864,0.0001530231,1.799409e-7,0.00002873767,0.00002091462,0.00002276087,0.008236645,0.0005436417,0.3918468],"study_design_scores_gemma":[0.00004203456,0.00001651108,5.487189e-7,0.01739643,0.0005027229,0.000005446265,0.000003696611,0.002592568,0.00003412271,0.00004211298,0.9791405,0.0002232994],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.000009235922,0.9897493,0.006672401,0.00001147933,0.00007016529,0.002775827,0.0001619973,0.0001248937,0.0004246674],"genre_scores_gemma":[0.00005503451,0.997488,0.0004494248,0.00001135919,0.000166667,0.001499548,0.0002118027,0.00004444899,0.00007375371],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9785969,"threshold_uncertainty_score":0.9139106,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}